• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.245-253
• /
• 2010

In this paper, we derive the performance analysis of the coded cooperation over a Rician fading channel. A new scheme called coded cooperation was suggested by using user cooperation and channel codes simultaneously. In previous works, it was verified that the coded cooperation schemes have better performance than other relay schemes in a Rayleigh fading channel. However, the high speed short range indoor wireless communication system has recently attracted research attention and its channel with very high carrier frequency(60GHz) can be typically modeled as a Rician fading channel. We derive analytical outage probabilities and bit error probabilities of the coded cooperation over the Rician fading channel and prove it to have full diversity order.

• Journal of electromagnetic engineering and science
• /
• v.11 no.2
• /
• pp.133-142
• /
• 2011

Coded cooperation that integrates channel coding in cooperative transmission has gained a great deal of interest in wireless relay networks. The performance analysis of coded cooperation protocol with multiple relays is investigated in this paper. We show that the diversity order achieved by the coded cooperation in a multi-relay wireless network is not only dependent on the number of cooperating relays but is also dependent on the code-rate of the system. We derive the code-rate bound, which is required to achieve the full diversity gain of the order of cooperating nodes. The code-rate required to achieve full diversity is a linearly decreasing function of the number of available relays in the network. We show that the instantaneous channel state information (CSI)-based relay selection can effectively alleviate this code-rate bound. Analysis shows that the coded cooperation with instantaneous CSI-based relay selection can achieve the full diversity, for an arbitrary number of relays, with a fixed code-rate. Finally, we develop tight upper bounds for the bit error rate (BER) and frame error rate (FER) of the relay selection based on coded cooperation under a Rayleigh fading environment. The analytical upper bounds are verified with simulation results.

• Journal of electromagnetic engineering and science
• /
• v.10 no.2
• /
• pp.56-60
• /
• 2010

This paper proposes a new cooperative protocol in which Alamouti's scheme is applied to exploit the advantages of both coded cooperation and Alamouti's scheme. It not only has better than direct transmission but also coded cooperation at appropriate cooperation levels. Simulation results show that the proposed protocol can save approximately 6~7 dB of transmit power to achieve the target BER(Bit Error Rate) compared with coded cooperation. Furthermore, the performance of the proposed protocol does not significantly depend on the qualities of inter-user channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.345-355
• /
• 2011

This paper introduces the coded cooperation protocol in wireless relay network. We propose a two relay based coded cooperation protocol with RCPC codes for wireless networks. The proposed two-relay based system can achieve a diversity of order 4 under slow fading environment. Under fast fading, the diversity order is 2 times of the free distance of the convolutional code. We develop upper bounds on BER and FER for the system under both slow and fast fading with Rayleigh distribution. The effect of various channel conditions on the cooperation is also examined in this work.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.366-374
• /
• 2010

Coded cooperation is a promising user cooperation scheme. In this paper, we first propose a novel network-coding-based coded cooperation scheme. When a user decodes its partner's information correctly in the first frame, it transmits the combination of the partner's parity bits and its own parity bits through network coding in the second frame. This is distinct from the classical scheme, where the user only transmits the partner's parity bits during cooperation. We analyze the outage probability of the proposed scheme, and show that it achieves a full diversity order. Numerical evaluations reveal that the proposed scheme outperforms the classical scheme when the inter-user channel is poor, yet is worse when the inter-user channel is strong. Also, the results show that the proposed scheme always outperforms that of no cooperation in various channel conditions while the performance of classical scheme is worse than that of no cooperation with the poor inter-user channels. This means that the performance of the proposed scheme is more stable than the classical scheme and the proposed scheme is more tolerant to the poor inter-user channels. To combine the advantages of the proposed scheme and the classical scheme under different inter-user channel conditions, we propose an adaptive solution. This adaptive scheme enhances the system performance considerably in all channel conditions in spite of the inter-user channel quality, at the expense of only one acknowledgement or non-acknowledgement bit.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.5
• /
• pp.409-412
• /
• 2004

This paper shows that the proposed Turbo TCM(Turbo Trellis Coded Modulation) has a good performance with a little complexity of decoder. The encoder structure, which is connected with Turbo Codes, is the proposed modulation technique for an efficient bandwidth, This method is used symbol by symbol MAP decoder of iteration similar to binary Turbo Codes in the receiver. The result shows that the BER performance according to iteration is improved about 2,5dB at $BER=10^{-2}$ compared to Turbo Codes with Gray mapping.

• ETRI Journal
• /
• v.46 no.2
• /
• pp.175-183
• /
• 2024

Recently, polar code has attracted the attention of many scholars and has been developed as a code technology in coded-cooperative communication. We propose a polar code scheme based on Plotkin structure and quasi-uniform punching (PC-QUP). Then we apply the PC-QUP to coded-cooperative scenario and built to a new coded-cooperative scheme, which is called PCC-QUP scheme. The coded-cooperative scheme based on polar code is studied on the aspects of codeword construction and performance optimization. Further, we apply the proposed schemes to space-time block coding (STBC) to explore the performance of the scheme. Monte Carlo simulation results show that the proposed cooperative PCC-QUP-STBC scheme can obtain a lower bit error ratio (BER) than its corresponding noncooperative scheme.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.1
• /
• pp.24-29
• /
• 2011

Comparing conventional one-way relaying, two-way relaying scheme with network coding can achieve high throughput by reducing the transmission time. Coded cooperation protocol, which is a algorithm that uses coding on physical layer, can achieve high reliability. In this paper, we propose coded cooperation protocol over two-way relay network. Simulation results show proposed protocol has better performance in terms of reliability and throughput compare with conventional amplify and forward protocol. Also, with same throughput, proposed protocol has better performance in terms of reliability compare with the conventional hybrid decoded and forward protocol.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.12
• /
• pp.3702-3707
• /
• 2009

In this paper, a new approximated MAP algorithm for soft bit decision from QAM symbols is proposed for Gray Coded QAM signals, based on the Max-Log-MAP and a Gray coded QAM signal can be separated into independent two Gray coded PAM signal, M-PAM on I axis with M symbols and N-PAM on Q axis with N symbols. The Max-Log-MAP used distance comparisons between symbols to get the soft bit decision instead of mathematical exponential or logarithm functions. But in accordance with the increase of the number of symbols, the number of comparisons also increase with high complexity. The proposed algorithm is used with the Euclidean distance and constituted with plain arithmetic functions, thus we can know intuitively that the algorithm has low implementing complexity comparing to conventional ones.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.2
• /
• pp.257-266
• /
• 2007

In many multimedia applications, image compression is required to substantially reduce the amount of image data. This compression, however, sometimes brings artifacts. Typical artifacts are blocking artifacts and mosquito noise in DCT-coded images, and ringing artifacts around edges in wavelet-coded images. We propose a new directional postprocessing algorithm, which includes detection of the edge direction, interpolation scheme, and directional nonlinear filtering, to enhance the quality of decoded images. Simulation results show that the proposed algorithm is as effective as or more effective than other nonlinear filtering techniques.