A HPLC dual-mode wireless communication preamble generation method and a communication method

Abstract

A HPLC double-mode wireless communication preamble generation method and a communication method, the preamble generation method comprising: S1. setting an integer sequence with a certain calculation rule, taking the power index product of the sequence as the index parameter; S2. taking the natural number as the base, taking the product of the index parameter multiplied by the integer multiple of the circumference as the exponent to obtain the base sequence; S3. different transformations are performed on the base sequence, and the new extended sequence is formed by expansion and splicing; S4. copy a certain number of preamble unit sequence to form a complete preamble, and increase the mirror copy processing; S5. using a binary pseudo-random sequence with autocorrelation characteristics as a symbol scrambling sequence, the length of which is the length of the preamble unit sequence, periodically scrambling the preamble to obtain a complete preamble. The generated preamble has constant envelope characteristics, low power peak-to-average ratio, low device requirements, and can effectively support the application of communication terminal cost-sensitive communication systems; has excellent autocorrelation characteristics and sliding measurement characteristics, and has better noise-resistant signal characteristics.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to signal communication synchronization technology, proposing a method for generating a preamble for HPLC dual-mode wireless communication and a communication method. Background Technology

[0002] In the field of communication technology, preambles are a commonly used technique for data transmission between senders and receivers. They provide the receiver with a starting point for parsing data and help estimate and compensate for noise in the transmission channel. Furthermore, some preambles can also help the receiver determine control parameters such as transmission rate and encoding method. By introducing a preamble sequence with specific properties before data transmission, reliable data transmission between senders and receivers can be achieved.

[0003] Preamble technology also faces some fundamental principles and challenges in communication systems. In actual communication channels, there are channel delays, clock skews, and various interferences and noises, all of which can lead to performance issues such as synchronization, error correction, and robustness in preamble technology.

[0004] Existing HPLC dual-mode wireless communication preamble technology still faces challenges in various aspects such as synchronization, error correction, adaptability, overhead efficiency, and compatibility. Summary of the Invention

[0005] To overcome the shortcomings of existing technologies, this invention proposes a method for generating a preamble for HPLC dual-mode wireless communication and a communication method.

[0006] A method for generating a preamble for HPLC dual-mode wireless communication includes the following steps:

[0007] S1. Set up an integer sequence with certain calculation rules, using the product of the exponents of the sequence as the index parameter;

[0008] S2. Obtain the base sequence by multiplying the index parameter by an integer multiple of pi, with natural numbers as the base;

[0009] S3. Perform different transformations on the base sequence and then splice them together to form a new extended sequence;

[0010] S4. According to system performance requirements, a certain number of preamble unit sequences are copied to form a complete preamble, and mirror copying is added;

[0011] S5. Use a binary pseudo-random sequence with autocorrelation characteristics as the symbol scrambling sequence, with a length equal to the length of the preamble unit sequence, and scramble the preamble periodically to obtain the complete preamble.

[0012] Furthermore, in step S1:

[0013] Integer sequences with certain calculation rules include the Fibonacci sequence, arithmetic sequence, geometric sequence, or power sequence. The corresponding integer sequences are generated according to the sequence calculation rule formula and then exponentially calculated to obtain the index parameter sequence index0.

[0014] Furthermore, in step S2:

[0015] Furthermore, setting the length L0 of the required preamble unit sequence, the index parameter sequence in step S1 is generated by dividing L0 by n, and the circular periodicity feature is transformed using L0 bit period. The transformation relationship is as follows:

[0016] index1(k)=while(index0(k)>L0)index0(k)-L0,k=0,1,...L0 / n-1

[0017] Wherein, index0 is the index parameter sequence in step S1; index1 is the index parameter sequence after periodic conversion with L0 as the period length; L0 is the length of the preamble unit sequence; k is the sequence number; n is a positive integer power of 2, and it is required that L0 / n be rounded to at least greater than 4, which is used to set the unit sequence segmentation conversion rules;

