Generalized triangular transform coding

A general family of optimal transform coders (TC) is introduced here based on the generalized triangular decomposition (GTD) developed by Jiang, et al. This family includes the Karhunen-Loeve transform (KLT), and the prediction-based lower triangular transform (PLT) introduced by Phoong and Lin, as special cases. The coding gain of the entire family, with optimal bit allocation, is equal to those of the KLT and the PLT. Even though the PLT is not applicable for vectors which are not blocked versions of scalar wide sense stationary (WSS) processes, the GTD based family includes members which are natural extensions of the PLT, and therefore also enjoy the so-called MINLAB structure of the PLT which has the unit noise-gain property. Other special cases of the GTD-TC are the GMD (geometric mean decomposition) and the BID (bidiagonal transform). The GMD in particular has the property that the optimal bit allocation (which is required for achieving the maximum coding gain) is a uniform allocation, thereby eliminating the need for bit allocation.1

[1]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2]  P. P. Vaidyanathan,et al.  MIMO Transceivers With Decision Feedback and Bit Loading: Theory and Optimization , 2010, IEEE Transactions on Signal Processing.

[3]  Yi Jiang,et al.  The generalized triangular decomposition , 2007, Math. Comput..

[4]  P. P. Vaidyanathan,et al.  The Theory of Linear Prediction , 2008, Synthesis Lectures on Signal Processing.

[5]  Yi Jiang,et al.  MIMO Transceiver Design via Majorization Theory , 2007, Found. Trends Commun. Inf. Theory.

[6]  Dirk T. M. Slock,et al.  A theoretical high-rate analysis of causal versus unitary online transform coding , 2006, IEEE Transactions on Signal Processing.

[7]  Jun Yu Li,et al.  Joint transceiver design for MIMO communications using geometric mean decomposition , 2005, IEEE Transactions on Signal Processing.

[8]  Jian-Kang Zhang,et al.  Equal-diagonal QR decomposition and its application to precoder design for successive-cancellation detection , 2005, IEEE Transactions on Information Theory.

[9]  Michelle Effros,et al.  Suboptimality of the Karhunen-Loève Transform for Transform Coding , 2004, IEEE Trans. Inf. Theory.

[10]  See-May Phoong,et al.  Prediction-based lower triangular transform , 2000, IEEE Trans. Signal Process..

[11]  See-May Phoong,et al.  MINLAB: minimum noise structure for ladder-based biorthogonal filter banks , 2000, IEEE Trans. Signal Process..

[12]  P. P. Vaidyanathan,et al.  Theory of optimal orthonormal subband coders , 1998, IEEE Trans. Signal Process..

[13]  Stéphane Mallat,et al.  Analysis of low bit rate image transform coding , 1998, IEEE Trans. Signal Process..

[14]  Andrew G. Tescher,et al.  Practical transform coding of multispectral imagery , 1995, IEEE Signal Process. Mag..

[15]  P. Vaidyanathan.  Multirate Systems And Filter Banks , 1992 .

[16]  Ali N. Akansu,et al.  On-signal decomposition techniques , 1991 .

[17]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[18]  Peter No,et al.  Digital Coding of Waveforms , 1986 .

[19]  K. H. Barratt.  Digital Coding of Waveforms , 1985 .

[20]  G. Golub.  Matrix computations , 1983 .

[21]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .