Multilevel Coding Schemes for Compute-and-Forward With Flexible Decoding Academic Article

abstract

• We consider the design of coding schemes for the wireless two-way relaying channel when there is no channel state information at the transmitter. In the spirit of the compute-and-forward paradigm, we present a multilevel coding scheme that permits reliable computation (or, decoding) of a class of functions at the relay. The function to be computed (or decoded) is then chosen depending on the channel realization. We define such a class of functions which can be decoded at the relay using the proposed coding scheme and derive rates that are universally achievable over a set of channel gains when this class of functions is used at the relay. We develop our framework with general modulation formats in mind, but numerical results are presented for the case where each node transmits using 4-ary and 8-ary modulation schemes. Numerical results demonstrate that the flexibility afforded by our proposed scheme results in substantially higher rates than those achievable by always using a fixed function or considering only linear functions over higher order fields. 1963-2012 IEEE.

authors

• Narayanan, Krishna

published proceedings

• IEEE TRANSACTIONS ON INFORMATION THEORY

author list (cited authors)

• Hern, B., & Narayanan, K. R.

citation count

• 25

complete list of authors

• Hern, Brett||Narayanan, Krishna R

publication date

• November 2013

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON INFORMATION THEORY  Journal

keywords

• Compute-and-forward (cf)
• Decode-and-forward
• Multilevel Coding
• Network Coding
• Two-way Relaying

Digital Object Identifier (DOI)

• 10.1109/TIT.2013.2271771

start page

• 7613

end page

• 7631

volume

• 59

issue

• 11

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Ftit.2013.2271771