2017
DOI: 10.1109/tcsi.2017.2706722
|View full text |Cite
|
Sign up to set email alerts
|

Bounded Selective Spanning With Extended Fast Enumeration for MIMO-OFDM Systems Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(8 citation statements)
references
References 19 publications
0
8
0
Order By: Relevance
“…21a; T 1 − T 4 are enumeration and APED calculations, while T 5 identifies the solution with minimum APED. The work in [41] demonstrates that highperformance, efficient accelerators for SD can be enabled by using networks of fine-grained SIMD processors; this was extended in [40] to demonstrate how such accelerators can be automatically synthesised from a task graph such as that in Fig. 21a.…”
Section: Accelerator Architecturementioning
confidence: 99%
See 2 more Smart Citations
“…21a; T 1 − T 4 are enumeration and APED calculations, while T 5 identifies the solution with minimum APED. The work in [41] demonstrates that highperformance, efficient accelerators for SD can be enabled by using networks of fine-grained SIMD processors; this was extended in [40] to demonstrate how such accelerators can be automatically synthesised from a task graph such as that in Fig. 21a.…”
Section: Accelerator Architecturementioning
confidence: 99%
“…Bounded Selective Spanning with Extended Fast Enumeration (BSS-EFE) is the state-of-the-art BFS SD, allowing configuration for different IoT MIMO scales, detection accuracy and accelerator cost whilst avoiding the use of symbol list memory and sorting operators [19]. However, BSS-EFE suffers drawbacks which limit its efficiency:…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The simulated result shows a maximum throughput of 2.2 Gbps, which so far is the fastest hardware of FSD implementation in our record. K-best is another popular SD accelerator architecture and has been actively studied recently [13][14][15][16][17][18][19][20][21][22]. The K-Best SD is based on breadth-first search, which considers only the best (K) candidates at each level to be passed to the next level of the search tree.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, ML could be considered a special case of K-best with a sufficiently large K [13]. The conventional K-best sphere detectors use the same K value at all levels [13][14][15][16][17][18], while recent developments offer more flexible and efficient designs [19][20][21][22]. Among those, several practical K-Best SD has been prototyped on hardware [16,17,[19][20][21][22]28] that show advantages over FSD in both complexity and throughput.…”
Section: Introductionmentioning
confidence: 99%