CN107645364B - Complementary coding method and device, complementary decoding method and device, and OvXDM system - Google Patents
Complementary coding method and device, complementary decoding method and device, and OvXDM system Download PDFInfo
- Publication number
- CN107645364B CN107645364B CN201610592255.0A CN201610592255A CN107645364B CN 107645364 B CN107645364 B CN 107645364B CN 201610592255 A CN201610592255 A CN 201610592255A CN 107645364 B CN107645364 B CN 107645364B
- Authority
- CN
- China
- Prior art keywords
- segment
- domain
- superposed
- complementary
- fully
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Error Detection And Correction (AREA)
Abstract
The application discloses a complementary coding method and device, a complementary decoding method and device, and an OvXDM system, wherein the first segment of a complex modulation envelope waveform is superposed to the tail segment in the coding process, or the tail segment is superposed to the first segment, so as to generate a complementary complex modulation envelope waveform, or the first segment of a digital signal in a first domain is superposed to the tail segment in the decoding process, or the tail segment is superposed to the first segment, so as to generate a complementary digital signal, so that the decoded data are completely superposed, the problem of higher error rate of the last symbols in the traditional technology does not exist, meanwhile, the length of the data is not required to be very large, a stable decoding path can be obtained even if the length of the data is short, the decoding processing time delay is reduced, and the real-time performance and the transmission speed of the system are improved.
Description
Technical Field
The present application relates to the field of signal processing, and in particular, to a complementary encoding method and apparatus, a complementary decoding method and apparatus, and an OvXDM system.
Background
An overlap Multiplexing system, whether it is an overlap Time Division Multiplexing (OvTDM), overlap Frequency Division Multiplexing (OvFDM), overlap code Division Multiplexing (OvCDM) or Space Division Multiplexing (OvCDM) system, time-Frequency two-dimensional overlap Multiplexing (OvHDM), space Division overlap Multiplexing (ovspace Division Multiplexing) system, which overlaps in a parallelogram shape during encoding, as shown in fig. 1, for an overlap Multiplexing system with K overlap Multiplexing times, there will be "head" and "tail" not overlapping for K times during encoding, and for an input digital sequence with N length, the length is changed to N + K-1 after overlap coding, wherein the length of the completely Overlapped Time Division Multiplexing system is changed to N + K-1, and the length of the completely Overlapped Time Division Multiplexing system is changed to K times without K times of overlap, and thus the data is received only in a way, and then the data is generally transmitted or received, for example, because the data is decoded in a head-tail length, and N-length are changed to N, and the data is transmitted only in a way; or the complete data with the length of N + K-1 is sent at the sending end, and then the tail of the data is not decoded when the receiving end decodes the data, and both methods can cause the error rate of the last symbols to be higher.
In addition, due to the constraint characteristic of the overlapping coding of the overlapping multiplexing system, a stable decoding path can occur only when the data depth is at least 4K-5K in the decoding process, so that the length N of the transmitted data is required to be larger, because the head and the tail are not completely overlapped for K times if the N is smaller, the stable path may not occur in the decoding process, the data is already decoded, and the error rate of the system is greatly improved; on the other hand, if the transmitted data length N is large, although the stable decoding path requirement is satisfied, the decoding output delay is long, which affects the processing time of the system.
Disclosure of Invention
In order to solve the above problems, the present application provides a complementary encoding method and apparatus, a complementary decoding method and apparatus, and an OvXDM system.
According to a first aspect of the present application, the present application provides a complementary coding method, suitable for an OvXDM system, comprising the steps of:
generating an initial envelope waveform in a first domain based on the design parameters;
shifting the initial envelope waveform on a first domain according to the overlapping multiplexing times at preset intervals to obtain shifted envelope waveforms of all fixed intervals;
multiplying digital signals in the input sequence by respective corresponding displacement envelope waveforms to obtain each modulation envelope waveform;
superposing the modulation envelope waveforms on a first domain to obtain complex modulation envelope waveforms on the first domain, wherein the complex modulation envelope waveforms comprise a first section which is not sufficiently superposed, a main section which is sufficiently superposed and a tail section which is not sufficiently superposed;
and superposing the first segment of the complex modulation envelope waveform to the tail segment, or superposing the tail segment to the first segment to generate a complementary complex modulation envelope waveform, and then carrying out subsequent processing.
According to a second aspect of the present application, there is provided a complementary decoding method, suitable for an OvXDM system, comprising the steps of:
receiving a signal and processing the received signal to obtain a digital signal in a first domain, wherein the digital signal in the first domain comprises a first segment which is not fully overlapped, a main segment which is fully overlapped and a tail segment which is not fully overlapped;
superimposing the first segment of the digital signal in the first domain onto the last segment, or superimposing the last segment onto the first segment, to generate a complementary digital signal;
and decoding the digital signal according to a certain decoding algorithm.
According to a third aspect of the present application, there is provided a complementary encoding device, adapted for use in an OvXDM system, comprising:
a waveform generation module for generating an initial envelope waveform in a first domain based on the design parameters;
a shifting module, configured to shift the initial envelope waveform in a first domain at predetermined intervals according to the number of overlapping multiplexing, so as to obtain shifted envelope waveforms at fixed intervals;
the multiplication module is used for multiplying the digital signals in the input sequence by the respective corresponding displacement envelope waveforms to obtain the modulation envelope waveforms;
the superposition module is used for superposing the modulation envelope waveforms on a first domain to obtain complex modulation envelope waveforms on the first domain, wherein the complex modulation envelope waveforms comprise first segments which are not sufficiently superposed, main segments which are sufficiently superposed and tail segments which are not sufficiently superposed;
and the complementary module is used for superposing the first segment of the complex modulation envelope waveform to the tail segment or superposing the tail segment to the first segment so as to generate a complementary complex modulation envelope waveform.
According to a fourth aspect of the present application, there is provided a complementary decoding apparatus, adapted for an OvXDM system, comprising:
the receiving module is used for receiving signals and processing the received signals to obtain digital signals in a first domain, wherein the digital signals in the first domain comprise a first segment which is not fully superposed, a main segment which is fully superposed and a tail segment which is not fully superposed;
a complementary module for superimposing the first segment of the digital signal in the first domain to the last segment, or superimposing the last segment to the first segment, to generate a complementary digital signal;
and the decoding module is used for decoding the digital signal according to a certain decoding algorithm.
According to a fifth aspect of the present application, the present application provides an OvXDM system, comprising the complementary encoding means described above, or comprising the complementary decoding means described above.
The beneficial effect of this application is:
according to the complementary encoding method and device, the complementary decoding method and device and the ovXDM system, as the first segment of the complex modulation envelope waveform is superposed to the tail segment or the tail segment is superposed to the first segment in the encoding process to generate the complementary complex modulation envelope waveform, or the first segment of the digital signal in the first domain is superposed to the tail segment or the tail segment is superposed to the first segment in the decoding process to generate the complementary digital signal, the decoded data are completely superposed, so that the problem of higher error rate of the last symbols in the traditional technology does not exist, the length of the data is not required to be very large, a stable decoding path can be obtained even if the length of the data is short, the decoding processing time delay is reduced, and the system processing time precision and the transmission speed are improved.
Drawings
FIG. 1 is a schematic diagram of data superposition in an overlay multiplexing system;
FIG. 2 is a flowchart illustrating a complementary encoding method according to a first embodiment of the present application;
FIG. 3 is a schematic structural diagram of a complementary encoding apparatus according to a first embodiment of the present application;
FIG. 4 is a flowchart illustrating a complementary decoding method according to a second embodiment of the present application;
FIG. 5 is a diagram illustrating a complementary decoding apparatus according to a second embodiment of the present application;
fig. 6 is a schematic structural diagram of a transmitting end of a conventional OvFDM system;
fig. 7 (a) is a block diagram of a signal receiving end of a conventional OvFDM system;
FIG. 7 (b) is a block diagram of the received signal detection of the conventional OvFDM system
Fig. 8 is a schematic diagram of complementary superposition for an OvFDM system in an embodiment of the present application;
fig. 9 is a diagram of a code tree of a conventional OvFDM system;
fig. 10 is a node state transition diagram of a conventional OvFDM system;
fig. 11 is a trellis diagram of a conventional OvFDM system;
FIG. 12 is a schematic diagram of complementary data superposition according to an example of the present application;
FIG. 13 is a diagram illustrating the detection of decoding the complementary data according to an example of the present application;
fig. 14 is a schematic structural diagram of a transmitting end of a conventional OvTDM system;
FIG. 15 (a) is a schematic diagram of a conventional OvTDM system preprocessing unit;
fig. 15 (b) is a schematic diagram of a conventional OvTDM system sequence detection unit;
FIG. 16 is a schematic diagram of a complementary overlay of an OvTDM system in an embodiment of the present application;
FIG. 17 is a code tree diagram of a conventional OvTDM system;
fig. 18 is a node state transition diagram of a conventional OvTDM system;
FIG. 19 is a trellis diagram of a conventional OvTDM system;
FIG. 20 is a schematic illustration of complementary superposition of data according to yet another example of the present application;
fig. 21 is a schematic diagram illustrating detection of decoding of complementary data according to another example of the present application.
Detailed Description
The present application will be described in further detail below with reference to the accompanying drawings by way of specific embodiments.
In this application, ovXDM (Overlapped X Division Multiplexing) is used to refer to an overlap Multiplexing system, where X may represent time T, frequency F, code domain C, space S, or hybrid H, and accordingly, the OvXDM system is an OvTDM system, an OvFDM system, an OvCDM system, an OvSDM system, or an OvHDM system. The inventive concept of the present application resides in: the head and the tail of the data which are subjected to the overlapping multiplexing coding are overlapped at a sending end or a receiving end, so that all data symbols are fully overlapped before the data are decoded according to a certain decoding algorithm, thereby solving the problem of higher error rate of the last symbols in the traditional technology and greatly reducing the error rate of a system on one hand, and not requiring the data to have large length on the other hand, and obtaining a stable decoding path even if the data has short length, thereby reducing the decoding processing time delay and improving the processing time precision and the transmission speed of the system. The present application discloses an OvXDM system, which comprises the complementary encoding apparatus disclosed in the following embodiment one, or comprises the complementary decoding apparatus disclosed in the following embodiment two.
Example one
Referring to fig. 2, the present embodiment discloses a complementary coding method suitable for OvXDM system, which includes steps S01 to S09.
And S01, generating an initial envelope waveform in a first domain according to the design parameters.
And S03, shifting the initial envelope waveform on a first domain according to the overlapping multiplexing times at preset intervals to obtain shifted envelope waveforms of all fixed intervals.
Step S05, multiplying the digital signals in the input sequence by the corresponding displacement envelope waveforms to obtain modulation envelope waveforms;
and S07, overlapping the modulation envelope waveforms on a first domain to obtain a complex modulation envelope waveform on the first domain, wherein the complex modulation envelope waveform comprises a first section which is not fully overlapped, a main section which is fully overlapped and a tail section which is not fully overlapped.
And S09, superposing the first segment of the complex modulation envelope waveform to the tail segment, or superposing the tail segment to the first segment to generate a complementary complex modulation envelope waveform, and then carrying out subsequent processing.
In one embodiment, the OvXDM system is an OvFDM system, and accordingly, the first domain is a frequency domain. In step S09, the generated complementary complex modulation envelope waveform is subsequently processed, in one embodiment, by transforming it into a time domain complementary complex modulation envelope waveform by, for example, inverse fourier transform, for transmission.
In one embodiment, the OvXDM system is an OvTDM system, and accordingly, the first domain is a time domain at this time. Subsequent processing of the generated complementary complex modulation envelope waveform, in one embodiment, transmits it, at step S09.
Correspondingly, referring to fig. 3, the present embodiment further provides a complementary encoding apparatus suitable for the OvXDM system, which includes a waveform generating module 01, a shifting module 03, a multiplying module 05, a superimposing module 07, and a complementary module 09, and in an embodiment, may further include a subsequent processing module 11.
The waveform generating module 01 is configured to generate an initial envelope waveform in a first domain according to the design parameters.
The shifting module 03 is configured to shift the initial envelope waveform in the first domain at predetermined intervals according to the number of overlapping multiplexing to obtain shifted envelope waveforms at fixed intervals.
The multiplication module 05 is configured to multiply the digital signal in the input sequence by the respective corresponding shifted envelope waveform to obtain each modulated envelope waveform.
The superposition module 07 is configured to superpose the modulation envelope waveforms in a first domain to obtain a complex modulation envelope waveform in the first domain, where the complex modulation envelope waveform includes a first segment that is not sufficiently superposed, a main segment that is sufficiently superposed, and a last segment that is not sufficiently superposed.
The complementary module 09 is configured to superimpose the first segment of the complex modulation envelope waveform onto the last segment, or superimpose the last segment onto the first segment, so as to generate a complementary complex modulation envelope waveform;
the post-processing module 11 is configured to perform post-processing on the complementary complex modulation envelope waveform.
In one embodiment, when the OvXDM system is an OvFDM system, accordingly, the first domain is a frequency domain. The subsequent processing of the generated complementary complex modulation envelope waveform by the subsequent processing module 11 may be, in one embodiment, transforming it into a time domain complementary complex modulation envelope waveform by, for example, inverse fourier transform, for transmission.
In one embodiment, the OvXDM system is an OvTDM system, and accordingly, the first domain is a time domain at this time. Subsequent processing of the generated complementary complex modulation envelope waveform by the subsequent processing module 11, in one embodiment, transmits it.
Example two
As shown in fig. 4, the present embodiment proposes a complementary decoding method suitable for OvXDM system, which includes steps S31 to S35.
Step S31, receiving a signal and processing the received signal to obtain a digital signal in a first domain, where the digital signal in the first domain includes a first segment that is not sufficiently superimposed, a main segment that is sufficiently superimposed, and a last segment that is not sufficiently superimposed.
In one embodiment, the OvXDM system is an OvFDM system, and accordingly, the first domain is a frequency domain. In one embodiment, specifically, in step S31, symbol synchronization is first formed in the time domain for the received signal; then, the signal of each symbol time interval is subjected to digital processing, including sampling and quantization, and is changed into a received digital signal sequence; then, carrying out Fourier transform on the received digital signal sequence of each time symbol interval to form an actual received signal frequency spectrum of each time symbol interval; and segmenting the actual received signal spectrum of each time symbol interval in a frequency domain at subcarrier spectrum intervals to obtain the actual received signal segmented spectrum.
In one embodiment, the OvXDM system is an OvTDM system, and accordingly, the first domain is a time domain. In an embodiment, specifically, in step S31, the received signal is synchronized first, including carrier synchronization, frame synchronization, symbol time synchronization, and the like; then according to the sampling theorem, the received signal in each frame is processed digitally; and cutting the received waveform according to the waveform sending time interval.
And step S33, superposing the head segment of the digital signal in the first domain to the tail segment, or superposing the tail segment to the head segment, so as to generate a complementary digital signal.
And S35, decoding the digital signal according to a certain decoding algorithm. The decoding algorithm may employ existing or future-occurrence decoding algorithms, for example, the decoding algorithm may be a viterbi decoding algorithm, an iterative decoding algorithm, or the like.
In one embodiment, the OvXDM system is an OvFDM system, and accordingly, the first domain is a frequency domain.
In one embodiment, the OvXDM system is an OvTDM system, and accordingly, the first domain is a time domain.
In one embodiment, the OvXDM system is an OvCDM system, and accordingly, the first domain is a code division domain.
In an embodiment, the OvXDM system is an OvSDM system and accordingly, the first domain is a spatial domain.
In one embodiment, the OvXDM system is an OvHDM system, and accordingly, the first domain is a hybrid domain
Accordingly, as shown in fig. 5, the present embodiment further proposes a complementary decoding apparatus suitable for the OvXDM system, which includes a receiving module 31, a complementary module 33, and a decoding module 35.
The receiving module 31 is configured to receive a signal and process the received signal to obtain a digital signal in a first domain, where the digital signal in the first domain includes a first segment that is not sufficiently superimposed, a main segment that is sufficiently superimposed, and a last segment that is not sufficiently superimposed.
The complementary module 33 is configured to superimpose the first segment of the digital signal in the first domain onto the last segment, or the last segment onto the first segment, to generate a complementary digital signal.
The decoding module 35 is configured to decode the digital signal according to a certain decoding algorithm. The decoding algorithm may be an existing or future-appearing decoding algorithm, for example, the decoding algorithm may be a viterbi decoding algorithm, an iterative decoding algorithm, or the like.
The above embodiments are explained and illustrated below in two practical examples.
The first example is not illustrated with an OvFDM system.
The existing OvFDM system is in a parallelogram shape for overlapping data, a first section and a tail section are respectively arranged in front of and behind the coded data, and the shapes of the sections are in an upper triangle shape and a lower triangle shape and are just complementary. The 'tail segment' of the encoded data is moved to the position of the 'head segment', or the 'head segment' is moved to the position of the 'tail segment', namely, the lower triangle and the upper triangle are complementarily superposed to form a rectangular shape, and the superposition can be called as a complementary OvFDM system. The complemented data is in a rectangular shape, and each data is overlapped for K times, so that the problems in the prior art in the background technology are solved.
The encoding process is shown in fig. 6:
(1) An initial envelope waveform H (f) within the spectrum is generated in accordance with the design parameters.
(2) And (3) shifting the initial envelope waveform H (f) designed in the step (1) by a specific carrier spectrum interval delta B to form other subcarrier envelope waveforms H (f-i multiplied by delta B) with respective spectrum intervals delta B. The spectrum interval is a subcarrier spectrum interval delta B, wherein the subcarrier spectrum interval delta B = B/K, B is the bandwidth of the initial envelope waveform, and K is the number of overlapping multiplexes. In an embodiment, the subcarrier spectral spacing Δ B is greater than or equal to the inverse of the system samples.
(3) Symbol X to be transmitted i Respectively multiplying the envelope waveforms H (f-i multiplied by delta B) of the corresponding subcarriers generated in the step (2) to obtain modulation envelope waveforms X modulated by the subcarriers i H(f-i×ΔB)。
(4) Subjecting each modulation envelope waveform formed in (3) to X i H (f-i × Δ B) superposition, forming a complex modulation envelope waveform, the complex modulation envelope waveform superposition process can be expressed as:
(5) And (3) performing inverse discrete fourier transform on the complex modulation envelope waveform generated in the step (4) to finally form a complex modulation envelope waveform of a time domain, wherein a transmission signal can be expressed as: signal (t) TX ＝ifft(S(f))。
The above is the encoding process of the conventional OvFDM system. (4) The superposition process in (2) is reflected on the encoding of the data, as shown in fig. 1. For data with a symbol length of N, the length of the data is changed into N + K-1 after modulation and coding, and the data has a first section with the length of K-1 and not subjected to K-time superposition and a tail section with the length of K-1 and not subjected to K-time superposition.
The decoding process is shown in fig. 7:
the transmitting end transmits the coded and modulated signal through the antenna, the signal is transmitted in a wireless channel, the receiving end performs matched filtering on the received signal, and the received signal is a time domain signalTherefore, it is necessary to perform fourier transform on the time domain signal to convert it into a frequency domain signal, and then perform decoding processing on the signal, where the inverse fourier transform and the fourier transform in the OvFDM system both involve setting the number of sampling points, and the number of sampling points should be kept consistent and should be 2 n . Then the signals are respectively sampled and decoded, and finally the output bit stream is judged. Specifically, the method comprises the following steps:
(6) Symbol synchronization is formed in the time domain for the received signal.
(7) The signal for each symbol time interval is digitally processed, including sampling and quantization, into a sequence of received digital signals.
(8) The received digital signal sequence for each time symbol interval is fourier transformed to form an actual received signal spectrum for each time symbol interval. The expression is as follows: signal (f) RX ＝fft(s(t))。
(9) And segmenting the actual received signal spectrum of each time symbol interval in a frequency domain by a subcarrier spectrum interval delta B to obtain the actual received signal segmented spectrum.
(10) And decoding the cut frequency spectrum waveform according to a certain decoding algorithm.
The above is the encoding process of the conventional OvFDM system, and in the decoding process, the data in the tail segment is not decoded, and because the length of the useful information stream is N, only the first N data in the data with the length of N + K-1 are decoded.
The inventive concept of the present application is to shift the first segment of the encoded data with the length of N + K-1 to the last segment, and superimpose the first segment with the original last segment to form a new last segment, so as to form a new complementary encoded data with the data length of N, and certainly, shift the last segment to the first segment to superimpose, as shown in fig. 8. The moving process can be put into the programming process or the decoding process. In one embodiment, if the move process is put into the programming process, the first/last segment of data may be moved to the last/first segment for superposition before (5). In one embodiment, if the moving process is put into the decoding process, the first segment/last segment of the data can be moved to the last segment/first segment for superposition before (10).
(10) The decoding algorithm in (1) includes various algorithms, such as a viterbi decoding algorithm and an iterative decoding algorithm. The following description will not be made by taking the viterbi decoding method as an example.
After the application, when the decoding is carried out to (10), the sequence y with the length of N is used i (i = 1-N), each symbol is the result of the superposition of K symbols, i.e. the decoding of a complementary data sequence. .
Firstly, generating a possible state after K paths of symbols are superposed, namely an ideal symbol S theory (j),j＝1～2 K In total 2 K And (4) seed preparation.
The K-way symbol is represented as:
the corresponding representation form after superposition is
If +1 is used to represent the superposed output level, K +1 symbol levels are included in total, namely +/-K, +/- (K-2) and +/-2 k ) K =1 to K/2, and is denoted as Y theory (index),index＝1～K+ 1。
For example, when K =3, the symbols are superimposed to have 8 states in total, which are:
four kinds of output symbol levels of + -3, + -1, namely Y theory (1)＝-3，Y theory (2)＝-1，Y theory (3)＝1，Y theory (4)＝3。
And secondly, calculating the measure distance of the current symbol.
The metric distance represents the distance between two signals and is defined as
When p =2, i.e. the euclidean distance, which is the true distance between two signals, the distance between the actual signal and the ideal signal can be truly reflected, which is defined as the distance between the actual signal and the ideal signal
In this embodiment, the euclidean distance is used as an example.
Using the current symbol y i (i =1 to N) and 2 produced K Ideal symbol S theory (j) Sequentially calculating Euclidean distance to obtain 2 k The euclidean distance. Is marked as
And thirdly, calculating the accumulated distance of the current symbol.
When comparing the euclidean distances, if only comparing the euclidean distances between the current symbol and the theoretical symbol, the optimal path may have a deviation with the increase of the decoding depth, resulting in a decrease in the success rate of the final decoding.
Since the symbol superposition process is that K symbols are mutually overlapped, the correlation between the front and the back of the symbols is large, the sum of the current Euclidean distance and the previously accumulated Euclidean distance is adopted for judgment, so that the optimal path can be judged more accurately along with the increase of the decoding depth, and the decoding success rate is improved.
The cumulative euclidean distance expression is noted as:
wherein D i,j Representing the Euclidean distance after the accumulation of the current symbol, wherein only the current distance d is calculated because the first symbol has no accumulated distance current . i denotes the index of the current symbol in the whole received symbol sequence, j denotes the index of the accumulated symbol, totaling 2 K And (4) seed selection.
D prev_i-1 Representing the current node y i The sum of the Euclidean distances after the previous screening is 2 in total K-1 I.e. 2 K-1 Seed D prev_i-1 Is from 2 K Seed D i-1,j And (4) screening. Due to 2 K The middle state is different only in the first path of symbols and finally only keeps 2 K-1 Seed Euclidean distance and 2 K-1 Strip optimal path, hence D prev_i-1 In total 2 K-1 Euclidean distance, since the first symbol does not accumulate distance, there is no D prev_i-1 。
d current Always being the euclidean distance of the current symbol from the theoretical symbol.
Fourth, select the best path
After the treatment of the third step, 2 is obtained K Accumulation Euclidean distance D i,j And path j ，j＝1～2 K Due to this 2 K The seed path can be roughly divided into 2 sections, i.e., whether the previous state was input +1 or input-1. Therefore we will 2 K Each path is divided into two parts, each part comprising 2 K-1 And the strip path divides the corresponding accumulative Euclidean distance into two parts.
Comparing the accumulated Euclidean distances of each row corresponding to each part pairwise to obtain the minimum, namely comparing the first row of the first part with the first row of the second part, comparing the second row of the first part with the second row of the second part, and so on to obtain the minimum Euclidean distance of each row, and recording the accumulated Euclidean distance D corresponding to the row i,j And labeled as the new filtered cumulative Euclidean distance D prev_i Which is to calculate the cumulative Euclidean distance D of the i +1 node i+ 1 ,j The accumulated Euclidean distances of the previous i nodes are used, meanwhile, a symbol path corresponding to the accumulated Euclidean distances is reserved, the current symbol is input with +1 or-1 according to the transfer path, and the depth of the corresponding path is added with 1.
After the treatment of the steps, the compound is obtained by 2 K-1 Euclidean distance D prev_i And corresponding 2 K-1 A symbol path.
Fifth, last symbol processing
According to the first to fourth stepsProcessing the rest symbols, and when the last symbol y is processed N Then, through screening, 2 is obtained K-1 Euclidean distance d j And corresponding 2 K-1 A path of symbols, where the depth of the path is N. To 2 K-1 And sequencing the Euclidean distances from small to large, finding out the Euclidean distance with the minimum accumulated distance to obtain the corresponding index, and taking out the decoding symbol sequence of the index corresponding to the path according to the index to obtain the final decoding result.
Noting the decoded sequence as S decode (i) I =1 to N. Comparison decoding sequence S decode (i) And input sequence x i And whether the decoding result is correct can be checked, and the error rate of the system is calculated.
The decoding process refers to the code tree diagram of the overlapping time division input-output relationship with K =3 in fig. 9, the node state transition diagram in fig. 10, and the trellis diagram of the ovfdm system with K =3 in fig. 11.
Generally, because the length of data to be decoded is long, and the accumulated distance is larger and larger as the decoding depth is deeper, the system consumes system resources if the system decodes all the data and then outputs the decoded data, and therefore, a better processing method is adopted for storing the storage capacity and the distance of the path. Generally selecting a path memory length of 4K-5K, and if the path memory is full and the decoding decision output is not forced to be output, outputting initial nodes with the same path first; the accumulated distance is larger and larger as the decoding depth is deeper, the accumulated distance can be stored as a relative distance, that is, a reference distance is defined, the value of the reference distance depends on different systems, and the distance storage records the relative value of the second distance of each path relative to the reference distance, and the comparison is performed through the relative distance when the optimal path is screened.
For example, in this case, we use square waves as the multiplexing waveform to illustrate the encoding and decoding process. Setting the number of overlapping multiplexing times K =3, the length of an input sequence N =9, and a symbol sequence x i With { -1, +1, -1, +1, +1, +1, -1, +1, -1}, the output sequence length becomes 11 (N + K-1) after being coded by the OvFDM system, and the output symbol sequence s' (t) = { -1,0, -1, +1, +1, +3, +1, +1, -1,0, -1}, the symbol superposition process of this case is shown in fig. 12, and it can be seen that the first two and the last two symbols in the superposed symbol sequence are not superposed in 3 ways, so we add these two signals complementarily and put them in front of the middle symbol to form a complementary ovdm mode, and the output symbol sequence after complementary superposition is s (t) = { -1, -1, -1, +1, +1, +3, +1, +1, -1}. The coded signal is transmitted through an actual channel, and the symbol sequence received at the receiving end has deviation, which is marked as y i I =1 to 9. The sequence of symbols received in this case is:
y i ＝{-0.9155,-1.4137,0.0825,0.5699,0.5244,3.7270,0.2254,1.9963,-2.1995}；
all symbols are decoded one by one according to the viterbi decoding method described above, and the symbol detection path in the decoding process is shown in fig. 13. After decoding of all symbols is completed, four optimal paths and corresponding euclidean distances thereof are obtained as follows:
path 1 ：{-1,1,-1,1,1,1,-1,1,1}；
path 2 ：{-1,1,-1,1,1,1,-1,1,-1}；
path 3 ：{-1,1,-1,1,1,1,-1,-1,1}；
path 4 ：{-1,1,-1,1,1,1,-1,-1,-1}；
the corresponding Euclidean distance is d in sequence 1 ＝8.1839，d 2 ＝6.1839，d 3 ＝8.1839，d 4 =7.7848, and these four distances are compared in magnitude to obtain d 2 Has the minimum Euclidean distance, the corresponding path 2 Is selected as the output symbol sequence. I.e. the sequence of symbols S we consider to output decode =1,1, -1,1,1,1, -1,1, -1}, and the input symbol sequence x i { -1, +1, -1, +1, +1, +1, -1, +1, -1}, comparative S decode And x i If the two sequences are identical, the decoding result is correct.
The second example is not illustrated with an OvTDM system.
The existing OvTDM system is in a parallelogram for overlapping data, a section of 'first section' and a section of 'last section' are respectively arranged in front of and behind the encoded data, and the shapes of the sections are in an upper triangle shape and a lower triangle shape and are just complementary. We move the "end segment" of the encoded data to the position of the "first segment", or move the "first segment" to the position of the "end segment", i.e. the lower triangle and the upper triangle are complementarily superimposed to form a rectangle, which can be called complementary OvTDM system. The complemented data is in a rectangular shape, and each data is overlapped for K times, so that the problems in the prior art in the background technology are solved.
The encoding process is shown in fig. 14:
(1) And generating an initial envelope waveform h (t) in the time domain according to the design parameters.
(2) And (3) after the envelope waveform h (T) designed in the step (1) is subjected to specific time shift, forming offset envelope waveforms h (T-i multiplied by delta T) of the transmission signals at other moments.
(3) The symbol x to be transmitted i Multiplying the generated offset envelope waveform h (T-i multiplied by delta T) at the corresponding moment in the step (2) to obtain a modulation envelope waveform x at each moment i h(t-i×ΔT)。
(4) Forming a modulation envelope waveform x of each time instant in (3) i h (T-i x delta T) are superposed to form a complex modulation envelope waveform for transmission. The complex modulation envelope waveform may be expressed as follows:
the above is the encoding process of the conventional OvTDM system. (4) The superposition process in (2) is reflected on the encoding of the data, as shown in fig. 1. For data with a symbol length of N, the length of the data is changed into N + K-1 after modulation and coding, and the data has a first section with the length of K-1 and not subjected to K-time superposition and a tail section with the length of K-1 and not subjected to K-time superposition. The data in fig. 1 are arranged into a parallelogram, the left end triangle is the 'first segment data', the right end triangle is the 'last segment data', and the middle is the fully overlapped data.
The decoding process is shown in fig. 15:
the transmitting end transmits the coded and modulated signals through an antenna, the signals are transmitted in a wireless channel, the receiving end performs matched filtering on the received signals, then samples and decodes the signals respectively, and finally, the output bit stream is judged. Specifically, the method comprises the following steps:
(5) Firstly, the received signals are synchronized, including carrier synchronization, frame synchronization, symbol time synchronization, etc.
(6) The received signal within each frame is digitized according to the sampling theorem.
(7) The received waveform is sliced according to the waveform transmission time interval.
(8) And decoding the cut waveform according to a certain decoding algorithm.
The above is the encoding process of the conventional OvTDM system, and in the decoding process, the data in the tail segment is not decoded, and because the length of the useful information stream is N, only the first N data in the data with the length of N + K-1 are decoded.
The inventive concept of the present application is to shift the first segment of the encoded data with the length of N + K-1 to the last segment, and superimpose the first segment with the original last segment to form a new last segment, so as to form a new complementary encoded data with the data length of N, and certainly, the last segment may be shifted to the first segment to superimpose, as shown in fig. 16. The moving process can be put into the programming process or the decoding process. In one embodiment, if the move process is put into the programming process, the first segment/end segment of the data may be moved to the end segment/first segment for superposition in (4). In one embodiment, if the above-mentioned moving process is put into the decoding process, the first segment/last segment of the data can be moved to the last segment/first segment for superposition before (8). A
(8) The decoding algorithm in (1) includes various algorithms, such as a viterbi decoding algorithm and an iterative decoding algorithm. The following description will not be made by taking the viterbi decoding method as an example.
After the present application, when the decoding to (8) is performed, the sequence y with the length of N is used i (i = 1-N), each symbol is the result of the superposition of K symbols, i.e. the decoding of a complementary data sequence.
Firstly, generating possible states after superposition of K paths of symbolsI.e. the ideal symbol S theory (j),j＝1～2 K In total 2 K And (4) seed preparation.
The K-way symbol is represented as:
the corresponding representation form after superposition is
If +1 is used to represent the superposed output level, K +1 symbol levels are included in total, namely +/-K, +/- (K-2) and +/-2 k ) K =1 to K/2, and is denoted as Y theory (index),index＝1～K+ 1。
For example, when K =3, the symbols are superimposed to have 8 states in total, which are:
the corresponding output symbol levels are four, namely Y, of +/-3 and +/-1 theory (1)＝-3，Y theory (2)＝-1，Y theory (3)＝1，Y theory (4)＝3。
And secondly, calculating the measure distance of the current symbol.
The metric distance represents the distance between two signals and is defined as
When p =2, i.e. the euclidean distance, which is the true distance between two signals, the distance between the actual signal and the ideal signal can be truly reflected, which is defined as the distance between the actual signal and the ideal signal
In this embodiment, the euclidean distance is used as an example.
Using the current symbol y i (i =1 to N) and(1) 2 of (2) K Ideal symbol S theory (j) Sequentially calculating Euclidean distances to obtain 2 k The euclidean distance. Is marked as
And thirdly, calculating the accumulated distance of the current symbol.
When comparing the euclidean distances, if only comparing the euclidean distances between the current symbol and the theoretical symbol, the optimal path may have a deviation with the increase of the decoding depth, resulting in a decrease in the success rate of the final decoding.
Since the symbol superposition process is that K symbols are mutually overlapped and the correlation between the front symbol and the rear symbol is large, the sum of the current Euclidean distance and the previously accumulated Euclidean distance is adopted for judgment, so that the optimal path can be judged more accurately along with the increase of the decoding depth, and the decoding success rate is improved.
The cumulative euclidean distance expression is noted as:
wherein D i,j Representing the Euclidean distance after the accumulation of the current symbol, wherein only the current distance d is calculated because the first symbol has no accumulated distance current . i denotes the index of the current symbol in the whole received symbol sequence, j denotes the index of the accumulated symbol, totaling 2 K And (4) seed preparation.
D prev_i-1 Representing the current node y i The sum of the Euclidean distances after the previous screening is 2 in total K-1 I.e. 2 K-1 Seed D prev_i-1 Is from 2 K Seed D i-1,j And (4) screening. Due to 2 K The middle state is different only in the first path of symbols and finally only keeps 2 K-1 Seed Euclidean distance and 2 K-1 Strip optimal path, hence D prev_i-1 In total 2 K-1 Euclidean distance, since the first symbol does not accumulate distance, there is no D prev_i-1 。d current Always being the euclidean distance of the current symbol from the theoretical symbol.
Fourthly, selecting the best path.
After the treatment of the third step, 2 is obtained K Accumulation Euclidean distance D i,j And path j ，j＝1～2 K Due to this 2 K The seed path can be divided into 2 parts, i.e. whether the previous state is input +1 or input-1. Therefore we will 2 K Each path is divided into two parts, each part comprising 2 K-1 And the strip path divides the corresponding accumulative Euclidean distance into two parts.
Comparing the accumulated Euclidean distances of each row corresponding to each part pairwise to obtain the minimum, namely comparing the first row of the first part with the first row of the second part, comparing the second row of the first part with the second row of the second part, and so on to obtain the minimum Euclidean distance of each row, and recording the accumulated Euclidean distance D corresponding to the row i,j And labeled as the new filtered cumulative Euclidean distance D prev_i Which is to calculate the cumulative Euclidean distance D of the i +1 node i+1,j The accumulated Euclidean distances of the previous i nodes are used, meanwhile, a symbol path corresponding to the accumulated Euclidean distances is reserved, the current symbol is input with +1 or-1 according to the transfer path, and the depth of the corresponding path is added with 1.
After the treatment of the steps, the compound is obtained by 2 K-1 Euclidean distance D prev_i And corresponding 2 K-1 A symbol path.
Fifth, last symbol processing.
Processing the rest symbols according to the first to the fourth steps in sequence, and when the last symbol y is processed N Then, through screening, 2 is obtained K-1 Euclidean distance d j And corresponding 2 K-1 A path of symbols, where the depth of the path is N. To 2 K-1 And sequencing the Euclidean distances from small to large, finding out the Euclidean distance with the minimum accumulated distance to obtain the corresponding index, and taking out the decoding symbol sequence of the index corresponding to the path according to the index to obtain the final decoding result.
Noting the decoded sequence as S decode (i) I =1 to N. Comparison decoding sequence S decode (i) And input sequence x i And whether the decoding result is correct can be checked, and the error rate of the system is calculated.
The decoding process refers to the code tree diagram of fig. 17 with K =3 overlapping time division input-output relationship, the node state transition diagram of fig. 18, and the K =3, ovtdm trellis (trellis) diagram of fig. 19.
Generally, because the length of data to be decoded is long, and the accumulated distance is larger and larger as the decoding depth is deeper, the system consumes system resources if the system decodes all the data and then outputs the decoded data, and therefore, a better processing method is adopted for storing the storage capacity and the distance of the path. Generally selecting a path memory length of 4K-5K, and if the path memory is full and the decoding decision output is not forced to be output, outputting initial nodes with the same path first; the accumulated distance is larger and larger as the decoding depth is deeper, the accumulated distance can be stored as a relative distance, that is, a reference distance is defined, the value of the reference distance depends on different systems, and the distance storage records the relative value of the second distance of each path relative to the reference distance, and the comparison is performed through the relative distance when the screening of the optimal path is performed.
For example, in this case, we use square waves as the multiplexing waveform to illustrate the encoding and decoding process. Setting the number of overlapping multiplexing times K =3, the length of an input sequence N =9, and a symbol sequence x i The length of an output sequence becomes 11 (N + K-1) after being coded by an OvTDM series, an output symbol sequence s' (t) = -1,0, -1, +1, +1, +3, +1, +1, -1,0, -1} in this case, the symbol superposition process of this case is as shown in fig. 20, and it can be seen that the first two and the last two symbols in the superposed symbol sequence are not superposed by 3 paths, so that the two signals are complementarily superposed and placed in front of the middle symbol to form a complementary OvTDM mode, and the output symbol sequence after complementary superposition is s (t) = { -1, -1, -1, +1, +3, +1, +1, -1}. The coded signal is transmitted through an actual channel, and the symbol sequence received at the receiving end has deviation, which is marked as y i I =1 to 9. The sequence of symbols received in this case is:
y i ＝{-0.9155,-1.4137,0.0825,0.5699,0.5244,3.7270,0.2254,1.9963,-2.1995}；
all the symbols are decoded one by one according to the above-mentioned viterbi decoding method, and the symbol detection path in the decoding process is shown in fig. 21. After decoding of all symbols is completed, four optimal paths and corresponding euclidean distances thereof are obtained as follows:
path 1 ：{-1,1,-1,1,1,1,-1,1,1}；
path 2 ：{-1,1,-1,1,1,1,-1,1,-1}；
path 3 ：{-1,1,-1,1,1,1,-1,-1,1}；
path 4 ：{-1,1,-1,1,1,1,-1,-1,-1}；
the corresponding Euclidean distances are d in sequence 1 ＝8.1839，d 2 ＝6.1839，d 3 ＝8.1839，d 4 =7.7848, and these four distances are compared in magnitude to obtain d 2 Has the minimum Euclidean distance, the corresponding path 2 Is selected as the output symbol sequence. I.e. the sequence of symbols S we consider to output decode =1,1, -1,1,1,1, -1,1, -1}, and the input symbol sequence x i =1, +1, -1, +1, +1, +1, -1, +1, -1}, comparative S decode And x i If the two sequences are identical, the decoding result is correct.
The complementary coding method and device, and the complementary decoding method and device can achieve higher decoding success rate under the condition of the same signal to noise ratio, can be widely applied to actual mobile communication systems such as TD-LTE and TD-SCDMA and the like besides the systems such as OvTDM and OvFDM, and can also be widely applied to any wireless communication systems such as satellite communication, microwave line-of-sight communication, scattering communication, atmospheric optical communication, infrared communication and aquatic communication. The method can be applied to large-capacity wireless transmission and also can be applied to a small-capacity light radio system.
The foregoing is a more detailed description of the present application in connection with specific embodiments thereof, and it is not intended to limit the present application to the particular forms disclosed. It will be apparent to those skilled in the art from this disclosure that many more simple derivations or substitutions can be made without departing from the inventive concepts herein.
Claims (10)
1. A complementary coding method suitable for an OvXDM system is characterized by comprising the following steps:
generating an initial envelope waveform in a first domain based on the design parameters;
shifting the initial envelope waveform on a first domain according to the overlapping multiplexing times at preset intervals to obtain shifted envelope waveforms of all fixed intervals;
multiplying digital signals in the input sequence by respective corresponding displacement envelope waveforms to obtain each modulation envelope waveform;
superposing the modulation envelope waveforms on a first domain to obtain complex modulation envelope waveforms on the first domain, wherein the complex modulation envelope waveforms comprise a first section which is not sufficiently superposed, a main section which is sufficiently superposed and a tail section which is not sufficiently superposed;
only overlapping the first segment of the complex modulation envelope waveform to the tail segment, so that the first segment which is not fully overlapped and the tail segment which is not fully overlapped are overlapped, thereby all symbols are fully overlapped, and the fully overlapped main segment and the signal segment after the first segment and the tail segment are overlapped form a complementary complex modulation envelope waveform; or, only the tail segment of the complex modulation envelope waveform is superposed to the first segment, so that the tail segment which is not fully superposed and the first segment which is not fully superposed are superposed, all symbols are fully superposed, and the signal segment which is superposed by the first segment and the tail segment and the main segment which is fully superposed form a complementary complex modulation envelope waveform.
2. The complementary encoding method of claim 1, wherein the OvXDM system is an OvFDM system, an OvTDM system, an OvCDM system, an OvSDM system, or an OvHDM system; when the OvXDM system is an OvFDM system, the first domain is a frequency domain, when the OvXDM system is an OvTDM system, the first domain is a time domain, when the OvXDM system is an OvCDM system, the first domain is a code division domain, when the OvXDM system is an OvSDM system, the first domain is a space domain, and when the OvXDM system is an OvHDM system, the first domain is a hybrid domain.
3. A complementary decoding method is suitable for an OvXDM system, and is characterized by comprising the following steps:
receiving a signal and processing the received signal to obtain a digital signal in a first domain, wherein the digital signal in the first domain comprises a first segment which is not fully overlapped, a main segment which is fully overlapped and a tail segment which is not fully overlapped;
only overlapping the first segment of the complex modulation envelope waveform to the tail segment, so that the first segment which is not fully overlapped and the tail segment which is not fully overlapped are overlapped, thereby fully overlapping all symbols, and forming a complementary complex modulation envelope waveform by the fully overlapped main segment and the signal segment after the first segment and the tail segment are overlapped; or, only the tail segment of the complex modulation envelope waveform is superposed to the first segment, so that the tail segment which is not fully superposed and the first segment which is not fully superposed are superposed, all symbols are fully superposed, and the signal segment which is superposed by the first segment and the tail segment and the main segment which is fully superposed form a complementary complex modulation envelope waveform;
and decoding the digital signal according to a certain decoding algorithm.
4. The complementary decoding method of claim 3, wherein the OvXDM system is an OvFDM system, an OvTDM system, an OvCDM system, an OvSDM system, or an OvHDM system; when the OvXDM system is an OvFDM system, the first domain is a frequency domain, when the OvXDM system is an OvTDM system, the first domain is a time domain, when the OvXDM system is an OvCDM system, the first domain is a code division domain, when the OvXDM system is an OvSDM system, the first domain is a space domain, and when the OvXDM system is an OvHDM system, the first domain is a hybrid domain.
5. Complementary coding device, suitable for an OvXDM system, comprising:
a waveform generation module for generating an initial envelope waveform in a first domain based on the design parameters;
a shifting module, configured to shift the initial envelope waveform in a first domain at predetermined intervals according to the number of overlapping multiplexing, so as to obtain shifted envelope waveforms at fixed intervals;
the multiplication module is used for multiplying the digital signals in the input sequence by the respective corresponding displacement envelope waveforms to obtain the modulation envelope waveforms;
the superposition module is used for superposing the modulation envelope waveforms on a first domain to obtain complex modulation envelope waveforms on the first domain, wherein the complex modulation envelope waveforms comprise first segments which are not sufficiently superposed, main segments which are sufficiently superposed and tail segments which are not sufficiently superposed;
a complementary module, configured to superimpose only a first segment of the complex modulation envelope waveform onto a last segment, so that the first segment that is not sufficiently superimposed and the last segment that is not sufficiently superimposed are superimposed, so that all symbols are sufficiently superimposed, and the main segment that is sufficiently superimposed and a signal segment in which the first segment and the last segment are superimposed form a complementary complex modulation envelope waveform; or only overlapping the tail segment of the complex modulation envelope waveform to the first segment, so that the tail segment which is not fully overlapped and the first segment which is not fully overlapped are overlapped, all symbols are fully overlapped, and the signal segment after the first segment and the tail segment are overlapped and the main segment which is fully overlapped form a complementary complex modulation envelope waveform.
6. The complementary encoding apparatus of claim 5, wherein the first domain is a frequency domain when the OvXDM system is an OvFDM system, the first domain is a time domain when the OvXDM system is an OvTDM system, the first domain is a code division domain when the OvXDM system is an OvCDM system, the first domain is a spatial domain when the OvXDM system is an OvSDM system, and the first domain is a hybrid domain when the OvXDM system is an OvHDM system.
7. A complementary decoding apparatus, adapted to an OvXDM system, comprising:
the receiving module is used for receiving signals and processing the received signals to obtain digital signals in a first domain, wherein the digital signals in the first domain comprise a first segment which is not fully superposed, a main segment which is fully superposed and a tail segment which is not fully superposed;
a complementary module, configured to superimpose only a first segment of a complex modulation envelope waveform onto a last segment, so that the first segment that is not sufficiently superimposed and the last segment that is not sufficiently superimposed are superimposed, so that all symbols are sufficiently superimposed, and the main segment that is sufficiently superimposed and a signal segment in which the first segment and the last segment are superimposed form a complementary complex modulation envelope waveform; or, only the tail segment of the complex modulation envelope waveform is superposed to the first segment, so that the tail segment which is not fully superposed and the first segment which is not fully superposed are superposed, all symbols are fully superposed, and the signal segment which is superposed by the first segment and the tail segment and the main segment which is fully superposed form a complementary complex modulation envelope waveform;
and the decoding module is used for decoding the digital signal according to a certain decoding algorithm.
8. The complementary decoding apparatus of claim 7, wherein the first domain is a frequency domain when the OvXDM system is an OvFDM system, the first domain is a time domain when the OvXDM system is an OvTDM system, the first domain is a code division domain when the OvXDM system is an OvCDM system, the first domain is a spatial domain when the OvXDM system is an OvSDM system, and the first domain is a hybrid domain when the OvXDM system is an OvHDM system.
Ovxdm system, comprising complementary encoding means according to claim 5 or 6, or comprising complementary decoding means according to claim 7 or 8.
10. The OvXDM system in accordance with claim 9, wherein the OvXDM system is an OvFDM system, an OvTDM system, an OvCDM system, an OvSDM system, or an OvHDM system.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610592255.0A CN107645364B (en) | 2016-07-22 | 2016-07-22 | Complementary coding method and device, complementary decoding method and device, and OvXDM system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610592255.0A CN107645364B (en) | 2016-07-22 | 2016-07-22 | Complementary coding method and device, complementary decoding method and device, and OvXDM system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107645364A CN107645364A (en) | 2018-01-30 |
| CN107645364B true CN107645364B (en) | 2022-12-09 |
Family
ID=61109900
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610592255.0A Active CN107645364B (en) | 2016-07-22 | 2016-07-22 | Complementary coding method and device, complementary decoding method and device, and OvXDM system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107645364B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112491494B (en) * | 2019-09-11 | 2023-05-09 | ***通信有限公司研究院 | Code determining method, device, equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1269085A (en) * | 1998-03-13 | 2000-10-04 | 末广直树 | Comb-like spectrum communication method of complementary series repetition modulation type |
| CN1625079A (en) * | 2003-10-30 | 2005-06-08 | 朗迅科技公司 | System and method for providing multi-beam scheduling |
| WO2008019529A1 (en) * | 2006-08-09 | 2008-02-21 | Daoben Li | A method and system for frequency division multiplexing |
| CN103454495A (en) * | 2013-09-13 | 2013-12-18 | 电子科技大学 | Self-adaptive high-precision fast spectral analysis method |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100568863C (en) * | 2005-09-30 | 2009-12-09 | 中国科学院上海微***与信息技术研究所 | Emission, receiving system and method thereof based on many Methods of Subband Filter Banks |
| US8121299B2 (en) * | 2007-08-30 | 2012-02-21 | Texas Instruments Incorporated | Method and system for music detection |
| CN103179067B (en) * | 2013-03-07 | 2015-07-29 | 西安理工大学 | A kind of multi-system digital communication carrier modulation method |
| CN103795544B (en) * | 2014-02-12 | 2017-04-19 | 天地融科技股份有限公司 | Audio signal transmitting method, mobile terminal and intelligent secret key device |
-
2016
- 2016-07-22 CN CN201610592255.0A patent/CN107645364B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1269085A (en) * | 1998-03-13 | 2000-10-04 | 末广直树 | Comb-like spectrum communication method of complementary series repetition modulation type |
| CN1625079A (en) * | 2003-10-30 | 2005-06-08 | 朗迅科技公司 | System and method for providing multi-beam scheduling |
| WO2008019529A1 (en) * | 2006-08-09 | 2008-02-21 | Daoben Li | A method and system for frequency division multiplexing |
| CN103454495A (en) * | 2013-09-13 | 2013-12-18 | 电子科技大学 | Self-adaptive high-precision fast spectral analysis method |
Non-Patent Citations (1)
| Title |
|---|
| 《重叠频分复用***循环前缀的设计和分析》;王键;《电子科技大学学报》;20090131;32-39 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107645364A (en) | 2018-01-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3418948B1 (en) | Data transmission network configuration | |
| CN107919941B (en) | Modulation-demodulation method and device based on overlapping multiplexing | |
| US5029186A (en) | Method of demodulation in digital communication systems with multipath propagation | |
| JP7017585B2 (en) | Transmitters and receivers and corresponding methods | |
| WO2017174003A1 (en) | Timing synchronization method and device | |
| CN110832817A (en) | Transmitter, receiver and corresponding method | |
| CN104904171A (en) | Method and device for demodulating GFSK-modulated signals with Q states | |
| US10771303B2 (en) | Overlapped multiplexing-based decoding method and device, and modulation and demodulation method and system | |
| CN107645364B (en) | Complementary coding method and device, complementary decoding method and device, and OvXDM system | |
| CN112039613B (en) | Processing method and device for asymmetric PCMA (pulse code division multiple Access) mixed signal | |
| CN107645360B (en) | OvXDM system decoding method and device and OvXDM system | |
| US20100183060A1 (en) | Method and apparatus of frequency offset-free frame synchronization for high order qam signals in modem apparatus | |
| WO2018019109A1 (en) | Decoding method, device and system based on overlapped multiplexing | |
| CN107277913B (en) | timing synchronization method, device and system | |
| CN107294883B (en) | Channel estimation method and device | |
| CN107294889B (en) | Carrier synchronization method and device | |
| CN107276940B (en) | Timing synchronization method, device and system | |
| CN107276708B (en) | Timing synchronization method, device and system | |
| CN109831276B (en) | Signal processing method and device | |
| CN107979553B (en) | Carrier synchronization method and device | |
| CN109687935B (en) | Decoding method and device | |
| CN107888327B (en) | Decoding method, device and system for OvXDM system | |
| CN107645363B (en) | Quick decoding method and device suitable for OvXDM system and OvXDM system | |
| CN107276941B (en) | Signal processing method and system | |
| CN107276945B (en) | Timing synchronization method, device and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20190830 Address after: 518057 2nd Floor, No. 9 Software Building, Zhongxin Road, Yuehai Street, Nanshan District, Shenzhen City, Guangdong Province Applicant after: SHEN ZHEN KUANG-CHI HEZHONG TECHNOLOGY Ltd. Address before: Bantian street Longgang District of Shenzhen City, Guangdong province 518000 Jihua Road, the new world Huasai Industrial Area No. 2, building 101 (two floor) 201 Applicant before: SHENZHEN SUPER DATA LINK TECHNOLOGY Ltd. |
|
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20221116 Address after: 276000 Room 1511, Building A, Applied Science City, Nanjing Road, Liuqing Street, Lanshan District, Linyi City, Shandong Province Applicant after: Shandong No.1 Ark Robot Intelligent Technology Co.,Ltd. Address before: 518057 2nd floor, software building, No.9, Gaoxin middle 1st Road, Yuehai street, Nanshan District, Shenzhen City, Guangdong Province Applicant before: SHEN ZHEN KUANG-CHI HEZHONG TECHNOLOGY Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |