HPLC carrier communication data efficient transmission algorithm

Abstract

The invention provides an efficient transmission algorithm for HPLC carrier communication data, which belongs to the technical field of carrier communication, and comprises the following steps of: step 1, double-link separation processing: respectively processing frame control data and load data by adopting two separated links; 2, a frame control data processing flow: carrying out improved Turbo coding on the frame control data; step 3, a load data processing flow: firstly, carrying out adaptive scrambling on load data, and adopting Turbo coding with different parameter configuration from frame control data; step 4, OFDM symbol generation and transmission: adopting an optimized fast algorithm to reduce the operand and the processing time; and step 5, receiving end processing flow: respectively adjusting frame control and load data by adopting AGC (Automatic Gain Control) and time synchronization. The algorithm is high in anti-interference capability, remarkably reduces the bit error rate, is high in transmission efficiency, can adapt to different power line channel environments and data transmission requirements, and has good universality and stability.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of carrier communication, and particularly relates to a high-efficiency transmission algorithm for HPLC carrier communication data. BACKGROUND

[0002] With the rapid development of smart grid, smart home and other fields, higher requirements are put forward for the data transmission performance of high-speed power line carrier communication (HPLC). In the prior art, HPLC communication faces many challenges. On the one hand, the power line channel characteristics are complex, and there are a large amount of noise interference such as impulse noise and background noise, which will seriously affect the accuracy of data transmission and increase the bit error rate. On the other hand, the multipath effect causes different path delays and attenuations of the signal in the transmission process, resulting in distortion and interference of the signal received by the receiving end. In addition, the existing data transmission algorithm lacks pertinence when processing different types of data, and cannot fully exert the transmission advantages of frame control data and payload data. For example, in the traditional algorithm, the frame control data and the payload data adopt the same encoding, interleaving and transmission strategy, without considering the characteristics that the frame control data has higher requirements for real-time performance and accuracy, and the payload data has higher requirements for transmission efficiency, which leads to low overall data transmission efficiency and cannot meet the growing data transmission demand. SUMMARY

[0003] The present application mainly provides a high-efficiency transmission algorithm for HPLC carrier communication data to solve the technical problems in the background.

[0004] The technical solution adopted by the present application to solve the above technical problems is as follows: A high-efficiency transmission algorithm for HPLC carrier communication data, comprising the following steps: Step one, double-link separation processing: at the transmitting end, the physical layer receives input from the data link layer, and adopts two separate links to process frame control data and payload data respectively; Step two, frame control data processing flow: the frame control data is first processed by an improved Turbo coding mode, which optimizes the generator polynomial and interleaver design on the basis of the traditional Turbo code to enhance the error correction performance; Step three, payload data processing flow: the payload data is first adaptively scrambled, and the scrambling sequence is dynamically adjusted according to the statistical characteristics of the data to make the data spectrum more uniform and reduce the inter-code interference, and then a Turbo coding with different parameter configurations is adopted than that of the frame control data to adapt to the characteristics of large amount of payload data and high requirement for transmission efficiency; Step four, OFDM symbol generation and transmission: the mapped data is processed by IFFT, in the IFFT processing process, the optimized fast algorithm is adopted, the operation amount and processing time are reduced; the cyclic prefix is added to form the OFDM symbol, and the cyclic prefix length is dynamically adjusted according to the maximum multipath delay of the channel; Step five, the receiving end processing flow: at the receiving end, after the data is received from the analog front end, AGC and time synchronization are cooperated to adjust the frame control and the load data respectively.

[0005] Optionally, in the application, in step one, the frame control data link focuses on ensuring the accuracy and timely transmission of the frame control information, and the processing flow is optimized according to the characteristics of high real-time and accuracy requirements; and the load data link focuses on improving the transmission efficiency of the actual data content, and a special algorithm is designed according to the characteristics of large load data.

[0006] Optionally, in the application, in step one, the frame control and the load data adopt different mapping modes, wherein the frame control is mapped by QPSK; and the load data can be mapped by BPSK, QPSK or 16QAM.

[0007] Optionally, in the application, in step two, after encoding, deep channel interleaving is performed, a dynamic interleaving strategy is adopted, the interleaving parameters are adjusted in real time according to the channel state information, and burst errors are effectively resisted; then, frame control diversity copying is performed, network coding technology is combined, the copied data is encoded and combined, and the reliability and redundancy of data transmission are further improved.

