Polar Codes are Optimal for Lossy Source Coding

We consider lossy source compression of a binary symmetric source using polar ncodes and the low-complexity successive encoding algorithm. It was recently nshown by Arikan that polar codes achieve the capacity of arbitrary symmetric nbinary-input discrete memoryless channels under a successive decoding strategy. nWe show the equivalent result for lossy source compression, i.e&#..
文档格式:
.pdf
文档大小:
271.98K
文档页数:
15
顶 /踩数:
0 0
收藏人数:
1
评论次数:
0
文档热度:
文档分类:
待分类
系统标签:
lossy codes polar source coding optimal
下载文档
收藏
打印

We consider lossy source compression of a binary symmetric source using polar ncodes and the low-complexity successive encoding algorithm. It was recently nshown by Arikan that polar codes achieve the capacity of arbitrary symmetric nbinary-input discrete memoryless channels under a successive decoding strategy. nWe show the equivalent result for lossy source compression, i.e&#..

文档格式:
.pdf
文档页数:
15页
文档大小:
271.98K
文档热度:
文档分类:
待分类
系统标签:
lossy codes polar source coding optimal

扫扫二维码,随身浏览文档

手机或平板扫扫即可继续访问

推荐豆丁书房APP  

获取二维码

分享文档

将文档分享至:
分享完整地址
文档地址: 复制
粘贴到BBS或博客
flash地址: 复制

支持嵌入FLASH地址的网站使用

html代码: 复制

默认尺寸450px*300px480px*400px650px*490px

支持嵌入HTML代码的网站使用

分享到