By Topic

# IEEE Transactions on Signal Processing

## Filter Results

Displaying Results 1 - 25 of 46

Publication Year: 2008, Page(s):C1 - C4
| PDF (145 KB)
• ### IEEE Transactions on Signal Processing publication information

Publication Year: 2008, Page(s): C2
| PDF (38 KB)
• ### Fundamental Limitations on the Resolution of Deterministic Signals

Publication Year: 2008, Page(s):5309 - 5318
Cited by:  Papers (38)
| | PDF (474 KB) | HTML

We exploit results from detection theory for deriving fundamental limitations on resolution. The results are general and are not based on any specific resolution technique and therefore hold for any method and for any resolution success rate. We show that for signals with additive white Gaussian noise the resolution limit is approximated by a simple expression related to the signal to noise ratio,... View full abstract»

• ### A New Barankin Bound Approximation for the Prediction of the Threshold Region Performance of Maximum Likelihood Estimators

Publication Year: 2008, Page(s):5319 - 5333
Cited by:  Papers (32)
| | PDF (797 KB) | HTML

It is well known that the ML estimator exhibits a threshold effect, i.e., a rapid deterioration of estimation accuracy below a certain signal-to-noise ratio (SNR) or number of snapshots. This effect is caused by outliers and is not captured by standard tools such as the Cramer-Rao bound (CRB). The search of the SNR threshold value (where the CRB becomes unreliable for prediction of maximum likelih... View full abstract»

• ### A Fresh Look at the Bayesian Bounds of the Weiss-Weinstein Family

Publication Year: 2008, Page(s):5334 - 5352
Cited by:  Papers (26)
| | PDF (861 KB) | HTML

Minimal bounds on the mean square error (MSE) are generally used in order to predict the best achievable performance of an estimator for a given observation model. In this paper, we are interested in the Bayesian bound of the Weiss-Weinstein family. Among this family, we have Bayesian Cramer-Rao bound, the Bobrovsky-MayerWolf-Zakai bound, the Bayesian Bhattacharyya bound, the Bobrovsky-Zakai bound... View full abstract»

• ### On the Asymptotic Behavior of the Sample Estimates of Eigenvalues and Eigenvectors of Covariance Matrices

Publication Year: 2008, Page(s):5353 - 5368
Cited by:  Papers (41)
| | PDF (917 KB) | HTML

This paper analyzes the asymptotic behavior of the sample estimators of the eigenvalues and eigenvectors of covariance matrices. Rather than considering traditional large sample-size asymptotics, in this paper the focus is on limited sample size situations, whereby the number of available observations is comparable in magnitude to the observation dimension. Using tools from random matrix theory, t... View full abstract»

• ### A Semiadaptive Smoothing Algorithm in Bispectrum Estimation

Publication Year: 2008, Page(s):5369 - 5375
Cited by:  Papers (4)
| | PDF (532 KB) | HTML

Fourier transform is used to calculate the third-order periodogram, which is an unbiased estimation of the bispectrum. However, the Fourier transform has energy leakage at adjacent frequencies, and the third-order periodogram is not a consistent estimator of the bispectrum because the variance does not converge toward zero when the sample size increases. To solve these problems, we used the Kolmog... View full abstract»

• ### Identification of Matrices Having a Sparse Representation

Publication Year: 2008, Page(s):5376 - 5388
Cited by:  Papers (37)
| | PDF (1033 KB) | HTML

We consider the problem of recovering a matrix from its action on a known vector in the setting where the matrix can be represented efficiently in a known matrix dictionary. Connections with sparse signal recovery allows for the use of efficient reconstruction techniques such as basis pursuit. Of particular interest is the dictionary of time-frequency shift matrices and its role for channel estima... View full abstract»

• ### Optimal Two-Stage Search for Sparse Targets Using Convex Criteria

Publication Year: 2008, Page(s):5389 - 5402
Cited by:  Papers (24)
| | PDF (1536 KB) | HTML

We consider the problem of estimating and detecting sparse signals over a large area of an image or other medium. We introduce a novel cost function that captures the tradeoff between allocating energy to signal regions, called regions of interest (ROI), versus exploration of other regions. We show that minimizing our cost guarantees reduction of both the error probability over the unknown ROI and... View full abstract»

• ### Avoiding Divergence in the Shalvi–Weinstein Algorithm

Publication Year: 2008, Page(s):5403 - 5413
Cited by:  Papers (10)
| | PDF (965 KB) | HTML

The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the Shalvi-Weinstein algorithm (SWA). It is well-known that SWA presents a higher convergence rate than CMA, at the expense of higher computational complexity. If the forgetting factor is not sufficiently close to one, if the initialization is distant from the optimal solution, or if the signal-to-noise... View full abstract»

• ### Efficient Design of High-Complexity Cosine Modulated Filter Banks Using $2 M$th Band Conditions

Publication Year: 2008, Page(s):5414 - 5426
Cited by:  Papers (8)
| | PDF (1112 KB) | HTML

This paper presents several new properties of biorthogonal cosine modulated filter banks (CMFBs) and efficient algorithms for designing CMFBs with a very large number of subbands and very long filters. For a biorthogonal CMFB, we find the periodicity and symmetry of its overall transfer function and aliasing transfer functions which can be efficiently computed based on a decimated uniform discrete... View full abstract»

• ### A New Discrete Analytic Signal for Reducing Aliasing in the Discrete Wigner-Ville Distribution

Publication Year: 2008, Page(s):5427 - 5434
Cited by:  Papers (6)
| | PDF (1977 KB) | HTML

It is not possible to generate an alias-free discrete Wigner-Ville distribution (DWVD) from a discrete analytic signal. This is because the discrete analytic signal must satisfy two mutually exclusive constraints. We present, in this paper, a new discrete analytic signal that improves on the commonly used discrete analytic signal's approximation of these two constraints. Our analysis shows that - ... View full abstract»

• ### Sampling and Interpolation Problems for Vector Valued Signals in the Paley–Wiener Spaces

Publication Year: 2008, Page(s):5435 - 5441
Cited by:  Papers (3)
| | PDF (374 KB) | HTML

A new approach to sampling/interpolation problem for vector valued signals is proposed. For a function (signal) f from the Paley-Wiener space PW pi(BBC N) of entire vector valued functions, the sampling data are defined as the inner products langf(lambdan), alphan rang of f(lambdan) and vectors alphan. It is proved that { al... View full abstract»

• ### Causal Cubic Splines: Formulations, Interpolation Properties and Implementations

Publication Year: 2008, Page(s):5442 - 5453
Cited by:  Papers (12)
| | PDF (667 KB) | HTML

The paper presents two formulations of causal cubic splines with equidistant knots. Both are based on a causal direct B-spline filter with parallel or cascade implementation. In either implementation, the causal part of the impulse response is realized with an efficient infinite-impulse-response (IIR) structure, while only the anticausal part is approximated with a finite-order finite-impulse-resp... View full abstract»

• ### On Sampling of Band-Limited Signals Associated With the Linear Canonical Transform

Publication Year: 2008, Page(s):5454 - 5464
Cited by:  Papers (45)
| | PDF (648 KB) | HTML

Sampling is one of the fundamental topics in the signal processing community. Theorems proposed under this topic form the bridge between the continuous-time signals and discrete-time signals. Several sampling theorems, which aid in the reconstruction of signals in the linear canonical transform (LCT) domain, have been proposed in the literature. However, two main practical issues associated with t... View full abstract»

• ### Convolution-Based Trigonometric Interpolation of Band-Limited Signals

Publication Year: 2008, Page(s):5465 - 5477
Cited by:  Papers (8)
| | PDF (449 KB) | HTML

This paper presents a method to obtain a trigonometric polynomial that accurately interpolates a given band-limited signal from a finite sequence of samples. The polynomial delivers accurate approximations in the range covered by the sequence, except for a short frame close to the range limits. Besides, its accuracy increases exponentially with the frame width. The method is based on using a band-... View full abstract»

• ### Global Optimum Design of Uniform FIR Filter Bank With Magnitude Constraints

Publication Year: 2008, Page(s):5478 - 5486
Cited by:  Papers (5)
| | PDF (606 KB) | HTML

The optimum design of a uniform finite impulse response filter bank can be formulated as a nonlinear semi-infinite optimization problem. However, this optimization problem is nonconvex with infinitely many inequality constraints. In this paper, we propose a new hybrid approach for solving this highly challenging nonlinear, nonconvex semi-infinite optimization problem. In this approach, a gradient-... View full abstract»

• ### Boundedness of Multidimensional Filters Over a Prescribed Frequency Domain

Publication Year: 2008, Page(s):5487 - 5499
Cited by:  Papers (6)
| | PDF (799 KB) | HTML

Signal processing often requires the magnitude of a filter simultaneously upper and lower bounded on some specified frequency domains. In this paper, on the basis of the structure of the span of a multivariate matrix polynomial, a sufficient condition is derived for the boundedness of a multidimensional multiple-input multiple-output (MIMO) infinite-impulse-response (IIR) filter over a cuboid freq... View full abstract»

• ### Localization of Narrowband Radio Emitters Based on Doppler Frequency Shifts

Publication Year: 2008, Page(s):5500 - 5508
Cited by:  Papers (67)  |  Patents (1)
| | PDF (605 KB) | HTML

Several techniques for emitter localization based on the Doppler effect have been described in the literature. One example is the differential Doppler (DD) method in which the signal of a stationary emitter is intercepted by at least two moving receivers. The frequency difference between the receivers is measured at several locations along their trajectories and the emitter's position is then esti... View full abstract»

• ### Two-Dimensional Multivariate Parametric Models for Radar Applications—Part I: Maximum-Entropy Extensions for Toeplitz-Block Matrices

Publication Year: 2008, Page(s):5509 - 5526
Cited by:  Papers (14)
| | PDF (4005 KB) | HTML

In a series of two papers, a new class of parametric models for two-dimensional multivariate (matrix-valued, space-time) adaptive processing is introduced. This class is based on the maximum-entropy extension and/or completion of partially specified matrix-valued Hermitian covariance matrices in both the space and time dimensions. This first paper considers the more restricted class of Toeplitz He... View full abstract»

• ### Two-Dimensional Multivariate Parametric Models for Radar Applications—Part II: Maximum-Entropy Extensions for Hermitian-Block Matrices

Publication Year: 2008, Page(s):5527 - 5539
Cited by:  Papers (1)
| | PDF (2957 KB) | HTML

In a series of two papers, a new class of parametric models for two-dimensional multivariate (matrix-valued, space-time) adaptive processing is introduced. This class is based on the maximum-entropy extension and/or completion of partially specified matrix-valued Hermitian covariance matrices in both the space and time dimensions. The first paper considered the more restricted class of Hermitian T... View full abstract»

• ### Geometric-Polar Tracking From Bearings-Only and Doppler-Bearing Measurements

Publication Year: 2008, Page(s):5540 - 5554
Cited by:  Papers (5)
| | PDF (529 KB) | HTML

Bearings-only tracking (BOT) and Doppler-bearing tracking (DBT) perform target motion analysis from measurements of bearings, Doppler and bearings, respectively. The state equations are simple for both the target and observer in the rectangular coordinates. Hence, BOT and DBT mostly work in that coordinate. By developing the trigonometric relations between target and observer postions over time, t... View full abstract»

• ### Low-Complexity Block Turbo Equalization for OFDM Systems in Time-Varying Channels

Publication Year: 2008, Page(s):5555 - 5566
Cited by:  Papers (65)  |  Patents (5)
| | PDF (1103 KB) | HTML

We propose low-complexity block turbo equalizers for orthogonal frequency-division multiplexing (OFDM) systems in time-varying channels. The presented work is based on a soft minimum mean-squared error (MMSE) block linear equalizer (BLE) that exploits the banded structure of the frequency-domain channel matrix, as well as a receiver window that enforces this banded structure. This equalization app... View full abstract»

• ### A Block Component Model-Based Blind DS-CDMA Receiver

Publication Year: 2008, Page(s):5567 - 5579
Cited by:  Papers (33)
| | PDF (1362 KB) | HTML

In this paper, we consider the problem of blind multiuser separation-equalization in the uplink of a wideband DS-CDMA system, in a multipath propagation environment with intersymbol-interference (ISI). To solve this problem, we propose a multilinear algebraic receiver that relies on a new third-order tensor decomposition and generalizes the parallel factor (PARAFAC) model. Our method is determinis... View full abstract»

• ### Consistent Estimation of Symmetric Tent Chaotic Sequences With Coded Itineraries

Publication Year: 2008, Page(s):5580 - 5588
| | PDF (603 KB) | HTML

Maximum-likelihood (ML) estimation of long chaotic sequences is generally statistically inefficient. Therefore, as the length of the sequences increase we do not obtain the usual ML behavior of consistency and normality. We discuss here a specific class of chaotic sequences for which consistency is preserved. The itineraries of the chaotic sequences in this class are derived from a set of binary c... View full abstract»

## Aims & Scope

IEEE Transactions on Signal Processing covers novel theory, algorithms, performance analyses and applications of techniques for the processing, understanding, learning, retrieval, mining, and extraction of information from signals

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Sergios Theodoridis
University of Athens