[0008] Optionally, in the application, in step three, after the channel interleaving, the load diversity copying based on block is performed, different redundancies are allocated according to the importance levels of the data blocks, and the transmission reliability of important data blocks is improved; finally, the processed frame control data and load data are mapped together to constellation points, a new constellation mapping algorithm is adopted, the spectrum efficiency is improved, and the bit error rate is reduced.

[0009] Optionally, in the application, in step three, the load data stream is subjected to XOR operation with a repeated pseudo-random noise sequence generated by the following scrambling polynomial: S(X)=X 10 +X 3 + 1 When starting to process each PB, the initial values of the scrambling polynomials are all set to 1, each time a data bit is input, the scrambling polynomial is left shifted by one bit, and the third bit and the tenth bit thereof are subjected to XOR operation, and the output result is subjected to XOR operation with the input data, so that the output data can be obtained.

[0010] Optionally, in the application, the load data supports four modes of PB72, PB136, PB264 and PB520, wherein the three modes of PB72, PB136 and PB264 support 1 / 2 code rate, and the PB520 mode supports 1 / 2 code rate and 16 / 18 two code rates.

[0011] Optionally, in the application, in the fourth step, a preamble symbol is added for windowing processing, the preamble symbol contains rich synchronization and channel estimation information, and an adaptive window function is used for the windowing function, parameters of the window function are dynamically adjusted according to spectral characteristics of the signal, spectral leakage of the signal is reduced, spectral utilization of the signal is improved, and finally a PPDU signal is formed and sent to an analog front end and then to a power line channel.

[0012] Optionally, in the application, in the fifth step, an intelligent gain control algorithm is used for AGC, gain is dynamically adjusted according to a signal-to-noise ratio and signal strength of a received signal, and a multipath diversity synchronization technology is used for time synchronization, effective information in a multipath signal is fully utilized, and synchronization accuracy is improved.

[0013] Optionally, in the application, in the fifth step, after FFT transformation is performed on the frame control and the load data, the frame control and the load data enter a demodulation and decoding module, a demodulation algorithm based on maximum likelihood estimation is used for demodulation, and channel estimation information is combined to improve accuracy of demodulation.

[0014] Optionally, in the application, in the fifth step, a corresponding efficient decoding algorithm is used for the decoding module according to different encoding modes of the frame control data and the load data, and finally original data of the frame control information and original data of the load are recovered.

[0015] Compared with the prior art, the application has the following beneficial effects: 1. Strong anti-interference capability: through improved Turbo coding, dynamic channel interleaving, diversity copy combined with network coding and adaptive scrambling, noise interference and multipath effects in a power line channel are effectively resisted, a bit error rate is significantly reduced, and reliability of data transmission is improved.

[0016] 2. High transmission efficiency: double-link separation processing and an optimized processing strategy for different types of data give full play to transmission advantages of frame control data and load data, meanwhile, a new constellation mapping algorithm and an optimized IFFT algorithm improve spectral efficiency and processing speed, and overall data transmission efficiency is improved.

[0017] 3. Good adaptability: intelligent AGC algorithm, multipath diversity synchronization technology and algorithm design of dynamically adjusting parameters enable the algorithm of the application to adapt to different power line channel environments and data transmission requirements, and the algorithm has good universality and stability.

[0018] The application will be described in greater detail with reference to the accompanying drawings, in which: BRIEF DESCRIPTION OF DRAWINGS

[0019] Figure 1 A flow chart of the transmission algorithm of the application; Figure 2 A timing diagram of the OFDM symbol of the application; Figure 3 A flow chart of the frame control FEC of the application; Figure 4 A scrambling flow chart of the application; Figure 5 A Turbo encoder architecture diagram of the application; Figure 6 An ENC1 / ENC2 encoding architecture diagram of the application; Figure 7 A diagram of the diversity copy parameters of the application. DETAILED DESCRIPTION

[0020] In order to facilitate the understanding of the application, the application will be described in more detail below with reference to the accompanying drawings, in which several embodiments of the application are given. However, the application can be realized in different forms and is not limited to the embodiments described herein. On the contrary, these embodiments are provided to make the disclosure of the application more thorough and comprehensive.

[0021] It should be noted that when an element is referred to as being "fixedly attached" to another element, it can be directly on the other element or there can be intervening elements between the two elements. When an element is referred to as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements can be present. The terms "vertical", "horizontal", "left", "right", and the like as used herein are used for ease of description to describe the orientation of the application.

[0022] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used in the description of the application herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. The use of the terms "and / or" includes a combination of one or more of the associated listed items.

