By Topic

# IEEE Transactions on Signal Processing

## Issue 7  Part 2 • July 2008

This issue contains several parts.Go to:  Part 1

## Filter Results

Displaying Results 1 - 25 of 38

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)
• ### ARMA Prediction of Widely Linear Systems by Using the Innovations Algorithm

Publication Year: 2008, Page(s):3061 - 3068
Cited by:  Papers (38)
| | PDF (239 KB) | HTML

A new autoregressive moving average (ARMA) predictor for widely linear systems is presented by using the innovations algorithm and under an improper treatment. The main characteristics of this predictor are its facility of implementation from a practical standpoint and a better performance with respect to the conventional predictor obtained from a proper processing. View full abstract»

• ### A $q$-Parameterized Deterministic Annealing EM Algorithm Based on Nonextensive Statistical Mechanics

Publication Year: 2008, Page(s):3069 - 3080
Cited by:  Papers (4)
| | PDF (850 KB) | HTML

We propose a q-parameterized deterministic annealing expectation maximization (q-DAEM) algorithm for parameter estimation motivated by the concept of Tsallis entropy that originates from the nonextensive statistical mechanics. The q-DAEM algorithm combines the feature of annealing algorithms to reduce initialization sensitivity and that of q-EM algorithms to achieve fas... View full abstract»

• ### Approximate Calibration-Free Trajectory Reconstruction in a Wireless Network

Publication Year: 2008, Page(s):3081 - 3088
Cited by:  Papers (2)
| | PDF (337 KB) | HTML

The problem of location tracking of a mobile station in a wireless network has received considerable attention in recent literature. In many installations, a mobile station transmits a radio frequency signal which is received at a number of base stations, from which location estimation follows. Such an application requires some form of signal-distance calibration, either an empirical signal map, o... View full abstract»

• ### Frequency Domain Analysis of Signals With Stochastic Sampling Times

Publication Year: 2008, Page(s):3089 - 3099
Cited by:  Papers (4)  |  Patents (1)
| | PDF (954 KB) | HTML

In nonuniform sampling (NUS), signal amplitudes and time stamps are delivered in pairs. Several methods to compute an approximate Fourier transform (AFT) have appeared in literature, and their posterior properties in terms of alias suppression and leakage have been addressed. In this paper, the sampling times are assumed to be generated by a stochastic process. The main result gives the prior dist... View full abstract»

• ### Boundedness Behavior of the Spectral Factorization for Polynomial Data in the Wiener Algebra

Publication Year: 2008, Page(s):3100 - 3107
Cited by:  Papers (2)
| | PDF (450 KB) | HTML

Spectral factorization is of fundamental importance in many areas of signal processing. This paper investigates the boundedness behavior of the spectral factorization mapping in the Wiener algebra. Thereby, the focus lies on the factorization of polynomial spectral densities with a finite degree N since such spectra are especially important for practical applications. The paper presents a l... View full abstract»

• ### Bias Corrected PSD Estimation for an Adaptive Array With Moving Interference

Publication Year: 2008, Page(s):3108 - 3121
Cited by:  Papers (11)
| | PDF (2021 KB) | HTML

We address the issue of computing power spectral density (PSD) estimates at the output of a beamforming sensor array in the presence of strong moving interference. It is shown that the time-varying spatial response of an adaptive beamformer (ldquopattern rumblerdquo) causes estimation bias in the PSD of both the signal of interest (SOI) and noise. In applications such as radio astronomy with strin... View full abstract»

• ### Diffusion Least-Mean Squares Over Adaptive Networks: Formulation and Performance Analysis

Publication Year: 2008, Page(s):3122 - 3136
Cited by:  Papers (431)  |  Patents (1)
| | PDF (2124 KB) | HTML

We formulate and study distributed estimation algorithms based on diffusion protocols to implement cooperation among individual adaptive nodes. The individual nodes are equipped with local learning abilities. They derive local estimates for the parameter of interest and share information with their neighbors only, giving rise to peer-to-peer protocols. The resulting algorithm is distributed, coope... View full abstract»

• ### Improving the Tracking Capability of Adaptive Filters via Convex Combination

Publication Year: 2008, Page(s):3137 - 3149
Cited by:  Papers (69)
| | PDF (1317 KB) | HTML

