• ETRI Journal
• /
• 제28권4호
• /
• pp.453-460
• /
• 2006

In this article, we introduce a new class of product codes based on convolutional codes, called convolutional product codes. The structure of product codes enables parallel decoding, which can significantly increase decoder speed in practice. The use of convolutional codes in a product code setting makes it possible to use the vast knowledge base for convolutional codes as well as their flexibility in fast parallel decoders. Just as in turbo codes, interleaving turns out to be critical for the performance of convolutional product codes. The practical decoding advantages over serially-concatenated convolutional codes are emphasized.

• Journal of Communications and Networks
• /
• 제5권2호
• /
• pp.135-140
• /
• 2003

In this paper, we investigate the error performance of a serially concatenated system using a nonrecursive convolutional code as the outer code and a recursive QPSK space-time trellis code as the inner code on quasi-static and rapid Rayleigh fading channels. At the receiver, we consider iterative decoding based on the maximum a posteriori (MAP) algorithm. The performance is evaluated by means of computer simulations and it is shown that better error performance can be obtained by using low complexity outer and/or inner codes and the Euclidean distance criterion based recursive space-time inner codes. We also obtain new systems with large number of trasmit and/or receive antennas providing good error performance.

• ETRI Journal
• /
• 제37권4호
• /
• pp.736-742
• /
• 2015

A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.

• Journal of Communications and Networks
• /
• 제10권4호
• /
• pp.384-395
• /
• 2008

Random network coding can be viewed as a single block code applied to all source packets. To manage the concomitant high coding complexity, source packets can be partitioned into generations; block coding is then performed on each set. To reach a better performance-complexity tradeoff, we propose a novel concatenated network code which mixes generations while retaining the desirable properties of generation-based coding. Focusing on the code's erasure performance, we show that the probability of successfully decoding a generation on erasure channels can increase substantially for any erasure rate. Using both analysis (for small networks) and simulations (for larger networks), we show how the code's parameters can be tuned to extract best performance. As a result, the probability of failing to decode a generation is reduced by nearly one order of magnitude.

• 한국위성정보통신학회논문지
• /
• 제9권2호
• /
• pp.110-113
• /
• 2014

본 논문에서는 가우시안 이진 대칭 채널에서 쇄상부호를 사용할 때의 최적 내 외 부호율에 관하여 연구한다. 쇄상부호의 전체 부호율이 고정되어 있을 때, 내 부호율이 감소할수록 내 부호의 오류 검출 능력은 향상되지만, 반대로 외 부호의 오류 정정 능력은 감소하게 된다. 이러한 trade-off 관계를 이용하여 본 논문에서는 쇄상부호의 최대 성능 이득을 얻기 위한 내 부호와 외 부호에의 최적의 중복(redundancy) 분포에 관하여 연구한다. 분석한 결과, 가우시안 이진 대칭 채널에서는 외 부호화율을 최소화하고 내 부호화율을 최대화함으로써 전체 쇄상부호 시스템의 성능을 극대화 시킬 수 있음을 알 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.1961-1974
• /
• 2019

In this letter, a harmonic-mean-based dual-antenna selection scheme at relay node is proposed in two-way relaying networks (TWRNs). With well-designed distributed orthogonal concatenated Alamouti space-time block code (STBC), a dual-antenna selection problem based on the instantaneous achievable sum-rate criterion is formulated. We propose a low-complexity selection algorithm based on the harmonic-mean criterion with linearly complexity $O(N_R)$ rather than the directly exhaustive search with complexity $O(N^2_R)$. From the analysis of network outage performance, we show that the asymptotic diversity gain function of the proposed scheme achieves as $1/{\rho}{^{N_R-1}}$, which demonstrates one degree loss of diversity order compared with the full diversity. This slight performance gap is mainly caused by sacrificing some dual-antenna selection freedom to reduce the algorithm complexity. In addition, our proposed scheme can obtain an extra coding gain because of the combination of the well-designed orthogonal concatenated Alamouti STBC and the corresponding dual-antenna selection algorithm. Compared with the common-used selection algorithms in the state of the art, the proposed scheme can achieve the best performance, which is validated by numerical simulations.

