Name
Abstract | ||
|---|---|---|
Block digital filtering is a powerful tool to reduce the computational complexity of digital filtering systems. However, due to their block structure, block digital filters (BDFs) are time-varying linear systems, hence, their design is not easy. The most widely spread approaches to BDF design consist of constraining the BDF to be time-invariant (by restricting the design process to a specific subset of possible solutions) and then using conventional filter synthesis techniques. In this paper, we do not restrict the design process, and we propose a simple and optimal matrix-oriented approach to optimize the BDF coefficients. Furthermore, the proposed approach takes profit of the structure of transform-based BDFs to considerably reduce the computational complexity and memory requirements of the design process. Experimental results confirm that as expected, the obtained global distortion is lower than the distortion obtained with a traditional technique such as overlap-save. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/TSP.2004.828911 | IEEE Transactions on Signal Processing |
Keywords | Field | DocType |
— block digital filters,quadratic criterion,design process,overlap-save,bdf design,block structure,global distortion,optimum design,bdf coefficient,transform-based bdfs,optimal design,aliasing,transform-based block,computational complexity,optimal matrix-oriented approach,time- varying systems,digital filter,matrix decomposition,convolution,process design,digital filters,filtering,linear system,profitability,design optimization | Mathematical optimization,Digital filter,Linear system,Control theory,Systems design,Optimal design,Aliasing,Engineering design process,Distortion,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
52 | 7 | 1053-587X |
Citations | PageRank | References |
2 | 0.70 | 3 |
Authors | ||
1 | ||