Results 21 to 30 of about 564,389 (192)
On interleaved, differentially encoded convolutional codes [PDF]
IEEE Transactions on Information Theory, 1999 Summary: We study a serially interleaved concatenated code construction, where the outer code is a standard convolutional code, and the inner code is a recursive convolutional code of rate 1. We focus on the ubiquitous inner differential encoder (used, in particular, to resolve phase ambiguities), double differential encoder (used to resolve both phase
M. Peleg, I. Sason, S. Shamai, A. Elia
semanticscholar +2 more sources
Modified convolutional interleavers and their performance in turbo codes
SympoTIC '04. Joint 1st Workshop on Mobile Future & Symposium on Trends In Communications (IEEE Cat. No.04EX877), 2004 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.
Sina Vafi, Tadeusz A. Wysocki
semanticscholar +3 more sources
Blind Identification of Block Interleaved Convolution Code Parameters
Defence Science Journal, 2019 Most of the digital communication system uses forward error correction (FEC) in addition with interleaver to achieve reliable communication over a noisy channel. To get useful information from intercepted data, in non-cooperative context, it is necessary to have algoritihms for blind identification of FEC code and interleaver parameters. In this paper,
Jimmy B. Tamakuwala
openalex +3 more sources
Interleaved Group Convolutions
2017 IEEE International Conference on Computer Vision (ICCV), 2017 In this paper, we present a simple and modularized neural network architecture, named interleaved group convolutional neural networks (IGCNets). The main point lies in a novel building block, a pair of two successive interleaved group convolutions: primary group convolution and secondary group convolution. The two group convolutions are complementary: (
Ting Zhang +3 more
openalex +4 more sources
Improving the performance of BICM-ID and MLC systems with different FEC codes [PDF]
Advances in Radio Science, 2013 In bandwidth limited communication systems, the high data rate transmission with performance close to capacity limits is achieved by applying multilevel modulation schemes in association with powerful forward error correction (FEC) coding, i.e.
T. Arafa, W. Sauer-Greff, R. Urbansky
doaj +1 more source
Coding theorems for turbo code ensembles [PDF]
, 2002 This paper is devoted to a Shannon-theoretic study of turbo codes. We prove that ensembles of parallel and serial turbo codes are "good" in the following sense.
Jin, Hui, McEliece, Robert J.
core +2 more sources
On Maximum Contention-Free Interleavers and Permutation Polynomials over Integer Rings [PDF]
, 2005 An interleaver is a critical component for the channel coding performance of turbo codes. Algebraic constructions are of particular interest because they admit analytical designs and simple, practical hardware implementation. Contention-free interleavers
Takeshita, Oscar Y.
core +2 more sources
Turbo Decoding and Detection for Wireless Applications [PDF]
, 2007 A historical perspective of turbo coding and turbo transceivers inspired by the generic turbo principles is provided, as it evolved from Shannon’s visionary predictions.
Hanzo, L., Robertson, P, Woodard, J.P.
core +1 more source
On BICM receivers for TCM transmission [PDF]
, 2010 Recent results have shown that the performance of bit-interleaved coded modulation (BICM) using convolutional codes in nonfading channels can be significantly improved when the interleaver takes a trivial form (BICM-T), i.e., when it does not interleave ...
Agrell, Erik +2 more
core +3 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