2019
DOI: 10.1049/iet-com.2019.0321
|View full text |Cite
|
Sign up to set email alerts
|

Sparse detection with orthogonal matching pursuit in multiuser uplink quadrature spatial modulation MIMO system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
7
1
1

Relationship

2
7

Authors

Journals

citations
Cited by 15 publications
(10 citation statements)
references
References 40 publications
0
10
0
Order By: Relevance
“…The BER results of proposed coded and noncoded cooperation based on SPA-based joint iterative decoding over a Rayleigh fading channel are given in Figure 10. The relevant parameters for the component QC-LDPC code C (4) qc adopted for proposed coded cooperation are given in Table 2, where the overall code rate is 7=8. Simulation results show that the proposed coded cooperations outperform the non-coded cooperation by providing a prominent coding gain.…”
Section: Performance Of Proposed Jointly Designed Qc-ldpccoded One-rementioning
confidence: 99%
See 1 more Smart Citation
“…The BER results of proposed coded and noncoded cooperation based on SPA-based joint iterative decoding over a Rayleigh fading channel are given in Figure 10. The relevant parameters for the component QC-LDPC code C (4) qc adopted for proposed coded cooperation are given in Table 2, where the overall code rate is 7=8. Simulation results show that the proposed coded cooperations outperform the non-coded cooperation by providing a prominent coding gain.…”
Section: Performance Of Proposed Jointly Designed Qc-ldpccoded One-rementioning
confidence: 99%
“…To solve this critical problem, cooperative communication, also known as virtual MIMO, is determined where the devices with single antenna terminals can share their antennas to acquire multiplexing gain and diversity. [3][4][5] Therefore, virtual MIMO has been adopted by many wireless communication systems (e.g. wireless sensor networks, ad hoc networks).…”
Section: Introductionmentioning
confidence: 99%
“…This can be treated as a convex optimization problem [7], but its solution is considered computationally expensive. To reduce the computational cost, a family of greedy methods which exploits the sparsity structure of the transmitting antenna vector has been used [8], [9], [10]. The use of these methods varies according to the architecture.…”
Section: Introductionmentioning
confidence: 99%
“…If all the supporting elements are found accurately, then the columns of the observation matrix corresponding to the supporting elements can be taken out to transform the original underdetermined system into overdetermined system, and the original signal can be recovered directly by using MMSE or least square conventional estimation scheme estimator. In [14,15], the algorithm of orthogonal matching pursuit (OMP) is introduced.…”
Section: Introductionmentioning
confidence: 99%