[0018] S2-2. The base sequence is calculated using the following transformation formula:

[0019] Seq0 = exp(1j*m*pi*index1 / L0)

[0020] Where Seq0 is the calculated base sequence with length L0 / n; index1 is the index parameter sequence after periodic conversion with length L0 / n; pi is pi; and m is an integer multiple of pi. <n。

[0021] Furthermore, in step S3, the transformation includes one or more of the following: order transformation, positive-negative phase transformation, and conjugate transformation.

[0022] Furthermore, in step S3:

[0023] S3-1. In the transformation rules, the number sequence transformation refers to taking numbers in reverse order, so the transformed sequence fragment of the base sequence is a mirror image of the base sequence; positive and negative phase transformation refers to multiplying the elements in the sequence by -1 to obtain a sequence in which some elements are inversely related; taking conjugate means multiplying the imaginary part of the elements in the sequence by -1 to obtain a sequence in which the elements are conjugate.

[0024] S3-2. If the length of the preamble unit sequence is L0 and the length of the base sequence is L0 / n, then the first segment of the preamble unit sequence is the base sequence, and the subsequent extended and concatenated sequence segments are n-1 segments transformed from the base sequence; the maximum extension rule is 4 segments, and the transformation rules are as follows:

[0025] The first segment, Seq1, is a base sequence: Seq1 = Seq0;

[0026] The second part, Seq2, involves reversing the order of the base sequence and taking its conjugate, resulting in the mirror conjugate sequence of the base sequence: Seq2 = Seq0. * (L0 / n-1:-1:0);

[0027] The third segment, Seq3, is a parity-positive-negative transformation of Seq1:

[0028] Seq3 = Seq1; Seq3(odd number index) = -Seq1(odd number index);

[0029] The fourth segment, Seq4, is a parity-positive-negative transformation of Seq2:

[0030] Seq4 = Seq2; Seq4(even-number index) = -Seq2(even-number index);

[0031] If n = 2, then only the first and second parts of the transformation rule are used; This yields...

[0032] PreambleUnit = [Seq1, Seq2];

[0033] If n = 4, then using all transformation rules, we get:

[0034] PreambleUnit=[Seq1,Seq2,Seq3,Seq4];

[0035] If n > 4, then the subsequent sequence is expanded by replicating n / 4 times with a period of 4 segments; thus obtaining

[0036] PreambleUnit=[Seq1, Seq2, Seq3, Seq4, Seq1, Seq2, Seq3, Seq4,...].

[0037] Furthermore, in step S4:

[0038] Based on system performance requirements, the preamble unit sequence PreambleUnit is expanded by N segments, with the expansion rule being: the number of copies is counted starting from 1 (Cnt).

[0039] When Cnt is odd, the copying is a reverse copy, which is a mirror copy.

[0040] When Cnt is even, the copy is a direct copy using the sequence number.

[0041] Furthermore, in step S5:

[0042] The length of the binary pseudo-random sequence is the same as the length of the preamble L0, and bit0 is mapped to -1 and bit1 is mapped to +1 to obtain the positive and negative scrambling sequence SeqPN; or, the mapping rule is reversed, with bit0 mapped to +1 and bit1 mapped to -1; each segment of PreambleUnit obtained in step S4 is multiplied by the current scrambling sequence SeqPN to obtain the complete preamble sequence.

[0043] A dual-mode wireless communication method for HPLC, wherein a preamble generated by the preamble generation method described above is used during the data transmission process of the communication transceiver.

[0044] A computer-readable storage medium storing a computer program that, when executed by a processor, implements the preamble generation method.

[0045] The beneficial effects of this invention are:

