Results 11 to 20 of about 21,126 (276)
Scholarpedia, 2010 Turbo codes are error-correcting codes with performance close to the Shannon theoretical limit [SHA]. These codes have been invented at ENST Bretagne (now TELECOM Bretagne), France, in the beginning of the 90's [BER]. The encoder is formed by the parallel concatenation of two convolutional codes separated by an interleaver or permuter.
Kerouedan, Sylvie, Berrou, Claude
openaire +2 more sources
Spatially coupled turbo codes [PDF]
2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2014 In this paper, we introduce the concept of spatially coupled turbo codes (SC-TCs), as the turbo codes counterpart of spatially coupled low-density parity-check codes. We describe spatial coupling for both Berrou et al. and Benedetto et al. parallel and serially concatenated codes.
Saeedeh Moloudi +2 more
openaire +3 more sources
A fully-parallel turbo decoding algorithm [PDF]
, 2015 This paper proposes a novel alternative to the Log-BCJR algorithm for turbo decoding, yielding significantly improved processing throughput and latency.
Maunder, R.G.
core +1 more source
Nested turbo codes for the costa problem [PDF]
, 2008 Driven by applications in data-hiding, MIMO broadcast channel coding, precoding for interference cancellation, and transmitter cooperation in wireless networks, Costa coding has lately become a very active research area.
Sun, Y.H. +11 more
core +1 more source
Interleaver Optimal Turbo Code pada Kanal Flat Fading
Rekayasa, 2009 Turbo Code is one of the channel encoding technique used in wireless cellular networks are approaching the limit of Shannon's theory. Interleaver is used to determine the rules of the randomization technique of bits of information in relation to the
Dwi Kuswanto
doaj +1 more source
Deferred-Iteration Aided Low-Complexity Turbo Hybrid ARQ Relying on a Look-up Table [PDF]
, 2011 Since the introduction of turbo code aided Hybrid Automatic Repeat reQuest (HARQ) schemes, their complexity reduction has drawn research attention. In our previous work, we proposed an Early Stopping (ES) strategy for a turbo HARQ scheme, which results ...
Chen, Hong +5 more
core +1 more source
An Efficient Early Iteration Termination for Turbo Decoder
Journal of Telecommunications and Information Technology, 2016 Turbo code finds wide applications in mobile communication, deep space communication, satellite communication and short-range communication despite its high computational complexity and iterative nature.
P. Salija
doaj +1 more source
Interleaver design for turbo codes [PDF]
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2001 The performance of a Turbo code with short block length depends critically on the interleaver design. There are two major criteria in the design of an interleaver: the distance spectrum of the code and the correlation between the information input data and the soft output of each decoder corresponding to its parity bits.
Hamid R. Sadjadpour +3 more
openaire +2 more sources
Design of Fixed-Point Processing Based Turbo Codes Using Extrinsic Information Transfer Charts [PDF]
, 2010 The operand-width specifications in fixed-point hardware implementations of turbo code decoders is an important design issue, since this governs the trade-off between the decoder's performance and its complexity, cost, area and energy consumption.
Li, Liang +7 more
core +1 more source
Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation
EURASIP Journal on Wireless Communications and Networking, 2008 This paper presents a new approach to decode turbo codes using a nonbinary belief propagation decoder. The proposed approach can be decomposed into two main steps.
Lestable Thierry +2 more
doaj +2 more sources