By Topic

A fast triangular transform and its applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Min, K. ; East Texas State University, Commerce, Texas ; Carlisle, J. ; Doughty, B. ; Jones, C.
more authors

In this paper an orthogonal set of basis functions is constructed by the use of a simplified Gramm Schmidt orthogonalization process, using non-orthogonal triangular waveforms. The orthogonalized functions consist of a linear combination of, at most, four triangular waveforms. A unique sequency is shown to exist. A complex form of the triangular basis functions is defined and used to develop an efficient discrete transform: matrix which contains many null or trivial elements. A fast triangular transform is developed which allows computation speeds that are comparable to those for computing Fast Fourier Transforms. The application of the triangular transforms to signal processing is discussed and applications to specific types of signals is briefly described.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '87.  (Volume:12 )

Date of Conference:

Apr 1987