logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Low-complexity sphere decoding algorithm for quasi-orthogonal space-time block codes

delete2006-03-01
delete25
PRE
AI
I
Il‐Min Kim
S
Shahram Yousefi
DOI：10.1109/TCOMM.2006.869881delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Space-time codes can be decoded by the sphere decoding (SD) algorithm to reduce the complexity and retain maximum-likelihood (ML) performance. In this letter, the ML metric of quasi-orthogonal space-time block codes is written into two independent Euclidean norms, thus SD can be applied to each function independently. The new scheme reduces the complexity by at least 85% for systems with four or more transmit antennas, compared with the conventional SD algorithm.
Keywords:
bounded distance decoding
codes
maximum-likelihood (ML) decoding
quasi-orthogonal space-time block codes (QOSTBCs)
sphere decoding (SD)
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Communications cover
IEEE Transactions on Communications
IF:
8.3
Papers:
1.2W
Citations:
3.6W

Organization

No organization information available