Rate adaptive binary erasure quantization with dual fountain codes
In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that the source coding dual of the binary erasure channel coding problem, binary erasure quantization, is solved at a nearly opti...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
2008
|
| _version_ | 1826301143958945792 |
|---|---|
| author | Sejdinović, D Piechocki, R Doufexi, A Ismail, M |
| author_facet | Sejdinović, D Piechocki, R Doufexi, A Ismail, M |
| author_sort | Sejdinović, D |
| collection | OXFORD |
| description | In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that the source coding dual of the binary erasure channel coding problem, binary erasure quantization, is solved at a nearly optimal rate with application of duals of LT and raptor codes by a belief propagation-like algorithm which amounts to a graph pruning procedure. Furthermore, this quantizing scheme is rate adaptive, i.e., its rate can be modified on-the-fly in order to adapt to the source distribution, very much like LT and raptor codes are able to adapt their rate to the erasure probability of a channel. © 2008 IEEE. |
| first_indexed | 2024-03-07T05:27:55Z |
| format | Conference item |
| id | oxford-uuid:e13191b7-1048-4032-9bcf-f76a200ea72c |
| institution | University of Oxford |
| last_indexed | 2024-03-07T05:27:55Z |
| publishDate | 2008 |
| record_format | dspace |
| spelling | oxford-uuid:e13191b7-1048-4032-9bcf-f76a200ea72c2022-03-27T09:52:47ZRate adaptive binary erasure quantization with dual fountain codesConference itemhttp://purl.org/coar/resource_type/c_5794uuid:e13191b7-1048-4032-9bcf-f76a200ea72cSymplectic Elements at Oxford2008Sejdinović, DPiechocki, RDoufexi, AIsmail, MIn this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that the source coding dual of the binary erasure channel coding problem, binary erasure quantization, is solved at a nearly optimal rate with application of duals of LT and raptor codes by a belief propagation-like algorithm which amounts to a graph pruning procedure. Furthermore, this quantizing scheme is rate adaptive, i.e., its rate can be modified on-the-fly in order to adapt to the source distribution, very much like LT and raptor codes are able to adapt their rate to the erasure probability of a channel. © 2008 IEEE. |
| spellingShingle | Sejdinović, D Piechocki, R Doufexi, A Ismail, M Rate adaptive binary erasure quantization with dual fountain codes |
| title | Rate adaptive binary erasure quantization with dual fountain codes |
| title_full | Rate adaptive binary erasure quantization with dual fountain codes |
| title_fullStr | Rate adaptive binary erasure quantization with dual fountain codes |
| title_full_unstemmed | Rate adaptive binary erasure quantization with dual fountain codes |
| title_short | Rate adaptive binary erasure quantization with dual fountain codes |
| title_sort | rate adaptive binary erasure quantization with dual fountain codes |
| work_keys_str_mv | AT sejdinovicd rateadaptivebinaryerasurequantizationwithdualfountaincodes AT piechockir rateadaptivebinaryerasurequantizationwithdualfountaincodes AT doufexia rateadaptivebinaryerasurequantizationwithdualfountaincodes AT ismailm rateadaptivebinaryerasurequantizationwithdualfountaincodes |