http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Single-Step Adaptive Offset Min-Sum Algorithm for Decoding LDPC Codes
林小菊(Xiaoju Lin),康秀藺(Gansuren Baasantseren),이해기(Hae-Kee Lee),김성수(Sung-Soo Kim) 대한전기학회 2010 전기학회논문지 P Vol.59 No.1
Low-density parity-check (LDPC) codes with belief-propagation (BP) algorithm achieve a remarkable performance close to the Shannon limit at reasonable decoding complexity. Conventionally, each iteration in decoding process contains two steps, the horizontal step and the vertical step. In this paper, an efficient implementation of the adaptive offset min-sum (AOMS) algorithm for decoding LDPC codes using the single-step method is proposed. Furthermore, the performances of the AOMS algorithm compared with belief-propagation (BP) algorithm are investigated. The algorithms using the single-step method reduce the implementation complexity, speed up the decoding process and have better efficiency in terms of memory requirements.
High Order Template Scheme for Rapid Acquisition in the UWB Communication System
康秀藺(Gansuren Baasantseren),林小菊(Xiaoju Lin),이해기(Hae-Kee Lee),김성수(Sung-Soo Kim) 대한전기학회 2010 전기학회논문지 P Vol.59 No.1
The low power of ultra-wideband (UWB) signal makes the acquisition of UWB signal be a more challenging task. In this paper, we propose the method of high order template signal technique that reduces the synchronization time. Experimental results are presented to show the improvements of performance in the mean acquisition time (MAT) and the probability of detection. The performance compared with the serial search, the truly random search and the random permutation search. It is shown that over typical UWB multipath channels, a random permutation search scheme may yield lower MAT than serial search.