Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/70775
DC FieldValue
dc.titleLDPC product codes
dc.contributor.authorQi, Z.
dc.contributor.authorSum, N.C.
dc.date.accessioned2014-06-19T03:16:05Z
dc.date.available2014-06-19T03:16:05Z
dc.date.issued2004
dc.identifier.citationQi, Z.,Sum, N.C. (2004). LDPC product codes. 2004 9th IEEE Singapore International Conference on Communication Systems, ICCS : 481-483. ScholarBank@NUS Repository.
dc.identifier.isbn0780385497
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/70775
dc.description.abstractLow-density parity-check (LDPC) codes are well known for their abilities to achieve near Shannon channel capacity limit and low decoding complexity compared with the Turbo decoder. However, their encoding complexities grow with the square of the code length. In this paper, we proposed a type of LDPC product codes, which can significantly lower the encoding complexity at the expense of slight degradation in error-rate performance as well as slight. increase in decoding complexity.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitle2004 9th IEEE Singapore International Conference on Communication Systems, ICCS
dc.description.page481-483
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.