Generalized triangular decomposition in transform coding
IEEE Transactions on Signal Processing
Generalized triangular transform coding
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
| Hi-index | 35.69 |
A new nonunitary transform called the prediction-based lower triangular transform (PLT) is introduced for signal compression. The new transform has the same decorrelation property as the Kahurnen-Loeve transform (KLT), but its implementational cost is less than one half of KLT. Compared with the KLT, the design cost of an M×M PLT is much lower and is only of the order of O(M2). Moreover, the PLT can be factorized into simple building blocks. Using two different factorizations, we introduce two minimum noise structures that have roughly the same complexity as the direct implementation of PLT. These minimum noise structures have the following properties: (1) its noise gain is unity even though the transform is nonunitary; (2) perfect reconstruction is structurally guaranteed; (3) it can be used for both lossy/lossless compression. We show that the coding gain of PLT implemented using the minimum noise structure is the same as that of KLT. Furthermore, universal transform coders using PLT are derived. For AR(1) process, the M×M PLT has a closed form and needs only (M-1) multiplications and additions