Reduced Complexity Space-Time Optimum Processing
نویسندگان
چکیده
New emerging space-time processing technologies promise a significant performance increase of wireless communication systems. The particular application and scenario strongly influences the amount of possible performance and capacity increase if antenna arrays are deployed at the basestation (BS) and/or at the mobile terminal (MT). The achievable gain is mainly determined by the spatial correlation properties of the underlying physical transmission channel. This paper analyzes the spatial correlation properties for various scenarios and investigates the processing requirements for designing space-time optimum receivers. One aim is to reduce the spatial signal dimension to the information bearing components applying orthogonal transformation techniques. It will be shown that even for virtually uncorrelated spatial channels which are characterized by high delay and angular spread, the spatial dimension can be reduced significantly. This enables less complex receiver structures and more robust channel estimation techniques.
منابع مشابه
Optimum Wordlength Search Using Sensitivity Information
Many digital signal processing algorithms are first developed in floating point and later converted into fixed point for digital hardware implementation. During this conversion, more than 50% of the design time may be spent for complex designs, and optimum wordlengths are searched by trading off hardware complexity for arithmetic precision at system outputs. We propose a fast algorithm for sear...
متن کاملIncreased diversity space-time coding using the diversity transform
The paper presents a method for constructing space-time block codes for multiple-input multiple-output channels by concatenating orthogonal designs with the so-called diversity transform. Relying on unitary transforms, the diversity transform increases the channel alphabet without sacrificing information rate, bandwidth, or Euclidean distance. The distribution of the resulting channel alphabet ...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملTwo-stage constellation partition algorithm for reduced-complexity multiple-input multiple-output-maximum-likelihood detection systems
This study presents the analysis of a constellation partition (CP) algorithm for multiple-input multiple-output– maximum-likelihood detection (MIMO–MLD) systems. The authors consider an Nt by Nr MIMO system, where MLD algorithm is employed at the receiver side for MIMO signal detection. The authors show that for the case of orthogonal space-time block codes and MIMO beamforming (MIMO-BF) system...
متن کامل