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

Practical Implementation of Index Modulation-Based Waveforms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 31 publications
(21 citation statements)
references
References 35 publications
0
21
0
Order By: Relevance
“…First of all, from Fig. 2, it is obvious that the analytical and asymptotic expressions for average outage probability given in (14), (15) and (16) have been substantiated. The analytical results well match the numerical results, and the asymptotic results get increasingly close to the numerical results when P t /N 0 becomes large.…”
Section: A Verification Of Analysismentioning
confidence: 76%
“…First of all, from Fig. 2, it is obvious that the analytical and asymptotic expressions for average outage probability given in (14), (15) and (16) have been substantiated. The analytical results well match the numerical results, and the asymptotic results get increasingly close to the numerical results when P t /N 0 becomes large.…”
Section: A Verification Of Analysismentioning
confidence: 76%
“…Example Assume {N, K} = {4, 2}, i.e., four subcarriers in total and two of them are activated to form an SAP. Obviously, we have S = 4 2 = 6 SAPs, which can be expressed by ASVs ranked 9 One should note that it is possible and even common that for s = t, we have d s (σs) = d t (σt), which indicates that both leaves are equally preferable and can be ranked arbitrarily. When given a perfect binary tree, we will have d 1 (σ1) = d 2 (σ1) = · · · = d s (σs), and all leaves are equivalent.…”
Section: Enhanced Huffman Coding With Csimentioning
confidence: 99%
“…Example Assume {N, K} = {4, 2}, i.e., four subcarriers in total and two of them are activated to form an SAP. Obviously, we have S = 4 2 = 6 SAPs, which can be expressed 9 One should note that it is possible and even common that for s = t, we have d s (σs) = d t (σt), which indicates that both leaves are equally preferable and can be ranked arbitrarily. When given a perfect binary tree, we will have d 1 (σ 1 ) = d 2 (σ 1 ) = · · · = d s (σs), and all leaves are equivalent.…”
Section: Enhanced Huffman Coding With Csimentioning
confidence: 99%