[0023] The embodiments of the present application provide a high-efficiency transmission algorithm for HPLC carrier communication data, which comprises the following steps: Step one, double-link separation processing: at the transmitting end, the physical layer receives input from the data link layer, and uses two separate links to process frame control data and payload data respectively; Step two, frame control data processing flow: frame control data is first processed by an improved Turbo coding method, which optimizes the generator polynomial and interleaver design on the basis of the traditional Turbo code to enhance the error correction performance. Step three, payload data processing flow: the payload data is first adaptively scrambled, and the scrambling sequence is dynamically adjusted according to the statistical characteristics of the data, so that the data spectrum is more uniform and the inter-symbol interference is reduced, and then a Turbo coding with different parameter configurations is used for frame control data to adapt to the characteristics of large amount of payload data and high transmission efficiency requirements. Step four, OFDM symbol generation and transmission: the mapped data is processed by IFFT, and an optimized fast algorithm is used in the IFFT processing process to reduce the computation amount and processing time; a cyclic prefix is added to form an OFDM symbol, and the cyclic prefix length is dynamically adjusted according to the maximum multipath delay of the channel. Step five, receiving end processing flow: at the receiving end, after receiving the data from the analog front end, AGC and time synchronization are used to adjust the frame control and payload data respectively.

[0024] It should be noted that in this embodiment, the physical layer OFDM symbol is based on a 25MHz clock sampling rate in the time domain. After taking the real part of the data after 1024-point IFFT, a cyclic prefix is added to form an OFDM symbol, and the cyclic prefix is composed of a roll-off interval and a guard interval. The OFDM symbol timing is shown in Figure 2 The OFDM symbol characteristics are shown in Table 1.

[0025]

[0026] Optionally, in step one, the frame control data link focuses on ensuring the accuracy and timely transmission of frame control information, and the processing flow is optimized according to the characteristics of high real-time and accuracy requirements; the payload data link focuses on improving the transmission efficiency of the actual data content, and a special algorithm is designed according to the characteristics of large amount of payload data.

[0027] It should be noted that in this embodiment, in a certain smart grid data acquisition and transmission scenario, it is assumed that a large amount of meter data needs to be transmitted to the data center through the HPLC network. The transmitting end receives the data uploaded by the meter, which includes frame control data such as meter address, transmission control instruction, and payload data such as real-time measurement of power, voltage, and current of the meter.

[0028] At the transmitting end: The frame control data link first performs improved Turbo coding on the frame control data, sets the coding rate to 3 / 4, and optimizes the interleaver to use a chaotic mapping-based interleaving manner to enhance the error correction capability. Deep channel interleaving is performed, and the interleaving depth is dynamically adjusted between 64-256 according to the real-time monitored channel state information. Frame control diversity copies combined with network coding are performed, and the data is copied four times and encoded combined.

[0029] The payload data link first performs adaptive scrambling, and dynamically generates a scrambling sequence according to the statistical characteristics of the payload data. Turbo coding with a coding rate of 2 / 3 is performed, and block-based channel interleaving is performed, and the block size is dynamically adjusted according to the data volume. Block-based payload diversity copying is performed, and for important data blocks such as power data blocks, the redundancy is set to 3, and for other data blocks, the redundancy is set to 2. Then the processed frame control data and payload data are mapped together to new constellation points, an improved 16-QAM constellation mapping algorithm is used to improve the spectral efficiency. The mapped data is processed by an optimized IFFT, the IFFT point number is 2048, and the cyclic prefix length is dynamically adjusted between 128-256 according to the maximum multipath delay of the channel. After adding a preamble containing rich synchronization and channel estimation information, adaptive Hanning windowing is used for windowing, and finally a PPDU signal is formed and sent to the power line channel.

[0030] At the receiving end: After receiving the signal, the AGC uses an intelligent gain control algorithm to dynamically adjust the gain according to the signal-to-noise ratio and strength of the received signal. Time synchronization uses multipath diversity synchronization technology to improve synchronization accuracy. FFT transformation is performed on the frame control and payload data, and the FFT point number is consistent with the IFFT point number at the transmitting end, which is 2048. Demodulation uses a maximum likelihood estimation-based demodulation algorithm combined with channel estimation information for demodulation. The decoding module uses corresponding efficient decoding algorithms for the different encoding methods of the frame control data and the payload data to recover the original frame control information and payload data, completing efficient data transmission.

[0031] Optionally, in step one, the frame control and payload data use different mapping methods, wherein the frame control uses QPSK for mapping; and the payload data can use BPSK, QPSK, or 16QAM for mapping.

