.png){kind=icon}
Return
A FFT-Like MIMO Detection Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3030932.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper studies the multiple-input-multiple-output (MIMO) detection problem. Existing works model the MIMO detection as a tree or factor graph. This work adds a new member called the clique graph model to the MIMO detection graph model family so that MIMO detection can be transformed into FInding the maximum clique in the constructed graph. Then, a clique based MIMO detection algorithm is developed, which uses an architecture similar to the Fast Fourier Transform (FFT) and can be executed in parallel naturally. The execution time of the algorithm can be proportional to log2 Nt where Nt is the transmit antenna number. Simulation results are provided to evaluate the bit error rate (BER) performance of the proposed algorithm.
Keywords:
MIMO communication
Detection algorithms
Complexity theory
Transmitting antennas
Bit error rate
Approximation algorithms
Image edge detection
Detection
graph model
MIMO
parallel processing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more