# IEEE Transactions on Signal Processing

## Filter Results

Displaying Results 1 - 25 of 54

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

Publication Year: 2011, Page(s): C2
| PDF (39 KB)

Publication Year: 2011, Page(s):1917 - 1932
Cited by:  Papers (83)
| | PDF (1438 KB) | HTML

We study the problem of distributed detection, where a set of nodes is required to decide between two hypotheses based on available measurements. We seek fully distributed and adaptive implementations, where all nodes make individual real-time decisions by communicating with their immediate neighbors only, and no fusion center is necessary. The proposed distributed detection algorithms are based o... View full abstract»

• ### Hidden Relationships: Bayesian Estimation With Partial Knowledge

Publication Year: 2011, Page(s):1933 - 1948
Cited by:  Papers (6)
| | PDF (1752 KB) | HTML

We address the problem of Bayesian estimation where the statistical relation between the signal and measurements is only partially known. We propose modeling partial Bayesian knowledge by using an auxiliary random vector called instrument. The statistical relations between the instrument and the signal and between the instrument and the measurements, are known. However, the joint probability funct... View full abstract»

• ### Vector $l_0$ Sparse Variable PCA

Publication Year: 2011, Page(s):1949 - 1958
Cited by:  Papers (13)
| | PDF (887 KB) | HTML

Principal component analysis (PCA) achieves dimension reduction by replacing the original measured variables with a smaller set of derived variables called the principal components. Sparse PCA improves this with sparsity. There are two kinds of sparse PCA; sparse loading PCA (slPCA) which keeps all the measured variables but zeroes out some of their loadings; and sparse variable PCA (svPCA) which ... View full abstract»

• ### Inconsistency of the MDL: On the Performance of Model Order Selection Criteria With Increasing Signal-to-Noise Ratio

Publication Year: 2011, Page(s):1959 - 1969
Cited by:  Papers (19)
| | PDF (372 KB) | HTML

In the problem of model order selection, it is well known that the widely used minimum description length (MDL) criterion is consistent as the sample size N → ∞ . However, the consistency as the noise variance σ2 → 0 has not been studied. In this paper, we find that the MDL is inconsistent as σ2 → 0. The result shows that the M... View full abstract»

• ### Semiparametric Curve Alignment and Shift Density Estimation for Biological Data

Publication Year: 2011, Page(s):1970 - 1984
Cited by:  Papers (3)
| | PDF (1810 KB) | HTML

We observe a large number of signals, all of them with identical, although unknown, shape, but with a different random shift. The objective is to estimate the individual time shifts and their distribution. Such an objective appears in several biological applications like neuroscience or ECG signal processing, in which the estimation of the distribution of the elapsed time between repetitive pulses... View full abstract»

• ### Analyzing Weighted $ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models

Publication Year: 2011, Page(s):1985 - 2001
Cited by:  Papers (36)
| | PDF (1307 KB) | HTML

In this paper, we introduce a nonuniform sparsity model and analyze the performance of an optimized weighted ℓ1 minimization over that sparsity model. In particular, we focus on a model where the entries of the unknown vector fall into two sets, with entries of each set having a specific probability of being nonzero. We propose a weighted ℓ1 minimization recover... View full abstract»

• ### Sparsity-Cognizant Total Least-Squares for Perturbed Compressive Sampling

Publication Year: 2011, Page(s):2002 - 2016
Cited by:  Papers (123)  |  Patents (1)
| | PDF (3383 KB) | HTML

Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data vector as well as in the regression matrix. However, existing TLS approaches do not account for sparsity possibly present in the unknown vector of regression coefficients. On the other hand, sparsity is the key attribute... View full abstract»

• ### Pseudo Affine Projection Algorithms Revisited: Robustness and Stability Analysis

Publication Year: 2011, Page(s):2017 - 2023
Cited by:  Papers (9)
| | PDF (431 KB) | HTML Media

The so-called Affine Projection (AP) algorithm is of large interest in many adaptive filters applications due to its considerable speed-up in convergence compared to its simpler version, the LMS algorithm. While the original AP algorithm is well understood, gradient type variants of less complexity with relaxed step-size conditions called pseudo affine projection offer still unresolved problems. T... View full abstract»

