PLT versus KLT

See May Phoong; Yuan-Pei Lin

doi:10.1109/ISCAS.1999.778896

PLT versus KLT

See May Phoong^*, Yuan-Pei Lin

^*Corresponding author for this work

National Chiao Tung University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

In this paper a new class of transforms named Prediction-based Lower triangular Transform (PLT) is introduced for signal compression. The PLT is a nonunitary transform that yields the same coding gain as the Kahunen-Loeve transform (KLT). Unlike KLT, the derivation of PLT does not involve any eigen problem. An M-dimensional PLT can be solved by Levinson-Durbin recursion formula in O(M²). Moreover the complexity of PLT is less than one half of KLT. For AR(1) inputs, the PLT has a closed form expression and needs only (M - 1) multiplications.

Original language	English
Title of host publication	Proceedings - IEEE International Symposium on Circuits and Systems
Publisher	IEEE
Pages	516-519
ISBN (Print)	0780354710
DOIs	https://doi.org/10.1109/ISCAS.1999.778896
State	Published - 1 Jan 1999
Event	Proceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99 - Orlando, FL, USA Duration: 30 May 1999 → 2 Jun 1999

Publication series

Name	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	3
ISSN (Print)	0271-4310

Conference

Conference	Proceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99
City	Orlando, FL, USA
Period	30/05/99 → 2/06/99

Access to Document

10.1109/ISCAS.1999.778896

Fingerprint Dive into the research topics of 'PLT versus KLT'. Together they form a unique fingerprint.

Cite this

@inproceedings{ba0a819f1b314360a03ab73c65f71170,

title = "PLT versus KLT",

abstract = "In this paper a new class of transforms named Prediction-based Lower triangular Transform (PLT) is introduced for signal compression. The PLT is a nonunitary transform that yields the same coding gain as the Kahunen-Loeve transform (KLT). Unlike KLT, the derivation of PLT does not involve any eigen problem. An M-dimensional PLT can be solved by Levinson-Durbin recursion formula in O(M2). Moreover the complexity of PLT is less than one half of KLT. For AR(1) inputs, the PLT has a closed form expression and needs only (M - 1) multiplications.",

author = "Phoong, {See May} and Yuan-Pei Lin",

year = "1999",

month = jan,

day = "1",

doi = "10.1109/ISCAS.1999.778896",

language = "English",

isbn = "0780354710",

series = "Proceedings - IEEE International Symposium on Circuits and Systems",

publisher = "IEEE",

pages = "516--519",

booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",

note = "null ; Conference date: 30-05-1999 Through 02-06-1999",

}

TY - GEN

T1 - PLT versus KLT

AU - Phoong, See May

AU - Lin, Yuan-Pei

PY - 1999/1/1

Y1 - 1999/1/1

N2 - In this paper a new class of transforms named Prediction-based Lower triangular Transform (PLT) is introduced for signal compression. The PLT is a nonunitary transform that yields the same coding gain as the Kahunen-Loeve transform (KLT). Unlike KLT, the derivation of PLT does not involve any eigen problem. An M-dimensional PLT can be solved by Levinson-Durbin recursion formula in O(M2). Moreover the complexity of PLT is less than one half of KLT. For AR(1) inputs, the PLT has a closed form expression and needs only (M - 1) multiplications.

AB - In this paper a new class of transforms named Prediction-based Lower triangular Transform (PLT) is introduced for signal compression. The PLT is a nonunitary transform that yields the same coding gain as the Kahunen-Loeve transform (KLT). Unlike KLT, the derivation of PLT does not involve any eigen problem. An M-dimensional PLT can be solved by Levinson-Durbin recursion formula in O(M2). Moreover the complexity of PLT is less than one half of KLT. For AR(1) inputs, the PLT has a closed form expression and needs only (M - 1) multiplications.

UR - http://www.scopus.com/inward/record.url?scp=0032671057&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.1999.778896

DO - 10.1109/ISCAS.1999.778896

M3 - Conference contribution

AN - SCOPUS:0032671057

SN - 0780354710

T3 - Proceedings - IEEE International Symposium on Circuits and Systems

SP - 516

EP - 519

BT - Proceedings - IEEE International Symposium on Circuits and Systems

PB - IEEE

Y2 - 30 May 1999 through 2 June 1999

ER -

PLT versus KLT

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this