Results 1  10
of
232
Convolutional Encoding for . . .
, 1979
"... Let X, Y, and K be the stochastic variables associated with x, Thus we want to minimize P under the condition (6), which can y, and k. Let H(y) be the entropy of Y when nothing is known be rewritten as about k. Let H:)(y) be the conditional entropy of Y for a given x, after i pairs (3,~~) have been ..."
Abstract
 Add to MetaCart
Let X, Y, and K be the stochastic variables associated with x, Thus we want to minimize P under the condition (6), which can y, and k. Let H(y) be the entropy of Y when nothing is known be rewritten as about k. Let H:)(y) be the conditional entropy of Y for a given x, after i pairs (3,~~) have been
On interleaved, differentially encoded convolutional codes
 IEEE Trans. Inform. Theory
, 1999
"... 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. Focus is put on the ubiquitous inner differential encoder (used in particular to resolve phase ambiguities), double d ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
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. Focus is put on the ubiquitous inner differential encoder (used in particular to resolve phase ambiguities), double
Performance Comparison and Analysis of Serial Concatenated Convolutional Codes
"... Abstract—In this paper, the performance of three types of serial concatenated convolutional codes (SCCC) is compared and analyzed in additive white Gaussian noise (AWGN) channel. In Type I, only the parity bits of outer encoder are passed to inner encoder. In Type II and Type III, both the informati ..."
Abstract
 Add to MetaCart
Abstract—In this paper, the performance of three types of serial concatenated convolutional codes (SCCC) is compared and analyzed in additive white Gaussian noise (AWGN) channel. In Type I, only the parity bits of outer encoder are passed to inner encoder. In Type II and Type III, both
An Upper Bound on the Minimum Distance of Serially Concatenated Convolutional Codes
, 2004
"... This paper describes the derivation of an upper bound on the minimum distance of serially concatenated convolutional codes. The resulting expression shows that their minimum distance cannot grow more than approximately K 11/d , where K is the information word length, and d f is the free dist ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper describes the derivation of an upper bound on the minimum distance of serially concatenated convolutional codes. The resulting expression shows that their minimum distance cannot grow more than approximately K 11/d , where K is the information word length, and d f is the free
Quantum serial turbocodes
 IEEE Trans. Inf. Theory
"... Abstract — We present a theory of quantum serial turbocodes, describe their iterative decoding algorithm, and study their performances numerically on a depolarization channel. Our construction offers several advantages over quantum LDPC codes. First, the Tanner graph used for decoding is free of 4 ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
that provides an efficient way to verify the properties of a quantum convolutional code, and in particular its recursiveness and the presence of catastrophic error propagation. We prove that all recursive quantum convolutional encoder have catastrophic error propagation. In our constructions, the convolutional
Recursive quantum convolutional encoders are catastrophic: A simple proof
, 2014
"... Poulin, Tillich, and Ollivier discovered an important separation between the classical and quantum theories of convolutional coding, by proving that a quantum convolutional encoder cannot be both noncatastrophic and recursive. Noncatastrophicity is desirable so that an iterative decoding algorithm ..."
Abstract
 Add to MetaCart
that this symmetry holds for any quantum convolutional encoder, it easily follows that an encoder is nonrecursive if it is noncatastrophic. Our proof also illuminates why this nogo theorem does not apply to entanglementassisted quantum convolutional encoders—the introduction of shared entanglement as a resource
Analysis, Design, and Iterative Decoding of Double Serially Concatenated Codes with Interleavers
 IEEE J. Select. Areas Commun
, 1998
"... A double serially concatenated code with two interleavers consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, a middle encoder, another interleaver permuting the middle codeword bits, and an inner encoder whose input words are the permuted middle codewords. ..."
Abstract

Cited by 28 (1 self)
 Add to MetaCart
. The construction can be generalized to h cascaded encoders separated by h 0 1 interleavers, where h?3: We obtain upper bounds to the average maximum likelihood biterror probability of double serially concatenated block and convolutional coding schemes. Then, we derive design guidelines for the outer, middle
Comparison between Soft and Hard Decision Decoding Using Quaternary Convolutional Encoders and the Decomposed CPM Model
"... A generic Mary continuous phase modulation (CPM) scheme, with a modulation index of h = 1/M, can be decomposed into a continuousphase encoder (CPE) followed by a memoryless modulator (MM), where the CPE is linear over the ring of integers modulo M. By using a channel encoder (CE), which is a convo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
convolutional encoder, to operate over the same ring of integers modulo M, the CE and the CPE can be combined to create another convolutional encoder called an extended CE, so called, as the CPE is now an extension of the CE. In this paper, a rate CE over the ring of integers modulo 4 is combined with the CPE
SOVA DECODING OF CONCATENATED CONVOLUTIONAL ENCODERS AND CPM SCHEME OVER AWGN AND FADING CHANNELS
"... In this paper, Continuous Phase Modulation (CPM) is investigated. We employ the decomposed CPM model where the model is decomposed into a Continuous Phase Encoder (CPE) and a Memoryless Modulator (MM). This allows us to concentrate on the encoding aspects without interference from the modulator. By ..."
Abstract
 Add to MetaCart
and the outer encoder a quaternary convolutional encoder. SOVA decoding is employed. Simulations show that a BER of 2.6 X 104 at 0.3dB SNR is obtainable in an AWGN channel. I.
Bridging the Gap Between Parallel and Serial Concatenated Codes
, 2002
"... Previously [1], it has been shown that parallel concatenated convolutional codes (PCCCs) can be modeled as a special case of serial concatenated convolutional codes (SCCCs). In this paper, we focus on this relationship with a goal of providing a parent code design that generates PCCC, SCCC and a fam ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Previously [1], it has been shown that parallel concatenated convolutional codes (PCCCs) can be modeled as a special case of serial concatenated convolutional codes (SCCCs). In this paper, we focus on this relationship with a goal of providing a parent code design that generates PCCC, SCCC and a
Results 1  10
of
232