基于FPGA的FIR滤波器高效实现

本文针对在FPGA中实现FIR滤波器的关键--乘法运算的高效实现进行研究,首先给出了将乘法转化为查表的DA算法,然后简要介绍整数的CSD表示和我们根据FPGA实现要求改进的最优表示;接着,本文讨论了在离散系数空间得到FIR滤波器系数最优解的混合整数规划方法;最后采用这一方法设计了最优表示离散系数FIR滤波器,通过FPGA仿真验证这一方法是可行的和高效的.     

FIR滤波器的FPGA高效实现和巧妙验证

为了降低FIR滤波器对FPGA资源的消耗,同时能够直接验证其滤波性能,本文介绍了基于加法器网络的FIR滤波器的实现方法,以及系数的CSD码、最优CSD码表示方法,并引出了更加高效的简化加法器网络法.以一个32阶FIR低通滤波器的实现为例说明了设计的过程,巧妙结合MATALB与QuartusⅡ对所设计的滤波器进行了验证.实践表明,该方法节约资源,调试方便.     

一种基于MATLAB及FPGA的FIR低通滤波器的设计与实现

充分利用有限冲击响应数字滤波器(Finite Impulse Response digital filter,FIR)系数的对称特性,借助于MAT-LAB语言和现场可编程门阵列(FPGA)实现了一种高效的低通滤波器。设计过程中通过简化的VHDL语言编写程序,实现了加减乘法运算,使用优化的CSD编码技术缩短了乘法器的运算时间,采用FPGA滤波器芯片和QuartusⅡ软件搭建仿真电路、用Matlab软件进行理论验证。实验结果基本符合理论值,验证了此种滤波器的实现方法简单,计算速度快,节省硬件资源,抗干扰能力强,灵活,性能优于传统的FIR滤波器。     

网络、滤波、滤波器、限辐器

0600704 PZT6．5MHz压电陶瓷波器的设计与工艺研究[刊, 中]／毛剑波／／合肥工业大学学报(自然科学版),- 2005,28(10)．-1353-1355(C) 0600705 FIR滤波器的FPGA高效实现和巧妙验证[刊,中]／丁丹／／电子科技．-2005,(9)．-29-32(D) 为了降低FIR滤波器对FPGA资源的消耗,同时能够直接验证其滤波性能,本文介绍了基于加法器网络的FIR滤波器的实现,以及系数的CSD码、最优 CSD码表示方法,并引出了更加高效的简化加法器网     

基于FPGA的FIR数字滤波器的优化设计

提出采用正则有符号数字量（CSD）编码技术实现FIR滤波器。首先分析了FIR数字滤波器理论及常用设计方法的不足,然后介绍了二进制数的CSD编码技术及其特点,给出了其于CSD编码的定点常系数FIR滤波器设计过程,使用VHDI,语言实现了该常系数滤波器的行为描述。最后在Max＋PlusⅡ环境下进行实验仿真和验证,与DA和2C编码算法比较结果表明,用CSD编码技术实现的滤波器可以有效提高运算速度并降低FPGA芯片的面积占用。     

基于FPGA的高效FIR滤波器设计与实现

给出了一种基于FPGA的数字滤波器的设计方法.该方法先通过MATLAB设计出一个具有具体指标FIR滤波器,再对滤波器系数进行处理,使之便于在FPGA中实现,然后采用基于分布式算法和CSD编码的滤波器结构进行设计,从而避免了乘法运算,节约了硬件资源,其流水线的设计方式也提高了运行速度.Matlab和Modelsim防真表明,该设计功能正确,能实现快速滤波     

基于FPGA的FIR滤波器的设计与实现

提出了一种基于FPGA的FIR滤波器设计方案.介绍了基于FPGA的FIR滤波器的数字信号处理的算法设计,采用直接型的基本结构来设计,通过1位乘以8位的乘法,然后再移位相加的方法即可得到结果,其运算效率明显提高,并结合先进的EDA软件进行高效的设计和实现,并给出了用Max＋PlusⅡ运行的仿真结果.该设计对FPGA硬件资源的利用高效合理,用VHDL编程,在FPGA中实现了高采样率的FIR滤波器.     

