By Topic

# IEEE Transactions on Signal Processing

## Filter Results

Displaying Results 1 - 25 of 56

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

Publication Year: 2012, Page(s): C2
| PDF (40 KB)
• ### SNR and Noise Variance Estimation for MIMO Systems

Publication Year: 2012, Page(s):3929 - 3941
Cited by:  Papers (21)
| | PDF (3466 KB) | HTML

Accurate signal-to-noise ratio (SNR) and noise variance estimation are extremely important aspects of receiver design in multiple-input multiple-output (MIMO) systems. Typically, these parameters are estimated using known pilot/training symbols. However, significant improvements may be made by using both the known pilot symbols as well as the unknown data symbols. In this paper, we address SNR and... View full abstract»

• ### A Semidefinite Relaxation-Based Algorithm for Robust Attitude Estimation

Publication Year: 2012, Page(s):3942 - 3952
Cited by:  Papers (2)
| | PDF (3174 KB) | HTML

This paper presents a tractable method for solving a robust attitude estimation problem, based on a weighted least squares approach with nonlinear constraints. Attitude estimation requires information of a few vector quantities, each obtained from both a sensor and a mathematical model. By considering the modeling errors, measurement noise, sensor biases and offsets as infinity-norm bounded uncert... View full abstract»

• ### An Efficient Parametric Technique for Doppler-Delay Estimation

Publication Year: 2012, Page(s):3953 - 3963
Cited by:  Papers (9)
| | PDF (1742 KB) | HTML

Receiving an output signal that is a weighted sum of Doppler and delay shifted versions of an input signal arises in various engineering systems including radar, sonar, and communications. It is often desired to estimate the Doppler and delay parameters from noisy measurements of the output signal. An estimation algorithm is developed herein for the Doppler frequencies, delays, and amplitudes, for... View full abstract»

• ### Sparse Bayesian Methods for Low-Rank Matrix Estimation

Publication Year: 2012, Page(s):3964 - 3977
Cited by:  Papers (70)
| | PDF (3206 KB) | HTML

Recovery of low-rank matrices has recently seen significant activity in many areas of science and engineering, motivated by recent theoretical results for exact reconstruction guarantees and interesting practical applications. In this paper, we present novel recovery algorithms for estimating low-rank matrices in matrix completion and robust principal component analysis based on sparse Bayesian le... View full abstract»

• ### Recursive $ell_{1,infty}$ Group Lasso

Publication Year: 2012, Page(s):3978 - 3987
Cited by:  Papers (12)
| | PDF (2264 KB) | HTML

We introduce a recursive adaptive group lasso algorithm for real-time penalized least squares prediction that produces a time sequence of optimal sparse predictor coefficient vectors. At each time index the proposed algorithm computes an exact update of the optimal ℓ1,∞-penalized recursive least squares (RLS) predictor. Each update minimizes a convex but nondifferentiable ... View full abstract»

• ### Low-Complexity Variable Forgetting Factor Mechanism for Blind Adaptive Constrained Constant Modulus Algorithms

Publication Year: 2012, Page(s):3988 - 4002
Cited by:  Papers (9)
| | PDF (5387 KB) | HTML

In this paper, we propose a novel low-complexity variable forgetting factor (VFF) mechanism for blind adaptive constrained constant modulus (CCM) recursive least squares (RLS) algorithms applied to linear interference suppression in direct-sequence code-division multiple access (DS-CDMA) systems. The proposed variable forgetting factor mechanism employs an updated component related to the time ave... View full abstract»

• ### Adaptive Widely Linear Reduced-Rank Interference Suppression Based on the Multistage Wiener Filter

Publication Year: 2012, Page(s):4003 - 4016
Cited by:  Papers (10)
| | PDF (3952 KB) | HTML

We propose a widely linear multistage Wiener filter (WL-MSWF) receiver to suppress inter-/intra-symbol interference, multiuser interference, and narrowband interference in a high data rate direct-sequence ultra wideband (DS-UWB) system. The proposed WL receiver fully exploits the second-order statistics of the received signal, yielding a smaller Minimum Mean Square Error (MMSE) than the linear rec... View full abstract»

• ### Spatio-Temporal Diffusion Strategies for Estimation and Detection Over Networks

