PLT versus KLT

See May Phoong*, Yuan-Pei Lin

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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(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.

Original languageEnglish
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherIEEE
Pages516-519
ISBN (Print)0780354710
DOIs
StatePublished - 1 Jan 1999
EventProceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99 - Orlando, FL, USA
Duration: 30 May 19992 Jun 1999

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
Volume3
ISSN (Print)0271-4310

Conference

ConferenceProceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99
CityOrlando, FL, USA
Period30/05/992/06/99

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

Cite this