On the BCJR Algorithm for Asynchronous Physical-layer Network Coding
In practical asynchronous bi-directional relaying, symbols transmitted by two source nodes cannot arrive at the relay with perfect symbol alignment and the symbol-asynchronous multiple-access channel (MAC) should be seriously considered. Recently, Lu et al. proposed a Tanner-graph representation of symbol-asynchronous MAC with rectangular-pulse shaping and further developed the message-passing algorithm for optimal decoding of the asynchronous physical-layer network coding. In this paper, we present a general channel model for the asynchronous multiple-access channel with arbitrary pulse-shaping. Then, the Bahl, Cocke, Jelinek, and Raviv (BCJR) algorithm is developed for optimal decoding of asynchronous MAC channel. This formulation can be well employed to develop various lowcomplexity algorithms, such as Log-MAP algorithm, Max-Log- MAP algorithm, which are favorable in practice.
asynchronous bi-directional relaying network coding synchronization BCJR algorithm.
Xiaofu Wu Chunming Zhao Xiaohu You
Institute of Communications Engineering, PLA Univ.of Sci. &Tech., Nanjing 210007, CHINA National Mob National Mobile Commun. Research Lab., Southeast University, Nanjing 210096, CHINA
国际会议
南京
英文
1-4
2011-11-09（万方平台首次上网日期，不代表论文的发表时间）