• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.293-296
• /
• 1999

본 논문에서는 위상 다중화 홀로그래픽 메모리 시스템에서 사용될 최적의 위상코드를 구현하기 위해 기존에 위상 다중화에 많이 사용되고 있는 Hadamard 행렬을 비롯한 여러 행태의 랜덤 위상코드들의 상호상관 값에 의한 Cross talk의 영향 및 신호대 잡음비, 그리고 어드레스 갯수를 비교 분석하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2473-2483
• /
• 2000

In this paper, The turbo code is used to effectively remove noise which is generated on the image communication channel. Turbo code had excellent decoding performance. However, it had limitations for real time communication because of the system complexity and time delay in decoding procedure. To overcome this problem, this paper proposed a new SRI(Semi Random Interleaved algorithm, which decrease the time delay, when the image data, which reduced the interleaver size of turbo code encoder and decoder, transmitted. The SRI algorithm was composed of 0.5 interleaver size from input frame sequence. When the data inputs in interleaver, the data recorded by row such as block interleaver. But, When the data read in interleaver, the data was read by randomly and the next data located by the just address simultaneously. Therefore, the SRI reduced half-complexity when it was compared with pre-existing method such as block, helical, random interleaver. The image data could be the real time processing when the SRI applied to turbo code.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.295-300
• /
• 2002

In this paper, we apply the 3-dimension algorithm to the random interleaver and s-random interleaver and analyze the performance of the turbo code system with random interleaver (or s-random interleaver). In general, the performance of interleaver is determined by minimum distance between neighbor data, thus we could improve the performance of interleaver by increasing the distance of the nearest data. The interleaver using 3-dimension algorithm has longer minimum distance and average distance compared to existing random-interleaver (s-random interleaver) because the output data is generated randomly from 3-dimension storage. To verify and compare the performance of our proposed system, the computer simulations have been performed in turbo code system under gaussian noise environment.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.143-146
• /
• 2001

본 논문에서는 랜덤초기화 방법을 사용하여 초기 코드북을 생성하고, 이를 이용하여 초기 반복학습 시 수렴영역을 벗어난 2 이상의 가중치에 의한 K-means 알고리즘을 제안한다. 기존의 K-means 알고리즘이 국부적으로 최적화되고 초기 반복학습 시에 가중치의 영향이 크다는 점을 이용하여, 제안된 방법에서는 초기 반복학습 시의 가중치를 수렴영역에서 벗어난 큰 값으로 주고 이후 반복학습시의 가증치는 수렴영역 안에 있는 값으로 고정하여 코드북을 설계한다. 또한 초기 코드북을 얻기 위해 Splitting 방법과 같은 추가적인 과정 없이 랜덤한 방법에 의한 초기 코드북을 적용함으로써 제안된 알고리즘이 단순한 구조를 가지며, 구해진 코드북의 성능도 우수함을 확인할 수 있었다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.214-216
• /
• 2010

본 논문에서는, 다중송수신안테나 직교주파수분할다중화 (MIMO-OFDM) 시스템에서 심볼 기반 빔포밍을 위한 제한 피드백 기법을 고려하였다. 공간적 상관도가 존재하는 다중전달경로 채널에서, 심볼 기반 빔포밍을 위한 제한 피드백 기법과 코드북을 제안하였다. 모의실험 결과를 통해 제안한 기법이 낮은 복잡도를 가짐에도 불구하고 기존의 iterative 알고리즘을 기반으로 하는 심볼 기반 빔포밍을 이용한 제한 피드백 기법보다 우수한 성능을 보임을 확인하였다. 또한, 제안한 코드북이 랜덤 벡터 양자화 코드북보다 우수한 성능을 보임을 확인하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.2
• /
• pp.43-49
• /
• 1998

본 논문에서는 고성능 CELP 음성 압축기를 위한 "Boaseline 코드벡터"와 "Implied 코드벡터"로 구성되는 새로운 구조의 코드북을 제안한다. Implied 코드벡터는 피치 주기 이 전의 합성음으로부터 구하여지며 여기(勵起)신호의 피치 구조를 강화하여 합성음의 음질을 향상시킨다. Implied 코드벡터는 전달되지 않고 인코더 및 디코더에서 각각 합성음을 이용 하여 독립적으로 구하여진다. 또한 펄스와 랜덤 성분을 모두 가지는 복합 여기방식을 이용 하여 음질을 더욱 향상시킨다. 제안된 코드북 구조를 이용하여 10msec프레임을 가지는 8kbps CELP 음성 압축기를 설계하여 하나의 DSP칩에 실시간 구현 하였고, 이것의 성능을 SNRseg와 MOS로 측정하였다. 평균 SNRseg는 12.14dB로 CS-ACELP의 SNRseg보다 6dB 높고, 조용한 환경에서의 MOS는 3.80으로 G.729 CS-ACELP의 MOS보다 0.02 높다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1339-1345
• /
• 1999

In this paper we propose the digital information hiding technique by which we use the combination of random sequence and Hadamard matrix to hide multiple information. The prior work used only one random sequence multiplied by information signal to lower the energy level of information signal and thus it is difficult for a third party to detect the information signal or jam it. But because we have to use the orthogonal code for hiding key in order to hide multiple information in the same digital image, only the use of random sequence that are not uncorrelated has some problems in the information hiding scheme. Thus we present a new information hiding scheme that can be used in hiding multiple information by the use of random sequence that spreads the energy level of the data to be hidden and Hadamard matrix that makes the random sequence uncorrelated.

• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.36D no.10
• /
• pp.51-60
• /
• 1999

For an effective phase-multiplexing in holographic memory system, four types of phase code used as reference beam are generated. In case of $32 {\times} 32$ address beam, a phase error with 0%, 5%, 10% 15%, 20%, and 25% error rate, is purposely added to the real phase values in order to consider the practical SLM's nonlinear characteristics of phase modulation in computer simulation, cross talks and SNRs are comparatively analysed for these phase-codes by the auto and cross-correlation. Pseudo-Random(PSR) Phase Code has the lowest cross-correlation mean value of 0.067 among four types of Phase Code, which means the SNR of the PSR is higher than other Phase Codes. Also, the standard deviation of the PSR phase code indicating the degree of recalled data degradation is the lowest value of 0.0113.

• Journal of Intelligence and Information Systems
• /
• v.13 no.4
• /
• pp.35-44
• /
• 2007

This paper proposes a new method of weighted template matching for machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. Template matching is vulnerable to random noises that generate ragged outlines of a pattern when it is binarized. This paper offers a method of chain code trimming in order to remove ragged outlines. The method corrects specific chain codes within the chain codes of the inner and the outer contour of a pattern. The experiment compares confusion matrices of both the template matching and the proposed weighted template matching with chain code trimming. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.4
• /
• pp.20-27
• /
• 2010

This paper proposes a saturation compensating method by embedding pseudo-random code information in wavelet packet based colorization algorithm. In the color-to-gray process, an input RGB image is converted into YCbCr images, and a 2-level wavelet packet transform is applied to the Y image. And then, color components of CbCr are embedded into two sub-bands including minimum amount of energy on the Y image. At this time, in order to compensate the color saturations of the recovered color image during the printing and scanning process, the maximum and minimum values of CbCr components of an original image are also embedded into the diagonal-diagonal sub-band by a form of pseudo-random code. This pseudo-random code has the maximum and minimum values of an original CbCr components, and is expressed by the number of white pixels. In the gray-to-color process, saturations of the recovered color image are compensated using the ratio of the original CbCr values to the extracted CbCr values. Through the experiments, we can confirm that the proposed method improves color saturations in the recovered color images by the comparison of color difference and PSNR values.