Design of turbo-like codes for short frames

Authors:
Fan Yang;Zhendong Luo;Baoyu Tian;Yubai Li
Affiliations:
School of Communication and Information Engineering, University of Electronic Science and Technology of China, Chengdu, China;Institute of Communication Standards Research, China Academy of Telecommunication Research of MIIT, Beijing, China;School of Communication and Information Engineering, Beijing University of Posts and Telecommunications, Beijing, China;School of Communication and Information Engineering, University of Electronic Science and Technology of China, Chengdu, China
Venue:
IEEE Communications Letters
Year:
2010

Citing 3
Cited 0

Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks

DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
TS-LDPC Codes: Turbo-Structured Codes With Large Girth

IEEE Transactions on Information Theory
Tailbiting MAP decoders

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Turbo codes have been shown to yield very good performance for long block sizes. However, their performance degrades when the frame size decreases. Furthermore, decoding turbo codes with the maximum a posteriori (MAP) algorithm or the soft output Viterbi algorithm (SOVA) is quite complex. We proposed a type of turbo-like (TL) codes for short frame transmission. The component encoder of a TL code is a systematic feed-forward convolutional (SFC) code designed without 4-cycles and the associated component decoder uses serial belief propagation rule. TL codes are linear-time encodable and they can be decoded by belief propagation (BP) algorithms with very low complexity.