[0046] This invention proposes a method for generating a preamble for HPLC-based dual-mode wireless communication and a corresponding communication method. Through reasonable parameter configuration, performance and overhead can be negotiated, providing good adaptability and flexibility. Furthermore, the preamble generated by this method exhibits constant envelope characteristics, low peak-to-average power ratio, and low device requirements, effectively supporting communication system applications sensitive to the cost of communication terminals. Further, modeling and simulation of noise and multipath channels show that the preamble generated by this invention possesses excellent autocorrelation and sliding metric characteristics, demonstrating good resistance to noise and suppression of multipath channels.

[0047] Other beneficial effects of the embodiments of the present invention will be further described below. Attached Figure Description

[0048] Figure 1 This is a flowchart of the preamble generation method according to an embodiment of the present invention;

[0049] Figure 2 This is a waveform diagram of the real and imaginary parts of the preamble unit sequence according to an embodiment of the present invention;

[0050] Figure 3 This is a diagram showing the autocorrelation characteristics of the preamble in an embodiment of the present invention.

[0051] Figure 4 This is a graph showing the autocorrelation metric characteristics of the preamble in an embodiment of the present invention.

[0052] Figure 5 The waveforms of the real and imaginary parts of the preamble in an embodiment of the present invention are shown in the figure with Gaussian noise and Rayleigh channel added.

[0053] Figure 6This is a diagram showing the autocorrelation characteristics of the preamble in an embodiment of the present invention under Gaussian noise and Rayleigh channel conditions. Detailed Implementation

[0054] To make the technical problems, technical solutions, and advantages of the embodiments of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

[0055] The HPLC dual-mode wireless communication preamble generation method of the present invention can be widely used in various communication transceivers, especially in HPLC dual-mode wireless communication systems, and is applicable to both multipath and non-multipath scenarios.

[0056] The flowchart of an HPLC dual-mode wireless communication preamble generation method according to an embodiment of the present invention is as follows: Figure 1 As shown, it includes the following steps:

[0057] S1. Set up an integer sequence with certain calculation rules, using the product of the exponents of the sequence as the index parameter;

[0058] S2. Obtain the base sequence by multiplying the index parameter by an integer multiple of pi, with natural numbers as the base;

[0059] S3. Perform different transformations on the base sequence, such as ordering, positive / negative phase transformation, and conjugation, and then expand and splice them to form a new extended sequence;

[0060] S4. According to system performance requirements, a certain number of preamble unit sequences are copied to form a complete preamble, and mirror copying is added;

[0061] S5. Use a binary pseudo-random sequence with good autocorrelation characteristics as the symbol scrambling sequence, with a length equal to the length of the preamble unit sequence, and scramble the preamble periodically to obtain the complete preamble.

[0062] Based on this method, the algorithm design using synchronization technology can simultaneously support the acquisition of symbol timing synchronization and frame synchronization information, and can also be used to calculate characteristic quantities of channel noise. By considering the requirements of the channel environment and system performance, performance and overhead can be negotiated through reasonable parameter configuration, providing good adaptability and flexibility. Furthermore, the preamble generated by the method of this invention has constant envelope characteristics, low peak-to-average power ratio, and low device requirements, effectively supporting communication system applications that are sensitive to the cost of communication terminals. Further, modeling and simulation of noise and multipath channels show that the preamble generated by this invention has excellent autocorrelation and sliding metric characteristics, exhibiting good resistance to noise and suppression of multipath channels.

[0063] In some embodiments, in step S1:

[0064] Integer sequences with certain calculation rules include, but are not limited to: Fibonacci sequences, arithmetic sequences, geometric sequences, and power sequences. The corresponding integer sequences are generated according to the sequence calculation rules formula, and then exponentialized to obtain the index parameter sequence index0.

[0065] In some embodiments, in step S2:

[0066] S2-1. Set the length L0 of the required preamble unit sequence. Then, the index parameter sequence in step S1 is generated by dividing L0 by n, and the circular period feature is converted using L0 bit period. The conversion relationship is as follows:

