# IEEE Signal Processing Letters

## Filter Results

Displaying Results 1 - 25 of 29
• ### [Front cover]

Publication Year: 2009, Page(s): C1
| PDF (322 KB)
• ### IEEE Signal Processing Letters publication information

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

Publication Year: 2009, Page(s):1013 - 1014
| PDF (47 KB)
• ### Random Discrete Fractional Fourier Transform

Publication Year: 2009, Page(s):1015 - 1018
Cited by:  Papers (22)
| | PDF (1269 KB) | HTML

In this letter, a new commuting matrix with random discrete Fourier transform (DFT) eigenvectors is first constructed. A random discrete fractional Fourier transform (RDFRFT) kernel matrix with random DFT eigenvectors and eigenvalues is then proposed. The RDFRFT has an important feature that the magnitude and phase of its transform output are both random. As an application example, a security-enha... View full abstract»

• ### Learning Kernel in Kernel-Based LDA for Face Recognition Under Illumination Variations

Publication Year: 2009, Page(s):1019 - 1022
Cited by:  Papers (11)
| | PDF (349 KB) | HTML

Kernel-based methods have been proved to be an effective approach for face recognition in dealing with complex and nonlinear face image variations. While many encouraging results have been reported, the selection of kernel is rather ad hoc. This letter proposes a systematic method to construct a new kernel for kernel discriminant analysis, which is good for handling illumination prob... View full abstract»

• ### Consistent Sampling and Efficient Signal Reconstruction

Publication Year: 2009, Page(s):1023 - 1026
Cited by:  Papers (1)
| | PDF (194 KB) | HTML

We propose efficient signal reconstruction methods such that the reconstructed signal has the same measurements as the underlying original signal if the former was observed by the same system as that for the latter. The reconstructed signal is a linear combination of reconstruction functions, and the main task is to compute the coefficients from the measurements. This generally involves an inversi... View full abstract»

• ### Quantized Antenna Combining for Multiuser MIMO-OFDM With Limited Feedback

Publication Year: 2009, Page(s):1027 - 1030
Cited by:  Papers (5)
| | PDF (268 KB) | HTML

A method for reducing feedback in a downlink multiuser MIMO-OFDM cellular system, with zero forcing beamforming at the base (BS) and antenna combining at each mobile (MS) is proposed. The method consists of partitioning the subcarriers into groups, choosing the quantized channel vector that better represents each group in terms of average quantization error. Numerical results show that savings up ... View full abstract»

• ### Outage Probability of Selection Cooperation With MRC in Nakagami-$m$ Fading Channels

Publication Year: 2009, Page(s):1031 - 1034
Cited by:  Papers (24)
| | PDF (249 KB) | HTML

Selection cooperation has been shown to be an effective way to implement cooperative diversity in wireless networks. In this letter, we investigate the outage performance of decode-and-forward selection cooperation with optimal maximal ratio combining (MRC) receiver at the destination to combine the signal replicas available from the source and the selected relay in Nakagami-/mbim fading channels ... View full abstract»

• ### Decision-Feedback Closest Lattice Point Search for UMTS HSPA System

Publication Year: 2009, Page(s):1035 - 1038
| | PDF (389 KB) | HTML

This letter considers a low-complexity multiuser detection based on the closest lattice point search (CLPS) for high speed packet access (HSPA) system. Instead of attempting to solve the ML detection problem in the presence of intersymbol and inter-cell interference, we utilize interference cancelled chips obtained from a bidirectional decision feedback operation to detect symbols. As a result, th... View full abstract»

• ### A Fast 2-D AR Parameter Estimation Algorithm Based on Functional Schur Coefficients

Publication Year: 2009, Page(s):1039 - 1042
Cited by:  Papers (7)
| | PDF (125 KB) | HTML

This paper presents an algorithm for the estimation of the 2-D AR parameters. This new method is based on the functional Schur coefficients recently introduced by the authors. The algorithm is efficient in terms of computation and preserves in the 2-D case the advantages of the 1-D Schur algorithm vs 1-D Levinson algorithm. This approach is illustrated on several numerical examples. View full abstract»

