By Topic

Information Theory for Wireless Networks, 2007 IEEE Information Theory Workshop on

Date 1-6 July 2007

Filter Results

Displaying Results 1 - 25 of 60
  • [Front matter]

    Publication Year: 2007, Page(s):1 - 2
    Request permission for commercial reuse | PDF file iconPDF (927 KB)
    Freely Available from IEEE
  • [Breaker page]

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

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

    Publication Year: 2007, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (57 KB) | HTML iconHTML
    Freely Available from IEEE
  • Contributor listings

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

    Publication Year: 2007, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (2572 KB)
    Freely Available from IEEE
  • Diversity Gains Across Line of Sight and Rich Scattering Environments from Space-Polarization-Time Codes

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

    Space-time codes built out of Alamouti components have been adopted in wireless standards such as UMTS, IEEE 802.1 In and IEEE 802.16 where they facilitate higher data rates through multiplexing of parallel data streams and the addition of two or more antennas at the receiver that perform interference cancellation. This paper provides new theoretical insight into an algorithm for interference canc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Deterministic Model for Wreless Relay Networks an its Capacity

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

    We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels , and compute the end-to-end capacity when there is a single source and a single destination and an arbitrary number of relay nodes. This capacity has the interpretation of the in ax-flow min... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Code Constructions for SIMO-OFDM Frequency Selective Fading Channels

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

    A SIMO-OFDM system with nr receive antennas and Q subcarriers is considered in this paper. Under a frequency-selective Rayleigh fading channel with L multipaths, L < Q, it is first shown that the channel capacity of this channel is same as that of the flat Rayleigh fading channel and is independent of the power-delay profiles. It is also shown that the outage exponent equals d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Subspace Properties of Randomized Network Coding

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

    Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contribution of this work is to investigate properties of the subspaces spanned by the collected coding vectors in each network node. We use these propert... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable Cooperative Source Transmission with Side Information

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

    We consider reliable transmission of a discrete memoryless source over a cooperative relay broadcast channel, where both the relay and the destination terminals want to reconstruct the source; and over a relay channel, where only the destination terminal wishes to obtain a lossless reconstruction. We assume that both the relay and the destination have correlated side information. We find the neces... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Decentralized Approach to Network Coding Based on Learning

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

    Network coding is used to efficiently transmit information in a network from source nodes to sink nodes through intermediate nodes. It has been shown that linear coding is sufficient to achieve the multicast network capacity. In this paper, we introduce a method to design capacity achieving network codes based on reinforcement learning and makes using the market theory concepts. We demonstrate tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rank Distance Codes for ISI channels

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

    Designs for transmit alphabet constrained space-time codes naturally lead to questions about the design of rank distance codes. Recently, diversity embedded multi-level space-time codes for flat fading channels have been designed by using sets of binary matrices with rank distance guarantees over the binary field and mapping them onto QAM and PSK constellations. In this paper we give the design of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Maximizing Coverage in Gaussian Relay Networks

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

    Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We consider an alternative approach, focusing on maximizing coverage for a given rate. This novel perspective enables treatment of the relay location as a design parameter, producing an extra degree of freedom that may be optimized. Focusing on coverage, we... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Expected Distortion for Gaussian Source with a Broadcast Transmission Strategy over a Fading Channel

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

    We consider the problem of transmitting a Gaussian source on a slowly fading Gaussian channel, subject to the mean squared error distortion measure. The channel state information is known only at the receiver but not the transmitter. The source is assumed to be encoded in a successive refinement manner, and then transmitted over the channel using the broadcast strategy. In order to minimize the ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diversity-Multiplexing Gain Trade-off of a MIMO System with Relays

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

    We find the diversity-multiplexing gain trade-off of a multiple-antenna (MIMO) system with M transmit antennas, N receive antennas, R relay nodes, and with independent Rayleigh fading, in which the relays apply a distributed space-time code. In this two-stage scheme the trade-off is shown to coincide with that of a MIMO system with R transmit and min{M,N} receive antennas. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Sequences with Good Correlation Properties: A New Perspective

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

    The so-called merit factor approach (MFA) to radar binary sequence design has led to several theoretical contributions in fairly diverse research areas including information theory, computer science, combinatorial optimization, and analytical number theory. However, the pragmatic motivation of this approach is shown here to be questionable. Specifically, the MFA -which basically aims at minimizing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Optimal Quadriphase Sequences with Larger Lnear Span

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

    In this paper, we construct two new families S and U of optimal quadriphase sequences. Compared to the family A constructed by Boztas et al and family D investigated by Tang et al respectively, the proposed families have the same optimal correlation properties and family size, but larger linear spans. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Isochronous Data Transmission With Rates Close to Channel Capacity

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

    The existing ARQ schemes (including a hybrid ARQ) have a throughput depending on packet error probability. In this paper we describe a strategy for delay tolerant applications which provide a constant throughput until the algorithm robustness criterion is not failed. The algorithm robustness criterion is applied to find the optimum size of the retransmission block in the assumption of the small ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Optimization of Adaptive Modulation and Coding, Power Control and Packet Retransmission over Block Fading Channels

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

    Adaptive modulation and coding (AMC) and automatic repeat request (ARQ) protocol are powerful techniques for improving the spectral efficiency (SE) or the error performance in wireless packet networks over fading channels. In this paper, we first consider a discrete-rate M-QAM based AMC scheme and propose a variable power transmission scheme for transmission of packets over block-fading wireless c... View full abstract»

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

    Publication Year: 2007, Page(s): 1
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (24 KB)

    A Fountain code is a code of fixed dimension and a limitless block-length. This is a class of codes with many interesting properties and applications. In this talk I will introduce several classes of probabilistic Fountain codes, including LT-and Raptor codes, show tools for their design and analysis, and discuss how they are used today to solve various data transmission problems on heterogenous u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid ARQ: Theory, State of the Art and Future Directions

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

    Hybrid ARQ transmission schemes combine the conventional ARQ with forward error correction. Incremental redundancy hybrid ARQ schemes adapt their error correcting code redundancy to varying channel gains, and thus achieve better throughput performance than ordinary ARQ, particularly over wireless channels with fluctuating channel conditions. Consequently, the scheme has been adopted by a number of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Cross-Packet Channel Coding with Low-Density Parity-Check Codes

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

    We describe a new mechanism that extends the notion of current hybrid automatic repeat request (H-ARQ) schemes. Unlike other H-ARQ methods, if a retransmission for a packet is required, the retransmission jointly embeds the original information of the first packet as well as additional information from a second packet. In fading channels, this approach introduces diversity gain for the first packe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional Walsh Transform and a Characterization of Bent Functions

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

    In this paper, a multidimensional Walsh transform is used to obtain a characterization of vector-valued bent function in terms of the value distributions of the translates of the function by linear functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on Distinguishing Attacks

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

    A new distinguishing attack scenario for stream ciphers, allowing a resynchronization collision attack, is presented. The attack can succeed if the part of the state that depends on both the key and the IV is smaller than twice the key size. It is shown that the attack is applicable to block ciphers in OFB mode. For OFB mode, the attack is more powerful than the previously known generic distinguis... View full abstract»

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