{"title":"正、逆MDCT的新递归算法","authors":"V. Nikolajevic, Gerhard Fettweis","doi":"10.1109/SIPS.2001.957330","DOIUrl":null,"url":null,"abstract":"Forward and inverse MDCT (modified discrete cosine transform) are two of the most computationally intensive operations in the MPEG audio coding standard. We derive sinusoidal recursive formulas for transforming kernels of the MDCT and IMDCT. Then we efficiently implement general length MDCT and IMDCT using the regressive structure derived from the sinusoidal recursive formulas. The proposed regular structure is particularly suitable for parallel VLSI realization. Our solution requires less hardware than a recently proposed one.","PeriodicalId":246898,"journal":{"name":"2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"New recursive algorithms for the forward and inverse MDCT\",\"authors\":\"V. Nikolajevic, Gerhard Fettweis\",\"doi\":\"10.1109/SIPS.2001.957330\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Forward and inverse MDCT (modified discrete cosine transform) are two of the most computationally intensive operations in the MPEG audio coding standard. We derive sinusoidal recursive formulas for transforming kernels of the MDCT and IMDCT. Then we efficiently implement general length MDCT and IMDCT using the regressive structure derived from the sinusoidal recursive formulas. The proposed regular structure is particularly suitable for parallel VLSI realization. Our solution requires less hardware than a recently proposed one.\",\"PeriodicalId\":246898,\"journal\":{\"name\":\"2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIPS.2001.957330\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIPS.2001.957330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New recursive algorithms for the forward and inverse MDCT
Forward and inverse MDCT (modified discrete cosine transform) are two of the most computationally intensive operations in the MPEG audio coding standard. We derive sinusoidal recursive formulas for transforming kernels of the MDCT and IMDCT. Then we efficiently implement general length MDCT and IMDCT using the regressive structure derived from the sinusoidal recursive formulas. The proposed regular structure is particularly suitable for parallel VLSI realization. Our solution requires less hardware than a recently proposed one.