By Topic

IEEE Transactions on Information Theory

Issue 11 • Date Nov. 2004

Filter Results

Displaying Results 1 - 25 of 43
  • Table of contents

    Publication Year: 2004, Page(s):c1 - c4
    Request permission for commercial reuse | PDF file iconPDF (42 KB)
    Freely Available from IEEE
  • IEEE Transactions on Information Theory publication information

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • Upper bounds to transport capacity of wireless networks

    Publication Year: 2004, Page(s):2555 - 2565
    Cited by:  Papers (123)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    We derive upper bounds on the transport capacity of wireless networks. The bounds obtained are solely dependent on the geographic locations and power constraints of the nodes. As a result of this derivation, we are able to conclude the optimality, in the sense of scaling of transport capacity with the number of nodes, of a multihop communication strategy for a class of network topologies. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting wireless channel State information for throughput maximization

    Publication Year: 2004, Page(s):2566 - 2582
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB) | HTML iconHTML

    We consider the problem of scheduling packets over channels with time-varying quality. This problem has received a lot of attention lately in the context of devising methods for providing quality of service in wireless communications. Earlier work dealing with this problem considered two cases. One case is that the arrival rate vector is in the throughput region and then policies that stabilize th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Orthogonal time-frequency signaling over doubly dispersive channels

    Publication Year: 2004, Page(s):2583 - 2603
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    This paper develops a general framework for communication over doubly dispersive fading channels via an orthogonal short-time Fourier (STF) basis. The STF basis is generated from a prototype pulse via time-frequency shifts. In general, the orthogonality between basis functions is destroyed at the receiver due to channel dispersion. The starting point of this work is a pulse scale adaptation rule f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CDMA with power control and sequence design: the capacity region with and without multidimensional signaling

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

    We consider the symbol-synchronous code-division multiple-access (CDMA) channel in which every user is assigned a rate at which arbitrarily reliable transmission in the Shannon sense is to be guaranteed. For an overloaded system in which the number of active users exceeds the available processing gain, we optimally design the users' signature sequences and a power-control policy to minimize the re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic analysis of optimum and suboptimum CDMA downlink MMSE receivers

    Publication Year: 2004, Page(s):2620 - 2638
    Cited by:  Papers (24)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    In this paper, we investigate the performance of two linear receivers for code-division multiple-access (CDMA) downlink transmissions over frequency-selective channels, the users having possibly different powers. The optimum minimum mean-square error (MMSE) receiver is first considered. Because this receiver requires the knowledge of the code vectors attributed to all the users within the cell whe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of fully diverse multiple-antenna codes based on Sp(2)

    Publication Year: 2004, Page(s):2639 - 2656
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB) | HTML iconHTML

    Fully diverse constellations, i.e., sets of unitary matrices whose pairwise differences are nonsingular, are useful in multiple-antenna communications, especially in multiple-antenna differential modulation, since they have good pairwise error properties. Recently, group theoretic ideas, especially fixed-point-free (fpf) groups, have been used to design fully diverse constellations of unitary matr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extrinsic information transfer functions: model and erasure channel properties

    Publication Year: 2004, Page(s):2657 - 2673
    Cited by:  Papers (375)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    Extrinsic information transfer (EXIT) charts are a tool for predicting the convergence behavior of iterative processors for a variety of communication problems. A model is introduced that applies to decoding problems, including the iterative decoding of parallel concatenated (turbo) codes, serially concatenated codes, low-density parity-check (LDPC) codes, and repeat-accumulate (RA) codes. EXIT fu... View full abstract»

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

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

    In this paper, we present a new class of importance sampling simulation distributions, the universal distributions. We show that these distributions are universally efficient in the sense that they depend only on a single scalar parameter regardless of the dimensionality of the underlying system or of the error sets to be simulated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Precise minimax redundancy and regret

    Publication Year: 2004, Page(s):2686 - 2707
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB) | HTML iconHTML

    Recent years have seen a resurgence of interest in redundancy of lossless coding. The redundancy (regret) of universal fixed-to-variable length coding for a class of sources determines by how much the actual code length exceeds the optimal (ideal over the class) code length. In a minimax scenario one finds the best code for the worst source either in the worst case (called also maximal minimax) or... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact minimax strategies for predictive density estimation, data compression, and model selection

    Publication Year: 2004, Page(s):2708 - 2726
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB) | HTML iconHTML

    For location and scale families of distributions and related settings of linear regression, we determine minimax procedures for predictive density estimation, for universal data compression, and for the minimum description length (MDL) criterion for model selection. The analysis gives the best invariant and indeed minimax procedure for predictive density estimation by directly verifying extended B... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Redundancy of universal coding, Kolmogorov complexity, and Hausdorff dimension

    Publication Year: 2004, Page(s):2727 - 2736
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    We study asymptotic code lengths of universal codes for parametric models. We show a universal code whose code length is asymptotically less than or equal to that of the minimum description length (MDL) code. Especially when some of the parameters of a source are not random reals, the coefficient of the logarithm in the formula of our universal code is less than that of the MDL code. We describe t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Index assignment for two-channel quantization

    Publication Year: 2004, Page(s):2737 - 2751
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    This paper concerns the design of a multiple description scalar quantization (MDSQ) system for two identical channels for an unbounded discrete information source. This translates to the combinatorial problem of finding an arrangement of the integers into the infinite plane square grid so that each row and each column contains exactly N numbers, such that the difference between any two numbers in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Almost security of cryptographic Boolean functions

    Publication Year: 2004, Page(s):2752 - 2761
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    The propagation criterion, PC(ℓ) of order k, is one of the most general cryptographic criteria of secure Boolean functions f. In this paper, we formalize its ε-almost version. The new definition requires that f(X)+f(X+Δ) is almost uniformly distributed while in the original definition, it must be strictly uniformly distributed. Better parameters are then obtained than the strict P... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Wyner-Ziv problem with multiple sources

    Publication Year: 2004, Page(s):2762 - 2768
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    This paper provides bounds on the rate-distortion region for the distributed compression scenario where two (or more) sources are compressed separately for a decoder that has access to side information. Conclusive rate-distortion results are found for the case where the sources are conditionally independent, given the side information. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On properties of rate-reliability-distortion functions

    Publication Year: 2004, Page(s):2768 - 2773
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    Some important properties of the rate-reliability-distortion function of discrete memoryless source (DMS) are established. For the binary source and Hamming distortion measure this function is derived and analyzed. Even that elementary case suffices to show the nonconvexity of the rate-reliability-distortion function in the reliability (error exponent) argument. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the discreteness of capacity-achieving distributions

    Publication Year: 2004, Page(s):2773 - 2778
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    We consider a scalar additive channel x → x + N whose input is amplitude constrained. By extending Smith's (1969) argument, we derive a sufficient condition on noise probability density functions (pdf) that guarantee finite support for the associated capacity-achieving distribution(s). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of total capacity for discrete memoryless multiple-access channels

    Publication Year: 2004, Page(s):2779 - 2784
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    The Arimoto-Blahut (1972) algorithm is generalized for computation of the total capacity of discrete memoryless multiple-access channels (MAC). In addition, a class of MAC is defined with the property that the uniform distribution achieves the total capacity. These results are based on the specialization of the Kuhn-Tucker condition for the total capacity of the MAC, and an extension of a known sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User capacity for synchronous multirate CDMA systems with linear MMSE receivers

    Publication Year: 2004, Page(s):2785 - 2793
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    The performance of linear minimum mean-square error (MMSE) multiuser receivers in a dual-rate synchronous direct-sequence code-division multiple-access (DS-CDMA) system is investigated using the random spreading sequence analysis. Multicode (MC) systems and different variants of variable spreading length (VSL) systems are studied. User capacity regions are obtained for these systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Renyi entropy, guesswork moments, and large deviations

    Publication Year: 2004, Page(s):2794 - 2800
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB) | HTML iconHTML

    For a large class of stationary probability measures on AN, where A is a finite alphabet, we compute the specific Renyi entropy of order α and the specific guesswork moments of order β > -1. We show that the specific guesswork moment of order β equals the specific Renyi entropy of order α = 1 / (1 + β) multiplied by β. The method is based on energy-entrop... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sphere-packing bounds for convolutional codes

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

    We introduce general sphere-packing bounds for convolutional codes. These improve upon the Heller (1968) bound for high-rate convolutional codes. For example, based on the Heller bound, McEliece (1998) suggested that for a rate (n - 1)/n convolutional code of free distance 5 with ν memory elements in its minimal encoder it holds that n ≤ 2(ν+1)2/. A simple corollary of our boun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN interference

    Publication Year: 2004, Page(s):2810 - 2815
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    The error probability of maximum-likelihood (ML) soft-decision decoded binary block codes rarely accepts nice closed forms. In addition, for long codes, ML decoding becomes prohibitively complex. Nevertheless, bounds on the performance of ML decoded systems provide insight into the effect of system parameters on the overall system performance as well as a measure of goodness of the suboptimum deco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved upper bound for the redundancy of fix-free codes

    Publication Year: 2004, Page(s):2815 - 2818
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code, any finite sequence of codewords can be decoded in both directions, which can improve the robustness to channel noise and speed up the decoding process. In this paper, we prove a new sufficient condition of the existence of fix-free codes and improve the upper bound on the re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The simplex codes and other even-weight binary linear codes for error correction

    Publication Year: 2004, Page(s):2818 - 2823
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    The probability of correct decoding on the binary-symmetric channel is studied. In particular, a class of codes with the same lengths and dimensions as the linear simplex codes, but with larger probability of correct decoding for all parameters p, 0 < p < 1/2, is given. View full abstract»

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

Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Frank R. Kschischang

Department of Electrical and Computer Engineering