eduzhai > Applied Sciences > Engineering >

Latency and Reliability Trade-off with Computational Complexity Constraints OS Decoders and Generalizations

  • Save

... pages left unread,continue reading

Document pages: 13 pages

Abstract: In this paper, we study the problem of latency and reliability trade-off inultra-reliable low-latency communication (URLLC) in the presence of decodingcomplexity constraints. We consider linear block encoded codewords transmittedover a binary-input AWGN channel and decoded with order-statistic (OS) decoder.We first investigate the performance of OS decoders as a function of decodingcomplexity and propose an empirical model that accurately quantifies thecorresponding trade-off. Next, a consistent way to compute the aggregatelatency for complexity constrained receivers is presented, where the latencydue to decoding is also included. It is shown that, with strict latencyrequirements, decoding latency cannot be neglected in complexity constrainedreceivers. Next, based on the proposed model, several optimization problems,relevant to the design of URLLC systems, are introduced and solved. It is shownthat the decoding time has a drastic effect on the design of URLLC systems whenconstraints on decoding complexity are considered. Finally, it is alsoillustrated that the proposed model can closely describe the performance versuscomplexity trade-off for other candidate coding solutions for URLLC such astail-biting convolutional codes, polar codes, and low-density parity-checkcodes.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×