Signal compression using discrete fractional Fourier transform and set partitioning in hierarchical tree

被引：21

作者：

Vijaya, C.

Bhat, J. S. ^{[1
]}

机构：

[1] Karnatak Univ, Dept Phys, Dharwad 580003, Karnataka, India

[2] SDM Coll Engn & Technol, Dharwad 580002, Karnataka, India

来源：

SIGNAL PROCESSING | 2006年 / 86卷 / 08期

关键词：

signal compression; FRFT; nonstationary signal; TFR; DFRFT; SPIHT;

D O I：

10.1016/j.sigpro.2005.09.025

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Signal compression has been characterized as the removal of redundancy and irrelevancy. Fractional Fourier Transform (FRFT), an orthogonal, linear transform, is known to decompose the signal in terms of chirps. In this paper we propose a scheme for signal compression based on the combination of discrete FRFT (DFRFT) and set partitioning in hierarchical tree (SPIHT). The application of the scheme to different types of signals demonstrates significant reduction in bits leading to high Signal compression ratio. The results are compared with those obtained with discrete cosine transform (DCT). (c) 2005 Elsevier B.V. All rights reserved.

引用

页码：1976 / 1983

页数：8

共 21 条

[1] On fractional Fourier transform moments [J].