Sciweavers

5793 search results - page 197 / 1159
» Individual communication complexity
Sort
View
GLOBECOM
2008
IEEE
16 years 1 months ago
Low-Complexity SQR-Based Decoding Algorithm for Quasi-Orthogonal Space-Time Block Codes
— In this paper, we propose a new decoding algorithm for quasi-orthogonal space-time block codes (QOSTBCs) which achieves near Maximum Likelihood (ML) performance while substanti...
Luay Azzam, Ender Ayanoglu
VTC
2007
IEEE
139views Communications» more  VTC 2007»
16 years 25 days ago
A Low Complexity Frequency Domain Iterative Decision-Directed Channel Estimation Technique for Single-Carrier Systems
— A low complexity frequency domain iterative decision-directed channel estimation (FD-IDDCE) technique for single-carrier (SC) systems with frequency domain multiplexed (FDM) pi...
Chan-Tong Lam, David D. Falconer, Florence Danilo-...
GLOBECOM
2006
IEEE
16 years 19 days ago
On Decoding, Mutual Information, and Antenna Selection Diversity for Quasi-Orthogonal STBC with Minimum Decoding Complexity
Abstract— ABBA codes are an important class of quasiorthogonal space-time block codes proposed by Tirkkonen et al.. Recently, they have become more attractive for practical appli...
Dung Ngoc Dao, Chintha Tellambura
GLOBECOM
2006
IEEE
16 years 19 days ago
Performance Analysis and Optimal Signal Designs for Minimum Decoding Complexity ABBA Codes
— ABBA codes, a class of quasi-orthogonal space-time block codes (STBC) proposed by Tirkkonen et al., have been studied extensively for various applications. Yuen et al. have rec...
Dung Ngoc Dao, Chintha Tellambura
TAPSOFT
1997
Springer
15 years 10 months ago
Specifying Complex and Structured Systems with Evolving Algebras
This paper presents an approach for specifying complex, structured systems with Evolving Algebras by means of aggregation and composition. Evolving algebras provide a formal method...
Wolfgang May