Bounding performance of LDPC codes and turbo-like codes for IEEE 802.16 broadband wireless internet

Authors:
Kyuhyuk Chung;Jun Heo
Affiliations:
Division of Information and Computer Science, School of Natural Sciences, Dankook University, Seoul, Korea;College of Information and Telecommunications, Dept. of Electronics Engineering, Konkuk University, Seoul, Korea
Venue:
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Year:
2006

Citing 2
Cited 0

Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding

IEEE Transactions on Information Theory
Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present upper bounds for the maximum-likelihood decoding performance of particular LDPC codes and turbo-like codes with particular interleavers in the application of IEEE 802.16 broadband wireless internet. Previous research developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption, which bound the performance averaged over all ensemble codes or all interleavers. Proposed upper bounds are based on the simple bound and estimated weight distributions including the exact several smallest distance terms because if either estimated weight distributions on their own or the exact several smallest distance terms only are used, an accurate bound can not be obtained.