可编程FIR滤波器的FPGA实现

介绍了FIR滤波器的基本的线性相位结构及FIR滤波器的抽头系数SD算法编码。给定滤波器的数字指标,用MATLB设计抽头系数,最后用Verilog HDL语言实现了一个16阶的FIR低通滤波器并在QuartusⅡ上仿真,并对仿真结果与理论值进行比较,波形仿真结果和理论值相吻和,最后将编程数据文件下载到FPGA芯片上。对于不同性能的FIR滤波器,抽头系数是变化的,因此只要对本设计的抽头系数重新在线配置,就可以实现不同的FIR滤波器。     

数字多普勒系统中的窄带滤波器的设计方法

随着软件无线电技术的发展,使信号的采样频率越来越高,而在高采样率的条件下,进行窄带FIR滤波器的设计是非常困难的。本文采用多抽样率结构来设计窄带FIR滤波器,使窄带FIR滤波器易于实现。另外利用多级结构并使用特殊滤波器可以有效地实现窄带FIR滤波器,通过多个滤波器的级联,放宽了对每个滤波器的要求,从而使滤波器的总的乘法系数个数减少,乘法运算率减小,同时又不增加滤波器结构的复杂。     

基于DA算法的高速FIR滤波器

FIR滤波器的DA算法与改进 1 FIR滤波器结构 一个直接N阶FIR滤波器的信号流程见图1A,其转置结构见图1B. 2 FIR滤波器的DA算法实现原理 下面介绍如何用查表方式实现乘法运算.     

FPGA-based digit-serial CSD FIR filter for image signal format conversion

This paper proposes the FPGA implementation of the digit-serial Canonical Signed-Digit (CSD) coefficient FIR filters which can be used as format conversion filters in place of the ones employed for the MPEG2 TM 5 (test model 5). Canonical representation of a signed digit (CSD) is a method used to reduce cost by representing a signed number using the least amount of non-zero digits, thereby reducing the number of multiply operations. As Field Programmable Gate Arrays (FPGAs) have grown in capacity, improved in performance, and decreased in cost, they are becoming a viable solution for performing computationally intensive tasks, with the ability to tackle applications formerly reserved for custom chips and programmable digital signal processing (DSP) devices. A digit-serial CSD FIR filter design is realized and practical design guidelines are provided using FPGAs. An analysis of the performance comparison of bit-serial, serial distributed arithmetic, and digit-serial CSD FIR filters on a Xilinx XC4000XL-series FPGA is described. The results show that the proposed digit-serial CSD FIR filter is compact and an efficient implementation of real-time DSP applications on FPGAs.     

Low power and high-speed implementation of fir filters for software defined radio receivers

The most computationally intensive part of the wideband receiver of a software defined radio (SDR) is the intermediate frequency (IF) processing block. Digital filtering is the main task in IF processing. The computational complexity of finite impulse response (FIR) filters used in the IF processing block is dominated by the number of adders (subtracters) employed in the multipliers. This paper presents a method to implement FIR filters for SDR receivers using minimum number of adders. We use an arithmetic scheme, known as pseudo floating-point (PFP) representation to encode the filter coefficients. By employing a span reduction technique, we show that the filter coefficients can be coded using considerably fewer bits than conventional 24-bit and 16-bit fixed-point filters. Simulation results show that the magnitude responses of the filters coded in PFP meet the attenuation requirements of wireless communication standard specifications. The proposed method offers average reductions of 40% in the number of adders and 80% in the number of full adders needed for the coefficient multipliers over conventional FIR filter implementation methods     

A Tutorial on Multiplierless Design of FIR Filters: Algorithms and Architectures