As is well known, Hessian-based adaptive filters (such as the recursive-least squares algorithm (RLS) for supervised adaptive filtering, or the Shalvi-Weinstein algorithm (SWA) for blind equalization) converge much faster than gradient-based algorithms [such as the least-mean-squares algorithm (LMS) or the constant-modulus algorithm (CMA)]. However, when the problem is tracking a time-variant filt... View full abstract»

• ### Low-Complexity RLS Algorithms Using Dichotomous Coordinate Descent Iterations

Publication Year: 2008, Page(s):3150 - 3161
Cited by:  Papers (63)  |  Patents (1)
| | PDF (744 KB) | HTML

In this paper, we derive low-complexity recursive least squares (RLS) adaptive filtering algorithms. We express the RLS problem in terms of auxiliary normal equations with respect to increments of the filter weights and apply this approach to the exponentially weighted and sliding window cases to derive new RLS techniques. For solving the auxiliary equations, line search methods are used. We first... View full abstract»

• ### Filter Design With Low Complexity Coefficients

Publication Year: 2008, Page(s):3162 - 3169
Cited by:  Papers (17)
| | PDF (528 KB) | HTML

We introduce a heuristic for designing filters that have low complexity coefficients, as measured by the total number of nonzeros digits in the binary or canonic signed digit (CSD) representations of the filter coefficients, while still meeting a set of design specifications, such as limits on frequency response magnitude, phase, and group delay. Numerical examples show that the method is able to ... View full abstract»

• ### There Exists No Globally Uniformly Convergent Reconstruction for the Paley–Wiener Space ${{cal PW}}_{pi}^{1}$ of Bandlimited Functions Sampled at Nyquist Rate

Publication Year: 2008, Page(s):3170 - 3179
Cited by:  Papers (13)
| | PDF (402 KB) | HTML

The bandlimited interpolation of signals and the convergence behavior of the Shannon sampling series are discussed in order to show that it is desirable to have a uniformly convergent reconstruction, for as large a space of signals as possible. In this paper general sampling series are analyzed for the frequently utilized Paley-Wiener space PW pi 1, which is the larges... View full abstract»

• ### Hybrid Filter Banks With Fractional Delays: Minimax Design and Application to Multichannel Sampling

Publication Year: 2008, Page(s):3180 - 3190
Cited by:  Papers (8)  |  Patents (1)
| | PDF (838 KB) | HTML

This paper is motivated by multichannel sampling applications. We consider a hybrid filter banks consisting of a set of fractional delays operators, slow A/D converters with different antialiasing filters, digital expanders, and digital synthesis filters (to be designed). The synthesis filters are designed to minimize the maximum gain of a hybrid induced error system. We show that the induced erro... View full abstract»

• ### Mathematical Complexity of Running Filters on Semi-Groups and Related Problems

Publication Year: 2008, Page(s):3191 - 3197
Cited by:  Papers (1)
| | PDF (282 KB) | HTML

This paper proves that the mathematical complexity of running filters on semi-groups is C(p)=3-(6/(p+1)) operations per sample, where p is the filter window. On other algebraic structures, the mathematical complexity of the filtering can be lower. Two such cases are investigated: the running filtering on max/min lattice and on additions group. They correspond to max/min... View full abstract»

• ### Higher-Order SVD-Based Subspace Estimation to Improve the Parameter Estimation Accuracy in Multidimensional Harmonic Retrieval Problems

Publication Year: 2008, Page(s):3198 - 3213
Cited by:  Papers (108)
| | PDF (1476 KB) | HTML

Multidimensional harmonic retrieval problems are encountered in a variety of signal processing applications including radar, sonar, communications, medical imaging, and the estimation of the parameters of the dominant multipath components from MIMO channel measurements. R-dimensional subspace-based methods, such as R-D Unitary ESPRIT, R-D RARE, or R-D MUSIC, are frequen... View full abstract»

• ### On Doubly Selective Channel Estimation Using Superimposed Training and Discrete Prolate Spheroidal Sequences

Publication Year: 2008, Page(s):3214 - 3228
Cited by:  Papers (19)
| | PDF (644 KB) | HTML

Channel estimation and data detection for frequency-selective time-varying channels are considered using superimposed training. We employ a discrete prolate spheroidal basis expansion model (DPS-BEM) to describe the time-varying channel. A periodic (nonrandom) training sequence is arithmetically added (superimposed) at low power to the information sequence at the transmitter before modulation and ... View full abstract»

