Low Complexity MIMO ML Receivers

About
Privacy
Disclaimer

Graph Chatbot

In course

Cupidatat qui mollit commodo reprehenderit magna irure amet do et excepteur duis. Elit amet reprehenderit irure et eu amet nisi officia magna ut excepteur cupidatat. Tempor in excepteur amet nostrud labore in labore deserunt excepteur qui. Adipisicing consequat quis aliqua dolor incididunt nulla cillum. Voluptate adipisicing voluptate culpa nostrud excepteur incididunt pariatur. Occaecat incididunt eiusmod labore tempor quis mollit incididunt. Est anim laboris laborum enim sint voluptate nostrud eu laboris esse non ipsum.

Description

This lecture covers the concept of MIMO spatial multiplexing, system models, optimum MIMO detection using Maximum Likelihood criterion, graphical interpretation, receivers with fading, triangularization, recursive distance computation, tree representation, tree traversal strategies, sphere decoding, and complexity analysis.

Official source

Related lectures (26)

https://mediaspace.epfl.ch/media/0_lifk2653

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In course

DEMO: sit pariatur nulla eiusmod

Related lectures (26)

Soft-Output MIMO Detection

Explores the performance of soft-output linear detection in wireless communication systems and the complexity of MIMO detection algorithms.

MIMO Detection

Covers MIMO receivers, linear detectors, interference cancellation, and performance analysis in advanced wireless communications.

MIMO Receivers

Covers the system model, linear receivers, performance evaluation, and graphical interpretations of MIMO receivers, including maximum likelihood detection and successive interference cancellation.

Computation & Algorithms II: Sorting and Recursive Algorithms

Explores sorting and recursive algorithms, including complexity analysis, maximal value, and binary search.

Algorithm Complexity Analyses

Covers the complexity analyses of algorithms and their worst-case time complexities.