[0067] index1(k)=while(index0(k)>L0)index0(k)-L0,k=0,1,...L0 / n-1

[0068] Wherein, index0 is the index parameter sequence in step S1; index1 is the index parameter sequence after periodic conversion with L0 as the period length; L0 is the length of the preamble unit sequence; k is the sequence number; n is a positive integer power of 2, and it is required that L0 / n be rounded to at least 4, which is used to set the unit sequence segmentation conversion rules.

[0069] S2-2. The base sequence is calculated using the following transformation formula:

[0070] Seq0 = exp(1j*m*pi*index1 / L0)

[0071] Where Seq0 is the calculated base sequence with length L0 / n; index1 is the index parameter sequence after periodic conversion with length L0 / n; pi is pi; and m is an integer multiple of pi. <n。

[0072] In some embodiments, in step S3:

[0073] S3-1. In the transformation rules, the number sequence transformation refers to taking numbers in reverse order, so the transformed sequence fragment of the base sequence is a mirror image of the base sequence; positive and negative phase transformation refers to multiplying the elements in the sequence by -1 to obtain a sequence in which some elements are inversely related; taking conjugate means multiplying the imaginary part of the elements in the sequence by -1 to obtain a sequence in which the elements are conjugate.

[0074] S3-2. If the length of the preamble unit sequence is L0, and the length of the base sequence is L0 / n, then the first segment of the preamble unit sequence is the base sequence, and the subsequent extended and concatenated sequence segments are n-1 segments transformed from the base sequence. The maximum extension rule is 4 segments, and the transformation rules are as follows:

[0075] The first segment, Seq1, is a base sequence: Seq1 = Seq0.

[0076] The second part, Seq2, involves reversing the order of the base sequence and taking its conjugate, resulting in the mirror conjugate sequence of the base sequence: Seq2 = Seq0. * (L0 / n-1:-1:0).

[0077] The third segment, Seq3, is a parity-positive-negative transformation of Seq1:

[0078] Seq3 = Seq1; Seq3(odd number index) = -Seq1(odd number index).

[0079] The fourth segment, Seq4, is a parity-positive-negative transformation of Seq2:

[0080] Seq4 = Seq2; Seq4(even-number sequence number) = -Seq2(even-number sequence number).

[0081] If n = 2, then only the first and second parts of the transformation rule are used; This yields...

[0082] PreambleUnit = [Seq1, Seq2].

[0083] If n = 4, then using all transformation rules, we get:

[0084] PreambleUnit=[Seq1,Seq2,Seq3,Seq4].

[0085] If n > 4, then the subsequent sequence is expanded by replicating n / 4 times with a period of 4 segments; thus obtaining

[0086] PreambleUnit=[Seq1, Seq2, Seq3, Seq4, Seq1, Seq2, Seq3, Seq4,...].

[0087] In some embodiments, in step S4:

[0088] Based on system performance requirements, the preamble unit sequence PreambleUnit is expanded by N segments, with the expansion rule being: the number of copies is counted starting from 1 (Cnt).

[0089] When Cnt is odd, the copying is a reverse copy, which is a mirror copy.

[0090] When Cnt is even, the copy is a direct copy using the sequence number.

[0091] In some embodiments, in step S5:

[0092] The length of the binary pseudo-random sequence is the same as the preamble length L0, and bit 0 is mapped to -1, and bit 1 is mapped to +1, resulting in a positive and negative scrambling sequence SeqPN. Alternatively, the mapping rule can be reversed, with bit 0 mapped to +1 and bit 1 mapped to -1, with the same effect. Each segment of PreambleUnit obtained in step S4 is multiplied by the current scrambling sequence SeqPN to obtain the complete preamble sequence.

[0093] In one specific embodiment, the Fibonacci sequence is used to generate the index parameters, and the Kasami sequence is selected as the scrambling sequence. The relevant parameter settings are shown in the table below:

[0094]

[0095]

