Window decoding schedules are very attractive for message passing decoding of spatially coupled LDPC codes. They take advantage of the inherent convolutional code structure and allow continuous transmission with low decoding latency and complexity. In this paper we show that the decoding complexity can be further reduced if suitable message passing schedules are applied within the decoding window. An improvement based schedule is presented that easily adapts to different ensemble structures, window sizes, and channel parameters. Its combination with a serial (on-demand) schedule is also considered. Results from a computer search based schedule are shown for comparison.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:26634 |
| Date | January 2012 |
| Creators | Hassan, Najeeb ul, Pusane, Ali E., Lentmaier, Michael, Fettweis, Gerhard P., Costello, Daniel J. |
| Publisher | Technische Universität Dresden |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
| Source | Proceedings of the IEEE Information Theory Workshop (ITW´12), 3-7 September 2012, Lausanne, Switzerland, S. 20-24, ISBN: 978-1-4673-0224-1 |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 10.1109/ITW.2012.6404660 |
Page generated in 0.0019 seconds