Finite impulse response (FIR) filtering is a ubiquitous operation in digital signal processing systems and is generally implemented in full custom circuits due to high-speed and low-power design requirements. The complexity of an FIR filter is dominated by the multiplication of a large number of filter coefficients by the filter input or its time-shifted versions. Over the years, many high-level synthesis algorithms and filter architectures have been introduced in order to design FIR filters efficiently. This article reviews how constant multiplications can be designed using shifts and adders/subtractors that are maximally shared through a high-level synthesis algorithm based on some optimization criteria. It also presents different forms of FIR filters, namely, direct, transposed, and hybrid and shows how constant multiplications in each filter form can be realized under a shift-adds architecture. More importantly, it explores the impact of the multiplierless realization of each filter form on area, delay, and power dissipation of both custom (ASIC) and reconfigurable (FPGA) circuits by carrying out experiments with different bitwidths of filter input, design libraries, reconfigurable target devices, and optimization criteria in high-level synthesis algorithms.     

High Performance Reconfigurable FIR Filter Architecture Using Optimized Multiplier

In mobile communication systems and multimedia applications, need for efficient reconfigurable digital finite impulse response (FIR) filters has been increasing tremendously because of the advantage of less area, low cost, low power and high speed of operation. This article presents a near optimum low- complexity, reconfigurable digital FIR filter architecture based on computation sharing multipliers (CSHM), constant shift method (CSM) and modified binary-based common sub-expression elimination (BCSE) method for different word-length filter coefficients. The CSHM identifies common computation steps and reuses them for different multiplications. The proposed reconfigurable FIR filter architecture reduces the adders cost and operates at high speed for low-complexity reconfigurable filtering applications such as channelization, channel equalization, matched filtering, pulse shaping, video convolution functions, signal preconditioning, and various other communication applications. The proposed architecture has been implemented and tested on a Virtex 2 xc2vp2-6fg256 field-programmable gate array (FPGA) with a precision of 8-bits, 12-bits, and 16-bits filter coefficients. The proposed novel reconfigurable FIR filter architecture using dynamically reconfigurable multiplier block offers good area and speed improvement compared to existing reconfigurable FIR filter implementations.     

基于CSD算法的高阶FIR滤波器优化设计

在通信或雷达领域的高速实时信号处理中，通常包含大量的高速高阶FIR滤波器的设计。例如在雷达信号处理中，要进行数字正交采样和脉冲压缩器的设计，要求滤波器速率高，阶数大，运算量非常大。若使用DSP芯片则需多片处理完成，使得系统的工作延迟长、成本高、功耗大、调试困难。该文根据CSD（Canonic Signed—Digital）算法的思想，实现了高阶高速FIR滤波器的优化设计。该算法可显著降低算法的运算量，可用可编程逻辑器件迅速快捷地完成系统的硬件设计。文中举例用Altera公司的FPGA来实现数字正交采样和脉冲压缩滤波器算法优化，进行了实验验证，最后给出了结果比较和分析，证明这对基于FPGA的高阶FIR滤波器的设计有实际意义。     

Application of Reconfigurable CORDIC Architectures

Reconfiguration enables the adaption of Coordinate Rotation DIgital Computer (CORDIC) units to the specific needs of sets of applications, hence creating application specific CORDIC-style implementations. Reconfiguration can be implemented at a high level, taking the entire CORDIC unit as a basic cell (CORDIC-cells) implemented in VLSI, or at a low level such as Field-Programmable Gate Arrays (FPGAs). We suggest a design methodology and analyze area/time results for coarse (VLSI) and fine-grain (FPGA) reconfigurable CORDIC units. For FPGAs we implement CORDIC units in Verilog HDL and our object-oriented design environment, PAM-Blox. For CORDIC-cells, multiple reconfigurable CORDIC modules are synthesized with state-of-the-art CAD tools. At the algorithm level we present a case study combining multiple CORDICs based on a geometrical interpretation of a normalized ladder algorithm for adaptive filtering to reduce latency and area of a fully pipelined CORDIC implementation. Ultimately, the goal is to create automatic tools to map applications directly to reconfigurable high-level arithmetic units such as CORDICs.     