• ### Variable Step-Size LMS Algorithm With a Gradient-Based Weighted Average

Publication Year: 2009, Page(s):1043 - 1046
Cited by:  Papers (22)
| | PDF (636 KB) | HTML

This paper proposes a new variable step-size least-mean-square (VSLMS) algorithm with an approach in which a gradient-based weighted average is used to improve the weakness of previous VSLMS for application to unknown channel estimation or system identification in low-SNR or colored input environments. The proposed scheme leads to a faster convergence rate and a lower misadjustment error. View full abstract»

• ### Reconstruction of Bandlimited Signals in Linear Canonical Transform Domain From Finite Nonuniformly Spaced Samples

Publication Year: 2009, Page(s):1047 - 1050
Cited by:  Papers (20)
| | PDF (128 KB) | HTML

We investigate the reconstruction of bandlimited signals in the linear canonical transform (LCT) domain from a finite set of nonuniformly spaced samples. Based on the reproducing property of the reproducing kernel belonging to the class of bandlimited signals in LCT domain, we derive an interpolating formula with minimum mean-squared error that interpolates the finite set of nonuniformly spaced sa... View full abstract»

• ### Exact Error Probability and Channel Capacity of the Best-Relay Cooperative-Diversity Networks

Publication Year: 2009, Page(s):1051 - 1054
Cited by:  Papers (72)
| | PDF (176 KB) | HTML

Cooperative diversity networks have recently been proposed as a way to form virtual antenna arrays without using collocated multiple antennas. In this paper, we consider adaptive decode-and-forward cooperative diversity system where a source node communicates with a destination node directly and indirectly (through multiple relays). In this letter, we investigate the performance of the best-relay ... View full abstract»

• ### Scheduled-Stepsize NLMS Algorithm

Publication Year: 2009, Page(s):1055 - 1058
Cited by:  Papers (23)
| | PDF (259 KB) | HTML

This paper presents a method of scheduling stepsizes for the normalized least-mean-squares (SS-NLMS) algorithm. Geometrically interpreting the mean square deviation (MSD) learning curve leads to establishing an objective curve and to constructing a lookup table of stepsizes in order for the MSD to follow the curve. The SS-NLMS shows not only good performance but also robustness with respect to dif... View full abstract»

• ### Quantization Errors of Uniformly Quantized fGn and fBm Signals

Publication Year: 2009, Page(s):1059 - 1062
Cited by:  Papers (1)
| | PDF (261 KB) | HTML

In this letter, we show that under the assumption of high resolution, the quantization errors of fGn and fBm signals with uniform quantizer can be treated as uncorrelated white noises. View full abstract»

• ### Bilinear Model-Based Maximum Likelihood Linear Regression Speaker Adaptation Framework

Publication Year: 2009, Page(s):1063 - 1066
Cited by:  Papers (2)
| | PDF (170 KB) | HTML

This letter proposes a novel framework for speaker adaptation, using bilinear model-based maximum likelihood linear regression (MLLR) method. First, a set of speaker models is decomposed into the style factor identified as each speaker's characteristics and the common content factor across the speakers, by the bilinear model. Then, using some adaptation data from a new speaker, the speaker-specifi... View full abstract»

• ### Dual-Augmented Lagrangian Method for Efficient Sparse Reconstruction

Publication Year: 2009, Page(s):1067 - 1070
Cited by:  Papers (31)
| | PDF (344 KB) | HTML

We propose an efficient algorithm for sparse signal reconstruction problems. The proposed algorithm is an augmented Lagrangian method based on the dual problem. It is efficient when the number of unknown variables is much larger than the number of observations because of the dual formulation. Moreover, the primal variable is explicitly updated and the sparsity in the solution is exploited. Numeric... View full abstract»

• ### Error Probability Analysis of Combining Space-Time Block Coding and Scheduling in MIMO Systems

Publication Year: 2009, Page(s):1071 - 1074
Cited by:  Papers (8)
| | PDF (171 KB) | HTML

