Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Highly secure non-orthogonal multiple access based on key accompanying transmission in training sequence

Open Access Open Access

Abstract

This paper proposes a high-security chaotic encrypted power sparse coding division (CE-PSCD) scheme for 7-core fiber based on non-orthogonal multiple access (NOMA) technology. The method utilizes power multiplexing to realize parallel transmission of two signals. Joint encryption of the four-dimensional region is realized using constellation mapping encryption, carrier frequency encryption, symbol scrambling, and sparse code scrambling. What we believe to be a new dimension for encryption of autonomously designed sparse codes is proposed. Meanwhile, we hide the chaotic key in training sequence (TS) to realize the co-transmission of the key and the message. A 70 Gb/s CE-PSCD signal transmission over 2 km of 7-core fiber is demonstrated experimentally. At the limit of forward error correction (FEC) ∼3.8 × 10−3, the difference in the encrypted sensitivity among different users at the equal power level is 0.36 dB, which means that the fairness of users will not be destroyed. The key space can reach 10134, with a bit error rate (BER) of about 0.5 for brute-force cracking at illegal receivers. As long as the key bits in the hidden TS are wrong by one bit, the BER stays around 0.5. The results show no significant attenuation of the signal before and after encryption at either high or low power, verifying the high-security performance of our proposed scheme.

© 2024 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement

1. Introduction

5 G technology is booming, bringing new changes, new scenarios and new demands. A new era of innovations has unfolded for the researchers. Cloud computing, artificial intelligence, big data, and industrial internet are birthed, driving the global Internet data traffic to grow [13]. These groundbreaking technologies are propelling the data traffic to unprecedented growth. As a result, higher requirements are placed on optical access network capacity and speed. Compared with other bandwidth access technologies, passive optical network (PON) has become a much-anticipated research hotspot in today's society under the advantages of long transmission distance, lower cost, lower energy consumption, and comprehensive coverage [4]. To cope with the exponentially growing data capacity, PON systems have been continuously upgraded, starting with time-division multiplexing (TDM), evolving to wavelength-division multiplexing (WDM), and then upgrading to orthogonal frequency-division multiplexing (OFDM) [5,6]. OFDM is one of the most widely used multicarrier transmission systems in the future, requiring strict orthogonality between all subcarriers in the operating frequency band. In orthogonal multiple access (OMA) technology, each user is assigned a different block of orthogonal resources, and the number of users accessed is limited as a result.

In contrast, non-orthogonal multiple access (NOMA) technology in 5 G is the key to solving this problem [7,8]. In NOMA, there are two main approaches, one is based on the code domain where each user is assigned a non-orthogonal extension code, such as the sparse code multiple access (SCMA) technique, enables overloading [9]. The other most common NOMA technique is power domain-based multiplexing, which allows multiple terminals to share the same resource block simultaneously [10]. In a traditional PON architecture, the difference between the two optical network units (ONUs) closest and farthest from the optical line terminal (OLT) device is nearly 4 dB, assuming that the OLT device supports 20 km of standard single-mode fiber coverage, which has a loss of about 0.2 dB/km. Obviously, in this traditional PON architecture, the performance varies greatly between different ONUs. The farther away from the OLT, the higher the user loss, and it is impossible to ensure fairness among users on different paths. To ensure maximum fairness for users, the power domain is multiplexed using NOMA technology to optimize the power allocation to ONUs on different paths. As shown in Fig. 1, according to the losses on different paths, higher power is allocated to users far away from the OLT, thus improving the performance of the entire PON access network architecture. At the transmitter side, various signals are superimposed in the power domain to form a composite signal containing multi-user information for transmission. At the receiving end, the successive interference cancellation (SIC) module needs to be installed to distinguish the signals of different users, and ultimately to realize the multiplexing of limited spectral resources, which focuses on assigning different power values to users with varying qualities of link on the same channel [11,12]. However, when SIC is used to distinguish signals from other users, a high-power signal is first recovered, likely to leak privacy among users [13,14].

 figure: Fig. 1.

Fig. 1. The architecture of NOMA.

Download Full Size | PDF

At the same time, the downlinks of fiber optic transmission systems all use broadcasting, which is susceptible to external eavesdropping, and its security is worth considering. With the increasing capacity of fiber optic transmission, people begin to pay more and more attention to the security of fiber optic communication. Cryptanalysis and key management are non-negligible factors for secure optical access systems. A cracking method based on differential cryptanalysis was proposed, which achieved complete decipherment with low complexity by obtaining equivalent aligned keys through differential cryptanalysis [15]. A video encryption algorithm based on chaotic block substitution and dynamic sequence multiplexing was proposed, which generated multiple obfuscated attached sequences with high security through key management [16]. For the secure transmission of PON, digital chaos-based physical layer encryption has been widely used to ensure the secure transmission of the system due to its advantages such as solid confidentiality, good randomness, low cost and ample key space [1720]. A series of encryption schemes based on digital chaos in the physical layer domain have been proposed to address the security risks associated with fiber optic transmission systems. A Brownian motion based on an encryption scheme was implemented to achieve physical layer encryption using chaos in cell to scramble OFDM symbols [21]. A deoxyribonucleic acid (DNA) encoding-based encryption scheme was proposed, utilizing two DNA addition operation rules for encryption and reducing the computational complexity [22]. In [23], a chaotic compressed sense (CS) encryption algorithm is used to compress the data for OFDM-PON encryption. In [24], a 7-dimensional cellular neural network (CNN) based encryption scheme was proposed to achieve 100% scrambling using joint encryption with carrier frequency, phase and time. A multilevel chaotic encryption scheme based on a novel three-dimensional selective probabilistic shaping (3D-SPS) was proposed, which enhanced the security of data transmission while obtaining 0.9 dB shaping gain [25]. A three-dimensional encryption scheme for orthogonal chirp division multiplexing passive optical networks (OCDM-PON) was achieved, which utilized cascaded fractional-order chaotic mapping (CFCM) to achieve highly secure encryption [19]. A scheme based on constellation shaping technique and digital chaos was proposed to complete the system's real-time encryption [26]. These encryption schemes have good advantages, such as easy implementation and compatibility with the system. However, all of these encryption schemes default to a known key on both the sending and receiving ends, so this paradigm does not work and there is a risk of key leakage. In order to improve security, the key must change dynamically during transmission, so we propose to transmit the key along with the message while encrypting. In addition, some previous encryption schemes introduced phase noise to the system. An encryption scheme based on improved Lorenz chaotic model was proposed, which rotationally encrypted the constellation map of an OFDM system so that the phase of its constellation points is changed [27]. In [28], a scheme to encrypt the constellation modulation of 16QAM mapping by rotating the constellation points and utilizing the constellation mask vector was proposed. A high security encryption scheme based on constellation shaping (CS) technique and digital chaos was proposed, which utilized a chaotic model to generate chaotic sequences to perturb the phase of 64-ary circular quadrature amplitude modulation (64CQAM) [26]. Compared to these, our scheme does not introduce additional phase noise to the system and the performance of the system is hardly affected.

