# IEEE Transactions on Signal Processing

## Filter Results

Displaying Results 1 - 25 of 39

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

Publication Year: 2009, Page(s): C2
| PDF (39 KB)
• ### Principal Curve Time Warping

Publication Year: 2009, Page(s):2041 - 2049
Cited by:  Papers (3)
| | PDF (952 KB) | HTML

Time warping finds use in many fields of time series analysis, and it has been effectively implemented in many different application areas. Rather than focusing on a particular application area we approach the general problem definition, and employ principal curves, a powerful machine learning tool, to improve the noise robustness of existing time warping methods. The increasing noise level is the... View full abstract»

• ### Energy-Efficient Routing for Signal Detection in Wireless Sensor Networks

Publication Year: 2009, Page(s):2050 - 2063
Cited by:  Papers (27)
| | PDF (792 KB) | HTML

For many envisioned applications of wireless sensor networks (WSNs), the information processing involves dealing with distributed data in the context of accurate signal detection and energy-efficient routing, which have been active research topics for many years, respectively. In this paper, we relate these two aspects via joint optimization. Considering the scenario of using distributed radar-lik... View full abstract»

• ### One- and Two-Stage Tunable Receivers

Publication Year: 2009, Page(s):2064 - 2073
Cited by:  Papers (1)
| | PDF (542 KB) | HTML

In this paper, we propose and assess a CFAR detector that can adjust its ldquodirectivityrdquo through a real scalar parameter. It relies on the usual assumption that a set of homogeneous training data is available and encompasses as special cases the well-known Kelly's GLRT and the recently introduced W-ABORT detector. More important, it can be tuned in order to control the level to which sidelob... View full abstract»

• ### Notes on the Tightness of the Hybrid CramÉr–Rao Lower Bound

Publication Year: 2009, Page(s):2074 - 2084
Cited by:  Papers (37)
| | PDF (433 KB) | HTML

In this paper, we study the properties of the hybrid Cramer-Rao bound (HCRB). We first address the problem of estimating unknown deterministic parameters in the presence of nuisance random parameters. We specify a necessary and sufficient condition under which the HCRB of the nonrandom parameters is equal to the Cramer-Rao bound (CRB). In this case, the HCRB is asymptotically tight [in high signal... View full abstract»

• ### A Polynomial Approximation Algorithm for Real-Time Maximum-Likelihood Estimation

Publication Year: 2009, Page(s):2085 - 2095
Cited by:  Papers (3)
| | PDF (767 KB) | HTML

Maximum-likelihood estimation subject to nonlinear measurement functions is generally performed through optimization algorithms when accuracy is required and enough processing time is available, or with recursive filters for real-time applications but at the expense of a loss of accuracy. In this paper, we propose a new estimator for parameter estimation based on a polynomial approximation of the ... View full abstract»

• ### A New Class of Multilinear Functions for Polynomial Phase Signal Analysis

Publication Year: 2009, Page(s):2096 - 2109
Cited by:  Papers (15)
| | PDF (1033 KB) | HTML

This paper introduces a new class of multilinear functions which can be used for analyzing a signal with time-varying frequency. The new class subsumes a number of existing functions, including the higher order ambiguity functions (HAFs), the polynomial Wigner-Ville distributions (PWVDs), and the higher order phase (HP) functions. As well as establishing a link between these existing functions, th... View full abstract»

• ### A Context Quantization Approach to Universal Denoising

Publication Year: 2009, Page(s):2110 - 2129
Cited by:  Papers (7)
| | PDF (6815 KB) | HTML

We revisit the problem of denoising a discrete-time, continuous-amplitude signal corrupted by a known memoryless channel. By modifying our earlier approach to the problem, we obtain a scheme that is much more tractable than the original one and at the same time retains the universal optimality properties. The universality refers to the fact that the proposed denoiser asymptotically (with increasin... View full abstract»

• ### Unified Pascal Matrix for First-Order $s{hbox{–}}z$ Domain Transformations

Publication Year: 2009, Page(s):2130 - 2139
Cited by:  Papers (1)
| | PDF (412 KB) | HTML

The so-called generalized Pascal matrix is used for transforming a continuous-time (CT) linear system (filter) into a discrete-time (DT) one. This paper derives an explicit expression for a new generalized Pascal matrix called unified Pascal matrix from a unified first-order S-to-Z transformation model and rigorously proves the inverses for various first-order s-to-z transformations.... View full abstract»

• ### Perfect Reconstruction IIR Digital Filter Banks Supporting Nonexpansive Linear Signal Extensions

Publication Year: 2009, Page(s):2140 - 2150
Cited by:  Papers (3)
| | PDF (1438 KB) | HTML

In this paper, perfect reconstruction polyphase infinite impulse response (IIR) filter banks involving causal and anticausal inverses are examined for finite-length signals. First, a novel and efficient nonexpansive perfect reconstruction algorithm based on the state-space implementation is presented. Then the proposed method is extended to support linear signal extensions at the boundaries in a n... View full abstract»

• ### Novel DCT-Based Real-Valued Discrete Gabor Transform and Its Fast Algorithms

Publication Year: 2009, Page(s):2151 - 2164
Cited by:  Papers (15)
| | PDF (907 KB) | HTML

The oversampled Gabor transform is more effective than the critically sampled one in many applications. The biorthogonality relationship between the analysis window and the synthesis window of the Gabor transform represents the completeness condition. However, the traditional discrete cosine transform (DCT)-based real-valued discrete Gabor transform (RGDT) is available only in the critically sampl... View full abstract»

• ### Optimized Least-Square Nonuniform Fast Fourier Transform

Publication Year: 2009, Page(s):2165 - 2177
Cited by:  Papers (12)
| | PDF (1097 KB) | HTML

The main focus of this paper is to derive a memory efficient approximation to the nonuniform Fourier transform of a support limited sequence. We show that the standard nonuniform fast Fourier transform (NUFFT) scheme is a shift invariant approximation of the exact Fourier transform. Based on the theory of shift-invariant representations, we derive an exact expression for the worst-case mean square... View full abstract»

• ### Dictionary Learning for Sparse Approximations With the Majorization Method

Publication Year: 2009, Page(s):2178 - 2191
Cited by:  Papers (97)
| | PDF (1205 KB) | HTML

In order to find sparse approximations of signals, an appropriate generative model for the signal class has to be known. If the model is unknown, it can be adapted using a set of training samples. This paper presents a novel method for dictionary learning and extends the learning problem by introducing different constraints on the dictionary. The convergence of the proposed method to a fixed point... View full abstract»

• ### Switching Strategies for Sequential Decision Problems With Multiplicative Loss With Application to Portfolios

Publication Year: 2009, Page(s):2192 - 2208
Cited by:  Papers (14)
| | PDF (1130 KB) | HTML

A wide variety of problems in signal processing can be formulated such that decisions are made by sequentially taking convex combinations of vector-valued observations and these convex combinations are then multiplicatively compounded over time. A ldquouniversalrdquo approach to such problems might attempt to sequentially achieve the performance of the best fixed convex combination, as might be ac... View full abstract»

• ### On the Convergence of ICA Algorithms With Symmetric Orthogonalization

Publication Year: 2009, Page(s):2209 - 2221
Cited by:  Papers (13)
| | PDF (334 KB) | HTML

Independent component analysis (ICA) problem is often posed as the maximization/minimization of an objective/cost function under a unitary constraint, which presumes the prewhitening of the observed mixtures. The parallel adaptive algorithms corresponding to this optimization setting, where all the separators are jointly trained, are typically implemented by a gradient-based update of the separati... View full abstract»

• ### Nonorthogonal Joint Diagonalization by Combining Givens and Hyperbolic Rotations

Publication Year: 2009, Page(s):2222 - 2231
Cited by:  Papers (53)
| | PDF (532 KB) | HTML

A new algorithm for computing the nonorthogonal joint diagonalization of a set of matrices is proposed for independent component analysis and blind source separation applications. This algorithm is an extension of the Jacobi-like algorithm first proposed in the joint approximate diagonalization of eigenmatrices (JADE) method for orthogonal joint diagonalization. The improvement consists mainly in ... View full abstract»

• ### A Quadratic Programming Approach to Blind Equalization and Signal Separation

Publication Year: 2009, Page(s):2232 - 2244
Cited by:  Papers (13)
| | PDF (973 KB) | HTML

Blind equalization and signal separation are two well-established signal processing problems. In this paper, we present a quadratic programming algorithm for fast blind equalization and signal separation. By introducing a special non-mean-square error (MSE) objective function, we reformulate fractionally spaced blind equalization into an equivalent quadratic programming problem. Based on a clear g... View full abstract»

• ### Distributed Arithmetic Coding for the Slepian–Wolf Problem

Publication Year: 2009, Page(s):2245 - 2257
Cited by:  Papers (23)
| | PDF (622 KB) | HTML

Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, named ldquodistributed arithmetic coding,rdquo which extends arithmetic codes to the distributed case employing sequential decoding aided by the side information. In particular, we introduce a distributed binary arithmetic coder for the Slepian-Wolf coding pr... View full abstract»

• ### $M$ -Description Lattice Vector Quantization: Index Assignment and Analysis

Publication Year: 2009, Page(s):2258 - 2274
Cited by:  Papers (14)
| | PDF (1029 KB) | HTML

In this paper, we investigate the design of symmetric entropy-constrained multiple description lattice vector quantization (MDLVQ), more specifically, MDLVQ index assignment. We consider a fine lattice containing clean similar sublattices with S -similarity. Due to the S -similarity of the sublattices, an M-fraction lattice can be used to regularly partition the fine lattice w... View full abstract»

• ### High-Resolution Radar via Compressed Sensing

Publication Year: 2009, Page(s):2275 - 2284
Cited by:  Papers (433)  |  Patents (17)
| | PDF (844 KB) | HTML

A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N times N grid. Assuming the number of targets K is small (i.e., K Lt N2), then we can transmit a sufficiently ldquoincoherentrdquo pulse and employ the techniques of compressed sensing to reconstruct the target scene. A theoretical upper bound on the sparsity K is presented. Numeric... View full abstract»

• ### Systematic Construction of Linear Transform Based Full-Diversity, Rate-One Space–Time Frequency Codes

Publication Year: 2009, Page(s):2285 - 2298
Cited by:  Papers (9)
| | PDF (1516 KB) | HTML

In this paper, we generalize the existing rate-one space frequency (SF) and space-time frequency (STF) code constructions. The objective of this exercise is to provide a systematic design of full-diversity STF codes with high coding gain. Under this generalization, STF codes are formulated as linear transformations of data. Conditions on these linear transforms are then derived so that the resulti... View full abstract»

• ### Adaptive Algorithms to Track the PARAFAC Decomposition of a Third-Order Tensor

Publication Year: 2009, Page(s):2299 - 2310
Cited by:  Papers (48)  |  Patents (1)
| | PDF (995 KB) | HTML

The PARAFAC decomposition of a higher-order tensor is a powerful multilinear algebra tool that becomes more and more popular in a number of disciplines. Existing PARAFAC algorithms are computationally demanding and operate in batch mode - both serious drawbacks for on-line applications. When the data are serially acquired, or the underlying model changes with time, adaptive PARAFAC algorithms that... View full abstract»

• ### Bandwidth Efficient Cooperative TDOA Computation for Multicarrier Signals of Opportunity

Publication Year: 2009, Page(s):2311 - 2322
Cited by:  Papers (25)  |  Patents (4)
| | PDF (1217 KB) | HTML

Source localization, the problem of determining the physical location of an acoustic or wireless emitter, is commonly encountered in sensor networks which are attempting to locate and track an emitter. Similarly, in navigation systems that do not rely on the global positioning system (GPS), ldquosignals of opportunityrdquo (existing wireless infrastructure) can be used as ad hoc navigation beacons... View full abstract»

• ### Spectrum Sharing in Wireless Networks via QoS-Aware Secondary Multicast Beamforming

Publication Year: 2009, Page(s):2323 - 2335
Cited by:  Papers (124)
| | PDF (714 KB) | HTML

Secondary spectrum usage has the potential to considerably increase spectrum utilization. In this paper, quality-of-service (QoS)-aware spectrum underlay of a secondary multicast network is considered. A multiantenna secondary access point (AP) is used for multicast (common information) transmission to a number of secondary single-antenna receivers. The idea is that beamforming can be used to stee... 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