Results 11 to 20 of about 251 (146)
On The Performance of Turbo Codes With Convolutional Interleavers [PDF]
2005 Asia-Pacific Conference on Communications, 2005 In this paper, some issues governing the block-wise performance of convolutional interleavers used in turbo codes are presented. Two different constructions of convolutional interleaver differing by the position of stuff bits in the interleaved data block are considered here. The performance assessment is based on the contribution of each weight to the
Vafi, Sina, Wysocki, Tadeusz
openaire +4 more sources
Low Complexity Multi Mode Interleaver Core For Wimax With Support For Convolutional Interleaving [PDF]
, 2009 A hardware efficient, multi mode, re-configurable architecture of interleaver/de-interleaver for multiple standards, like DVB, WiMAX and WLAN is presented. The interleavers consume a large part of silicon area when implemented by using conventional methods as they use memories to store permutation patterns.
Asghar, Rizwan, Dake Liu
core +5 more sources
Modified convolutional interleavers and their performance in turbo codes [PDF]
SympoTIC '04. Joint 1st Workshop on Mobile Future & Symposium on Trends In Communications (IEEE Cat. No.04EX877), 2005 In previous work, we have presented application of a model of the convolutional interleaver in turbo codes acting as a block interleaver through inserting a number of stuff bits equal to the number of interleaver memories at the end of each data block.
Vafi, Sina, Wysocki, Tadeusz
openaire +4 more sources
ARP Interleavers for Decomposed Parallel Concatenated Convolutional Codes [PDF]
This technical document provides a short description of a novel structure for parallel concatenated convolutional codes (PCCCs), originally proposed in [1] as decomposed PCCC (DPCCC). To ease result reproducibility, the full list of interleaver parameters used for evaluating the DPCCC structure in [1] are provided in this document.
Bazzal, Mohammad +4 more
core +8 more sources
Evolutionary Algorithm Aided Interleaver Design for Serially Concatenated Codes [PDF]
, 2011 In this paper, we propose an algorithm for designing the interleavers of Serially Concatenated Codes (SCCs), in order to increase the Minimum Hamming Distance (MHD) between the legitimate permutations of the encoded bit sequence and hence to improve the ...
R. G. Maunder +3 more
core +1 more source
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
An Improved Blind Recognition Method of the Convolutional Interleaver Parameters in a Noisy Channel
IEEE Access, 2019 In a digital communication system, forward error correction (FEC) codes and interleavers are implemented to code the data so as to improve the error performance, which is hindered by random and burst errors. In the context of noncooperative communication,
Yiyao Xu, Yang Zhong, Zhiping Huang
doaj +1 more source
Multimode Flex-Interleaver Core for Baseband Processor Platform
Journal of Computer Systems, Networks, and Communications, 2010 This paper presents a flexible interleaver architecture supporting multiple standards like WLAN, WiMAX, HSPA+, 3GPP-LTE, and DVB. Algorithmic level optimizations like 2D transformation and realization of recursive computation are applied, which appear to
Rizwan Asghar, Dake Liu
doaj +1 more source
Blind identification of an unknown interleaved convolutional code [PDF]
2015 IEEE International Symposium on Information Theory (ISIT), 2015 We give here an efficient method to reconstruct the block interleaver and recover the convolutional code when several noisy interleaved codewords are given. We reconstruct the block interleaver without assumption on its structure. By running some experimental tests we show the efficiency of this method even with moderate noise.
openaire +2 more sources
Optimal interleaving scheme for convolutional coding
Electronics Letters, 1989 An optimal scheme is given for interleaving using an n×m array when the maximum length burst of errors is greater than m. It involves transmitting the rows of the array in a specified (nonsequential) order, but introduces no additional overheads. This scheme is particularly beneficial for convolutional coding.
E. Dunscombe, F.C. Piper
openaire +1 more source