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

Authors:
C. Vijaya;J. S. Bhat
Affiliations:
SDM College of Engineering & Technology, Dharwad, India;Department of Physics, Karnatak University, Dharwad, India
Venue:
Signal Processing - Special section: Advances in signal processing-assisted cross-layer designs
Year:
2006

Citing 7
Cited 6

A multi-input-multi-output system approach for the computation of discrete fractional Fourier transform

Signal Processing
Fractional Fourier series expansion for finite signals and dualextension to discrete-time fractional Fourier transform

IEEE Transactions on Signal Processing
The discrete rotational Fourier transform

IEEE Transactions on Signal Processing
Discrete fractional Fourier transform based on orthogonalprojections

IEEE Transactions on Signal Processing
Closed-form discrete fractional and affine Fourier transforms

IEEE Transactions on Signal Processing
Digital computation of the fractional Fourier transform

IEEE Transactions on Signal Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees

IEEE Transactions on Circuits and Systems for Video Technology

Sliding discrete fractional transforms

Signal Processing
Pre-processing deconvolution based technique for improving the performances of ECG codecs: Comparison to SPIHT

Digital Signal Processing
The discrete fractional Fourier transform based on the DFT matrix

Signal Processing
Fractional Fourier transform as a signal processing tool: An overview of recent developments

Signal Processing
A New Formulation of the Fast Fractional Fourier Transform

SIAM Journal on Scientific Computing
A Novel OFDMA Cellular System Based on Multiple FrFT Angles Reuse Scheme

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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).