• Title/Summary/Keyword: Fast fixed point algorithm

Search Result 35, Processing Time 0.024 seconds

A Fixed-Point Error Analysis of fast DCT Algorithms (고정 소수점 연산에 의한 고속 DCT 알고리듬의 오차해석)

  • 연일동;이상욱
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.40 no.4
    • /
    • pp.331-341
    • /
    • 1991
  • The discrete cosine transform (DCT) is widely used in many signal processing areas, including image and speech data compression. In this paper, we investigate a fixed-point error analysis for fast DCT algorithms, namely, Lee [6], Hou [7] and Vetterli [8]. A statistical model for fixed-point error is analyzed to predict the output noise due to the fixed-point implementation. This paper deals with two's complement fixed-point data representation with truncation and rounding. For a comparison purpose, we also investigate the direct form DCT algorithm. We also propose a suitable scaling model for the fixed-point implementation to avoid an overflow occurring in the addition operation. Computer simulation results reveal that there is a close agreement between the theoretical and the experimental results. The result shows that Vetterli's algorithm is better than the other algorithms in terms of SNR.

  • PDF

Image Feature Extraction Using Independent Component Analysis of Hybrid Fixed Point Algorithm (조합형 Fixed Point 알고리즘의 독립성분분석을 이용한 영상의 특징추출)

  • Cho, Yong-Hyun;Kang, Hyun-Koo
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.6 no.1
    • /
    • pp.23-29
    • /
    • 2003
  • This paper proposes an efficient feature extraction of the images by using independent component analysis(ICA) based on neural networks of the hybrid learning algorithm. The proposed learning algorithm is the fixed point(FP) algorithm based on Newton method and moment. The Newton method, which uses to the tangent line for estimating the root of function, is applied for fast updating the inverse mixing matrix. The moment is also applied for getting the better speed-up by restraining an oscillation due to compute the tangent line. The proposed algorithm has been applied to the 10,000 image patches of $12{\times}12$-pixel that are extracted from 13 natural images. The 144 features of $12{\times}12$-pixel and the 160 features of $16{\times}16$-pixel have been extracted from all patches, respectively. The simulation results show that the extracted features have a localized characteristics being included in the images in space, as well as in frequency and orientation. And the proposed algorithm has better performances of the learning speed than those using the conventional FP algorithm based on Newton method.

  • PDF

Fixed-point Optimization of a Multi-channel Digital Hearing Aid Algorithm (다중 채널 디지털 보청기 알고리즘의 고정 소수점 연산 최적화)

  • Lee, Keun Sang;Baek, Yong Hyun;Park, Young Chul
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.2 no.2
    • /
    • pp.37-43
    • /
    • 2009
  • In this study, multi-channel digital hearing aid algorithm for low power system is proposed. First, MDCT(Modified Discrete Cosine Transform) method converts time domain of input speech signal into frequency domain of it. Output signal from MDCT makes a group about each channel, and then each channel signal adjusts a gain using LCF(Loudness Compensation Function) table depending on hearing loss of an auditory person. Finally, compensation signal is composed by TDAC and IMDCT. Its all of process make progress 16-bit fixed-point operation. We use fast-MDCT instead of MDCT for reducing system complexity and previously computed tables instead of log computation for estimating a gain. This algorithm evaluate through computer simulation.

  • PDF

Fast Computation Algorithm of Fresnel Holograms Using Recursive Addition Method (반복 가산 기법을 이용한 Fresnel 홀로그램의 고속 계산 알고리듬)

  • Choi, Hyun-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5C
    • /
    • pp.386-394
    • /
    • 2008
  • For digital holographic video system, it is important to generate digital hologram as fast as possible. This paper proposed a fixed-point method and fast generation method that can calculate the Fresnel hologram using operation of whole-coordinate recursive addition. To compute the digital hologram, 3D object is assumed to be a collection of depth-map point generated using a PC. Our algorithm can compute a phase on a hologram by recursive addition with fixed-point format at a high speed. When we operated this algorithm on a personal computer, we could maximally compute digital hologram about 70% faster than conventional method and about 30% faster than of [3]'s method.

Fixed Point Algorithm for GPS Measurement Solution (GPS 관측치 위치계산을 위한 부동점 알고리즘)

  • Lim, Samsung
    • Journal of Advanced Navigation Technology
    • /
    • v.4 no.1
    • /
    • pp.45-49
    • /
    • 2000
  • A GPS measurement solution, in general, is obtained as a least squares solution since the measurement includes errors such as clock errors, ionospheric and tropospheric delays, multipath effect etc. Because of the nonlinearity of the measurement equation, we utilize the nonlinear Newton algorithm to obtain a least squares solution, or mostly, use its linearized algorithm which is more convenient and effective. In this study we developed a fixed point algorithm and proved its availability to replace the nonlinear Newton algorithm and the linearized algorithm. A nonlinear Newton algorithm and a linearized algorithm have the advantage of fast convergence, while their initial values have to be near the unknown solution. On the contrary, the fixed point algorithm provides more reliable but slower convergence even if the initial values are quite far from the solution. Therefore, two types of algorithms may be combined to achieve better performance.

  • PDF

