WO2018068540A1

WO2018068540A1 - Overlapped multiplexing-based modulation and demodulation method and device

Info

Publication number: WO2018068540A1
Application number: PCT/CN2017/091965
Authority: WO
Inventors: 刘若鹏; 季春霖; 郑昊; 张莎莎
Original assignee: 深圳超级数据链技术有限公司
Priority date: 2016-10-10
Filing date: 2017-07-06
Publication date: 2018-04-19
Also published as: KR20190053237A; CN107919941B; US20190238255A1; EP3525373A1; EP3525373A4; CN107919941A; KR102212174B1; US10833792B2; JP2019535196A

Abstract

An overlapped multiplexing-based modulation and demodulation method and device. In the modulation method, a precoding structure is employed, and a transmitting end performs parity-check product code coding on an input information sequence, generates, according to a coding rule, a factor graph is generated from the coding result, employs overlapped multiplexing to perform modulation and coding, and transmits a coded signal by means of an antenna. In the demodulation method, a signal is transmitted via a channel, a receiving end receives the signal via an antenna, then performs digital signal processing including synchronization and equalization, then performs overlapped multiplexing-based demodulation and decoding, and ultimately performs factor graph confidence propagation decoding on the decoding result to obtain an ultimate decoded sequence. In the present application, a product code decoding method is employed, and a parity-check code is used as a subcode to apply the concept of confidence propagation of a factor graph to a decoding end. In this way, the present application employs a parity-check product code, provides a simple structure, and reduces computational complexity by employing a factor graph during decoding.

Description

Modulation and demodulation method and device based on overlapping multiplexing

Technical field

The present application relates to the field of communications, and in particular, to a modulation and demodulation method and apparatus based on overlapping multiplexing.

Background technique

The modulation and demodulation technology based on Overlapped X Division Multiplexing (OvXDM) includes various implementation schemes, such as modulation and demodulation based on Overlapped Time Division Multiplexing (OvTDM), based on overlapping frequency division multiplexing. (OvFDM: Overlapped Frequency Division Multiplexing) modulation and demodulation technology, OvCDM (Overlapped Code Division Multiplexing) modulation and demodulation technology, and overlapped space division multiplexing (OvSDM: Overlapped Space Division Multiplexing) modulation Demodulation technology, modulation and demodulation technology based on Overlapped Hybrid Division Multiplexing (OvHDM).

It should be noted that, in the OvXDM mentioned in the present application, X represents an arbitrary domain, such as time T, space S, frequency F, code division C, mixed H, and the like.

The following is a brief description of OvTDM as an example.

First, Time Division Multiplexing (TDM) is a technique for sharing a plurality of signal symbols occupying a narrow time duration in digital communication for a wide time duration. As shown in FIG. 1, it is a schematic diagram of a conventional time division multiplexing technique.

The time durations of each multiplexed signal symbol in Figure 1 (referred to as the slot width in engineering) are T1, T2, T3, T4, ..., respectively, which are generally required to occupy the same time slot width in engineering. ΔT is the minimum guard slot, and the actual guard slot width should be a bit more. ΔT should be greater than the transition time width of the demultiplexed gate used plus the maximum amount of time jitter of the system. This is the most common time division multiplexing technique. Most of the existing multi-channel digital broadcasting systems and multi-channel digital communication systems use this technology.

The most important feature of this technology when applied to digital communication is that the multiplexed signal symbols are completely isolated from each other in time, and there is never mutual interference. There is no restriction on the multiplexed signal symbols, and the symbols of the respective signals. The duration (slot width) can have different widths, and can also be applied to different communication systems, as long as their time slots do not overlap each other, and thus are most widely used. But with this multiplexing, multiplexing itself has no effect on improving the spectral efficiency of the system.

Therefore, the conventional view is that adjacent channels do not overlap in the time domain to avoid interference between adjacent channels, but this technique restricts the improvement of spectral efficiency. The prior art time division multiplexing technology has the view that the channels do not need to be isolated from each other, and can have strong mutual overlap, as shown in FIG. In the prior art, the overlap between channels is regarded as a new coding constraint relationship, and corresponding modulation and demodulation techniques are proposed according to the constraint relationship, so it is called overlapping time division multiplexing (OvTDM: Overlapped Time Division). Multiplexing), this technique increases the spectral efficiency proportionally to the number of overlaps K.

Referring to FIG. 3, the overlapping time division multiplexing system includes a signal transmitter A01 and a receiver A02.

Transmitter A01 includes overlapping time division multiplexing modulation device 101 and transmitting device 102. The overlapping time division multiplexing modulation device 101 is configured to generate a complex modulation envelope waveform carrying an input signal sequence; the transmitting device 102 is configured to transmit the complex modulation envelope waveform to the receiver A02.

The receiver A02 includes a receiving device 201 and a sequence detecting device 202. The receiving device 201 is configured to receive a complex modulation envelope waveform transmitted by the transmitting device 102. The sequence detecting device 202 is configured to perform time series data sequence detection on the received complex modulation envelope waveform for decision output.

Typically, receiver A02 also includes pre-processing means 203 disposed between receiving means 201 and sequence detecting means 202 for assisting in the formation of a sequence of synchronous received digital signals within each frame.

