Skip to main navigation Skip to search Skip to main content

Iterative decoding of multi-dimensional concatenated single parity check codes

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

Abstract

This paper is concerned with the decoding technique and performance of multi-dimensional concatenated single-parity-check (SPC) code. A very efficient sub-optimal soft-in-soft-out decoding rule is presented for the SPC code, costing only 3 addition-equivalent-operations per information bit. Multi-dimensional concatenated coding and decoding principles are investigated. Simulation results of rate 5/6 and 4/5 3-dimensional concatenated SPC codes are provided. Performance of BER = 10-4 ∼ 10-5 can be achieved by the MAP and Max-Log-MAP decoders, respectively, with Eb/N0 only 1 and 1.5 dB away from the theoretical limits. © 1998 IEEE.
Original languageEnglish
Title of host publicationICC '98 - 1998 IEEE International Conference on Communications.
Subtitle of host publicationConference Record
PublisherIEEE
Pages131-135
Volume1
ISBN (Print)0-7803-4788-9
DOIs
Publication statusPublished - Jun 1998
Event1998 IEEE International Conference on Communications (ICC '98) - Atlanta, GA, United States
Duration: 7 Jun 1998 → 11 Jun 1998

Publication series

NameIEEE International Conference on Communications

Conference

Conference1998 IEEE International Conference on Communications (ICC '98)
PlaceUnited States
CityAtlanta, GA
Period7/06/98 → 11/06/98

Fingerprint

Dive into the research topics of 'Iterative decoding of multi-dimensional concatenated single parity check codes'. Together they form a unique fingerprint.

Cite this