Research Article  Open Access
Wei Yu, Fusheng Zhu, Jun Wu, Rui Wang, Haoqi Ren, Zhifeng Zhang, "HARQChaotic: Analog Chaotic Code Applied in HARQ Scheme of Wireless Communication System", Wireless Communications and Mobile Computing, vol. 2019, Article ID 3728127, 13 pages, 2019. https://doi.org/10.1155/2019/3728127
HARQChaotic: Analog Chaotic Code Applied in HARQ Scheme of Wireless Communication System
Abstract
This paper proposes a novel symbollevel combining hybrid automatic repeat request (HARQ) scheme based on analog chaotic code and named HARQChaotic. The transmitter of HARQChaotic adopts analog chaotic code to encode Quadrature Amplitude Modulation (QAM) symbols of retransmission packets to combat fading and noise. As the analog chaotic code can only handle sources with amplitudes in the range of [0.5, 0.5], QAM symbols must be scaled into this range. We derived the optimal scaling factor through theoretical analysis. A joint algorithm combining with novel soft chaotic decoder and novel soft QAM demapper is proposed for the receiver to enhance the performance of the whole communication system. We implemented HARQChaotic with LDPC codes and 16QAM/64QAM to carry out simulations in both AWGN channels and multipath fading channels. Massive simulation results demonstrate that the proposed HARQChaotic has gain over traditional HARQChase combining (HARQCC) scheme in block error rate (BLER) performance.
1. Introduction
As wireless channel is time varying and subject to fading, additive noise, and interference [1], hybrid automatic repeat request (HARQ) techniques that combine both forwarderrorcorrecting (FEC) codes and ARQ are often adopted to improve spectrum efficiency and transmission reliability. Now HARQ has been widely used by many wireless communication systems and standards, such as 3GPP longterm evolution (LTE) [2], IEEE 802.16e WiMAX [3–5], IEEE 802.11 wireless localarea networks (WLANs) [6], etc. There are mainly two types of HARQ, which are HARQChase combining (HARQCC) [7] and HARQ incremental redundancy (HARQIR) [8]. In HARQCC system, the transmitter sends the same source packet repeatedly in retransmission rounds; then the receiver combines retransmission packets in symbollevel according to maximalratio combining (MRC) to carry out demodulation and FEC decoding. In HARQIR system, the transmitter varies the FEC coding rate and modulation constellation in retransmission packets, which are redundancy bits punctured out from the original transmission packet. The receiver of HARQIR combines retransmission packets in bitlevel. Previous literatures show that the performance of HARQIR is better than HARQCC, but the communication system of HARQIR is much more complicated [9], so HARQCC is more widely used in many wireless communication systems.
As we know the channel fading and noise affect QAM symbols directly, while the FEC coding of HARQCC combat fading and noise is indirectly in bitlevel. So an intuitive question is whether these QAM symbols can be protected directly in symbollevel. In view of this question, this paper proposes a novel symbollevel HARQ scheme based on analog chaotic code and named HARQChaotic. Many literatures indicate that analog chaotic code has better performance than linear analog codes, especially in the middle and high channel SNR [10–13]. However, previous studies on analog chaotic code only focus on analogvalued sources. This paper extends it to digitalvalued sources: the proposed HARQChaotic uses analog chaotic code to encode digital QAM modulation symbols of retransmission packets to combat fading and noise directly.
Traditional analog chaotic decoding algorithms work in the way of hard decision, which discard the probability information of the decoding value. If these traditional decoding algorithms are applied to the proposed HARQChaotic system directly, the lost probabilities will reduce the overall system performance. To solve this problem, we propose a soft joint algorithm combining with a novel soft chaotic decoder and a novel soft QAM demapper. The soft chaotic decoder does not make any hard decision but outputs all of the potential decoding values and their corresponding probabilities to the subsequent soft QAM demapper, which outputs log likelihood ratio (LLR) to FEC decoder to recover source bits.
The analog chaotic code can only handle realvalued sources with amplitudes in the range of [0.5, 0.5]; QAM symbols must be scaled into this range before encoding. How to choose the optimal scaling factor is a tradeoff problem. We propose a theoretical method to find the optimal scaling factor by minimizing the noise power of the decoding value after soft chaotic decoder and inverse scaling.
Main contributions of this paper are as follows.
(1) We propose a novel symbollevel HARQ scheme based on analog chaotic code named HARQChaotic, which can protect QAM symbols of retransmission packets to combat fading and noise directly.
(2) We propose a soft joint algorithm combining with a novel soft chaotic decoder and a novel soft QAM demapper, which can improve the performance of the whole communication system greatly.
(3) Through theoretical analysis, we derived the optimal scaling factor to scale QAM symbols into the range of amplitudes that the analog chaotic code can handle.
The organization of the rest of this paper is as follows. Section 2 discusses related works of analog chaotic code and combining schemes of HARQ. Section 3 presents the system model of HARQChaotic. Section 4 describes the detailed design of HARQChaotic, which includes parts. Section 4.1 introduces the analog chaotic encoder and analyses shortcomings of traditional hard decision decoding algorithms. Section 4.2 describes the proposed soft joint algorithm of soft chaotic decoder and soft QAM demapper. Section 4.3 derives the optimal scaling factor through theoretical analysis. We implement HARQChaotic with LDPC code and 16QAM/64QAM modulation to carry out simulations in Section 5. Simulation results of HARQChaotic and HARQCC are evaluated and compared under AWGN channels and multipath fading channels. Section VI is the conclusion of this paper.
2. Related Works
2.1. Analog Chaotic Code in Wireless Communication Systems
Due to the significant advantage of wideband characteristics provided by chaotic nonlinear signals, a large number of chaosbased communication systems have been proposed exploiting the properties of chaotic waveforms [14], especially in the areas of secure communications [15–17] and spreadspectrum modulation [18–20].
Analog chaotic code is an important application of chaotic signals in wireless communication systems, which is first proposed by Chen and Wornell [12]. The encoder of analog chaotic code treats a single timediscrete, realvalued source symbol as the initial state, and then uses nonlinear chaotic function to generate subsequent states iteratively. As we know, a chaotic system has the butterfly effect phenomenon: two initial states that have very little difference can be totally different in subsequent states. Since the butterfly effect has the same function as the distance expansion in digital coding, therefore, the analog chaotic code uses the initial and subsequent states as codewords to protect the source symbol.
Early research on analog chaotic code focused on efficient decoding algorithms to estimate source symbols from additive white Gaussian noise (AWGN) channel, such as the MaximumLikelihood (ML) decoder [21], the ExpectationMaximization (EM) algorithm [22], the Bayesian estimation [23, 24], etc.
Recently, some new encoding methods based on analog chaotic code have been proposed. For example, Jing Li proposed Chaotic Analog Turbo (CAT) code [25–27], which works like traditional Turbo codes to explore two parallel but directionreversed chaotic codeword sequence to strengthen the protection of source symbol. Reference [28] proposed a novel analog chaotic code and applies it to pseudoanalog video wireless communications. Reference [29] proposed a novel hybrid digitalanalog code based on analog chaotic code and rateless Spinal code [30], which greatly improves the MSE performance compared with previous pure analog chaotic codes. However, the above papers only apply analog chaotic code to analog (or pseudoanalog) communications systems; this paper extends it to digital communications systems.
2.2. Combining Schemes of HARQ
The combining scheme is very important for the performance of a HARQ system. The proposed soft joint algorithm of this paper is essentially a novel symbollevel combining scheme. We investigated a variety of existing symbollevel combining schemes here. Reference [31] uses a constellation rearrangement with symbol combining to enhance the HARQ performance. The receiver at first combines QAM symbols before demodulation and then demodulates combined symbols with new constellation. Reference [32] investigated three types of combining scheme of HARQ, which are the distancelevel combining scheme (DLC), the maximalratio combining scheme (MRC), and the bitlevel combining scheme (BLC). Simulation results demonstrated that MRC and DLC have the same performance, which are better than BLC. Reference [33] proposed a concatenationassisted symbollevel combining (CASLC) scheme of HARQCC for MIMO systems based on QR decomposition. CASLC scheme has the same performance as MRC scheme but only requires very small memory size. Reference [34] investigated the performance of symbollevel combining (SLC) and BLC schemes of HARQCC and gave a conclusion that SLC outperforms BLC in the entire SNR region and can even achieve a better throughput than HARQIR at the high SNR region.
3. System Model and Preliminaries
Figure 1 shows the diagram of the proposed wireless communication system. We use adaptive modulation and coding (AMC) [35, 36] to adapt the timevarying channel condition and use the proposed HARQChaotic scheme to enhance the transmission reliability. In AMC scheme, the transmitter chooses the most appropriate PHY mode to match the estimated channel state information (CSI). There are PHY modes with different modulation constellations and FEC coding rates that can be selected by the AMC of IEEE 802.11n, which are listed in Table 1. The IEEE 802.11n standard has two models for FEC codes, which are interleaved convolutional codes (the mandatory model) and low density parity check (LDPC) codes (the optional model). Due to the good performance and wide application of LDPC, we choose it as the FEC codes in this paper.

