Abstract
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 $\log _{2} {N_{\text {t}}}$ where ${N_{\text {t}}}$ is the transmit antenna number. Simulation results are provided to evaluate the bit error rate (BER) performance of the proposed algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
