Loading...
Please wait, while we are loading the content...
Similar Documents
FIR Filter Design With Farrow Structure Using Genetic Algorithm
| Content Provider | Semantic Scholar |
|---|---|
| Author | Singh, Amritpal Dhillon, Naveen Bains, Sukhpreet Singh Riet, Hod Ece |
| Copyright Year | 2013 |
| Abstract | This paper proposes method to design variable fractional-delay (FD) filters using the Farrow structure. In the transfer function of the Farrow structure, different sub filters are weighted by different powers of the FD value. The variable fractional delay (VFD) digital filters as an important class of the variable digital filters have been receiving increasingly attention in the past decade. Under tuning a controlling parameter, this kind of filters changes continuously a delay, which is a fraction of the sampling period.VFD filters have many applications in different areas of signal processing and communication, for example, time adjustment in digital receivers, speech coding and synthesis, time delay estimation and analog–digital (A/D) conversion, etc. A method for developing VFD filters is also an essential technique for the fractional linear discrete-time systems. Theoretically speaking, the design of variable digital filters under optimal sense is more complicated and difficult than the design of fixed delay filters, since the impulse response or the poles and zeros of the filters are some type of functions in the variable parameter are generally assumed to be polynomial functions. Therefore sub optimal approaches for the design of variable digital filters should be investigated for the purpose of reducing the computation complexity. For instance the twostage approach, i.e. designing a set of fixed-coefficient filters and then fitting each of the coefficients as polynomials has been proposed. Recently advances have been made on the design of some type of VFD filters, such as finite-impulse response (FIR) VFD filters and infinite-impulse response (IIR) all pass VFD filters. Large numbers of coefficients should be designed; related iteration algorithms still feature considerable computation complexity. Examples illustrate our proposed method and Comparisons, to various earlier designs show a reduction of the arithmetic complexity. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.ijcotjournal.org/volume-3/issue-9/IJCOT-V3I9P110.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