As we know the higher the modulation constellation that is used, the shorter the expected transmission time will be, but the less likely the delivery will succeed within the frame retry limit [37], so HARQ scheme is often adopted in the case of high order modulation. For this reason, this paper only considers two high order modulation constellations of 16QAM and 64QAM, that is, mode to mode of Table 1. As too many retransmissions can cause long system delay and low spectrum efficiency, many realistic wireless communication systems adopt limited number of retransmission rounds, which is called truncated HARQ (THARQ). In this paper, we only consider the number of retransmission rounds to be and .
Orthogonal frequency division multiplexing (OFDM) divides the whole available bandwidth into multiple orthogonal subcarriers, which is well suited to broadband systems in frequency selective fading environments. For this reason, OFDM is adopted in our system. There are total of subcarriers: of them carry actual QAM modulation symbols and the rest subcarriers carry pilots which are used for phase tracking and channel estimation. The realization of OFDM is Inverse Fast Fourier Transformation (IFFT) at the transmitter and Fast Fourier Transformation (FFT) at the receiver.
The entire data flow is described as follows. The Cyclic Redundancy Check (CRC) module generates CRC check bits and added them at the tail of the source bits packet. FEC encoder and QAM mapper work as the traditional way to encode and modulate source bits into QAM symbols. Then analog chaotic encoder encodes each plane (I or Q plane) of scaled QAM symbols to realvalued chaotic codewords. (the analog chaotic code in this paper can be regarded as a kind of systematic rateless codes, which can generate infinite number of codewords.) Two realvalued chaotic codewords corresponding to a QAM symbol are combined into one complexvalued chaotic codeword. Suppose a scaled QAM symbol is , the coding rate of analog chaotic code is . Then realvalued codewords of and are generated from the I and Q plane, respectively. After combining, we get complexvalued codewords of as follows:
Then is allocated to the original transmission packet of , is allocated to the first retransmission packet of is allocated to the th retransmission packet of . IFFT transforms these chaotic retransmission packets from frequency domain to time domain and outputs them to the wireless channel. After sending a packet, the transmitter waits for the feedback (ACK/NAK) from the receiver. When the receiver receives a packet, it transforms the packet from time domain to frequency domain using FFT at first and then tries to recover it. The recovery process includes channel compensation, soft chaotic decoding, inverse scaling, soft QAM demapping, and FEC decoding. If the packet is successfully recovered (CRC checking is correct), the receiver sends a HARQ ACK signal to the transmitter; otherwise a HARQ NAK signal is sent.
The recovery process at the receiver is divided into two cases according to whether the packet is an original transmission packet or a retransmission HARQChaotic packet. Case 1: the packet is an original transmission packet. The QAM demapper and the FEC decoder work in the traditional way to process this packet in sequence. If the source bits cannot be decoded correctly, this packet is saved for the combining of next retransmission rounds. Case 2: the packet is a retransmission packet with analog chaotic encoding. The soft chaotic decoder combines all of the retransmission packets and the original transmission packet together to output all of the potential decoding values and their corresponding probabilities. Then the soft QAM demapper processes the inverse scaled decoding values and their corresponding probabilities to output LLRs to the FEC decoder. If the source bits cannot be decoded correctly, this packet is also saved for the combining of next retransmission rounds.
4. The Design of HARQChaotic
4.1. The Analog Chaotic Encoder and the Analysis of Traditional Hard Decision Decoding Algorithms
Chen et al. [12] first proposed analog chaotic code based on tent map function. Other papers inspired by [12], such as [13, 25, 27, 29], also use tent map function to design and analyze new analog chaotic codes. Due to the good performance and extensive use of tent map function, we also use it in this paper.
A rate analog chaotic code takes in a single source symbol at one time and then encodes it to realvalued chaotic codewords, which are [13] where , and its sign () are generated from the previous codeword using the tent map function , that is,where is defined as
The inverse ten map function is defined as
After AWGN channel, the receiver gets chaotic codewords with noise, which are , i.e., where is zero mean additive white Gaussian noise with variance .
Traditional hard decision decoding algorithms estimate from [21, 25]. Key steps are as follows.
(1) We define as the estimation of from , that is, where and are defined as
(2) By differentiating the sum item of (6) with respect to and letting the derivative equal to , we can get and its sign as follows:
(3) and can be obtained from the above equation directly; then the source symbol (or ) can be decoded as
As we can see, the recovery of signs is a key point in the last step. In fact, these signs represent the quantization interval that belongs to. Suppose the value of is ; we can get chaotic codewords and signs as , , , , , . Figures 2(a) and 2(b) show curves of as a function of . From these two figures, we can get the following information. (1) determines that belongs to the interval of . (2) and determine that belongs to the interval of . (3) , and determine that belongs to the interval of , etc. [29].
(a) Curve of (vertical axis) as a function of (horizontal axis)
(b) Curve of (vertical axis) as a function of (horizontal axis)
Figure 3 illustrates the importance of these signs for the decoding mean square error (MSE) performance of analog chaotic code where the channel is AWGN and the coding rate is . As we can see, a very low decoding MSE can be obtained if the decoder knows all signs correctly. Even only one sign is given, the decoding MSE can also be highly reduced. Unfortunately, these signs cannot be recovered efficiently in practical systems, and false signs will misjudge the interval of , thereby reducing the decoding performance of analog chaotic code, and then reduce the performance of the overall HARQChaotic system.
4.2. The Soft Joint Algorithm of Soft Chaotic Decoder and Soft QAM Demapper
4.2.1. The Novel Soft Chaotic Decoder
In view of the above shortcoming of traditional analog chaotic decoding algorithms, we propose a soft joint algorithm combining a novel soft chaotic decoder and a novel soft QAM demapper. The soft chaotic decoder does not estimate signs or determine the interval that locates in but outputs all decoding values of in every interval and their corresponding probabilities. The mission of the proposed soft chaotic decoder is to maximize the probability of , i.e.,
As this paper only considers and retransmission rounds that means . When , the above equation can be rewritten as
By differentiating the above equation with respect to and letting the derivative equal to , we can get two possible decoding values of , which are
Applying these two decoding values to (11), we can get their corresponding probabilities, i.e., and .
When , we can get possible decoding values of , which are
Similarly, we can get the corresponding probabilities of , , , and when applying these decoding values to (10).
The soft chaotic decoder outputs all these possible decoding values of and their probabilities , which will be processed by the soft QAM demapper.
4.2.2. The Novel Soft QAM Demapper
We take the situation of 16QAM modulation and retransmission rounds as an example. Figure 4 shows the soft demapping process of the first bit of one 16QAM symbol. The black spots are constellation positions. We use to denote the complex values of them. Since each plane (I or Q) of one QAM symbol has potential realvalued decoding values, the soft chaotic decoder outputs complexvalued potential decoding values (denoted by ) and their corresponding probabilities (denoted by , respectively), which are represented by squares in Figure 4. Meanwhile, we use to denote probabilities of sending the th constellation point and receiving at the receiver, respectively. The black spots on the right side indicate that the first bit is . In contrast, the black spots on the left side indicate that the first bit is . We use and to denote probabilities of the first bit equal to and , respectively. The calculation of is as follows:
As we can see, consists of items added together. Each item represents one of the complexvalued decoding values output from the soft chaotic decoder. Let us take the first item as an example to illustrate. denotes the sum of probabilities that the transmitter sends the constellation points on the right side of Figure 4 and the receiver receives . Each transmitted constellation point and the received are connected with a solid line in Figure 4. The noise power additional to is denoted by , respectively, which can be obtained through pilots.
Similarly, we can write as follows:
The LLR of the first bit can be obtained as
The LLRs of other bits of one 16QAM symbol can be calculated in a similar method.
4.3. The Optimal Scaling Factor
In order to derive the optimal scaling factor, we consider a simple communication system shown as Figure 5. The wireless channel is AWGN. Sources to be transmitted are one plane (I or Q) of 16QAM/64QAM symbols. We set the unique amplitudes of one plane of 16QAM symbols to be and the 8 unique amplitudes of one plane of 64QAM symbols to be . As mentioned before, we have to scale these amplitudes into the range of before analog chaotic encoding. It is very clear that any scaling factor larger than can scale / into this range. But how to choose the most appropriate scaling factor is a tradeoff problem. As mentioned before, the soft chaotic decoder outputs all potential decoding values, where, only one value locates in the correct interval. Our solution is to find the scaling factor that minimizes the noise power of the decoding value in the correct interval after soft chaotic decoder and inverse scaling.
We take the situation of retransmission rounds (the coding rate of analog chaotic code is , and one plane of QAM symbol generates chaotic codewords.) and 16QAM modulation as an example to carry out the following analysis. Table 2 lists notations that will be used. Suppose there are QAM symbols that need to be transmitted; each symbol is a unique position of the 16QAM constellation. After scaling, the unique amplitudes of each plane are . After chaotic encoding, we get pairs of unique realvalued chaotic codewords (totally realvalued chaotic codewords) of one plane, which are , , , . The average power of these realvalued chaotic codewords is

