• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.5-8
• /
• 2002

In this paper, we are designed and verified a FFT/IFFT processor that is possible from the wireless LAN environment which is adopted international standard of the IEEE802.11a. The proposed architecture of the FFT/IFFT has Radix-2 64point SDF(single-path delay feedback) Pipeline technique and DIF(Decimation in Frequenct) structure. The FFT/IFFT processor has each 8 bit complex input-output and 6 bit Twiddle factor. we used Max-PlusII for simulation and can see that processor is properly operated

• Journal of Electrical Engineering and information Science
• /
• v.1 no.2
• /
• pp.125-133
• /
• 1996

In this paper, we dicuss on the properties related to the circular filtering in orthogonal transform domain. The efficient filtering schemes in six orthogonal transform domains are presented by generalizing the convolution-multiplication property of the DFT. In brief, the circular filtering can be accomplished by multiplying the transform domain filtering matrix W, which is shown to be very sparse, yielding the computational gains compared with the time domain processing. As an application, decimation and interpolation techniques in orthogonal transform domains are also investigated.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.139-140
• /
• 2008

지상라이다는 고정도의 3차원 영상을 제공하고 레이저 빔을 현장이나 대상물에 발사하여 짧은 시간에 수백만점의 3차원좌표를 기록할 수 있는 최신 측량장비로서 다양한 응용분야에서 두각을 나타내고 있다. 본 연구에서는 지상라이다를 이용한 건축물의 3자윈 자동 윤곽선 추출을 다룬다. 지상라이다는 건축물의 3차원 윤곽선을 신속하게 추출할 수 있지만 지상기반 시스템이므로 여러 가지 장애물 때문에 건국물의 하단부에서는 추출이 쉽지 않다. 기존 항공라이다를 이용한 알고리즘에서는 사진의 색상차나 모폴로지 특성에 의존하여 범위를 제한하고, 이를 기반으로 윤곽선을 추출하였다. 하지만 지상라이다의 경우 항공라이다에 비해 분해능이 월등히 높다. 또한, 지상라이다는 지상에서 측정하기 때문에 항공라이다에서 어려운 건축물의 측면이나 정면도 윤곽선 추출이 가능하기 때문에 본 논문에서는 사진을 이용하지 않고 전처리를 하지 않은 데이터를 직접 이용하여 건물의 정면 윤곽선을 추출하는 것을 제안한다. 건물의 크기와 데이터 수 즉, 라이다로 측정한 포인트 수를 고려한 효율적인 Decimation방법을 제안하고 또한, Decimation된 데이터이서 지역적으로 제일 큰 값과 작은 값을 찾아낸다. 그 중 많이 벗어난 점을 편차를 이용하여 제거한다. 이렇게 찾아낸 건축물의 외곽점들을 이어 만든 윤곽선을 최종적으로 보간하여 좀 더 현실과 가까운 윤곽선 추출 방법을 제안한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8A
• /
• pp.671-678
• /
• 2005

This paper proposed symbol rate method which does not require a priori knowledge on the symbol rate and simplified modulation identification method to classify BPSK, QPSK, 8PSK signal. In order to estimate the unknown symbol rate, sliding FFT and simple moving average to estimate the spectrum of the signals is utilized, and sliding window and decimation, LPF blcok to estimate the proper symbol rate is used. Although conventional modulation ID method must use SNR value as the test statistics, the receiver cannot estimate the SNR value since the receiver cannot know the modulation type at the start of communication, and bit resolution is high due to using nonlinear function such as log, cosh. Therefore, we proposed the simplified fixed SNR value method. The performance of symbol rate estimation and modulation ID is shown using Monte Carlo computer simulation. This paper show that symbol rate estimation also has good performance in low SNR, and proposed simplified fixed SNR method has almost equivalent performance compared to conventional method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.155-160
• /
• 2003

Owing to the advances in ADC and DSP technologies, signals in If band, which once had to be processed in analog technology, can new be digitally processed. This is referred to as "Digital IF" or "Digital Radio", which is a preliminary stage of SDR. Applying the digital radio technology to a multi-carrier receiver design, a processing gain is generated through an over-sampling of input data. In the digital receiver, decimation is performed for reducing the computational complexity CIC and half band filter is used together with the decimation as an anti-alising filter. The CIC filter, however, should introduce the roll-off phenomenon in the passband, which causes the receiving performance to be considerably degraded due to the distorted Passband flatness of receiving filter. In this paper, we designed a CIC roll-off compensation filter for W-CDMA digital receiver. The performance of the proposed compensation filter is confirmed through computer simulations in such a way that the BER is minimized by compensating the roll-off characteristics.off characteristics.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.169-177
• /
• 2012

