By Topic

Signals, Systems and Computers, 2004. Conference Record of the Thirty-Eighth Asilomar Conference on

Date 7-10 Nov. 2004

Go

Filter Results

Displaying Results 1 - 25 of 245
  • Conference Record Thirty-Eighth Asilomar Conference on Signals, Systems and Computers 2004

    Publication Year: 2004, Page(s): 0_1
    Request permission for commercial reuse | PDF file iconPDF (404 KB)
    Freely Available from IEEE
  • Conference Record of The Thirty-Eighth Asilomar Conference on Signals, Systems and Computers - Title

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

    Publication Year: 2004, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (389 KB)
    Freely Available from IEEE
  • Conference Record of The Thirty-Eighth Asilomar Conference on Signals, Systems and Computers - Title2

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

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

    Publication Year: 2004, Page(s):v - xxvii
    Request permission for commercial reuse | PDF file iconPDF (504 KB)
    Freely Available from IEEE
  • Student Paper Contest

    Publication Year: 2004, Page(s): xxviii
    Request permission for commercial reuse | PDF file iconPDF (413 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2004, Page(s): xxix
    Request permission for commercial reuse | PDF file iconPDF (410 KB) | HTML iconHTML
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 2004, Page(s): xxx
    Request permission for commercial reuse | PDF file iconPDF (389 KB)
    Freely Available from IEEE
  • Session TP1 Sensor Array and Relay Networks

    Publication Year: 2004, Page(s):1295 - 1296
    Request permission for commercial reuse | PDF file iconPDF (439 KB)
    Freely Available from IEEE
  • Group testing for sensor networks: the value of asking the right questions

    Publication Year: 2004, Page(s):1297 - 1301 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB) | HTML iconHTML

    Sharing of information is crucial in sensor networks to allow collective processing of observations made by distributed sensors. Our goal is to efficiently retrieve the distributed sensor measurements at a central processor or to share the information among all sensors. To achieve this goal with a minimum number of channel accesses, it naturally involves the compression of the distributed source d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Networking by parallel relays: diversity, lifetime and routing overhead

    Publication Year: 2004, Page(s):1302 - 1306 Vol.2
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (606 KB) | HTML iconHTML

    For several decades, research activities in mobile ad hoc networking have predominantly relied on the notion of serial relays where a data packet hops from one node to another in a serial fashion. Recent research activities in signal processing and information theory suggest that parallel relays have a greater potential than serial relays. In this paper, a significant diversity gain of using paral... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative diversity for wireless fading channels without channel state information

    Publication Year: 2004, Page(s):1307 - 1312 Vol.2
    Cited by:  Papers (38)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (635 KB) | HTML iconHTML

    Relaying and cooperative diversity allow multiple wireless radios to effectively share their antennas and create a virtual antenna array, thereby leveraging the spatial diversity benefits of multiple-input, multiple-output (MIMO) antenna systems. This paper examines the benefits of cooperative diversity for scenarios in which the receivers cannot exploit accurate channel state information (CSI). I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed space-time processing in sensor networks

    Publication Year: 2004, Page(s):1313 - 1317 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (546 KB) | HTML iconHTML

    Given the power limitations of sensor networks, it is of interest to determine cooperative communication schemes for such networks which can exploit the inherent spatial diversity of nodes. This paper proposes a simple scheme based on maximal ratio combining and a distributed transmission protocol to effectively exploit temporal and spatial diversity in a sensor network. In contrast to cooperative... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the capacity of broadband relay networks

    Publication Year: 2004, Page(s):1318 - 1322 Vol.2
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (615 KB) | HTML iconHTML

    This paper studies a broadband relay network model with multiple source nodes, multiple relay nodes and a single destination node. The capacities using different multiple access schemes (joint coding/decoding and OFDMA) under two relay schemes are derived, respectively. Numerical results are evaluated to compare the two multiple access schemes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Localization and tracking of multiple near-field sources using randomly distributed sensors

    Publication Year: 2004, Page(s):1323 - 1327 Vol.2
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    The performance of the maximum likelihood (ML) estimator using fast and adaptive simulated annealing methods has been investigated for near-field localization of multiple narrowband sources. The estimation results are found to be close to the Cramer-Rao lower bound (CRLB). The effect of unknown parameters such as the source frequency, amplitudes and path loss factors is studied. The performance is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Acoustic source localization in distributed sensor networks

    Publication Year: 2004, Page(s):1328 - 1332 Vol.2
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (882 KB) | HTML iconHTML

    This paper studies the problem of sound source localization in a distributed wireless sensor network formed by mobile general purpose computing and communication devices with audio I/O capabilities. In contrast to well understood localization methods based on dedicated microphone arrays, in our setting sound localization is performed using a sparse array of arbitrary placed sensors (in a typical s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A throughput scaling law for a class of wireless relay networks

    Publication Year: 2004, Page(s):1333 - 1337 Vol.2
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (787 KB) | HTML iconHTML

    In this paper we study coherent relaying in multi-antenna ad-hoc wireless networks. We suggest a one-hop relaying scheme suitable for multi-antenna relays; we demonstrate the value of employing multi-antenna transceivers in such coherent networks by deriving a scaling law that explicitly accounts for the same. We show that the throughput of such a network under the one-hop relaying protocol scales... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Breaker page]

    Publication Year: 2004, Page(s):1338 - 1340
    Request permission for commercial reuse | PDF file iconPDF (440 KB)
    Freely Available from IEEE
  • Functions approximable by E-fractions

    Publication Year: 2004, Page(s):1341 - 1344 Vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (566 KB) | HTML iconHTML

    After a brief reminder of Ercegovac's E-method, we introduce the notion of E-fraction (which is a fraction computable, in a given interval, by the E-method). We characterize the fractions that are E-fractiions and give an algorithm for checking whether a given function is approximable by an E-fraction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 35+ years of computer arithmetic: a view from the trenches

    Publication Year: 2004, Page(s):1345 - 1349 Vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (567 KB) | HTML iconHTML

    This paper reviews the author's experience in the area of computer arithmetic considering hardware (including analog multipliers, digital multipliers, multi term multiplier-adders, etc.), application to special purpose systems (including sonar equalizers, adaptive filters, etc.) and experience in teaching arithmetic concepts to graduate students. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High speed binary addition

    Publication Year: 2004, Page(s):1350 - 1353 Vol.2
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (521 KB) | HTML iconHTML

    Addition of two binary numbers is a fundamental operation in electronic circuits. Applications include arithmetic logic unit, floating-point operations and address generation. It is widely accepted that there is no single best adder implementation. Modern adder architectures utilize a hybrid scheme based on, among others, various parallel prefix, carry select and Ling architectures. The parallel p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Circuit design based on majority gates for applications with quantum-dot cellular automata

    Publication Year: 2004, Page(s):1354 - 1357 Vol.2
    Cited by:  Papers (21)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    Majority gate-based logic is not normally explored with standard CMOS technologies, primarily because of the hardware inefficiencies in creating majority gates. As a result, not much effort has been made towards the optimization of circuits based on majority gates. We are exploring one particular emerging technology, quantum-dot cellular automata (QCA), in which the majority gate is the fundamenta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logical effort of higher valency adders

    Publication Year: 2004, Page(s):1358 - 1362 Vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    Higher valency parallel prefix adders reduce the number of logic levels at the expense of greater fan-in at each level. This paper uses the method of logical effort to evaluate the tradeoffs of higher valency for static and dynamic implementations of various adder architectures. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hybrid Ling carry-select adder

    Publication Year: 2004, Page(s):1363 - 1367 Vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (583 KB) | HTML iconHTML

    Hybrid adders, combining a sparse carry-lookahead tree and a carry-select output stage are a well-known implementation form of high-speed adders. In this paper, a hybrid Ling carry-select adder is presented. It is shown how a carry-select output stage can be used to eliminate the entire conversion of all pseudo-carries. The adder is implemented in enhanced multiple output domino logic (EMODL). A t... View full abstract»

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