This chapter shows that the MDCT analysis polyphase matrix can be factorized into three simple building blocks: a sparse “folding” matrix, a diagonal delay matrix, and a DCT-IV transform. This reveals why MDCT/IMDCT implementations are efficient and how perfect reconstruction (PR) follows from simple algebraic properties of the factors.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Sparse Matrices and the MDCT

  • Gerald Schuller

摘要

This chapter shows that the MDCT analysis polyphase matrix can be factorized into three simple building blocks: a sparse “folding” matrix, a diagonal delay matrix, and a DCT-IV transform. This reveals why MDCT/IMDCT implementations are efficient and how perfect reconstruction (PR) follows from simple algebraic properties of the factors.