Good Index Choosing for Polarized Relay Channel
محورهای موضوعی : Communication Systems & Devices
Hassan Tavakoli
1
(University of guilan)
Saeid Pakravan
2
(University of guilan)
کلید واژه: Relay channel , Polar code , Channel polarization , Capacity , Relay channel polarization , Good index of relay channel,
چکیده مقاله :
The Polar coding is a method which have been proposed by Arikan and it is one of the first codes that achieve the capacity for vast numerous channels. This paper discusses relay channel polarization in order to achieve the capacity and it has been shown that polarization of two relay channels can be given a more achievable rate region in the general form. This method is compatible with the original vision of polarization based on the combining, splitting and polarizing of channels and it has been shown that the complexity of encoding and decoding for these codes in mentioned method are O(N log〖N)〗, and also error probability for them is O(2^(〖-(N)〗^β )). Choose the best sub-channels in polarized relay channels for sending data is a big trouble in this structure. In this paper, we have been presented a new scheme for choosing a good index for sending the information bits in relay channels polarized in order to have the best performance by using sending information bits over FIF sets.
The Polar coding is a method which have been proposed by Arikan and it is one of the first codes that achieve the capacity for vast numerous channels. This paper discusses relay channel polarization in order to achieve the capacity and it has been shown that polarization of two relay channels can be given a more achievable rate region in the general form. This method is compatible with the original vision of polarization based on the combining, splitting and polarizing of channels and it has been shown that the complexity of encoding and decoding for these codes in mentioned method are O(N log〖N)〗, and also error probability for them is O(2^(〖-(N)〗^β )). Choose the best sub-channels in polarized relay channels for sending data is a big trouble in this structure. In this paper, we have been presented a new scheme for choosing a good index for sending the information bits in relay channels polarized in order to have the best performance by using sending information bits over FIF sets.
[1] Van Der Meulen, Edward C. "Three-terminal communication channels."Advances in applied Probability (1971): 120-154.#
[2] Cover, Thomas M., and Abbas El Gamal. "Capacity theorems for the relay channel." Information Theory, IEEE Transactions on 25, no. 5 (1979): 572-584.#
[3] Arikan, Erdal. "Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels."Information Theory, IEEE Transactions on 55, no. 7 (2009): 3051-3073.#
[4] Arıkan, Erdal, and Emre Telatar. "On the rate of channel polarization." InInformation Theory, 2009. ISIT 2009. IEEE International Symposium on, pp. 1493-1495. IEEE, 2009.#
[5] Sasoglu, Eren, Emre Telatar, and Edmund Yeh. "Polar codes for the two-user multiple-access channel." arXiv preprint arXiv:1006.4255 (2010).#
[6] Abbe, Emmanuel, and Emre Telatar. "Polar codes for the-user multiple access channel." Information Theory, IEEE Transactions on 58, no. 8 (2012): 5437-5448.#
[7] Goela, Naveen, Emmanuel Abbe, and Michael Gastpar. "Polar codes for broadcast channels." Information Theory, IEEE Transactions on 61, no. 2 (2015): 758-782.#
[8] Mondelli, Marco, S. Hamed Hassani, Igal Sason, and Rudiger L. Urbanke. "Achieving Marton’s region for broadcast channels using polar codes."Information Theory, IEEE Transactions on 61, no. 2 (2015): 783-800.#
[9] Andersson, Mattias, Vishwambhar Rathi, Ragnar Thobaben, Jörg Kliewer, and Mikael Skoglund. "Nested polar codes for wiretap and relay channels."Communications Letters, IEEE 14, no. 8 (2010): 752-754.#
[10] Blasco-Serrano, Ricardo, Ragnar Thobaben, Mattias Andersson, Vishwambhar Rathi, and Mikael Skoglund. "Polar codes for cooperative relaying." Communications, IEEE Transactions on 60, no. 11 (2012): 3263-3273.#
[11] Blasco-Serrano, Ricardo, Ragnar Thobaben, Vishwambhar Rathi, and Mikael Skoglund. "Polar codes for compress-and-forward in binary relay channels." In Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on, pp. 1743-1747. IEEE, 2010.#
[12] Karzand, Mohammad. "Polar codes for degraded relay channels." InProceedings of the International Zurich Seminar on Communications, pp. 59-62. 2012.#
[13] Wang, Lele. "Polar coding for relay channels." In Information Theory (ISIT), 2015 IEEE International Symposium on, pp. 1532-1536. IEEE, 2015.#
[14] El Gamal, Abbas, and Young-Han Kim. Network information theory. Cambridge university press, 2011.#
[15] Khalili, Ramin, and Kavé Salamatian. "On the achievability of cut-set bound for a class of erasure relay channels: The non-degraded case." InProceedings of the Intl. Symposium on Information Theory and its Applications, pp. 10-13. 2004.#
[16] Şaşoğlu, Eren. "An entropy inequality for q-ary random variables and its application to channel polarization." In Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on, pp. 1360-1363. IEEE, 2010.#
[17] Şasoğlu, Eren, Emre Telatar, and Erdal Arikan. "Polarization for arbitrary discrete memoryless channels." In Information Theory Workshop, 2009. ITW 2009. IEEE, pp. 144-148. IEEE, 2009.#
[18] Soliman, Tamer HM, Fengfan Yang, and Saqib Ejaz. "Decode and Forward Polar Coding Scheme for Receive Diversity: A Relay Partially perfect retransmission for Half-Duplex Wireless Relay Channels." IET Communications (2016).#
[19] Wang, Lele. "Polar coding for relay channels." In 2015 IEEE International Symposium on Information Theory (ISIT), pp. 1532-1536. IEEE, 2015.#