In the transmitter A01, the input digital signal sequence forms a plurality of transmission signals in which the plurality of symbols overlap each other in the time domain by the overlapping time division multiplexing modulation means 101, and the transmission signal is transmitted from the transmitting means 102 to the receiver A02. The receiving device 201 of the receiver A02 receives the signal transmitted by the transmitting device 102, and forms a digital signal suitable for the sequence detecting device 202 to detect and receive through the pre-processing device 203. The sequence detecting device 202 performs the data sequence detection in the time domain of the received signal, thereby outputting judgment.

Referring to FIG. 4, the overlapping time division multiplexing modulation device 101 (OvTDM modulation device) includes a waveform generation module 301, a shift module 302, a multiplication module 303, and a superposition module 304.

The waveform generation module 301 is configured to generate an initial envelope waveform of the waveform smoothing in the time domain according to the design parameters.

The shifting module 302 is configured to shift the initial envelope waveform by a predetermined shift interval in the time domain according to the number of overlapping multiplexing to obtain a shift envelope waveform of each fixed interval.

Modulation module 305 is operative to convert the input digital signal sequence into a sequence of signal symbols represented by positive and negative signs.

The multiplication module 303 is configured to multiply the sequence of signal symbols by the shifted envelope waveforms of each fixed interval after the offset to obtain respective modulation envelope waveforms.

The superposition module 304 is configured to superimpose each modulation envelope waveform in the time domain to obtain a complex modulation envelope waveform carrying the input signal sequence.

Please refer to FIG. 5, which is a block diagram of the pre-processing apparatus 203 of the receiver A02.

The pre-processing device 203 includes a synchronizer 501, a channel estimator 502, and a digitizer 503. The synchronizer 501 forms symbol time synchronization in the receiver for the received signal; the channel estimator 502 then estimates the channel parameters; the digitizer 503 digitizes the received signal in each frame to form a suitable sequence detecting device. The sequence detects the received digital signal sequence.

Please refer to FIG. 6, which is a block diagram of the sequence detecting device 202 of the receiver A02.

The sequence detecting means 202 includes an analyzing unit memory 601, a comparator 602 and a plurality of reserved path memories 603 and an Euclidean distance memory 604 or a weighted Euclidean distance memory (not shown). In the detection process, the analysis unit memory 601 makes a complex convolutional coding model and a trellis diagram of the overlapping time division multiplexing system, and lists all states of the overlapping time division multiplexing system, and stores them; and the comparator 602 according to the analysis unit memory 601 The trellis diagram in the search for the path of the minimum Euclidean distance or the weighted minimum Euclidean distance of the received digital signal; and the reserved path memory 603 and the Euclidean distance memory 604 or the weighted Euclidean distance memory are used to store the comparator 602, respectively. The reserved path and Euclidean distance or weighted Euclidean distance of the output. Among them, the reserved path memory 603 and the Euclidean distance memory 604 or the weighted Euclidean distance memory need to be prepared for each of the stable states. The length of the reserved path memory 603 may preferably be 4K to 5K. The Euclidean distance memory 604 or the weighted Euclidean distance memory preferably stores only relative distances.

In the OvXDM system, the signal transmitter modulates the signal and transmits it to the signal receiver, which receives the modulated signal and demodulates it. The demodulation process includes a decoding step (i.e., a sequence detection step performed by the sequence detecting device described above). In the traditional communication system, the Chase algorithm is mostly used for decoding, and the algorithm involves a large number of sorting operations, and the calculation amount is very large.

Summary of the invention

The present application provides a modulation and demodulation method and apparatus based on overlapping multiplexing, which solves the problem that most of the conventional decoding uses the Chase algorithm for decoding, and the algorithm process involves a large number of sorting operations, and the computational complexity is high.

According to a first aspect of the present application, the present application provides a modulation method based on overlapping multiplexing, including:

Get input information;

Performing a parity product code on the input information to generate a factor graph;

Performing overlapping multiplexing modulation coding;

The encoded signal is transmitted.

According to the second aspect of the present application, the present application further provides a demodulation method based on overlapping multiplexing, including:

Obtain an input signal;

Performing overlap multiplexing demodulation decoding on the input signal;

Performing factor graph belief propagation decoding;

The decoded result is output.

According to the third aspect of the present application, the present application further provides a modulation apparatus based on overlapping multiplexing, including:

An input information obtaining module, configured to obtain input information;

a parity product code encoding module for performing parity product code encoding on the input information;

An overlap multiplexing modulation coding module, configured to perform overlapping multiplexing modulation coding;

A signal transmitting module for transmitting the encoded signal.

In an embodiment, the parity product code encoding module comprises:

The information bit filling unit is configured to fill the input information into the information bits of the coding structure; specifically, the information bit filling unit is configured to write the input information sequence into the corresponding information bits according to the two-dimensional structure of k _c ×k _r Where the length of the input information is N=k _c ×k _r ; k _r represents the number of rows, and k _c represents the number of columns;

a row coding unit for performing row coding on the information bits; specifically, the row coding unit is configured to perform the result that the k _r +1 bit information of each row is the result of the first k _c column modulo addition of the current row. coding;