• ### Energy Efficient Signal Detection in Sensor Networks Using Ordered Transmissions

Publication Year: 2008, Page(s):3229 - 3235
Cited by:  Papers (60)
| | PDF (338 KB) | HTML

Signal detection is one application for which dedicated sensor networks have been proposed. Joint signal processing and communication design of such networks has been of great interest recently. We consider new approaches where transmissions can be ordered and halted when sufficient evidence is accumulated. We demonstrate that these approaches require, on average, fewer sensor transmissions and th... View full abstract»

Publication Year: 2008, Page(s):3236 - 3247
Cited by:  Papers (50)
| | PDF (649 KB) | HTML

Bit and power loading (BPL) techniques have been intensively investigated for the single-link communications. In this paper, we propose a margin-adaptive BPL approach for orthogonal frequency-division multiplexing (OFDM) systems assisted by a single cooperative relay. This orthogonal half-duplex relay operates either in the selection detection-and-forward (SDF) mode or in the amplify-and-forward (... View full abstract»

• ### High SNR Performance Analysis of Blind Minimum Output Energy Receivers for Large DS-CDMA Systems

Publication Year: 2008, Page(s):3248 - 3260
Cited by:  Papers (1)
| | PDF (656 KB) | HTML

High signal-to-noise ratio (SNR) properties of the minimum output energy (MOE) receiver and the Capon channel estimation technique are analyzed in the case of large direct-sequence code-division multiple-access (DS-CDMA) systems. It is shown that if the noise power tends to zero and the system load is less than one, then the signal-to-interference-plus-noise ratio (SINR) of the MOE receiver tends ... View full abstract»

• ### Iterative Joint Channel Estimation and Multiuser Detection for DS-CDMA in Frequency-Selective Fading Channels

Publication Year: 2008, Page(s):3261 - 3277
Cited by:  Papers (12)
| | PDF (1416 KB) | HTML

An iterative joint channel estimation, symbol detection, phase recovery and interference cancellation structure is proposed for asynchronous code-division multiple-access systems over frequency-selective fading channels. Based on the expectation maximization (EM) algorithm, a recursive channel estimator is developed for blind channel tracking, using a novel stochastic signal processing technique. ... View full abstract»

• ### Utilizing the Spatial Information Provided by Channel Norm Feedback in SDMA Systems

Publication Year: 2008, Page(s):3278 - 3293
Cited by:  Papers (22)
| | PDF (1375 KB) | HTML

To achieve high performance, in terms of reliability and throughput, in future multiple-antenna communication systems, it is essential to fully exploit the spatial dimensions of the wireless propagation channel. In multiuser communication systems, the throughput can be significantly increased by simultaneously transmitting to several users in the same time-frequency slot by means of spatial-divisi... View full abstract»

• ### Multimode Transmission for Multiuser MIMO Systems With Block Diagonalization

Publication Year: 2008, Page(s):3294 - 3302
Cited by:  Papers (54)
| | PDF (1064 KB) | HTML

A low-complexity multimode transmission technique for downlink multiuser multiple-input-multiple-output (MIMO) systems with block diagonalization (BD) is proposed. The proposed technique adaptively configures the number of data streams for each user by adjusting its number of active receive antenna and switching between single-stream beamforming and multistream spatial multiplexing, as a means to ... View full abstract»

• ### Antenna Selection in Space-Time Block Coded Systems: Performance Analysis and Low-Complexity Algorithm

Publication Year: 2008, Page(s):3303 - 3314
Cited by:  Papers (23)
| | PDF (1196 KB) | HTML

This paper presents outage probability analysis and a practical algorithm for antenna selection in multiple-input multiple-output wireless communication systems employing space-time block codes (STBC). First, to minimize the outage probability in these systems, a satisfactory antenna selection criterion for an STBC is to maximize the channel Frobenius norm. Analysis shows that the more receive ant... View full abstract»

• ### Sensor Networks With Random Links: Topology Design for Distributed Consensus

Publication Year: 2008, Page(s):3315 - 3326
Cited by:  Papers (124)
| | PDF (775 KB) | HTML

In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) constraints, such as power, data rate, or communication, since sensors and networks operate under scarce resources. The paper studies the problem of designing the topology, i.e., assigning the probabilities of reliable communica... 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