Skip to main content
Article thumbnail
Location of Repository

Error Probability Bound for Reduced Complexity Multiuser Decoding Using Orthogonal Decomposability

By 

Abstract

Abstract — We develop an upper bound on the error probability of the reduced-complexity Group-Metric multiuser convolutional decoder [1]. This error bound results from discarding a class of redundant error sequences which are orthogonally decomposable. Indecomposable sequences for uncoded multiuser detection were introduced in [2] for the non-fading channel, and their enumeration is computationally intensive. By restricting attention to orthogonally decomposable error sequences for the fading channel, we can characterize sequences whose decomposability is independent of the fading parameters. Furthermore, we can easily compute this bound by evaluating the generating function of the encoder of the user in question. I

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.2582
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ece.colorado.edu/~varan... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.