Coded Cooperation with Single Parity-Check Turbo-Product Codes over Fast Fading Channels

Dayan Adionel Guimarães, Geraldo Gil Ramundo Gomes and Guilherme Varela Barbosa

(National Institute of Telecommunications – Inatel Santa Rita do Sapucaí, MG, Brazil)

Bartolomeu Ferreira Uchôa-Filho

(Federal University of Santa Catarina Communications Research Group (GpqCom)

Florianopolis, SC, Brazil)

August, 18th, 2014 - Monday

Abstract:

- New coded cooperation scheme based on single parity-check turbo- product codes.

- New way of combining channel soft-information from the source and the relays at the destination.

- With simple encoding and decoding, and potential for large cooperation gains (fast fading channels).

2 August 2014

I. INTRODUCTION

- Cooperative communications with decode-and-forward (DF) relaying. - We propose a novel coded cooperation scheme with a new DF relaying approach.

- We consider serial concatenated multidimensional single parity-check product codes (SPCPC).

3 August 2014

Relay node

Source node

Destination

II. BACKGROUND A. Single parity-check product code (SPCPC) construction

4 August 2014

2D 3D

II. BACKGROUND B. Serial concatenation of single parity-check product codes

- The codeword lengths (no and ni) and message lengths (ko and ki) of the component SPCs.

5 August 2014

i io o

o o o o

i i o o

( , ) ( , 1) , and

( , ) 1, ,D DD D

n k n n

n k n n

II. BACKGROUND

A codeword can be turbo-decoded in two ways:

i) As a codeword of the Di-dimensional inner code (Ci), followed by a turbo decoding of the Do-dimensional outer code (Co); ii) As a Do-dimensional outer code (Co) alone.

6 August 2014

II. BACKGROUND C. Iterative decoding of the single parity-check product codes

7 August 2014

III. THE PROPOSED CODED COOPERATION SCHEME

- Coπ Interleaved codeword of the outer code (Co);

- PCi, parities of the inner codeword (Ci);

- Copπ fraction of the

recoded codeword in the relay;

(This part contains a fraction of the systematic information bits from the source node)

8 August 2014

IV. NUMERICAL RESULTS

Scenarios:

1) no cooperation – the destination has:

2) source cooperating with a relay and the relay not cooperating – the destination has only:

3) one or two relays cooperating with the source – here, improved cooperation diversity is achieved.

9 August 2014

IV. NUMERICAL RESULTS - Code (8,7)2+(5,4)3 = (125,49); RcE = 48.8% and r = 0.392.

- Source-relay channels (AWGN) channels with Eb/N0 = 30 dB;

- The source-destination and relay-destination channels are orthogonal flat Rayleigh fading channels;

- The average Eb/N0 for the relay-destination links is fixed at 5.5 dB.

- The modulation is BPSK with coherent detection.

10 August 2014

- large coding gains obtained: 3.5 dB with one relay, and 6 dB with two relays;

- Potential for higher gains

with new settings.

11 August 2014

V. CONCLUDING REMARKS AND FUTURE WORK

- A new way of combining the channel soft-information, along with a new coded cooperation scheme based on SPCTPC (large cooperation gains). - Moreover, the encoding and decoding of the SPCTPC is simple to implement.

12 August 2014

V. CONCLUDING REMARKS AND FUTURE WORK

Some future work in this direction might be:

i) The use of a cooperation decision method that allows mutual cooperation between users.

ii) Making the encoders and decoders work with larger dimension codes.

13 August 2014

THANK YOU!

guilhermev@mtel.inatel.br

14 August 2014

REFERENCES

[1] M. N. Khormuji and E. G. Larsson, “Cooperative transmission based on decode-and-forward relaying with partial repetition coding,” IEEE Trans. Wireless Commun, vol. 8, no. 4, pp. 1716- 1725, April 2009.

[2] B. Zhao and M. C. Valenti, “Distributed turbo codes: towards the capacity of the relay channel,” in Proc. VTC-Fall, vol. 1, pp. 322-326, Oct. 2003.

[3] E. A. Obiedat and L. Cao, “Soft information relaying for distributed turbo product codes (SIR-DTPC),” IEEE Signal Proc. Letters, vol.17, no. 4, pp. 363-366, Apr. 2010.

[4] T. E. Hunter and A. Nosratinia, “Cooperation diversity through coding”, in Proc. ISIT, p. 220, Jul. 2002.

[5] D. M. Rankin and T. A. Gulliver, “Single parity check product codes”, IEEE Trans. Commun., vol. 49, no. 8, pp. 1354–1362, Aug. 2001.

[6] D. M. Rankin, T. A. Gulliver, and D. P. Taylor, “Parallel and serial concatenated single parity check product codes”, EURASIP J. Applied Signal Proc., no. 6, pp. 775–783, 2005.

15 August 2014