• Title/Summary/Keyword: FIR structure

Search Result 164, Processing Time 0.021 seconds

Design of a Recursive Structure-based FIR Digital Filter (재귀 구조에 기반한 FIR 디지털 필터의 설계)

  • Jae-Jin Lee;David Tien;Gi-Yong Song
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.5 no.2
    • /
    • pp.159-164
    • /
    • 2004
  • This paper proposes a new digital filter implementation which adopts an identical structure at both behavioral and logic level in top-down design. This methodology is based on the observation that multiplication is a form of convolution and carrying, and therefore multiplication is implemented with the same structure as that of a convolution in a recursive manner at the logic level. In order to demonstrate a recursive structure-based FIR digital filter, we select L-tap transposed and systolic FIR filters, and implement them to have a single structure. The proposed filter design becomes regular and modular because of the recursive adoption of a single structure for convolutions, and is very compact in that it needs only two 1-bit I/O ports in addition to significant improvement on hardware complexity without time penalty on the output sequence.

  • PDF

Fast short length running FIR structure in discrete wavelet adaptive algorithm

  • Lee, Chae-Wook
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.13 no.1
    • /
    • pp.19-25
    • /
    • 2012
  • An adaptive system is a well-known method for removing noise from noise-corrupted speech. In this paper, we perform a least mean square (LMS) based on wavelet adaptive algorithm. It establishes the faster convergence rate of as compared to time domain because of eigenvalue distribution width. And this paper provides the basic tool required for the FIR algorithm whose algorithm reduces the arithmetic complexity. We consider a new fast short-length running FIR structure in discrete wavelet adaptive algorithm. We compare FIR algorithm and short-length fast running FIR algorithm (SFIR) to the proposed fast short-length running FIR algorithm(FSFIR) for arithmetic complexities.

An Optimal FIR Filter for Discrete Time-varying State Space Models (이산 시변 상태공간 모델을 위한 최적 유한 임펄스 응답 필터)

  • Kwon, Bo-Kyu
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.12
    • /
    • pp.1183-1187
    • /
    • 2011
  • In this paper, an optimal FIR (Finite-Impulse-Response) filter is proposed for discrete time-varying state-space models. The proposed filter estimates the current state using measured output samples on the recent time horizon so that the variance of the estimation error is minimized. It is designed to be linear, unbiased, with an FIR structure, and is independent of any state information. Due to its FIR structure, the proposed filter is believed to be robust for modeling uncertainty or numerical errors than other IIR filters, such as the Kalman filter. For a general system with system and measurement noise, the proposed filter is derived without any artificial assumptions such as the nonsingular assumption of the system matrix A and any infinite covariance of the initial state. A numerical example show that the proposed FIR filter has better performance than the Kalman filter based on the IIR (Infinite- Impulse-Response) structure when modeling uncertainties exist.

RECURSIVE FIR FILTERS FOR DISCRETE TIME-INVARIANT STATE-SPACE MODELS (순환형 FIR 필터)

  • Gwon, O-Gyu;Gwon, Uk-Hyeon
    • Proceedings of the KIEE Conference
    • /
    • 1986.07a
    • /
    • pp.140-144
    • /
    • 1986
  • In this paper an FIR(finite impulse response) filter and smoother are introduced for discrete time-invariant state-space models with driving noises. The FIR structure not only quarantees the BIBO stability and the robustness to parameter changes but also improves the filter divergence problem. It is shown that the impulse responses of the FIR filter and the smoother are obtained by Riccati-type difference equations and that they are to be time-invariant and reduced to very simple forms. For implementational purpose, recursive forms of the FIR filler and smoother are derived with each other used as the adjoint variable.

  • PDF

A Study on the Characteristics of Delay Parameter Change in Approximately Reconstruction IIR/FIR QMF Filter Banks (근사 복원 IIR/FIR QMF 필터뱅크에서 지연요소 변화에 따른 특성에 관한 연구)

  • 이상준;김남수;김남호
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2003.06a
    • /
    • pp.296-299
    • /
    • 2003
  • This paper shows a novel and simple IIR/FIR QMF(quadrature mirror filter) filter banks, mixed IIR and FIR structure. Here, FIR filters used for phase compensation. In this paper, we introduced analysis and synthesis filter banks, which used FIR linear phase filters and all pass filters. In result, phase response of analysis and synthesis filter banks become approximately linear characteristic. Simultaneously, a liasing distortion can be completely canceled.

  • PDF

