Bounding Performance of LDPC Codes and Turbo-Like Codes for IEEE 802.16 Broadband Wireless Internet
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.
KeywordsChannel Capacity Turbo Code Convolutional Code Simple Bound Broadband Wireless
Unable to display preview. Download preview PDF.
- 1.Gallager, R.: Low Density Parity Check Codes. MIT Press, Cambridge (1963)Google Scholar
- 4.Divsalar, D., Dolinar, S., Pollara, F.: Transfer Function Bounds on the Performance of Turbo Codes, TDA Progress Reports 42-122., Jet Propulsion Lab (1995)Google Scholar
- 5.Divsalar, D.: A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes, TMO Progress Reports 42-139, Jet Propulsion Lab (1999)Google Scholar
- 6.Garello, R., Pierleoni, P., Benedetto, S.: Computing the Free Distance of Turbo Codes and Serially Concatenated Codes with Interleavers: Algorithms and Applications. IEEE J. Select. Areas Commun. 19(5), 909–926 (2001)Google Scholar