Error-Correction Coding for Digital Communications

Clark, George C.; Cain, J. Bibb

doi:10.1007/978-1-4899-2174-1

Cited by 1,008 publications

(326 citation statements)

References 0 publications

Supporting

Mentioning

313

Contrasting

Unclassified

Order By: Relevance

“…Automatic repeat reQuest (ARQ) [12] and forward error correction (FEC) [13,14] are two conventional methods for error recovery. They, however, both have severe drawbacks when applied to UWSNs.…”

Section: Related Workmentioning

confidence: 99%

Efficient error recovery with network coding in underwater sensor networks

et al. 2009

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Efficient error recovery with network coding in underwater sensor networks

et al. 2009

View full text Add to dashboard Cite

“…The use of scaling, weight capping and normalisation [4] where possible enables weights to be kept to seven or less. Furthermore, in most cases, the data received is correct and in this case, there will be a node with a zero state metric.…”

Section: Self-timed Viterbi Architecturementioning

confidence: 99%

Applying asynchronous techniques to a Viterbi Decoder design

Brackenbury

Cumpstey²,

Furber³

et al. 2001

IEE Seminar Low Power IC Design

View full text Add to dashboard Cite

INTRODUCTIONViterbi decoders are used for decoding convolutional forward error correction codes [ 13 in a large proportion of digital transmission systems including mobile phones and digital television. For portable applications, the battery size and lifetime is of commercial importance as is the size of the electronics. Therefore, a low power, area efficient implementation is of commercial interest as a means of both lowering costs and extending the battery operating time.

show abstract

“…One method for the design of deterministic permutations is based on block interleavers [2], [3]. In this interleaver, the input data are written along the rows of the memory configured as matrix of k-rows and l-columns and then read out along the columns.…”

Section: Introductionmentioning

confidence: 99%

“…However, for short block size, the performance of turbo codes with a random interleaver degrades substantially even it performs worse than that of convolutional codes with similar computational complexity. Furthermore, if we take memory and throughput requirements into consideration, it is preferable to employ the deterministic interleavers with lower interleaving and deinterleaving complexity for a convenient implementation.One method for the design of deterministic permutations is based on block interleavers [2], [3]. In this interleaver, the input data are written along the rows of the memory configured as matrix of k-rows and l-columns and then read out along the columns.…”

mentioning

confidence: 99%

The Design of New Modified Block and Matched S-Random Interleavers for Turbo Codes

Soliman¹,

Yang²,

Ejaz³

2014

IJMO

View full text Add to dashboard Cite

Abstract-It is known that one of the essential building blocks of turbo codes is the interleaver and its design using random, semi-random (S-Random) and deterministic permutations. In this paper, two new types of turbo code interleavers, Modified Block S-Random (MBSR) interleaver and Modified Matched S-Random (MMSR) interleaver are proposed. The design algorithm for the new interleavers is described in depth, and the simulation results are compared to the two new interleavers with different existing interleavers based on the BER (Bit Error Rate) performances of the turbo codes. Through the simulation, we find a better performance of the MBSR interleaver than random and practical interleavers.In addition, the performance of MMSR interleaver is close to the code matched interleaver at different frame sizes and with less complex design.Index Terms-Interleaver, semi random, turbo codes, weight distribution. I. INTRODUCTIONA typical turbo code (TC) was first introduced in 1993 by Berrou et al.,[1] as a class of near channel capacity achieving codes. This turbo code is constructed by concatenating two parallel convolutional codes via an interleaver as shown in Fig. 1. The interleaver is an indexing function given by a permutation of bits index in the information frames with N frame length that plays a crucial role in the turbo codes architecture. Interleaver has three main functions: a) it constructs a long code from small memory convolutional codes by permuting the input bits such that the two constituent encoders are operating on different order input bits. b) Provides "scrambled" information data to the second constituent encoder to decorrelate the inputs of the two decoders, so that an iterative suboptimum decoding algorithm based on "uncorrelated" information exchange between the two constituent decoders can be applied. c) It changes theweight distribution of turbo codes such that, the overall weight for the generated codeword depends on how the outputs from the two constituent encoders are teamed together.The main two properties characterize any interleaver are the interleaver spreading property which is the distance between adjacent bits before interleaving, and the randomness property that provides a non-fixed indexing function which is a good factor for correction in the iterative decoding. Turbo code interleaver types have been Manuscript received May 31, 2014; revised July 17, 2014. This work was supported in part by College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, ChinaThe authors are with the Nanjing university of Aeronautics and Astronautics, College of Electronic and Information Engineering, Nanjing (e-mail: thms78@gmail.com, saqibejaz@gmail.com).extensively studied in different ways, and they fall into two main classes: Random interleavers and Deterministic interleavers. A random interleaver is simply a random permutation with new positions produced by an indexing function based on the uniform probability distribution. While in majo...

show abstract

Error-Correction Coding for Digital Communications

Cited by 1,008 publications

References 0 publications

Efficient error recovery with network coding in underwater sensor networks

Efficient error recovery with network coding in underwater sensor networks

Applying asynchronous techniques to a Viterbi Decoder design

The Design of New Modified Block and Matched S-Random Interleavers for Turbo Codes

Contact Info

Product

Resources

About