Name
Abstract | ||
|---|---|---|
We propose content compression coding for massive users, where correlated contents of grouped users can be utilized to achieve high compression efficiency. We divide the users into several groups. For each group, we select the group head, encode the information of group head independently, and encode other users referring to the group head. We formulate the grouping optimization problem, transform it to a zero-one discrete optimization problem as well as a subset selection problem, and provide upper and lower bounds on the compression ratio. We investigate the sufficient condition and necessary condition on the optimality of one user group. We also investigate two specific type of sources, with star-type and chain-type user statistics, and provide the optimal user grouping. The compression ratio is also studied from both theoretical and experimental perspectives. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ICC.2019.8761659 | IEEE International Conference on Communications |
Field | DocType | ISSN |
ENCODE,Compression (physics),Wireless,Upper and lower bounds,Computer science,Computer network,Coding (social sciences),Theoretical computer science,Compression ratio,Discrete optimization problem,Optimization problem | Conference | 1550-3607 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chen Gong | 1 | 150 | 16.89 |
| Kaihe Deng | 2 | 0 | 0.68 |
| Sihai Zhang | 3 | 63 | 19.50 |
| Jinkang Zhu | 4 | 1 | 3.05 |
| Zhengyuan Xu | 5 | 19 | 7.73 |