Publication Year: 2012, Page(s):4017 - 4034
Cited by:  Papers (9)
| | PDF (5640 KB) | HTML

We present diffusion algorithms for distributed estimation and detection over networks that endow all nodes with both spatial cooperation abilities and temporal processing abilities. Each node in the network is allowed to share information locally with its neighbors; this step amounts to sharing and processing of spatial data. At the same time, each node is allowed to after and process past estima... View full abstract»

• ### Peak-Error-Constrained Sparse FIR Filter Design Using Iterative SOCP

Publication Year: 2012, Page(s):4035 - 4044
Cited by:  Papers (19)
| | PDF (2094 KB) | HTML

In this paper, a novel algorithm is proposed to design sparse FIR filters. It is known that this design problem is highly nonconvex due to the existence of -norm of a filter coefficient vector in its objective function. To tackle this difficulty, an iterative procedure is developed to search a potential sparsity pattern, which is then used to compute the final solution by solving a convex optimiza... View full abstract»

• ### On the Design of Highly Accurate and Efficient IIR and FIR Filters

Publication Year: 2012, Page(s):4045 - 4054
Cited by:  Papers (4)
| | PDF (1996 KB) | HTML

We describe a systematic method for designing highly accurate and efficient infinite impulse response (IIR) and finite impulse response (FIR) filters given their specifications. In our approach, we first meet the specifications by constructing an IIR filter with, possibly, a large number of poles. We then construct, for any given accuracy, an optimal IIR version of such filter (with a minimal numb... View full abstract»

• ### Discrete-Time LTI Systems Beyond Convolution

Publication Year: 2012, Page(s):4055 - 4064
| | PDF (2467 KB) | HTML

Examples for LTI systems are found in the literature that cannot be represented as a convolution. Their outputs can be approximated by outputs of FIR filters and considered as generalized convolution systems. These examples illustrate that impulse and frequency response provide no complete description of the system. In this paper, a general theory for discrete-time LTI systems is represented. LTI ... View full abstract»

• ### STFT With Adaptive Window Width Based on the Chirp Rate

Publication Year: 2012, Page(s):4065 - 4080
Cited by:  Papers (20)
| | PDF (3821 KB) | HTML

An adaptive time-frequency representation (TFR) with higher energy concentration usually requires higher complexity. Recently, a low-complexity adaptive short-time Fourier transform (ASTFT) based on the chirp rate has been proposed. To enhance the performance, this method is substantially modified in this paper: i) because the wavelet transform used for instantaneous frequency (IF) estimation is n... View full abstract»

• ### Proof of Convergence and Performance Analysis for Sparse Recovery via Zero-Point Attracting Projection

Publication Year: 2012, Page(s):4081 - 4093
Cited by:  Papers (8)
| | PDF (2564 KB) | HTML

A recursive algorithm named zero-point attracting projection (ZAP) is proposed recently for sparse signal reconstruction. Compared with the reference algorithms, ZAP demonstrates rather good performance in recovery precision and robustness. However, any theoretical analysis about the mentioned algorithm, even a proof on its convergence, is not available. In this work, a strict proof on the converg... View full abstract»

• ### Block-Sparse Recovery via Convex Optimization

Publication Year: 2012, Page(s):4094 - 4107
Cited by:  Papers (48)
| | PDF (3956 KB) | HTML

Given a dictionary that consists of multiple blocks and a signal that lives in the range space of only a few blocks, we study the problem of finding a block-sparse representation of the signal, i.e., a representation that uses the minimum number of blocks. Motivated by signal/image processing and computer vision applications, such as face recognition, we consider the block-sparse recovery problem ... View full abstract»

• ### Optimal Pivot Selection in Fast Weighted Median Search

Publication Year: 2012, Page(s):4108 - 4117
Cited by:  Papers (2)
| | PDF (1414 KB) | HTML

Weighted median filters are increasingly being used in signal processing applications and thus fast implementations are of importance. This paper introduces a fast algorithm to compute the weighted median (WM) of N samples which has linear time and space complexity as opposed to O(N log N) which is the time complexity of traditional sorting algorithms. A popular selection algorithm often used to f... View full abstract»

• ### Sparsity-Exploiting Robust Multidimensional Scaling