Column encoding means for information bit column is encoded; Specifically, the coding section for performing the column with the first row of each column k _c + 1 information bit k _r is a front two rows mold the addition result of the current column coding;

A factor graph generating unit is configured to generate a factor graph according to the encoding rule according to the encoded result.

In an embodiment, the coding structure is a diagonal coding structure, a two-dimensional coding structure, a three-dimensional coding structure or a four-dimensional coding structure.

According to the fourth aspect of the present application, the present application further provides a demodulation apparatus based on overlapping multiplexing, including:

An input signal acquisition module for acquiring an input signal;

An overlap multiplexing demodulation decoding module, configured to perform overlap multiplexing demodulation decoding on the input signal;

a factor graph belief propagation decoding module for performing factor graph belief propagation decoding;

The decoding result output module is configured to output the decoding result.

In an embodiment, the factor graph belief propagation decoding module comprises:

An initial log likelihood ratio calculation unit for calculating an initial log likelihood ratio;

The maximum number of iterations setting unit is used to set the maximum number of iterations;

a verification information update unit, configured to calculate a verification node, and update the verification information;

An information message update unit for calculating a variable node and updating an information message;

a log likelihood ratio updating unit for calculating a log likelihood ratio value in a case where all information bits are related to the check node providing information;

a decision unit for performing a sequence of information decisions;

The decoding result output unit is configured to output a decoding result after satisfying a certain preset condition.

In an embodiment, the verification information update unit is configured to adopt a formula

Calculating a check node and updating the check information; wherein δ _ij is check information, indicating a log likelihood ratio value in the case where other variable nodes provide information except the jth variable node; λ _j'i is an information message , indicating the log likelihood ratio value in the case where the other check nodes provide information except the i-th check node; N(i) is the local symbol information set of the check node constraint; N(i)\j represents N (i) does not contain a subset of the jth variable node; Π is a multiplication operation;

And/or, the preset condition is that the maximum number of iterations is reached.

In an embodiment, the information message update unit is configured to adopt a formula

Calculate variable nodes and update information messages;

Log likelihood ratio update unit is used to adopt the formula

Calculating a log likelihood ratio value in the case where all information bits are related to the check node providing information;

Where x _j is the transmitted codeword in the transmitter transmit signal; y _j is the received codeword in the input signal received by the receiver; M(j) is the check set in which the variable node participates, M(j)\ i denotes that M(j) does not include a subset of the i-th check node; δ _i'j is check information indicating a log likelihood ratio value in the case where other variable nodes provide information other than the j-th variable node; Lrr(x _j ) is a log likelihood ratio representation of the channel information initially received by the receiver; λ _ji is an information message indicating a logarithm in the case where the other check nodes provide information other than the i-th check node However, λ _j represents a log likelihood ratio value in the case where all information bits are associated with the check node providing information.

In the modulation multiplexing method and apparatus based on overlap multiplexing provided by the present application, in the modulation method, a precoding structure is adopted, and the transmitting end performs parity check product code encoding on the input information sequence, and generates the encoded result according to the encoding rule. The factor map is further subjected to overlapping multiplexing modulation coding, and the encoded signal is transmitted through the antenna. In the demodulation method, the signal is transmitted through the channel, and after receiving the signal through the antenna, the receiving end first performs digital signal processing, including synchronization, equalization, etc., and then performs overlapping multiplexing demodulation and decoding, and finally decodes the decoded signal. The result is a factor graph belief propagation decoding, and finally the decoded sequence is obtained. Column. In the present application, the product code decoding method is adopted, and the parity code is used as a subcode, and the belief propagation concept of the factor graph is used for the decoding end. Thereby, the parity product code is adopted, the structure is simple, and the factor graph method is adopted in the decoding process, so that the operation complexity is reduced.

DRAWINGS

1 is a schematic diagram of a conventional time division multiplexing technique;

2 is a schematic diagram of the principle of overlapping time division multiplexing;

3 is a schematic structural diagram of an overlapping time division multiplexing system;

4 is a schematic structural diagram of an overlapping time division multiplexing modulation apparatus;

5 is a schematic structural diagram of a receiver preprocessing apparatus;

6 is a schematic structural diagram of a receiver sequence detecting device;

7 is a structural diagram of a parity product code in an embodiment of the present application;

Figure 8 is a bidirectional transfer factor diagram of an embodiment of the present application;

FIG. 9 is a schematic diagram of correspondence between a parity product code matrix and a factor graph in an embodiment of the present application; FIG.

10 is a block diagram of a transmitting end of a precoding OvXDM system in an embodiment of the present application;

FIG. 11 is a schematic flowchart of a modulation method based on overlapping multiplexing according to an embodiment of the present application;

12 is a schematic flowchart of a parity product coding step in a modulation method based on overlapping multiplexing according to an embodiment of the present application;

13 is a schematic flowchart of an overlapping multiplexing modulation and coding step in a modulation method based on overlapping multiplexing according to an embodiment of the present application;

14 is a schematic diagram of the principle of K-way waveform multiplexing;

15 is a schematic diagram showing the principle of a symbol superposition process of a K-way waveform;

16 is a schematic flowchart of a demodulation method based on overlapping multiplexing according to an embodiment of the present application;

