scispace - formally typeset
Search or ask a question
JournalISSN: 0090-6778

IEEE Transactions on Communications 

IEEE Communications Society
About: IEEE Transactions on Communications is an academic journal published by IEEE Communications Society. The journal publishes majorly in the area(s): Fading & Decoding methods. It has an ISSN identifier of 0090-6778. Over the lifetime, 16972 publications have been published receiving 806635 citations. The journal is also known as: Communications, IEEE transactions on & Transactions on communications.


Papers
More filters
Journal ArticleDOI
TL;DR: An efficient and intuitive algorithm is presented for the design of vector quantizers based either on a known probabilistic model or on a long training sequence of data.
Abstract: An efficient and intuitive algorithm is presented for the design of vector quantizers based either on a known probabilistic model or on a long training sequence of data. The basic properties of the algorithm are discussed and demonstrated by examples. Quite general distortion measures and long blocklengths are allowed, as exemplified by the design of parameter vector quantizers of ten-dimensional vectors arising in Linear Predictive Coded (LPC) speech compression with a complicated distortion measure arising in LPC analysis that does not depend only on the error vector.

7,935 citations

Journal ArticleDOI
TL;DR: A technique for image encoding in which local operators of many scales but identical shape serve as the basis functions, which tends to enhance salient image features and is well suited for many image analysis tasks as well as for image compression.
Abstract: We describe a technique for image encoding in which local operators of many scales but identical shape serve as the basis functions. The representation differs from established techniques in that the code elements are localized in spatial frequency as well as in space. Pixel-to-pixel correlations are first removed by subtracting a lowpass filtered copy of the image from the image itself. The result is a net data compression since the difference, or error, image has low variance and entropy, and the low-pass filtered image may represented at reduced sample density. Further data compression is achieved by quantizing the difference image. These steps are then repeated to compress the low-pass image. Iteration of the process at appropriately expanded scales generates a pyramid data structure. The encoding process is equivalent to sampling the image with Laplacian operators of many scales. Thus, the code tends to enhance salient image features. A further advantage of the present code is that it is well suited for many image analysis tasks as well as for image compression. Fast algorithms are described for coding and decoding.

6,975 citations

Journal ArticleDOI
TL;DR: Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.
Abstract: Mobile users' data rate and quality of service are limited by the fact that, within the duration of any given call, they experience severe variations in signal attenuation, thereby necessitating the use of some type of diversity. In this two-part paper, we propose a new form of spatial diversity, in which diversity gains are achieved via the cooperation of mobile users. Part I describes the user cooperation strategy, while Part II (see ibid., p.1939-48) focuses on implementation issues and performance analysis. Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.

6,621 citations

Journal ArticleDOI
TL;DR: A rapid synchronization method is presented for an orthogonal frequency-division multiplexing (OFDM) system using either a continuous transmission or a burst operation over a frequency-selective channel.
Abstract: A rapid synchronization method is presented for an orthogonal frequency-division multiplexing (OFDM) system using either a continuous transmission or a burst operation over a frequency-selective channel. The presence of a signal can be detected upon the receipt of just one training sequence of two symbols. The start of the frame and the beginning of the symbol can be found, and carrier frequency offsets of many subchannels spacings can be corrected. The algorithms operate near the Cramer-Rao lower bound for the variance of the frequency offset estimate, and the inherent averaging over many subcarriers allows acquisition at very low signal-to-noise ratios (SNRs).

3,492 citations

Journal ArticleDOI
TL;DR: The proposed model is pessimistic (a lower bound on coverage) whereas the grid model is optimistic, and that both are about equally accurate, and the proposed model may better capture the increasingly opportunistic and dense placement of base stations in future networks.
Abstract: Cellular networks are usually modeled by placing the base stations on a grid, with mobile users either randomly scattered or placed deterministically. These models have been used extensively but suffer from being both highly idealized and not very tractable, so complex system-level simulations are used to evaluate coverage/outage probability and rate. More tractable models have long been desirable. We develop new general models for the multi-cell signal-to-interference-plus-noise ratio (SINR) using stochastic geometry. Under very general assumptions, the resulting expressions for the downlink SINR CCDF (equivalent to the coverage probability) involve quickly computable integrals, and in some practical special cases can be simplified to common integrals (e.g., the Q-function) or even to simple closed-form expressions. We also derive the mean rate, and then the coverage gain (and mean rate loss) from static frequency reuse. We compare our coverage predictions to the grid model and an actual base station deployment, and observe that the proposed model is pessimistic (a lower bound on coverage) whereas the grid model is optimistic, and that both are about equally accurate. In addition to being more tractable, the proposed model may better capture the increasingly opportunistic and dense placement of base stations in future networks.

3,309 citations

Performance
Metrics
No. of papers from the Journal in previous years
YearPapers
2023642
2022891
2021577
2020557
2019626
2018478