A non-decimation second-order spatial moving average (SMA) discrete-time (DT) filter is proposed with reconfigurable null frequencies. The filter coefficients are changeable, and it can be controlled by switching sampling capacitors. So, interferers can be rejected effectively by flexible nulls. Since it operates without decimation, it does not change the sample rate and aliasing problem can be avoided. The filter is designed with variable weight of coefficients as $1:{\alpha}:1$ where ${\alpha}$ varies from 1 to 2. This corresponds to the change of null frequencies within the range of fs/3~fs/2 and fs/2~2fs/3. The proposed filter is implemented in the TSMC 0.18-${\mu}m$ CMOS process. Simulation shows that null frequencies are changeable in the range of 0.38~0.49fs and 0.51~0.62fs.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.201-205
• /
• 1997

With the recent advance of Web and its associated technologies, information sharing on distribute computing environments has gained a great amount of attention from many researchers in many application areas, such as medicine, engineering, and business. One basic requirement of distributed medical consultation systems is that geographically dispersed, disparate participants are allowed to exchange information readily with each other. Such software also needs to be supported on a broad range of computer platforms to increase the software's accessibility. In this paper, the development of world-wide-web based medical consultation system or radiology imaging is addressed to provide the platform independence and great accessibility. The system supports sharing of 3-dimensional objects. We use VRML (Virtual Reality Modeling Language), which is the de-facto standard in 3-D modeling on the Web. 3-D objects are reconstructed from CT or MRI volume data using a VRML format, which can be viewed and manipulated easily in Web-browsers with a VRML plug-in. A Marching cubes method is used in the transformation of scanned volume data set to polygonal surfaces of VRML. A decimation algorithm is adopted to reduce the number of meshes in the resulting VRML file. 3-D volume data are often very large-sized, and hence loading the data on PC level computers requires a significant reduction of the size of the data, while minimizing the loss of the original shape information. This is also important to decrease network delays. A prototype system has been implemented (http://netopia.snu.ac.kr/-cyber/). and several sessions of experiments are carried out.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.5
• /
• pp.84-93
• /
• 2007

In this paper, a Radix-8 structure for high-speed FFT is propose. Main block of the proposed FFT structure is Radix-8 DIF(Decimation In Frequency) butterfly. Even throughput of the Radix-8 FFT is twice than that of the Radix-4 FFT, implementation area of the Radix-8 is larger than that of Radix-4 FFT. But, implementation area of the proposed Radix-8 FFT was reduced by using DA(Distributed Arithmetic) for multiplication. For comparison, the 64-point FFT was implemented using conventional Radix-4 butterfly and proposed Radix-8 butterfly, respectively. The Verilog-HDL coding results for the proposed FFT structure show 49.2% cell area increment comparison with those of the conventional Radix-4 FFT structure. Namely, to speed up twice, 49.2% of area cost is required. In case of same throughput, power consumption of the proposed structure is reduced by 25.4%. Due to its efficient processing scheme, the proposed FFT structure can be used in large size of FFT like OFDM Modem.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.6
• /
• pp.1369-1375
• /
• 2012

One of important problems in the theory of sequences is to determine the values and number of occurrences of each value taken on by the cross-correlation. In this paper, we find the values and the number of occurrences of each value of cross-correlation between an m-sequence u(t) of period $2^n-1$ and its decimation $u(dt)(0{\leq}t{\leq}2^n-2)$ where n=2m, 2s|m and $d=(2^{2m}+2^{2s+1}-2^{m+s+1}-1)/(2^s-1)$. Also we show that a family of decimations leads to a four-valued cross-correlation.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.885-888
• /
• 2000

Among the previous searching methods, there are the typical methods such as full search and three-step search, etc. Block motion estimation using exhaustive search is too computationally intensive. To apply in practice, recently proposed fast algorithms have been focused on reducing the computational complexity by limiting the number of searching points. According to the reduction of searching points, the quality performance is aggravated in those algorithms. In this paper, We present a fast and efficient search algorithm for block motion estimation that produces better quality performance and less computational time compared with a three-step search (TSS). Previously the proposed Two Step Search Algorithm (TWSS) by Fang-Hsuan Cheng and San-Nan sun is based on the ideas of dithering pattern for pixel decimation using a part of a block pixels for BMA (Block Matching Algorithm) and multi-candidate to compensate quality performance with several locations. This method has good quality performance at slow moving images, but has bad quality performance at fast moving images. To resolve this problem, the proposed algorithm in this paper considers spatial and temporal correlation using neighbor and previous blocks to improve quality performance. This performance uses neighbor motion vectors and previous motion vectors in addition, thus it needs more searching points. To compensate this weakness, the proposed algorithm uses statistical character of dithering matrix. The proposed algorithm is superior to TWSS in quality performance and has similar computational complexity