2013 International Symposium on Intelligent Signal Processing and Communication Systems 2013
DOI: 10.1109/ispacs.2013.6704555
|View full text |Cite
|
Sign up to set email alerts
|

Complexity reduction for signal detection based on belief propagation in a massive MIMO system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 8 publications
0
4
0
Order By: Relevance
“…Techniques such as maximum‐likelihood detection and sphere decoder, whose complexities increase exponentially with the number of streams, are prohibitive at large‐scale antenna systems. Hence, signal detection/decoding turns out to be a challenging task in large‐array systems, due to the huge increase on the number of antennas and spatial multiplexing layers by orders of magnitude [47, 48]. In order to reduce computational complexity without losing reliability, some studies have proposed near‐optimal receivers by considering graph‐based solutions using belief propagation (BP) algorithms [47, 48].…”
Section: Signal Processing In Massive Mimomentioning
confidence: 99%
See 3 more Smart Citations
“…Techniques such as maximum‐likelihood detection and sphere decoder, whose complexities increase exponentially with the number of streams, are prohibitive at large‐scale antenna systems. Hence, signal detection/decoding turns out to be a challenging task in large‐array systems, due to the huge increase on the number of antennas and spatial multiplexing layers by orders of magnitude [47, 48]. In order to reduce computational complexity without losing reliability, some studies have proposed near‐optimal receivers by considering graph‐based solutions using belief propagation (BP) algorithms [47, 48].…”
Section: Signal Processing In Massive Mimomentioning
confidence: 99%
“…Furthermore, such a method is obtained from a graph model which gives the possibility of implementing it in a distributed fashion using message passing. In [48], the authors use other variants of BP, namely: layered BP (LBP) and BP with forced convergence (BP‐FC). In the original BP, the algorithm updates simultaneously the messages after processing all nodes, which is referred to as flooding scheduling.…”
Section: Signal Processing In Massive Mimomentioning
confidence: 99%
See 2 more Smart Citations