An iterative decoding scheme for serially concatenated convolutional codes
We present an iterative soft-output decoding algorithm for serially concatenated convolutional codes which has better performance than the conventional noniterative decoding algorithm. The proposed Viterbi decoding scheme can be used whenever some form of serial concatenation of encoders and channels with memory is applied.
Mohamed Siala+3 more
openalex +3 more sources
Cooperative coding using serial concatenated convolutional codes
The paper presents a novel cooperative coding scheme using punctured serial concatenated convolutional codes (SCCC). We evaluate its performance in terms of frame error rate (FER) under two cooperation protocols: a decode-and-forward protocol in conjunction with automatic repeat request (ARQ), by which the relay sends an acknowledge bit (ACK) back to ...
Yang Cao, B.R. Vojcic
openalex +3 more sources
Analysis of iterative decoding for serial concatenated convolutional codes
Turbo codes include two kinds of encoding schemes, one is parallel concatenated convolutional codes (PCCC), and another is serial concatenated convolutional codes (SCCC). The SCCC can get better performance than PCCC. The analysis of acquirement of some information for SCCC decoding computation, which is different from PCCC, are presented. Finally, the
Weidong Wang, Chunlong Bai, Ping Zhang
openalex +3 more sources
Performance of serially concatenated convolutional turbo codes for magnetic recording
Performance of serially concatenated convolutional turbo codes has been evaluated for the Lorentzian channel using simulation, and experimentally for a real hard disk drive. The experimental results are consistent with simulations, which show a substantial gain over uncoded systems.
Yunxiang Wu+4 more
openalex +3 more sources
An improved design and SOVA algorithm for serial concatenated convolutional code
Serial concatenated code (SCC) has attracted lots of attention by its excellent performance when employing an iterative decoder. However, the previous research shows that it can obtain good performance only with excessive processing delay. It is analyzed that the decoding structure is the key point of its performance's convergence, as well as the ...
Lei Wan, Kuang Jing-ming
openalex +3 more sources
Serially concatenated codes with euclidean geometry LDPC and convolutional codes
This paper presents a new scheme of serially concatenated codes. It is formed by a combination of Euclidean Geometry (EG) Low Density Parity Check (LDPC) and Recursive Systematic Convolutional (RSC) codes linked by the row-column interleaver. A modification is proposed on the interleaver, which improves performance of concatenated codes.
Sina Vafi, Huu Dung Pham
openalex +3 more sources
Serial concatenation of convolutional code and low rate orthogonal convolutional code [PDF]
A novel low rate orthogonal code which is the serial concatenation of convolutional code and orthogonal convolutional code is proposed for high capacity CDMA systems. The BER performance is good and shows no "error floor" phenomenon.
H. Imai, Jifeng Li
openaire +1 more source
Related searches:
Design of punctured serially concatenated convolutional codes
IEEE Communications Letters, 2005An effective algorithm for the design of punctured serially concatenated convolutional codes (SCCCs) is proposed. The algorithm is based on the density evolution technique, and its main goal is to design a code matching the outer and the inner encoder in order to reduce the bit error rate (BER) in the SNR operating region ranging from the waterfall to ...
Laddomada, Massimiliano, Scanavino, B.
openaire +4 more sources
On cycle-based permutor designs for serially concatenated convolutional codes
A. Huebner+2 more
openalex +3 more sources
Rate-compatible punctured serial concatenated convolutional codes
GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489), 2004We propose and compare some good rate-compatible serial concatenated convolutional code (SCCC) families. To obtain rate-compatible SCCCs, the puncturing is limited to inner coded bits. However, and this is the novelty proposed, we do not limit the puncturing to inner parity bits only, but we extend it also to inner systematic bits, thus obtaining ...
BABICH, FULVIO+2 more
openaire +3 more sources