FIG. 17 is a schematic flowchart of a decoding step in a demodulation method based on overlapping time division multiplexing according to an embodiment of the present application;

Figure 18 is a tree diagram of the input-output relationship of the overlapping time division multiplexing system when K = 3;

Figure 19 is a node state transition diagram;

Figure 20 is a Trellis diagram of the OvTDM system when K = 3;

FIG. 21 is a schematic flowchart of a factor graph propagation and decoding step in a demodulation method based on overlapping multiplexing according to an embodiment of the present application;

FIG. 22 is a schematic block diagram of a modulation apparatus based on overlapping multiplexing according to an embodiment of the present application; FIG.

FIG. 23 is a parity code product code in a modulation apparatus based on overlapping multiplexing according to an embodiment of the present application. Unit diagram of the module;

24 is a schematic block diagram of a demodulation device based on overlapping multiplexing according to an embodiment of the present application;

FIG. 25 is a schematic diagram of a unit of a factor graph belief propagation decoding module in a demodulation apparatus based on overlapping multiplexing according to an embodiment of the present application.

Detailed ways

First, it should be noted that, in the overlap multiplexing (OvXDM)-based modulation and demodulation method and apparatus provided by the present application, X represents an arbitrary domain, such as time T, space S, frequency F, code division C, hybrid H, and the like. For convenience of description, the embodiments of the present application mainly describe overlapping time division multiplexing (OvTDM) and overlapping frequency division multiplexing (OvFDM) as an example. Those skilled in the art should be aware that the modulation and demodulation method and apparatus claimed in the present application can be equally applied to overlapping multiplexing techniques of other domains.

In the OvXDM system, the signal transmitter modulates the signal and transmits it to the signal receiver, which receives the modulated signal and demodulates it. A decoding step is included in the demodulation process. In the research of the overlap multiplexing modulation and demodulation technology, those skilled in the art adopt the traditional decoding method. In the traditional decoding method, the Chase algorithm is mostly used, and the algorithm involves a large number of sorting operations, and the calculation amount is very large.

However, although the above problems exist in the current decoding methods, since these methods have been widely used, those skilled in the art have fully accepted the use of such methods without spending cost to find a better decoding method.

In general, the simple OvXDM (X stands for time T, frequency F, space S, code domain C or mixed H, etc.) system completes the waveform decoding at the receiving end, and the whole process ends. In a slightly more complicated situation, the OvXDM system will be combined with common traditional communication technologies to improve the overall system performance, such as cascading OvXDM systems, pre-encoded OvXDM systems, and so on. The error correction code generally has better error correction capability, which can improve the performance of the overall system and reduce the bit error rate, so most of the error correction codes will be applied to the OvXDM system.

The product code is a block-shaped error correction code, which introduces the idea of iteration at the decoding end, which constitutes the more popular Turbo product code, which is TPC code. Such code has in today's communication system. Very wide range of applications. In the traditional communication system, the Chase algorithm is mostly used for decoding, and the algorithm involves a large number of sorting operations, and the calculation amount is very large.

The product code proposed in the present application uses a very simple parity code as a subcode, which can be very flexible and convenient for code length control and adaptation. At the decoding end, an iterative decoding method based on the belief propagation of the factor graph is adopted, which is flexible and simple. The present application introduces a decoding method of a parity product code based on a decoding idea of belief propagation of a factor graph.

Commonly used error correction codes include a product code (Turbo Product Code, TPC code) and a low density parity check code (LDPC code). This application takes a parity product code as an example, and its coding structure is as shown in the figure. As shown in Fig. 7, the coding structure is very simple, the row and subcodes can be selected with the same code length, or different code lengths can be selected, the structure is flexible and simple, and the code rate is easier to adjust.

According to this coding structure, it is easier to obtain the factor map obtained under this coding, as shown in FIG. The node shown at the bottom of the figure is a variable node, and the number is the code length in the coding matrix block, and the node shown at the top of the figure is the check node, and the number is the length of the check bit. Applied to the OvXDM system, the relationship between the corresponding coding matrix and the bidirectional factor graph is as shown in FIG. 9. It can be found in the correlation factor graph constructed by the parity product code that the factor graph has a large girth. It is also more suitable for decoding methods of belief propagation. When performing belief propagation decoding, the message can be propagated through operations in the logarithmic domain.

The present application will be further described in detail below with reference to the accompanying drawings.

Embodiment 1

In this embodiment, it is assumed that the input information sequence is x, the information length is N=k _c ×k _r =100, k _c =10, k _r =10, the number of overlaps K=5, and the Chebyshev window is used as the multiplexing waveform. The modulation mode is BPSK, and the precoding uses the TPC error correction code as an example. Using the precoding structure of FIG. 10, the system process is as follows: the transmitting end performs TPC encoding on the input information sequence, then performs OvXDM encoding, and transmits the encoded signal through the antenna. The signal is transmitted through the channel, and after receiving the signal through the antenna, the receiving end performs digital signal processing, including synchronization, equalization, etc., and then performs OvXDM decoding, and finally decodes the decoded result through TPC, that is, uses the present The applied factor graph belief propagation decoding method finally obtains the decoded sequence as x'.