• 한국산업정보학회논문지
• /
• 제9권2호
• /
• pp.17-22
• /
• 2004

In this paper, a concatenated RS and Turbo code is proposed for OFDM system over burst error channel. The concatenated code used in this study is a RS(255,202) code and a rate 1/2 turbo code. The turbo code uses 2 recursive systematic convolutional (RSC) code as the constituent codes and the parity bit are punctured to get the desired code rate. It is shown by simulation that the conventional OFDM system fails when there exists burst noise. The concatenated RS and turbo code obtains at least 5dB gain over the turbo code at the bit error probability of 10/sup -3/.

• 전자공학회논문지A
• /
• 제31A권9호
• /
• pp.34-43
• /
• 1994

The unequal symbol error probability of TCM(trellis coded modulation) is analyzed and applied to the derivation of bit error probability of /RS/Trellis concatenated coded-modulation system. An upper bound of the symbol error probability of TCM concatenated with RS code is obtained by exploiting the unequal symbol error probability of TCM, and it is applied to the derivation of the upper bound of the bit error probability of the RS/Trellis concatenated coded-modulation system. Our upper bounds of the concatenated codes are tighter than the earlier established other upper bounds.

• 한국정보통신학회논문지
• /
• 제8권3호
• /
• pp.541-546
• /
• 2004

시공간 부호(Space-Time Coding)는 송신부에서 전송신호를 시간영역과 공간영역으로 확장하여 전송하는 기법으로 다이버시티 이득과 부호화 이득을 동시에 얻을 수 있다. 본 논문에서는 SPW(Signal Processing Worksystem) 시뮬레이션 플랫포옴을 이용하여 고속 무선랜 관련 표준안인 IEEE 802.11a 시스템을 기초로 한 연접부호 시공간 OFDM 시스템의 성능 개선을 분석하였다. IEEE 802.11a에 포함된 구속장의 길이가 7인 콘볼루션 부호 대신에, 시공간 블록 부호를 이용한 시스템과 콘볼루션 부호와 시공간 블록 부호를 연접한 시스템을 SPW 시뮬레이션 플랫포옴에서 각각 구현하여 그 성능을 비교하였다. SPW 시뮬레이션 결과에 의하면 데이터율 6Mbps에서 두 부호를 연접한 시스템의 성능이 콘볼루션 부호기를 적용한 IEEE 802.11a 시스템보다 약 5dB 이상 우수한 성능을 보였고 데이터을 12Mbps에서는 6dB 이상의 성능 개선을 얻을 수 있었다.

• 한국통신학회논문지
• /
• 제33권12C호
• /
• pp.1006-1013
• /
• 2008

CZZ(Concatenated Zigzag) 부호는 LDPC 부호의 한 종류로서 빠른 부호화가 가능하며, CZZ 부호를 포함한 LDPC 부호는 부호의 길이가 짧을 경우 짧은 사이클이 부호의 성능에 큰 영향을 미친다. 본 논문에서는 길이 4인사이클을 제거하는 2차 다항식 인터리버를 설계하여 이를 이용한 CZZ 부호를 다양한 페이딩 채널 환경에서 터보부호와 성능을 비교 분석하였다. 폐이딩 채널 환경으로 주파수에 평탄하며 느린 페이딩 채널 환경의 근사모델인quasi-static 페이딩 채널, block 페이딩 채널, 빠른 페이딩 채널 환경인 비 상관(uncorrelated) 페이딩 채널과 상관(correlated) 페이딩 채널, 또한 차세대(4세대) 통신 환경을 가정한 주파수 선택적 페이딩 채널을 고려하였다. 모의실험을 통해 CZZ 부호가 터보 부호와 유사한 성능을 보이는 것을 확인하였다. 따라서, CZZ 부호의 다른 장점을 고려하면 CZZ 부호가 차세대 무선 통신 시스템을 위한 오류정정기법으로 사용될 수 있음을 확인할 수 있다.