Publication Year: 2012, Page(s):4118 - 4134
Cited by:  Papers (10)
| | PDF (5320 KB) | HTML

Multidimensional scaling (MDS) seeks an embedding of N objects in a p <; N dimensional space such that inter-vector distances approximate pairwise object dissimilarities. Despite their popularity, MDS algorithms are sensitive to outliers, yielding grossly erroneous embeddings even if few outliers contaminate the available dissimilarities. This work introduces robust MDS approaches exploiting th... View full abstract»

• ### Feedback Message Passing for Inference in Gaussian Graphical Models

Publication Year: 2012, Page(s):4135 - 4150
Cited by:  Papers (6)
| | PDF (2825 KB) | HTML

While loopy belief propagation (LBP) performs reasonably well for inference in some Gaussian graphical models with cycles, its performance is unsatisfactory for many others. In particular for some models LBP does not converge, and in general when it does converge, the computed variances are incorrect (except for cycle-free graphs for which belief propagation (BP) is non-iterative and exact). In th... View full abstract»

• ### Kernel Methods for Ill-Posed Range-Based Localization Problems

Publication Year: 2012, Page(s):4151 - 4162
Cited by:  Papers (3)
| | PDF (2878 KB) | HTML

A kernel regression technique for the ill-posed range-based localization problem is proposed. We introduce a generic kernel design method which relies on a probabilistic modeling of the respective physical environment in terms of a class of stochastic differential equations. The combination of dynamic modeling with physical and stochastic interpretability leads to a unique solution in a Reproducin... View full abstract»

• ### Robust Clustering Using Outlier-Sparsity Regularization

Publication Year: 2012, Page(s):4163 - 4177
Cited by:  Papers (12)
| | PDF (4254 KB) | HTML

Notwithstanding the popularity of conventional clustering algorithms such as K-means and probabilistic clustering, their clustering results are sensitive to the presence of outliers in the data. Even a few outliers can compromise the ability of these algorithms to identify meaningful hidden structures rendering their outcome unreliable. This paper develops robust clustering algorithms that not onl... View full abstract»

• ### A CLT on the SNR of Diagonally Loaded MVDR Filters

Publication Year: 2012, Page(s):4178 - 4195
Cited by:  Papers (1)
| | PDF (5178 KB) | HTML

This paper studies the fluctuations of the signal-to-noise ratio (SNR) of minimum variance distorsionless response (MVDR) filters implementing diagonal loading in the estimation of the covariance matrix. Previous results in the signal processing literature are generalized and extended by considering both spatially as well as temporarily correlated samples. Specifically, a central limit theorem (CL... View full abstract»

• ### Performance Tradeoffs in Amplify-and-Forward Bidirectional Network Beamforming

Publication Year: 2012, Page(s):4196 - 4209
Cited by:  Papers (29)
| | PDF (2876 KB) | HTML

We study and compare the performance of two bidirectional network beamforming schemes, namely the multiple access broadcast channel (MABC) strategy and the time division broadcast channel (TDBC) protocol, using joint optimal power control and beamforming design. To do so, we first design two TDBC-based bidirectional network beamformers, through minimization of the total power consumed in the whole... View full abstract»

• ### CS Decomposition Based Bayesian Subspace Estimation

Publication Year: 2012, Page(s):4210 - 4218
Cited by:  Papers (3)
| | PDF (2112 KB) | HTML

In numerous applications, it is required to estimate the principal subspace of the data, possibly from a very limited number of samples. Additionally, it often occurs that some rough knowledge about this subspace is available and could be used to improve subspace estimation accuracy in this case. This is the problem we address herein and, in order to solve it, a Bayesian approach is proposed. The ... View full abstract»

• ### SIMO Channel Estimation Using Space-Time Signal Subspace Projection and Soft Information

Publication Year: 2012, Page(s):4219 - 4235
Cited by:  Papers (4)
| | PDF (7124 KB) | HTML

We consider the channel estimation of a time-slotted wireless communication system with a mobile user and a base station, where the base station employs an M-element (M >; 1) antenna array. The uplink single-input multiple-output (SIMO) channel is usually estimated by training sequence within each time slot. To improve the estimation performance, the channel estimate is often refined by project... 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