Sciweavers

58 search results - page 7 / 12
» On Rank vs. Communication Complexity
Sort
View
GLOBECOM
2006
IEEE
14 years 2 months ago
Low-Complexity Adaptive High-Resolution Channel Prediction for OFDM Systems
Abstract— We propose a low-complexity adaptive highresolution channel prediction algorithm for pilot symbol assisted orthogonal frequency division multiplexing (OFDM) systems. Th...
Ian C. Wong, Brian L. Evans
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 8 months ago
On the Role of Shared Entanglement
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
Dmitry Gavinsky
ICASSP
2010
IEEE
13 years 8 months ago
Design of sparse filters for channel shortening
Abstract—Channel shortening filters have been used in acoustics to reduce reverberation, in error control decoding to reduce complexity, and in communication systems to reduce i...
Aditya Chopra, Brian L. Evans
ICC
2007
IEEE
136views Communications» more  ICC 2007»
14 years 2 months ago
Multiple-Symbol Differential Detection Based on Combinatorial Geometry
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
Volker Pauli, Lutz H.-J. Lampe, Robert Schober, Ko...
ICC
2007
IEEE
110views Communications» more  ICC 2007»
14 years 2 months ago
A New STC Structure to Achieve Generalized Optimal Diversity with a Reduced Design Complexity
Abstract - We propose a new space-time code (STC) structure that can achieve generalized optimal diversity (GOD) with a reduced design complexity, and also provide an increased cod...
Moon Il Lee, Seong Keun Oh, Dong Seung Kwon