In this paper, we investigate a joint diversity scheme combining space-time block coding (STBC) and opportunistic scheduling in a multiple-input multiple-output (MIMO) system. In this scheme, the user with the maximum effective signal-to-noise ratio (SNR) is adaptively selected, and the closed-form symbol error rate (SER) of the joint diversity scheme is presented. The exact SER of the joint diver... View full abstract»

• ### Adaptive Noise Subspace Estimation Algorithm Suitable for VLSI Implementation

Publication Year: 2009, Page(s):1075 - 1078
Cited by:  Papers (3)
| | PDF (145 KB) | HTML

The aim of this letter is twofold: 1) to stabilize a fast adaptive noise subspace algorithm, which was proposed earlier in the literature under the name of FRANS algorithm and 2) to present a low computational cost version that is free from any square root and division operations, which is very suitable for VLSI implementation. A stability analysis and simulation results are also given in order to... View full abstract»

• ### Distribution of Distributed Arithmetic Codewords for Equiprobable Binary Sources

Publication Year: 2009, Page(s):1079 - 1082
Cited by:  Papers (11)
| | PDF (419 KB) | HTML

Distributed Arithmetic Coding (DAC) is an effective implementation of Slepian-Wolf coding, especially for short data blocks. However, the properties of DAC codewords have not yet been studied so far. This paper researches DAC codeword distribution over interval [0, 1] for equiprobable binary sources. Some simulation results are given to verify theoretical analyses. View full abstract»

• ### Robust Parametric Audio Coding Using Multiple Description Coding

Publication Year: 2009, Page(s):1083 - 1086
Cited by:  Papers (5)
| | PDF (129 KB) | HTML

We propose a new multiple description spherical quantization with repetitively coded amplitudes (MDSQRA) scheme suited for quantization of sinusoidal parameters. The quantization scheme is constituted by a set of spherical quantizers inspired by the multiple description spherical trellis-coded quantization (MDSTCQ) scheme. In this scheme, we apply repetitive coding on the amplitudes, while multipl... View full abstract»

• ### Blind MEM PDF Estimation for Detection in the Presence of Unknown Non-Gaussian Noise

Publication Year: 2009, Page(s):1087 - 1090
Cited by:  Papers (2)
| | PDF (545 KB) | HTML

In this letter we develop a new blind binary level detection in presence of unknown non-Gaussian noise using maximum entropy method (MEM). We show that the performance of the designed detector based on blind maximum entropy (BME) method is near to the one that is designed based on best entropy estimate (BEE) criterion. View full abstract»

• ### A Robust Algorithm for Joint-Sparse Recovery

Publication Year: 2009, Page(s):1091 - 1094
Cited by:  Papers (29)
| | PDF (477 KB) | HTML

We address the problem of finding a set of sparse signals that have nonzero coefficients in the same locations from a set of their compressed measurements. A mixed lscr2,0 norm optimization approach is considered. A cost function appropriate to the joint-sparse problem is developed, and an algorithm is derived. Compared to other convex relaxation based techniques, the results obtained b... View full abstract»

• ### Trellis Exploration Algorithm Aided Unitary Precoder Design for Maximizing MIMO Capacity With Limited Feedback

Publication Year: 2009, Page(s):1095 - 1098
Cited by:  Papers (5)
| | PDF (513 KB) | HTML

In this letter, we present a novel approach to determine limited feedback-based unitary precoder for maximizing single user (SU)-MIMO capacity. Specifically, a polyphase unitary precoding matrix is custom designed via the trellis exploration algorithm employing system capacity as the metric to maximize. Since the trellis exploration algorithm operates on a finite set of phases, information regardi... View full abstract»

• ### List of Reviewers

Publication Year: 2009, Page(s):1099 - 1106
| PDF (47 KB)

## Aims & Scope

The IEEE Signal Processing Letters is a monthly, archival publication designed to provide rapid dissemination of original, cutting-edge ideas and timely, significant contributions in signal, image, speech, language and audio processing.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
James E. Fowler
Dept Electrical & Computer Engineering
Associate Director
Distributed Analytics and Security Institute
Mississippi State University
Mississippi State, MS 39762 USA
fowler@ece.msstate.edu