Commonly used OvXDM (X stands for time T, frequency F, space S, code domain C or mixed H, etc.) decoding includes maximum likelihood sequence decoding algorithms such as Viterbi decoding, maximum a posteriori probability algorithm such as BCJR algorithm, MAP algorithm , Log_MAP algorithm, etc. The following mainly introduces the encoding process of the parity product code and its corresponding factor graph belief propagation decoding method.

First, the variables to be used in this embodiment are defined, and x _j is a transmission code word, and y _j is a reception code word.

N(i): A set of local symbol information for which the node constraint is checked. N(i)\j indicates that N(i) does not contain a subset of the jth variable node.

M(j): The check set to which the variable node participates. M(j)\i indicates that M(j) does not contain a subset of the i-th check node.

Lrr(x _j ): A log likelihood ratio representation of the channel information initially received.

λ _ji : Information message indicating the log likelihood ratio value in the case where the other check nodes provide information other than the i-th check node.

λ _j : Information message indicating a log likelihood ratio value in the case where the check nodes associated with all information bits provide information.

δ _ij : check information indicating a log likelihood ratio value in the case where other variable nodes provide information other than the jth variable node.

Referring to FIG. 11, this embodiment provides a modulation method based on overlapping multiplexing, including the following steps:

Step 1.1: Get the input information. The input information is the sequence of signal digits entered in Figure 4.

Step 1.2: Perform parity check product code encoding on the input information.

Step 1.3: Perform overlapping multiplexing modulation coding;

Step 1.4: The encoded signal is transmitted, that is, the complex modulation envelope waveform generated in FIG. 4 is transmitted as a transmission signal to the receiving end.

Referring to Figure 12, step 1.2 includes the following sub-steps:

Sub-step 1-1: The input information is filled in the information bits of the coding structure. The coding structure may be a diagonal coding structure, a two-dimensional coding structure, a three-dimensional coding structure, a four-dimensional coding structure or a higher-dimensional coding structure. In this embodiment, a two-dimensional coding structure is taken as an example for description.

Specifically, the input information sequence is written into the corresponding information bits in a two-dimensional structure of k _c ×k _r . k _r represents the number of rows, and k _c represents the number of columns.

Sub-step 1-2: Row encoding the information in the information bits.

Specifically, the k _r +1 bit information of each row is the result of the modulo two addition of the first k _c column of the current row.

Sub-step 1-3: Column coding the information in the information bits.

Specifically, in each column of k _c +1 bit information is the result of two plus k _r rows before the current column is the column mode coding.

After the encoded matrix size is (k _c +1) × (k _r +1), the code rate of the TPC is

In this embodiment, it is 0.8264.

Sub-steps 1-4: The encoded result is generated according to the encoding rule.

As shown in Figure 13, step 1.3 includes the following substeps:

Sub-step 2.1: Generate an initial envelope waveform h(t) in the time domain based on the design parameters.

When generating the initial envelope waveform, the user can input the design parameters to achieve flexible configuration according to system performance indicators in the actual system.

In some embodiments, when the sidelobe attenuation of the initial envelope waveform has been determined, the design parameters include the window length L of the initial envelope waveform, such as when the initial envelope waveform is a Bartlett envelope waveform.

In some embodiments, the design parameters include the window length L of the initial envelope waveform and the sidelobe attenuation r, such as when the initial envelope waveform is a Chebyshev envelope waveform.

Of course, when the initial envelope waveform is in other forms, the design parameters can be determined according to the characteristics of the corresponding initial envelope waveform.

Sub-step 2.2: The initial envelope waveform is shifted according to the predetermined shift interval in the corresponding domain (in the present embodiment, the time domain) according to the number of overlap multiplexing K to obtain the shift envelope waveform h of each fixed interval. (ti*△T).

Wherein, the shift interval is a time interval ΔT, and the time interval ΔT is: ΔT=L/K. At this time, the symbol width of the signal is ΔT.

In addition, it is also necessary to ensure that ΔT is not less than the reciprocal of the system sampling rate.

The value of i is related to the input symbol length N, and i takes an integer from 0 to N-1. For example, when N=8, i takes an integer from 0 to 7.

Sub-step 2.3: Convert the sequence of signal numbers obtained after encoding in step 1.2 into a sequence of signal symbols represented by positive and negative signs.

Specifically, 0 in the digital signal sequence is converted to +A, 1 is converted to -A, and A is a non-zero arbitrary number to obtain a sequence of positive and negative symbols. For example, when A is 1, the input {0, 1} bit sequence is converted into a {+1, -1} symbol sequence by BPSK (Binary Phase Shift Keying) modulation.

Sub-step 2.4: shifting the sequence of signal symbols x _i (x _i ={+1+1-1-1-1+1-1+1} in this embodiment) and the shifted envelope waveform of each fixed interval h(ti*ΔT) is multiplied to obtain each modulation envelope waveform x _i h(ti*ΔT).

Sub-step 2.5: superimposing each modulation envelope waveform x _i h(ti*ΔT) in the corresponding domain (in the present embodiment, the time domain) to obtain a complex modulation envelope waveform carrying the input signal sequence, that is, transmitting signal of.

The signal sent can be expressed as follows:

In step 1.4, the encoded signal is transmitted, that is, the obtained complex modulation envelope waveform is transmitted as a transmission signal.

Therefore, in this embodiment, when A is 1, the superimposed output symbol (output signal symbol sequence) is: s(t)ï {+1+2+1-1-3-1-1+ 1}.

Please refer to FIG. 14 , which is a schematic diagram of the principle of K-way waveform multiplexing, which has a parallelogram shape. Each row represents a waveform to be transmitted x _i h(ti*ΔT) obtained by multiplying a symbol x _i to be transmitted with an envelope waveform h (ti*ΔT) at a corresponding time. a ₀ to a _k-1 represent coefficient values of each part obtained by K-segmentation of each window function waveform (envelope waveform), specifically, coefficients regarding amplitude values.

Since the input digital signal sequence is converted into a sequence of positive and negative symbols, 0,1 in the input digital signal sequence is converted to ±A, and A is a non-zero arbitrary number to obtain a sequence of positive and negative symbols. For example, A takes When the value is 1, the input {0, 1} bit sequence is BPSK-modulated into a sequence of {+1, -1} symbols to obtain a sequence of positive and negative symbols. Therefore, FIG. 15 is a schematic diagram showing the principle of the symbol superposition process of the K-way waveform. In the superimposition process of Fig. 15, the third digit on the left side of the first row indicates the first input symbol +1, the third digit on the left of the second row indicates the second input symbol +1, and the third digit on the left of the third row indicates the third input. Symbol-1, the middle 3 digits of the 1st line represent the 4th input symbol -1, the middle 3 digits of the 2nd row represent the 5th input symbol -1, and the 3rd row of the 3rd row represents the 6th input symbol + 1. The third number on the right side of the first line indicates the seventh input symbol -1, and the third number on the right side of the second line indicates the eighth input symbol +1. Therefore, after the three waveforms are superimposed, the resulting output symbol is {+1+2+1-1-3-1-1+1}.

Of course, if the length of the input symbol is other values, it can be superimposed in the manner shown in FIG. 14 and FIG. 15 to obtain an output symbol.

It should be noted that, in step 1.3, the overlapping multiplexing modulation coding may be performed in addition to the above method, and any feasible method in the prior art may be adopted.

Embodiment 2

Based on the multiplexing multiplexing based modulation method provided by the foregoing embodiment 1, the embodiment provides a demodulation method based on overlapping multiplexing. Referring to FIG. 16, the demodulation method based on overlapping multiplexing includes the following steps:

Step 3.1: Obtain the input signal. The input signal is the complex modulation envelope waveform signal transmitted in Figure 4.

Step 3.2: Perform overlapping multiplexing demodulation decoding on the input signal.

Step 3.3: Perform a factor graph belief propagation decoding.

Step 3.4: Output the decoded result.

Referring to FIG. 17, in this embodiment, step 3.2 specifically includes the following sub-steps:

(1) First, the received signal is synchronized, including carrier synchronization, frame synchronization, symbol time synchronization, and the like.

(2) According to the sampling theorem, the received signal in each frame is digitized.

(3) The received waveform is cut according to the waveform transmission time interval.

(4) Decode the diced waveform according to a certain decoding algorithm. The decoding process refers to FIG. 18, when K=3, the overlapping time-division input-output relationship diagram; FIG. 19 is the node state transition diagram. Figure 20 is a Trellis diagram of the OvTDM system when K = 3. Viterbi decoding is the most widely used method in convolutional codes. Its basic idea is to traverse all the paths in the Trellis graph. By comparing the multiple branches arriving at each state during the state transition of the Trellis graph, it is correct. The distance of the path, only the path with the smallest distance is retained, and the estimation of the correct path is obtained by comparison and screening, and decoding is realized.

It should be noted that the overlap multiplexing demodulation decoding in step 3.2 may adopt the above method, or may Other possible methods in the prior art are employed.

Referring to FIG. 21, it is assumed that the noise variance obtained by digital signal processing is σ, and the sequence after OvXDM decoding is x _j ∈ {+1, -1}, then step 3.3 includes the following sub-steps:

Sub-step 3-1: Calculate the initial log likelihood ratio.

Specifically, the log likelihood ratio result is generally related to the modulation method, the decoding method of the OvXDM system (ie, the overlap multiplexing demodulation decoding method), and the final purpose is to extract the soft value.

Sub-step 3-2: Set the maximum number of iterations.

Specifically, in this embodiment, the number of iterations is set to 50, and the number of iterations is larger, and the final decoding sequence is closer to the theoretical sequence, but if it is too large, the complexity of the algorithm is also increased.

Sub-step 3-3: Calculate the check node and update the check information.

Specifically, according to the formula

Calculate and update the check nodes for each row and column, where Π is a multiplication operation.

Sub-step 3-4: Calculate the variable node and update the information message.

Specifically, according to the formula

Update information messages for each row and column.

Sub-steps 3-5: Calculate the log likelihood ratio value λ _j in the case where all information bits are associated with the check node providing information.

Specifically, according to the formula

Calculate a new information message.

Sub-step 3-6: The decision is made.

Specifically, the embodiment adopts a hard decision method and adopts a BPSK modulation mode, and assumes that the corresponding modulation mapping here is 1->-1, 0->+1, that is,

