Low complexity log-likelihood ratio calculation scheme with bit shifts and summations

Takayoshi Aoki, Keita Matsugi, Yukitoshi Sanada

Research output: Contribution to journalArticle

Abstract

This paper presents an approximated log-likelihood ratio calculation scheme with bit shifts and summations. Our previous work yielded a metric calculation scheme that replaces multiplications with bit shifts and summations in the selection of candidate signal points for joint maximum likelihood detection (MLD). Log-likelihood ratio calculation for turbo decoding generally uses multiplications and by replacing them with bit shifts and summations it is possible to reduce the numbers of logic operations under specific transmission parameters. In this paper, an approximated log-likelihood ratio calculation scheme that substitutes bit shifts and summations for multiplications is proposed. In the proposed scheme, additions are used only for higher-order bits. Numerical results obtained through computer simulation show that this scheme can eliminate multiplications in turbo decoding at the cost of just 0:2 dB performance degradation at a BER of 10-4.

Original languageEnglish
Pages (from-to)731-739
Number of pages9
JournalIEICE Transactions on Communications
VolumeE101B
Issue number3
DOIs
Publication statusPublished - 2018 Mar 1

Fingerprint

Decoding
Maximum likelihood
Degradation
Computer simulation

Keywords

  • Approximated log-likelihood ratio
  • Turbo decoding

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Low complexity log-likelihood ratio calculation scheme with bit shifts and summations. / Aoki, Takayoshi; Matsugi, Keita; Sanada, Yukitoshi.

In: IEICE Transactions on Communications, Vol. E101B, No. 3, 01.03.2018, p. 731-739.

Research output: Contribution to journalArticle

@article{0157dd8021d04a9d90acf70d867c781d,
title = "Low complexity log-likelihood ratio calculation scheme with bit shifts and summations",
abstract = "This paper presents an approximated log-likelihood ratio calculation scheme with bit shifts and summations. Our previous work yielded a metric calculation scheme that replaces multiplications with bit shifts and summations in the selection of candidate signal points for joint maximum likelihood detection (MLD). Log-likelihood ratio calculation for turbo decoding generally uses multiplications and by replacing them with bit shifts and summations it is possible to reduce the numbers of logic operations under specific transmission parameters. In this paper, an approximated log-likelihood ratio calculation scheme that substitutes bit shifts and summations for multiplications is proposed. In the proposed scheme, additions are used only for higher-order bits. Numerical results obtained through computer simulation show that this scheme can eliminate multiplications in turbo decoding at the cost of just 0:2 dB performance degradation at a BER of 10-4.",
keywords = "Approximated log-likelihood ratio, Turbo decoding",
author = "Takayoshi Aoki and Keita Matsugi and Yukitoshi Sanada",
year = "2018",
month = "3",
day = "1",
doi = "10.1587/transcom.2017EBP3180",
language = "English",
volume = "E101B",
pages = "731--739",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "3",

}

TY - JOUR

T1 - Low complexity log-likelihood ratio calculation scheme with bit shifts and summations

AU - Aoki, Takayoshi

AU - Matsugi, Keita

AU - Sanada, Yukitoshi

PY - 2018/3/1

Y1 - 2018/3/1

N2 - This paper presents an approximated log-likelihood ratio calculation scheme with bit shifts and summations. Our previous work yielded a metric calculation scheme that replaces multiplications with bit shifts and summations in the selection of candidate signal points for joint maximum likelihood detection (MLD). Log-likelihood ratio calculation for turbo decoding generally uses multiplications and by replacing them with bit shifts and summations it is possible to reduce the numbers of logic operations under specific transmission parameters. In this paper, an approximated log-likelihood ratio calculation scheme that substitutes bit shifts and summations for multiplications is proposed. In the proposed scheme, additions are used only for higher-order bits. Numerical results obtained through computer simulation show that this scheme can eliminate multiplications in turbo decoding at the cost of just 0:2 dB performance degradation at a BER of 10-4.

AB - This paper presents an approximated log-likelihood ratio calculation scheme with bit shifts and summations. Our previous work yielded a metric calculation scheme that replaces multiplications with bit shifts and summations in the selection of candidate signal points for joint maximum likelihood detection (MLD). Log-likelihood ratio calculation for turbo decoding generally uses multiplications and by replacing them with bit shifts and summations it is possible to reduce the numbers of logic operations under specific transmission parameters. In this paper, an approximated log-likelihood ratio calculation scheme that substitutes bit shifts and summations for multiplications is proposed. In the proposed scheme, additions are used only for higher-order bits. Numerical results obtained through computer simulation show that this scheme can eliminate multiplications in turbo decoding at the cost of just 0:2 dB performance degradation at a BER of 10-4.

KW - Approximated log-likelihood ratio

KW - Turbo decoding

UR - http://www.scopus.com/inward/record.url?scp=85042638031&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85042638031&partnerID=8YFLogxK

U2 - 10.1587/transcom.2017EBP3180

DO - 10.1587/transcom.2017EBP3180

M3 - Article

AN - SCOPUS:85042638031

VL - E101B

SP - 731

EP - 739

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 3

ER -