By Topic

Communications, 2006 International Zurich Seminar on

Date 22-24 Feb. 2006

Filter Results

Displaying Results 1 - 25 of 56
  • Cover page - 2006 International Zurich Seminar on Communications

    Publication Year: 2006, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (48 KB)
    Freely Available from IEEE
  • Copyright

    Publication Year: 2006, Page(s):2 - 4
    Request permission for commercial reuse | PDF file iconPDF (1286 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2006, Page(s):5 - 9
    Request permission for commercial reuse | PDF file iconPDF (46 KB)
    Freely Available from IEEE
  • Precoding Schemes for the MIMO-GBC

    Publication Year: 2006, Page(s):10 - 13
    Cited by:  Papers (31)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB) | HTML iconHTML

    The use of M antennas at the base station and of transmitter channel state information can boost the downlink throughput by a factor M (multiplexing gain), even though the receivers have a single antenna and do not cooperate. In this semi-tutorial work, we discuss some low-complexity alternatives to achieve a downlink throughput very close to the optimal sum capacity. We review and compare these a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A classification of multiple antenna channels

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

    We propose a new classification of multiple antenna channels. The classification is performed in the space of Hermitian forms defined by the channel representation. We introduce a geodesic metric between Hermitian forms and we build a finite number of classes. The centroids of the classification are found by a generalized Lloyd algorithm. Numerical examples illustrate the geodesic orbits, capacity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random Matrix Transforms and Applications via Non-Asymptotic Eigenanalysis

    Publication Year: 2006, Page(s):18 - 21
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (390 KB) | HTML iconHTML

    This work introduces an effective approach to derive the marginal density distribution of an unordered eigenvalue for finite-dimensional random matrices of Wishart and F type, based on which we give several examples of closed-form and series expressions for the Shannon and eta transforms of random matrices with nonzero mean and/or dependent entries. The newly obtained results allow for a compact n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Appropriate Antenna Patterns For A Compact MIMO Receiver

    Publication Year: 2006, Page(s):22 - 25
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (363 KB) | HTML iconHTML

    A compact MIMO receiver is reported previously (R.R. Muller et al., 2005) which uses only a single active receiving antenna and multiple passive elements to achieve spatial diversity. The passive elements are used to construct suitable antenna patterns which can be rotated 360 degrees around to achieve a MIMO effect. This paper discusses some antenna patterns which can be used for this purpose. An... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broadcasting over Two-Hop Relay Fading Channels

    Publication Year: 2006, Page(s):26 - 29
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (494 KB) | HTML iconHTML

    We consider a two-hop relay channel, with stringent delay constraints, which require transmission without channel state information (CSI), where only decoders possess perfect CSI estimation. Various relaying protocols and single-user broadcasting strategies are studied. For a decode-and-forward (DF) relay several broadcasting strategies are considered. Then, for an amplify-and-forward (AF) relay, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General Characterization of Bezout Space-Time Equalizers and Precoder

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

    This paper gives a general framework for the investigation of Bezout space-time equalizers, not only for finite impulse response (FIR) systems, but for general transfer functions. Necessary and sufficient conditions are given under which a matrix valued transfer function possess a left (or right) inverse with certain desired system theoretical properties (e.g. causality, stability, approximation b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Relation between Lattice-Reduction-Aided Equalization and Partial-Response Signaling

    Publication Year: 2006, Page(s):34 - 37
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (470 KB) | HTML iconHTML

    Equalization for channels with intersymbol interference is studied. In particular, we show that the well-known technique of partial-response signaling is the analogon to lattice-reduction-aided equalization of MIMO channels. An algorithm for factorizing the channel transfer function, replacing the lattice reduction in MIMO channels, is derived. It is shown that the proposed schemes offer a good tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative Spatial Multiplexing with Hybrid Channel Knowledge

    Publication Year: 2006, Page(s):38 - 41
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    We explore the concept of cooperative spatial multiplexing for use in MIMO multicell networks. One key application of this is the transmission of possibly correlated symbol streams jointly by several multiple-antenna access points toward multiple single antenna user terminals located in neighboring cells. To augment the realism of this setting, we consider different levels of channel state informa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive transmit eigenbeamforming with stochastic unitary plane rotations in MIMO systems with linear receivers

    Publication Year: 2006, Page(s):42 - 45
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (423 KB) | HTML iconHTML

    In this work we propose two adaptive transmit eigenbeamforming techniques for closed loop MIMO systems with low feedback rate. Both algorithms track a number of the dominant eigenmodes of a fading MIMO channel. The first algorithm applies unitary transformations incrementally, while the second runs a stochastic search over the space of angles that parameterize a set of orthonormal complex vectors.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Improved Space-Division Multiple-Access Strategy for Rayleigh-Fading Channels

    Publication Year: 2006, Page(s):46 - 49
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB) | HTML iconHTML

    We propose a new transmission strategy for the Rayleigh-fading multiple-access channel called space-time active rotation (STAR). STAR is a simple enhancement of the traditional space-division multiple-access (SDMA) strategy that enables a successive-cancellation (SC) decoder to approach the outage probability of the underlying multiple-access channel. We derive the outage probability of a STAR sys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lightweight Monitoring of Edge-based Admission Control

    Publication Year: 2006, Page(s):50 - 53
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    This paper describes a software monitor that can control and police end-to-end admission control schemes. The monitor has low hardware requirements and it is well suited to be implemented in access routers or firewalls. We present a prototype implemented with commodity hardware and open source software which performs protocol compliance monitoring and can log and filter out single misbehaving flow... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Operator Assisted Dynamic Spectrum Assignment with Dual Beacons

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

    Dynamic spectrum assignment refers to a new approach for radio regulation. Whereas today either command-and-control licensing, or alternatively unlicensed bands are used to coordinate the radio spectrum utilization, it is envisioned to coordinate the spectrum utilization in a more flexible way with the help of dynamic spectrum assignment. With this new approach, radio systems will share spectrum e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair Resource Bargaining Solutions for Cooperative Multi-Operator Networks

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

    The high cost associated with the rollout of 3G services encourages operators to share network infrastructure. Network sharing poses a new challenge in devising fair, efficient and Pareto-optimal resource allocation strategies to distribute system resources among users of different operators in the network. Cooperative game theory provides a framework for formulating such strategies. In this paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Downlink Packet Transmission Control Based on Handoff Status in CDMA Cellular Packet Networks

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

    This paper discusses packet transmission control in downlink of CDMA cellular communication systems and proposes a downlink packet transmission control scheme based on the soft handoff status to enhance the system performance. The proposed scheme controls the downlink packet transmissions by using a transmission window which is individually determined for each mobile station based on both its prop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the asymptotic behavior of end-point-based multicast streaming

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

    In this paper we propose an analytical model of a resilient, tree-based end-node multicast streaming architecture that employs path diversity and forward error correction for improved resilience to node churns and packet losses. We show that this architecture can distribute data to nodes arbitrarily far away from the root of the trees as long as the loss probability is lower than a certain thresho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approaches to Network Coding for Multiple Unicasts

    Publication Year: 2006, Page(s):70 - 73
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (375 KB) | HTML iconHTML

    In this paper, we survey the application of linear network coding to a multiple unicasts scenario in directed graphs. We discuss related work concerning the complexity of the construction of capacity-achieving linear network codes. We briefly review the algebraic formulation of the problem and in the remainder of the paper, we investigate two approaches to construct network codes. One is based on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Coding for Efficient Wireless Unicast

    Publication Year: 2006, Page(s):74 - 77
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    We consider the problem of establishing an efficient unicast connection over a wireless packet network. We show how network coding, combined with distributed flow optimization, gives a practicable approach that promises to significantly outperform the present approach of end-to-end or link-by-link retransmission combined with route optimization, where performance may be measured in terms of energy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RapidFlow: An Experimental Testbed for Information Flows with Network Coding

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

    Network coding refers to the capability of coding incoming information flows before transmitting to other nodes in the network, beyond the traditional capabilities of message forwarding and replication on a network node. It has been envisioned that network coding is best applied to overlay networks, in which network nodes are computers at the edge of the Internet and are sufficiently capable and f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network Coding Techniques for Network Monitoring: a Brief Introduction

    Publication Year: 2006, Page(s):82 - 83
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (115 KB) | HTML iconHTML

    Monitoring and diagnosis of network conditions is a central problem in networking. As such, it has received a lot of attention in the Internet community in general and in the context of overlay networks in particular. Independently, recent advances in network coding have shown that it is possible to increase network capacity and better share the available resources by allowing intermediate nodes t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Practical Network Coding for Wireless Environments

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

    In this extended abstract, we briefly describe COPE, an opportunistic approach to network coding that provides orders of magnitudes improvement in the throughput of dense wireless mesh networks. COPE supports multiple unicast flows, deals with bursty and unknown demands, and is simple and easy to deploy. Our COPE prototype provides the first implementation of network coding in the wireless environ... View full abstract»

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

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

    As we become increasingly dependent on computers connected to the Internet, we must protect them from worm attacks. Worms can gain complete control of millions of hosts in a few minutes, and they can use the infected hosts for malicious activities such as distributed denial of service attacks, relaying spam, corrupting data, and disclosing confidential information. Since worms spread too fast for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource Allocation in Multi-hop Wireless Networks

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

    We describe and analyze a joint scheduling, routing and congestion control mechanism for wireless networks, that asymptotically guarantees stability of the buffers and fair allocation of the network resources. The queue lengths serve as common information to different layers of the network protocol stack, which are otherwise decoupled. Our main contribution is to prove the asymptotic optimality of... View full abstract»

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