2018 Information Theory and Applications Workshop (ITA) 2018
DOI: 10.1109/ita.2018.8503179
|View full text |Cite
|
Sign up to set email alerts
|

Sparse Vector Coding for Ultra Short Packet Transmission

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(13 citation statements)
references
References 7 publications
0
13
0
Order By: Relevance
“…Based on Compressive Sensing [87], their studies started around 2017. The first results are promising for ultra-small values of K. In particular, for K below 100 bits, they show comparable performance with Polar codes [88]- [90]. However, the properties related to their generation matrix show worsened decoding performance at high Code Rates (R ≤ 1 4 ).…”
Section: A Block Codesmentioning
confidence: 96%
See 2 more Smart Citations
“…Based on Compressive Sensing [87], their studies started around 2017. The first results are promising for ultra-small values of K. In particular, for K below 100 bits, they show comparable performance with Polar codes [88]- [90]. However, the properties related to their generation matrix show worsened decoding performance at high Code Rates (R ≤ 1 4 ).…”
Section: A Block Codesmentioning
confidence: 96%
“…However, the properties related to their generation matrix show worsened decoding performance at high Code Rates (R ≤ 1 4 ). Furthermore, the required representation of data into sparse vector form limited the use of SVC exclusively to ultra-small K values [88]. Recently, the literature proposed some implementations related to these new techniques: [91] where also is estimated computational complexity, and [92] where are given reliability and decoding latency performance.…”
Section: A Block Codesmentioning
confidence: 99%
See 1 more Smart Citation
“…We test the transmission of b bit information which consists of information bit b i and CRC bit b c . In the conventional PDCCH method, the convolution code with rate 1 3 with the 16-bit CRC is employed. Since the block size of the polar code is not flexible, we set the rate 1 4 to test similar conditions (b = 2 4 and m = 32).…”
Section: A Simulation Setupmentioning
confidence: 99%
“…In the conventional PDCCH method, the convolution code with rate 1 3 with the 16-bit CRC is employed. Since the block size of the polar code is not flexible, we set the rate 1 4 to test similar conditions (b = 2 4 and m = 32). In the proposed SVC algorithm, we set the random binary spreading codebook with N = 96 and K = 2.…”
Section: A Simulation Setupmentioning
confidence: 99%