By Topic

IEEE Transactions on Information Theory

Issue 3 • March 2002

Filter Results

Displaying Results 1 - 23 of 23
  • Contributors

    Publication Year: 2002, Page(s):800 - 805
    Request permission for commercial reuse | PDF file iconPDF (51 KB)
    Freely Available from IEEE
  • Strong converse for identification via quantum channels

    Publication Year: 2002, Page(s):569 - 579
    Cited by:  Papers (99)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (291 KB) | HTML iconHTML

    We present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's (1979, 1992) approach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking values in self-adjoint ope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effects of phase estimation errors on RAKE receiver performance

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

    As larger diversity and coding gains are introduced into spread-spectrum systems to mitigate the effects of multipath fading and thermal noise, system performance is increasingly being limited by channel estimation error. To properly design these systems, performance measures incorporating the effects of estimation errors are needed. A lower bound on the probability of bit error for a RAKE receive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reproducing kernel structure and sampling on time-warped spaces with application to warped wavelets

    Publication Year: 2002, Page(s):789 - 790
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (66 KB) | HTML iconHTML

    Time-warped signal spaces have received attention in the literature. Among the topics of particular interest are sampling of time-warped signals and signal analysis using warped analysis functions, including wavelets. This correspondence introduces a reproducing kernel (RK) structure for time-warped signal spaces that unifies multiple perspectives on sampling in such spaces View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Geometric properties of a large set of random signals

    Publication Year: 2002, Page(s):748 - 752
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (189 KB) | HTML iconHTML

    For a bandwidth-limited, power-limited communication channel corrupted by additive white Gaussian noise, Shannon (1949) showed that, at any information rate below the channel capacity, an arbitrarily low error probability can be obtained when the transmitted signal is selected from a set a of M independent, white-Gaussian-noise-like waveforms having the prescribed power and bandwidth. He utilized ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint source-channel coding of a Gaussian mixture source over the Gaussian broadcast channel

    Publication Year: 2002, Page(s):776 - 781
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (203 KB) | HTML iconHTML

    Suppose that we want to send a description of a single source to two listeners through a Gaussian broadcast channel, where the channel is used once per source sample. The problem of joint source-channel coding is to design a communication system to minimize the distortion D1 at receiver 1 and at the same time minimize the distortion D2 at receiver 2. If the source is Gaussia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple description vector quantization with a coarse lattice

    Publication Year: 2002, Page(s):781 - 788
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (291 KB) | HTML iconHTML

    A multiple description (MD) lattice vector quantization technique for two descriptions was previously introduced in which fine and coarse codebooks are both lattices. The encoding begins with quantization to the nearest point in the fine lattice. This encoding is an inherent optimization for the decoder that receives both descriptions; performance can be improved with little increase in complexity... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and performance of VQ-based hybrid digital-analog joint source-channel codes

    Publication Year: 2002, Page(s):708 - 720
    Cited by:  Papers (30)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    A joint source-channel hybrid digital-analog (HDA) vector quantization (VQ) system is presented. The main advantage of the new VQ-based HDA system is that it achieves excellent rate-distortion-capacity performance at the design signal-to-noise ratio (SNR) while maintaining a "graceful improvement" characteristic at higher SNRs. It is demonstrated that, within the HDA framework, the parameters of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combining beamforming and orthogonal space-time block coding

    Publication Year: 2002, Page(s):611 - 627
    Cited by:  Papers (385)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB) | HTML iconHTML

    Multiple transmit and receive antennas can be used in wireless systems to achieve high data rate communication. Efficient space-time codes have been developed that utilize a large portion of the available capacity. These codes are designed under the assumption that the transmitter has no knowledge about the channel. In this work, on the other hand, we consider the case when the transmitter has par... View full abstract»

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

    Publication Year: 2002, Page(s):734 - 747
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (461 KB) | HTML iconHTML

    This paper studies the issue of optimal deconvolution density estimation using wavelets. The approach taken here can be considered as orthogonal series estimation in the more general context of the density estimation. We explore the asymptotic properties of estimators based on thresholding of estimated wavelet coefficients. Minimax rates of convergence under the integrated square loss are studied ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On limited-delay lossy coding and filtering of individual sequences

    Publication Year: 2002, Page(s):721 - 733
    Cited by:  Papers (39)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB) | HTML iconHTML

    We continue the study of adaptive schemes for the sequential lossy coding of individual sequences which was initiated by Linder and Lugosi (see ibid., p.2533-38, 2001). Specifically, we consider fixed-rate lossy coding systems of fixed (or zero) delay where the encoder (which is allowed to use randomization) and the decoder are connected via a noiseless channel of a given capacity. It is shown tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectrally efficient noncoherent communication

    Publication Year: 2002, Page(s):651 - 668
    Cited by:  Papers (82)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (366 KB) | HTML iconHTML

    This paper considers noncoherent communication over a frequency-nonselective channel in which the time-varying channel gain is unknown a priori, but is approximately constant over a coherence interval. Unless the coherence interval is large, coherent communication, which requires explicit channel estimation and tracking prior to detection, incurs training overhead which may be excessive, especiall... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized minimum-mean-output-energy strategy for CDMA systems with improper MAI

    Publication Year: 2002, Page(s):761 - 767
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (206 KB) | HTML iconHTML

    It has been shown that in a direct-sequence/code-division multiple-access (DS/CDMA) system employing binary phase-shift keying (BPSK) modulation the baseband equivalent of the CDMA multiplex is, under very mild assumptions, an improper complex random process, i.e., it has a nonzero pseudoautocorrelation function. The problem of linear multiuser detection for asynchronous DS/CDMA systems with impro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagonal algebraic space-time block codes

    Publication Year: 2002, Page(s):628 - 636
    Cited by:  Papers (195)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (266 KB) | HTML iconHTML

    We construct a new family of linear space-time (ST) block codes by the combination of rotated constellations and the Hadamard transform, and we prove them to achieve the full transmit diversity over a quasi-static or fast fading channels. The proposed codes transmit at a normalized rate of 1 symbol/s. When the number of transmit antennas n=1, 2, or n is a multiple of four, we spread a rotated vers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequences of optimal identifying codes

    Publication Year: 2002, Page(s):774 - 776
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (121 KB) | HTML iconHTML

    Locating faulty processors in a multiprocessor system gives the motivation for identifying codes. Denote by l the maximum number of simultaneously malfunctioning processors. We show that if l⩾3, then the problem of finding the smallest cardinality of a (1, ⩽l)-identifying code in a binary hypercube is equivalent to the problem of finding the smallest size of a (2l-1)-fold 1-covering. This ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hamming metric decoding of alternant codes over Galois rings

    Publication Year: 2002, Page(s):683 - 694
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB) | HTML iconHTML

    The standard decoding procedure for alternant codes over fields centers on solving a key equation which relates an error locator polynomial and an error evaluator polynomial by a syndrome sequence. We extend this technique to decode alternant codes over Galois rings. We consider the module M={(a, b): as≡b mod xr} of all solutions to the key equation where s is the syndrome polynom... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A construction of a space-time code based on number theory

    Publication Year: 2002, Page(s):753 - 760
    Cited by:  Papers (178)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (330 KB) | HTML iconHTML

    We construct a full data rate space-time (ST) block code over M=2 transmit antennas and T=2 symbol periods, and we prove that it achieves a transmit diversity of 2 over all constellations carved from Z[i]4 . Further, we optimize the coding gain of the proposed code and then compare it to the Alamouti code. It is shown that the new code outperforms the Alamouti (see IEEE J Select. Areas ... View full abstract»

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

    Publication Year: 2002, Page(s):580 - 598
    Cited by:  Papers (123)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (461 KB) | HTML iconHTML

    We expand on our work on quantum data hiding - hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell (1964) states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity scaling in MIMO wireless systems under correlated fading

    Publication Year: 2002, Page(s):637 - 650
    Cited by:  Papers (552)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    Previous studies have shown that single-user systems employing n-element antenna arrays at both the transmitter and the receiver can achieve a capacity proportional to n, assuming independent Rayleigh fading between antenna pairs. We explore the capacity of dual-antenna-array systems under correlated fading via theoretical analysis and ray-tracing simulations. We derive and compare expressions for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Lagrangian formulation of Zador's entropy-constrained quantization theorem

    Publication Year: 2002, Page(s):695 - 707
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (393 KB) | HTML iconHTML

    Zador's (1963, 1966) classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorithm used to optimize such quantizers. The equivalence of the two formulations is shown and the result is proved for source distributions that are absolutely continuous with respect to the Lebesgue measure which sati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal tight frames and quantum measurement

    Publication Year: 2002, Page(s):599 - 610
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    Tight frames and rank-one quantum measurements are shown to be intimately related. In fact, the family of normalized tight frames for the space in which a quantum-mechanical system lies is precisely the family of rank-one generalized quantum measurements on that space. Using this relationship, frame-theoretical analogs of various quantum-mechanical concepts and results are developed. The analog of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strongly consistent online forecasting of centered Gaussian processes

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

    An estimator Eˆ(dn,n) of the conditional expectation E[Xn+1|Xn,...,X(n-dn+1)] in a centered, stationary, and ergodic Gaussian process {Xi}i with absolutely summable Wold coefficients is constructed on the basis of having observed X1,...,Xn . For a suitable choice of the length dn→∞ (n→&infi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some results on type IV codes over Z4

    Publication Year: 2002, Page(s):768 - 773
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    Dougherty, Gaborit, Harada, Munemasa and Sole (see ibid., vol.45, p.2345-60, 1999) have previously given an upper bound on the minimum Lee weight of a type IV self-dual Z4-code, using a similar bound for the minimum distance of binary doubly even self-dual codes. We improve their bound, finding that the minimum Lee weight of a type IV self-dual Z4-code of length n is at most ... 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
Prakash Narayan 

Department of Electrical and Computer Engineering