Lecture

Soft-Output MIMO Detection

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

EE-543: Advanced wireless receivers

Students extend their knowledge on wireless communication systems to spread-spectrum communication and to multi-antenna systems. They also learn about the basic information theoretic concepts, about channel coding, and bit-interleaved coded modulation. ...

Description

This lecture covers the performance of soft-output linear detection in wireless communication systems, focusing on gains like coding gain and diversity gain. It explains how soft-output linear detectors can compete with hard-output detectors, especially for less stringent bit error rate requirements. The instructor also discusses the complexity of MIMO detection algorithms, including optimum MIMO detection and sphere decoding. The lecture delves into tree traversal strategies, tree pruning, and the computation of distance increments during tree traversal. It concludes with the complexity of sphere decoding and soft-output MIMO detection with tree search.

Official source

Ontological neighbourhood

Electrical engineering

Telecommunications: Wireless communication

Related concepts (32)

Error detection and correction

In information theory and coding theory with applications in computer science and telecommunication, error detection and correction (EDAC) or error control are techniques that enable reliable delivery of digital data over unreliable communication channels. Many communication channels are subject to channel noise, and thus errors may be introduced during transmission from the source to a receiver. Error detection techniques allow detecting such errors, while error correction enables reconstruction of the original data in many cases.

MIMO

In radio, multiple-input and multiple-output (MIMO) (ˈmaɪmoʊ,_ˈmiːmoʊ) is a method for multiplying the capacity of a radio link using multiple transmission and receiving antennas to exploit multipath propagation. MIMO has become an essential element of wireless communication standards including IEEE 802.11n (Wi-Fi 4), IEEE 802.11ac (Wi-Fi 5), HSPA+ (3G), WiMAX, and Long Term Evolution (LTE). More recently, MIMO has been applied to power-line communication for three-wire installations as part of the ITU G.

Diversity scheme

In telecommunications, a diversity scheme refers to a method for improving the reliability of a message signal by using two or more communication channels with different characteristics. Diversity is mainly used in radio communication and is a common technique for combatting fading and co-channel interference and avoiding error bursts. It is based on the fact that individual channels experience fades and interference at different, random times, i.e, they are at least partly independent.

Cooperative diversity

Cooperative diversity is a cooperative multiple antenna technique for improving or maximising total network channel capacities for any given set of bandwidths which exploits user diversity by decoding the combined signal of the relayed signal and the direct signal in wireless multihop networks. A conventional single hop system uses direct transmission where a receiver decodes the information only based on the direct signal while regarding the relayed signal as interference, whereas the cooperative diversity considers the other signal as contribution.

Binary tree

In computer science, a binary tree is a k-ary tree data structure in which each node has at most two children, which are referred to as the and the . A recursive definition using just set theory notions is that a (non-empty) binary tree is a tuple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set containing the root. Some authors allow the binary tree to be the empty set as well. From a graph theory perspective, binary (and K-ary) trees as defined here are arborescences.

Related lectures (64)

MIMO Capacity

Explores MIMO capacity, spatial multiplexing, matched filter, and power normalization in wireless communication systems.

Low Complexity MIMO ML Receivers

Explores MIMO spatial multiplexing, ML detection, receivers with fading, tree representation, and sphere decoding.

Channel Coding and BICM (LLRs)

Explores channel coding, BICM, and LLRs in wireless communication systems, emphasizing the importance of error detection and correction.

MIMO RAKE Receiver: Simulation and MIMO Extension

Covers the implementation of IS-95 forward-link and MIMO extension.

Diversity and Diversity Receivers