Pipelined array-based FIR filter folding

The elaborate design of folded finite-impulse response (FIR) filters based on pipelined multiplier arrays is presented in this paper. The design is considered at the bit-level and the internal delays of the pipelined multiplier array are fully exploited in order to reduce hardware complexity. Both direct and transposed FIR filter forms are considered. The carry-save and the carry-propagate multiplier arrays are studied for the filter implementations. Partially folded architectures are also proposed which are implemented by cascading a number of folded FIR filters. The proposed schemes are compared as to the aspect of hardware complexity with a straightforward implementation of a folded FIR filter based on the pipelined Wallace Tree multiplier. The comparison reveals that the proposed schemes require 20%-30% less hardware. Finally, efficient implementation of partially folded FIR filter circuits is presented when constraints in area, power consumption and clock frequency are given.     

Study of Algorithmic and Architectural Characteristics of Gaussian Particle Filters

In this paper, we analyze algorithmic and architectural characteristics of a class of particle filters known as Gaussian Particle Filters (GPFs). GPFs approximate the posterior density of the unknowns with a Gaussian distribution which limits the scope of their applications in comparison with the universally applied sample-importance resampling filters (SIRFs) but allows for their implementation without the classical resampling procedure. Since there is no need for resampling, we propose a modified GPF algorithm that is suitable for parallel hardware realization. Based on the new algorithm, we propose an efficient parallel and pipelined architecture for GPF that is superior to similar architectures for SIRF in the sense that it requires no memories for storing particles and it has very low amount of data exchange through the communication network. We analyze the GPF on the bearings-only tracking problem and the results are compared with results obtained by SIRF in terms of computational complexity, potential throughput, and hardware energy. We consider implementation on FPGAs and we perform detailed comparison of the GPF and SIRF algorithms implemented in different ways on this platform. GPFs that are implemented in parallel pipelined fashion on FPGAs can support higher sampling rates than SIRFs and as such they might be a more suitable candidate for real-time applications.     

Multiplication-Free Polynomial-Based FIR Filters with an Adjustable Fractional Delay

An efficient coefficient quantization scheme is described for minimizing the cost of implementing fixed parallel linear-phase finite impulse response (FIR) filters in the modified Farrow structure introduced by Vesma and Saramaki for generating FIR filters with an adjustable fractional delay. The implementation costs under consideration are the minimum number of adders and subtracters when implementing these parallel subfilters as a very large-scale integration (VLSI) circuit. Two implementation costs are under consideration to meet the given criteria. In the first case, all the coefficient values are implemented independently of each other as a few signed-powers-of-two terms, whereas in the second case, the common subexpressions within all the coefficient values included in the overall implementation are properly shared in order to reduce the overall implementation cost even further. The optimum finite-precision solution is found in four steps. First, the number of filters and their (common odd) order are determined such that the given criteria are sufficiently exceeded in order to allow some coefficient quantization errors. Second, those coefficient values of the subfilters having a negligible effect on the overall system performance are fixed to be zero valued. In addition, the experimentally observed attractive connections between the coefficient values of the subfilters, after setting some coefficient values equal to zero, are utilized to reduce both the implementation cost and the parameters to be optimized even more. Third, constrained nonlinear optimization is applied to determine for the remaining infinite-precision coefficients a parameter space that includes the feasible space where the given criteria are met. The fourth step involves finding in this space the desired finite-precision coefficient values for minimizing the given implementation costs to meet the stated overall criteria. Several examples are included illustrating the efficiency of the proposed synthesis scheme.     

FPGA implementation of multiplierless M-QAM modulator

Adaptive multilevel QAM (M-QAM) modulation can increase throughput in a wireless packet data network. A technique is discussed for efficiently realising M-QAM modulators on field programmable gate arrays (FPGAs) using 'multiplierless' finite impulse response (FIR) filters with carry-save addition and canonic signed-digit coefficients. An adaptive M-QAM modulator supporting 4, 16, 64 and 256-QAM is presented