Communication method, system, device and storage medium based on simulated fountain code
By BPSK modulation and simulated fountain code binary information of simulated fountain code communication, and using the weight matrix to calculate the encoding information, the problems of low reliability and large delay in analog fountain code communication are solved, and efficient communication reliability and low latency are achieved Effect.
Patent Information
- Application Number
- CN202310153531.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-02-21
- Publication Date
- 2024-11-15
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
The existing communication based on analog fountain codes is low in reliability and long in latency, which cannot meet the high reliability and low-latency communication requirements of URLLC application scenarios.
After BPSK modulation of the binary information of the communication, the simulated fountain encoding is used to obtain the target weight value between the elements in turn, form a weight matrix, and calculate the encoded information based on the weight matrix and information, and send it to the preset channel for communication. This improves communication reliability and reduces latency.
It effectively improves the communication reliability of the simulated fountain code, shortens the decoding time, reduces the communication delay, and achieves a lower bit error rate under high signal-to-noise ratio, and has a code-free error platform.
Smart Images

Figure CN116470989B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of communication coding technology, and in particular to a communication method, system, device and storage medium based on simulated fountain codes. Background Art
[0002] In the related technologies, the 5G standard defines three application scenarios, namely enhanced mobile broadband (eMBB), massive machine type communication (mMTC) and ultra-reliable low latency communication (URLLC). Future application scenarios of URLLC include intelligent transportation systems, factory automation, tactile Internet, remote surgery, etc. These scenarios require communication quality with high reliability and low latency. In order to realize various application scenarios, researchers have proposed a variety of research directions, including waveform design, multiple access, multi-antenna technology, etc. Among them, channel coding technology is still a very promising research direction. Since Shannon laid the theoretical foundation, channel coding has made rapid progress in the past few decades and has been applied in various fields. In channel coding technology, the role of various codes is to correct or detect errors in the data in the interfered channel to improve the reliability of data transmission. For example, in the 5G standard, polar codes are used for the control channel of eMBB, and LDPC codes are used for the data channel of eMBB. The discussion on URLLC is still ongoing.
[0003] To meet the delay requirements of URLLC application scenarios, an effective method is to use a shorter transmission time interval, which means using a channel coding design with a short code length. In order to find a channel coding solution with a short code length, researchers have refocused on traditional channel coding such as RS code and BCH code. Soft decision decoders will provide better performance. TBCC codes in convolutional codes eliminate rate loss and improve performance, and are also considered for URLLC. The short code length performance of polar codes and LDPC codes is also under study. Another solution is to use rateless codes. Using rateless codes can transmit data without the need for channel state information. This channel coding method can save feedback time. For example, simulated fountain codes are rateless codes. However, the current communication reliability based on simulated fountain codes is low and the delay is long. Summary of the invention
[0004] The present invention aims to solve at least one of the technical problems existing in the prior art. To this end, the present invention proposes a communication method, system, device and storage medium based on simulated fountain codes, which can effectively improve the communication reliability based on simulated fountain codes and reduce communication delay.
[0005] On the one hand, an embodiment of the present invention provides a communication method based on simulated fountain codes, comprising the following steps:
[0006] Obtaining first binary information of the communication;
[0007] Performing BPSK modulation on the first binary information to obtain second binary information;
[0008] After performing simulated fountain coding on the second binary information, coded information is obtained;
[0009] Sending the coded information to a preset channel for communication;
[0010] The step of performing simulated fountain coding on the second binary information to obtain coded information includes:
[0011] sequentially obtaining a target weight value of one element and each element in the second binary information, wherein the target weight value is used to characterize the magnitude of the connection between the elements;
[0012] Combining all the target weight values into a weight matrix;
[0013] The encoding information is calculated based on the weight matrix and the second binary information.
[0014] In some embodiments, the step of obtaining a target weight value of one element and each element in the second binary information includes:
[0015] Determining the number of elements of the second binary information;
[0016] Get the initial and final values;
[0017] Calculate the initial interval length according to the number of elements, the initial value and the end value;
[0018] Determine, according to the initial interval length, a number of first to-be-selected weight values equal to the number of elements;
[0019] A weight value is selected from the first candidate weight values as a target weight value according to the relationship between one of the elements in the second binary information and each element.
[0020] In some embodiments, after determining the number of candidate weight values equal to the number of elements according to the initial interval length, the method further comprises the following steps:
[0021] Calculate the sum of squares of all the first candidate weight values;
[0022] normalizing the sum of squares;
[0023] The first candidate weight value is optimized according to the normalized value to obtain a second candidate weight value.
[0024] In some embodiments, the calculating the initial interval length according to the number of elements, the initial value and the termination value includes:
[0025] According to the number of elements, the initial value and the end value, the initial interval length is calculated by the following formula:
[0026]
[0027] in, represents the initial interval length, Indicates the number of elements, represents the initial value, Indicates the end value.
[0028] In some embodiments, optimizing the first candidate weight value according to the normalized value to obtain the second candidate weight value includes:
[0029] According to the normalized value, the first candidate weight value is optimized by the following formula to obtain the second candidate weight value:
[0030]
[0031] in, represents the second candidate weight value, represents the first candidate weight value, Indicates the normalized value.
[0032] In some embodiments, the step of calculating the encoding information according to the weight matrix and the second binary information includes:
[0033] According to the weight matrix and the second binary information, the encoding information is calculated by the following formula:
[0034]
[0035] in, represents the matrix corresponding to all the second binary information, Represents the matrix corresponding to all the coded information, represents the weight matrix.
[0036] On the other hand, an embodiment of the present invention provides a communication system based on simulated fountain codes, including:
[0037] The first module is used to obtain the first binary information of the communication;
[0038] A second module is used to perform BPSK modulation on the first binary information to obtain second binary information;
[0039] A third module is used to simulate fountain coding on the second binary information to obtain coded information;
[0040] A fourth module is used to send the coded information to a preset channel for communication;
[0041] The step of performing simulated fountain coding on the second binary information to obtain coded information includes:
[0042] sequentially obtaining a target weight value of one element and each element in the second binary information, wherein the target weight value is used to characterize the magnitude of the connection between the elements;
[0043] Combining all the target weight values into a weight matrix;
[0044] The encoding information is calculated based on the weight matrix and the second binary information.
[0045] In some embodiments, obtaining a target weight value of one element and each element in the second binary information includes:
[0046] Determining the number of elements of the second binary information;
[0047] Get the initial and final values;
[0048] Calculate the initial interval length according to the number of elements, the initial value and the end value;
[0049] Determine, according to the initial interval length, a number of first weight values to be selected that is equal to the number of elements;
[0050] A weight value is selected from the first candidate weight values as a target weight value according to the relationship between one of the elements in the second binary information and each element.
[0051] On the other hand, an embodiment of the present invention provides a communication device based on simulated fountain code, including:
[0052] at least one memory for storing a program;
[0053] At least one processor is used to load the program to execute the communication method based on simulated fountain code.
[0054] On the other hand, an embodiment of the present invention provides a storage medium storing a computer-executable program, wherein the computer-executable program is used to implement the communication method based on simulated fountain codes when executed by a processor.
[0055] The communication method based on simulated fountain code provided by the embodiment of the present invention has the following beneficial effects:
[0056] In the communication process of this embodiment, after BPSK modulation is performed on the first binary information, simulated fountain coding is performed on the adjusted signal; when performing simulated fountain coding, after sequentially obtaining the target weight values representing the size of the connection between one element and each element in the second binary information, all the target weight values are combined into a weight matrix, and the coded information is calculated based on the weight matrix and the second binary information; then the coded information is sent to a preset channel for communication, thereby effectively improving the communication reliability based on the simulated fountain code and reducing the communication delay.
[0057] Additional aspects and advantages of the present invention will be given in part in the following description and in part will be obvious from the following description, or will be learned through practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS
[0058] The present invention will be further described below with reference to the accompanying drawings and embodiments, wherein:
[0059] Figure 1 This is a flow chart of a communication method based on simulated fountain code according to an embodiment of the present invention;
[0060] Figure 2 This is a schematic diagram of a random ring arrangement according to an embodiment of the present invention;
[0061] Figure 3 A schematic diagram of the relationship between binary information bits according to an embodiment of the present invention;
[0062] Figure 4 This is a schematic diagram of conversion of a first binary information bit according to an embodiment of the present invention;
[0063] Figure 5 This is a schematic diagram of conversion of a second binary information bit according to an embodiment of the present invention;
[0064] Figure 6 A schematic diagram of the structure of a simulation system according to an embodiment of the present invention;
[0065] Figure 7 The figure is a performance comparison diagram of an embodiment of the present invention. DETAILED DESCRIPTION
[0066] Embodiments of the present invention are described in detail below, examples of which are shown in the accompanying drawings, wherein the same or similar reference numerals throughout represent the same or similar elements or elements having the same or similar functions. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and cannot be understood as limiting the present invention.
[0067] In the description of the present invention, it should be understood that descriptions involving orientations, such as up, down, front, back, left, right, etc., and orientations or positional relationships indicated are based on the orientations or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present invention.
[0068] In the description of the present invention, "several" means more than one, "many" means more than two, "greater than", "less than", "exceed", etc. are understood to exclude the number itself, and "above", "below", "within", etc. are understood to include the number itself. If there is a description of "first" or "second", it is only used for the purpose of distinguishing the technical features, and cannot be understood as indicating or implying the relative importance or implicitly indicating the number of the indicated technical features or implicitly indicating the order of the indicated technical features.
[0069] In the description of the present invention, unless otherwise clearly defined, terms such as setting, installing, connecting, etc. should be understood in a broad sense, and technicians in the relevant technical field can reasonably determine the specific meanings of the above terms in the present invention based on the specific content of the technical solution.
[0070] In the description of the present invention, the description with reference to the terms "one embodiment", "some embodiments", "illustrative embodiments", "examples", "specific examples", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner.
[0071] Reference Figure 1 The embodiment of the present invention provides a communication method based on simulated fountain code, including but not limited to the following steps:
[0072] Step S110, obtaining first binary information of communication;
[0073] Step S120, performing BPSK modulation on the first binary information to obtain second binary information;
[0074] Step S130, after performing simulated fountain coding on the second binary information, coded information is obtained;
[0075] Step S140, sending the coded information to a preset channel for communication;
[0076] The step of performing simulated fountain coding on the second binary information to obtain coded information includes:
[0077] Sequentially obtain a target weight value of one element and each element in the second binary information, wherein the target weight value is used to represent the size of the connection between the elements;
[0078] All target weight values are combined into a weight matrix;
[0079] The coding information is calculated based on the weight matrix and the second binary information.
[0080] In the implementation of this application, the first binary information may be {0,1}, and the second binary information may be {-1,1}. Take 5 binary information bits as the first binary information as an example:
[0081] First, the five binary information bits are modulated by BPSK and then randomly arranged in a ring to obtain the following Figure 2 Then, after establishing the relationship between the elements, we get Figure 3 The structure shown. Figure 3 In the structure, is a weight set, representing the connection between two binary information bits. generate The process is as Figure 4 As shown. Among them, is the information bit symbol after BPSK modulation, is the corresponding encoded symbol. Figure 3 In the example, the value of the edge connecting ①→① is k, corresponding to Figure 4 In the middle Connect to , the weight value of its connecting edge is k; Figure 3 The value of the edge connecting ①→② is , corresponding to Figure 4 In the middle Connect to , the weight value of its connecting edge is - ; Figure 3 The value of the edge connecting ①→③ is , corresponding to Figure 4 Then Connect to , the weight value of its connecting edge is - ; Similarly, Figure 3 The value of the edge connecting ④→① is , corresponding to Figure 4 Then Connect to , the weight value of its connecting edge is ; Figure 3 The value of the connecting edge ⑤→① is , corresponding to Figure 4 Then Connect to , the weight value of its connecting edge is Finally, we can get Encoded weight value According to the weight value and the information symbol, the coding symbol can be calculated .
[0082] Similarly, according to Figure 3 You can get symbols The weights required for encoding ,See Figure 5 , and then get the encoding symbol . From the previous content, we can know that the generated weight matrix can be obtained in the end , through the coding formula Can get In some embodiments, the value of k in this application can be 1. From the matrix G, we can see that we only need the weight set This structure can strengthen the connection between two information bits, enhance the anti-interference ability of the information bits in the Gaussian channel transmission process, and enhance the recovery ability at the decoding end.
[0083] In some embodiments, the weight values in the matrix can be designed in the following manner: first determine the number of elements in the second binary information, and obtain the initial value and the end value; then calculate the initial interval length according to the number of elements, the initial value and the end value; and then determine the weight values equal to the number of elements according to the initial interval length as the first weight value to be selected. In an embodiment of the present application, after obtaining the first weight value to be selected, a weight value can be selected from the first weight value to be selected as the target weight value according to the relationship between one of the elements in the second binary information and each element.
[0084] In some embodiments, the first candidate weight value may be further optimized. Specifically, the square sum of all first candidate weight values is calculated and normalized, and then the first candidate weight value is optimized according to the normalized value to obtain the second candidate weight value.
[0085] From this, we can see that the calculation process of the weight value can be summarized as follows:
[0086] Step 1: Enter the number of elements F and set the initial value and the end value . This step is to give the interval of the weight value.
[0087] Step 2: Calculate the initial interval length of the weight set , get F weight values through the length of the interval .
[0088] Step 3: Find the sum of the squares of all elements in the weight set: .
[0089] Step 4: Perform normalization processing, let .
[0090] Step 5: Further process all weight values: .
[0091] Step 6: Finally get the optimized weight set .
[0092] In the embodiment of the present application, F can be any positive integer. , n is the number of information elements in each group.
[0093] In some embodiments, the communication method of the present application is applied to Figure 6 In the simulation system shown, the original binary data (i.e., the first binary information) {0,1} sequence is modulated by BPSK and then subjected to the simulated fountain coding (TFE-AFC) of the present application. After passing through the Gaussian channel, channel decoding and BPSK demodulation are performed to obtain the original data. The BER performance of TFE-AFC is compared with that of different code rates, and the following is obtained: Figure 7 The simulation performance comparison chart is shown. Figure 7 It can be seen that the TFE-AFC coding method has a bit error rate of 10 -4 In the case of TFE-AFC, the gain is 0.03dB higher than that of S-AFC with a code rate of 0.67, and 0.52dB and 1.29dB higher than that of S-AFC with code rates of 0.8 and 1, respectively. -6 The bit error rate is 0.001 and there is no error platform.
[0094] It can be seen from this that the code length of the simulated fountain code proposed in this application can be reduced to single digits, shortening the decoding time, and has good error performance and no error platform, which can effectively improve the communication reliability based on the simulated fountain code and reduce communication delays.
[0095] The embodiment of the present invention provides a communication system based on simulated fountain codes, including:
[0096] The first module is used to obtain the first binary information of the communication;
[0097] A second module is used to perform BPSK modulation on the first binary information to obtain second binary information;
[0098] A third module is used to simulate fountain coding on the second binary information to obtain coded information;
[0099] A fourth module is used to send the coded information to a preset channel for communication;
[0100] The step of performing simulated fountain coding on the second binary information to obtain coded information includes:
[0101] sequentially obtaining a target weight value of one element and each element in the second binary information, wherein the target weight value is used to characterize the magnitude of the connection between the elements;
[0102] Combining all the target weight values into a weight matrix;
[0103] The encoding information is calculated based on the weight matrix and the second binary information.
[0104] In the embodiment of the present application, in the step of obtaining the target weight value of one element and each element in the second binary information, it can be performed in the following manner:
[0105] Determining the number of elements of the second binary information;
[0106] Get the initial and final values;
[0107] Calculate the initial interval length according to the number of elements, the initial value and the end value;
[0108] Determine, according to the initial interval length, a number of first weight values to be selected that is equal to the number of elements;
[0109] A weight value is selected from the first candidate weight values as a target weight value according to the relationship between one of the elements in the second binary information and each element.
[0110] The contents of the method embodiments of the present invention are all applicable to the system embodiments. The functions specifically implemented by the system embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method.
[0111] An embodiment of the present invention provides a communication device based on simulated fountain codes, including:
[0112] at least one memory for storing a program;
[0113] At least one processor for loading the program to execute Figure 1 The communication method based on simulated fountain code is shown.
[0114] The contents of the method embodiments of the present invention are all applicable to the device embodiments. The functions specifically implemented by the device embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.
[0115] An embodiment of the present invention provides a storage medium, wherein a computer executable program is stored, and when the computer executable program is executed by a processor, it is used to implement Figure 1 The communication method based on simulated fountain code is shown.
[0116] The contents of the method embodiments of the present invention are all applicable to the storage medium embodiments. The functions specifically implemented by the storage medium embodiments are the same as those of the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.
[0117] In addition, an embodiment of the present invention further provides a computer program product or a computer program, wherein the computer program product or the computer program includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. A processor of a computer device can read the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes Figure 1 The communication method based on simulated fountain code is shown.
[0118] The embodiments of the present invention are described in detail above in conjunction with the accompanying drawings, but the present invention is not limited to the above embodiments. Various changes can be made within the knowledge of ordinary technicians in the relevant technical field without departing from the purpose of the present invention. In addition, the embodiments of the present invention and the features in the embodiments can be combined with each other without conflict.
Claims
1. A communication method based on simulated fountain code, characterized in that: The following steps are involved: Obtaining first binary information of the communication; Performing BPSK modulation on the first binary information to obtain second binary information; After performing simulated fountain coding on the second binary information, coded information is obtained; Sending the coded information to a preset channel for communication; The step of performing simulated fountain coding on the second binary information to obtain coded information includes: sequentially obtaining a target weight value of one element and each element in the second binary information, wherein the target weight value is used to characterize the magnitude of the connection between the elements; Combining all the target weight values into a weight matrix; Calculate and obtain encoding information according to the weight matrix and the second binary information; The step of obtaining a target weight value of one element and each element in the second binary information includes: Determining the number of elements of the second binary information; Get the initial and final values; Calculate the initial interval length according to the number of elements, the initial value and the end value; Determine, according to the initial interval length, a number of first to-be-selected weight values equal to the number of elements; According to the relationship between one of the elements in the second binary information and each element, selecting a weight value from the first candidate weight values as a target weight value; After determining the number of to-be-selected weight values equal to the number of elements according to the initial interval length, the method further comprises the following steps: Calculate the sum of squares of all the first candidate weight values; normalizing the sum of squares; Optimizing the first candidate weight value according to the normalized value to obtain a second candidate weight value; The calculating the initial interval length according to the number of elements, the initial value and the termination value comprises: According to the number of elements, the initial value and the end value, the initial interval length is calculated by the following formula: in, represents the initial interval length, Indicates the number of elements, represents the initial value, Indicates the end value.
2. A communication method based on simulated fountain code according to claim 1, characterized in that: The step of optimizing the first candidate weight value according to the normalized value to obtain a second candidate weight value includes: According to the normalized value, the first candidate weight value is optimized by the following formula to obtain the second candidate weight value: in, represents the second candidate weight value, represents the first candidate weight value, Indicates the normalized value.
3. A communication method based on simulated fountain code according to claim 1, characterized in that: The step of calculating the encoding information according to the weight matrix and the second binary information includes: According to the weight matrix and the second binary information, the encoding information is calculated by the following formula: in, represents the matrix corresponding to all the second binary information, Represents the matrix corresponding to all the encoding information, represents the weight matrix.
4. A communication system based on simulated fountain codes, characterized in that: include: The first module is used to obtain the first binary information of the communication; A second module is used to perform BPSK modulation on the first binary information to obtain second binary information; A third module is used to simulate fountain coding on the second binary information to obtain coded information; A fourth module is used to send the coded information to a preset channel for communication; The step of performing simulated fountain coding on the second binary information to obtain coded information includes: sequentially obtaining a target weight value of one element and each element in the second binary information, wherein the target weight value is used to characterize the magnitude of the connection between the elements; Combining all the target weight values into a weight matrix; Calculate and obtain encoding information according to the weight matrix and the second binary information; The step of obtaining a target weight value of one element and each element in the second binary information includes: Determining the number of elements of the second binary information; Get the initial and final values; Calculate the initial interval length according to the number of elements, the initial value and the end value; Determine, according to the initial interval length, a number of first to-be-selected weight values equal to the number of elements; According to the relationship between one of the elements in the second binary information and each element, selecting a weight value from the first candidate weight values as a target weight value; After determining the number of to-be-selected weight values equal to the number of elements according to the initial interval length, the following steps are also included: Calculate the sum of squares of all the first candidate weight values; normalizing the sum of squares; Optimizing the first candidate weight value according to the normalized value to obtain a second candidate weight value; The calculating the initial interval length according to the number of elements, the initial value and the termination value comprises: According to the number of elements, the initial value and the end value, the initial interval length is calculated by the following formula: in, represents the initial interval length, Indicates the number of elements, represents the initial value, Indicates the end value.
5. A communication device based on simulated fountain code, characterized in that: include: at least one memory for storing a program; At least one processor is used to load the program to execute the communication method based on simulated fountain code according to any one of claims 1 to 3.
6. A storage medium, characterized in that: A computer executable program is stored therein, and when the computer executable program is executed by a processor, it is used to implement the communication method based on simulated fountain code as described in any one of claims 1 to 3.
