• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.66-74
• /
• 2010

Recently distributed video coding (DVC) is spotlighted for the environment which has restriction in computing resource at encoder. Wyner-Ziv (WZ) coding is a representative scheme of DVC. The WZ encoder independently encodes key frame and WZ frame respectively by conventional intra coding and channel code. WZ decoder generates side information from reconstructed two key frames (t-1, t+1) based on temporal correlation. The side information is regarded as a noisy version of original WZ frame. Virtual channel noise can be removed by channel decoding process. So the performance of WZ coding greatly depends on the performance of channel code. Among existing channel codes, Turbo code and LDPC code have the most powerful error correction capability. These channel codes use stochastically iterative decoding process. However the iterative decoding process is quite time-consuming, so complexity of WZ decoder is considerably increased. Analysis of the complexity of LPDCA with real video data shows that the portion of complexity of LDPCA decoding is higher than 60% in total WZ decoding complexity. Using the HDA (Hard Decision Aided) method proposed in channel code area, channel decoding complexity can be much reduced. But considerable RD performance loss is possible according to different thresholds and its proper value is different for each sequence. In this paper, we propose an adaptive HDA method which sets up a proper threshold according to sequence. The proposed method shows about 62% and 32% of time saving, respectively in LDPCA and WZ decoding process, while RD performance is not that decreased.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.116-123
• /
• 2003

In this paper, we address the problem of designing multirate codes for a multiple-input and multiple-output (MIMO) system by restricting the receiver to be a successive decoding and interference cancellation type, when each of the antennas is encoded independently. Furthermore, it is assumed that the receiver knows the instantaneous fading channel states but the transmitter does not have access to them. It is well known that, in theory, minimummean- square error (MMSE) based successive decoding of multiple access (in multi-user communications) and MIMO channels achieves the total channel capacity. However, for this scheme to perform optimally, the optimal rates of each antenna (per-antenna rates) must be known at the transmitter. We show that the optimal per-antenna rates at the transmitter can be estimated using only the statistical characteristics of the MIMO channel in time-varying Rayleigh MIMO channel environments. Based on the results, multirate codes are designed using punctured turbo codes for a horizontal codedMIMOsystem. Simulation results show performances within about one to two dBs of MIMO channel capacity.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.4
• /
• pp.24-36
• /
• 2011

In this paper, we verify the channel synthesis and decomposition of polar codes using successive cancellation decoding algorithm over binary discrete memoryless symmetric channel by modifying Arikan's algebraic formular on encoding and decoding of polar codes. In addition, we found that information bits are sent by efficiently consisting of polar codes with their size $2^n$ through polarizing matrix ${G_2}^{{\otimes}n}$ over binary discrete memoryless symmetric channel W. Expecially, if $N{\geq}2$, the complexity of Arikan's encoding and decoding for polar codes is O($Nlog_2N$). Furthermore, we found that polar codes are one of the solution to the challenging problems for the multipoint communication.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.39-42
• /
• 1999

In this paper, a method based on the turbo principle is presented which combines diversity reception, equalization, and channel decoding, to combat the high transmission losses over the frequency-selective fading channel. The simulation results show that with the method presented, the BER performance within 0.3 ㏈ from that on the AWGN channel can be obtained over the frequency-selective fading channel in the investigated scenarios.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.198-204
• /
• 2007

For parallel and serially concatenated trellis coded modulation (TCM), improved iterative decoding schemes with a simple mechanism are proposed and their performances are compared with those of conventional decoding schemes. Simulation results have shown that the proposed schemes have provided a considerable decoding gain in additive white Gaussian noise (AWGN) channels and Rayleigh fading channels, even if they can be implemented by a simple modification of conventional decoding algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.12
• /
• pp.1401-1412
• /
• 1992

On band limited channel like satellite communication and voice communication. TCM(Trellis Coded Modulation) is a communication method that has coding gain which combines modulation with channel coding without bandwidth expansion. In this paper, we apply PAM, PSK, QAM to TCM, and propose the extended path back method decoding algorithm which improved drawback of viterbi decoding algorithm and apply to TCM this decoding algorithm. Using Monte Carlo simulation, we analyze performance of each modulation technique and efficiency of decoding algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1145-1151
• /
• 2010

Hochwald et al. introduced unitary space-time codes for quasi-static Rayleigh fading channels which allows for noncoherent decoding when the channel response is not known at the receiver. However, when reliable information on the channel response is available, coherent decoding is preferable for improved performance. Here, we study the relationship between the performance criteria on the diversity and coding advantages provided by unitary space-time codes with noncoherent and coherent decoding. We show that when a unitary space-time code achieves full spatial diversity with noncoherent decoding, full spatial diversity is also guaranteed with coherent decoding.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.825-828
• /
• 1999

A Viterbi Decoder for IMT2000 Mobile Station based on cdma200 is implemented in this paper. There are fundamental traffic channel, supplemental traffic channel for user data transmission and dedicated control channel for signal transmission in cdma2000. This decoder can decode these channels simultaneously, and support l/2, l/3, 1/4 code rate decoding. In case of fundamental channel decoding, it needs about 1100 logic cells and 30000 bit memory block.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.1099-1102
• /
• 1999

This paper presents a real-time MPEG-2 AAC decoding system, which can decode 2-channel main profile MPEG-2 AAC bitstream. The proposed system supports all decoding tools except for coupling channel tool, and provides sampling rates of 32, 44.1, 48 KHz. The system consists of a simple programmable DSP core and two hardwired logic modules that perform Huffman decoding and prediction for real-time implementation.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.2 no.3
• /
• pp.17-23
• /
• 2003

Turbo decoding in combination with detection strategy for Multi Access Interference (MAI) cancellation has been shown to be very effective for MC-CDMA system in Rayleigh multi-path fading environment. This paper reports new simulation results on the efficacy of joint decoding and detection for MC-CDMA in nonlinear and fading channel.