Sciweavers

10608 search results - page 170 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 4 months ago
Low Complexity Adaptive Turbo Frequency-Domain Channel Estimation for Single-Carrier Multi-User Detection with Unknown Co-Channe
—Adaptive Turbo frequency-domain channel estimation is investigated for single-carrier (SC) multi-user detection in the presence of unknown co-channel interference (CCI). We prop...
Ye Wu, Xu Zhu, Asoke K. Nandi
ISCAS
2006
IEEE
147views Hardware» more  ISCAS 2006»
14 years 4 months ago
Triangular systolic array with reduced latency for QR-decomposition of complex matrices
- The novel CORDIC-based architecture of the these weights (combiner unit). The implementation of the Triangular Systolic Array for QRD of large size complex combiner unit is rathe...
Alexander Maltsev, V. Pestretsov, Roman Maslenniko...
IFIP
2004
Springer
14 years 3 months ago
On Complexity of Model-Checking for the TQL Logic
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
Iovka Boneva, Jean-Marc Talbot
TIME
2003
IEEE
14 years 3 months ago
Hybrid Logics on Linear Structures: Expressivity and Complexity
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
Massimo Franceschet, Maarten de Rijke, Bernd-Holge...
ICISC
2007
120views Cryptology» more  ICISC 2007»
13 years 12 months ago
Improving the Time Complexity of Matsui's Linear Cryptanalysis
This paper reports on an improvement of Matsui’s linear cryptanalysis that reduces the complexity of an attack with algorithm 2, by taking advantage of the Fast Fourier Transform...
Baudoin Collard, François-Xavier Standaert,...