The pulse sorting transform

A modification of conventional Fourier transforms is presented. This modification is called the pulse sorting transform (PST) and is useful in extracting information from signals comprised of interleaved pulse trains. A brief derivation of the PST from the conventional transform is presented, follow...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems 1990-10, Vol.37 (10), p.1193-1200
Main Authors: Overman, K.C., Mix, D.F., Lookadoo, J.A.
Format: Article
Language:English
Subjects:
Applied sciences
Convolution
Data mining
Digital signal processing
Exact sciences and technology
Fourier transforms
Frequency domain analysis
Information, signal and communications theory
Linear systems
Linearity
Signal and communications theory
Signal processing
Signal representation. Spectral analysis
Signal, noise
Sorting
Telecommunications and information theory
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A modification of conventional Fourier transforms is presented. This modification is called the pulse sorting transform (PST) and is useful in extracting information from signals comprised of interleaved pulse trains. A brief derivation of the PST from the conventional transform is presented, followed by theorems that describe the PST's properties. Several examples of how the PST can be an effective tool in digital signal processing are presented. The examples demonstrate how the PST extracts phase information from interleaved pulse trains.< >
ISSN:0098-4094
1558-1276
DOI:10.1109/31.103214