[0032] It should be noted that in this embodiment, the obtained address is a subcarrier number, and each subcarrier carries a corresponding number of bits according to different modulation modes, i.e., if BPSK modulation is used, subcarrier 1 carries data bit 0; if QPSK modulation is used, subcarrier 1 carries data bits 0 and 1; and if 16QAM modulation is used, subcarrier 1 carries data bits 0, 1, 2, and 3.

[0033] Optionally, in step two, deep channel interleaving is performed after encoding, using a dynamic interleaving strategy to adjust the interleaving parameters in real time according to the channel state information, effectively resisting sudden errors; then frame control diversity copying is performed, and the copied data is encoded and combined with network coding technology to further improve the reliability and redundancy of data transmission.

[0034] Optionally, in step three, after channel interleaving, a block-based payload diversity copy is performed, and different redundancies are allocated according to the importance level of the data blocks to improve the transmission reliability of important data blocks. Finally, the processed frame control data and payload data are mapped together to constellation points using a new constellation mapping algorithm to improve spectral efficiency while reducing the bit error rate.

[0035] Optionally, in step three, the payload data stream is XORed with a repeating pseudo-random noise sequence generated by the following scrambling polynomial, the calculation formula of which is: S(X) = X10 + X3 + 1 When processing each PB, the initial value of the scrambling polynomial is set to 1. For each input data bit, the scrambling polynomial is shifted left by one bit, and its 3rd and 10th bits are XORed. The output result is then XORed with the input data to obtain the output data.

[0036] It should be noted that, in this embodiment, the scrambling implementation process is as follows: Figure 4 As shown.

[0037] Optionally, in this invention, the payload data supports four modes: PB72, PB136, PB264, and PB520. Among them, the PB72, PB136, and PB264 modes support 1 / 2 bitrate, while the PB520 mode supports both 1 / 2 bitrate and 16 / 18 bitrate.

[0038] It should be noted that, in this embodiment, the Turbo encoder architecture is as follows: Figure 5 As shown.

[0039] ENC1 and ENC2 use an 8-state encoder. The first bit of the input data stream is mapped to u1, the second bit to u2, and so on. In an ENC, each pair of bits corresponds to a check bit in the output. The check bits p and q are calculated based on... Figure 6 Sure.

[0040] The Turbo interleaver is used to interleave the original data and use it as the input of the second member code. Turbo interleaving is performed in units of two bits. The interleaver length is equal to the number of two bits of the original data block length. The parameters of Turbo interleaving are defined as shown in Table 3. Different parameters are used for different PB lengths, including PB16 frame control, PB72, PB136, PB264, and PB520.

[0041] Table 2 below shows the Turbo interleaving parameters.

[0042]

[0043] Optionally, in step four, a preamble symbol is added for windowing processing. The preamble symbol contains rich synchronization and channel estimation information. The windowing function adopts an adaptive window function, which dynamically adjusts the window function parameters according to the spectral characteristics of the signal to reduce the spectral leakage of the signal and improve the spectral utilization of the signal. Finally, a PPDU signal is formed and sent to the analog front end to be transmitted into the power line channel.

[0044] Optionally, in step five, AGC employs an intelligent gain control algorithm to dynamically adjust the gain based on the signal-to-noise ratio and signal strength of the received signal. Time synchronization utilizes multipath diversity synchronization technology to fully leverage the effective information in the multipath signal and improve synchronization accuracy.

[0045] Optionally, in step five, after performing FFT transformation on the frame control and payload data, the data enters the demodulation and decoding module. The demodulation uses a demodulation algorithm based on maximum likelihood estimation, combined with channel estimation information, to improve the accuracy of demodulation.

[0046] Optionally, in step five, the decoding module uses a corresponding efficient decoding algorithm for different encoding methods of frame control data and payload data, and finally recovers the original data of frame control information and payload.

[0047] It should be noted that in this embodiment, the data after Turbo encoding retains the order before encoding, with the information bits first and the check bits last. The check bits p and q are interleaved, with p first and q last. The channel interleaving includes the following four steps: information code interleaving, check code interleaving, interleaving between information code and check code, and half-byte shifting.

