Result: A Fast Recursive Algorithm for G-STBC
Title:
A Fast Recursive Algorithm for G-STBC
Authors:
Source:
IEEE transactions on communications. 59(8):2084-2089
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2011.
Publication Year:
2011
Physical Description:
print, 24 ref
Original Material:
INIST-CNRS
Subject Terms:
Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Signal, bruit, Signal, noise, Détection, estimation, filtrage, égalisation, prédiction, Detection, estimation, filtering, equalization, prediction, Codage, codes, Coding, codes, Réduction bruit, Noise reduction, Reducción ruido, Algorithme rapide, Fast algorithm, Algoritmo rápido, Algorithme récursif, Recursive algorithm, Algoritmo recursivo, Code bloc, Block code, Código bloque, Code espace temps, Space-time codes, Complexité calcul, Computational complexity, Complejidad computación, Détection signal, Signal detection, Detección señal, Performance algorithme, Algorithm performance, Resultado algoritmo, Suppression interférence, Interference suppression, Système MIMO, MIMO system, Sistema MIMO, Traitement signal, Signal processing, Procesamiento señal, Alamouti structure, DSTTD, Fast recursive algorithms, G-STBC, MIMO, V-BLAST
Document Type:
Academic journal
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai 200240, China
Huawei Technologies Co., Ltd, Shenzhen 518129, China
Department of Automation, Tsinghua University, China
School of Engineering and Science, Jacobs University Bremen, Germany
Huawei Technologies Co., Ltd, Shenzhen 518129, China
Department of Automation, Tsinghua University, China
School of Engineering and Science, Jacobs University Bremen, Germany
ISSN:
0090-6778
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.24444739
Database:
PASCAL Archive
Further Information
This paper proposes a fast recursive algorithm for Group-wise Space-Time Block Code (G-STBC), which takes full advantage of the Alamouti structure in the equivalent channel matrix to reduce the computational complexity. With respect to the existing efficient algorithms for G-STBC, the proposed algorithm achieves better performance and usually requires less computational complexity.