This paper proposes a high-security, chaotic, encrypted, power sparse coding division (CE-PSCD) scheme based on NOMA technology. Taking two power levels as an example, constellation mapping encryption and carrier-symbol cooperative encryption are performed on the high-power signal, and then sparse coding scrambling and carrier-symbol cooperative encryption are performed on the low-power signal. The encrypted two signals are superimposed according to power multiplexing, and the superimposed encrypted signals are fed into a 7-core optical fiber transmission system through OFDM modulation. The proposed 4-dimensional hyperchaotic model is used to generate masking vectors for sparse coding, frequency, constellation mapping, and symbols, which are encrypted in four dimensions masking each other. Meanwhile the key is hidden in training sequence (TS) to realize the key and message co-transmission for better protection against illegal eavesdropping. The scheme demonstrates 70 Gb/s CE-PSCD signaling in a 2 km 7-core fiber optic experimental system.

2. Principles

The main design scheme of CE-PSCD is shown in Fig. 2. It consists of constellation mapping encryption, carrier frequency encryption, symbol scrambling, sparse coding scrambling, and a process where the key is hidden in TS.

 figure: Fig. 2.

Fig. 2. Schematic diagram of 4-dimensional CE-PSCD joint encryption.

Download Full Size | PDF

In Fig. 2, we take two input powers as an example. First, input power one is encrypted. When the binary data is modulated by quadrature phase shift keying (QPSK), the constellation is selectively mapped to complete the encryption of the constellation dimension. The carrier frequency and symbols are encrypted by perturbation, and finally the driving key for our chaotic system is hidden in TS. In this way, input power one is realized pre-encrypted. Then, the input power two is encrypted, the binary data is encrypted when sparsely encoded, the sparse matrix is encrypted, and the carrier frequency and symbols are encrypted with the same encryption operation as the input power 1. It is worth noting that the encryption operations of input power one and input power two are separated, and each is encrypted and then superimposed for transmission. The key-driven 4-dimensional hyperchaotic model generates four chaotic sequences for constellation mapping encryption, carrier frequency encryption, symbol scrambling and sparse coding scrambling. At the receiver, the key of the chaotic model needs to be solved first, and then demodulated by the SIC for high power one and low power two, respectively. The whole encryption process is reversible, and finally, the original data can be obtained by computing these two power signals by the reverse procedure for decryption.

2.1 4-dimensional hyperchaotic model

The proposed nonlinear 4-dimensional hyperchaotic dynamics model is represented as follows:

