By Topic

2009 43rd Annual Conference on Information Sciences and Systems

18-20 March 2009

Filter Results

Displaying Results 1 - 25 of 182
  • [Front and back covers]

    Publication Year: 2009, Page(s):c1 - c2
    Request permission for commercial reuse | PDF file iconPDF (872 KB)
    Freely Available from IEEE
  • Greetings

    Publication Year: 2009, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (258 KB) | HTML iconHTML
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s):ii - iii
    Request permission for commercial reuse | PDF file iconPDF (132 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009, Page(s):iv - xxii
    Request permission for commercial reuse | PDF file iconPDF (1722 KB)
    Freely Available from IEEE
  • Distributed Compressed Video Sensing

    Publication Year: 2009, Page(s):1 - 2
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (727 KB) | HTML iconHTML

    This paper proposes a novel framework called Distributed Compressed Video Sensing (DISCOS) - a solution for Distributed Video Coding (DVC) based on the compressed sensing (CS) theory. The DISCOS framework compressively samples each video frame independently at the encoder and recovers video frames jointly at the decoder by exploiting an interframe sparsity model and by performing sparse recovery w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic updating for sparse time varying signals

    Publication Year: 2009, Page(s):3 - 8
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1285 KB) | HTML iconHTML

    Many signal processing applications revolve around finding a sparse solution to a (often underdetermined) system of linear equations. Recent results in compressive sensing (CS) have shown that when the signal we are trying to acquire is sparse and the measurements are incoherent, the signal can be reconstructed reliably from an incomplete set of measurements. However, the signal recovery is an inv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis and optimization of distributed linear coding of Gaussian sources

    Publication Year: 2009, Page(s):9 - 13
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1298 KB) | HTML iconHTML

    Recent work has shown that compressed sensing can be successfully applied in distributed scenarios. In this framework, we study the exploitation of the correlation statistics in the encoding and recovery processes for independently transmitted Gaussian correlated sources, obtaining the optimal projection matrices in the MMSE sense. Encoding is performed separately for each source using either rand... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sharp upper bound on error probability of exact sparsity recovery

    Publication Year: 2009, Page(s):14 - 17
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB) | HTML iconHTML

    Imagine the vector y = Xbeta + epsi where beta isin Ropfm has only k non zero entries and epsi isin Rn is a Gaussian noise. This can be viewed as a linear system with sparsity constraints corrupted with noise. We find a non-asymptotic upper bound on the error probability of exact recovery of the sparsity pattern given any generic measurement matrix X. By drawing X from a Gaus... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-linear coding for improved performance in compressive sensing

    Publication Year: 2009, Page(s):18 - 22
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB) | HTML iconHTML

    We propose a system based on the combination of compressive sensing and non-linear processing that shows excellent robustness against noise. The key idea is the use of nonlinear mappings that act as analog joint source-channel encoders, processing the compressive sensing measurements proceeding from an analog source and producing continuous amplitude samples that are transmitted directly through t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggregating disparate judgments using a coherence penalty

    Publication Year: 2009, Page(s):23 - 27
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (11116 KB) | HTML iconHTML

    In this paper, practical algorithms for solving the probabilistic judgment aggregation problem are given. First, the scalable Coherent Approximation Principle (CAP) algorithm proposed by Predd, et al., and its computational savings gained through Successive Orthogonal Projection are explained. Implications of de Finetti's theorem in this situation are also discussed. Then a coherence penalty is de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new idea for addressing multi-objective combinatorial optimization: Quantum multi-agent evolutionary algorithms

    Publication Year: 2009, Page(s):28 - 31
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (88 KB) | HTML iconHTML

    Multi-objective combinatorial optimization (MOCO) problem is investigated in this paper. Combining the characters of agent and quantum-bit, a new idea, i.e., Quantum multi-agent evolutionary algorithms (QMAEA), for addressing MOCO problem is proposed. In QMAEA, each agent represented with quantum-bit is defined as a solution. Several operations such as evaluation-operation, competition-operation, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non-asymmetric Slepian-Wolf decoding using belief propagation

    Publication Year: 2009, Page(s):32 - 36
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (155 KB) | HTML iconHTML

    We consider a generalized formulation for Slepian-Wolf coding based on the Wyner syndrome approach and present some preliminary theoretical results. We then describe how the compressed source can be decoded using belief propagation under our formulation. Simulation experiment results are given to show feasibility of the approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Noise adaptive LDPC decoding using particle filter

    Publication Year: 2009, Page(s):37 - 42
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (206 KB) | HTML iconHTML

    Belief propagation (BP) is a powerful algorithm to decode the low-density parity check (LDPC) codes over the additive white Gaussian noise (AWGN) channel. The traditional BP algorithm cannot adapt efficiently to the statistical change of the AWGN channel. Particle filter is a algorithm to estimate a variable of interest as it evolves over time. In this paper, we use particle filter to estimate the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing computational complexity of time delay estimation method using frequency domain alignment

    Publication Year: 2009, Page(s):43 - 46
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (130 KB) | HTML iconHTML

    In this paper, we consider the estimation of time delays between multiple waveforms which are delayed forms of a single waveform. We use a previously defined cost function whose minimization is achieved through applying linear phase shift operators to the discrete Fourier transforms (DFTs) of the waveforms. The optimal phase shift operators result in the least differences between the phase shifted... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum Hellinger Distance based classification of underwater acoustic signals

    Publication Year: 2009, Page(s):47 - 49
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1035 KB) | HTML iconHTML

    Source classification and localization in the underwater environment is a challenging problem in part because propagation through the space- and time-varying medium introduces uncertainty in the signal. Coupled with uncertainty in environmental parameters, this uncertainty in received signals leads to a statistical treatment. Minimum Hellinger distance (MHD) methods provide a robust and efficient ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A moving radioactive source tracking and detection system

    Publication Year: 2009, Page(s):50 - 54
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2309 KB) | HTML iconHTML

    In this paper we investigate the tracking and detection of moving radioactive sources using an array of sensors that are deployed along the highway to collect gamma particle counts. When a potential radioactive source carrier passes by the array of sensors, gamma particle counts are collected and are sent to a fusion center for estimating vehicle motion state using particle filter technique. Then ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speech enhancement using the multistage Wiener filter

    Publication Year: 2009, Page(s):55 - 60
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (549 KB) | HTML iconHTML

    In this paper we develop a subspace speech enhancement approach for estimating a signal which has been degraded by additive uncorrelated noise. This problem has numerous applications such as in hearing aids and automatic speech recognition in noisy environments. The proposed approach utilizes the multistage Wiener filter (MWF). This filter is constructed from a Krylov subspace associated with the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proportional-type NLMS algorithm with gain allocation providing maximum one-step conditional PDF for true weights

    Publication Year: 2009, Page(s):61 - 66
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (805 KB) | HTML iconHTML

    In this paper, we present a proportionate-type normalized least mean square algorithm which operates by choosing adaptive gains at each time step in a manner designed to maximize the conditional probability that the next-step coefficient estimates reach their optimal values. We compare and show that the performance of the maximum conditional probability density one-step algorithm is superior to th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alphabet sizes of auxiliary random variables in canonical inner bounds

    Publication Year: 2009, Page(s):67 - 71
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB) | HTML iconHTML

    Recently, we proposed canonical inner bounds for a broad class of multiterminal source coding problems, subsuming an array of known results. Computation of those bounds assumes importance in view of open tightness questions, as well as their role as benchmarks, and in other contexts. In this backdrop, as computational algorithms depend exponentially on alphabet sizes of auxiliary random variables,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing power allocation in analog joint source-channel coding

    Publication Year: 2009, Page(s):72 - 76
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB) | HTML iconHTML

    We propose an analog joint source-channel coding scheme for the transmission of analog Gaussian sources over AWGN channels. The key idea is the combination of a 1:1 uncoded system in which source symbols are directly sent through the noisy channel and a 2:1 non-linear system in which two source outputs are mapped to one channel symbol using space-filling curves. By doing so, the proposed scheme ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multilevel coding and multistage decoding for M-ary two-dimensional ISI channels

    Publication Year: 2009, Page(s):77 - 80
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (122 KB) | HTML iconHTML

    We propose a computationally efficient scheme to decode two-dimensional (2D) intersymbol interference (ISI) channel with M-ary input. The basic idea is to equalize the channel stage by stage. To begin with the stage with the highest signal power level, the BCJR algorithm is used to equalize each level by averaging the interference of the undecoded levels. Both the hard and soft decisions are passe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced complexity iterative equalizers for M-ary 2D ISI channels

    Publication Year: 2009, Page(s):81 - 86
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (206 KB) | HTML iconHTML

    This paper considers detection of a signal corrupted by 2D intersymbol interference (ISI) and additive white Gaussian noise (AWGN). We compute equivalent convolution masks for 4-ary and binary modulation with Gaussian and Sinc square point spread functions (PSFs). To maintain the same spatial density, the binary mask is wider than the corresponding 4-ary mask. Based on the maximum likelihood (ML) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic analysis of LDGM-based quantum codes

    Publication Year: 2009, Page(s):87 - 92
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2335 KB) | HTML iconHTML

    We study the error floor performance of a proposed family of LDGM-based quantum codes. LDGM-based quantum codes are Calderbank-Shor-Steane (CSS) codes based on the generator and parity-check matrices of a classical LDGM code. Decoding is performed in an iterative manner, by applying message passing over the corresponding graphs. The proposed codes allow greater flexibility and are easier to design... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nested erasure codes to achieve the singleton bounds

    Publication Year: 2009, Page(s):93 - 97
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1119 KB) | HTML iconHTML

    This paper presents innovative ideas to construct maximum distance separable (MDS) codes, optimal error correction codes that achieve the singleton bounds. The proposed codes are based on a circularly symmetric construction applied to a novel class of nested graphs, referred to as complete-graph-of-rings (CGR). We demonstrate the general idea of transforming graphs to array codes, provide the suff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the diversity-multiplexing tradeoff of the Gaussian MIMO brcadcast Channel

    Publication Year: 2009, Page(s):98 - 102
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (165 KB) | HTML iconHTML

    The optimal set of multiplexing gain tuples for the users in a broadcast network with K receivers having Nr antennas each and Nt antennas at the base station, given a minimum diversity gain constraint of d for each user, is investigated. An outer bound on this region is computed by analyzing the outage probability, where outage is defined as the event that the given rate tuple lies outside the cap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.