© The Institution of Engineering and Technology
A system for the correlated Gaussian sources to perform compression forwarding via the multirelay network in the additive white Gaussian noise channel is proposed in this study. The characteristic of the newly proposed system is that it is composed of two parts: an analogue sensor network from the sources to multiple relay nodes and a digital communication network from multiple relay nodes to the destination node. The sensors can only perform simple analogue signal transmission, but the encoder set up at each relay can carry out complex distributed source coding DSC and then send the coded digital signals to the destination node. In this study, the authors establish the rate–distortion function of DSC based on the Chief Executive Officer problem. Combined with the channel capacity theorem, an optimal power allocation scheme is first proposed. The quantisation signaltonoise ratio (SNR) at the destination node is used to evaluate the performance of the system under different correlations between sources. For the case of independent sources, a closedform expression for the quantisation SNR is derived and they compare the optimised agent compressandforward system with the traditional amplifyandforward system to verify that the proposed system can achieve better SNR performance.
References


1)

1. Meulen, V.D.: ‘Threeterminal communication channels’, Adv. Appl. Probab., 1971, 3, pp. 120–154.

2)

2. Huang, C., Zhang, R., Cui, S.: ‘Throughput maximization for the Gaussian relay channel with energy harvesting constraints’, IEEE J. Sel. Areas Commun., 2013, 31, (8), pp. 1469–1479.

3)

3. Gunduz, D., Goldsmith, A., Poor, H.V., et al: ‘The multiway relay channel’, IEEE Trans. Inf. Theory, 2013, 59, (1), pp. 51–63.

4)

4. Kim, T.M., Paulraj, A.: ‘Outage probability of amplifyandforward cooperation with full duplex relay’. 2012 IEEE Wireless Communications and Networking Conference (WCNC), Shanghai, 2012, pp. 75–79.

5)

5. Yang, S., Belfiore, J.C.: ‘On slotted amplifyandforward cooperative diversity schemes’. 2006 IEEE International Symposium on Information Theory, Seattle, WA, 2006, pp. 2446–2450.

6)

6. Kwon, T., Lim, S., Choi, S., et al: ‘Optimal duplex mode for DF relay in terms of the outage probability’, IEEE Trans. Veh. Technol., 2010, 59, (7), pp. 3628–3634.

7)

7. Lim, S.H., Kim, K.T., Kim, Y.H.: ‘Distributed decode–forward for relay networks’, IEEE Trans. Inf. Theory, 2017, 63, (7), pp. 4103–4118.

8)

8. Gu, Y.S., Aissa, S.: ‘RFbased energy harvesting in decodeandforward relaying systems: ergodic and outage capacities’, IEEE Trans. Wirel. Commun., 2018, 14, (11), pp. 6425–6434.

9)

9. Hunter, T.E., Nosratinia, A.: ‘Diversity through coded cooperation’, IEEE Trans. Wirel. Commun., 2006, 5, (2), pp. 283–289.

10)

10. Heidarpour, A.R., Kurt, G.K., Uysal, M.: ‘FiniteSNR diversitymultiplexing tradeoff for network coded cooperative OFDMA systems’, IEEE Trans. Wirel. Commun., 2017, 16, (3), pp. 1385–1396.

11)

11. Simoens, S., MunozMedina, O., Vidal, J., et al: ‘Compressandforward cooperative MIMO relaying with full channel state information’, IEEE Trans. Signal Process., 2010, 58, (2), pp. 781–791.

12)

12. Haghighat, J., Hamouda, W.: ‘Decodecompressandforward with selectivecooperation for relay networks’, IEEE Commun. Lett., 2012, 16, (3), pp. 378–381.

13)

13. Slepian, D., Wolf, J.: ‘Noiseless coding of correlated information sources’, IEEE Trans. Inf. Theory, 1973, 19, (4), pp. 471–480.

14)

14. Kavousianos, X., Kalligeros, E., Nikolos, D.: ‘Optimal selective Huffman coding for testdata compression’, IEEE Trans. Comput., 2007, 56, (8), pp. 1146–1152.

15)

15. Han, S., Mao, H., Dally, W.J.: ‘Deep compression: compressing deep neural networks with pruning, trained quantization and Huffman coding’, Fiber, 2015, 56, (4), pp. 3–7.

16)

16. Tjalkens, T.: ‘Implementation cost of the HuffmanShannon–Fano code’. Data Compression Conf. IEEE Computer Society, Snowbird, UT, USA, 2005, pp. 123–132.

17)

17. Berger, T., Zhang, Z., Viswanathan, H.: ‘The CEO problem [multiterminal source coding]’, IEEE Trans. Inf. Theory, 1996, 42, (3), pp. 887–902.

18)

18. Oohama, Y.: ‘The rate–distortion function for the quadratic Gaussian CEO problem’, IEEE Trans. Inf. Theory, 1998, 44, (3), pp. 1057–1070.

19)

19. Prabhakaran, V., Tse, D., Ramachandran, K.: ‘Rate region of the quadratic Gaussian CEO problem’. Int. Symp. Information Theory, Chicago, IL, 2004.

20)

20. Oohama, Y.: ‘Rate–distortion theory for Gaussian multiterminal source coding systems with several side informations at the decoder’, IEEE Trans. Inf. Theory, 2005, 51, (7), pp. 2577–2593.

21)

21. Xu, Y., Wang, Q.: ‘Rate region of the vector Gaussian CEO problem with the trace distortion constraint’, IEEE Trans. Inf. Theory, 2014, 62, (4), pp. 1823–1835.

22)

22. Ekrem, E., Ulukus, S.: ‘An outer bound for the vector Gaussian CEO problem’, IEEE Trans. Inf. Theory, 2014, 60, (11), pp. 6870–6887.

23)

23. Wang, J., Chen, J.: ‘On the vector Gaussian Lterminal CEO problem’. 2012 IEEE International Symposium on Information Theory Proceedings, Cambridge, MA, 2012, pp. 571–575.
http://iet.metastore.ingenta.com/content/journals/10.1049/ietcom.2018.5704
Related content
content/journals/10.1049/ietcom.2018.5704
pub_keyword,iet_inspecKeyword,pub_concept
6
6