# Multiplierless perfect reconstruction modulated filter banks with sum-of-powers-of-two coefficients

@article{Chan2001MultiplierlessPR, title={Multiplierless perfect reconstruction modulated filter banks with sum-of-powers-of-two coefficients}, author={S. C. Chan and W. Liu and K. L. Ho}, journal={IEEE Signal Processing Letters}, year={2001}, volume={8}, pages={163-166} }

This paper proposes an efficient class of perfect reconstruction (PR) modulated filter banks (MFB) using sum-of-powers-of-two (SOPOT) coefficients. This is based on a modified factorization of the DCT-IV matrix and the lossless lattice structure of the prototype filter, which allows the coefficients to be represented in SOPOT form without affecting the PR condition. A genetic algorithm (GA) is then used to search for these SOPOT coefficients. Design examples show that SOPOT MFB with a good… Expand

#### 26 Citations

Perfect reconstruction integer-modulated filter banks

- Mathematics, Computer Science
- 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221)
- 2001

This work presents design methods for perfect reconstruction (PR) integer-modulated filter banks, including biorthogonal (low-delay) filter banks that are derived from the PR conditions known for cosine modulation to other, more general, modulation schemes. Expand

Modulated, perfect reconstruction filterbanks with integer coefficients

- Mathematics, Computer Science
- IEEE Trans. Signal Process.
- 2002

It is shown where the PR conditions on the prototype filters and the modulation matrices are entirely decoupled and where some simple coupling is introduced, and to find suitable integer modulation schemes, new algebraic methods are presented. Expand

Design of signed powers-of-two coefficient perfect reconstruction QMF Bank using CORDIC algorithms

- Mathematics, Computer Science
- IEEE Transactions on Circuits and Systems I: Regular Papers
- 2006

This paper proposes a structure of orthogonal QMF lattice with SPT coefficients, which has much denser discrete coefficient space than the conventional structure, and shows less coefficient quantization error than theventional Q MF lattice. Expand

Biorthogonal Recombination Nonuniform Cosine-Modulated Filter Banks and their Multiplier-Less Realizations

- Computer Science, Mathematics
- J. VLSI Signal Process.
- 2006

The theory, design and multiplier-less (ML) realization of a class of perfect reconstruction (PR) low-delay biorthogonal nonuniform cosine-modulated filter banks (CMFBs) based on a recombination (or merging) structure with very low implementation complexity is obtained. Expand

Design of Multiplierless IFIR based Cosine Modulated Filter Bank using QPSO

- Computer Science
- 2020 International Conference on Communication and Signal Processing (ICCSP)
- 2020

This paper presents an improved technique for designing nearly perfect cosine modulated multiplierless filterbank, based on interpolated finite impulse response filter (IFIR) and quantum behaved… Expand

Multiplier-less discrete sinusoidal and lapped transforms using sum-of-powers-of-two (sopot) coefficients

- Computer Science, Mathematics
- ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196)
- 2001

A new family of multiplier-less discrete cosine and sine transforms called the SOPOT DCTs and DSTs, which require only O(N log/sub 2/ N) additions, which is very attractive for VLSI implementation. Expand

Implementation of parallel cosine and sine modulated filter banks for equalized transmultiplexer systems

- Computer Science
- 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221)
- 2001

Efficient realization structures for the needed parallel filter bank system, which finds applications also in other areas are explored. Expand

An efficient coefficient coding scheme for low complexity implementation of pulse shaping filters in GSM receiver of a software radio

- Computer Science
- The 8th International Conference on Communication Systems, 2002. ICCS 2002.
- 2002

This paper uses an arithmetic scheme, known as pseudo floating-point (PFP) representation to encode the filter coefficients and shows that the filters can be coded using 8-bit PFP with hardware complexity that is considerably lower than conventional 24-bit and 16-bit fixed-point filters. Expand

Recursive Algorithms for Modulated and Extended Lapped Transforms

- Mathematics, Computer Science
- IEEE Transactions on Circuits and Systems I: Regular Papers
- 2014

The second objective is to propose a Goertzel-type of recursive algorithm for critically-sampled exponentially-modulated filter bank (EMFB), which suits well for problems where only a few subbands are processed from a much larger set of available subchannels. Expand

M-channel lifting-based design of paraunitary and biorthogonal filter banks with structural regularity

- Mathematics, Computer Science
- Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03.
- 2003

This paper presents a lifting-domain design of filter banks with a given McMillan degree, based on the M-channel lifting factorizations of the degree-0 and 1 building blocks, which guarantees perfect reconstruction (PR) even when the parameters are quantized. Expand

#### References

SHOWING 1-10 OF 11 REFERENCES

The design of two-channel lattice-structure perfect-reconstruction filter banks using powers-of-two coefficients

- Mathematics
- 1993

An optimization technique is presented for the design of two-channel lattice-structure perfect-reconstruction filter banks with powers-of-two coefficients. The filter coefficients are represented by… Expand

Perfect reconstruction modulated filter banks without cosine constraints

- Mathematics, Computer Science
- 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing
- 1993

The authors propose a set of constraints on the modulation to achieve PR while retaining the desirable power complementary conditions on the polyphase components and the complete solution is generated by the set of unitary matrices. Expand

Cosine-modulated FIR filter banks satisfying perfect reconstruction

- Mathematics, Computer Science
- IEEE Trans. Signal Process.
- 1992

A novel design procedure is presented based on the two-channel lossless lattice that enables the design of a large class of FIR (finite impulse response)-PR filter banks, and includes the N=2M case. Expand

The design of low complexity two-channel lattice-structure perfect-reconstruction filter banks using genetic algorithms

- Mathematics
- Proceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '97
- 1997

This paper considers the design of reduced complexity 2 band QMF filter banks. In order to ensure perfect reconstruction, a lattice architecture has been adopted. Genetic algorithms are used to… Expand

Discrete-coefficient linear-phase prototypes for PR cosine-modulated filter banks

- Mathematics, Computer Science
- Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181)
- 1998

A method for the design of perfect reconstruction (PR) linear-phase prototypes for cosine-modulated filter banks with discrete coefficients is presented, based on a subspace approach that allows to linearly combine PR prototype filters in such a way that the resulting filter also is a PR prototype. Expand

The GenLOT: generalized linear-phase lapped orthogonal transform

- Mathematics, Computer Science
- IEEE Trans. Signal Process.
- 1996

A class of lapped orthogonal transforms with extended overlap (GenLOTs) is developed as a subclass of the general class of LPPUFB as a method to process finite-length signals. Expand

Lapped transforms for efficient transform/subband coding

- Mathematics, Computer Science
- IEEE Trans. Acoust. Speech Signal Process.
- 1990

Two lapped transforms for subband/transform coding of signals are introduced: a version of the lapped orthogonal transform (LOT), which can be efficiently computed for any transform length; and the… Expand

Extended lapped transforms: properties, applications, and fast algorithms

- Mathematics, Computer Science
- IEEE Trans. Signal Process.
- 1992

The extended lapped transform (ELT) is introduced, as a generalization of the previously reported modulated lapping transform (MLT), which is a promising substitute for traditional block transforms in transform coding systems, and also a good substitute for less efficient filter banks in subband coding systems. Expand

Fast algorithms for the discrete W transform and for the discrete Fourier transform

- Mathematics
- 1984

A systematic method of sparse matrix factorization is developed for all four versions of the discrete W transform, the discrete cosine transform, and the discrete sine transform, as well as for the… Expand

Multiplier-Less Sinusoidal Transforms using SOPOT Coefficients

- Int. Rep., Univ. Hong Kong, Hong Kong, 1999.
- 1999