2007 41st Annual Conference on Information Sciences and Systems

14-16 March 2007

Filter Results

Displaying Results 1 - 25 of 185
  • [Front cover]

    Publication Year: 2007
    Request permission for commercial reuse | PDF file iconPDF (169 KB)
    Freely Available from IEEE
  • Forty-first Annual Conference on Information Sciences and Systems

    Publication Year: 2007, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (18 KB)
    Freely Available from IEEE
  • Copyright page

    Publication Year: 2007, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (85 KB)
    Freely Available from IEEE
  • Greetings

    Publication Year: 2007, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (513 KB) | HTML iconHTML
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2007, Page(s):v - xviii
    Request permission for commercial reuse | PDF file iconPDF (569 KB)
    Freely Available from IEEE
  • Algorithms for Relaying via Channel Quantization in Finite Rate Feedback Limited Sensor Networks

    Publication Year: 2007, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (407 KB) | HTML iconHTML

    Relaying is often advocated for improving system performance by enhancing spatial diversity in wireless networks. In this paper, we address the issue of energy tradeoff made by relay nodes between transmitting their own data and forwarding other nodes' information in fading channels. First, assuming perfect channel state information (CSI), we propose a power control policy in a two-node relay netw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross-layer Resource Allocation Strategies for Quality-of-Service Driven Opportunistic Routing Over Wireless Relay Networks

    Publication Year: 2007, Page(s):7 - 12
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1567 KB) | HTML iconHTML

    We develop a cross-layer optimization framework incorporating opportunistic routing and quality-of service (QoS) driven power allocation. By applying opportunistic routing, we optimally select one relay for each source-destination pair to assist their transmissions. By integrating information theory with the concept of effective capacity, our strategies aim at maximizing the relay network throughp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Relay Channel with a Wire-tapper

    Publication Year: 2007, Page(s):13 - 18
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (819 KB) | HTML iconHTML

    In this work a relay channel with a wire-tapper is studied for both discrete memoryless and Gaussian channels. The wire-tapper receives a physically degraded version of the destination's signal. We find inner and outer bounds for the capacity-equivocation rate region. We also argue that when the destination receives a physically degraded version of the relay's signal, inner and outer bounds meet f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Resource Allocation for Multi Source-Destination Relay Networks

    Publication Year: 2007, Page(s):19 - 24
    Cited by:  Papers (4)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1464 KB) | HTML iconHTML

    We consider a wireless network consisting of multiple sources communicating with their corresponding destinations utilizing a single half-duplex relay. The goal is to minimize the outage probability of the total rate in the network by allocating transmission powers and durations as well as rates to the nodes based on instantaneous channel gains, while satisfying a total average network power. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward Maximizing Throughput in Wireless Relay: A General User Cooperation Model

    Publication Year: 2007, Page(s):25 - 30
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1698 KB) | HTML iconHTML

    We consider a generalization of the classic two-slot user cooperation model with a target to maximize the throughput. By allowing the relay to transmit, in the second time slot, an arbitrary combination of the partner's data and its new data, we show that the system throughput, which accounts for both the information rate and the outage probability, is in general improved. We further generalize th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Mean Convergence Analysis for Partial Update NLMS Algorithms

    Publication Year: 2007, Page(s):31 - 34
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    This paper discusses the convergence rates of partial update normalized least mean square (NLMS) algorithms for long, finite impulse response (FIR) adaptive filters. We specify the general form of convergence of tap weight vector's mean deviation for white Guassian input, and analyze several best known partial update algorithms' performance. These results are compared with the conventional NLMS al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feedback and Weighting Mechanisms for Improving Jacobian Estimates in the Adaptive Simultaneous Perturbation Algorithm

    Publication Year: 2007, Page(s):35 - 40
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3641 KB) | HTML iconHTML

    It is known that a stochastic approximation (SA) analogue of the deterministic Newton-Raphson algorithm provides an asymptotically optimal or near-optimal form of stochastic search. In a recent paper, Spall (2006) introduces two enhancements that generally improve the quality of the estimates for underlying Jacobian (Hessian) matrices, thereby improving the quality of the estimates for the primary... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User Allocation in Multi-System, Multi-Service Scenarios: Upper and Lower Performance Bound of Polynomial Time Assignment Algorithms

    Publication Year: 2007, Page(s):41 - 46
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1710 KB) | HTML iconHTML

    In this paper we cover the problem of how users of different service classes should be assigned to a set of radio access technologies (RAT). All RAT have overlapping coverage and the aim is to maximize a weighted sum of assignable users. Under the constraint that users cannot be split between multiple air-interfaces the problem is identified as NP-complete. In the first part of the paper we derive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proportionate-Type Steepest Descent and NLMS Algorithms

    Publication Year: 2007, Page(s):47 - 50
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1191 KB) | HTML iconHTML

    In this paper, a unified framework for representing proportionate type algorithms is presented. This novel representation enables a systematic approach to the problem of design and analysis of proportionate type algorithms. Within this unified framework, the feasibility of predicting the performance of a stochastic proportionate algorithm by analyzing the performance of its associated deterministi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detecting Information Flows: Improving Chaff Tolerance by Joint Detection

    Publication Year: 2007, Page(s):51 - 56
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2146 KB) | HTML iconHTML

    The problem of detecting encrypted information flows using timing information is considered. An information flow consists of both information-carrying packets and irrelevant packets called chaff. A relay node can perturb the timing of information-carrying packets as well as adding or removing chaff packets. The goal is to detect whether there is an information flow through certain nodes of interes... View full abstract»

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

    Publication Year: 2007, Page(s):57 - 62
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (315 KB) | HTML iconHTML

    Recent work in the theory of subspace filtering and estimation, for example the Multistage Wiener Filter (MWF) of Goldstein et. al., has focused primarily on the case of finite dimension filtering. While this is the more practical case, as it can be implemented in a general purpose computer, it has left open the theoretical question of the behavior of subspace filters in the infinite dimension cas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum A-Posteriori Estimation in Linear Models With a Gaussian Model Matrix

    Publication Year: 2007, Page(s):63 - 67
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (877 KB) | HTML iconHTML

    We consider the Bayesian inference of a random Gaussian vector in a linear model with a Gaussian model matrix. We derive the maximum a-posteriori (MAP) estimator for this model and show that it can be found using a simple line search over a unimodal function that can be efficiently evaluated. Next, we discuss the application of this estimator in the context of near-optimal detection of near-Gaussi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Detection and Identification of an Unobservable Change in the Distribution of a Random Sequence

    Publication Year: 2007, Page(s):68 - 73
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1182 KB) | HTML iconHTML

    This paper examines the joint problem of detection and identification of a sudden and unobservable change in the probability distribution function (pdf) of a sequence of independent and identically distributed (i.i.d.) random variables to one of finitely many alternative pdf's. The objective is quick detection of the change and accurate inference of the ensuing pdf. Following a Bayesian approach, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Belief Propagation Based Multihead Multitrack Detection over Conventional and Bit-Patterned Media Storage Systems

    Publication Year: 2007, Page(s):74 - 79
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2310 KB) | HTML iconHTML

    We propose a low complexity detection technique for multihead multitrack recording systems. By exploiting the sparseness of the two dimensional (2-D) partial response channel, we start with the development of an algorithm which performs belief propagation (BP) over the corresponding factor graph. We consider the BP-based detector not only for the partial response channel, but also for the more pra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Erasure Codes with Small Overhead Factor and Their Distributed Storage Applications

    Publication Year: 2007, Page(s):80 - 85
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1601 KB) | HTML iconHTML

    In this paper, we consider a family of XOR-based erasure codes with finite-sized randomly-generated parity check matrices, and report the results of thorough computational search for suitable erasure codes for distributed storage applications. Although the discovered matrices are not "low density" and the resulting codes are only approximately maximum distance separable (MDS) codes, they have perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Groups with a Shift Structure: the Schreier Matrix and an Algorithm

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

    A time-invariant group trellis is essentially a group shift or time-invariant group code. A group with a shift structure is the branch group of a strongly controllable time-invariant group trellis. We show that the Loeliger and Mittelholzer definition of a group with a shift structure is equivalent to a second definition by using a controllable Schreier matrix, a certain normal series written as a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Near-ML Decoding of CRC Codes

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

    We study a new bit-flipping algorithm, coupled with an algebraic decoder, for near-ML decoding of cyclic redundancy check (CRC) codes on the binary AWGN channel. The asymptotic coding gain of such codes approaches 6 dB, and the real gain at 10-4 block error probability is about 4.5 dB. We show that a generalization of Chase's algorithm, called the {a,b} algorithm, is able to achieve nea... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guidelines for Channel Code Design in Quasi-Static Fading Channels

    Publication Year: 2007, Page(s):95 - 100
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1257 KB) | HTML iconHTML

    In this paper, we provide guidelines for the design of good binary error correcting codes in quasi-static fading channels, using established design rules in AWGN channels as a starting point. The proposed analysis is based on the Gaussian assumption of demodulator log-likelihood ratios. This assumption allows to decouple the influence of the convergence threshold, slope in the BER waterfall region... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analog Coding for Delay-Limited Applications

    Publication Year: 2007, Page(s):101 - 106
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1296 KB) | HTML iconHTML

    In this paper, we consider the problem of sending an analog source over an additive white Gaussian noise channel. The traditional analog coding schemes suffer from the threshold effect We introduce two robust schemes for analog conding. Unlike the previous methods, the new methods asymptotically achieve the optimal scaling of the signal-to-distortion-ratio (SDR) without being affected by the thres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis of MIMO Receivers under Imperfect CSIT

    Publication Year: 2007, Page(s):107 - 112
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1347 KB) | HTML iconHTML

    This paper considers spatial multiplexing (SM) systems with preceding. The precoder is derived from the singular value decomposition (SVD) of the available channel state information at the transmitter (CSIT) and the receiver is a function of the precoder and the current channel. With perfect CSIT, the MRxMT flat-fading MIMO channel can be decomposed into mm(MT,M View full abstract»

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