[0096] Furthermore, the channel model was set to a 10dB Gaussian noise environment, and a Rayleigh channel model with 6 randomly generated paths was constructed. The parameters of the Rayleigh channel model are shown in the table below:

[0097] Path number Attenuation (dB) Delay (sample) Angle (rad) 1 -2 0 -1..3405 2 -6 4 -0.0604 3 -2 14 -2.9564 4 -12 5 2.8576 5 -14 12 2.8127 6 -11 3 2.5396

[0098] For the characteristics of the preamble generated in the embodiments of the present invention, please refer to [reference needed]. Figures 2 to 6 , Figure 2 The real and imaginary parts of the preamble unit sequence according to an embodiment of the present invention are shown. Figure 3 The autocorrelation characteristics of the preamble in an embodiment of the present invention are shown. Figure 4 The autocorrelation metric characteristics of the preamble in an embodiment of the present invention are shown. Figure 5 The diagram shows the real and imaginary part waveforms of the preamble in an embodiment of the present invention with added Gaussian noise and a Rayleigh channel. Figure 6 The diagram shows the autocorrelation characteristics of the preamble of an embodiment of the present invention under Gaussian noise and Rayleigh channel conditions.

[0099] This invention also provides an HPLC dual-mode wireless communication method, wherein a preamble generated by the preamble generation method described above is used during the data transmission process of the communication transceiver.

[0100] In summary, the HPLC dual-mode wireless communication preamble generation method and communication method proposed in this invention allow for performance and overhead negotiation through reasonable parameter configuration, providing good adaptability and flexibility. Furthermore, the preamble generated by this method exhibits constant envelope characteristics, low peak-to-average power ratio, and low device requirements, effectively supporting communication system applications sensitive to communication terminal costs. Further, modeling and simulation of noise and multipath channels show that the preamble generated by this invention possesses excellent autocorrelation and sliding metric characteristics, demonstrating good resistance to noise and suppression of multipath channels.

[0101] The background section of this invention may include background information about the problems or environment in which the invention is being developed, and is not necessarily a description of prior art. Therefore, the content included in the background section does not constitute an admission of prior art by the applicant.

[0102] The above description provides a further detailed explanation of the present invention in conjunction with specific / preferred embodiments, and it should not be construed that the specific implementation of the present invention is limited to these descriptions. For those skilled in the art, various substitutions or modifications can be made to these described embodiments without departing from the concept of the present invention, and all such substitutions or modifications should be considered within the scope of protection of the present invention. In the description of this specification, the reference to terms such as "an embodiment," "some embodiments," "preferred embodiment," "example," "specific example," or "some examples," etc., indicates that the specific features, structures, materials, or characteristics described in connection with that embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials, or characteristics described can be combined in any suitable manner in one or more embodiments or examples. Without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification and the features of different embodiments or examples. Although the embodiments of the present invention and their advantages have been described in detail, it should be understood that various changes, substitutions, and modifications can be made herein without departing from the scope of protection of the patent application.

Claims

