Practical Quantize-and-Forward Schemes for the Frequency Division Relay Channel

@article{Djeumou2007PracticalQS,
  title={Practical Quantize-and-Forward Schemes for the Frequency Division Relay Channel},
  author={Brice Djeumou and Samson Lasaulce and A. G. Klein},
  journal={EURASIP Journal on Wireless Communications and Networking},
  year={2007},
  volume={2007},
  pages={1-11}
}
We consider relay channels in which the source-destination and relay-destination signals are assumed to be orthogonal and thus have to be recombined at the destination. Assuming memoryless signals at the destination and relay, we propose a low-complexity quantize-and-forward (QF) relaying scheme, which exploits the knowledge of the SNRs of the source-relay and relay-destination channels. Both in static and quasistatic channels, the quantization noise introduced by the relay is shown to be… Expand
A Novel Quantize-and-Forward Cooperative System: Channel Estimation and M-PSK Detection Performance
TLDR
A novel quantization scheme is proposed, in which the relay compensates for the rotation caused by the source-relay channel, before quantizing the phase of the received M-PSK data symbols, so channel estimation at the destination is greatly simplified, without significantly increasing the complexity of the relay terminals. Expand
A novel Quantize-and-Forward cooperative system: Channel parameter estimation techniques
TLDR
A novel Quantize and Forward protocol in which the relay compensates for the rotation on the source-relay channel using a crude channel estimate, before quantizing the phase of the received M-PSK data symbols, which is shown to be close to that of a system with known channel parameters. Expand
ANovel Quantize-and-Forward Cooperative System : Channel Estimation andM-PSKDetection Performance
A method to improve the reliability of data transmission between two terminals without using multiple antennas is cooperative communication, where spatial diversity is introduced by the presence of aExpand
Interference Relay Channels - Part I: Transmission Rates
TLDR
A system composed of two interfering point-to-point links where the transmitters can exploit a common relay to improve their individual transmission rate and it is shown that this protocol, through the cooperation degree between each transmitter and the relay, is the only one that naturally introduces a game between the transmitter. Expand
Cooperative Schemes for a Source and an Occasional Nearby Relay in Wireless Networks
A wireless network is considered where a source is communicating with a remote destination, and where a relay terminal is occasionally present in close proximity to the source but without theExpand
Iterative SAGE-Based Channel Estimation in a Block Fading Amplify-and-Forward Relaying Network
TLDR
This paper focuses on the Amplify-and-Forward protocol and uses the Space-Alternating Generalized Expectation-maximization (SAGE) algorithm to estimate the channel gain and noise variance in an iterative way, exploiting both the pilot part and the data part of the signal received at the destination. Expand
LLR-based symbol selective transmission with a near-optimal threshold to minimize BEP for demodulation-forward relay systems
TLDR
Simulation results prove that the proposed log likelihood ratio (LLR)-based symbol selective transmission with a near-optimum threshold to minimize the bit error probability (BEP) efficiently mitigates error propagation. Expand
Compress-Forward Coding With BPSK Modulation for the Half-Duplex Gaussian Relay Channel
TLDR
This paper provides the achievable rate of SWCNSQ based CF relaying as a performance benchmark, and presents a practical code design using low-density parity-check (LDPC) codes for error protection at the source, and nested scalar quantization plus irregular-repeat accumulation (IRA) code codes for CF coding at the relay. Expand
Compress-forward coding with BPSK modulation for the half-duplex Gaussian relay channel
TLDR
This paper provides the achievable rate of SWCNSQ based CF relaying as a performance benchmark, and presents a practical code design using low-density parity-check (LDPC) codes for error protection at the source, and nested scalar quantization plus irregular-repeat accumulation (IRA) code codes for CF coding at the relay. Expand
Maximum-likelihood channel estimation in block fading amplify-and-forward relaying networks
  • N. Aerts, I. Avram, M. Moeneclaey
  • Computer Science
  • 2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications
  • 2011
TLDR
The space-alternating generalized expectation-maximization (SAGE) algorithm is used to perform codeaided iterative channel estimation from the broadcasted signals in an Amplify-and-Forward protocol, and the resulting error performance is investigated. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 22 REFERENCES
Half-Duplex Estimate-and-Forward Relaying: Bounds and Code Design
TLDR
An important practical advantage of this scheme is that it does not require source-relay symbol synchronization, and it outperform direct and two-hop channel capacities, as well as decode-and-forward relaying when the relay-destination link is strong. Expand
Relaying protocols for two colocated users
TLDR
This work considers a wireless network where a remote source sends information to one of two colocated users, and where the second user can serve as a relay, and proposes relaying protocols based on Wyner-Ziv quantization at the relay which demonstrate their high efficiency and high efficiency with respect to previously reported relaying schemes. Expand
High-Performance Cooperative Demodulation With Decode-and-Forward Relays
TLDR
A high-performance low-complexity coherent demodulator at the destination in the form of a weighted combiner is derived from a practically attractive decode-and-forward relay strategy to achieve spatial diversity gains, regardless of the underlying constellation. Expand
Lower Bounds on the Capacity of Gaussian Relay Channel
TLDR
This paper presents a new achievable rate for the case of Gaussian relay channels, which outperforms the best known schemes in many cases of interest and can outperform all known schemes for several channel gains. Expand
On the Capacity of Memoryless Relay Networks
  • K. Gomadam, S. Jafar
  • Computer Science
  • 2006 IEEE International Conference on Communications
  • 2006
TLDR
A new scheme is developed that forwards the unconstrained minimum mean square error (MMSE) estimate obtained at the relay to the destination by relating some of the existing memoryless forwarding strategies to the fundamental signal processing operations of estimation and detection. Expand
Wyner-Ziv coding for the half-duplex relay channel
  • Zhixin Liu, V. Stanković, Z. Xiong
  • Computer Science
  • Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.
  • 2005
TLDR
This work presents the first practical CF design for the half-duplex Gaussian relay channel based on Wyner-Ziv coding of the received source signal at the relay, and realizes the performance gain of CF over DF promised by the theory when the relay is close to the destination. Expand
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
TLDR
Using distributed antennas, this work develops and analyzes low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks and develops performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading. Expand
Combining Decoded-and-Forwarded Signals in Gaussian Cooperative Channels
TLDR
This paper more deeply looks at the case where the relays are in bad reception conditions and the cooperation powers are sufficiently high, and in this situation using a conventional MRC severely degrades the receiver performance. Expand
Bounds on capacity and minimum energy-per-bit for AWGN relay channels
TLDR
Two coding schemes that do not require the relay to decode any part of the message are investigated and it is shown that the "side-information coding scheme" can outperform the block-Markov coding scheme and the achievable rate of the side- information coding scheme can be improved via time sharing. Expand
Joint source and channel coding using a non-linear receiver
  • F. Liu, P. Ho, V. Cuperman
  • Computer Science
  • Proceedings of ICC '93 - IEEE International Conference on Communications
  • 1993
TLDR
An iterative algorithm is introduced which jointly optimizes the VQ and the modulation signal set using as optimality criterion the minimum mean-square error between the original and the reconstructed signals. Expand
...
1
2
3
...