Block-LDPC Codes vs Duo-Binary Turbo-Codes for European Next Generation Wireless Systems
Authors:
- Thierry LestableTLThierry Lestable
- Ernesto ZimmermanEZErnesto Zimmerman
- Marie-Helene HamonMHMarie-Helene Hamon
- Stephan StiglmayrSSStephan Stiglmayr
- 1 September 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10903038,p. 1-5
Abstract
In this paper, we investigate the performance-complexity trade-off for two leading-edge channel coding techniques, namely duo-binary turbo-codes (DBTC) and block LDPC codes (BLDPCC). We assess their respective decoding complexity in terms power consumption and cycle delays, as a function of both the code rate and packet length, to derive a domain of suitability for both techniques. We also compare their capabilities to serve as mother codes for rate-compatible punctured codes (RCPC) and finally analyze their achievable throughput, as a function of the degree of parallelism.Keywords
This publication has 5 references indexed in Scilit:
- A combining method of quasi-cyclic LDPC codes by the Chinese remainder theoremIEEE Communications Letters, 2005
- Turbo Codes With Rate-$m/(m+ 1)$Constituent Convolutional CodesIEEE Transactions on Communications, 2005
- Quasi-cyclic LDPC codes for fast encodingIEEE Transactions on Information Theory, 2005
- Block-LDPC: a practical LDPC coding system design approachIEEE Transactions on Circuits and Systems I: Regular Papers, 2005
- Near optimum universal belief propagation based decoding of low-density parity check codesIEEE Transactions on Communications, 2002