1. A method for generating a preamble for HPLC dual-mode wireless communication, characterized in that: Includes the following steps: S1. Set up an integer sequence with certain calculation rules, and perform exponentiation on each integer in the sequence to obtain an index parameter sequence; S2. Using the natural constant e as the base and the product of the index parameter multiplied by an integer multiple of pi as the exponent, the base sequence is obtained through exponential function operations; S3. Perform different transformations on the base sequence and then splice them together to form a new extended sequence; S4. According to system performance requirements, copy a certain number of preamble unit sequences to form a complete preamble, and add mirror copying processing; S5. Use a binary pseudo-random sequence with autocorrelation characteristics as the symbol scrambling sequence, with a length equal to the length of the preamble unit sequence, and scramble the preamble periodically to obtain the complete preamble; In step S1: Integer sequences with certain calculation rules include Fibonacci sequences, arithmetic sequences, geometric sequences, or power sequences. The corresponding integer sequences are generated according to the sequence calculation rule formula, and the index parameter sequence index0 is obtained by power calculation. In step S2: S2-1. Set the length L0 of the required preamble unit sequence. Then, the index parameter sequence in step S1 is generated by dividing L0 by n, and the circular period feature is transformed using L0 bit period. The transformation relationship is as follows: ； Wherein, index0 is the index parameter sequence in step S1; index1 is the index parameter sequence after periodic conversion with L0 as the period length; L0 is the length of the preamble unit sequence; k is the sequence number; n is a positive integer power of 2, and it is required that L0 / n be rounded to at least greater than 4, which is used to set the unit sequence segmentation conversion rules; S2-2. The base sequence is calculated using the following transformation formula: ； Where Seq0 is the calculated base sequence with length L0 / n; index1 is the index parameter sequence after periodic conversion with length L0 / n; pi is pi; m is an integer multiple coefficient of pi. <n。 2. The preamble generation method as described in claim 1, characterized in that: In step S3, the transformation includes one or more of the following: order transformation, positive-negative phase transformation, and conjugate transformation.

3. The preamble generation method as described in claim 2, characterized in that: In step S3: S3-1. In the transformation rules, the number sequence transformation refers to taking numbers in reverse order, so the transformed sequence fragment of the base sequence is a mirror image of the base sequence; positive and negative phase transformation refers to multiplying the elements in the sequence by -1 to obtain a sequence in which some elements are inversely related; taking conjugate means multiplying the imaginary part of the elements in the sequence by -1 to obtain a sequence in which the elements are conjugate. S3-2. If the length of the preamble unit sequence is L0 and the length of the base sequence is L0 / n, then the first segment of the preamble unit sequence is the base sequence, and the subsequent extended and concatenated sequence segments are n-1 segments transformed from the base sequence; the maximum extension rule is 4 segments, and the transformation rules are as follows: The first Seq1 segment is the base sequence: ; The second segment, Seq2, involves reversing the order of the base sequence and taking its conjugate, resulting in a mirror conjugate sequence of the base sequence. ; The third segment, Seq3, is a parity-positive-negative transformation of Seq1: ； The fourth segment, Seq4, is a parity-positive-negative transformation of Seq2: ； If n=2, then only the first and second parts of the transformation rule are used; get PreambleUnit = [Seq1, Seq2]; If n=4, then use all transformation rules; to obtain PreambleUnit= [Seq1, Seq2, Seq3, Seq4]; If n > 4, then the subsequent sequence is expanded by replicating n / 4 times with a period of 4 segments; thus obtaining PreambleUnit= [Seq1, Seq2, Seq3, Seq4, Seq1, Seq2, Seq3, Seq4, ...].

4. The preamble generation method according to any one of claims 1 to 3, characterized in that: In step S4: Based on system performance requirements, the preamble unit sequence PreambleUnit is expanded by N segments, with the expansion rule being: the number of copies is counted starting from 1 (Cnt). When Cnt is odd, the copying is a reverse copy, which is a mirror copy. When Cnt is even, the copy is a direct copy using the sequence number.

5. The preamble generation method according to any one of claims 1 to 3, characterized in that: In step S5: The length of the binary pseudo-random sequence is the same as the length of the preamble L0, and bit0 is mapped to -1 and bit1 is mapped to +1 to obtain the positive and negative scrambling sequence SeqPN; or, the mapping rule is reversed, with bit0 mapped to +1 and bit1 mapped to -1; each segment of PreambleUnit obtained in step S4 is multiplied by the current scrambling sequence SeqPN to obtain the complete preamble sequence.

6. A dual-mode wireless communication method for HPLC, characterized in that: During data transmission in a communication transceiver, a preamble generated using the preamble generation method as described in any one of claims 1 to 5 is used.

7. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, it implements the preamble generation method as described in any one of claims 1 to 5.

Images