• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.939-947
• /
• 2010

The LDPC(Low-Density Parity-Check) code, which is one of the channel encoding methods in IEEE 802.11n wireless LAN standard, has superior error-correcting capabilities. Since the hardware complexity of LDPC decoder is high, it is very important to take into account the trade-offs between hardware complexity and decoding performance. In this paper, the effects of LLR(Log-Likelihood Ratio) approximation on the performance of MSA(Min-Sum Algorithm)-based LDPC decoder are analyzed, and some optimal design conditions are derived. The parity check matrix with block length of 1,944 bits and code rate of 1/2 in IEEE 802.11n WLAN standard is used. In the case of $BER=10^{-3}$, the $E_b/N_o$ difference between LLR bit-widths (6,4) and (7,5) is 0.62 dB, and $E_b/N_o$ difference for iteration cycles 6 and 7 is 0.3 dB. The simulation results show that optimal BER performance can be achieved by LLR bit-width of (7,5) and iteration cycle of 7.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.12
• /
• pp.67-75
• /
• 2016

DNA computing technology makes the interests on DNA storage and DNA watermarking / steganography that use the DNA information as a newly medium. DNA watermarking that embeds the external watermark into DNA information without the biological mutation needs the reversibility for the perfect recovery of host DNA, the continuous embedding and detecting processing, and the mutation analysis by the watermark. In this paper, we propose a reversible DNA watermarking based on circular histogram shifting of DNA code values with the prevention of false start codon, the preservation of DNA sequence length, and the high watermark capacity, and the blind detection. Our method has the following features. The first is to encode nucleotide bases of 4-character variable to integer code values by code order. It makes the signal processing of DNA sequence easy. The second is to embed the multiple bits of watermark into -order coded value by using circular histogram shifting. The third is to check the possibility of false start codon in the inter or intra code values. Experimental results verified the our method has higher watermark capacity 0.11~0.50 bpn than conventional methods and also the false start codon has not happened in our method.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.9
• /
• pp.39-48
• /
• 2004

Turbo codes, whose performance in bit error rate is close to the Shannon limit, have been adopted as a part of standard for the third-generation high-speed wireless data services. Iterative Turbo decoding results in decoding delay and high power consumption. As wireless communication systems can only use limited power supply, low power design techniques are essential for mobile device implementation. This paper proposes new effective criteria for stopping the iteration process in turbo decoding to reduce power consumption. By setting two stopping criteria, decodable threshold and undecodable threshold, we can effectively reduce the number of decoding iterations with only negligible error-correcting performance degradation. Simulation results show that the number of unsuccessful error-correction can be reduced by 89% and the number of decoding iterations can be reduced by 29% on the average among 12500 simulations when compared with those of an existing typical method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2029-2035
• /
• 2013

In this paper, we presented non-uniform quantization method for LDPC decoder specified in DVB-S2 standard. There are some problems in order to implement LDPC decoder in aspect to algorithm and implementation. In algorithm aspect, because of large number of iterations, LDPC decoding in general give rise to a large number of computation operations, mass power consumption, and decoding delay. Therefore, this paper studies Horizontal Shuffle Scheduling (HSS) algorithm which reduced iteration number without performance loss. In aspect of implementation, there are some solutions to improve the decoding speed, however this paper focused on non-uniform quantization which reduce the quantization bits of LDPC decoder. In simulation results, Decoding throughput of HSS LDPC decoder based on non-uniform quantization is 816Mbps and it improved 12% compared to conventional one.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.32-39
• /
• 2009

In this thesis, design effective elimination interference algorithm of ICS repeat system for repeater that improve frequency efficiency. Gennerally, LMS Algorithm apply to ICS repeat system. Error convergence speed and accuracy of LMS Algorithm are influenced by reference signal. For improve LMS Algorithm, suggest Adaptive searching channel estimate algorithm. For using channel characteristic, adaptive searching channel estimate algorithm make reference signal similar interference signal by convolution operation and complement LMS algorithm demerit. For make channel similar pratical channel, apply Jake's Rayleigh multi-path model. LMS algorithm and suggested adaptive searching channel estimate algorithm that have 16 taps apply to ICS repeat system under Rayleigh multi-path channel, so simulate with MATLAB. According to simulate, ICS repeat system with LMS algorithm show -40 dB mean square error convergent after 110 datas iteration and ICS repeat system with adaptive searching channel estimate algorithm show -80 dB mean square en-or convergent after 120 datas iteration. Analyze simulation result, suggested adaptive searching channel estimate algorithm show 40 dB accuracy than LMS algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8A
• /
• pp.1441-1449
• /
• 2001

