On the BCJR Algorithm for Asynchronous Physical-layer Network Coding

Details On the BCJR Algorithm for Asynchronous Physical-layer Network Coding On the BCJR Algorithm for Asynchronous Physical-layer Network Coding

2011-05-24

arxiv.org/abs/1105.4683v1

Computer Science

Information Theory

3 pages

Scientific paper

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 low-complexity algorithms, such as Log-MAP algorithm, Max-Log-MAP algorithm, which are favorable in practice.

Affiliated with

Also associated with

No associations

Rating

On the BCJR Algorithm for Asynchronous Physical-layer Network Coding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the BCJR Algorithm for Asynchronous Physical-layer Network Coding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the BCJR Algorithm for Asynchronous Physical-layer Network Coding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-515294