Results 1 - 10 of 40

Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo Codes

by Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ian J. Wassell
"... Abstract — It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/3 parent codes. Nevertheless, good puncturing patterns can only be identified by means of an exhaustive search, wh ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Abstract — It has been observed that particular rate-1/2 partially systematic parallel concatenated convolutional codes (PCCCs) can achieve a lower error floor than that of their rate-1/3 parent codes. Nevertheless, good puncturing patterns can only be identified by means of an exhaustive search

A distance spectrum interpretation of turbo codes

by Lance C. Perez, Jan Seghers, Daniel J. Costello - IEEE Trans. Inform. Theory , 1996
"... Abstract-The performance of Turbo codes is addressed by examining the code’s distance spectrum. The “error floor ” that occurs at moderate signal-to-noise ratios is shown to be a conse-quence of the relatively low free distance of the code. It is also shown that the “error floor ” can be lowered by ..."
Abstract - Cited by 112 (8 self) - Add to MetaCart
Abstract-The performance of Turbo codes is addressed by examining the code’s distance spectrum. The “error floor ” that occurs at moderate signal-to-noise ratios is shown to be a conse-quence of the relatively low free distance of the code. It is also shown that the “error floor ” can be lowered

On the performance of Turbo codes

by Charles C. Wang - Proceedings of IEEE Military Communications Conference , 1998
"... The performance of the turbo code is sensitive to its code structure, which is made up of code rate, constraint length, tap connection, block size, interleaving pattern and number of decoding iterations. In this paper, mitigation techniques that can lower the error floor are adopted in both encoder ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
The performance of the turbo code is sensitive to its code structure, which is made up of code rate, constraint length, tap connection, block size, interleaving pattern and number of decoding iterations. In this paper, mitigation techniques that can lower the error floor are adopted in both encoder

Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes?

by Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ian J. Wassell
"... Abstract — In this paper we concentrate on rate-1/3 systematic parallel concatenated convolutional codes and their rate-1/2 punctured child codes. Assuming maximum-likelihood decoding over an additive white Gaussian channel, we demonstrate that a rate-1/2 non-systematic child code can exhibit a lowe ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
lower error floor than that of its rate-1/3 parent code, if a particular condition is met. However, assuming iterative decoding, convergence of the non-systematic code towards low bit-error rates is problematic. To alleviate this problem, we propose rate-1/2 partially-systematic codes that can still

Analysis and design of punctured rate-1/2 turbo codes exhibiting low error floors

by Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ian J. Wassell, O A. Carrasco - IEEE J. Sel. Areas Commun , 2009
"... Abstract—The objective of this paper is two-fold. Initially, we present an analytic technique to rapidly evaluate an appro-ximation to the union bound on the bit error probability of turbo codes. This technique exploits the most significant terms of the union bound, which can be calculated straightf ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
straightforwardly by considering the properties of the constituent convolutional encoders. Subsequently, we use the bound approximation to demonstrate that specific punctured rate-1/2 turbo codes can achieve a lower error floor than that of their rate-1/3 parent codes. In particular, we propose pseudo

Reducing The Error Floors Of Turbo Codes That Use Structured Interleavers S.Velugonda Reddy 1, Ch.Ravi Kumar 2

by unknown authors
"... Abstract — An efficient method for lowering the error floors of turbo codes that use structured Interleavers is presented in this paper. Structured interleaver is an interleaver that follows particular property when interleaving the information bits. In this method a set of parity bits are forced to ..."
Abstract - Add to MetaCart
Abstract — An efficient method for lowering the error floors of turbo codes that use structured Interleavers is presented in this paper. Structured interleaver is an interleaver that follows particular property when interleaving the information bits. In this method a set of parity bits are forced

istance Spectrum Interpretation of Turbo Codes

by Lance C. Perez, Jan Seghers, Daniel J. Costello
"... Abstract- The performance of Turbo codes is addressed by examining the code's distance spectrum. The "error floor " that occurs at moderate signal-to-noise ratios is shown to be a conse-quence of the relatively low free distance of the code. It is also shown that the &quot ..."
Abstract - Add to MetaCart
Abstract- The performance of Turbo codes is addressed by examining the code's distance spectrum. The "error floor " that occurs at moderate signal-to-noise ratios is shown to be a conse-quence of the relatively low free distance of the code. It is also shown that the "error

A Method for Lowering Turbo Code Error Flare using Correction Impulses and Repeated Decoding

by Youssouf Ould-cheikh-mouhamedou, Stewart Crozier, Ken Gracie, Paul Guin, Peter Kabal , 2006
"... Turbo codes exhibit an “error floor ” or “flare ” making it difficult to further improve the error performance without a significant increase in the signal-to-noise ratio (SNR). The error flare is mainly characterized by the distance properties of the code. The conventional way to lower the error fl ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Turbo codes exhibit an “error floor ” or “flare ” making it difficult to further improve the error performance without a significant increase in the signal-to-noise ratio (SNR). The error flare is mainly characterized by the distance properties of the code. The conventional way to lower the error

Turbo Encoder Design For Symbol Interleaved Parallel Concatenated Trellis Coded Modulation

by Christine Fragouli, Richard D. Wesel , 2000
"... This paper addresses turbo-encoder design for coding with high spectral efficiency using parallel concatenated trellis coded modulation (PCTCM) and symbol interleaving. The turbo-encoder design involves the constituent encoder design and the interleaver design. The constituent encoders are optimized ..."
Abstract - Cited by 39 (8 self) - Add to MetaCart
single row. This single row generally applies to turbo-code constituent encoders for parallel concatenation and is not restricted to symbol interleaving. To lower the error floor, a new semi-random interleaver design criteria and a construction method extends the spread-interleaver concept introduced

SELECTION OF CODE AND INTERLEAVER FOR TURBO CODING Figure 2 Encoder and decoder for turbo codes

by Jakob Dahl Andersen
"... ABSTRACT encoder. This is in fact the reason why we use the The selection of component codes for turbo coding has often been based on the performance at high SNR’s. However, we will argue that the selection mainly should be based on the performance at low SNR’s, i.e. the convergence properties. Furt ..."
Abstract - Add to MetaCart
. Further, we will present a way to construct interleavers that significantly improve the performance of the turbo coding scheme at high SNR’s, i.e. lowers the error floor 1.
Results 1 - 10 of 40