Sciweavers

1552 search results - page 180 / 311
» On the Complexity of Constant Propagation
Sort
View
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
15 years 1 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel
TSP
2010
15 years 1 months ago
A recursive method for the approximation of LTI systems using subband processing
Using the subband technique, an LTI system can be implemented by the composition of an analysis filterbank, followed by a transfer matrix (subband model) and a synthesis filterbank...
Damián Marelli, Minyue Fu
TSP
2010
15 years 1 months ago
Cyclic prefix based enhanced data recovery in OFDM
In this correspondence, we show how the cyclic prefix can be used to enhance the performance of an OFDM receiver. Specifically, we show how an OFDM symbol can be blindly detected ...
Tareq Y. Al-Naffouri, Ahmed Abdul Quadeer
ICASSP
2011
IEEE
14 years 10 months ago
Simplified EM channel estimation in LTE systems
In this paper, an iterative channel estimation algorithm is considered in LTE systems. A simplified expectation maximization (EM) based algorithm is proposed for channel estimati...
Yang Liu, Serdar Sezginer
ICASSP
2011
IEEE
14 years 10 months ago
Hardware architectures for successive cancellation decoding of polar codes
The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancella...
Camille Leroux, Ido Tal, Alexander Vardy, Warren J...