Detection method and device for visible light communication CSK system
By combining external iteration and internal iteration in the visible light communication CSK system, the decoding process is determined based on the demodulation threshold of the encoded bit, and the problem of high computing overhead in the prior art is solved, and faster detection speed and better bit error performance are achieved.
Patent Information
- Application Number
- CN202510719551.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-05-30
- Publication Date
- 2025-08-29
AI Technical Summary
The existing visible light communication CSK system fails to effectively consider the modulation performance differences of different CSK constellations during the demodulation and decoding process, resulting in unnecessary computing overhead and delay.
By comparing the adjacent two average demodulation thresholds of each set of encoded bits during the demodulation process, it is determined whether the demodulation soft information enters the decoder for internal iteration decoding, reducing the number of internal iterations, and decoding is performed using a combination of external iterations and internal iterations.
It reduces the computing overhead, improves the detection speed and bit error performance of the communication system, and reduces the data processing delay.
Smart Images

Figure CN120567301A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of visible light communication, and in particular to a detection method and device for a visible light communication CSK system. Background Art
[0002] With the advent of the information age and the development of communication technology, communication methods have continuously evolved from 2G to 5G, information transmission rates have continued to increase, and the number of wireless device connections has continued to expand. This evolution in communication methods has placed enormous demands on wireless communication spectrum, and spectrum resources will become increasingly scarce over time. To meet the growing demand for wireless data services and alleviate the pressure on the currently overcrowded spectrum, visible light communication (VLC) technology, which uses visible light as an information carrier, has rapidly developed.
[0003] In 2011, the IEEE 802.15.7 VLC discussion group proposed a new modulation method: Color Shift Keying (CSK). This modulation method uses RGB light-emitting diodes, and different data is transmitted through different colors of visible light during transmission. Since its introduction, CSK modulation has attracted widespread attention from scholars at home and abroad. Various CSK constellation designs have been proposed, especially the design of irregular CSK constellations based on bit-interleaved coded modulation and iterative detection transmission framework, which has improved the performance of VLC systems. Figure 1 , this communication system is divided into a transmitting end and a receiving end:
[0004] At the transmitter, k information bits are passed through the original image encoder to generate n coded bits. These n coded bits pass through a specific interleaver and enter the M-order irregular CSK modulator. In the irregular CSK modulator, the coded sequence is sequentially divided into l subsequences of length n / l, which are modulated onto l different CSK constellations. Then, the modulator outputs a CSK symbol sequence. It is worth noting that for an M-order CSK constellation, its constellation set is denoted as ψ = {ψ 1 ,ψ 2 ,…,ψ M}, in the modulation process, every m (m = log2M) coded bits {b1, b2, ..., b m} is mapped to an M-order CSK constellation point x = [x r ,x g ,x b ] T ,Right now
[0005] {b1,b2,…,b m}→x=[x r ,xg ,x b ] T ∈ψ
[0006] Here the three components x of the constellation point x r 、x g and x b Represents the intensity of red, green and blue light respectively, and the sum of the three components of each CSK constellation symbol is 1 (i.e. x r +x g +x b =1). Finally, these light intensities are converted into visible light of red, green, and blue through digital-to-analog conversion and the driving module of the red, green, and blue LED lights. These three colors of light are mixed and transmitted through the VLC channel.
[0007] At the receiving end, the visible light signal output by the channel passes through three filters, red, green, and blue, to separate the three colors of light. The three colors are then converted into corresponding electrical signals by photodetectors. The corresponding electrical signals enter the detection framework for demodulation and decoding.
[0008] The existing detection framework consists of a CSK demodulator and a proto-image decoder. The demodulator stores l different M-order CSK constellations, each used to demodulate the information output by the photodetector. Specifically, given a codeword's corresponding CSK received symbol sequence and a corresponding prior likelihood information sequence, the number of inner iterations (i.e., iterations between the variable nodes and check nodes of the proto-image decoder) and outer iterations (i.e., iterations between the demodulator and decoder) is set. These CSK received symbols then sequentially enter the demodulator, which directly outputs all the extrinsic likelihood information corresponding to a codeword using the maximum log-domain maximum a posteriori probability algorithm. This extrinsic likelihood information output by the demodulator is then deinterleaved and used as the prior likelihood information for the proto-image decoder. Using this extrinsic likelihood information, the proto-image decoder calculates the extrinsic likelihood information for all coded bits using a belief propagation algorithm and passes this information to the interleaver for processing. Finally, all the extrinsic likelihood information output by the interleaver is used as the prior likelihood information for the demodulator in the next outer iteration.
[0009] In such an iterative demodulation and decoding framework, all external likelihood information and prior likelihood information corresponding to a codeword in the demodulator and decoder are continuously iteratively updated between the demodulator and decoder according to the preset number of internal iterations (i.e., iterations between the original model decoder variable nodes and the check nodes) Q2 and the number of external iterations (i.e., iterations between the demodulator and decoder) Q1. The iterative process is terminated only when the codeword is successfully decoded in the decoder or the maximum number of internal iterations and the maximum number of external iterations are reached.
[0010] When demodulating irregular modulation schemes containing multiple CSK constellations, existing detection schemes fail to consider the differences in modulation performance between different CSK constellations (constellations with better modulation performance generate more reliable soft information during demodulation, enabling faster convergence of the corresponding coded bits in the decoder). Instead, they iteratively demodulate and decode the CSK received symbol sequence corresponding to a codeword using pre-set Q1 and Q2. This results in unnecessary computational overhead for demodulation and decoding, slowing down the demodulation and decoding process and impacting the overall latency of the communication system. Summary of the Invention
[0011] Based on this, the object of the present invention is to provide a detection method and device for a visible light communication CSK system.
[0012] A method for detecting a visible light communication CSK system comprises the following steps:
[0013] S10, receiving the coded bits to be detected;
[0014] S20, perform external iterative calculation on the received coded bits to obtain the average external likelihood information of the i-th group of coded bits at the q1-th iteration Where q1 = 1, 2, ..., Q1, Q1 is the maximum number of outer iterations, i = 1, 2, ..., l, l is the maximum number of groups of coded bits;
[0015] S30, comparing the average external likelihood information of the i-th group of coded bits during the q1-th and q1+1-th external iterations to obtain the average external likelihood information difference γ i , if γ i ≥γ, then execute the subsequent steps, otherwise return to step S20 to execute the next iteration, where is the average external likelihood information of the i-th group of coded bits at the q1-th iteration, is the average external likelihood information of the i-th group of coded bits at the q1+1th iteration, ≥γ is the demodulation threshold;
[0016] S40, perform inner iterative decoding on the i-th group of coded bits, and obtain the average posterior likelihood information corresponding to the i-th group of coded bits at the q2-th inner iteration Where q2=1,2,…,Q2, Q2 is the maximum number of inner iterations;
[0017] S50, determining whether the decoding is successful, if the decoding is successful, outputting the decoding result, otherwise executing the next step;
[0018] S60, according to the formula Determine the average posterior likelihood information difference between two adjacent times like Then return to step S40 to perform the next iteration; otherwise, output the posterior likelihood information of the i-th group of coded bits, where β is the decoding threshold.
[0019] The detection method for visible light communication (CSK) systems described in this invention fully considers the varying performance of different CSK constellations. Specifically, each group of coded bits has a different demodulation threshold during demodulation. Therefore, during demodulation, the average demodulation threshold of two consecutive coded bits is used to determine whether the demodulated soft information enters the decoder for inner iterative decoding. This approach reduces the number of inner iterations, thereby lowering computational overhead.
[0020] Furthermore, step S20 includes the following sub-steps:
[0021] S21, using the maximum logarithm domain maximum a posteriori probability algorithm and the corresponding prior likelihood information to calculate the extrinsic likelihood information corresponding to the i-th group of coded bits received,
[0022] S22, the external likelihood information of the i-th group of coded bits is calculated according to the formula Calculate and obtain the average external likelihood information
[0023] Furthermore, the step S40 includes the following sub-steps:
[0024] S41, calculate the likelihood information of the i-th group of coded bits according to the belief propagation algorithm, update the likelihood information of the corresponding variable nodes and check nodes, and thereby obtain the posterior likelihood information corresponding to the group of coded bits
[0025] S42, the posterior likelihood information of the i-th group of coded bits is calculated according to the formula Calculate and obtain the average posterior likelihood information
[0026] Furthermore, the method further includes step S70: setting the posterior likelihood information of the i-th group of coded bits as the prior likelihood information for the next outer iterative calculation.
[0027] At the same time, the present invention also provides a detection device for a visible light communication CSK system, comprising a receiving module, an external iteration module, an external comparison module, an internal iteration module, a judgment module and an internal comparison module;
[0028] The receiving module is used to receive the coded bits to be detected;
[0029] The external iteration module is used to perform external iterative calculation on the received coded bits to obtain the average external likelihood information of the i-th group of coded bits at the q1-th iteration. Where q1 = 1, 2, ..., Q1, Q1 is the maximum number of outer iterations, i = 1, 2, ..., l, l is the maximum number of groups of coded bits;
[0030] The external comparison module is used to compare the average external likelihood information of the i-th group of coded bits during the q1-th and q1+1-th external iterations to obtain the average external likelihood information difference γ i , if γ i ≥γ, the inner iteration module is started, otherwise it returns to the outer iteration module to execute the next iteration, where is the average external likelihood information of the i-th group of coded bits at the q1-th iteration, is the average external likelihood information of the i-th group of coded bits at the q1+1th iteration, and γ is the demodulation threshold;
[0031] The inner iteration module is used to perform inner iterative decoding on the i-th group of coded bits and obtain the average posterior likelihood information corresponding to the i-th group of coded bits at the q2-th inner iteration. Where q2=1,2,…,Q2, Q2 is the maximum number of inner iterations;
[0032] The judgment module is used to judge whether the decoding is successful, and output the decoding result if the decoding is successful, otherwise the internal comparison module is activated;
[0033] The internal comparison module is used according to the formula Determine the average posterior likelihood information difference between two adjacent times like Then return to the inner iteration module to perform the next iteration, otherwise output the posterior likelihood information of the i-th group of coded bits, where β is the decoding threshold.
[0034] Furthermore, the inner iteration module includes a priori unit and an average priori unit;
[0035] The a priori unit is used to calculate the external likelihood information corresponding to the i-th group of coded bits using the maximum logarithm domain maximum a posteriori probability algorithm and the corresponding a priori likelihood information to obtain the external likelihood information corresponding to the group of coded bits
[0036] The average prior unit is used to calculate the external likelihood information of the i-th group of coded bits according to the formula Calculate and obtain the average external likelihood information
[0037] Furthermore, the inner iteration module includes a posterior unit and an average posterior unit;
[0038] The a posteriori unit is used to calculate the likelihood information of the i-th group of coded bits according to the belief propagation algorithm, update the likelihood information of the corresponding variable nodes and check nodes, and thereby obtain the a posteriori likelihood information corresponding to the group of coded bits
[0039]
[0040] The average a posteriori unit is used to calculate the a posteriori likelihood information of the i-th group of coded bits according to the formula Calculate and obtain the average posterior likelihood information
[0041] Furthermore, a feedback unit is included, which is used to set the posterior likelihood information of the i-th group of coded bits as the prior likelihood information of the next outer iterative calculation.
[0042] For better understanding and implementation, the present invention is described in detail below with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS
[0043] Figure 1 Schematic diagram of visible light communication CSK system;
[0044] Figure 2 This is a flow chart of the detection method for the visible light communication CSK system;
[0045] Figure 3 The diagram shows the effect of the bit error performance simulation experiment of different detection methods. DETAILED DESCRIPTION
[0046] See also Figure 2 , a detection method for a visible light communication CSK system, comprising the following steps:
[0047] S10: Receive coded bits to be detected.
[0048] In a visible light communication (CSK) system, the information to be transmitted is encoded into CSK symbols at the transmitter and then transmitted to the receiver via visible light. The visible light signal at the receiver passes through three filters, red, green, and blue, to separate the three colors of light. These are then converted into corresponding electrical signals by photodetectors. The electrical signals are then initially processed in a demodulator to obtain the coded bits.
[0049] For ease of understanding, we assume that the length of the transmitted coding sequence is n, that is, a total of n coded bits are sent. In the visible light communication CSK system, l M-order CSK constellations are designed. Then the n coded bits will be evenly divided into l parts, each containing z (z = n / l) coded bits, which are modulated onto l CSK constellations for transmission. Therefore, there are l groups of received coded bits, each with z coded bits.
[0050] S20, perform external iterative calculation on the coded bits to obtain the average external likelihood information of the i-th group of coded bits at the q1-th iteration Where q1 = 1, 2, …, Q1, Q1 is the maximum number of outer iterations, and i = 1, 2, …, l.
[0051] In a CSK system, coded bits are decoded through two iterative processes: outer and inner iterations. The outer iteration refers to the process of iterative demodulation of the coded bits in the demodulator. Specifically, the iterative process includes the following sub-steps:
[0052] S21, the received i-th group of coded bits is calculated using the maximum logarithm domain maximum a posteriori probability algorithm and the corresponding prior likelihood information to obtain z external likelihood information Where i = 1, 2, ..., l.
[0053] S22, calculate the external likelihood information of the i-th group of coded bits to obtain the average external likelihood information
[0054] The above outer iteration process will be repeated several times until the subsequent judgment conditions are met or the maximum outer iteration number Q1 is reached. The maximum outer iteration number Q1 is a manually set parameter and can be adjusted accordingly according to actual conditions.
[0055] S30, comparing the average external likelihood information of the i-th group of coded bits during the q1-th and q1+1-th external iterations to obtain the average external likelihood information difference γ i , If γ i ≥γ, then execute the subsequent steps; otherwise, return to step S20 to execute the next iteration, where γ is the demodulation threshold.
[0056] Specifically, after each new outer iteration calculation, the new outer iteration calculation result, that is, the average external likelihood information of the i-th group of coded bits obtained by the q1+1th outer iteration calculation, is converted into The average external likelihood information of the i-th group of coded bits obtained by the previous iterative calculation, that is, the q1-th outer iterative calculation, is For comparison, according to the formula Calculate the average external likelihood information difference γ of two external iterations i , and judge γ i The relationship between the size of the preset demodulation threshold γ, if γ i ≥γ, it means that the current outer iterative calculation has met the demodulation target requirements and the group of coded bits can be used for subsequent decoding steps; otherwise, it means that the current outer iterative calculation has not met the requirements and further outer iterative calculation needs to be performed on the group of coded bits.
[0057] S40, perform inner iterative decoding on the i-th group of coded bits, and obtain the average posterior likelihood information corresponding to the i-th group of coded bits at the q2-th iteration
[0058] After the coded bits undergo the outer iterative calculation process, they enter the decoder for inner iterative decoding, which specifically includes the following sub-steps:
[0059] S41, calculate the likelihood information of the i-th group of coded bits according to the belief propagation algorithm, update the likelihood information of the corresponding variable nodes and check nodes, and thereby obtain the posterior likelihood information
[0060] S42, the posterior likelihood information of the i-th group of coded bits is calculated according to the formula Calculate and obtain the average posterior likelihood information
[0061] The above inner iteration process will be repeated several times until the subsequent judgment conditions are met or the maximum number of inner iterations Q2 is reached. The maximum number of inner iterations Q2 is a manually set parameter and can be adjusted accordingly according to actual conditions.
[0062] S50: Determine whether the decoding is successful. If the decoding is successful, output the decoding result; otherwise, execute the next step.
[0063] The above-mentioned internal iterative decoding process will be carried out in a loop. Each time, the likelihood information of the corresponding variable nodes and check nodes will be updated according to the belief propagation algorithm. In each iterative cycle, that is, after each group of coded bits is decoded, a decoding judgment will be performed. If the decoding is successful and the correct transmission information is obtained, the decoder outputs the decoding result; otherwise, the subsequent steps will be executed to judge and evaluate the current decoding result to determine whether to continue iterative decoding or stop decoding.
[0064] S60, determining the average posterior likelihood information difference between two adjacent inner iterative decodings like Then return to step S40; otherwise, output the posterior likelihood information of the i-th group of coded bits.
[0065] The average posterior likelihood information of this inner iterative decoding The difference between the average posterior likelihood information and the previous inner iterative decoding is calculated to obtain the average posterior likelihood information difference And according to the average posterior likelihood information difference Compared with the pre-set decoding threshold β, if Then the group of coded bits continues to be decoded in the next inner iteration; if The inner iterative decoding process for the group of coded bits then stops, and the decoder outputs the posterior likelihood information of the group.
[0066] S70: Set the posterior likelihood information of the i-th group of coded bits as the prior likelihood information for the next outer iterative calculation.
[0067] During the decoding process, coded bits are transferred back and forth between the demodulator and decoder. During this process, an external iterative calculation is performed in the demodulator and an internal iterative calculation is performed in the decoder, ultimately leading to convergence of the results to obtain the correct information. By passing the posterior likelihood information obtained from the internal iterative calculation to the demodulator as the prior likelihood information for the external iterative calculation, the external iterative calculation can be accelerated to converge, improving computational efficiency.
[0068] Compared to existing technologies, the method described in this invention fully considers the different performance characteristics of different CSK constellations. Specifically, each group of coded bits has a different demodulation threshold during the demodulation process. Therefore, during the demodulation process, the average demodulation threshold of two adjacent groups of coded bits is used to determine whether the demodulated soft information enters the decoder for inner iterative decoding. This method can reduce the number of inner iterations, thereby helping to reduce computational overhead. Furthermore, when the demodulator detects the soft information of the i-th group of CSK symbols, it can process it immediately without waiting for detection of subsequent groups. This parallel processing demodulation method can effectively reduce the data processing latency of visible light communication systems.
[0069] Furthermore, in order to demonstrate the superiority of the proposed new detection scheme, the average inner iterations required for successful decoding of AR4JA codes by the detection method of the present invention are compared with those of the traditional detection scheme, and the results are shown in Table 1.
[0070] Operation plan Average number of inner iterations Traditional testing 40.36 New detection 25.43
[0071] Table 1 Comparison of the average number of inner iterations required for successful decoding of AR4JA codes under two different detection schemes
[0072] As can be seen from Table 1, the average number of inner iterations required to successfully decode the AR4JA code using the detection method of the present invention is less than that required using the traditional detection scheme. This indicates that the hardware overhead required for the visible light communication CSK system using the new detection method proposed in this invention is relatively low.
[0073] Moreover, based on different detection schemes, the bit error performance simulation of the regular-AR4JA prototype codeword with code rate 1 / 2 on the 16-order irregular CSK system is carried out. The simulation results are as follows: Figure 3It can be found that the detection method of the present invention has better bit error performance than the traditional detection scheme, which shows that the detection method of the present invention can improve the performance of the irregular CSK system.
[0074] It can be seen that the detection method of the visible light communication CSK system according to the present invention has a faster detection speed and better bit error performance than the traditional method.
[0075] Based on the above-mentioned detection method of the visible light communication CSK system, the present invention also provides a detection device of the visible light communication CSK system, including a receiving module, an external iteration module, an external comparison module, an internal iteration module, a judgment module, an internal comparison module and a feedback module.
[0076] The receiving module is used to receive coded bits, and the coded bits include l groups.
[0077] The external iteration module is used to perform external iterative calculation on the received coded bits to obtain the average external likelihood information of the i-th group of coded bits at the q1-th iteration. Where q1 = 1, 2, …, Q1, Q1 is the maximum number of outer iterations, and i = 1, 2, …, l.
[0078] Specifically, the external iteration module includes a priori unit and an average priori unit, wherein the priori unit is used to calculate the external likelihood information corresponding to the i-th group of coded bits using the maximum logarithm domain maximum a posteriori probability algorithm and the corresponding prior likelihood information. The average prior unit is used to calculate the external likelihood information of the i-th group of coded bits according to the formula Calculate and obtain the average external likelihood information
[0079] The external comparison module is used to compare the average external likelihood information of the i-th group of coded bits during the q1-th and q1+1-th external iterations to obtain the average external likelihood information difference γ i , if γ i ≥γ, the inner iteration module is started, otherwise it returns to the outer iteration module to execute the next iteration, where is the average external likelihood information of the i-th group of coded bits at the q1-th iteration, is the average external likelihood information of the i-th group of coded bits at the q1+1-th iteration, and ≥γ is the demodulation threshold.
[0080] The inner iteration module is used to perform inner iterative decoding on the i-th group of coded bits and obtain the average posterior likelihood information corresponding to the i-th group of coded bits at the q2-th inner iteration. Where q2=1,2,…,Q2, Q2 is the maximum number of inner iterations.
[0081] Specifically, the inner iteration module includes a posterior unit and an average posterior unit, wherein the posterior unit is used to calculate the likelihood information of the i-th group of coded bits according to the belief propagation algorithm, update the likelihood information of the corresponding variable nodes and check nodes, and thereby obtain the posterior likelihood information corresponding to the group of coded bits The average a posteriori unit is used to calculate the a posteriori likelihood information of the i-th group of coded bits according to the formula Calculate and obtain the average posterior likelihood information
[0082] The judgment module is used to judge whether the decoding is successful. If the decoding is successful, the decoding result is output; otherwise, the internal comparison module is started.
[0083] The internal comparison module is used according to the formula Determine the average posterior likelihood information difference between two adjacent times like Then return to the inner iteration module to perform the next iteration, otherwise output the posterior likelihood information of the i-th group of coded bits, where β is the decoding threshold.
[0084] The feedback unit is used to set the posterior likelihood information of the i-th group of coded bits as the prior likelihood information of the next outer iterative calculation.
[0085] The above-described embodiments merely represent several implementations of the present invention. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present invention. It should be noted that a person skilled in the art would be able to make numerous modifications and improvements without departing from the spirit of the present invention, and the present invention is intended to encompass such modifications and variations.
Claims
1. A detection method for a visible light communication CSK system, characterized by: The following steps are involved: S10, receiving the coded bits to be detected; S20, perform external iterative calculation on the received coded bits to obtain the average external likelihood information of the i-th group of coded bits at the q1-th iteration Where q1 = 1, 2, ..., Q1, Q1 is the maximum number of outer iterations, i = 1, 2, ..., l, l is the maximum number of groups of coded bits; S30, comparing the average external likelihood information of the i-th group of coded bits during the q1-th and q1+1-th external iterations to obtain the average external likelihood information difference γ i , if γ i ≥γ, then execute the subsequent steps, otherwise return to step S20 to execute the next iteration, where is the average external likelihood information of the i-th group of coded bits at the q1-th iteration, is the average external likelihood information of the i-th group of coded bits at the q1+1th iteration, ≥γ is the demodulation threshold; S40, perform inner iterative decoding on the i-th group of coded bits, and obtain the average posterior likelihood information corresponding to the i-th group of coded bits at the q2-th inner iteration Where q2=1,2,…,Q2, Q2 is the maximum number of inner iterations; S50, determining whether the decoding is successful, if the decoding is successful, outputting the decoding result, otherwise executing the next step; S60, according to the formula Determine the average posterior likelihood information difference between two adjacent times like Then return to step S40 to perform the next iteration; otherwise, output the posterior likelihood information of the i-th group of coded bits, where β is the decoding threshold.
2. The detection method of the visible light communication CSK system according to claim 1, characterized in that: The step S20 includes the following sub-steps: S21, using the maximum logarithm domain maximum a posteriori probability algorithm and the corresponding prior likelihood information to calculate the extrinsic likelihood information corresponding to the i-th group of coded bits received, S22, the external likelihood information of the i-th group of coded bits is calculated according to the formula Calculate and obtain the average external likelihood information 3. The detection method of the visible light communication CSK system according to claim 2, characterized in that: The step S40 includes the following sub-steps: S41, calculate the likelihood information of the i-th group of coded bits according to the belief propagation algorithm, update the likelihood information of the corresponding variable nodes and check nodes, and thereby obtain the posterior likelihood information corresponding to the group of coded bits S42, the posterior likelihood information of the i-th group of coded bits is calculated according to the formula Calculate and obtain the average posterior likelihood information 4. The detection method of the visible light communication CSK system according to claim 3, characterized in that: The method further includes step S70: setting the posterior likelihood information of the i-th group of coded bits as the prior likelihood information for the next outer iterative calculation.
5. A detection device for a visible light communication CSK system, characterized in that: It includes a receiving module, an external iteration module, an external comparison module, an internal iteration module, a judgment module and an internal comparison module; The receiving module is used to receive the coded bits to be detected; The external iteration module is used to perform external iterative calculation on the received coded bits to obtain the average external likelihood information of the i-th group of coded bits at the q1-th iteration. Where q1 = 1, 2, ..., Q1, Q1 is the maximum number of outer iterations, i = 1, 2, ..., l, l is the maximum number of groups of coded bits; The external comparison module is used to compare the average external likelihood information of the i-th group of coded bits during the q1-th and q1+1-th external iterations to obtain the average external likelihood information difference γ i , if γ i ≥γ, the inner iteration module is started, otherwise it returns to the outer iteration module to execute the next iteration, where is the average external likelihood information of the i-th group of coded bits at the q1-th iteration, is the average external likelihood information of the i-th group of coded bits at the q1+1th iteration, and γ is the demodulation threshold; The inner iteration module is used to perform inner iterative decoding on the i-th group of coded bits and obtain the average posterior likelihood information corresponding to the i-th group of coded bits at the q2-th inner iteration. Where q2=1,2,…,Q2, Q2 is the maximum number of inner iterations; The judgment module is used to judge whether the decoding is successful, and output the decoding result if the decoding is successful, otherwise the internal comparison module is activated; The internal comparison module is used according to the formula Determine the average posterior likelihood information difference between two adjacent times like Then return to the inner iteration module to perform the next iteration, otherwise output the posterior likelihood information of the i-th group of coded bits, where β is the decoding threshold.
6. The detection device of the visible light communication CSK system according to claim 5, characterized in that: The inner iteration module includes a priori unit and an average priori unit; The a priori unit is used to calculate the external likelihood information corresponding to the i-th group of coded bits using the maximum logarithm domain maximum a posteriori probability algorithm and the corresponding a priori likelihood information to obtain the external likelihood information corresponding to the group of coded bits The average prior unit is used to calculate the external likelihood information of the i-th group of coded bits according to the formula Calculate and obtain the average external likelihood information 7. The detection device of the visible light communication CSK system according to claim 6, characterized in that: The inner iteration module includes a posterior unit and an average posterior unit; The a posteriori unit is used to calculate the likelihood information of the i-th group of coded bits according to the belief propagation algorithm, update the likelihood information of the corresponding variable nodes and check nodes, and thereby obtain the a posteriori likelihood information corresponding to the group of coded bits The average a posteriori unit is used to calculate the a posteriori likelihood information of the i-th group of coded bits according to the formula Calculate and obtain the average posterior likelihood information 8. The detection device of the visible light communication CSK system according to claim 7, characterized in that: The system further comprises a feedback unit, which is used to set the posterior likelihood information of the i-th group of coded bits as the prior likelihood information of the next outer iterative calculation.