차세대 멀티미디어 이동통신인 IMT-2000의 규격에서는 3GPP와 3GPP2에서 모두 터보 코드를 채널 코덱으로 채택하고 있다. 그 중 3GPP 에서는 용도에 따라 길쌈부호와, 제한길이 4인 1/3 터보코드를 선택적으로 사용하도록 정의되어 있다. 터보코드는 복호기의 출력으로 경판정 복호 비트에 대한 신뢰도 값을 동시에 생성하여, 이를 이용한 반복복호로 우수한 BER 특성을 얻을 수 있어야 한다. 본 논문에서는 먼저 3GPP 규격의 터보 복호기에 적용할 수 있는 내부 복호기로서 SOVA 복호기를 설계하였다. 또한 터보 복호기에서의 연판정 출력값의 중요성을 감안하여, 누적메트릭 정규화에 있어서 신뢰도 값에 영향을 주지않는 구조를 제안하여 적용하였다. 본 연구에서는 효율적인 구조의 3GPP SOVA 복호기를 설계하기 위하여 C++를 이용하여 알고리즘에 대한 성능을 검증하였으며, 이를 기반으로 VHDL을 이용하여 복호기를 설계하였다. 마지막으로 Altera사의 EPF10K100GC503 FPGA를 이용하여 복호기를 하드웨어로 구현하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.535-537
• /
• 2005

디지털 신호 및 전송부호의 오류검출에는 예전부터 패리티 체크가 사용되어 왔다. 그러나 패리티 체크 기법은 구현 및 알고리즘이 단순, 간결한 우수성이 있지만 특정 데이터 비트의 경우 오류 검출이 불가능하다는 문제점을 가지고 있다. 이후 패리티 체크 기법은 해밍 코드 및 채널 오류 정정을 위한 LDPC 코드와 같은 다양한 오류검출 및 정정 알고리즘에 적용되어 발전되어 왔으며, 그 중 LDPC 코드의 bit-flipping 알고리즘에서는 패리티 기법을 반복적으로 적용하는 방식을 택하고 있다. 본 논문에서는 이러한 채널 오류 정정을 위한 LDPC의 bit-flipping 알고리즘을 이차원 코드에 적용하고, 이 때 bit-flipping 알고리즘이 가지고 있는 문제점을 보완할 수 있는 개선된 LDPC 코드를 제안한다.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.39-42
• /
• 2004

Turbo codes, proposed by Berrou, that increase the interleaver size and the number of iteration have better than conventional convolutional codes, in case of BER performance. However, because turbo codes has been required much decoding delay to increase iteration number, it demands unnecessary iterative decoding. Therefore, in this paper, we propose iterative decoding stop criterion that uses the variance of absolute value of LLR. This algorithm can be reduced average iterative decoding number and had lossless performance of BER, because of decreasing unnecessary iterative decoding.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.59-62
• /
• 2004

The performance of turbo code is improved by updating extrinsic information. The bit patterns are categorized by the transition characteristics of extrinsic information in this paper. And the distribution of these patterns is surveyed according to signal-to-noise ratio. Based on the results, the dominant error pattern is determined at high signal-to-noise ratio range. Thus, it is expected to improve the error performance in the error floor region by correcting the dominant error pattern which is found in this paper.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.183-187
• /
• 1994

ISO/MPEG 에서는 스테레오 신호만을 부호화할 수 있는 MPEG-1 오디오 부호화 방법을 5.1 채널의 다채널 신호로 확장한 MPEG-2 오디오 방법을 제안하였다. 압축해야 될 신호가 증가하면서 MPEG에서는 채널 내의 부호화 방법으로는 MPEG-1에서 제안된 방법을 사용하고, 부가적으로 채널 간의 부호화 방법을 이용하여 MPEG-1과 호환이 가능하도록 하는 부호화 방법을 다방면에 걸쳐서 연구하여 표준화 작업을 진행하고 있다. 본 논문에서는 MPEG 오디오 부호화 방법을 두가지 측면에서 효율적으로 향상시키는 방법을 제안하고자 한다. 첫 번째는 MPEG에서 제안한 오디오 부호화 알고리듬을 개선하여 음질과 비트율에 있어 향상시키는 것으로 각 서브밴드의 비트 할당 방법과 시간 영역에서의 마스킹 효과 등을 사용한 심리음향 모델 등의 개선 방법이 제안되었다. 두 번째 방법은 부호화기의 계산량을 감소시키는 방법으로 심리음향 모델이나 비트 할당시의 계산과정에 있어 반복적인 과정은 시간 여역에서의 중복성을 이용하여 계산량에 대한 향상을 얻을 수 있었다.