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...

computational errors in numerical data processing may be detected efficiently by using parity values associated with real number codes, even when inherent round off errors are allowed in addition to failure disruptions. this paper examines correcting turbo codes by straightforward application of an algorithm derived for finite-field codes, modified to operate over any field. there are syndromes...

Unlike the usual turbo codes, “unifilar turbo codes” are based on only one underlying trellis code. If terminated (i.e., as block codes), they perform as well as (ordinary) turbo codes; if not termina ted (i.e., as convolutional codes), they are attractive for continuous transmission under tight delay

ABSTRACT In this paper, we investigate the performance of Turbo Trellis Coded Modulation (TTCM) over AWGN, and Rician channels and assume that phase disturbance is available. As we know Turbo Trellis Coded Modulation (TTCM) is similer to binary turbo codes, but employs Trellis Coded Modulation (TCM) codes which include multi-dimensional codes. The combination of turbo codes with trellis codes l...

Object-Oriented Implementation of LTE Turbo Codes by Anusha Gangadi Master of Science in Electrical Engineering West Virginia University Matthew C. Valenti, Ph.D., Chair Turbo codes are a popular form of error correction codes as they perform close to the Shannon limit. Turbo codes have interesting features like parallel code concatenation, nonuniform interleaving, and an iterative decoding alg...

For the construction of low rate turbo– codes, the concept of multiple parallel concatenated codes, i.e. the “multiple–turbo–code” has been successfully employed e.g. in [13, 16]. Analysis of this structure has been done via simulations [16] or the analysis of equivalent coding schemes [13]. In this paper we extend the method of EXIT charts [5], that has been applied to multiple–turbo–codes con...

ELECT Non-binary turbo codes promise excellent performance for a wide range of applications and environments, but research in this area is sparse. The performance of a non-binary turbo code defined in GF (4) on a two-way wireless relay channel (TWRC) employing physical-layer network coding, which is affected by impulsive noise is investigated. Simulation results for binary and non-binary turbo ...

In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers and nested convolutional codes is built. To this end,...

In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers (block interleavers) and nested convolutional codes i...