Design of Area Efficient FIR Filter Architecture for
Fixed and Reconfigurable Applications
P.Anuradha(1) Bodikela Ramya (2) 1Sr. Asst. Prof., Dept of ECE, S R Engineering College, Hasanparthy, Warangal. 2PG Scholar, Dept of ECE, S R Engineering College, Hasanparthy, Warangal.
Abstract-The FIR filters are intrinsic and facilitate
a continuous multiplication of different forms. The
system of FIR filters (MCM) which leads to
substantial computational savings. Nevertheless,
contrary to the configuration of the direct form,
transposing the structure of the form does not
explicitly help block processing. This article
discusses the FIR block filter 's potential for
transposing formats to effectively deploy large
scale FIR filters for both fixed and reconfiguration
purposes. We obtained a flow graph for
transposing FIR type blocks with optimized
registry-complexity based on an in-depth
computational study of the transpose shape
configuration of the FIR filter. For the FIR filter
type switch, a simplified
We purchased a different multiplier-based design
for the proposed Transposition block filter for
configurable applications. A layout with a low
complexity is also accessible with the MCM
scheme for block implementation of fixed FIR
filters. A slightly decreased ADP and reduced
power sampling (EPS) relative to the existing
direct-form implementation system for medium or
wide filters, the new structure includes fewer ADP
and less EPS than the previous specification for a
direct-form implementation system for structure.
The findings of the application's integrated circuit
synthesis reveal that the suggested structure for
block 4 and filter length 64 is 42 per cent less
ADP and 40 per cent less EPS.
Reconfigurable applications proposed system. The
suggested design involves a 13% reduction in
ADP and a 12.8% reduction in EPS for the same
filter size and block size as the current FIR Direct-
block
Index Terms β Block processing, Finite Pulse
Response (FIR) filter, Reconfigurable
architecture, VLSI.
I. INTRODUCTION
Digital FIR filters are commonly used for
various automated signage management
technologies, such as speech recognition, loud
speaker equalization, echo cancellation, automatic
sound cancellation and other communications
applications, such as SDR, etc. Many such
applications need large-scale FIR filters to satisfy
stringent frequency [2]β[4] specifications.
Such filters are very frequently used to
lead to higher sampling rates for high-speed digital
communication [5]. Nevertheless, with the filter
order the number of multiplications and nutrients
required for each output of the filter increases
linearly. As there's no redundant estimate in the
FIR filter algorithm, implementing a broad FIR
filter in real time, in an environment limited by
capital, is a difficult task. Switch coefficients most
frequently remain ongoing in signal processing
systems and are a priori established. This function
was used to reduce multiplication complexity.
Different scientists have suggested many
methods for accurate evaluation of the distributed
High Technology Letters
Volume 26, Issue 7, 2020
ISSN NO : 1006-6748
http://www.gjstx-e.cn/451
arithmetic (DA) method and the MCM [7],[11]β
[13] FIR amplifiers (with fixed coefficients).
Lookup lists (LUTs) are used to view tests
from pre computers using DA-based designs to
lower computational complexity.
And, on the other hand, the MCM
approach reduces the number of additions needed
by exchanging sub-expression in common
multiply a set of constants data. The MCM
Scheme is more effective when multiplying the
dominant equation with more constants. The
MCM scheme can also be used for applying FIR
filters which have defined high-order values. But
the transpose type FIR-screen setup can only build
MCM frames.
Block handling method is commonly used
to obtain constructions of high performance
software. It not only offers a performance-scalable
interface but also improves the efficiency of area
delays. Extracting matrix-based FIR structures is
easy when using direct-form configuration [13],
while transposing type does not help block the
handling immediately. However, to benefit from
the MCM's computational advantages, it is
necessary to make the FIR filter by setting the
transpose form. In addition, the structures of the
transposition type are normally pipelined and can
have higher operating speed to facilitate higher
sampling speeds.
Applications such as the SDR channeling
device, which supports multi-standardized
wireless networking, include FI Removable
Hardware Filters [6]. Several models have been
suggested during the past decade for the successful
deployment of reconfigurable FIRs (RFIRs) using
total multipliers and current inversion systems [7]β
[10]. A vector-scaling technique was proposed for
the RFIR filter architectureTo reduce the precision
of Chen and Chiueh [8], a CSD-based RFIR
message (Canonic Sign Number) has been
proposed for test results with no significant effect
on sample conduction. Nevertheless, the general
reconfiguration is important and does not provide
an effective framework for delays. Because of
their broad regional range, the [7] and [8]
architectures are best suited for reduced flow
controls and are not suitable for flow tests.
This suggested a constant shifting system
(CSM) and a programmable mechanism for
transferring FIR filters in [9]. The innovative
DFIR filter architecture based on DA that Park and
Meher recently suggested [10].
Multiplier-based transfer of either
immediate setup or shape arrangement to existing
structure [9] less structures are used to multiply
the configuration of the transpose type, while[10]
instantaneous DA-based modeling setup is used.
But we do not discover block-based design of any
RFIR filters in the literature. A block based RFIR
construction can be quickly obtained with the
system proposed and [12]. Nevertheless, we found
that the block structure acquired and did not work
for the large filter sizes and differing filter levels
such as SDR channeling. The suggested
application methods [12] and [13] are thus more
suitable for 2-D FIR filters than for preventing
medium
In this paper, we explore the possibility to
effectively perform large-grade FIR filters on field
errors using the transposition-shaped Fir vector
filter, to benefit from MCM constructions and the
inherent flow.
Applications which can be reconfigured or fixed.
The primary support for this paper is those
members. Transpose FIR Filter Computational
Analysis Setup, stream map extraction for
Transpose FIR Filter Type Block with reduced log
complexity against the filter matrix FIR structure.
The pattern in the transpose matrix filter, for
reconfigurable applications.
High Technology Letters
Volume 26, Issue 7, 2020
ISSN NO : 1006-6748
http://www.gjstx-e.cn/452
A low-complexity building method with MCM
scheme to execute the block request with FIR
filters. The remainder of this paper is set out
below.
II.LITERATURE
The design suggested by Pramod Kumar Meher in
2006 was substantially reduced in memory and
region error difficulty in comparison to the current
circular convolution based DA systems.
Furthermore, the suggested systolic models for
linear convolution can also be used for the
calculation of close convolution. Basant Kumar
Mohanty and Pramod Kumar Meher (2015)
explores the option of implementing FIR-filters for
both set and reconfigurable apps in a transpose
setup to effective area-delay implementation of big
class FIR filters.
Yu Pan and Pramod Kumar Meher (2014) put
forward a minimization of resources issue in the
programming of adder tree activities of the MCM
frame and an approach centered on blended linear
programming (MIP) to enhance efficiency of FIR
filtering depending on the MCM.
Reports from practice show that the already
configured adder / subtractor network of the MCM
system can be accomplished by a decrease of up to
15 percent in the surface area and an energy
decrease of 11.6 percent by an average of 8.46
percent and 5.96 cents respectively.
Abbes Amira, Pramod Kumar Meherand
Shrutisagar Chandrasekaran (2008) provided one-
and two-dimensional totally pipeline code
architecture optimizations for efficient execution
by using arithmetic-based distribution (DA) to
achieve effective area, limit and energy output.
The systolic transformation system provides a
versatile decision of the email duration of the
search sheets (LUT) in order to determine the
appropriate zone moment trade off.. The systemic
regression system It is noted that the storage
volume can be reduced by using lower instruction
spans for DA-based computation devices, but that
this will boost the cost and latency of the adder.
Adaptive FIR Filter Architectures for Run-Time
Reconfigurable FPGAs: von Neumann's Group
111 has already been studying the development of
numbers by a maximum. After this, the steady
multiplication of the CSD numeral system has
been first substituted by changes and adjustments.
The issue was subsequently broadened to several
steady multiplications (MCM). MCM solutions are
often referred to as prevalent storage or removal
(CSWCSE) of sub expressions.
In [5,6], the FIR models have been revealed to
have highly optimized constant coefficients using
frequent under expression shared. Research in the
sector of constant coefficient regression has
focused on designing FIR filters that are
stationary, ie non adjustable.
But the outcomes obtained in this domain can also
be used for active FIR processing through the use
of run-time reconfiguration. Optimization of FP-
GAS multipliers with constant coefficients was
researched in SI for instance. The multipliers were
optimized without the disclosure of sub-
expressions in this research.
A MCM optimization protocol for fixed-
coefficient matrix goods has been implemented for
reconfigurable equipment; sub-expression
exchange has been drawn into consideration. In
case area is saved by dividing the design into
several configurations, the possibility to use run-
time reconfiguration using the CSS method is
presented. The Thought of a number of
organizations [ IO, I 1]
Proposed the update of continuous values by run-
time reconfiguration. 121. This was used in
destination identification and cellular networks,
for instance. In our highest understanding,
however, continuous coefficient reconfiguration of
linear FIR processing was not used.
High Technology Letters
Volume 26, Issue 7, 2020
ISSN NO : 1006-6748
http://www.gjstx-e.cn/453
The N-length FIR filter return can be calculated
with the ratio of the ratio BLOCK
TRANSPOSE COMPUTATIONAL
ANALYSIS AND MATHEMATIC FORM
π¦(π) = β β(π). π₯(π β π).πβ1π=0 .............. (1)
The recurrence relationship can express
the calculation of (1).
A. CT Transpose FIR data-flow sample graphs for
N=6 filter duration (DFG-1 and DFG-2), as shown
in the figure. 1. First moment ever.
(i)
(ii)
Two successive outputs are provided for (2){y(n),
y(n β1)}. The component prices in Fig DFG-1 and
DFG-2 and the storage routes thereof. 1 The
graphs DFT-1 and DFT-2 shall be shown in Fig. 2.
The DFT-1 and spears of the Figure. DFT-2.
High Technology Letters
Volume 26, Issue 7, 2020
ISSN NO : 1006-6748
http://www.gjstx-e.cn/454
The procurement path represents the item. We
found that five ranks of DFT-1 rows are the same
as those of the DFT-2 rank digits (fig. 2 in red).
Such repeated measurements can be avoided by
the use of unregulated registration series, as seen
in figure DFG-1 and DFG-2. 3. For non-
overlapping registration combinations DFT-3 and
DFT-4 of DFG-1 and DFG-2 appear respectively.
(3(a), (b), and (b ) , respectively). As indicated in
the photo. 3(a) and (b) are not DFT-3 and DFT-4
equivalents; the results are easy to find in Fig
DFT-3 and DFT-4 White Cells. 3(a) and (b) are
output y(n), while the others are output y(nβ1) for
DFT-3 and DFT-4. The Fig's DFG. 1 Proper
conversion of the DFT-3 and DFT-4 computations
is required.
B. The non-overlapping computer DFT-3
transformation and DFT-4 calculation can be
carried out by the DFG-3 cluster, shown in the
figure. 4. We refer to it that prevents the FIR filter
configuration of type-I matrix. The DFG-3 may be
reprogrammed for the Fig DFG-4. Note that both
Type I and Type II settings have a multiplier /
adders setting, but Type II configuration contains
nearly L times fewer waiting parts than Type II
configurations. The Matrix configuration is the
same in number as Type II.
Type-I configuration. Therefore we used block
transposition type-II configuration to acquire the
proposed structure.
For a particular understanding of the block-based
FIR sort transpose filters, we present the matrix
Transpose Form-II FIR Filter mathematical
Model.
C. Mathematical formulation of the FIR Filter
Transpose Block:
System type-I then we used type-II configuration
for block transposition to achieve the proposed
structure.
We present the matrix Transpose Form-II FIR
Filter mathematical model. h for a specific
understanding of the block-based FIR sort
transpose filters.
Definition of weight of vector as
h=[β(0), β(1)β¦ . . β(π β 1)]π input matrix Xk
ππ = [π₯π0π₯π
1π₯πβ¦β¦..2 π₯πβ¦β¦β¦β¦β¦β¦β¦β¦
4 π₯ππβ1]β¦ (4)
π₯ππ ππ π‘βπ(π + 1)π‘βππππ’πππππ₯ππππππππππππππ
π₯ππ = [π₯(ππΏ β π)π₯(ππΏ β π β 1)β¦ . . π₯(ππΏ β π β πΏ
+ 1)]π β¦β¦β¦β¦β¦β¦β¦ . . (5)
High Technology Letters
Volume 26, Issue 7, 2020
ISSN NO : 1006-6748
http://www.gjstx-e.cn/455
By substituting 4 in 3
π¦π = β π₯ππ . β(π)β¦β¦ . (6)
πβ1
π=0
Suppose N is a composite amount that is
decomposed as N= M L, then coefficient I is
specified as I= l+ mL, 0 lβ 1, and 0 m β M β 1.
We have replaced I= l+ mL in (5)
πππ+ππΏ = π₯πβπ
π β¦β¦β¦β¦β¦β¦β¦ . . (7)
Substituting (7)in (4),then
ππ = [π₯π0π₯π
1β¦β¦ . π₯ππΏβ1π₯πβ1
0 β¦ . . π₯πβ1πΏβ1β¦
. . π₯πβπ+11 β¦ . . π₯πβπ+1
πΏβ1 ]β¦β¦(8)
Substituting (8) in(3),then
π¦π = β β π₯πβπππβ1
π=0πΏβ1π=0 . β(π + ππΏ) β¦β¦ (9)
An interesting feature is the entry matrix π₯π of (8).
The present unit is the information sectionπ₯π0,
whereas {π₯πβ10 , π₯πβ2
0 , β¦β¦ . . π₯πβπ+10 } are Blocks
delayed by 1, 2,β¦β¦(M-1). The blocks
overlapping { {π₯πβ11 , π₯πβ2
1 β¦ . π₯πβπΏ+11 } is 1 cpu
cycle, 2 cpu periods, alternatively. (M β 1)
periods postponed overlapping π₯π1unit version. To
take advantage of this feature, the Xk input matrix
is broken down into small πππ matrices, so thatππ
0
contains L input blocks{π₯π0, π₯π
1, β¦β¦ . . π₯ππΏβ1 and S1
k contain, π₯π1, β¦β¦ . . π₯πβ1
πΏβ1.Output block. Similarly,
the{π₯πβπ+10 , π₯πβπ+1
1 β¦ . π₯πβπ+1πΏβ1 entry block. is the
πππβ1 index.
The vector coefficient h is also decomposed into
tiny vectors of weight cm={ h(mL), h(mL+1),.
That h (mL + L β 1)}.
Interestingly, πππ is symmetrical and satisfies the
identity as follows:
πππ = ππβπ
0 β¦β¦β¦β¦β¦(10)
According to (10),πππ (for 1 β€ m β€ M β 1) is a
postponed m-clock sequence with regard toππ0 .
Computation of (9) can be displayed in the matrix-
vector combination usingππβπ0 and cm.
π¦π = β ππππβ1
π=0 β¦β¦β¦β¦β¦β¦β¦.. (11a)
πππ = ππβπ
0 . ππβ¦β¦β¦β¦β¦β¦..β¦(11b)
The (11) calculations can be displayed in a
recurring manner.
π(π§) = π0(π§)[(π§β1(β¦ . (π§β1(π§β1ππβ1 + ππβ2) +
ππβ3) +β―β¦ . ) + π1) + π0]β¦β¦.(12)
The translucent shape of the DFG-4 can be
acquired from the S ^0(z) and Y(z) describing S
k^0and Yk on the z-domain (shown in Fig . 5 for
N= 6 and L= 2). The boundary operator { zβ1}
(12) describes a delay in transposing form frame
that retains the and cm element for a data
component of type I.
III. STRUCTURES OF PROPOSED
The FIR filter rates remain constant in certain
cases; in others, such as the SDR channeling
method, different FIR filters are needed to obtain
one of the requisite narrowband streams from the
wide bandβs RF front end. To support multi-
standard wireless communication [6], these FIR
filters have to be placed in an RFIR structure. We
display a cluster FIR filter structure for such
reconfigurable apps. This segment addresses the
design of FIR block filters for fixed filters and the
usage of MCM-systems.
A. Proposed FIR filter for reconfigurable
application
Figure [based on the (12)) recurrence connection]
indicates a possible cluster structure of the FIR
filter. 6 For Block volume L=4. This contains one
unit CSU, one RU, and one cell Pipeline Adder
(PAU). CSU consists of a single CSU.
The CSU will then shop all filter variables for a
reconfigurable query. In a single clock cycle, the
NROM LUTs are used to obtain some particular
High Technology Letters
Volume 26, Issue 7, 2020
ISSN NO : 1006-6748
http://www.gjstx-e.cn/456
value of the channel filter, where N denotes the
filter frequency. The RU receives xk in stage kth,
and concurrently generates L rows of S0 k. The
suggested structure is transmitted to M IPUs with
lines of S0 k. CSU also offers short-weight vectors
for the M IPUs.
To achieve the (m+ 1)th IPU over the kth period
from the CSU and L lines of the S k^0
variablecMβmβ1 from the RU. Every IPU
conducts a function with a short-weight vector cm
S k^0 matrix-vector and defines the range of
partial filter inputs. Each IPU conducts L in
product measurements of the S k^0 L lines with a
vector cm of prevalent weight. The (m+1) th IPU
structure is shown in diagram. (B) chapter 7(b).
In-product neurons (IPCs) produce L volume of L-
point. This IPC (l+ 1)th earns the total (l+ 1)th (S)
of all matrix coefficients cs, the (l+ 1)th bank of
this law r(kL β l) of(0)l of the internal product
r(kL β l). The Figure demonstrates the inner
configuration of (l+ 1)th L= 4 IPC.
All M IPU functions simultaneously and generates
blocks of M results (rkm). The PAU adds that[in
Fig.]. 8(b)] to obtain the output filter section L. --
method is supplied with a collection of L inputs
and a block of L filter outputs is generated when T
= TM+TA+TFA log2 L is used by - phase, TM is
a multiplier period, TA is an adder period and
TFA is an adder time.
B. MCM-Fixed-coefficient FIR filter
implementation
We are debating the collection and configuration
of the proposed MCM elements set filter structure
for the transpose FIR filter system. The CSU of
Fig is used with a fixed ratio use. (A) (A)
High Technology Letters
Volume 26, Issue 7, 2020
ISSN NO : 1006-6748
http://www.gjstx-e.cn/457
(b)
The structure needs to be adapted to a Single filter,
and is no longer essential. Similarly there is no
need for IPUs. For a low-complexity application
the multiplications will be converted to the MCM
units.
We show that the model suggested for the
FIR filter system method centered on MCM uses
the symmetry in the S0 k entry to eliminate the
prevalent sub expression [17] horizontally and
vertically and to reduce the quotas in the MCM
stack.
One may see the recurrence of (12) as an
alternative.
π(π§) = π§β1β¦β¦π§β1(π§β1ππβ1 + ππβ2 +
ππβ3) + β― .+π1 + π0β¦β¦β¦β¦β¦β¦.(13)
The M auxiliary information rates rm can
be calculated using the relationship for 0β€mβ€M-1.
π = ππ0. πΆβ¦β¦β¦β¦β¦β¦β¦(14)
R and c defined as
π = [π0ππ1
π β¦β¦ . ππβ1π ]β¦β¦... (15a)
πΆ = [π0ππ1
πβ¦β¦β¦ππβ1π ]β¦β¦. (15b)
For L=4 and N=16 the computation of
(14) is shown as the matrix product given by (16).
The input panel of (16) consists of six input
specimens {x(4k)}, x(4k β 2), x(4k β 3) >, as
shown in Table I. (16), is obvious. x(4k β 6) (3).
The MCM may be placed in the index
matrix, horizontally and vertically, as seen in
Table I. Sample x(4kβ3) is shown in the four
previous rows and four sides.
Table1- MCM in transpose form block fir
filter of length 16 and block size 4. As it shows
x(4k) in a single column or rows.
For this function, all four lines of the
MCM coefficient matrix are taken by the x(4k β
3), although only the first lines of the MCM
coefficients are concerned. The size of the matrix
coefficient line is bigger for larger numbers of N
or lower blocks, and all samples have a higher
High Technology Letters
Volume 26, Issue 7, 2020
ISSN NO : 1006-6748
http://www.gjstx-e.cn/458
MCM value that saves computer effort.
In the figure are displayed the possible MCM
frames for block size L= 4 FIR filters. 9 For
illustrative purposes. Six MCM sections
corresponding to six samples are used in the
design of the MCM-based system (see Fig. 9).
That MCM block produces the conditions of the
elements as set out in Table I.
The sub-expressions of MIC matrices are inserted
into the adder network in conjunction with a
matrix of (14) for 0 / l β 1 and 0 km from L-1 and
0 km from product β 1 for created internal product
scores.
Ultimately, Fig's PAU introduces the
characteristics of the internal product. 8(b) Data
stream. 8(b) Strong- and time-complexity. The
suggested reconfigurable implementation system
comprises a single CSU, an RU, a M IPU, and a
PAU. The CSUC consists of N ROM units of P
words each, whereas P reflects the quantity of FIR
filters that a proposed reset system will enforce.
Compared to effectiveness we reduced CSU
confusion, as it is normal in all RFIR systems.
Each IPU contains L-IP neurons, each containing
L multipliers and (L-1) adders. The records for the
B-bit cycle are included in the RU (L β 1).
The PAU contains L(Mβ1) adders and the same
quantity of slots where each register has an input
pixel size and a sample value of (B+B), B, and B.
The suggested system contained L N multipliers,
L(Nβ1) adders, and FFs (Swing Flops), as well as
L procedures at each point using
T=[TM+TA+TFA(Log2 L)) and L-N multipliers
and L-adders at each level of the framework.
Based on the RFIR multipliers in the literature, we
don't consider a FIR structure in direct-form
matrix. It is therefore possible to get a FIR block
structure centered on a direct-form multiplier from
the picture structure[15].We obtained the FIR
structure in the direct matrix[15, eq. (4)] the
architecture and instantaneous performance are
calculated for comparative purposes ..
VI. RESULTS & SIMULATION
The findings indicate a definite area gain from RFI
RFIR over previous algorithms for traditional
filters with comparable peak-clock size. In fact,
the industry relevance of the transposed FIR with
multiplier block architecture and RSG algorithm
was created, in contrast to filters implementing
distributive arithmetic technology. Throughout
this segment we presented a less complicated
programmable multiplier for low-area, low-power
and high-speed FIR deployments focused on the
method of inserting and moving, and prevalent
High Technology Letters
Volume 26, Issue 7, 2020
ISSN NO : 1006-6748
http://www.gjstx-e.cn/459
removal of sub expression. Our methods were
validated using Spartan-III systems, where
important regions and energy cuts were identified
using traditional distributed arithmetic methods
and
SIMULATION RESULT:
RTL SCHEMATIC:
TECHNOLOGICAL SCHEMATIC:
DESIGN SUMMARY:
TIMING REPORT:
V.CONCLUSION
In this document we explored the possibility of
utilizing FIR block filters in the Transpose Type
configuration to effectively run both defined and
reconfigurable applications. For the transposite
shape block FIR filter a general block model is
given and a transpose type block model for
reconfigurable apps was obtained on this basis.
We implemented a scheme for the identification of
MCM blocks for the horizontal and vertical
removal of sub expression inside the proposed FIR
system to minimize computational difficulty by
fixed coefficients. The efficiency comparison
shows that the proposed design has significantly
less ADP and less EPS compared to the current
direct-form block structure for medium or large
filter s
.
REFERENCES:
[1] J. G. Praxis and D. G. Melonakos, Digital
Signal Processing: Principles, Algorithms and
Applications. Upper Saddle River, NJ, USA:
Prentice-Hall, 1996.
[2] T. Hatchel and G. Fettweis, βSoftware radio
receivers,β in CDMA Techniques for Third
Generation Mobile Systems. Dordrecht, The
Netherlands: Kluwer, 1999, pp. 257β283.
High Technology Letters
Volume 26, Issue 7, 2020
ISSN NO : 1006-6748
http://www.gjstx-e.cn/460
[3] E. Mirchandani, R. L. Zinser, Jr., and J. B.
Evans, βA new adaptive noise cancellation scheme
in the presence of crosstalk [speech signals],βIEEE
Trans. Circuits Syst. II, Analog Digit. Signal
Process., vol. 39, no. 10, pp. 681β694, Oct. 1995.
[4] D. Xu and J. Chiu, βDesign of a high-order
FIR digital filtering and variable gain ranging
seismic data acquisition system,β inProc. IEEE
Southeastcon, Apr. 1993, p. 1β6.
[5] J. Mitola, Software Radio Architecture:
Object-Oriented Approaches to Wireless Systems
Engineering. New York, NY, USA: Wiley, 2000.
[6] A. P. Vinod and E. M. Lai, βLow power and
high-speed implementation of FIR filters for
software defined radio receivers,βIEEE Trans.
Wireless Commun., vol. 7, no. 5, pp. 1669β1675,
Jul. 2006.
[7] J. Park, W. Jeong, H. Mahmoodi-Meimand, Y.
Wang, H. Choo, and K. Roy, βComputation
sharing programmable FIR filter for low-power
and high-performance applications,β IEEE J. Solid
State Circuits, vol. 39, no. 2, pp. 348β357, Feb.
2004.
[8] K.-H. Chen and T.-D. Chiueh, βA low-power
digit-based reconfigurable FIR filter,βIEEE Trans.
Circuits Syst. II, Exp. Briefs, vol. 53, no. 8, pp.
617β621, Aug. 2006.
[9] R. Mahesh and A. P. Vinod, βNew
reconfigurable architectures for implementing FIR
filters with low complexity,βIEEE Trans.
Comput.-Aided Design Integr. Circuits Syst., vol.
29, no. 2, pp. 275β288, Feb. 2010.
[10] S. Y. Park and P. K. Meher, βEfficient FPGA
and ASIC realizations of a DA-based
reconfigurable FIR digital filter,βIEEE Trans.
Circuits Syst. II, Exp. Briefs, vol. 61, no. 7, pp.
511β515, Jul. 2014.
[11] P. K. Meher, βHardware-efficient
systemization of DA-based calculation of finite
digital convolution,βIEEE Trans. Circuits Syst. II,
Exp. Briefs, vol. 53, no. 8, pp. 707β711, Aug.
2006.
[12] P. K. Meher, S. Chandrasekaran, and A.
Amira, βFPGA realization of FIR filters by
efficient and flexible systemization using
distributed arithmetic,βIEEE Trans. Signal
Process, vol. 56, no. 7, pp. 3009β3017, Jul. 2008.
[13] P. K. Meher, βNew approach to look-up-table
design and memorybased realization of FIR digital
filter,β IEEE Trans. Circuits Syst. I, Reg. Papers,
vol. 57, no. 3, pp. 592β603, Mar. 2010.
High Technology Letters
Volume 26, Issue 7, 2020
ISSN NO : 1006-6748
http://www.gjstx-e.cn/461
Top Related