Suppose is an arbitrary value of . After scaling and analog chaotic encoding, the transmitter sends realvalued chaotic codewords of to the AWGN channel. Then the receiver gets them with noise as where the average power of and are and , respectively.
After soft chaotic decoder, the decoding value in the correct interval is
Lemma 1. After soft analog chaotic decoding, the average power of noise is reduced to be and the proof is shown in the appendix.
After inverse scaling, the receiver gets output in the correct interval as
The average power of noise is
In order to get the minimum value of , we differentiate the above equation respective to and let the derivative equal to . Then we get the optimal scaling factor, that is, .
Similarly, we give other optimal scaling factors directly as follows. In the condition of retransmission rounds of 16QAM modulation, the optimal scaling factor is also . In the condition of and retransmission rounds of 64QAM modulation, both of the optimal scaling factors are .
5. Performance Evaluation
We evaluated the block error rate (BLER) performance of the proposed HARQChaotic scheme and the traditional HARQCC scheme over AWGN channel and IEEE 802.11 fading channel model A. The latter channel is a typical office environment for the NonLineofSight (NLOS) multiple paths scenario; the detailed specifications can be found in [38, 39]. The multipath has ten taps, the the rootmeansquare (rms) delay spread is set to ns. As mentioned before we consider and retransmission rounds for mode to mode of IEEE 802.11n PHY, that is, coding rates of , for 16QAM and coding rate of , , for 64QAM. The number of LDPC coded bits of one packet is set to be for 16QAM and for 64QAM. For every integer SNR, the transmitter sends data packets. The channel equalization is implemented in frequency domain; the number of coefficients of equalization filter is equal to the FFT size, that is, .
Figures 6–9 show the BLER performance comparison in 16QAM modulation (the curves labeled as “HARQChaotic” in Figures 7–13 represent HARQ schemes based on soft joint algorithm). There are three different HARQ schemes in Figure 6, which are (1) HARQChaotic scheme based on the traditional hard decision chaotic decoder (indicated by “HARQChaotic (hard)”), (2) HARQChaotic scheme based on the proposed soft joint algorithm (indicated by “HARQChaotic (soft)”) and (3) the traditional HARQCC scheme (indicated by “HARQCC”). As we can see, “HARQChaotic (Soft)” has a huge gain compared with “HARQChaotic (Hard)”, which proves the effectiveness of the proposed soft joint algorithm. From Figures 6–9 we can also see that regardless of what kind of scenarios, the proposed HARQChaotic scheme can always have gain comparing with traditional HARQCC scheme. Figures 10–13 show the BLER performance comparison in 64QAM modulation. We can see that when the coding rate is , the gain is about . When the coding rate is and , the gain can be as large as . The above massive simulation results under different scenarios (different LDPC coding rate, different modulation constellations, different retransmission rounds, and different wireless channels) demonstrate that the proposed HARQChaotic scheme has a stable performance gain comparing with HARQCC scheme. The gain comes from the following factors. HARQCC is equivalent to using repeated linear code to protect QAM symbols, while HARQChaotic uses nonlinear chaotic code. A large number of previous studies [10–13] have shown that analog chaotic code can bring obvious gain compared with linear codes in many scenarios, especially for analogvalued source. When the sources of analog chaotic code are digital QAM symbols, the traditional hard decision chaotic decoding algorithm does not work very well. However, the proposed soft joint algorithm can solve this problem perfectly, which makes the analog chaotic code very suitable for QAM symbols.
6. Conclusion
This paper proposes a novel symbollevel HARQ scheme, HARQChaotic based on analog chaotic code. In the past research works, the analog chaotic decoding algorithm is all hard decision, which discards the probability information of the decoding output. The lost probabilities will reduce the performance of the HARQChaotic communication system. We proposed a soft joint algorithm combining with a novel soft chaotic decoder and a novel soft QAM demapper to solve this problem. An optimal scaling factor is derived to scale QAM symbols into the amplitude range that analog chaotic code can handle. We implemented HARQChaotic with mode to mode of IEEE 802.11n PHY and simulated the BLER performance over AWGN channels and multipath fading channels. Massive simulation results demonstrate that HARQChaotic has about gain comparing with traditional HARQCC.
Appendix
Suppose the source symbol vector is , and is an arbitrary symbol of this vector. After analog chaotic encoding with coding rate of , we get codewords of , where
After AWGN channel, the receiver receives codewords of with Gaussian noise,where and are random Gaussian noises with zero mean and variance (or power) of .
After decoding, we can get the estimated source symbol in the correct interval as follows:
So the additive noise of the estimated source becomes or . These two kinds of noise are still belonging to Gauss distribution, and the powers of them are both .
Data Availability
The data used to support the findings of this study are available from the author Wei Yu (2014yuwei@tongji.edu.cn) upon request.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Authors’ Contributions
Wei Yu contributed to the simulation program and part of the writing of this paper. Fusheng ZHU contributed to the theoretical analysis and revision work after reviewing of this paper. Jun Wu contributed to the conceiving, framework, and part of the writing of this paper. Rui Wang, Zhifeng Zhang, and Haoqi Ren contributed to the guidance of the simulation program and the revision work before submission of this paper.
Acknowledgments
This work was supported in part by the National Science Foundation China under Grant 61571329, Grant 61831018, and Grant 61631017 and Guangdong Province Key Research and Development Program Major Science and Technology Projects under Grant 2018B010115002.
References
 H. Cui, C. Luo, K. Tan, F. Wu, and C. W. Chen, “Seamless rate adaptation for wireless networking,” in Proceedings of the Seamless Rate Adaptation for Wireless Networking, MSWiM, pp. 437–446, October 2011. View at: Publisher Site  Google Scholar
 S. Sesia, I. Toufik, and M. Baker, LTE  The UMTS Long Term Evolution: From Theory to Practice, Wiley, 2009.
 J. Andrews, A. Ghosh, and R. Muhamed, Fundamentals of WiMAX, Prentice Hall, 2007.
 EEE Std 802.162004, IEEE standard for local and metropolitan area networks, Part 16: air interface for fixed broadband wireless access systems, Oct 2004.
 IEEE Std 802.16e2005, IEEE Standard for Local And Metropolitan Area Networks, Part 16: Air Interface for Fixed Broadband Wireless Access Systems, Amendment 2: Physical And Medium Access Control Layers for Combined Fixed And Mobile Operation in Licensed Band, Feb 2006.
 IEEE 802.11n, Wireless LAN medium access control (MAC) and physical layer (PHY) specifications: amendment 5  enhancements for higher throughput, Sept 2007.
 D. Chase, “A combined coding and modulation approach for communication over dispersive channels,” IEEE Transactions on Communications, vol. 21, no. 3, pp. 159–174, 1973. View at: Publisher Site  Google Scholar
 S. Lin, D. J. Costello, and M. J. Miller, “AutomaticRepeatRequest Error Control Schemes,” IEEE Communications Magazine, vol. 22, no. 12, pp. 5–17, 1984. View at: Publisher Site  Google Scholar
 D. Toumpakaris, J. Lee, A. Matache, and H.L. Lou, “Performance of MIMO HARQ under receiver complexity constraints,” in Proceedings of the 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008, pp. 1–5, Nov 2008. View at: Google Scholar
 K. Xie, J. Li, and Y. Liu, “Linear analog codes: The good and the bad,” in Proceedings of the 2012 46th Annual Conference on Information Sciences and Systems (CISS), pp. 1–6, March 2012. View at: Google Scholar
 Y. Liu, J. Li, and K. Xie, “Analysis of linear channel codes with continuous code space,” in Proceedings of the 2012 46th Annual Conference on Information Sciences and Systems, CISS 2012, pp. 1–6, March 2012. View at: Google Scholar
 B. Chen and G. W. Wornell, “Analog errorcorrecting codes based on chaotic dynamical systems,” IEEE Transactions on Communications, vol. 46, no. 7, pp. 881–890, 1998. View at: Publisher Site  Google Scholar
 K. Xie and L. Li (Tiffany), “Chaotic analog error correction codes: The mirrored baker’s codes,” in Proceedings of the GLOBECOM 2010  2010 IEEE Global Communications Conference, pp. 1–5, December 2010. View at: Publisher Site  Google Scholar
 G. Kaddoum, “Wireless chaosbased communication systems: a comprehensive survey,” IEEE Access, vol. 4, pp. 2621–2648, 2016. View at: Publisher Site  Google Scholar
 V. Lynnyk and S. Celikovský, “On the antisynchronization detection for the generalized Lorenz system and its applications to secure encryption,” Kybernetika, vol. 46, no. 1, pp. 1–18, 2010. View at: Google Scholar  MathSciNet
 M. Herceg, G. Kaddoum, D. Vranjes, and E. Soujeri, “Permutation index DCSK modulation technique for secure multiuser highdatarate communication systems,” IEEE Transactions on Vehicular Technology, vol. 67, no. 4, pp. 2997–3007, 2018. View at: Publisher Site  Google Scholar
 G. Kolumban, M. P. Kennedy, and L. O. Chua, “The role of synchronization in digital communications using chaos. II. Chaotic modulation and chaotic synchronization,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 45, no. 11, pp. 1129–1140, 1998. View at: Publisher Site  Google Scholar  MathSciNet
 G. Kaddoum, F.D. Richardson, and F. Gagnon, “Design and analysis of a multicarrier differential chaos shift keying communication system,” IEEE Transactions on Communications, vol. 61, no. 8, pp. 3281–3291, 2013. View at: Publisher Site  Google Scholar
 X. Min, W. Xu, L. Wang, and G. Chen, “Promising performance of a frequencymodulated differential chaos shift keying ultrawideband system under indoor environments,” IET Communications, vol. 4, no. 2, pp. 125–134, 2010. View at: Publisher Site  Google Scholar
 H. Yang, W. K. S. Tang, G. Chen, and G.P. Jiang, “System Design and Performance Analysis of Orthogonal MultiLevel Differential Chaos Shift Keying Modulation Scheme,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 63, no. 1, pp. 146–156, 2016. View at: Publisher Site  Google Scholar
 H. C. Papadopoulos and G. W. Wornell, “MaximumLikelihood Estimation of a Class of Chaotic Signals,” IEEE Transactions on Information Theory, vol. 41, no. 1, pp. 312–317, 1995. View at: Publisher Site  Google Scholar
 C. Pantaleon, L. Vielva, D. Luengo, and I. Santamaria, “Estimation of a certain class of chaotic signals: an embased approach,” in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), vol. 2, pp. 1129–1132. View at: Google Scholar
 C. Pantaleón, L. Vielva, D. Luengo, and I. Santamaría, “Bayesian estimation of chaotic signals generated by piecewiselinear maps,” Signal Processing, vol. 83, no. 3, pp. 659–664, 2003. View at: Publisher Site  Google Scholar
 C. Pantaleon, D. Luengo, and I. Santamaria, “Bayesian estimation of a class of chaotic signals,” in Proceedings of the 2000 International Conference on Acoustics, Speech and Signal Processing, vol. 1, pp. 193–196, Istanbul, Turkey. View at: Publisher Site  Google Scholar
 K. Xie, P. Tan, N. B. Chong, and J. Li, “Analog turbo codes: A chaotic construction,” in Proceedings of the IEEE International Symposium on Information Theory, 2009, pp. 894–898, 2009. View at: Google Scholar
 Y. Liu, J. Li, and K. Xie, “Efficient image transmission through analog error correction,” in Proceedings of the 2011 IEEE 13th International Workshop on Multimedia Signal Processing (MMSP), pp. 1–6, Oct 2011. View at: Google Scholar
 Y. Liu, J. Li, X. Lu, C. Yuen, and J. Wu, “A family of chaotic pure analog coding schemes based on baker’s map function,” EURASIP Journal on Advances in Signal Processing, vol. 2015, no. 1, pp. 1–18, 2015. View at: Google Scholar
 B. Tan, J. Wu, Y. Li, H. Cui, W. Yu, and C. W. Chen, “Analog Coded SoftCast: A Network Slice Design for Multimedia Broadcast/Multicast,” IEEE Transactions on Multimedia, vol. 19, no. 10, pp. 2293–2306, 2017. View at: Publisher Site  Google Scholar
 W. Yu, J. Wu, Y. Li, and B. Zhang, “A hybrid digitalanalog chaotic code,” IEEE Wireless Communications Letters, 2018. View at: Google Scholar
 J. Perry, P. A. Iannucci, K. E. Fleming, H. Balakrishnan, and D. Shah, “Spinal codes,” in Proceedings of the ACM SIGCOMM Conference Applications, Technologies, Architectures, and Protocols for Computer Communication, SIGCOMM '12, pp. 49–60, August 2012. View at: Publisher Site  Google Scholar
 Z. Zhao, L. Zhou, X. Zheng, and S.E. Park, “Enhanced constellation rearrangement for HARQ with symbol combining,” in Proceedings of the 2009 IEEE Mobile WiMAX Symposium, MWS 2009, pp. 11–15, USA, July 2009. View at: Google Scholar
 E. W. Jang, J. Lee, L. Song, and J. M. Cioffi, “An efficient symbollevel combining scheme for MIMO systems with hybrid ARQ,” IEEE Transactions on Wireless Communications, vol. 8, no. 5, pp. 2443–2451, 2009. View at: Publisher Site  Google Scholar
 E. W. Jang, J. Lee, H.L. Lou, and J. M. Cioffi, “On the combining schemes for MIMO systems with hybrid ARQ,” IEEE Transactions on Wireless Communications, vol. 8, no. 2, pp. 836–842, 2009. View at: Publisher Site  Google Scholar
 S. Park and S. Choi, “Performance of SymbolLevel combining and BitLevel combining in MIMO multiple ARQ systems,” IEEE Transactions on Communications, vol. 64, no. 4, pp. 1517–1528, 2016. View at: Publisher Site  Google Scholar
 M.S. Alouini and A. J. Goldsmith, “Adaptive modulation over Nakagami fading channels,” Wireless Personal Communications, vol. 13, no. 1, pp. 119–143, 2000. View at: Publisher Site  Google Scholar
 D. L. Goeckel, “Adaptive coding for timevarying channels using outdated fading estimates,” IEEE Transactions on Communications, vol. 47, no. 6, pp. 844–855, 1999. View at: Publisher Site  Google Scholar
 D. Qiao, S. Choi, and K. G. Shin, “Goodput analysis and link adaptation for IEEE 802.11 a wireless LANs,” IEEE Transactions on Mobile Computing, vol. 1, no. 4, pp. 278–292, 2002. View at: Publisher Site  Google Scholar
 J. Medbo, H. Hallenberg, and J. Berg, “Propagation characteristics at 5 ghz in typical radiolan scenarios,” in Proceedings of the IEEE 49th Vehicular Technology Conference, vol. 1, pp. 185–189, September 1999. View at: Google Scholar
 J. Medbo and P. Schramm, Channel models for hiperlan/2 1998. ETSI/BRAN doc, (3ERI085B).
Copyright
Copyright © 2019 Wei Yu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.