• ### New Algorithms for Adaptive Notch Smoothing

Publication Year: 2011, Page(s):2024 - 2037
Cited by:  Papers (11)
| | PDF (614 KB) | HTML

The problem of extraction/elimination of a nonstationary complex sinusoidal signal buried in noise is considered. This problem is usually solved using adaptive notch filtering (ANF) algorithms. It is shown that accuracy of signal estimation can be increased if the results obtained from ANF are further processed using a cascade of appropriately designed filters. The resulting adaptive notch smoothi... View full abstract»

• ### Modeling Bird Flight Formations Using Diffusion Adaptation

Publication Year: 2011, Page(s):2038 - 2051
Cited by:  Papers (70)
| | PDF (1180 KB) | HTML

Flocks of birds self-organize into V-formations when they need to travel long distances. It has been shown that this formation allows the birds to save energy, by taking advantage of the upwash generated by the neighboring birds. In this work we use a model for the upwash generated by a flying bird, and show that a flock of birds can self-organize into a V-formation if every bird were to process s... View full abstract»

• ### A Variable Bandwidth Filter for Estimation of Instantaneous Frequency and Reconstruction of Signals With Time-Varying Spectral Content

Publication Year: 2011, Page(s):2052 - 2071
Cited by:  Papers (13)
| | PDF (2024 KB) | HTML

The notion of “instantaneous frequency” is utilized in processing signals with time-varying spectral content. Specifically, a variable bandwidth filter (VBF) and some related spectral analysis tools are proposed to handle a multicomponent signal whose components interact with each other in the time-frequency (TF) domain. In the analysis, a multicomponent signal is decomposed into its... View full abstract»

• ### Memory Efficient Modular VLSI Architecture for Highthroughput and Low-Latency Implementation of Multilevel Lifting 2-D DWT

Publication Year: 2011, Page(s):2072 - 2084
Cited by:  Papers (23)
| | PDF (813 KB) | HTML

In this paper, we present a modular and pipeline architecture for lifting-based multilevel 2-D DWT, without using line-buffer and frame-buffer. Overall area-delay product is reduced in the proposed design by appropriate partitioning and scheduling of the computation of individual decomposition-levels. The processing for different levels is performed by a cascaded pipeline structure to maximize the... View full abstract»

• ### U-Invariant Sampling: Extrapolation and Causal Interpolation From Generalized Samples

Publication Year: 2011, Page(s):2085 - 2100
Cited by:  Papers (12)
| | PDF (802 KB) | HTML

Causal processing of a signal's samples is crucial in on-line applications such as audio rate conversion, compression, tracking and more. This paper addresses the problems of predicting future samples and causally interpolating deterministic signals. We treat a rich variety of sampling mechanisms encountered in practice, namely in which each sampling function is obtained by applying a unitary oper... View full abstract»

• ### Sampling of Deterministic Signals and Systems

Publication Year: 2011, Page(s):2101 - 2111
Cited by:  Papers (12)
| | PDF (399 KB) | HTML

In this paper, we analyze sampling approximations of stable linear time-invariant systems for input signals in the Paley-Wiener space PWπ1. The goal is to approximate a transform Tf by using only the samples of the signal f, which do not necessarily have to be equidistant. We completely characterize the stable linear time-invariant (LTI) systems View full abstract»

• ### Bayesian Post-Processing Methods for Jitter Mitigation in Sampling

Publication Year: 2011, Page(s):2112 - 2123
Cited by:  Papers (5)
| | PDF (901 KB) | HTML

Minimum mean-square error (MMSE) estimators of signals from samples corrupted by jitter (timing noise) and additive noise are nonlinear, even when the signal parameters and additive noise have normal distributions. This paper develops a stochastic algorithm based on Gibbs sampling and slice sampling to approximate the optimal MMSE estimator in this Bayesian formulation. Simulations demonstrate tha... View full abstract»

• ### Closed-Form Orthogonal Number Theoretic Transform Eigenvectors and the Fast Fractional NTT

Publication Year: 2011, Page(s):2124 - 2135
Cited by:  Papers (10)
| | PDF (443 KB) | HTML