[0048] Interleaving of the information codes writes the information codes output by the Turbo encoder into the matrix storage space. The encoder sequentially outputs the first K / 4 bits into block 1, the second K / 4 bits into block 2, the third K / 4 bits into block 3, and the fourth K / 4 bits into block 4. This is equivalent to storing the information bits in a K / 4 row, 4 column matrix, where column 1 represents block 1, column 2 represents block 2, column 3 represents block 3, and column 4 represents block 4. During interleaving, 4 bits from each row are read out simultaneously. When reading data from the matrix, we start from row 0. Each time we read the first row, the address is incremented by a step size (StepSize). The first round of row address reading is (0, StepSize, 2*StepSize, ...). After reading [K / 4] / StepSize rows, we reach the end of the matrix. Then, in the next round, the row address is incremented by 1. Each subsequent row address reading is incremented by StepSize, and after reading [K / 4] / StepSize rows, we reach the end again. The second round of row address reading is (1, 1+StepSize, 1+2*StepSize, ...). In the third round, the row address is incremented by 1 to 2, and so on, until all rows have been read after StepSize rounds.

[0049] The checksum interleaving process involves the first (NK) / 4 bits of the Turbo-encoded checksum bits being inserted into block 1, the second (NK) / 4 bits into block 2, the third (NK) / 4 bits into block 3, and the fourth (NK) / 4 bits into block 4. This can be viewed as storing the checksum bits in a (NK) / 4 x 4 matrix, where the first column represents block 1, the second column represents block 2, the third column represents block 3, and the fourth column represents block 4. For a 1 / 2 bitrate, the parity bits are read similarly to the information bits, except that the first read of the parity bits starts from the row defined by the parity offset parameter `offset`, and the step size parameter is still `StepSize`, which we define as `T = (NK) / 4`. The order of the rows read in the first round is `(offset, (offset + StepSize) mod T, (offset + 2 * StepSize) mod T, ...)`. Then, in the second round, the first row is incremented by 1, and the process repeats for `StepSize - 1` rounds, and finally, after `StepSize` rounds, T / `StepSize` rows of data are read in each round, for a total of T rows of data. For a 16 / 18 bitrate, the row pointer is not initialized after each round of reading. Instead, the process continues to read `(offset, (offset + StepSize) mod T, (offset + 2 * StepSize) mod T, ...)` from the beginning until all T rows have been read.

[0050] The interleaving between the information bits and the check bits is as follows: for a 1 / 2 bit rate, the first 4 bits of the output are the information bits, followed by 4 bits of the check bits, and so on. For a 16 / 18 bit rate, the sequence is: first 3 four-bit information bits, then 4-bit check bits, and finally 5 four-bit information bits, repeating this pattern.

[0051] The nibble shift is performed in units of 4 bits. Regardless of whether it is information bits or parity bits, the order is adjusted every two nibbles, as shown in Table 3.

[0052]

[0053] In the table above, b0 indicates that the bit comes from block 1, which is the information or check bit, and so on. b1 indicates that the bit comes from block 2, b2 indicates that it comes from block 3, and b3 indicates that it comes from block 4. When the bits are output serially, the leftmost bit of the four bits is output first, from left to right.

[0054] It should be noted that in this embodiment, diversity copy is used to divide and map the original signal, and process it independently for each PB. When only the diversity count is 1, if the carrier of the last symbol is not filled, the remaining carriers are filled sequentially starting from the 0th bit of the original data until the carrier of this symbol is filled.

[0055] Diversity copy processes the original data according to the payload data diversity copy process, based on the different number of copies in the selected mode. If InData(i) represents the bits output by the channel interleaver, the bit sequence OutData(i) output by diversity copy will be derived below.

[0056] X = |a| means that x takes the largest integer less than or equal to a, i.e., rounded down. The diversity copy parameters are as follows: Figure 7 As shown.

[0057] The present invention has been described by way of example in conjunction with the accompanying drawings. Obviously, the specific implementation of the present invention is not limited to the above-described manner. Any non-substantial improvement made by adopting the inventive concept and technical solution of the present invention, or the direct application of the inventive concept and technical solution of the present invention to other occasions without modification, shall be within the protection scope of the present invention.

Claims

