|
1.INTRODUCTIONIn recent years, the demand for higher capacity terrestrial wireless communication has increased because of the widespread use of mobile terminals. Similarly, in satellite communications, the demand for a large communication capacity has been progressively increasing because of the performance improvement of sensors and cameras. Currently, satellite RF communications are mainly used. However, high capacity transmission (i.e., over 10 Gbps) is difficult in satellite RF communication due to the bandwidth limitation. As an alternative, free space optics in satellite communications are attracting much attention [1]. Because the laser light of the 10-THz band is used for the communication medium, it is possible not only to greatly increase the communication capacity, but also to downsize and increase the power savings of the apparatus. Furthermore, because the laser light has strong directivity and uses a very narrow beam, there are fewer possibilities of eavesdropping and interference. However, because of the directivity of the laser beam, highly accurate pointing and tracking mechanisms are necessary at both the transmitter and the receiver. In the satellite laser transmission, received power loss occurs because of this tracking error, in addition to air turbulence between ground and satellite terminals. Therefore, forward error correction technology with powerful error correction is indispensable. In 2014, satellite laser communication at 10 Mbps was achieved between the Space Optical Communications Research Advanced Technology Satellite (SOCRATES), a small satellite equipped with a small optical transponder (SOTA), and the ground station [2] with using low density generator matrix (LDGM) code [3]. On the other hand, polar code is a kind of linear channel code proposed by E. Arıkan in 2008 [4]. It is strictly proven that polar code with a code length N asymptotically approaches the channel capacity, in which the decoding complexity is relatively low in O(N log N). It has recently been reported that polar code using successive cancellation list decoding (SCLD) [5] with cyclic redundancy check (CRC) code at a relatively short code length outperforms turbo code [6] and LDPC code [7]. To obtain this strong error correcting ability, it is necessary to appropriately set frozen bits, which are dummy bits whose positions in a codeword are shared with the transmitter and the receiver. In polar code, arbitrary code rates can be composed by changing the number of frozen bits. When using the adaptive coding with polar code, the number of frozen bits becomes side information that should be negotiated between the transmitter and the receiver. However, because of the large delay and the received-power fluctuations, advanced two-way control for adaptive coding based on the instantaneous channel state is difficult to implement in satellite laser communication. Here, we found that one-way adaptive polar coding can be composed if the coding rate index is embedded in some of the frozen bits [8]. In this scheme, rate estimation and decoding can be simultaneously performed at the receiver. However, our previous study considered a terrestrial channel, and thus, the performance of a satellite laser channel was not considered. Therefore, in this paper, we propose a one-way adaptive polar coding scheme for satellite laser communication in which the coding rate information is embedded in a section of frozen bits; the rate estimation and decoding at the receiver are conducted using SCLD. The performance of the proposed scheme is evaluated using numerical simulations. In the following section, the structure of polar code is reviewed. The proposed one-way adaptive polar coding scheme is introduced in Section 3. The numerical results are given in Section 4. Conclusions are given in Section 5. 2.POLAR CODE2.1Construction of polar codeIn what follows, the vector consisting of (a0, a1,…, aN−1) is denoted by , and let the (i, j) component of matrix A be ai, j. To generate the codeword for polar code, we use a generator matrix with a size that is an integer power of 2. Here, if the code length N is set to N = 2n, the generator matrix GN can be calculated recursively by where IN is an N × N unit matrix, the initial matrix G2 is , and RN is an N × N substitution matrix called the reverse-shuffle matrix, which is defined by Moreover, ⊗ denotes the Kronecker product. Here, if p × q matrix A and s × t matrix B are given, then the Kronecker product of A and B is given by Then, the polar codeword , xi ∈ {0, 1} is obtained using GN from the information sequence , u ∈ {0,1} via the following equation. The encoder structure corresponding to GN (N = 8) is shown in Figure 1. In polar code, the channel capacity of the communication path corresponding to information bits is polarized to 0 or 1; this method is called channel polarization. When the information bits are not assigned in with a low capacity close to 0, an arbitrary channel coding rate can be easily constructed by changing the number of unassigned bits. These bits are called frozen bits and are shared between the transmitter and the receiver. Assuming an information bit length K and a frozen bit length (N – K), the coding rate R becomes R = K/N. Various methods of determining the frozen bits have been proposed [4, 9, 10]. In the determination method using the Bhattacharya parameter [9], the communication paths are assumed to be binary erasure channels, and frozen bits are decided based on the upper bound of the error probability of each bit. In the Monte-Carlo method, frozen bits are decided based on the error rate of each bit, which is calculated by a computer simulation in advance [10]. 2.2Successive cancellation list decodingWe first introduce successive cancellation decoding (SCD), which is the basis of SCLD. SCD is a decoding method using polar code [4]. In SCD, it is assumed that decoding until (i – 1) bits of is successful, and that ûi decoding is sequentially conducted from i = 0. The decoding calculation is performed based on the log likelihood ratio (LLR), and the LLR of can be recursively calculated using the following equation [10]. where φ and λ satisfy 0 ≤ φ ≤ 2λ and 0 ≤ λ ≤ n, respectively. and indicate the even- and odd-numbered elements of , respectively, and fu, fl are defined by the following equations. Moreover, the initial value is obtained using the following equation using codeword xi and received value yi. where p(yi|xi = b) represents the conditional probability that yi is received when the transmit bit is b = {0,1}. Then, based on the calculated using (5) to (8), the decision is made according to equation (10) to obtain the decoding result where F is a set of frozen bits known to the receiver in advance. On the other hand, in SCLD [5], the decoder preserves the decoding candidates up to the list size of Lmax in the process of SCD, according to the Lmax maximum LLRs, which are equivalent to minimum path metrics. Figure 2 shows an example of SCLD decoding. The path metric for the i-th bit in path l is calculated by where ûj[l] and are the decoded bit ûj and LLR in the l-th path, respectively. The selection of surviving paths is performed for increasingly smaller values of . In Figure 2, three paths are selected and stored using [11]. 3.PROPOSED ADAPTIVE CODING SCHEMEAs described above, the encoding gain of polar code is obtained by utilizing the frozen bits known to both the transmitter and the receiver. Exploiting the frozen bits, a one-way adaptive multi-rate polar code transmission method without two-way control can be devised. In this method, the rate information is embedded in the frozen bits [8]. To simplify the study, we consider a two-mode adaptive downlink transmission method in what follows. At the transmitter, the following process is conducted.
At the receiver, rate estimation and decoding are jointly conducted. Let be the received codeword through the channel when is transmitted. The receiver first assumes either of the transmitted rates R1 or R2, and decoding is conducted based on the assumed rate. In SCLD decoding, (5) to (10) are conducted, where in the bit detection of (10), the index bits are used for rate estimation bits in the frozen bits. Then, the LLRs of the quasi-maximum likelihood and sequence estimation for R1 and R2 are obtained. Finally, the coding rate is determined using the LLRs. In particular, the path metric of each rate Rk (k = 1.2) is calculated by where E is the position of rate estimation bits, and and are the decoded bit ûi and LLR Li at rate Rk, respectively. Then, the Rk value with smaller is selected as the transmitted mode. 4.NUMERICAL RESULTSWe calculated the characteristics of the proposed adaptive polar code and compared it to the conventional single-rate polar code using computer simulations. Figure 4 shows the system block diagram of the proposed adaptive polar code transmission method. Table 1 shows the simulation parameters. Frozen bits for each rate are determined using the modified Monte-Carlo method [12], where the frozen bits are selected by the advanced bit error rate calculation, whereas the frozen bit order is uniquely determined from a frozen bit vector to be applied to any code rates. ε = 3 is used, as (000) and (111) are used for R1 and R2, respectively. The satellite laser channel fluctuates because of air scintillation and pointing/tracking errors, resulting in a burst error. This channel is modeled as a time-correlated gamma-gamma disturbance channel [13, 14]. Therefore, we assume a gamma-gamma distribution channel based on the Bykhovsky formula [15]. Table. 1Simulation parameters.
First, we evaluate the rate estimation performance at the receiver. Figures 5 and 6 show the block error rate (BLER) of the proposed method with single-rate polar code, and the rate estimation error rate, respectively. Here, the rate of the proposed method is fixed at 1/2 or 1/8, and the decoding performance is evaluated. Figure 5 confirms that almost the same BLER is obtained using the proposed method for single-rate transmission. In Figure 6, the rate estimation error occurs in the low SNR region only when 1/2 code is transmitted, because of the relatively high code rate. However, the degradation is negligible, as shown in Figure 5. Next, Figure 7 shows the throughput characteristics of the proposed method, where the transmission rate is adaptively selected based on the estimated receiver SNR calculated based on satellite orbit, etc. At the receiver, the joint rate estimation and decoding described in Section 3 is conducted. The results show that the proposed scheme can achieve the higher throughput of two single-rate transmissions. Therefore, one-way multi-rate transmission of polar code could be realized. 5.CONCLUSIONSIn this paper, we proposed an adaptive channel coding scheme using polar code and SCLD for satellite laser communications; results showed good performances in terms of BLER, rate estimation error, and throughput in the satellite-to-ground channel. In the proposed scheme, by embedding the rate estimation bits into the polar codeword, whose frozen bit patterns are shared between the transmitter and the receiver, one-way adaptive transmission can be realized. At the receiver, joint rate estimation and decoding are conducted based on the received codeword. Using this scheme, adaptive polar code transmission that can follow the predicted receiver SNR, data QoS, or data queue is realized. REFERENCESFuse T., Akioka M., Kolev D., Koyama Y., Kubo-oka T., Kunimori H., Suzuki K., Takenaka H., Munemasa Y., and Toyoshima M.,
“Development of a Breadboard Model of Space Laser Communication Terminal for Optical Feeder Links from Geo,”
in Proc. SPIE International Conference on Space Optics (ICSO2016),
1
–4
(2016). Google Scholar
Phung D.-H.,
“Telecom & Scintillation First Data Analysis for DOMINO – Laser Communication between SOTA, Onboard Socrates Satellite, and MEO OGS,”
in Proc. IEEE ICSOS,
1
–7
(2015). Google Scholar
V. Roca and C. Neumann,
“Design, Evaluation and Comparison of Four Large Block FEC Codecs, LDPC, LDGM, LDGM Staircase and LDGM Triangle, plus a Reed-Solomon Small Block FEC Codec,”
Res. Rep., 5225 1
–24
(2006). Google Scholar
Arıkan E.,
“Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels,”
IEEE Transactions on Information Theory, 55
(7), 3051
–3073
(2009). https://doi.org/10.1109/TIT.2009.2021379 Google Scholar
Tal I., Vardy A.,
“List Decoding of Polar Codes,”
in Proc. IEEE Information Theory Society,
2213
–2226
(2015). Google Scholar
Berrou C.,
“Near Shannon Limit Error-correcting Coding and Decoding: Turbo-codes,”
in Proc. IEEE Int’l Conf. on Commun,
1064
–1070
(1993). Google Scholar
Niu K., Chen K.,
“CRC-Aided Decoding of Polar Codes,”
in Proc. IEEE Communications Society,
1089
–77898
(2012). Google Scholar
Ito K., Okamoto E., Takenaka H., Kunimori H., Toyoshima M.,
“A Study on Adaptive Coded Transmission Scheme using Polar Code,”
IEICE-RCS2017-282, 117
(396), 79
–83
(2018). Google Scholar
Li H., Sun Y.,
“A Practical Construction Method for Polar Codes in AWGN Channels,”
in Proc. IEEE Communications Letters,
223
–226
(2013). Google Scholar
Trifonov P.,
“Efficient Design and Decoding of Polar Codes,”
in Proc. IEEE Transactions on Communications,
3221
–3227
(2012). Google Scholar
Stimming A. B., Parizi M. B.,
“LLR-Based Successive Cancellation List Decoding,”
in Proc. IEEE Signal Processing Society,
5165
–5179
(2015). Google Scholar
Watanabe Y., Suyama S., Nagata S., Miki N.,
“Frozen Bit Determination Method Based on Error Rate,”
in IEICE-RCS2016-159,
35
–39
(2016). Google Scholar
Anguita J., Djordjevic I., Neifeld M., and Vasic B.,
“Shannon Capacities and Error-correction Codes for Optical Atmospheric Turbulent Channels,”
J. Optical Networking, 4
(9), 586
–601
(2005). https://doi.org/10.1364/JON.4.000586 Google Scholar
Al-Habash M. A., Andrews L. C., and Phillips R. L.,
“Mathematical Model for the Irradiance Probability Density Function of a Laser Beam Propagating through Turbulent Media,”
Journal of Optical Networking, 40
(8), 1554
–1562
(2001). Google Scholar
Bykhovsky D.,
“Simple Generation of Gamma, Gamma–gamma, and K Distributions with Exponential Autocorrelation Function,”
Journal of Lightwave Technology, 34
(9), 2106
–2110
(2016). https://doi.org/10.1109/JLT.2016.2525781 Google Scholar
|