TY - GEN
T1 - Diophantine approximation approach for incomplete decoding at relays
AU - Hucher, Charlotte
AU - Rekaya-Ben Othman, Ghaya
AU - Saadani, Ahmed
PY - 2009/12/7
Y1 - 2009/12/7
N2 - In this paper, we propose a low-complexity method to perform the incomplete decoding needed at relays for the Incomplete Decode-and-Forward. The decoding problem is considered as a diophantine approximation search. We propose two modifications of Cassels' algorithm to approximate an element x ε ε(i, θ) by a linear combination a + θb of symbols taken in a Z-PAM. Simulation results show that the use of Diophantine approximation induces only a small loss in performance, while reducing significantly the processing complexity.
AB - In this paper, we propose a low-complexity method to perform the incomplete decoding needed at relays for the Incomplete Decode-and-Forward. The decoding problem is considered as a diophantine approximation search. We propose two modifications of Cassels' algorithm to approximate an element x ε ε(i, θ) by a linear combination a + θb of symbols taken in a Z-PAM. Simulation results show that the use of Diophantine approximation induces only a small loss in performance, while reducing significantly the processing complexity.
U2 - 10.1109/ITW.2009.5351200
DO - 10.1109/ITW.2009.5351200
M3 - Conference contribution
AN - SCOPUS:76249124083
SN - 9781424449835
T3 - 2009 IEEE Information Theory Workshop, ITW 2009
SP - 455
EP - 459
BT - 2009 IEEE Information Theory Workshop, ITW 2009
T2 - 2009 IEEE Information Theory Workshop, ITW 2009
Y2 - 11 October 2009 through 16 October 2009
ER -