Sub-step 3-7: After a certain preset condition is met, the decoding result is output. In this embodiment, the preset condition is that the maximum number of iterations is reached.

It is judged whether the maximum number of iterations is reached. If it is satisfied, the decoding ends and the decoding sequence is output; otherwise, the sub-step 3-3 is returned to perform the calculation again, and the information message λ _ji at this time is the result of the previous iteration operation.

Embodiment 3

Referring to FIG. 22, based on the multiplexing multiplexing based modulation method provided in Embodiment 1, the embodiment provides a modulation apparatus based on overlapping multiplexing, which includes an input information acquiring module A11 and a parity product code encoding module A12. And multiplexing the modulation and coding module A13 and the signal transmission module A14.

The input information acquisition module A11 is used to acquire input information.

The parity product code encoding module A12 is configured to perform parity product code encoding on the input information.

The overlap multiplexed modulation and coding module A13 is used to perform overlap multiplexed modulation coding.

The signal transmitting module A14 is configured to transmit the encoded signal.

Referring to FIG. 23, in the present embodiment, the parity product code encoding module A12 includes an information bit filling unit A21, a row encoding unit A22, a column encoding unit A23, and a factor graph generating unit A24.

The information bit filling unit A21 is for filling the input information into the information bits of the encoding structure. The coding structure may be a diagonal coding structure, a two-dimensional coding structure, a three-dimensional coding structure, a four-dimensional coding structure or a higher-dimensional coding structure. In this embodiment, a two-dimensional coding structure is taken as an example for description.

Specifically, the information bit filling unit is configured to write the input information sequence into the corresponding information bits according to a two-dimensional structure of k _c ×k _r , wherein the input information length is N=k _c ×k _r . k _r represents the number of rows, and k _c represents the number of columns.

The row coding unit A22 is configured to perform row coding on the information bits in the information bits. Specifically, the row coding unit is configured to perform the result that the k _r +1 bit information of each row is the result of the first k _c column modulo addition of the current row. coding.

Column A23 encoding unit for information bit column is encoded; Specifically, in the first column of a coding unit for each column _c +1 k-bit information is added to the results of the previous two rows k _{R & lt} current column is the column mold coding.

The factor map generation unit A24 is configured to generate a factor map according to the encoding rule.

The modulation apparatus based on the overlap multiplexing provided in this embodiment corresponds to the modulation method based on the overlap multiplexing provided in the first embodiment, and therefore, the principle is not described herein again.

Embodiment 4

Referring to FIG. 24, based on the overlap multiplexing demodulation method provided in Embodiment 2, the embodiment provides a demodulation device based on overlapping multiplexing, including an input signal acquisition module B11, and an overlay multiplexing demodulation translation. The code module B12, the factor graph belief propagation decoding module B13, and the decoding result output module B14.

The input signal acquisition module B11 is for acquiring an input signal.

The multiplex demodulation decoding module B12 is configured to perform multiplex multiplexing demodulation decoding on the input signal.

The factor map belief propagation decoding module B13 is used for performing factor graph belief propagation decoding.

The decoding result output module B14 is for outputting the decoding result.

Referring to FIG. 25, in the embodiment, the factor graph belief propagation decoding module B13 includes an initial log likelihood ratio calculating unit B21, a maximum iteration number setting unit B22, a check information updating unit B23, an information message updating unit B24, and a pair. The number likelihood ratio updating unit B25, the decision unit B26, and the decoding result output unit B27.

The initial log likelihood ratio calculation unit B21 is used to calculate an initial log likelihood ratio.

The maximum number of iterations setting unit B22 is used to set the maximum number of iterations.

The check information update unit B23 is for calculating the check node and updating the check information.

The information message updating unit B24 is used to calculate a variable node and update the information message.

The log likelihood ratio updating unit B25 is used to calculate a log likelihood ratio value in the case where the check node providing information related to all the information bits is calculated.

Decision unit B26 is used to make the decision.

The decoding result output unit B27 is configured to output a decoding result after satisfying a certain preset condition. The preset condition may be that the maximum number of iterations is reached.

In this embodiment, the verification information updating unit B23 is used to adopt a formula.

Calculating a check node and updating the check information; wherein δ _ij is check information, indicating a log likelihood ratio value in the case where other variable nodes provide information except the jth variable node; λ _j'i is an information message , indicating the log likelihood ratio value in the case where the other check nodes provide information except the i-th check node; N(i) is the local symbol information set of the check node constraint; N(i)\j represents N (i) does not contain a subset of the jth variable node; Π is a multiplication operation.

Information message update unit B24 is used to adopt the formula

Calculate the variable node and update the information message.

Log likelihood ratio updating unit B25 is used to adopt a formula

A log likelihood ratio value in the case where all information bits are associated with the check node providing information is calculated.

The demodulation device based on the overlap multiplexing provided in this embodiment corresponds to the demodulation method based on the overlap multiplexing provided in the second embodiment. Therefore, the principle is not described herein again.

