| 書目名稱 | Turbo-like Codes | | 副標(biāo)題 | Design for High Spee | | 編輯 | Aliazam Abbasfar | | 視頻video | http://file.papertrans.cn/931/930982/930982.mp4 | | 概述 | Turbo code concepts are explained in simple language.Turbo codes and LDPC codes are viewed in a unified manner as turbo-like codes.Implementation and hardware complexity is a major focus.Presents a no | | 圖書封面 |  | | 描述 | The common property among turbo-like code is that they consist of very simple constituent codes that are connected to each other with random or pseudorandom interleavers. The crucial novelty in these codes is the iterative decoding. This means that the constituent codes are decoded separately, which is ef?cient and practically feasible since they are very simple codes. Then, they pass new information to each other in a course of a few iterations. It has been shown that iterative decoding is a generalization of the well-known probability or belief propagation algorithm. The belief propagation algorithm that has been essential for development of new ideas throughout this work is described in the context of coding. The basic theorems for this algorithm are explained and proven in the following paragraphs. Thisis then followed by a description of the computational algorithm. The probability propagation algorithm is proven in c- junctionwithatree-structuredgraph–graphswithoutanycycle.Infact,thegraphical representation of any problem solved by this algorithm is the centerpiece of the algorithm. The generalization of the algorithm for graphs with cycles is presented later on. Representati | | 出版日期 | Book 2007 | | 關(guān)鍵詞 | Channel coding/Error correcting codes; Code; High speed turbo decoding; LDPC codes; RA/ARA codes; Turbo c | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4020-6391-6 | | isbn_softcover | 978-90-481-7623-6 | | isbn_ebook | 978-1-4020-6391-6 | | copyright | Springer Science+Business Media B.V. 2007 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-11 01:34
發(fā)表于 2025-3-21 16:44:23
