|
JAIST Repository >
School of Information Science >
Other results of education and research >
Other results of education and research >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/13796
|
| Title: | Interim Report of Detailed Coding/Decoding Algorithms and Correlation Estimation Techniques |
| Authors: | Anwar, Khoirul He, Xin Hou, Jiancao Komulainen, Petri Matsumoto, Tad Matth´e, Maximilian Wolf, Albrecht Yi, Na Zhou, Xiaobo |
| Keywords: | cooperative relaying decode-and-forward distributed turbo code interleave division multiple access iterative decoding lossy forwarding multi-hop communication wireless networks |
| Issue Date: | Oct-2014 |
| Publisher: | EU FP7 RESCUE project |
| Abstract: | The RESCUE project proposes a novel multi-route communication technology design targeted for
multi-hop networks, based on cooperative decode-and-forward (DF) relaying allowing intra-link errors and utilizing distributed turbo codes. This deliverable provides initial results and descriptions of the considered coding/decoding and correlation estimation algorithms. The state-of-the-art in simple relay network models is
summarized, and new source-correlation estimation methods and signaling protocols are proposed. According to the numerical results, the decoding performance is close to the theoretical limit when the correlation is known. Furthermore, more general system models are considered, including non-orthogonal multiple access, multi-hop communication where the destination is more than two hops away from the source, and multipleaccess
relaying where two sources utilize a single relay node. In order to support system level development
and simulations, a new simulation abstraction concept is also proposed. |
| Language: | eng |
| URI: | https://hdl.handle.net/10119/13796 |
| Appears in Collections: | b80-1. その他の教育研究活動関連資料 (Other results of education and research)
|
Files in This Item:
| File |
Description |
Size | Format |
| 2223_D2.1.1_final.pdf | | 1543Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|