The method and device for multiplexing and demodulating based on overlapping multiplexing provided by the embodiment of the present application, in the modulation method, adopting a precoding structure, the transmitting end first performs parity check product code encoding on the input information sequence, and then performs overlapping multiplexing modulation coding. The encoded signal is transmitted through the antenna. Demodulation method, signal After channel transmission, the receiving end receives the signal through the antenna, first performs digital signal processing, including synchronization, equalization, etc., and then performs overlapping multiplexing demodulation and decoding, and finally performs the factor graph belief propagation on the decoded result. Decoding, and finally the decoded sequence is obtained. In the present application, the product code decoding method is adopted, and the parity code is used as a subcode, and the belief propagation concept of the factor graph is used for the decoding end. Thereby, the parity product code is adopted, the structure is simple, and the factor graph method is adopted in the decoding process, so that the operation complexity is reduced.

It should be noted that the method and apparatus for multiplexing and demodulating based on overlapping multiplexing provided by the embodiments of the present application can be applied to mobile communications, satellite communications, microwave line-of-sight communications, scatter communications, atmospheric optical communications, infrared communications, underwater acoustic communications, and the like. In a wireless communication system, it can be applied to both large-capacity wireless transmissions and small-capacity lightweight radio systems.

It can be understood by those skilled in the art that all or part of the steps of the various methods in the foregoing embodiments may be implemented by a program to control related hardware. The program may be stored in a computer readable storage medium, and the storage medium may include: a read only memory. Random access memory, disk or optical disk, etc.

The above content is a further detailed description of the present application in conjunction with the specific embodiments, and the specific implementation of the present application is not limited to the description. For those skilled in the art to which the present invention pertains, several simple deductions or substitutions can be made without departing from the inventive concept.

Claims

A modulation method based on overlapping multiplexing, comprising:

Get input information;

Performing a parity product code on the input information to generate a factor graph;

Performing overlapping multiplexing modulation coding;

The encoded signal is transmitted.
The method of claim 1 wherein the parity information is encoded in the input information, comprising:

Filling in the information into the information bits of the encoding structure;

Row coding the information in the information bits;

Column coding the information in the information bits;

The encoded result is generated according to the encoding rule.
The method of claim 2, wherein the coding structure is a diagonal coding structure, a two-dimensional coding structure, a three-dimensional coding structure or a four-dimensional coding structure.
The method of claim 2 wherein the parity product code encoding of the input information comprises:

The input information sequence is written into the corresponding information bits in a two-dimensional structure of k c × k r , where the input information length is N = k c × k r ; k r represents the number of rows, and k c represents the number of columns.

Row coding is performed with the result that the k r +1 bit information of each row is the result of the first k c column modulo addition of the current row;

Column coding is performed with the result that the k c +1 bit information of each column is the result of the first k r row modulo two addition of the current column;

The encoded result is generated according to the encoding rule.
A demodulation method based on overlapping multiplexing, comprising:

Obtain an input signal;

Performing overlap multiplexing demodulation decoding on the input signal;

Performing factor graph belief propagation decoding;

The decoded result is output.
The method of claim 5 wherein the factor graph belief propagation decoding comprises:

Calculating an initial log likelihood ratio;

Set the maximum number of iterations;

Calculate the check node and update the check information;

Calculate variable nodes and update information messages;

Calculating a log likelihood ratio value in the case where all information bits are related to the check node providing information;

Make a judgment;

After a certain preset condition is met, the decoding result is output.
Method according to claim 6 wherein a formula is employed
Calculating a check node and updating the check information; wherein δ ij is check information, indicating a log likelihood ratio value in the case where other variable nodes provide information except the jth variable node; λ j'i is an information message , indicating the log likelihood ratio value in the case where the other check nodes provide information except the i-th check node; N(i) is the local symbol information set of the check node constraint; N(i)\j represents N (i) does not contain a subset of the jth variable node; Π is a multiplication operation;

And/or, the preset condition is that the maximum number of iterations is reached.
The method of claim 6 wherein:

Adopt formula
Calculate variable nodes and update information messages;

Adopt formula
Calculating a log likelihood ratio value in the case where all information bits are related to the check node providing information;

Where x j is the transmitted codeword in the transmitter transmit signal; y j is the received codeword in the input signal received by the receiver; M(j) is the check set in which the variable node participates, M(j)\ i denotes that M(j) does not include a subset of the i-th check node; δ i'j is check information indicating a log likelihood ratio value in the case where other variable nodes provide information other than the j-th variable node; Lrr(x j ) is a log likelihood ratio representation of the channel information initially received by the receiver; λ ji is an information message indicating a logarithm in the case where the other check nodes provide information other than the i-th check node However, λ j represents a log likelihood ratio value in the case where all information bits are associated with the check node providing information.
A modulation device based on overlapping multiplexing, comprising:

An input information obtaining module, configured to obtain input information;

a parity product code encoding module for performing parity product code encoding on the input information;

An overlap multiplexing modulation coding module, configured to perform overlapping multiplexing modulation coding;

A signal transmitting module for transmitting the encoded signal.
A demodulation device based on overlapping multiplexing, comprising:

An input signal acquisition module for acquiring an input signal;

An overlap multiplexing demodulation decoding module, configured to perform overlap multiplexing demodulation decoding on the input signal;

a factor graph belief propagation decoding module for performing factor graph belief propagation decoding;

The decoding result output module is configured to output the decoding result.