Results 161 to 170 of about 3,626 (230)

On cycle-based permutor designs for serially concatenated convolutional codes

IEEE International Symposium on Information Theory, 2003. Proceedings., 2003
A. Huebner, Dmitri Truhachev, Kamil Sh. Zigangirov   +2 more
openalex   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Serial concatenation of a block code and a 2D convolutional code

Multidimensional Systems and Signal Processing, 2018
In this paper we study two different concatenation schemes of twodimensional (2D) convolutional codes. We consider Fornasini–Marchesini state space representation of 2D linear systems to describe our concatenated codes. Also we present upper and lower bounds on the distance of the proposed concatenated codes.
Victoria Herranz, Diego Napp, Carmen Perea   +2 more
openaire   +2 more sources

Spatially-Coupled Serially Concatenated Codes with Periodic Convolutional Permutors

2021 11th International Symposium on Topics in Coding (ISTC), 2021
Spatially-coupled serially concatenated codes (SC-SCCS) are a class of turbo-like codes constructed by interconnecting a sequence of SCCS using a set of block permutors. At short block lengths, however, the bit-error-rate (BER) performance of SC-SCCS constructed by independent block permutors exhibits a high error floor.
Alexandre Graell i Amat, Muhammad Umar Farooq, Michael Lentmaier   +2 more
openaire   +2 more sources

Efficient Decoder-Free Minimum Distance Estimation for Concatenated Convolutional Codes

2025 IEEE 101st Vehicular Technology Conference (VTC2025-Spring)
This work presents a novel approach for estimating the minimum distance of concatenated convolutional codes. Unlike most prior methods, the proposed approach relies solely on encoder-side properties, eliminating the need for a decoder in the estimation ...
Mohammad Bazzal, Jérémy Nadal, Stefan Weithoffer, C. A. Nour, C. Douillard   +4 more
semanticscholar   +1 more source

An Upper Bound on the Minimum Distance of Serially Concatenated Convolutional Codes

IEEE Transactions on Information Theory, 2004
This paper derives 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 K1-1/df (O) , where K is the information word length, and df (O) is the free distance of the outer ...
PEROTTI, ALBERTO GIUSEPPE, BENEDETTO, Sergio   +1 more
openaire   +4 more sources

Linearity-Enhanced Serial List Decoding of Linearly Expurgated Tail-Biting Convolutional Codes

International Symposium on Information Theory
With a sufficiently large list size, the serial list Viterbi algorithm (S-LVA) provides maximum likelihood (ML) decoding of a concatenated convolutional code (CC) and an expurgating linear function (ELF), which is similar in function to a cyclic ...
Wenhui Sui, B. Towell, Zihan Qu, Eugene Min, R. Wesel   +4 more
semanticscholar   +1 more source

On the comparison of different serial concatenated schemes based on polar and LDPC codes

Facta universitatis - series: Electronics and Energetics
Nowadays concatenated codes are actively developed for different applications of error-correcting theory. In this paper we propose a new method for constructing concatenated codes consisting of some outer error-correcting code and a particular ...
Fedor Ivanov, A. Kuvshinov
semanticscholar   +1 more source

On higher order permutors for serially concatenated convolutional codes

IEEE Transactions on Information Theory, 2006
A new parameter set for designing permutors is introduced. It is called the set of higher order separations and can be considered as a generalization of the well-known symbol separation (spreading factor). The respective permutor is called a higher order permutor and we show how such a permutor can be constructed.
A. Huebner, R. Jordan
openaire   +2 more sources

Serial Concatenated Codes for Embedded Bit-Streams Wireless Transmisson with Iterative Decoding

International Symposium on Signal, Image, Video and Communications, 2018
With the rapid growth of wireless communication systems, new architectures of transmitters and receivers have evolved to ensure robust transmission of multimedia data.
M. Mhamdi, Amin Zribi, C. Perrine, Y. Pousset   +3 more
semanticscholar   +1 more source

Near-optimum serial concatenation of single-parity codes with convolutional codes [PDF]

IEE Proceedings - Communications, 2005
A class of concatenated codes using convolutional codes and low-density parity check codes as component codes is proposed, extending the author's previous work. A special case is considered serial concatenation of single parity check codes as the outer code, a convolutional code with recursive systematic encoder as the inner code, separated by a random
openaire   +2 more sources