By Topic

Signal Processing Letters, IEEE

Issue 6 • Date June 2012

Filter Results

Displaying Results 1 - 23 of 23
  • [Front cover]

    Publication Year: 2012 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (167 KB)  
    Freely Available from IEEE
  • IEEE Signal Processing Letters publication information

    Publication Year: 2012 , Page(s): C2
    Save to Project icon | Request Permissions | PDF file iconPDF (127 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2012 , Page(s): 321 - 322
    Save to Project icon | Request Permissions | PDF file iconPDF (168 KB)  
    Freely Available from IEEE
  • A letter or a conference paper? Conundrum resolved

    Publication Year: 2012 , Page(s): 323
    Save to Project icon | Request Permissions | PDF file iconPDF (26 KB)  
    Freely Available from IEEE
  • A Discrete Bit Loading Algorithm for FBMC/OQAM

    Publication Year: 2012 , Page(s): 324 - 327
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (870 KB) |  | HTML iconHTML  

    In this letter the discrete rate maximization problem is investigated for FBMC/OQAM. The analysis reveals that if there is crosstalk certain bit allocations violate the power constraints. Aiming at ensuring the feasibility along with alleviating the complexity we have devised a novel iterative algorithm, which always converges. Simulation-based results show that the proposed algorithm performs close to the upper bound for high-coherence bandwidth channels. Under highly frequency selective channels the existing algorithms are not able to guarantee the target SER whereas our approach guarantees the QoS. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Video Hashing Algorithm With Weighted Matching Based on Visual Saliency

    Publication Year: 2012 , Page(s): 328 - 331
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1531 KB) |  | HTML iconHTML  

    In this letter, a novel video hashing algorithm is proposed, in which the weighted hash matching is defined in video hashing for the first time. In the proposed algorithm, the video hash is generated based on the ordinal feature derived from the temporally informative representation image (TIRI). At the same time the representative saliency map (RSM) is constructed by the visual saliency maps in video segments, and it generates the hash weights for hash matching. During hash matching, the traditional bit error rate (BER) is weighted with hash weights to form the weighted error rate (WER). WER is used to measure the similarity between different hashes. Experiments on different kinds of videos with different kinds of attacks verify the robustness and discrimination of the proposed algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis of Two-Way AF Relaying Systems Over Cascaded Nakagami- m Fading Channels

    Publication Year: 2012 , Page(s): 332 - 335
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (835 KB) |  | HTML iconHTML  

    In this letter, we investigate the error rate performance of two-way amplify-and-forward (AF) relaying communication system over independently but not necessarily identically distributed (i.n.i.d.) cascaded Nakagami- fading channels. We have derived a closed-form expressions of cumulative distribution function (CDF) and moment generating function (MGF) for considering system. By using these expressions, we analyse the performance of two-way AF relaying system in terms of outage probability and symbol error rate (SER). Numerical and simulation results show the validity of the proposed mathematical analysis and point out the confirmation of the analytical results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Targeted Steganalysis of Edge Adaptive Image Steganography Based on LSB Matching Revisited Using B-Spline Fitting

    Publication Year: 2012 , Page(s): 336 - 339
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (813 KB) |  | HTML iconHTML  

    In this letter, the authors point out that the readjusting phase of edge adaptive image steganography based on LSB matching revisited introduces a pulse distortion to the long exponential tail of the histogram of the absolute difference of the pixel pairs. Making use of this observation, a targeted steganalytic method based on B-Spline fitting is proposed. Experimental results show that the proposed method obtains excellent results for detecting stego images with low embedding rate. The dominant performance of our method compared with state-of-the-art blind steganalyzers, such as SPAM and SRM is apparent. Furthermore, our method can accurately estimate the threshold used in the secret data embedding procedure and can separate the stego images with unit block size from those with block sizes greater than one. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Exploitation of the Redundant Energy in UW-OFDM: LMMSE Versus Sphere Detection

    Publication Year: 2012 , Page(s): 340 - 343
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (866 KB) |  | HTML iconHTML  

    Unique word orthogonal frequency division multiplexing (UW-OFDM) inherently introduces a complex number Reed Solomon (RS) code. Originally, the code generator matrix of systematic coded UW-OFDM had been designed rather intuitively by minimizing the mean redundant energy. In this work we justify this approach by applying a cost function that incorporates the overall transceiver chain including a linear minimum mean square error (LMMSE) data estimator. In addition to the LMMSE estimator we investigate a nonlinear sphere detection (SD) receiver for both systematic and nonsystematic coded UW-OFDM. We study and interpret the estimators' performance and their diverse ability to exploit the redundant energy. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Transforms Tightly Bounded by DCT and KLT

    Publication Year: 2012 , Page(s): 344 - 347
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1262 KB) |  | HTML iconHTML  

    It is well known that the discrete cosine transform (DCT) and Karhunen-Loève transform (KLT) are two good representatives in image and video coding: the first can be implemented very efficiently while the second offers the best R-D coding performance. In this work, we attempt to design some new transforms with two goals: i) approaching to the KLT's R-D performance and ii) maintaining the implementation cost no bigger than that of DCT. To this end, we follow a cascade structure of multiple butterflies to develop an iterative algorithm: two out of N nodes are selected at each stage to form a Givens rotation (which is equivalent to a butterfly); and the best rotation angle is then determined by maximizing the resulted coding gain. We give the closed-form solutions for the node-selection as well as the angle-determination, together with some design examples to demonstrate their superiority. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Radix-3 Algorithm for the Generalized Discrete Hartley Transform of Type II

    Publication Year: 2012 , Page(s): 348 - 351
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1047 KB) |  | HTML iconHTML  

    We present a new fast radix-3 algorithm for the computation of the length-N generalized discrete Hartley transform of type-II (GDHT-II), where N = 3m, m ≥ 2. Then we apply this algorithm to the direct computation of length-N GDHT-II coefficients when given three adjacent length-N/3 GDHT-II coefficients. The computational complexity of the proposed method is lower than that of the traditional approach for length N ≥ 9. The arithmetic operations can be saved from 19% to 29% for N = 3m varying from 9 to 243 and from 17% to 29% for N = 3×2m varying from 12 to 384. Furthermore, the new approach can be easily implemented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-Frequency Analysis via Ramanujan Sums

    Publication Year: 2012 , Page(s): 352 - 355
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (630 KB) |  | HTML iconHTML  

    Research in signal processing shows that a variety of transforms have been introduced to map the data from the original space into the feature space, in order to efficiently analyze a signal. These techniques differ in their basis functions, that is used for projecting the signal into a higher dimensional space. One of the widely used schemes for quasi-stationary and non-stationary signals is the time-frequency (TF) transforms, characterized by specific kernel functions. This work introduces a novel class of Ramanujan Fourier Transform (RFT) based TF transform functions, constituted by Ramanujan sums (RS) basis. The proposed special class of transforms offer high immunity to noise interference, since the computation is carried out only on co-resonant components, during analysis of signals. Further, we also provide a 2-D formulation of the RFT function. Experimental validation using synthetic examples, indicates that this technique shows potential for obtaining relatively sparse TF-equivalent representation and can be optimized for characterization of certain real-life signals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Stochastic System for Large Network Growth

    Publication Year: 2012 , Page(s): 356 - 359
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (751 KB) |  | HTML iconHTML  

    This letter proposes a new model for preferential attachment in dynamic directed networks. This model consists of a linear time-invariant system that uses past observations to predict future attachment rates, and an innovation noise process that induces growth on vertices that previously had no attachments. Analyzing a large citation network in this context, we show that the proposed model fits the data better than existing preferential attachment models. An analysis of the noise in the dataset reveals power-law degree distributions often seen in large networks, and polynomial decay with respect to age in the probability of citing yet-uncited documents. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling of Multipath Environment Using Copulas for Particle Filtering Based GPS Navigation

    Publication Year: 2012 , Page(s): 360 - 363
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1080 KB) |  | HTML iconHTML  

    Today in GPS navigation, an accuracy from 5 to 10 m can be achieved, but performance can be strongly degraded in a multipath environment. Multipath can introduce large errors when measuring the distance between the satellites and the GPS receiver. They are commonly modeled by additive-measurement noise variance jumps affecting GPS measurements if there is a direct path between the satellites and the receiver and by additive-measurement noise mean-value jumps otherwise. If two signals from satellites have close directions of arrival, they are very likely to be simultaneously degraded by multipath. Therefore, in this letter we suggest taking into account the spatial dependencies between GPS measurements when modeling multipath occurrence/disappearance. For that purpose, we use a probabilistic tool, namely copulas. Then, as the proposed model is strongly nonlinear and non-Gaussian, we jointly estimate the mobile location and perform the multipath detection/estimation by using particle filtering. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Block Fixed Point Continuation Algorithm for Block-Sparse Reconstruction

    Publication Year: 2012 , Page(s): 364 - 367
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1137 KB) |  | HTML iconHTML  

    Block-sparse reconstruction, which arises from the reconstruction of block-sparse signals in structured compressed sensing, is generally considered difficult to solve due to the mixed-norm structure. In this letter, we propose an algorithm for reconstructing block-sparse signals, that is an extension of fixed point continuation in block-wise case by incorporating block coordinate descent technique. We also apply our algorithm to multiple measurement vector reconstruction, that is a special case of block-sparse reconstruction and can be used in magnetic resonance imaging reconstruction. Numerical results show the validity of our algorithm for both synthetic and real-world data. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Leakage-Based MMSE Beamforming Design for a MIMO Interference Channel

    Publication Year: 2012 , Page(s): 368 - 371
    Cited by:  Papers (16)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (851 KB) |  | HTML iconHTML  

    We propose a low complexity design of the linear transmit filters for a MIMO interference channel. This design is based on a minimum mean squared error (MMSE) approach incorporating the signal and the interference leakage for each transmitter. Unlike the previous methods, it allows a closed-form expression of the regularization factor for the MMSE transmit filter. Hence, it requires a lower computational complexity compared to the conventional MMSE approach that is optimally achieved by solving a polynomial equation to find the regularization factor. Furthermore, the mean squared error (MSE) performance of the proposed design is verified by simulations to have nearly no loss compared to the conventional MMSE approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of Transmit Antenna Selection Physical Layer Security Schemes

    Publication Year: 2012 , Page(s): 372 - 375
    Cited by:  Papers (27)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1184 KB) |  | HTML iconHTML  

    We analyze the physical layer (PHY) security of a communication scheme consisting of a multiple antenna transmitter with a single radio frequency (RF) chain using transmit antenna selection (TAS) and a single antenna receiver, in the presence of a sophisticated multiple antenna eavesdropper. We develop closed-form expressions for the analysis of the secrecy outage probability, and we show that the PHY security can be considerably enhanced when multiple antennas are available at the legitimate transmitter. Moreover, a single RF chain multiple antenna transmitter reduces cost, complexity, size and power consumption at the expense of a slight loss in performance with respect to a multiple RF chain transmitter. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Signal Processing Letters information for authors

    Publication Year: 2012 , Page(s): 376 - 377
    Save to Project icon | Request Permissions | PDF file iconPDF (142 KB)  
    Freely Available from IEEE
  • Signal Processing Society Membership Application

    Publication Year: 2012 , Page(s): 378
    Save to Project icon | Request Permissions | PDF file iconPDF (807 KB)  
    Freely Available from IEEE
  • Special Issue on Intelligent Video Surveillance for Public Security & Personal Privacy

    Publication Year: 2012 , Page(s): 379
    Save to Project icon | Request Permissions | PDF file iconPDF (721 KB)  
    Freely Available from IEEE
  • Special Issue on Privacy and Trust Management in Cloud and Distributed Systems

    Publication Year: 2012 , Page(s): 380
    Save to Project icon | Request Permissions | PDF file iconPDF (142 KB)  
    Freely Available from IEEE
  • IEEE Signal Processing Society Information

    Publication Year: 2012 , Page(s): C3
    Save to Project icon | Request Permissions | PDF file iconPDF (33 KB)  
    Freely Available from IEEE
  • [Blank page]

    Publication Year: 2012 , Page(s): C4
    Save to Project icon | Request Permissions | PDF file iconPDF (5 KB)  
    Freely Available from IEEE

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
Peter Willett
University of Connecticut
Storrs, CT 06269
peter.willett@uconn.edu