• 한국통신학회논문지
• /
• 제33권9C호
• /
• pp.669-675
• /
• 2008

홀수인 소수 p와 n=4k, 그리고 $d=((p^2k+1)/2)^2$에 대해서, 주기가 $p^n-1$인 p-진 m-수열 s(t)에 대해서 $(p^{2k}+1)/2$개의 서로 다른 decimated 수열들 s(dt+1), $0{\leq}l<(p^{2k}+1)/2$가 존재한다. 이 논문에서는 s(t)와 s(dt+l), $0{\leq}l<(p^{2k}+1)/2$ 사이의 상호상관 값이 $\{-1,-1{\pm}\sqrt{p^n},-1+2\sqrt{p^n}\}$과 같음을 보이고, 상호 상관 값의 분포를 유도하였다.

• 융합신호처리학회논문지
• /
• 제7권2호
• /
• pp.65-72
• /
• 2006

디지털신호처리에 있어서 신호의 다상분해(polyphase decomposition)는 멀티레이트(multirate) 시스템 구현에 있어서 다양한 용도로 사용된다. 특히 디지털 필터설계 등에 있어서 다채널 신호를 제공함으로써 병열연산을 가능하게 하여 알고리즘의 성능을 개선하는데 특히 유용하다. 일반적으로 다상분해신호는 원신호를 다운샘플링을 위해 데시메이션(decimation)하기 때문에 원신호에 비해 많은 고주파 성분을 포함하여 주파수 대역이 확장되는 경향이 있다. 이러한 성질은 다상분해신호의 활용, 즉 디지털 신호처리 시스템의 구조나 성능에 상당한 제약을 초래한다. 따라서 본 연구에서는 다상분해신호에 대한 완전 대역압축 및 복원 방법을 이론적으로 제시하고 Matlab 시뮬레이션을 통하여 그 유효성을 확인한다.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 1998년도 추계종합학술발표회 논문집(상)
• /
• pp.487-490
• /
• 1998

• Journal of applied mathematics & informatics
• /
• 제31권5_6호
• /
• pp.869-876
• /
• 2013

The design of large family size with the optimal cross-correlation property is important in spread spectrum and code division multiple access communication systems. In this paper we present the sequences with the decimation $d=2{\cdot}2^m-1$, calculate the cross-correlation spectrum for $0{\leq}t{\leq}2^n-2$ and count the number of the value $2^m-1$ occurring for $0{\leq}{\tau}2^n-2$. The sequences have the optimal cross-correlation property. The work on this paper can make it easier to count the number of the whole value occurring for $0{\leq}{\tau}2^n-2$.

• 한국전자통신학회논문지
• /
• 제8권6호
• /
• pp.891-897
• /
• 2013

최대 주기를 갖는 이진 수열에 대한 상호상관 함숫값은 통신 분야에서 다양하게 응용되고 있기 때문에 그 값의 범위와 발생빈도에 대한 분석은 다양하게 연구되고 있다. 본 논문에서는 데시메이션 $d=2^{m-1}(3{\cdot}2^{m}-1)$를 이용하여 새로운 수열군을 제안하고 그 수열의 상호상관 함숫값의 범위와 분포에 대하여 분석한다.

• 전기학회논문지
• /
• 제56권4호
• /
• pp.790-794
• /
• 2007

This paper presents a new index mapping method for DFT (Discrete Fourier Transform) and its application to multidimensional DFT. Unlike conventional index mapping methods such as DIT (Decimation in Time) or DIF (Decimation in Frequency) algorithms, the proposed method is based on two levels of decomposition and it can be very efficiently used for implementing multidimensional DFT as well as 1-dimensional DFT. The proposed pipelined architecture for multidimensional DFT is very flexible so that it can lead to the best tradeoff between performance and hardware requirements. Also, it can be easily extended to higher dimensional DFTs since the number of CEs (Computational Elements) and DCs (Delay Commutators) increase only linearly with the dimension. Various implementation options based on different radices and different pipelining depths will be presented.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2001년도 춘계학술대회 논문집
• /
• pp.41-44
• /
• 2001

In reverse engineering, the whole surfaces of the three-dimensional(3D) product are measured using 3D positional scanners. The raw triangle meshes constructed from a scanned point set are not well suited for direct use in the downstream activities. This is because the amount of triangle meshes may be very large(from millions to hundreds of millions) and usually distorted by scanning error. Furthermore, the triangle meshes may contain several holes that must be filled. Thus, several solutions have to be addressed and implemented before a complete CAD models can be acquired. This paper discusses on the algorithms of decimation, smoothing, and hole-filling that are crucial to refine the triangle meshes. Several examples are also given and discussed to validate the system.

• 대한전자공학회논문지
• /
• 제25권7호
• /
• pp.826-835
• /
• 1988

In this paper, we analyze the generation of an image pyramid as a 2-dimensional decimation-interpolation process, and suggest a performance index of FIR filter for decimation and interpolation filter. Until now, most deciamtion and interpolation filters are designed via the approximation of the impulse response of an ideal filter. In this paper, however, we propose a new performance index that minimizes the maximum frequency-weighted mean square error between the desired and the generated interpolated signal, and propose an optimal half-band filter based on the proposed performance index as an example. Some simulation results with real images show that the proposed optimal half-band filter yields a higher PSNR as well as the more preferable image quality, in comparison with other currently used filters with the same computational complexity.

• 대한음성학회지:말소리
• /
• 제45호
• /
• pp.63-77
• /
• 2003

The purpose of voice color conversion is to change the speaker identity perceived from the speech signal. In this paper, we propose a new voice color conversion algorithm through the formant shifting and the spectrum-tilt modification in the frequency domain. The basic idea of this technique is to convert the positions of source formants into those of target speaker's formants through interpolation and decimation and to modify the spectrum-tilt by utilizing the information of both speakers' spectrum envelops. The LPC spectrum is adopted to evaluate the position of formant and the information of spectrum-tilt. Our algorithm enables us to convert the speaker identity rather successfully while maintaining good speech quality, since it modifies speech waveforms directly in the frequency domain.

• 대한의용생체공학회:의공학회지
• /
• 제17권2호
• /
• pp.209-214
• /
• 1996

The display of biological signals in raster scan monitors often involves a multirate sampling operation which consists of decimation .and interpolation. All electroencephalouaphic (EEG) samples of 10 to 30 seconds (2, 500 to 7, 500 samples at 250[Hz] sampling frequency) must be displayed in the computer screen to keep the aspect ratio of the paper polygraph output. Since the current afrorclable display technology Plots at most 2, 000 Pixels Per row, sDme signal samples need to be discarde4 This Paper studies methods to perform this operation characterizing them from the signal processing viewpoint and compares the display quality among several decimation techniques. Experimental results show that a nonlinear operation such as the peak detection method could be preferable to the canonical linear filtering to reduce aliasing.