Capacity of a Class of Diamond Channels
| dc.creator | Kang, Wei | |
| dc.creator | Ulukus, Sennur | |
| dc.date | 2008-08-07 | |
| dc.date.accessioned | 2026-07-07T09:55:19Z | |
| dc.date.available | 2026-07-07T09:55:19Z | |
| dc.description | We study a special class of diamond channels which was introduced by Schein in 2001. In this special class, each diamond channel consists of a transmitter, a noisy relay, a noiseless relay and a receiver. We prove the capacity of this class of diamond channels by providing an achievable scheme and a converse. The capacity we show is strictly smaller than the cut-set bound. Our result also shows the optimality of a combination of decode-and-forward (DAF) and compress-and-forward (CAF) at the noisy relay node. This is the first example where a combination of DAF and CAF is shown to be capacity achieving. Finally, we note that there exists a duality between this diamond channel coding problem and the Kaspi-Berger source coding problem. | |
| dc.description | 15 pages, 3 figures, submitted to IEEE Trans. on Information Theory | |
| dc.identifier | https://arxiv.org/abs/0808.0948 | |
| dc.identifier | http://arxiv.org/abs/0808.0948 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/166589 | |
| dc.subject | Information Theory | |
| dc.subject | H.1.1 | |
| dc.title | Capacity of a Class of Diamond Channels | |
| dc.type | text |