Identifiability and Aliasing in Polynomial-Phase Signals

Polynomial-phase signals have numerous applications including radar, sonar, geophysics, and radio communication. Many techniques for estimating the parameters of polynomial-phase signals have been described in the literature. Despite the significant interest, aliasing of polynomial-phase parameters...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 2009-11, Vol.57 (11), p.4554-4557
Main Authors: McKilliam, R.G., Clarkson, I.V.L.
Format: Article
Language:English
Subjects:
Aliasing
Antialiasing
Applied sciences
chirp signals
closest point search
Coding, codes
Detection, estimation, filtering, equalization, prediction
Doppler measurements
Estimators
Exact sciences and technology
Geophysics
Information, signal and communications theory
lattice decoding
lattice theory
Lattices
Miscellaneous
Parameter estimation
Phase estimation
polynomial-phase signals
Polynomials
Radar
Radar applications
radar signal processing
Radio communication
Radio communications
Signal and communications theory
Signal processing
Signal resolution
Signal, noise
Sonar
Sonar applications
Telecommunications and information theory
Transforms
Voronoi diagram
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Polynomial-phase signals have numerous applications including radar, sonar, geophysics, and radio communication. Many techniques for estimating the parameters of polynomial-phase signals have been described in the literature. Despite the significant interest, aliasing of polynomial-phase parameters has not been fully clarified. We address the problem of identifiability and aliasing in polynomial-phase signals. We fully describe the region in which aliasing does not occur for polynomial-phase signals of any order. We call this the identifiable region. We find that this region is the Voronoi region of a lattice generated by the coefficients of a set of polynomials known as the integer-valued polynomials. We show how aliasing can be resolved by solving the nearest lattice point problem. We discuss some of the consequences of these results on a popular estimator for polynomial-phase signals that is based on the discrete polynomial phase transform (DPPT). It is shown that the range of parameters suitable for the DPPT estimator is very small compared to the identifiable region.
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2009.2026511