2019 IEEE Global Communications Conference (GLOBECOM) 2019
DOI: 10.1109/globecom38437.2019.9014184
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis of the Unary Coding Aided SWIPT in a Single-User Z-Channel

Abstract: Radio frequency (RF) signal based simultaneous wireless information and power transfer (SWIPT) has emerged as a promising technique for satisfying both the communication and charging requests of the massively deployed IoT devices. Different from the physical layer and the medium-access-control layer design for coordinating the SWIPT in the RF band, we study its coding-level control from the information theoretical perspective. Due to its practical implementation of the decoder and its flexibility on the codewo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
(23 reference statements)
0
1
0
Order By: Relevance
“…One of the main entropy coding types creates and assigns every single symbol of the entry into a unique prefix-free code. There are more than 16 algorithms support entropy algorithms such as Arithmetic Coding [ 71 , 72 , 73 , 74 ], Asymmetric Numeral Systems (ANS) [ 75 , 76 , 77 ], Golomb Coding [ 78 , 79 ], Adaptive Huffman [ 80 , 81 , 82 ], Canonical Huffman [ 83 ], Modified Huffman [ 84 ], Range encoding [ 85 , 86 ], Shannon [ 87 ], Shannon–Fano [ 88 , 89 , 90 ], Shannon–Fano–Elias [ 91 ], Tunstall coding [ 92 , 93 ], Unary coding [ 94 , 95 , 96 ], Universal Exp-Golomb [ 97 , 98 ], Universal Fibonacci Coding [ 99 , 100 , 101 ], Universal Gamma Coding [ 102 , 103 ], Universal Levenshtein Coding [ 104 ].…”
Section: Compressionmentioning
confidence: 99%
“…One of the main entropy coding types creates and assigns every single symbol of the entry into a unique prefix-free code. There are more than 16 algorithms support entropy algorithms such as Arithmetic Coding [ 71 , 72 , 73 , 74 ], Asymmetric Numeral Systems (ANS) [ 75 , 76 , 77 ], Golomb Coding [ 78 , 79 ], Adaptive Huffman [ 80 , 81 , 82 ], Canonical Huffman [ 83 ], Modified Huffman [ 84 ], Range encoding [ 85 , 86 ], Shannon [ 87 ], Shannon–Fano [ 88 , 89 , 90 ], Shannon–Fano–Elias [ 91 ], Tunstall coding [ 92 , 93 ], Unary coding [ 94 , 95 , 96 ], Universal Exp-Golomb [ 97 , 98 ], Universal Fibonacci Coding [ 99 , 100 , 101 ], Universal Gamma Coding [ 102 , 103 ], Universal Levenshtein Coding [ 104 ].…”
Section: Compressionmentioning
confidence: 99%