TY - GEN
T1 - Fast algorithm and common structure design of recursive analysis and synthesis quadrature mirror filterbanks for digital radio mondiale
AU - Li, An Kai
AU - Lei, Sheau Fang
AU - Tsai, Wen Kai
AU - Lai, Shin Chi
PY - 2014/1/1
Y1 - 2014/1/1
N2 - This paper proposed a novel fast algorithm and common structure design of analysis and synthesis quadrature mirror filterbanks (AQMF, SQMF) on the spectral band replication (SBR) in digital radio mondiale (DRM). Based on recent Lai et al.'s concept, an extended issue is addressed from the view point of recursively computing the AQMF and SQMF coefficients. The proposed method also combines with the lifting scheme algorithm and canonical signed digit (CSD) multiplication. The results show that the proposed AQMF algorithm has a great improvement on computational complexity. For the recursive kernel computation (N=64), the proposed method has, respectively, 46.38% of multiplication reductions and 20.46% of addition reductions which can cover the shortcoming of the proposed SQMF. The overall complexity of the proposed algorithm (N=64) requires 1984 real multiplication and 128 CSD multiplication, 4704 real addition and 192 CSD addition, and 113 coefficients. It would be more efficient and more suitable than previous works for DRM applications.
AB - This paper proposed a novel fast algorithm and common structure design of analysis and synthesis quadrature mirror filterbanks (AQMF, SQMF) on the spectral band replication (SBR) in digital radio mondiale (DRM). Based on recent Lai et al.'s concept, an extended issue is addressed from the view point of recursively computing the AQMF and SQMF coefficients. The proposed method also combines with the lifting scheme algorithm and canonical signed digit (CSD) multiplication. The results show that the proposed AQMF algorithm has a great improvement on computational complexity. For the recursive kernel computation (N=64), the proposed method has, respectively, 46.38% of multiplication reductions and 20.46% of addition reductions which can cover the shortcoming of the proposed SQMF. The overall complexity of the proposed algorithm (N=64) requires 1984 real multiplication and 128 CSD multiplication, 4704 real addition and 192 CSD addition, and 113 coefficients. It would be more efficient and more suitable than previous works for DRM applications.
UR - http://www.scopus.com/inward/record.url?scp=84907396796&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84907396796&partnerID=8YFLogxK
U2 - 10.1109/ISCAS.2014.6865356
DO - 10.1109/ISCAS.2014.6865356
M3 - Conference contribution
AN - SCOPUS:84907396796
SN - 9781479934324
T3 - Proceedings - IEEE International Symposium on Circuits and Systems
SP - 1199
EP - 1202
BT - 2014 IEEE International Symposium on Circuits and Systems, ISCAS 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE International Symposium on Circuits and Systems, ISCAS 2014
Y2 - 1 June 2014 through 5 June 2014
ER -