Computing the free distance of turbo codes and serially concatenated codes with interleavers: algorithms and applications

Authors:
R. Garello;P. Pierleoni;S. Benedetto
Affiliations:
Dipt. di Elettronica e Autom., Ancona Univ.;-;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 8

A Low Complexity Algorithm for Generating Turbo Code s-Random Interleavers

Wireless Personal Communications: An International Journal
Coding for shared satellite channel communications

IEEE Transactions on Communications
On the improved sub-code constrained algorithm for the determination of free distance for Turbo codes

APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Performance analysis of coded multi-carrier wideband systems over fading channels

MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Distance spectrum analysis of third generation turbo codes

ELECTROSCIENCE'05 Proceedings of the 5th WSEAS international conference on Applied electromagnetics, wireless and optical communications
Turbo-coded MC-CDMA communication link over strong turbulence fading limited FSO channel with receiver space diversity

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

ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Analysis of Cubic Permutation Polynomials for Turbo Codes

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

We present a new algorithm for computing the free distance dfree of parallel and serially concatenated codes with interleavers, the parameter that dominates the code performance at very high signal-to-noise ratios (SNRs). The knowledge of dfree allows one to analytically estimate the error floor, which may prevent the use of concatenated codes in applications requiring very low error rates. The algorithm is based on the new notion of constrained subcodes, and permits the computation of large distances for large interleavers without a constraint on the input sequence weight (e.g., up to dfree=40 for a rate-1/3 turbo code with interleaver length N=3568). Applications to practical cases of relevant interest, i.e., (1) the new Consultative Committee for Space Data Systems (CCSDS) standard for deep-space telemetry and (2) the new UMTS/3GPP standard for third-generation personal communications, are presented for the first time. Other related aspects, like a study on the free distance distribution of turbo codes with small/medium interleaver length, and a comparison between parallel and serial concatenation behavior, are also discussed