A fast DCT algorithm with reduced propagation error in the fixed-point compuitation (고정 소수점 연산시 오차의 전파를 줄이는 고속 이산 여현 변환 알고리즘)

  • 정연식;이임건;최영호;박규태
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.9A
    • /
    • pp.2365-2371
    • /
    • 1998
  • Discrete cosine transform (DCT) has wide applications in speech and image coding. In this paper, we propose a novel fast dCT scheme with the property of reduced multiplication stages and the smaller number of additions and multiplications. This exploits the symmetry property of the DCT kernel to decompose the N-point dCT to N/2 point, and can be generally applied recursively to $2^{m}$-point. The proposed algorithm has a structure that most of multiplications tend to be performed at final stage, and this reduces propagation of truncation error which could occur in the fixed-point computation. Also the minimization of the multiplication stages further decreases the error.

  • PDF

A Study on the Extraction of Basis Functions for ECG Signal Processing (심전도 신호 처리를 위한 기저함수 추출에 관한 연구)

  • Park, Kwang-Li;Lee, Jeon;Lee, Byung-Chae;Jeong, Kee-Sam;Yoon, Hyung-Ro;Lee, Kyoung-Joung
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.4
    • /
    • pp.293-299
    • /
    • 2004
  • This paper is about the extraction of basis function for ECG signal processing. In the first step, it is assumed that ECG signal consists of linearly mixed independent source signals. 12 channel ECG signals, which were sampled at 600sps, were used and the basis function, which can separate and detect source signals - QRS complex, P and T waves, - was found by applying the fast fixed point algorithm, which is one of learning algorithms in independent component analysis(ICA). The possibilities of significant point detection and classification of normal and abnormal ECG, using the basis function, were suggested. Finally, the proposed method showed that it could overcome the difficulty in separating specific frequency in ECG signal processing by wavelet transform. And, it was found that independent component analysis(ICA) could be applied to ECG signal processing for detection of significant points and classification of abnormal beats.

MPPT Control of Photovoltaic using Variable IC Method (가변 IC 방법을 이용한 태양광 발전의 MPPT 제어)

  • Ko, Jae-Sub;Chung, Dong-Hwa
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.26 no.8
    • /
    • pp.27-34
    • /
    • 2012
  • This paper proposes variable incremental conductance(IC) algorithm for maximum power point tracking(MPPT) control of photovoltaic. The conventional perturbation & observation(PO) and IC MPPT control algorithm generally uses fixed step size. A small step size reduces a tracking error in the steady state but slows a tracking speed in the transient state. Also, a large step size is fast a tracking speed but increases a tracking error. Therefore, this paper proposes variable IC MPPT algorithm that adjust automatically step size according to operating conditions. To improve a tracking speed and accuracy, when operating point is far from the maximum power point(MPP), the step size uses maximum value and when a operating point is near from the MPP, the step size uses variable step size that adjust according to slope of P-V curve. The validity of MPPT algorithm proposed in this paper prove through compare with conventional PO and IC MPPT algorithm.

Fixed-point Optimization of a QRS complex Detection Algorithm Using Wavelet Transform (웨이블릿을 이용한 QRS complex 검출 알고리즘의 고정 소수점 연산 최적화)

  • Park, Young-chul
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.7 no.3
    • /
    • pp.126-131
    • /
    • 2014
  • In this study, QRS complex is detected by Wavelet Transform and it can be worked in 32bit fixed point operation thought optimization. First, ECG signal is passed though band pass filter. Second, it is transformed using one-band combined wavelet function from 3-band wavelet function. Third, it is passed though moving window integral. Finally, QRS complex is detected by decision rule. The proposed algorithm is evaluated using MIT-BIH arrhythmia database. Its all of process make progress 32-bit fixed-point operation and it makes table that high complexity operations like trigonometrical function. The detection algorithm evaluate through computer simulation.

Concurrent Support Vector Machine Processor (Concurrent Support Vector Machine 프로세서)

  • 위재우;이종호
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.8
    • /
    • pp.578-584
    • /
    • 2004
  • The CSVM(Current Support Vector Machine) that is a digital architecture performing all phases of recognition process including kernel computing, learning, and recall of SVM(Support Vector Machine) on a chip is proposed. Concurrent operation by parallel architecture of elements generates high speed and throughput. The classification problems of bio data having high dimension are solved fast and easily using the CSVM. Quadratic programming in original SVM learning algorithm is not suitable for hardware implementation, due to its complexity and large memory consumption. Hardware-friendly SVM learning algorithms, kernel adatron and kernel perceptron, are embedded on a chip. Experiments on fixed-point algorithm having quantization error are performed and their results are compared with floating-point algorithm. CSVM implemented on FPGA chip generates fast and accurate results on high dimensional cancer data.