fast running FIR filter structure based on Wavelet adaptive algorithm for computational complexity (웨이블렛 기반 적응 알고리즘의 계산량 감소에 적합한 Fast running FIR filter에 관한 연구)

  • Lee, Jae-Kyun;Lee, Chae-Wook
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2005.11a
    • /
    • pp.250-255
    • /
    • 2005
  • In this paper, we propose a new fast running FIR filter structure that improves the convergence speed of adaptive signal processing and reduces the computational complexity. The proposed filter is applied to wavelet based adaptive algorithm. Actually we compared the performance of the proposed algorithm with other algorithm using computer simulation of adaptive noise canceler based on synthesis speech. As the result, the frequency domain algorithm is prefer than the existent time domain. we analyzed the Wavelet algorithm, short-length fast running FIR algorithm, fast-short-length fast running FIR algorithm and proposed algorithm.

  • PDF

A High-speed/Low-power CSD Linear Phase FIR Filter Structure Using Vertical Common Sub-expression (수직 공통패턴을 사용한 고속/저전력 CSD 선형위상 FIR 필터 구조)

  • 장영범;양세정
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4A
    • /
    • pp.324-329
    • /
    • 2002
  • In the high-speed/low-power digital filter applications like wireless communication systems, canonical signed digit(CSD) linear phase finite impulse response(FIR) filter structures are widely investigated. In this paper, we propose a high-speed/low-power CSD linear phase FIR filter structure using vertical common sub-expression. In the conventional linear phase CSD filter, horizontal common sub-expressions are utilized due to the inherent horizontal common sub-expression of symmetrical filter coefficients. We use the fact that their MSBs are also equal since adjacent filter coefficients have similar values in the linear phase filter Through the examples, it is shown that our proposed structure is more efficient in case that precision of implementation is lower, and tap length are longer.

Harmonic Estimation of Power Signal Based on Time-varying Optimal Finite Impulse Response Filter (시변 최적 유한 임펄스 응답 필터 기반 전력 신호 고조파 검출)

  • Kwon, Bo-Kyu
    • The Journal of Korean Institute of Information Technology
    • /
    • v.16 no.11
    • /
    • pp.97-103
    • /
    • 2018
  • In this paper, the estimation method for the power signal harmonics is proposed by using the time-varying optimal finite impulse response (FIR) filter. To estimate the magnitude and phase-angle of the harmonic components, the time-varying optimal FIR filter is designed for the state space representation of the noisy power signal which the magnitude and phase is considered as a stochastic process. Since the time-varying optimal FIR filter used in the proposed method does not use any priori information of the initial condition and has FIR structure, the proposed method could overcome the demerits of Kalman filter based method such as poor estimation and divergence problem. Due to the FIR structure, the proposed method is more robust against to the model uncertainty than the Kalman filter. Moreover, the proposed method gives more general solution than the time-invariant optimal FIR filter based harmonic estimation method. To verify the performance and robustness of the proposed method, the proposed method is compared with time-varying Kalman filter based method through simulation.

A Constrained Receding Horizon Estimator with FIR Structures

  • Kim, Pyung-Soo;Lee, Young-Sam
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.3 no.4
    • /
    • pp.289-292
    • /
    • 2001
  • This paper concerns with a receding horizon estimator (RHE) for discrete-time linear systems subject to constraints on the estimate. In solving the optimization for every horizons, the past all measurement data outside the horizon is discarded and thus the arrival cost is not considered. The RHE in the current work is a finite impulse response (FIR) structure which has some good inherent properties. The proposed RHE can be represented in the simple matrix form for the unconstrained case. Various numerical examples demonstrate how including constraints in the RHE can improve estimation performance. Especially, in the application to the unknown input estimation, it will be shown how the FIR structure in the RHE can improve the estimation speed.

  • PDF

A fast running FIR Filter structure reducing computational complexity

  • Lee, Jae-Kyun;Lee, Chae-Wook
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.45-48
    • /
    • 2005
  • In this paper, we propose a new fast running FIR filter structure that improves the convergence speed of adaptive signal processing and reduces the computational complexity. The proposed filter is applied to wavelet based adaptive algorithm. Actually we compared the performance of the proposed algorithm with other algorithm using computer simulation of adaptive noise canceler based on synthesis speech. As the result, We know the proposed algorithm is prefer than the existent algorithm.

  • PDF