Publication

A Low-Complexity Practical Quantize-and-Forward Scheme for Two-hop Relay Systems

2012
Conference Papers

Abstract

We study a low-complexity practical quantize-and-forward (QF) scheme, a special case of the compress-and-forward (CF) transmission for half-duplex relay systems. By adjusting the number of quantization levels, we show that significant performance improvement can be achieved even though the relay node does not exploit any correlation information with the signal received at the destination. We demonstrate the performance of our scheme using 16QAM as the modulation and Turbo Code as the channel coding, and compare its performance against the decode-and-forward (DF) scheme. An approximately 2 dB gain is shown to be achievable at a target error rate of 10(-4) in the scenario where the relay is close to destination.

Official source

https://infoscience.epfl.ch/entities/publication/f830f045-6263-4ab1-88b2-0db351ba89ec

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2012
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/f830f045-6263-4ab1-88b2-0db351ba89ec

About this result

Related concepts (32)

Error correction code

In computing, telecommunication, information theory, and coding theory, forward error correction (FEC) or channel coding is a technique used for controlling errors in data transmission over unreliable or noisy communication channels. The central idea is that the sender encodes the message in a redundant way, most often by using an error correction code or error correcting code (ECC). The redundancy allows the receiver not only to detect errors that may occur anywhere in the message, but often to correct a limited number of errors.

Noisy-channel coding theorem

In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise contamination of a communication channel, it is possible to communicate discrete data (digital information) nearly error-free up to a computable maximum rate through the channel. This result was presented by Claude Shannon in 1948 and was based in part on earlier work and ideas of Harry Nyquist and Ralph Hartley.

Turbo code

In information theory, turbo codes (originally in French Turbocodes) are a class of high-performance forward error correction (FEC) codes developed around 1990–91, but first published in 1993. They were the first practical codes to closely approach the maximum channel capacity or Shannon limit, a theoretical maximum for the code rate at which reliable communication is still possible given a specific noise level. Turbo codes are used in 3G/4G mobile communications (e.g.

Related publications (32)

A Low-Complexity Practical Quantize-and-Forward Scheme for Two-hop Relay Systems

Chat with Graph Search

A Generalized Adjusted Min-Sum Decoder for 5G LDPC Codes: Algorithm and Implementation

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Low Power LDPC Decoding by Reliable Voltage Down-Scaling