Fast and reduced-complexity decoding rule for q-ary LDPC codes by using the duality properties

Alaa Ghaith, Joseph Boutros, Yuan Wu Yi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The paper studies symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for non binary codes over an extension field GF(q). This decoding rule minimizes the probability of symbol error over a time-discrete memory less channel by employing the dual code. It is shown that these algorithms meet all requirements needed for iterative decoding as the output of the decoder can be split into three independent estimates: soft channel value, a priori term and extrinsic value. It represents a better form of coding for the Q-ary LDPC codes, which have been shown to outperform binary LDPC codes and Reed-Solomon codes on the AWGN channel and it gives us a new fast and reduced-complexity decoding algorithm. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Finally, we see that complexity is reduced by using the dual code, and the algorithm is accelerated by using the Fast Hadamard Transform (FHT). Examples are given for both single parity check (non iterative case) and LDPC (iterative case) non binary codes.

Original languageEnglish
Title of host publicationIEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006
Pages221-228
Number of pages8
DOIs
Publication statusPublished - 1 Dec 2006
Externally publishedYes
EventIEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006 - Montreal, QC, United States
Duration: 19 Jun 200621 Jun 2006

Other

OtherIEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006
CountryUnited States
CityMontreal, QC
Period19/6/0621/6/06

Fingerprint

Binary codes
Decoding
Hadamard transforms
Reed-Solomon codes
Iterative decoding
Data storage equipment

Keywords

  • A posteriori probability (APP)
  • Dual codes
  • Fast Hadamard Transform (FHT)
  • Iterative decoding
  • Low Density Parity Check (LDPC) codes
  • Single Parity Check (SPC) codes

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Ghaith, A., Boutros, J., & Yi, Y. W. (2006). Fast and reduced-complexity decoding rule for q-ary LDPC codes by using the duality properties. In IEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006 (pp. 221-228). [1696346] https://doi.org/10.1109/WIMOB.2006.1696346

Fast and reduced-complexity decoding rule for q-ary LDPC codes by using the duality properties. / Ghaith, Alaa; Boutros, Joseph; Yi, Yuan Wu.

IEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006. 2006. p. 221-228 1696346.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ghaith, A, Boutros, J & Yi, YW 2006, Fast and reduced-complexity decoding rule for q-ary LDPC codes by using the duality properties. in IEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006., 1696346, pp. 221-228, IEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006, Montreal, QC, United States, 19/6/06. https://doi.org/10.1109/WIMOB.2006.1696346
Ghaith A, Boutros J, Yi YW. Fast and reduced-complexity decoding rule for q-ary LDPC codes by using the duality properties. In IEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006. 2006. p. 221-228. 1696346 https://doi.org/10.1109/WIMOB.2006.1696346
Ghaith, Alaa ; Boutros, Joseph ; Yi, Yuan Wu. / Fast and reduced-complexity decoding rule for q-ary LDPC codes by using the duality properties. IEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006. 2006. pp. 221-228
@inproceedings{52b242a72b5d404e829d86dd4073119b,
title = "Fast and reduced-complexity decoding rule for q-ary LDPC codes by using the duality properties",
abstract = "The paper studies symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for non binary codes over an extension field GF(q). This decoding rule minimizes the probability of symbol error over a time-discrete memory less channel by employing the dual code. It is shown that these algorithms meet all requirements needed for iterative decoding as the output of the decoder can be split into three independent estimates: soft channel value, a priori term and extrinsic value. It represents a better form of coding for the Q-ary LDPC codes, which have been shown to outperform binary LDPC codes and Reed-Solomon codes on the AWGN channel and it gives us a new fast and reduced-complexity decoding algorithm. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Finally, we see that complexity is reduced by using the dual code, and the algorithm is accelerated by using the Fast Hadamard Transform (FHT). Examples are given for both single parity check (non iterative case) and LDPC (iterative case) non binary codes.",
keywords = "A posteriori probability (APP), Dual codes, Fast Hadamard Transform (FHT), Iterative decoding, Low Density Parity Check (LDPC) codes, Single Parity Check (SPC) codes",
author = "Alaa Ghaith and Joseph Boutros and Yi, {Yuan Wu}",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/WIMOB.2006.1696346",
language = "English",
isbn = "1424404940",
pages = "221--228",
booktitle = "IEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006",

}

TY - GEN

T1 - Fast and reduced-complexity decoding rule for q-ary LDPC codes by using the duality properties

AU - Ghaith, Alaa

AU - Boutros, Joseph

AU - Yi, Yuan Wu

PY - 2006/12/1

Y1 - 2006/12/1

N2 - The paper studies symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for non binary codes over an extension field GF(q). This decoding rule minimizes the probability of symbol error over a time-discrete memory less channel by employing the dual code. It is shown that these algorithms meet all requirements needed for iterative decoding as the output of the decoder can be split into three independent estimates: soft channel value, a priori term and extrinsic value. It represents a better form of coding for the Q-ary LDPC codes, which have been shown to outperform binary LDPC codes and Reed-Solomon codes on the AWGN channel and it gives us a new fast and reduced-complexity decoding algorithm. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Finally, we see that complexity is reduced by using the dual code, and the algorithm is accelerated by using the Fast Hadamard Transform (FHT). Examples are given for both single parity check (non iterative case) and LDPC (iterative case) non binary codes.

AB - The paper studies symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for non binary codes over an extension field GF(q). This decoding rule minimizes the probability of symbol error over a time-discrete memory less channel by employing the dual code. It is shown that these algorithms meet all requirements needed for iterative decoding as the output of the decoder can be split into three independent estimates: soft channel value, a priori term and extrinsic value. It represents a better form of coding for the Q-ary LDPC codes, which have been shown to outperform binary LDPC codes and Reed-Solomon codes on the AWGN channel and it gives us a new fast and reduced-complexity decoding algorithm. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Finally, we see that complexity is reduced by using the dual code, and the algorithm is accelerated by using the Fast Hadamard Transform (FHT). Examples are given for both single parity check (non iterative case) and LDPC (iterative case) non binary codes.

KW - A posteriori probability (APP)

KW - Dual codes

KW - Fast Hadamard Transform (FHT)

KW - Iterative decoding

KW - Low Density Parity Check (LDPC) codes

KW - Single Parity Check (SPC) codes

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

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

U2 - 10.1109/WIMOB.2006.1696346

DO - 10.1109/WIMOB.2006.1696346

M3 - Conference contribution

SN - 1424404940

SN - 9781424404940

SP - 221

EP - 228

BT - IEEE International Conference on Wireless and Mobile Computing, Networking and Communications 2006, WiMob 2006

ER -