In this paper, we propose a new method to find the closed-form solution of Number Theoretic Transform (NTT) eigenvectors. We construct the complete generalized Legendre sequence over the finite field (CGLSF) and use it to solve the NTT eigenvector problem. We derive the CGLSF-like NTT eigenvectors successfully, including the case where the operation field is defined over the Fermat and Mersenne nu... View full abstract»

• ### Composite Cyclotomic Fourier Transforms With Reduced Complexities

Publication Year: 2011, Page(s):2136 - 2145
Cited by:  Papers (7)
| | PDF (691 KB) | HTML

Discrete Fourier transforms (DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of DFTs is of great significance. Recently proposed cyclotomic fast Fourier transforms (CFFTs) are promising due to their low multiplicative complexities. Unfortunately, there are two issues with CFFTs: (1) they rely on effi... View full abstract»

• ### Identification of a Class of Nonlinear Autoregressive Models With Exogenous Inputs Based on Kernel Machines

Publication Year: 2011, Page(s):2146 - 2159
Cited by:  Papers (42)
| | PDF (1147 KB) | HTML

In this paper, we propose a new approach to identify a new class of nonlinear autoregressive models with exogenous inputs (NARX) based on kernel machine and space projection (KMSP). The well-known Hammerstein-Wiener model which includes blocks of nonlinear static functions in series with a linear dynamic block is a subset of the NARX models considered. In the KMSP based approach, kernel machine is... View full abstract»

• ### Covariance Matrices for Second-Order Vector Random Fields in Space and Time

Publication Year: 2011, Page(s):2160 - 2168
Cited by:  Papers (20)
| | PDF (298 KB) | HTML

This paper deals with vector (or multivariate) random fields in space and/or time with second-order moments, for which a framework is needed for specifying not only the properties of each component but also the possible cross relationships among the components. We derive basic properties of the covariance matrix function of the vector random field and propose three approaches to construct covarian... View full abstract»

• ### Design of Robust Superdirective Arrays With a Tunable Tradeoff Between Directivity and Frequency-Invariance

Publication Year: 2011, Page(s):2169 - 2181
Cited by:  Papers (43)
| | PDF (1174 KB) | HTML

Frequency-invariant beam patterns are often required by systems using an array of sensors to process broadband signals. If the spatial aperture is shorter than the involved wavelengths, using a superdirective beamforming is essential to get an efficient system. In this context, robustness of array imperfections is a crucial feature. In the literature, only a few approaches have been proposed to de... View full abstract»

• ### Sensitivity to Basis Mismatch in Compressed Sensing

Publication Year: 2011, Page(s):2182 - 2195
Cited by:  Papers (246)
| | PDF (1900 KB) | HTML

The theory of compressed sensing suggests that successful inversion of an image of the physical world (broadly defined to include speech signals, radar/sonar returns, vibration records, sensor array snapshot vectors, 2-D images, and so on) for its source modes and amplitudes can be achieved at measurement dimensions far lower than what might be expected from the classical theories of spectrum or m... View full abstract»

• ### Distributed Adaptive Estimation of Node-Specific Signals in Wireless Sensor Networks With a Tree Topology

Publication Year: 2011, Page(s):2196 - 2210
Cited by:  Papers (51)  |  Patents (2)
| | PDF (598 KB) | HTML

We present a distributed adaptive node-specific signal estimation (DANSE) algorithm that operates in a wireless sensor network with a tree topology. The algorithm extends the DANSE algorithm for fully connected sensor networks, as described in previous work. It is argued why a tree topology is the natural choice if the network is not fully connected. If the node-specific desired signals share a co... View full abstract»

• ### Multichannel $Sigma Delta$ ADCs With Integrated Feedback Beamformers to Cancel Interfering Communication Signals

Publication Year: 2011, Page(s):2211 - 2222
Cited by:  Papers (3)
| | PDF (992 KB) | HTML

In multiuser multiantenna communication receivers, the use of high resolution ADCs is costly. In the presence of (strong) interference, more bits are used than would be necessary for quantizing only the signal of interest. Thus, if it is possible to cancel the interference in the analog domain, considerable savings can be realized. In this paper, we exploit the fact that a multiantenna receiver co... 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