$$\left\{ \begin{array}{l} \frac{d}{{dt}}x(t) = ayz\\ \frac{d}{{dt}}y(t) = bx - xz - cx\\ \frac{d}{{dt}}z(t) = dxy - xw\\ \frac{d}{{dt}}w(t) = x - ew + y \end{array} \right.$$
where t is the step size, a, b, c, d and e are parameters, and (x, y, z, w) are chaotic sequences generated by a 4-dimensional hyperchaotic system. In this paper, the values of a, b, c, d and e are chosen as 20, 2, 20, 20, 0.2 and the initial values of (x0, y0, z0, w0) are chosen as 5.121467238914136, 1.111255863541261, 1.132567112563262, 1.151564886625412 respectively. We can get the four-dimensional chaotic sequence values by using 4th Runger-Kutta method. Figure 3 shows the phase diagram of the system, from which it can be seen that the system has quite complex chaotic properties. When the initial value of the given key changes slightly, the initial position of the phase diagram also changes. This indicates that the system is highly randomized and unpredictable, which ensures a highly secure and reliable transmission of the whole system.

 figure: Fig. 3.

Fig. 3. Phase diagram of the proposed four-dimensional hyperchaotic model.

Download Full Size | PDF

2.2 CE-PSCD four-dimensional encryption principle

In our proposed encryption scheme, which is based on two input powers, Fig. 4 shows the flowchart of its signal generation. It mainly includes high power constellation mapping encryption, low power sparse coding scrambling, key masking, joint encryption of minor and large-power subcarrier frequencies and symbols, Inverse Fast Fourier Transform (IFFT), addition of cyclic prefix (CP), and power allocation. S1(t) and S2(t) are denoted as the signal transmitted by channel one and the signal transmitted by channel two. The final transmit signal generated by the superposition of the two signals is denoted as:

$$S(t) = \sqrt {{P_1}} {S_1}(t) + \sqrt {{P_2}} {S_2}(t)$$
where P1 and P2 are set to denote the assigned power one and power two, and the powers P1 and P2 in turn satisfy the following relationship:
$$P = {P_1} + {P_2} = 1$$
where P denotes the total power, and the ratio between power P1 and power P2 is designed as the power distribution ratio (PDR), which can be expressed as:
$$PDR = {P_1}/{P_2}$$

 figure: Fig. 4.

Fig. 4. Flow of CE-PSCD signal generation.

Download Full Size | PDF

It is worth noting that the high-power one uses the QPSK modulation format. The low-power two uses the designed I-8QAM, whose four different constellation points correspond to the four quadrants of the high-power QPSK modulation format, as shown in Fig. 5. By symmetrically flipping one of the constellation points along the x and y axes, the constellation points of the final 4 quadrants can be obtained, and then superimposed with the power of the high-power QPSK modulation format, a 32QAM constellation diagram can be obtained. Compared to conventional rectangular 8QAM, this I-8QAM constellation structure performs better regarding higher constellation figure of merit (CFM) and better noise immunity.

 figure: Fig. 5.

Fig. 5. Design principle of I-8QAM constellation.

Download Full Size | PDF

The chaotic sequence (x, y, z, w) is used to realize low-power sparse coding perturbation, high-power and low-power subcarrier frequency encryption, high-power constellation mapping encryption, and high-power and low-power symbol perturbation, respectively. First, the chaotic sequence z is utilized to perform high-power constellation mapping encryption. The encrypted vector M of the high-power constellation mapping can be obtained as follows:

$$M = floor(\bmod (z \times {10^7},24) + 1)$$

In this case, multiplying the chaotic sequence z by 107 improves the randomness of the encrypted vector M. Here, multiplying the chaotic sequence z by any other number has a similar encryption effect. The reason for taking the remainder of 24 is that there are $A_4^4 = 24$ ways of high-power constellation mapping. In this way, all chaotic sequences z become integers in the interval [1,24], and then one of them is chosen as the final mapping of the high-power constellation, which can be obtained by the following process:

$$\begin{array}{l} M^{\prime} = M(1,2000)\\ Mapping = Mapping0({M^{\prime},:} )\end{array}$$
where, the number 2000 represents the mapping method of selecting the value of the 2000th column of the 1st row as the high power from M, and any value within the length range of M can be selected. Mapping0 represents all 24 mapping methods and Mapping represents the final mapping method selected.

Secondly, the subcarrier frequencies and symbols of low and high power are encrypted by cooperative substitution using chaotic sequences y and w, as shown in Fig. 6.

 figure: Fig. 6.

Fig. 6. Carrier frequency and symbol co-encryption.

Download Full Size | PDF

The specific encryption rules are as follows:

$$\left\{ \begin{array}{l} Y = Jz[\bmod (y \times {10^2},1) \times {(\frac{1}{{sort(\bmod (y \times {{10}^2},1))}})^T}]\\ W = Jz[\bmod (w \times {10^2},1) \times {(\frac{1}{{sort(\bmod (w \times {{10}^2},1))}})^T}] \end{array} \right.$$
where mod is the residual function, multiplying 102 for chaotic sequences y and w is to improve the randomness of frequency and symbol masking, and multiplying other numbers for chaotic sequences y and w have similar encryption effects. The sort function sorts an array in ascending order and returns the sorted array, the letter T transposes the matrix, and Jz is the transpose transform algorithm. By operating the chaotic sequences y and w according to Eq. (7), the transformation matrix can finally be obtained by the Jz algorithm, which consists of the unitary matrix undergoing several elementary transformations, and the subcarrier frequency and symbol substitution is realized by multiplying the constellation point matrix with the transformation matrix. It is worth noting that high and low power encryption is separated before signal superposition. We implement such substitution encryption for both their subcarrier frequencies and symbols, and we realize the synergistic encryption of small and large power carrier frequencies and symbols.

Finally, the sparse coding for low power is perturbed using chaotic sequence x. Before perturbation, this scheme's design principle of sparse coding is introduced. Multi-user decoding of SCMA needs to rely on the Message Passing Algorithm (MPA). At the same time, the MPA algorithm has high complexity, and it is more difficult to decode the multi-user codebook. It is not easy for us to accurately differentiate the data of different users, and the whole decoding process is irreversible. Therefore, we propose a new sparse coding approach on the basis of a balanced incomplete block design (BIBD). The design has five parameters, which can be denoted as BIBD (b, ν, κ, r, λ), where b, ν, κ, r and λ indicate the number of these five parameters: block groups, levels, levels in each block group, block groups containing each level and block groups including each pair of levels. The association matrix of BIBD is a 0-1 matrix of order b ×ν, denoted as follows:

$$\begin{array}{l} {A_{b \times \nu }} = ({a_{ij}})\\ {a_{ij}} = \left\{ \begin{array}{l} 1{\;if\;the\;ith\;level\;occurs\;in\;block\;group\;j}\\ 0{\;otherwise} \end{array} \right. \end{array}$$
where the sum of each row of A is r, the sum of each column of A is κ, and the inner product of any two rows of A is λ.

In our design scheme, b, ν, κ, r and λ indicate the number of these five parameters: resources, users, users in each resource, resources including each user and λ is set to 1. The designed BIBD correlation matrix needs to fulfill two conditions. Condition one is that the elements of the BIBD matrix have the same weights and the subset of the BIBD matrix is unique. Condition two is that, compared to the OMA technique, it allows a resource block to be assigned to multiple users in the same area at the same time, and by doing so, it realizes the reuse of ν resources by b users (b>ν).

Based on this, we design a novel encoding matrix. The non-zero elements in the association matrix are labeled, assuming that the subscripts of κ non-zero items in i resources are:

$${\chi _\textrm{i}}(1 ), \cdots ,{\chi _\textrm{i}}(j ), \cdots ,{\chi _\textrm{i}}(b )$$
when aij = 1, χi(j)=j, all the zero elements in BIBD matrix are unlabeled, while the non-zero elements are labeled, and the labeled non-zero elements are what we need to transmit. In Eq. (9), depends only on the association matrix Ab × ν in Eq. (8). We assume that the data information matrix of ν users is:
$$R = \left[ \begin{array}{llllll} {r_{1,1}}&{r_{2,1}}& \cdot&\cdot&\cdot & {r_{\nu ,1}}\\ {r_{1,2}}&{r_{2,2}}&\cdot&\cdot&\cdot &{r_{\nu ,2}}\\ \cdot&\cdot&\cdot&{}&{}&{\cdot}\\ \cdot&\cdot&{}&{r_{j,k}}&{}&{\cdot}\\ \cdot&\cdot&\cdot&{}&{\cdot}&{\cdot}\\ {r_{1,m}}&{r_{2,m}}& \cdot&\cdot&\cdot &{r_{\nu ,m}} \end{array} \right]$$

After our sparse coding, the sparse matrix becomes the following form:

$$S = \left[ \begin{array}{c} \textrm{U}_{{\chi_i}(j) = {\chi_i}(1)}^{{\chi_i}(b)}{r_{{\chi_1}(j)}}\\ \textrm{U}_{{\chi_i}(j) = {\chi_i}(2)}^{{\chi_i}(b)}{r_{{\chi_2}(j)}}\\ \vdots \\ \textrm{U}_{{\chi_i}(j) = {\chi_i}(1)}^{{\chi_i}(b)}{r_{{\chi_b}(j)}} \end{array} \right] = \left[ \begin{array}{l} \textrm{ }{s_1}\\ \textrm{ }{s_2}\\ \textrm{ } \vdots \\ \textrm{ }{s_b} \end{array} \right]$$

${s_1}{s_2} \cdots \textrm{ }{s_b}$ represents the new QAM symbol formed after sparse coding. Here, we set the values of b and v to 4 and 6, i.e., our number of resources, users, users in each resource, resources per user are 4, 6, 3, 2. Since the 8QAM mapping carries 3 binary bits, which matches perfectly with our design of the I-8QAM mapping rule, this non-orthogonal sparse coding design can also achieve 150% overload.

Thus, the correlation matrix Ab × ν in Eq. (8) can be expressed as follows:

$${A_{4,6}} = \left[ \begin{array}{cccccc}1&1&1&0&0&0\\1& {0} & {0} &{1} &{1} & 0\\ {0} & {1} & {0} &{1} &{0} &{1}\\ {0}&{0}&1&0& {1}& {1} \end{array} \right]$$

Each user contains two valuable bits of information, if the bit information of six users is “00 01 10 11 10 01”, the data matrix information after sparse coding is expressed as follows:

$$S = \left[ \begin{array}{ccc} {\chi_1}(1)&{\chi_1}(2)&{\chi_1}(3)\\ {\chi_2}(1)&{\chi_2}(4)&{\chi_2}(5)\\ {\chi_3}(2)& {\chi_3}(4)&{\chi_3}(6)\\ {\chi_4}(3)& {\chi_4}(5)&{\chi_4}(6) \end{array} \right]\textrm{ = }\left[ \begin{array}{l} 001\\ 011\\ 110\\ 001 \end{array} \right]$$
where the number in parentheses of the matrix element χ represents which user it is, and the number of subscripts of the matrix element χ represents which row it is in. After sparse coding, new constellation points are generated. There are four of them, and each of them carries three bits of information, which satisfies the I-8QAM mapping of our design. Combined with high-power QPSK modulation, the superimposed signal realizes 32QAM mapping.

Based on this, we propose a new dimensional encryption. The sparse coded correlation matrix of Eq. (12) is perturbatively encrypted using the chaotic sequence x. The perturbation rule is as follows:

$$X = Jz[\bmod (x,1) \times {(\frac{1}{{sort(\bmod (x,1))}})^T}]$$

The transpose matrix X (masking factor) is generated by Eq. (14), and the transpose matrix X is realized by multiplying the correlation matrix of Eq. (12) by the transpose matrix X to perturb the correlation matrix by substitution. If the perturbed correlation matrix is changed to the following form:

$${A^{\prime}_{4,6}} = \left[ \begin{array}{llllll} 0& 0& 1& 1& 0& 1\\ 1& 1& 0& 0& 0& 1\\ 0& 1& 0&1& 1& 0\\ 1&0&1& 0& 1& 0 \end{array} \right]$$

The corresponding Eq. (13) is changed and the new constellation after perturbation is represented as follows:

$$S^{\prime} = \left[ \begin{array}{ccc} {\chi_1}(3)&{\chi_1}(4)&{\chi_1}(6)\\ {\chi_2}(1)&{\chi_2}(2)&{\chi_2}(6)\\ {\chi_3}(2)& {\chi_3}(4)&{\chi_3}(5)\\ {\chi_4}(1)&{\chi_4}(3)&{\chi_4}(5) \end{array} \right]\textrm{ = }\left[ \begin{array}{l} 110\\ 001\\ 111\\ 000 \end{array} \right]$$

This disrupts the original correlation matrix and realizes the perturbation encryption for sparse coding. Our encryption scheme is not only highly flexible, but also reversible. We only need to utilize the opposite algorithm at the receiving end to restore the original signal on the transmitter side.

The signal recovery principle is shown in Fig. 7. The received signal is first equalized and then decrypted using a key. SIC is used to demodulate NOMA power domain multiplexing, the basic principle of which is gradually subtracting the interference caused by the maximum signal power user. In this scheme, taking two power signals as an example, the low power signal two is considered as noise at the beginning of demodulation since signal two is low power, and the signal one in high-power QPSK modulation format is directly decoded. The channel response H1 is obtained by estimating the channel, and equalization is performed on the signals to get the encrypted high-power signal Data1, and the encrypted high-power signal one is remodulated and multiplied by H1, which is used for the recovery of signal two afterward, and then the high-power signal one is decrypted and demodulated so that the remodulation is achieved by Data1. Finally, the low-power signal two is recovered. It is worth noting that, since the encryption of small and large power is separated before the signal superposition, the encrypted signal one, which is remodulated and multiplied by H1, is subtracted from the receiver's signal, so that the encrypted low-power signal Data2 can be obtained. Then, the low-power signal Data2 is recovered. After the channel estimation, equalization, and decrypted signal demodulation, the original signal Data2 can be recovered. Then, the original signal Data2 can be recovered. Our encryption scheme is highly compatible with the modulation technique in the present NOMA technology, which is significant for the research of high-security encrypted communication.

 figure: Fig. 7.

Fig. 7. Flow chart of SIC demodulation.

Download Full Size | PDF

2.3 Key “hide and seek”

To further enhance our encryption system's security, we propose a method to realize the co-transmission of keys and messages. We set the initial value of the key (x0, y0, z0, w0) of the chaotic model in this scheme cleverly at random as 5.121467238914136, 1.111255863541261, 1.132567112563262, 1.151564886625412. Each key has a total of 16 decimal digits; we convert each decimal number in these four keys to a 4-bit sequence, then each key will have a length of 64-bit binary string that corresponds uniquely to it, and these four keys have a total of 256 binary numbers. TS plays an essential role in channel estimation and equalizing signals at the receiver to get accurate symbol synchronization. Here, we transform the key of the chaotic system into a string of binary numbers embedded in the TS to realize the masking and simultaneous transmission of the chaotic key. The number of subcarriers in this scheme is 256, the corresponding TS is a 1 × 256 matrix. The 256-bit binary key can be perfectly hidden in the TS, making full use of every fragment of the TS. The specific key-hiding process is as follows:

$$\begin{array}{l} T{S_n}^\prime \textrm{ } = \textrm{ }T{S_n} \times {( - 1)^{{K_n}}}\\ n\textrm{ } = \textrm{ }1,\textrm{ }2,\textrm{ } \cdots ,\textrm{ }256 \end{array}$$
where $T{S_n}\; $ represents the training sequence used for channel equalization before hiding the key, $T{S_n}^{\prime}\; $ stands for Training Sequence with Key Stashing Information. $T{S_n}$ is divided into 256 segments, and each segment is controlled by a binary key ${K_n}$. When the value of ${K_n}$ is 0, the $T{S_n}$ value of the segment remains unchanged and the waveform is unchanged; on the contrary, when the value of ${K_n}\; $ is 1, the $T{S_n}$ value of the segment is multiplied by -1 and the waveform is vertically flipped, as shown in Fig. 8. In this way, the 256-bit binary key will be hidden in the $T{S_n}$ of length 256, and the original data cannot be recovered if there is an error in one of the binary keys.

 figure: Fig. 8.

Fig. 8. Schematic diagram of binary key control TS waveforms.

Download Full Size | PDF

At the receiving end, we can extract the key without the help of additional optics according to the following rules:

$$\left\{ \begin{array}{l} {K_n}^\prime = 0,\textrm{ }if\textrm{ }T{S_n}^\prime = T{S_n}\\ {K_n}^\prime = 1,\textrm{ }if\textrm{ }T{S_n}^\prime /T{S_n} ={-} 1 \end{array} \right.$$
where ${K_n}^{\prime}$ represents each binary key that we extract. By comparing all the fragments of $T{S_n}^{\prime}$ and $T{S_n}$, we can get the 256-bit binary number ${K_n}^{\prime}$ that we want, convert this 256-bit binary number into 4 groups, then convert these 4 groups of 64-bit binary numbers into decimal. Then, we can get the 4 keys we have at the beginning, and realize that the key is transmitted as we go.

3. Experimental setup and results

An experiment has been carried out to verify the feasibility of our CE-PSCD scheme, the experimental setup is shown in Fig. 9. At the optical line terminal (OLT), the original data is mapped on 256 subcarriers, 1024 IFFF points, and the CP is set to 1/4. The information entropy carried by each constellation of points in Data1 is 2 bits/symbol, and that carried by each constellation of points in Data2 is 3 bits/symbol. Thus, the information entropy of each constellation point after superposition is 5 bits/symbol. The encrypted data output from the DSP is imported into an arbitrary waveform generator (AWG, TekAWG70002A) with a 50 GSa/s sampling rate. After digital-to-analog conversion, it is converted into an analog radio-frequency (RF) signal with a speed of 10 GSa/s and amplified by an electrical amplifier (EA) to achieve intensity modulation, and then goes through the Mach-Zehnder modulator (MZM) with a bandwidth of 40 GHz to carry out the electro-optical modulation. Then the actual signal transmission rate is: 10GSa/s × 5 bits/symbol × 256 ÷ 1024 × 1 ÷ (1 + 1/4) × 7 = 70Gb/s. The tunable laser wavelength used in the experiment is 1550 nm with a power of 12 dBm. The modulated signal is optically amplified by an erbium-doped fiber amplifier (EDFA). The amplified signal passes through a power splitter (PS) to generate seven parts, passes through different lengths of delay lines (DL), and then passes through a fan-in device, which injects the signal into 2 km of 7-core weakly coupled fiber. After being transmitted by 7-core fiber, it is decoupled into single-mode fiber through a fan-out device, and the decoupled optical signals are injected into different optical network units (ONUs). In each ONU, a variable optical attenuator (VOA) is used to regulate the received optical power, and a photodiode (PD) with a bandwidth of 40 GHz enables the conversion of photoelectric signals. A mixed-signal oscilloscope (MSO, TekMSO73304DX) finally captures the received electrical signals with a sampling rate of 50 GSa/s to achieve analog-to-digital conversion. Finally, the correct key is obtained, and offline DSP processing can recover the original data.

 figure: Fig. 9.

Fig. 9. Experimental setup (OLT: optical line terminal; ONU: optical network unit; DSP: digital signal process; AWG: arbitrary waveform generator; EA: electrical amplifier; MZM: Mach-Zehnder modulator; EDFA: erbium doped fiber amplifier; PS: power splitter; DL: delay line; OC: optical coupler; VOA: variable optical attenuator; PD: photodiode; MSO: mixed-signal oscilloscope).

Download Full Size | PDF

The power distribution ratio (PDR) at the system's optimal performance can be found by traversal. When the optical power at the receiving end is -16 dBm, the BER curves of the system with and without encryption are shown in Fig. 10. It can be found that the trends of Fig. 10(a) and Fig. 10(b) curves are the same. As PDR increases, more and more power will be injected into the high-power QPSK signal, and its BER decreases all the time with it. As for the low-power I-8QAM signal, its BER curve shows a decreasing and then increasing trend as the PDR increases. The reason is that when demodulation is done, the whole signal is given to the high-power QPSK signal. When the PDR is small at the beginning, the high-power QPSK signal is poor, and the SIC algorithm demodulates the low power I-8QAM, the BER of the low-power I-8QAM signal will be higher. As the PDR increases, the high-power QPSK signal works better and the SIC error propagation is smaller, so the BER of the low-power I-8QAM will be reduced. However, too high a PDR results in too little power being allocated to the I-8QAM and its BER increases, with the inflection point appearing as a PDR value of 9 in Fig. 10. Therefore, the PDR at the lowest BER of the low-power I-8QAM signal is the optimal PDR for the system.

 figure: Fig. 10.

Fig. 10. (a) BER curves for different PDRs without encryption; (b) BER curves for different PDRs with encryption.

Download Full Size | PDF

After determining the system’s PDR, we compared the transmission performance of the CE-PSCD encrypted signal over the seven fiber cores, as shown in Fig. 11. It can be found that both high-power QPSK signal and low-power I-8QAM signal show a decreasing trend in BER with increasing optical power, and the BER curves of all cores are close to each other. At the limit of FEC∼3.8 × 10−3, the difference in sensitivity between the best-performing core 4 and the worse-performing core 2 of the high-power QPSK signal is only 0.33 dB; the difference in sensitivity between the best-performing core 4 and the worse-performing core 2 for low-power I-8QAM signal is only 0.25 dB, which proves the 7-core fiber we use has excellent stability and uniformity.

 figure: Fig. 11.

Fig. 11. (a) BER of high-power signal in 7 cores; (b) BER of low-power signal in 7 cores.

Download Full Size | PDF

We choose core 4, which shows better performance, to further test the system's performance. The BER curves of the system before and after encryption at different received optical power are shown in Fig. 12. It is obvious from the figure that the BER of the QPSK signal is always lower than the I-8QAM signal. The difference between unencrypted and encrypted BER is minor for high-power QPSK and low-power I-8QAM signals. At the FEC∼3.8 × 10−3 limit, the experimentally obtained received optical power for unencrypted QPSK signal, encrypted QPSK signal, unencrypted I-8QAM signal, and encrypted I-8QAM signal are -15.2dBm, -15.1dBm, -13.4dBm, -13.2dBm, respectively. The high-power QPSK signal with encryption has a sensitivity gain of 0.1 dB, and the low-power I-8QAM signal with encryption has a sensitivity gain of 0.2 dB. This proves that the system's performance is hardly affected because our encryption scheme does not change the position of the constellation points and has not introduced additional noise to the system. Our encryption scheme only changes the mapping rules of the constellation points, and the encryption is only scrambling at the bit level, which does not involve changing the phase of the constellation points, and does not introduce phase noise.

 figure: Fig. 12.

Fig. 12. BER curves for encrypted and unencrypted systems at different received optical powers.

Download Full Size | PDF

In addition, we study the BER curves for lawful reception and illegal reception under different transmission systems, as shown in Fig. 13. It can be found that the BER curves of the BTB and core 4 transmission systems are almost the same, which indicates that our 7-core fiber does not change the system's transmission performance. The legal reception ONU can extract our key to decrypt the encrypted signals, and the illegal reception can only be done using brute force decryption. When illegal receivers try to break it violently, the BER obtained is always close to 0.49, which proves that our encryption scheme has high-security performance.

 figure: Fig. 13.

Fig. 13. (a) BER curves of encrypted, unencrypted, and illegally received high-power QPSK signal transmitted in core 4 with a BTB system; (b) BER curves of encrypted, unencrypted, and illegally received low-power I-8QAM signal transmitted in core 4 with a BTB system.

Download Full Size | PDF

To verify the fairness of our CE-PSCD scheme for users with the same power, we measure the BER of different users in the encrypted low-power ONU2, as shown in Fig. 14. From the figure, it is evident that the BERs of different users are very close to each other. At the limit of FEC∼3.8 × 10−3, the sensitivity difference between different users is merely 0.36 dB, meaning that our encryption scheme does not destroy the fairness between users. This is due to our sparse-coded encryption, which treats the users of the entire sparse-coded correlation matrix, instead of encrypting the users’ signals individually and contains the data of multiple users at each constellation point. Each constellation point is symmetric, so such a whole encryption does not affect the fairness among users. Meanwhile, our sparse coded encryption scheme does not affect the performance of the system while not affecting the fairness among system users. This is because our encryption scheme does not introduce phase noise and the difference in encryption sensitivity does not degrade the transmission performance of the system. We inserted the constellation diagram at an optical power of -12dBm with a 9QAM distribution of constellation points. The reason is that our encryption scheme does not change the location of the constellation points, when demodulating the low power with the SIC algorithm. The constellations obtained include the 4 cases of I-8QAM; these 4 cases of constellation points are demodulated simultaneously, and the total number of constellation points including these 4 cases is 9. Hence, the constellation diagram of the encrypted low-power signal obtained at the receiving end is 9QAM.

 figure: Fig. 14.

Fig. 14. BER between different users in ONU2 after encryption.

Download Full Size | PDF

Figure 15 shows the BER for a 4-dimensional hyperchaotic model with a slight change in the initial value. For chaotic sequences, when their initial values change by 10−16, the BER of the system is the same as that of the correct key, while when their initial values change by 10−15 and above, the BER of the system increases significantly, approaching 0.49. At this point it is no longer possible to decrypt them. For parameters a and b, when their initial values are varied by 10−16, the BER remains the same as the correct key; while when their initial values are varied by 10−15 and above, the BER increases significantly. The BER increases significantly for parameters c and d when their initial values change by 10−14 and above. For parameter e, the BER increases rapidly when the initial value varies by 10−16 and above variations. This means that our chaotic model is susceptible to the initial value, and the key space can be as high as [(1015)6 × (1014)2 × (1016)1] = 10134, which is enough to defend against violent theft by unlawful receivers.

 figure: Fig. 15.

Fig. 15. BER values with small changes in initial values.

Download Full Size | PDF

We further test the computational complexity of the proposed scheme. The main computational complexity of this scheme comes from the system level encryption. To solve the differential equations of the chaotic model, we use the 4th Runge-Kutta method iteration. The main computational complexity of the system comes from its solution of the chaotic model. We have compared the model used in this paper with other models used and the comparison results are shown in Table 1. From the results, it can be seen that the computational complexity of the scheme is higher than that of the low-dimensional chaotic model. However, the low dimensional chaotic model has a small key space, which is not enough to resist brute force cracking. The chaos model we use has higher dimensions and larger key space, which effectively improves the security performance of the system. We also compare with the 4-chaos model in the same dimension and find that our computational complexity is relatively low and the key space is larger. Compared with the 7-D chaos model, the computational complexity is low and there is enough key space to resist intrusion. In conclusion, our encryption scheme has good security performance.

Tables Icon

Table 1. Comparisons of the proposed scheme with other encryption schemes

According to the Fig. 8, we hide the key in binary form in TS. To verify the superiority of this scheme, we test the BER curves when the hidden keys {x, y, z, w} are each only one binary digit wrong. Taking the high-power QPSK signal as an example, the measured BER curves are shown in Fig. 16. It can be found that no matter which kind of key, as long as the bits are wrong by one, the received BER stays around 0.5, close to brute-force cracking at illegal receivers. Legal receivers need to accurately obtain all the binary digits of the key that we have hidden to ensure that the information received is error-free. Illegal receivers can only get the hidden key by brute-force decryption, and as long as one binary digit is wrong, the BER stays around 0.5, which means that all the signal can't be demodulated correctly. This shows that the high stability and low fault tolerance of our hidden keys, combined with our encryption algorithm greatly improves the system’s security.

 figure: Fig. 16.

Fig. 16. BER curves for illegal reception with one wrong binary number for each of the different keys.

Download Full Size | PDF

4. Conclusion

This paper proposes a four-dimensional joint encryption scheme based on NOMA technology. Meanwhile, the chaotic key is hidden in the TS to realize the key and message co-transmission and experimental verification are performed. The four-dimensional hyperchaotic system generates four chaotic sequences, which generate sparse coding, frequency, constellation mapping, and masking vectors for symbols, respectively, to realize four-dimensional joint encryption. The proposed sparse coding achieves a 150% overload rate and increases the number of accessed users, while a new dimension of sparse coding encryption for autonomous design is proposed to integrate user information for sparse coding perturbation encryption. In addition, combined with our experimental 2 km weakly coupled 7-core fiber, the system transmission capacity is again enhanced. The transmission of 70Gb/s CE-PSCD signals over 2 km of 7-core fiber is experimentally demonstrated. The results prove that our scheme has high sensitivity with good encryption performance. At the equal power level, the sensitivity difference between different users after encryption is 0.36 dB, which does not affect the excellent fairness among users. At the FEC∼3.8 × 10−3 limit, the received optical power of the encrypted QPSK signal and the encrypted I-8QAM signal have a sensitivity gain of 0.1 dB and 0.2 dB, respectively. Our CE-PSCD scheme has a key space of 10134, which provides reasonable protection against brute force decryption by illegal receivers. In addition, the superiority of our hidden key strategy is verified. As long as the binary bits of our secret key are one bit wrong, the BER will remain around 0.5, which can further guarantee the safety of system. In conclusion, our proposed scheme can improve the system's transmission capacity and has high-security performance and good application prospects in the future of large-capacity and high-security optical communication.

Funding

National Key Research and Development Program of China (2021YFB2800904); National Natural Science Foundation of China (62225503, 61835005, 62205151, 62275127, 61935005, U2001601); Jiangsu Provincial Key Research and Development Program (BE2022079, BE2022055-2); The Natural Science Foundation of the Jiangsu Higher Education Institutions of China (22KJB510031); The Startup Foundation for Introducing Talent of NUIST.

Disclosures

The authors declare no conflicts of interest.

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

References

1. L. Velasco, A. P. Vela, F. Morales, et al., “Designing, Operating, and Reoptimizing Elastic Optical Networks,” J. Lightwave Technol. 35(3), 513–526 (2017). [CrossRef]  

2. K. Zhong, X. Zhou, J. Huo, et al., “Digital signal processing for short-reach optical communications: A Review of Current Technologies and Future Trends,” J. Lightwave Technol. 36(2), 377–400 (2018). [CrossRef]  

3. S. Le, T. Drenski, A. Hills, et al., “100Gbps DMT ASIC for Hybrid LTE-5 G Mobile Fronthaul Networks,” J. Lightwave Technol. 39(3), 801–812 (2021). [CrossRef]  

4. X. Xu, Bo Liu, Xiangyu Wu, et al., “A robust probabilistic shaping PON based on symbol-level labeling and rhombus-shaped modulation,” Opt. Express 26(20), 26576–26589 (2018). [CrossRef]  

5. J. Lee, K. Choi, J. Moon, et al., “Seamless Upgrades From a TDM-PON With a Video Overlay to a WDM-PON,” J. Lightwave Technol. 27(15), 3116–3123 (2009). [CrossRef]  

6. X. F. Hu, P. Cao, L. Zhang, et al., “Energy-efficient optical network units for OFDM PON based on time-domain interleaved OFDM technique,” Opt. Express 22(11), 13043–13049 (2014). [CrossRef]  

7. F. Lu, M. Xu, L. Cheng, et al., “Power-Division Non-Orthogonal Multiple Access (NOMA) in Flexible Optical Access With Synchronized Downlink/Asynchronous Uplink,” J. Lightwave Technol. 35(19), 4145–4152 (2017). [CrossRef]  

8. B. Lin, J. Xu, Z. Ghassemlooy, et al., “Power-code division non-orthogonal multiple access scheme for next-generation passive optical networks,” Opt. Express 27(24), 35740–35749 (2019). [CrossRef]  

9. B. Liu, L. Zhang, and X. Xin, “Non-orthogonal optical multicarrier access based on filter bank and SCMA,” Opt. Express 23(21), 27335–27342 (2015). [CrossRef]  

10. Y. Fu, Y. Hong, L. Chen, et al., “Enhanced power allocation for sum rate maximization in OFDM-NOMA VLC systems,” IEEE Photonics Technol. Lett. 30(13), 1218–1221 (2018). [CrossRef]  

11. F. Lu, M. Xu, L. Cheng, et al., “Non-Orthogonal Multiple Access With Successive Interference Cancellation in Millimeter-Wave Radio-Over-Fiber Systems,” J. Lightwave Technol. 34(17), 4179–4186 (2016). [CrossRef]  

12. G. Wang, Y. Shao, L.-K. Chen, et al., “Improved joint subcarrier and power allocation to enhance the throughputs and user fairness in indoor OFDM-NOMA VLC systems,” Opt. Express 29(18), 29242–29256 (2021). [CrossRef]  

13. Y. Yang, C. Chen, W. Zhang, et al., “Secure and private NOMA VLC using OFDM with two-level chaotic encryption,” Opt. Express 26(26), 34031–34042 (2018). [CrossRef]  

14. Y. Wan, B. Liu, J. Ren, et al., “Performance Enhanced Optical Non-Orthogonal Multiple Access Enabled by Orthogonal Chirp Division Multiplexing,” J. Lightwave Technol. 40(16), 5440–5449 (2022). [CrossRef]  

15. H. Wen and Y. Lin, “Cryptanalysis of an image encryption algorithm using quantum chaotic map and DNA coding,” Expert. Syst. Appl. 237, 121514 (2024). [CrossRef]  

16. H. Wen, Y. Lin, Z. Xie, et al., “Chaos-based block permutation and dynamic sequence multiplexing for video encryption,” Sci. Rep. 13(1), 14721 (2023). [CrossRef]  

17. J. Ren, B. Liu, D. Zhao, et al., “Chaotic constant composition distribution matching for physical layer security in a PS-OFDM-PON,” Opt. Express 28(26), 39266–39277 (2020). [CrossRef]  

18. Z. Wang, Y. Xiao, S. Wang, et al., “Probabilistic shaping based constellation encryption for physical layer security in OFDM RoF system,” Opt. Express 29(12), 17890–17901 (2021). [CrossRef]  

19. L. Yuan, B. Liu, J. Ren, et al., “High-security OCDM-PON system of 7-core fiber based on CFCM encryption,” Opt. Lett. 47(1), 186–189 (2022). [CrossRef]  

20. Z. Zhang, Y. Luo, C. Zhang, et al., “Constellation Shaping Chaotic Encryption Scheme With Controllable Statistical Distribution for OFDM-PON,” J. Lightwave Technol. 40(1), 14–23 (2022). [CrossRef]  

21. T. Wu, Chongfu Zhang, Chen Chen, et al., “Security enhancement for OFDM-PON using Brownian motion and chaos in cell,” Opt. Express 26(18), 22857–22865 (2018). [CrossRef]  

22. T. Wu, Chongfu Zhang, Huan Huang, et al., “Security improvement for OFDM-PON via DNA extension code and chaotic systems,” IEEE Access 8, 75119–75126 (2020). [CrossRef]  

23. T. Wu, C. Zhang, Y. Chen, et al., “Compressive sensing chaotic encryption algorithms for OFDM-PON data transmission,” Opt. Express 29(3), 3669–3684 (2021). [CrossRef]  

24. S. Chen, B. Liu, J. Ren, et al., “A 7D Cellular Neural Network Based OQAM-FBMC Encryption Scheme for Seven Core Fiber,” J. Lightwave Technol. 39(22), 7191–7198 (2021). [CrossRef]  

25. Y. Luo, C. Zhang, X. Liang, et al., “Secure OFDM-PON using three-dimensional selective probabilistic shaping and chaos,” Opt. Express 30(14), 25339–25355 (2022). [CrossRef]  

26. Y. Chen, J. Chen, M. Zhang, et al., “High-security constellation shaped self-homodyne coherent system with 4-D joint encryption,” Opt. Express 31(2), 3153–3167 (2023). [CrossRef]  

27. J. Shen, B. Liu, Y. Mao, et al., “Enhancing the reliability and security of OFDM-PON using modified Lorenz chaos based on the linear properties of FFT,” J. Lightwave Technol. 39(13), 4294–4299 (2021). [CrossRef]  

28. D. Zhao, X. Zhu, B. Liu, et al., “High-security and low-complexity OCDM transmission scheme based on GAN enhanced chaotic encryption,” Opt. Express 30(19), 34898–34907 (2022). [CrossRef]  

29. K. Sun, X. Liu, C. Zhu, et al., “Hyperchaos and hyperchaos control of the sinusoidally forced simplified Lorenz system,” Nonlinear Dyn. 69(3), 1383–1391 (2012). [CrossRef]  

30. Z. Hu and C. Chan, “A 7-D hyperchaotic system-based encryption scheme for secure fast-OFDM-PON,” J. Lightwave Technol. 36(16), 3373–3381 (2018). [CrossRef]  

Data availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (16)

Fig. 1.
Fig. 1. The architecture of NOMA.
Fig. 2.
Fig. 2. Schematic diagram of 4-dimensional CE-PSCD joint encryption.
Fig. 3.
Fig. 3. Phase diagram of the proposed four-dimensional hyperchaotic model.
Fig. 4.
Fig. 4. Flow of CE-PSCD signal generation.
Fig. 5.
Fig. 5. Design principle of I-8QAM constellation.
Fig. 6.
Fig. 6. Carrier frequency and symbol co-encryption.
Fig. 7.
Fig. 7. Flow chart of SIC demodulation.
Fig. 8.
Fig. 8. Schematic diagram of binary key control TS waveforms.
Fig. 9.
Fig. 9. Experimental setup (OLT: optical line terminal; ONU: optical network unit; DSP: digital signal process; AWG: arbitrary waveform generator; EA: electrical amplifier; MZM: Mach-Zehnder modulator; EDFA: erbium doped fiber amplifier; PS: power splitter; DL: delay line; OC: optical coupler; VOA: variable optical attenuator; PD: photodiode; MSO: mixed-signal oscilloscope).
Fig. 10.
Fig. 10. (a) BER curves for different PDRs without encryption; (b) BER curves for different PDRs with encryption.
Fig. 11.
Fig. 11. (a) BER of high-power signal in 7 cores; (b) BER of low-power signal in 7 cores.
Fig. 12.
Fig. 12. BER curves for encrypted and unencrypted systems at different received optical powers.
Fig. 13.
Fig. 13. (a) BER curves of encrypted, unencrypted, and illegally received high-power QPSK signal transmitted in core 4 with a BTB system; (b) BER curves of encrypted, unencrypted, and illegally received low-power I-8QAM signal transmitted in core 4 with a BTB system.
Fig. 14.
Fig. 14. BER between different users in ONU2 after encryption.
Fig. 15.
Fig. 15. BER values with small changes in initial values.
Fig. 16.
Fig. 16. BER curves for illegal reception with one wrong binary number for each of the different keys.

Tables (1)

Tables Icon

Table 1. Comparisons of the proposed scheme with other encryption schemes

Equations (18)

Equations on this page are rendered with MathJax. Learn more.

{ d d t x ( t ) = a y z d d t y ( t ) = b x x z c x d d t z ( t ) = d x y x w d d t w ( t ) = x e w + y
S ( t ) = P 1 S 1 ( t ) + P 2 S 2 ( t )
P = P 1 + P 2 = 1
P D R = P 1 / P 2
M = f l o o r ( mod ( z × 10 7 , 24 ) + 1 )
M = M ( 1 , 2000 ) M a p p i n g = M a p p i n g 0 ( M , : )
{ Y = J z [ mod ( y × 10 2 , 1 ) × ( 1 s o r t ( mod ( y × 10 2 , 1 ) ) ) T ] W = J z [ mod ( w × 10 2 , 1 ) × ( 1 s o r t ( mod ( w × 10 2 , 1 ) ) ) T ]
A b × ν = ( a i j ) a i j = { 1 i f t h e i t h l e v e l o c c u r s i n b l o c k g r o u p j 0 o t h e r w i s e
χ i ( 1 ) , , χ i ( j ) , , χ i ( b )
R = [ r 1 , 1 r 2 , 1 r ν , 1 r 1 , 2 r 2 , 2 r ν , 2 r j , k r 1 , m r 2 , m r ν , m ]
S = [ U χ i ( j ) = χ i ( 1 ) χ i ( b ) r χ 1 ( j ) U χ i ( j ) = χ i ( 2 ) χ i ( b ) r χ 2 ( j ) U χ i ( j ) = χ i ( 1 ) χ i ( b ) r χ b ( j ) ] = [   s 1   s 2     s b ]
A 4 , 6 = [ 1 1 1 0 0 0 1 0 0 1 1 0 0 1 0 1 0 1 0 0 1 0 1 1 ]
S = [ χ 1 ( 1 ) χ 1 ( 2 ) χ 1 ( 3 ) χ 2 ( 1 ) χ 2 ( 4 ) χ 2 ( 5 ) χ 3 ( 2 ) χ 3 ( 4 ) χ 3 ( 6 ) χ 4 ( 3 ) χ 4 ( 5 ) χ 4 ( 6 ) ]  =  [ 001 011 110 001 ]
X = J z [ mod ( x , 1 ) × ( 1 s o r t ( mod ( x , 1 ) ) ) T ]
A 4 , 6 = [ 0 0 1 1 0 1 1 1 0 0 0 1 0 1 0 1 1 0 1 0 1 0 1 0 ]
S = [ χ 1 ( 3 ) χ 1 ( 4 ) χ 1 ( 6 ) χ 2 ( 1 ) χ 2 ( 2 ) χ 2 ( 6 ) χ 3 ( 2 ) χ 3 ( 4 ) χ 3 ( 5 ) χ 4 ( 1 ) χ 4 ( 3 ) χ 4 ( 5 ) ]  =  [ 110 001 111 000 ]
T S n   =   T S n × ( 1 ) K n n   =   1 ,   2 ,   ,   256
{ K n = 0 ,   i f   T S n = T S n K n = 1 ,   i f   T S n / T S n = 1
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.