The main problem concerning the hardware implementation of turbo codes is the lack of parallelism in the MAP-based decoding algorithm. This paper proposes to overcome this problem with a new family of turbo codes, named Slice Turbo Codes. This family is based on two ideas: the encoding of each dimension with P independent tail-biting codes and a constrained interleaver structure that allows par...

Turbo decoders applied in wireless communications are complex and dissipate large amount of power. In this paper, we investigate design & simulation of Turbo algorithm for wireless communications applications, including our proposed Simulink model of Turbo decoder. The schemes employed in our low-power design are clock-gating and toggle filtering. We described the behavior of Turbo decoders in ...

Low-density parity-check (LDPC) codes and convolutional Turbo codes are two of the most powerful error correcting codes that are widely used in modern communication systems. In a multi-mode baseband receiver, both LDPC and Turbo decoders may be required. However, the different decoding approaches for LDPC and Turbo codes usually lead to different hardware architectures. In this paper we propose...

This paper presents the characteristics of an integrated circuit called "turbo4" which can be used as a turbo-encoder or as a turbo-decoder. The turbo-encoder is built using a parallel concatenation of two recursive systematic convolutional codes with constraint length K=5. The turbo-decoder is cascadable, each circuit processing one iteration of the turbo-decoding algorithm. It is designed aro...

ETRI Journal, Volume 28, Number 5, October 2006 ABSTRACT⎯The effect of block interleaving in a low density parity check (LDPC)-turbo concatenated code is investigated in this letter. Soft decoding can be used in an LDPC code unlike the conventional Reed-Solomon (RS) code. Thus, an LDPC-turbo concatenated code can show better performance than the conventional RS-turbo concatenated code. Furtherm...

Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalisation for fountain codes operating on erasure channels, and we generalise the problem formalisation to more general channels. We introduce a novel type of rateless codes based on the Turbo Principle: the Turbo-Fountain. The Turbo-Fountain is able to consi...

.................................................................................................................................... iv List of Figures ........................................................................................................................ viii List of Symbols ..........................................................................................................

The spectacular performance offered by turbo codes sparked intense interest in them. A considerable amount of research has simplified, formalized, and extended the ideas inherent in the original turbo code construction. Nevertheless, the nature of the relatively simple ad hoc turbo-decoding algorithm has remained something of a mystery. We present a geometric interpretation of the turbo-decodin...

In this paper, secure channel coding schemes based on turbo codes are suggested for time reversal ultra wideband (TR-UWB) systems. Turbo code has the capability of error correction near Shannon’s limit. Adding security to turbo code is an attractive idea since it could reduce the overall processing cost of providing secure coded data and enjoys the advantages of high-speed encryption and decryp...