NDLI: Asymptotically optimum detection for large wireless networks with fading

Please wait, while we are loading the content...

2011 IEEE Information Theory Workshop

2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo)

2009 IEEE Information Theory Workshop on Networking and Information Theory

2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks

2006 IEEE Information Theory Workshop - ITW '06 Punta del Este

IEEE Information Theory Workshop, 2005.

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity

Welcome from the co-chairs

Committee members

Table of contents

Finite-length scaling of irregular LDPC code ensembles

BEAST decoding - asymptotic complexity

Symbol-by-symbol detection of space-time coded continuous phase modulated signals over fast Rayleigh fading channels

Rate-compatible path-pruned convolutional codes and their applications on channels with insertion, deletion and substitution errors

Duality between packings and coverings of the Hamming space

Interference management via capacity-achieving codes for the deterministic broadcast channel

Fisher information matrix and hyperbolic geometry

Periodic Oppermann sequences for spread spectrum systems

Steepest descent as message passing

Bounds on the performance of sphere decoding of linear block codes

Asymptotically optimum detection for large wireless networks with fading

The multivariate merit factor of a Boolean function

Bounds on signature coding for fast frequency hopping with asynchronous access

Maximum entropy and the Edgeworth expansion

New monomial bent functions over the finite fields of odd characteristic

A finite-field transform domain construction of binary low-density parity-check codes

Correlation analysis of random number sequences based on pseudo random binary sequence generation

Capacity of M-ary 2-D RLL constraints for optical recording channels

Iterative list decoding

A new method of the codeword reception of systematic codes

Viterbi algorithm motives in turbo decoding

On the capacity of erasure relay channel: multi-relay case

A note on a decoding algorithm of codes on graphs with small loops

Computing the Levenshtein distance of a regular language

A simple element inverse jacket transform coding

Generalized signature delegation algorithm

A new trellis source encoding method and its application on joint source and channel coding

Filtering: the case for "noisier" data

Soft-in soft-out Reed-Solomon decoding using critically subsampled filterbanks

Multiuser diversity in delay-limited cellular wideband systems

A unified framework for tree search decoding: rediscovering sequential decoding

Ergodic theorems for algorithmically random sequences

The mutual information constellation

Explicit expression of the interval algorithm for random number generation based on number systems

Mutual information of non-coherent Rayleigh fading channels with Gaussian input

Finite-length analysis of a capacity-achieving ensemble for the binary erasure channel

Theoretical analysis of a zero-redundancy estimator with a finite window for memoryless source

Decoding of second order Reed-Muller codes with a large number of errors

On decoding product lattices

Boneh-Shaw fingerprinting and soft decision decoding

Interleaved Reed-Solomon codes in concatenated code designs

Achieving MIMO channel capacity using multirate layered space-time coding architectures

Design of non-systematic turbo codes for universal source controlled channel decoding

Bounds on the entropy of patterns of I.I.D. sequences

On polyalphabetic block codes

Complex M-spotty byte error control codes

Analytic algorithmics, combinatorics, and information theory

Bayesian approach to a definition of random sequences with respect to parametric models

Further results on mapping functions

Capacity loss in CDMA systems due to the constraint of scalability

Universal estimation of information measures

Universal similarity

Stopping set analysis for Hamming codes

A construction of resilient functions with satisfying synthetical cryptographic criteria

Serially concatenated continuous phase modulation with low density generator matrix codes: property, optimization and performance analysis

On performance bounds for serially concatenated codes with the general inner code and interleaver

String parsing-based similarity detection

Universal lossless data embedding without explicit compression

Construction of LDPC codes for AWGN and binary erasure channels based on finite fields

Estimation and decoding strategies for channels with abruptly changing statistics

Information Theory Workshop

Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)

Proceedings of the IEEE Information Theory Workshop

Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494)

1998 Information Theory Workshop (Cat. No.98EX131)

Asymptotically optimum detection for large wireless networks with fading

Content Provider	IEEE Xplore Digital Library
Author	Gopalan, R.K. Collins, O.M.
Copyright Year	2005
Description	Author affiliation: Dept. of Electr. Eng., Notre Dame Univ., IN, USA (Gopalan, R.K.; Collins, O.M.)
Abstract	This paper proves that CDMA with beam forming single user detection (SUD-CDMA) is asymptotically optimum, even if it is done on a user by user basis (naive CDMA), for many large wireless networks in the presence of unknown fading. The paper models the transmitters and receivers as uniformly distributed over a grid in a 3-D, 2-D or 1-D universe and allows every transmitter to broadcast to all receivers with a power inversely proportional to the second, third or the fourth power of its distance from the receiver. The channel between the transmitters and the receivers is a fading channel where the receivers do not have any knowledge of the fading realizations. The introduction of unknown fading (even if very slow) and interference from all the transmitters make the model and hence the result of this paper fundamentally different from previous results. The paper proves that, when the number of users increases while keeping the network expanse constant SUD-CDMA is optimal irrespective of the geometry of the network or the path loss exponent. When the number of users increases while keeping the network density constant SUD-CDMA is optimal for most geometries when the path loss exponent is low.
File Size	371810
File Format	PDF
ISBN	0780394801
DOI	10.1109/ITW.2005.1531855
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-08-29
Publisher Place	New Zealand
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Wireless networks Fading Transmitters Multiaccess communication Geometry MIMO Land mobile radio cellular systems Electronic mail Broadcasting Interference
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in