Skip to content
Free planNo credit card requiredStart writing

article · 2012

Bit-wise combining for decode-and-forward relays

Namshik Kim, John R. Barry

Cited by 0Abstract and details only

Abstract

We consider the problem of combining the signals received from a decode-and-forward relay with those received from the source. As an alternative to the high-complexity maximum-likelihood combining strategy, we propose a bit-wise combining strategy in which the received signals are first converted to log-likelihood values before being combined. We show that, subject to the bit-wise constraint, the optimal combining strategy for binary alphabets - minimizing the probability of error - applies a sigmoidal nonlinearity to the relay log-likelihood values before adding to the source log-likelihood values. Unlike the maximal-ratio combining strategy, which has no diversity for the Rayleigh-fading decode-and-forward relay channel, the proposed strategy exhibits the maximum diversity order of two.

Cite this paper

APA 7

Kim, N., & Barry, J. R. (2012). Bit-wise combining for decode-and-forward relays. https://doi.org/10.1109/wcncw.2012.6215476

MLA 9

Kim, Namshik, and John R. Barry. “Bit-wise combining for decode-and-forward relays.” 2012, pp. 132–36, https://doi.org/10.1109/wcncw.2012.6215476.

Chicago

Kim, Namshik, and John R. Barry. 2012. “Bit-wise combining for decode-and-forward relays.” https://doi.org/10.1109/wcncw.2012.6215476.

Harvard

Kim, N. and Barry, J.R. (2012) ‘Bit-wise combining for decode-and-forward relays’. Available at: https://doi.org/10.1109/wcncw.2012.6215476.

BibTeX
@article{kim2012wise,
  title = {{Bit-wise combining for decode-and-forward relays}},
  author = {Kim, Namshik and Barry, John R.},
  pages = {132--136},
  year = {2012},
  doi = {10.1109/wcncw.2012.6215476}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.