1. A high-efficiency data transmission algorithm for HPLC carrier communication, characterized in that, Includes the following steps: Step 1, Dual-link Separation Processing: At the transmitting end, the physical layer receives input from the data link layer and uses two separate links to process frame control data and payload data respectively. Step 2, Frame control data processing flow: Frame control data first passes through an improved Turbo coding method, which optimizes the generator polynomial and interleaver design based on the traditional Turbo code to enhance error correction performance; Step 3, Payload Data Processing Flow: The payload data is first adaptively scrambled, and the scrambling sequence is dynamically adjusted according to the statistical characteristics of the data to make the data spectrum more uniform and reduce inter-symbol interference. Then, Turbo encoding with different parameter configurations than the frame control data is adopted to adapt to the characteristics of large payload data volume and high transmission efficiency requirements. Step 4, OFDM symbol generation and transmission: The mapped data is processed by IFFT. During the IFFT process, an optimized fast algorithm is used to reduce the amount of computation and processing time. A cyclic prefix is ​​added to form an OFDM symbol, and the length of the cyclic prefix is ​​dynamically adjusted according to the maximum multipath delay of the channel. Step 5, Receiver processing flow: At the receiver, after receiving data from the analog front end, AGC and time synchronization are used in concert to adjust the frame control and payload data respectively.

2. The high-efficiency data transmission algorithm for HPLC carrier communication according to claim 1, characterized in that, In step one, the frame control data link focuses on ensuring the accurate and timely transmission of frame control information, and optimizes the processing flow to meet its high requirements for real-time performance and accuracy; the payload data link focuses on improving the transmission efficiency of actual data content, and designs special algorithms based on the large amount of payload data.

3. The high-efficiency data transmission algorithm for HPLC carrier communication according to claim 1, characterized in that, In step one, frame control and payload data use different mapping methods. Frame control is mapped using QPSK, while payload data can be mapped using BPSK, QPSK, or 16QAM.

4. The high-efficiency data transmission algorithm for HPLC carrier communication according to claim 1, characterized in that, In step two, deep channel interleaving is performed after encoding, and a dynamic interleaving strategy is adopted to adjust the interleaving parameters in real time according to the channel state information, which effectively resists sudden errors. Then, frame control diversity copying is performed, and the copied data is encoded and combined with network coding technology to further improve the reliability and redundancy of data transmission.

5. The high-efficiency data transmission algorithm for HPLC carrier communication according to claim 1, characterized in that, In step three, after channel interleaving, a block-based payload diversity copy is performed, and different redundancies are allocated according to the importance level of the data blocks to improve the transmission reliability of important data blocks. Finally, the processed frame control data and payload data are mapped together to constellation points using a new constellation mapping algorithm, which improves spectral efficiency while reducing the bit error rate.

6. The high-efficiency data transmission algorithm for HPLC carrier communication according to claim 1, characterized in that, In step three, the payload data stream is XORed with a repeating pseudo-random noise sequence generated by the following scrambling polynomial, the calculation formula of which is: S(X)=X 10 +X 3 + 1 When processing each PB, the initial value of the scrambling polynomial is set to 1. For each input data bit, the scrambling polynomial is shifted left by one bit, and its 3rd and 10th bits are XORed. The output result is then XORed with the input data to obtain the output data.

7. The high-efficiency data transmission algorithm for HPLC carrier communication according to claim 6, characterized in that, The payload data supports four modes: PB72, PB136, PB264, and PB520. Among them, the PB72, PB136, and PB264 modes support 1 / 2 bitrate, while the PB520 mode supports both 1 / 2 bitrate and 16 / 18 bitrate.

8. The high-efficiency data transmission algorithm for HPLC carrier communication according to claim 1, characterized in that, In step four, a preamble symbol is added for windowing processing. The preamble symbol contains rich synchronization and channel estimation information. The windowing function adopts an adaptive window function, which dynamically adjusts the window function parameters according to the spectral characteristics of the signal to reduce spectral leakage and improve the spectral utilization of the signal. Finally, a PPDU signal is formed and sent to the analog front end to be transmitted into the power line channel.

9. The high-efficiency data transmission algorithm for HPLC carrier communication according to claim 1, characterized in that, In step five, AGC employs an intelligent gain control algorithm to dynamically adjust the gain based on the signal-to-noise ratio and signal strength of the received signal. Time synchronization utilizes multipath diversity synchronization technology to fully leverage the effective information in multipath signals and improve synchronization accuracy.

10. The high-efficiency data transmission algorithm for HPLC carrier communication according to claim 9, characterized in that, In step five, after performing FFT transformation on the frame control and payload data, the data enters the demodulation and decoding module. The demodulation adopts a demodulation algorithm based on maximum likelihood estimation, combined with channel estimation information, to improve the accuracy of demodulation.

11. The high-efficiency data transmission algorithm for HPLC carrier communication according to claim 10, characterized in that, In step five, the decoding module uses corresponding efficient decoding algorithms for different encoding methods of frame control data and payload data, and finally recovers the original data of frame control information and payload.

Images