A width-recursive depth-first tree search approach for the design of discrete coefficient perfect reconstruction lattice filter bank
The lattice structure two-channel orthogonal filter bank structurally guarantees the perfect reconstruction (PR) property. Thus, it is eminently suitable for hardware realization even under severe coefficient quantization condition. Nevertheless, its frequency response is still adverse...
Saved in:
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/91742 http://hdl.handle.net/10220/6723 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | The lattice structure two-channel orthogonal filter bank structurally guarantees the perfect reconstruction (PR) property.
Thus, it is eminently suitable for hardware realization even under severe coefficient quantization condition. Nevertheless, its
frequency response is still adversely affected by coefficient quantization.
In this paper, a novel recursive-in-width depth-first tree search technique is presented for the design of lattice structure PR
orthogonal filter banks subject to discrete coefficient value constraint.
A frequency-response deterioration measure is developed to serve as a branching criterion. At any node, the coefficient which will cause the largest deterioration in the frequency response of the filter when quantized is selected for branching. The improvement in the frequency response ripple magnitude achieved by our algorithm over that by simple rounding of coefficient values differs widely from example to example ranging from a fraction of a decibel to over 10 dB. |
|---|