Topic
Communication complexity
About: Communication complexity is a research topic. Over the lifetime, 3870 publications have been published within this topic receiving 105832 citations.
Papers published on a yearly basis
Papers
More filters
23 May 2010
TL;DR: This paper proposes a simple online selection algorithm that efficiently minimizes the mean completion delay of a frame of broadcast packets, compared to the random and greedy selection algorithms with a similar computational complexity.
Abstract: In this paper, we consider the problem of minimizing the mean completion delay in wireless broadcast for instantly decodable network coding. We first formulate the problem as a stochastic shortest path (SSP) problem. Although finding the packet selection policy using SSP is intractable, we use this formulation to draw the theoretical properties of efficient selection algorithms. Based on these properties, we propose a simple online selection algorithm that efficiently minimizes the mean completion delay of a frame of broadcast packets, compared to the random and greedy selection algorithms with a similar computational complexity. Simulation results show that our proposed algorithm indeed outperforms these random and greedy selection algorithms.
154 citations
TL;DR: Computer simulations demonstrate that the proposed algorithm, Multiple Output Selection-LAS, which has the same complexity order as that of conventional LAS algorithms, is superior in bit error rate (BER) performance to LAS conventional algorithms.
Abstract: We present a low-complexity algorithm for detection in large MIMO systems based on the likelihood ascent search (LAS) algorithm. The key idea in our work is to generate multiple possible solutions or outputs from which we select the best one. We propose two possible approaches to achieve this goal and both are investigated. Computer simulations demonstrate that the proposed algorithm, Multiple Output Selection-LAS, which has the same complexity order as that of conventional LAS algorithms, is superior in bit error rate (BER) performance to LAS conventional algorithms. For example, with 20 antennas at both the transmitter and receiver, the proposed MOS-LAS algorithm needs about 4 dB less SNR to achieve a target BER of 10-4 for 4-QAM.
154 citations
13 Jul 2004
TL;DR: These schemes are based on Paillier’s cryptosystem, which along with its variants have drawn extensive studies in recent cryptographic researches and have many important applications.
Abstract: We study the problem of single database private information retrieval, and present a solution with only logarithmic server-side communication complexity and a solution with only logarithmic user-side communication complexity Previously the best result could only achieve polylogarithmic communication on each side, and was based on certain less well-studied assumptions in number theory [6] On the contrary, our schemes are based on Paillier’s cryptosystem [16], which along with its variants have drawn extensive studies in recent cryptographic researches [3, 4, 8, 9], and have many important applications [7, 8]
153 citations
Journal Article•
153 citations
23 Jun 1996
TL;DR: A rapid synchronization method is presented for an OFDM system using either a continuous transmission or a burst operation over a time-varying, fading channel to acquire the signal and provide channel estimation upon the receipt of just one training sequence of two symbols.
Abstract: A rapid synchronization method is presented for an OFDM system using either a continuous transmission or a burst operation over a time-varying, fading channel. It will acquire the signal and provide channel estimation upon the receipt of just one training sequence of two symbols in the presence of unknown symbol and frame timing, large carrier and sampling frequency offsets, and very low SNRs, while maintaining low latency and low complexity. It can then track the signal with the same algorithms. Digital TV and wireless LAN are used as examples.
153 citations