Non-binary turbo codes and applications

Briffa, Johann A.; Schaathun, Hans Georg

doi:10.1109/turbocoding.2008.4658714

Cited by 11 publications

(20 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Actually, the principle of a transmission chain is to send digital information from a source to one or more receivers. The information yielded by the source is binary data {0, 1} = GF (2). Each block of m information bits are combined to generate a symbol of GF(q).…”

Section: Non-binary Error-correcting Codesmentioning

confidence: 99%

“…These codes are designed to achieve a good immunity against channel impairments by introducing redundancy in the informative data. Due to the complexity of both encoding and especially decoding procedures, the majority of research and practical implementations of real-time embedded systems were often restricted to encoders manipulating binary data, i.e., elements of the Galois field GF (2). Over the last decade, low-density parity check (LDPC) codes and turbo codes over GF (2) have attracted considerable interest of many researchers due to their excellent error correction capability.…”

Section: Introductionmentioning

confidence: 99%

“…Due to the complexity of both encoding and especially decoding procedures, the majority of research and practical implementations of real-time embedded systems were often restricted to encoders manipulating binary data, i.e., elements of the Galois field GF (2). Over the last decade, low-density parity check (LDPC) codes and turbo codes over GF (2) have attracted considerable interest of many researchers due to their excellent error correction capability. They have been generalized to finite fields GF(q) [1,2], where q = 2 m , and are among the most widely used errorcorrecting codes in wireless communication standards.…”

Section: Introductionmentioning

confidence: 99%

“…Over the last decade, low-density parity check (LDPC) codes and turbo codes over GF (2) have attracted considerable interest of many researchers due to their excellent error correction capability. They have been generalized to finite fields GF(q) [1,2], where q = 2 m , and are among the most widely used errorcorrecting codes in wireless communication standards. It has been shown in [1] that non-binary LDPC codes perform generally better than binary LDPC codes and turbo codes.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Blind identification of code word length for non-binary error-correcting codes in noisy transmission

Zrelli

Gautier

Rannou

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

In cognitive radio context, the parameters of coding schemes are unknown at the receiver. The design of an intelligent receiver is then essential to blindly identify these parameters from the received data. The blind identification of code word length has already been extensively studied in the case of binary error-correcting codes. Here, we are interested in non-binary codes where a noisy transmission environment is considered. To deal with the blind identification problem of code word length, we propose a technique based on the Gauss-Jordan elimination in GF(q) (Galois field), with q = 2 m , where m is the number of bits per symbol. This proposed technique is based on the information provided by the arithmetic mean of the number of zeros in each column of these matrices. The robustness of our technique is studied for different code parameters and over different Galois fields.

show abstract

Section: Non-binary Error-correcting Codesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Blind identification of code word length for non-binary error-correcting codes in noisy transmission

Zrelli

Gautier

Rannou

et al. 2015

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…On poor channels, requiring low rate codes, turbo codes have been shown to have better error performance [5]. We have also previously demonstrated that improvements can be made by fine-tuning the codebook for the inner code [6].…”

Section: Introductionmentioning

confidence: 99%

An Improved Decoding Algorithm for the Davey-MacKay Construction

Briffa

Schaathun

Wesemeyer

2010

2010 IEEE International Conference on Communications

View full text Add to dashboard Cite

Abstract-The Deletion-Insertion Correcting Code construction proposed by Davey and MacKay consists of an inner code that recovers synchronization and an outer code that provides substitution error protection. The inner code uses low-weight codewords which are added (modulo two) to a pilot sequence. The receiver is able to synchronise on the pilot sequence in spite of the changes introduced by the added codeword.The original bit-level formulation of the inner decoder assumes that all bits in the sparse codebook are identically and independently distributed. Not only is this assumption inaccurate, but it also prevents the use of soft a-priori input to the decoder. We propose an alternative symbol-level inner decoding algorithm that takes the actual codebook into account. Simulation results show that the proposed algorithm has an improved performance with only a small penalty in complexity, and it allows other improvements using inner codes with larger minimum distance.

show abstract

1/n Turbo codes from linear system point of view

Herranz

Napp

Perea

2020

RACSAM

View full text Add to dashboard Cite

The performance of turbo codes at the error floor region is largely determined by the effective free distance, which corresponds to the minimum Hamming weight among all codewords sequences generated by input sequences of weight two. In this paper, we study turbo codes of dimension one obtained from the concatenation of two equal codes and present an upper bound on the effective free distance of a turbo code with these parameters defined over any finite field. We do that making use of the so-called (A, B, C, D) statespace representations of convolutional codes and restrict to the case where A is invertible. A particular construction, from a linear systems point of view, of a recursive systematic convolutional code of rate 1/n so that the effective free distance of the corresponding turbo code attains this upper bound is also presented.

show abstract

Non-binary turbo codes and applications

Cited by 11 publications

References 8 publications

Blind identification of code word length for non-binary error-correcting codes in noisy transmission

Blind identification of code word length for non-binary error-correcting codes in noisy transmission

An Improved Decoding Algorithm for the Davey-MacKay Construction

1/n Turbo codes from linear system point of view

Contact Info

Product

Resources

About