Please use this identifier to cite or link to this item:
|Title:||LDPC product codes||Authors:||Qi, Z.
|Issue Date:||2004||Citation:||Qi, Z.,Sum, N.C. (2004). LDPC product codes. 2004 9th IEEE Singapore International Conference on Communication Systems, ICCS : 481-483. ScholarBank@NUS Repository.||Abstract:||Low-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.||Source Title:||2004 9th IEEE Singapore International Conference on Communication Systems, ICCS||URI:||http://scholarbank.nus.edu.sg/handle/10635/70775||ISBN:||0780385497|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.