CN106911424A - Interpretation method, device and its system - Google Patents
Interpretation method, device and its system Download PDFInfo
- Publication number
- CN106911424A CN106911424A CN201510970271.4A CN201510970271A CN106911424A CN 106911424 A CN106911424 A CN 106911424A CN 201510970271 A CN201510970271 A CN 201510970271A CN 106911424 A CN106911424 A CN 106911424A
- Authority
- CN
- China
- Prior art keywords
- symbol
- distance
- sebolic addressing
- sequence
- symbol sebolic
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0047—Decoding adapted to other signal detection operation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
- H04L25/03006—Arrangements for removing intersymbol interference
- H04L25/03178—Arrangements involving sequence estimation techniques
- H04L25/03312—Arrangements specific to the provision of output signals
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of interpretation method, device and its system.The method is used for OvFDM systems, including：Receive signal to be decoded；Signal to be decoded is converted into the symbol sebolic addressing to be decoded of frequency domain；Symbol sebolic addressing to be decoded is divided into the first symbol sebolic addressing and the second symbol sebolic addressing；The first distance between the first symbol sebolic addressing and the corresponding preferable preferable superposition symbol sebolic addressing in superposition symbol sebolic addressing Zhong Mei roads is calculated, path corresponding with small distance is obtained according to the first distance；Sequence Detection is carried out according to path corresponding with small distance one by one to each symbol in the second symbol sebolic addressing, the second distance between each symbol and corresponding ideal symbol sequence Zhong Mei roads ideal symbol sequence in the second symbol sebolic addressing is calculated, obtains corresponding to the ideal symbol sequence of minimum range according to the second distance after to last symbol Sequence Detection；Will be corresponding to the ideal symbol sequence of minimum range as output symbol sequence.The present invention under equal conditions can reach decoding success rate higher.
Description
Technical field
The present invention relates to the signal interpretation in wireless communication system, more particularly, to a kind of for OvFDM's
Interpretation method, device and its system.
Background technology
For wireless communication system, for OvFDM systems, the ideal expectation target of people is letter
Number transmission undistorted in the channel, and receiving terminal can efficiently quick and complete correct decoding effectively believed
Breath.In real system, because real channel circumstance is complex, the transmitting procedure of signal typically can all make part
Information distortion, wants decoding completely and obtains effective information, and transmitting terminal and receiving terminal need to use larger transimission power
With S/N ratio transmission signal, could be correct by information decoding in receiving terminal.But transimission power can not be without bottom line
Raise always, it is therefore desirable to find a kind of efficiently correct interpretation method.
In the prior art when Sequence Detection is carried out, what is be used mostly is all to select optimal path by Hamming distance,
And Hamming distance needs first carry out hard decision process and are converted to { 0,1 } sequence to reception data, judgement is then compared again
True Data afterwards and the same number of ideal data, sequence only have 0 and 1, the Chinese of two paths of data in real system
Prescribed distance identical probability is higher, and data after hard decision have certain error, it is difficult to accurately select one most
Good path, reduces the decoding success rate of system.
The content of the invention
The technical problems to be solved by the invention are to provide a kind of interpretation method, device and its system, in equal bar
Decoding success rate higher is can reach under part.
Therefore, the invention provides a kind of interpretation method and device, and the system containing the device.
The interpretation method that the present invention is provided, for OvFDM systems, including：
Receive signal to be decoded；Signal to be decoded is converted into the symbol sebolic addressing to be decoded of frequency domain, it is described to be decoded
Symbol sebolic addressing includes N number of symbol；The symbol sebolic addressing described to be decoded that will be received is divided into the first symbol sebolic addressing (1：
) and the second symbol sebolic addressing (K+1 K：N)；Calculate first symbol sebolic addressing (1：K) with corresponding 2KRoad
The first distance between the preferable superposition symbol sebolic addressing in ideal superposition symbol sebolic addressing Zhong Mei roads, according to first distance
Obtain and 2k-1The corresponding path of individual small distance；According to described with 2k-1The corresponding path of individual small distance is to described
Second symbol sebolic addressing (K+1：N each symbol in) carries out Sequence Detection one by one, calculate each symbol with it is corresponding
2KSecond distance between the ideal symbol sequence of road ideal symbol sequence Zhong Mei roads, to last symbol
Obtain corresponding to the ideal symbol sequence of minimum range after Sequence Detection according to the second distance；Correspond to described
The ideal symbol sequence of minimum range is used as output symbol sequence.
According to an aspect of the present invention, first distance and the second distance are measure distance., estimate
Distance definition is0 ＜ p ＜ ∞.
According to an aspect of the present invention, the first symbol sebolic addressing (1 of the calculating：K) with corresponding 2KRoad is preferable folded
The first distance between the preferable superposition symbol sebolic addressing in sequence of putting in marks Zhong Mei roads includes：According to the first symbol sequence
The number K of symbol is generated corresponding to K the 2 of symbol included in rowKIt is individual to be possible to send symbol sebolic addressing；
According to described 2KIndividual first symbol for being possible to send symbol sebolic addressing is possible to send symbol sequence by described
Row are divided into Part I and Part II, and wherein each part includes 2k-1Road may send sequence；Will be described all
Every road symbol that symbol sebolic addressing may be sent adds up step by step backward, obtains the preferable superposition symbol sebolic addressing on K roads；Calculate
Symbol in first symbol sebolic addressing is superimposed the distance of symbol sebolic addressing with every road ideal, obtains 2KPaths；Will
It is corresponding in the Part I and Part II to differ only in the distance that first possibility of symbol sends sequence
Make comparisons two-by-two respectively, obtain 2k-1Individual less distance is used as first distance.
According to an aspect of the present invention, described each symbol of calculating and corresponding 2KIt is every in the ideal symbol sequence of road
Second distance between the ideal symbol sequence of road includes：After K symbol superposition of generation 2KRoad ideal symbol sequence；
Determine the previous node state of current sign；State transition path is obtained according to the previous node state；According to
The state transition path obtains 2 between current sign and ideal symbolk-1Individual small distance is used as second distance.
According to an aspect of the present invention, the second distance is the distance after current sign adds up.
According to an aspect of the present invention, also including preprocessing process, the preprocessing process includes：By what is received
Signal to be decoded and the system synchronization；Channel estimation is done to the signal to be decoded for being received after this is synchronously completed, should
Channel estimation is used to estimate the parameter of actual transmission channel；And according to sampling theorem to the signal to be decoded that is received
It is digitized treatment.
The code translator that the present invention is provided, for OvFDM systems, including：
Unit for receiving signal to be decoded；Symbol sequence to be decoded for signal to be decoded to be converted into frequency domain
The unit of row, the symbol sebolic addressing to be decoded includes N number of symbol；For the symbol described to be decoded that will be received
Sequence is divided into the first symbol sebolic addressing (1：) and the second symbol sebolic addressing (K+1 K：N unit)；For calculating
State the first symbol sebolic addressing (1：K) with corresponding 2KThe preferable superposition symbol in the preferable superposition symbol sebolic addressing Zhong Mei roads in road
The first distance between sequence, obtains and 2 according to first distancek-1The list in the corresponding path of individual small distance
Unit；For according to described with 2k-1The corresponding path of individual small distance is to the second symbol sebolic addressing (K+1：N)
In each symbol carry out Sequence Detection one by one, calculate each symbol and corresponding 2 in the second symbol sebolic addressingKLu Li
The second distance between the ideal symbol sequence of symbol sebolic addressing Zhong Mei roads is thought, after to last symbol Sequence Detection
Obtain corresponding to the unit of the ideal symbol sequence of minimum range according to the second distance；For corresponding to described
The ideal symbol sequence of minimum range as output symbol sequence unit.
According to an aspect of the present invention, first distance and the second distance are measure distance.
According to an aspect of the present invention, the second distance is the distance after current sign adds up.
The OvFDM systems that the present invention is provided, including code translator as described above.
The present invention has following remarkable advantage compared with prior art due to using above technical scheme：
Decoding process is divided into two parts by the present invention：(1：) and (K+1 K：N decoding).By preceding K roads
Signal is disposably processed, and new K roads ideal signal is obtained by different levels the adding up step by step to K roads signal, is used
The actual preceding K symbol for receiving symbol sebolic addressing seeks new ideal signal measure distance successively, retains 2k-1Bar is optimal
Path, actual precise path be included in certainly this 2k-1In paths, the success rate of decoding is improve.
Further, the present invention selects optimal path, measure distance to represent between two signals using measure distance
Distance, when optimal path is selected, the minimum paths of selection measure distance, can used as optimal path
Accurately to find very much the path closest to ideal signal, the decoding success rate of system is improve.
Additionally, the present invention comparison measure apart from when, if only contrast current sign and ideal symbol estimate away from
From with the increase of decoding depth, optimal path might have deviation, cause the success rate reduction of final decoding.
Because inherently K symbol of symbol additive process is overlapped, symbol forward-backward correlation is larger, therefore takes
Present measure distance judged with above cumulative measure distance sum, so can be with the increasing of decoding depth
Plus, it is more accurate to judge optimal path, improve decoding success rate.
Generally, because data length to be decoded is more long, and with the intensification of decoding depth, add up away from
From increasing, if system will again enter row decoding output, relatively consumption system resource after the completion of all data all decoding,
Therefore preferably processing method is taken for the storage of the memory capacity and distance in path.General path selection storage length
It is 4K~5K to spend, if now path memory has been filled with, decoding judgement output does not carry out also adjudicating by force
Output, the start node with same paths is first exported；With the intensification of decoding depth, accumulation distance
Can be increasing, accumulation distance can be stored as relative distance, that is, a reference distance is defined, its value is not according to
With system depending on, apart from stored record be every paths relative value of the second distance relative to reference distance,
It is compared by relative distance when the screening of optimal path is carried out.
Brief description of the drawings
It is that the above objects, features and advantages of the present invention can be become apparent, below in conjunction with accompanying drawing to this hair
Bright specific embodiment elaborates, wherein：
Fig. 1 shows the block diagram of the modulating unit of OvFDM systems.
Fig. 2 shows the block diagram of the reception detecting signal unit of OvFDM systems.
Fig. 3 shows the exemplary process diagram of the interpretation method for OvFDM systems according to embodiments of the present invention.
Fig. 4 shows that the interpretation method for OvFDM systems according to embodiments of the present invention is treating decoded signal
The flow chart of the preprocessing process before entering row decoding.
Fig. 5 shows symbol additive process exemplary plot according to embodiments of the present invention.
Fig. 6 shows preceding K row symbol arrangement and symbol superposition exemplary plot according to embodiments of the present invention.
Fig. 7 shows node state transfer figure according to embodiments of the present invention.
Fig. 8 shows the Input output Relationship tree graph of OvFDM systems according to embodiments of the present invention.
Fig. 9 shows K=3OvFDM Trellis figures according to embodiments of the present invention.
Figure 10 shows symbol sequence detection path profile according to embodiments of the present invention.
Specific embodiment
With reference to specific embodiments and the drawings, the invention will be further described, elaborates in the following description more
Many details are in order to fully understand the present invention, but the present invention obviously can be with various other described different from this
Mode is implemented, and those skilled in the art can be in the case of without prejudice to intension of the present invention according to practical situations
Make similar popularization, deduce, therefore should not be limited the scope of the invention with the content of this specific embodiment.
Fig. 1 shows the block diagram of the transmission signal generating process of OvFDM systems.In OvFDM systems,
Transmitting terminal is first encoded frequency-region signal according to certain rule, and frequency-region signal then is converted into time-domain signal
Fourier inverse transformation is carried out, afterwards just signal is sent.
Fig. 2 shows the block diagram of the reception detecting signal unit of OvFDM systems.Receiving terminal is received by antenna
To signal be the signal of time domain, if to dock receipts signal interpretation, it is necessary first to which time-domain signal is converted into frequency domain
Signal, that is, carry out to be processed after Fourier transform.Fourier inverse transformation and Fourier transform in OvFDM are directed to
The setting of sampling number, both sampling numbers should be consistent, and value is 2n。
Fig. 3 shows the exemplary process diagram of the interpretation method for OvFDM systems according to embodiments of the present invention.
The interpretation method 300 includes：Step 302, receives signal to be decoded；Step 304, by signal to be decoded conversion
Into the symbol sebolic addressing to be decoded of frequency domain, the symbol sebolic addressing to be decoded includes N number of symbol；Step 306, will receive
To symbol sebolic addressing described to be decoded be divided into the first symbol sebolic addressing (1：) and the second symbol sebolic addressing (K+1 K：N),
Wherein K is the number of times of overlapping multiplexing；Step 308, calculates first symbol sebolic addressing (1：K) with corresponding 2K
The first distance between the preferable superposition symbol sebolic addressing in the preferable superposition symbol sebolic addressing Zhong Mei roads in road, according to described first away from
From obtaining and 2k-1The corresponding path of individual small distance；Step 310, according to described with 2k-1Individual small distance is corresponding
Path is to the second symbol sebolic addressing (K+1：N each symbol in) carries out Sequence Detection one by one, calculates each
Symbol and corresponding 2KSecond distance between the ideal symbol sequence of road ideal symbol sequence Zhong Mei roads, to most
Obtain corresponding to the ideal symbol sequence of minimum range after latter symbol sequence detection according to the second distance；Step
Rapid 312, using the ideal symbol sequence corresponding to minimum range as output symbol sequence.
In one embodiment, first distance and the second distance are measure distance.
In one embodiment, it is described to calculate first symbol sebolic addressing (1：K) with corresponding 2KThe preferable superposition in road
The first distance between the preferable superposition symbol sebolic addressing in symbol sebolic addressing Zhong Mei roads includes：According to first symbol sebolic addressing
Included in the number K of symbol generate corresponding to K the 2 of symbolKIt is individual to be possible to send symbol sebolic addressing；Root
According to described 2KIndividual first symbol for being possible to send symbol sebolic addressing is possible to send symbol sebolic addressing by described
It is divided into Part I and Part II, wherein each part includes 2k-1Road may send sequence；By it is described it is all can
Every road symbol that symbol sebolic addressing can be sent adds up step by step backward, obtains the preferable superposition symbol sebolic addressing on K roads；Calculate
Symbol in first symbol sebolic addressing is superimposed the distance of symbol sebolic addressing with every road ideal, obtains 2KPaths；Will
It is corresponding in the Part I and Part II to differ only in the distance that first possibility of symbol sends sequence
Make comparisons two-by-two respectively, obtain 2k-1Individual less distance is used as first distance.
In one embodiment, described each symbol of calculating and corresponding 2KRoad ideal symbol sequence Zhong Mei roads are preferable
Second distance between symbol sebolic addressing includes：After K symbol superposition of generation 2KRoad ideal symbol sequence；It is determined that
The previous node state of current sign；State transition path is obtained according to the previous node state；According to described
State transition path obtains 2 between current sign and ideal symbolk-1Individual small distance is used as second distance.
In one embodiment, the second distance is the distance after current sign adds up.
To yi(1:K) symbol substitution
K roads symbol is expressed as：Arrangement is combined to K symbol, 2 are hadKPlanting can
Can combined information, combining form isIt is represented by msg (2K*K).For matrix msg,
Upper and lower two parts msg can be divided intosub1、msgsub2, 2 are included per partk-1OK, size is
msgsub1(2K-1*K)、msgsub2(2K-1* K), the difference per part is only first difference of symbol ± 1, behind
The k-1 permutation and combination of two parts up and down of symbol is.First symbol can be distinguished by packet up and down
It is+1 branch road or -1 branch road.
Every road symbol accumulated result step by step backward is recorded successively, is obtained each road and is preferably superimposed symbol combination,
Matrix M (2 can be expressed asK* K), i.e., 2KRow K is arranged, and matrix is expressed as：The first possibility arrangement for being classified as first via symbol, before second is classified as
The possibility arrangement of two-way symbol superposition, the 3rd is classified as the possibility arrangement of first three road symbol superposition, the like, K
It is classified as the possibility arrangement of whole K roads symbol superposition.For matrix M, upper and lower two parts can be divided into
Msub1、Msub2, it is+1 or -1 for distinguishing the new symbol come in.2 are included per partk-1OK, size is
Msub1(2K-1*K)、Msub2(2K-1*K)。
To the symbol sebolic addressing y to be decoded for receivingi(i=1~N), takes preceding K symbol y (1:K), this K is used respectively
Individual symbol asks measure distance, measure distance to be represented by with the often row in matrix M successively：0 ＜ p ＜ ∞, wherein as p=2, as Euclidean distance, Euclidean distance be two signals it
Between actual distance, can really react the distance between actual signal and ideal signal, correspondence can be represented
For：(being meant that the actual distance between two vectors), altogether 2KIndividual path, due to
Matrix Msub1、Msub2Difference be only first difference of symbol, therefore when optimal path is sought to K roads symbol,
Only retain 2 every timek-1Individual possible path.
Comparison procedure is y (1:K) respectively with Msub1、Msub2The first row seek measure distance, find the two distances
Middle minimum all the way, and records the measure distance d of this paths1Symbol sebolic addressing path corresponding with msg
path1, abandon an other paths；Then again respectively with Msub1、Msub2The second row seek measure distance, retain
One optimal path, records the measure distance d of this paths2Symbol sebolic addressing path corresponding with msg
path2, abandon an other paths；The like, until the 2ndk-1OK.
2 are most obtained at lastk-1Bar optimal path, their measure distance is designated as di, i=1~2K-1, it is expressed asSymbol sebolic addressing path is designated as pathi, i=1~2K-1, it is expressed as：
Due to only having parsed preceding K symbol, therefore now the path depth per paths is K.
To yi(K+1:N) symbol substitution
To y (1:K the decoding to preceding K symbol) is completed in symbol substitution, and has finally given 2k-1Bar is optimal
Path pathiAnd its corresponding cumulative measure distance di.From after the symbol of K roads, each symbol is K kinds symbol
Possible outcome after number superposition, therefore to (K+1：N) individual symbol carries out Sequence Detection one by one, and N-K is carried out altogether
Secondary sequence detection process.The step of Sequence Detection, includes as follows：
Possible state after the symbol superposition of generation K roads is ideal symbol Stheory(i), i=1~2K, altogether 2kKind.It is folded
Plus rear corresponding representation isIf representing the output level after superposition, K with ± 1
After the symbol superposition of road, it is only possible to, comprising K+1 kind symbol level, be followed successively by:±K、±(K-2)、...、±(K-2i),
I=1~K/2, is designated as Ytheory(index), index=1~K+1.
Judge current sign yiThe previous node state of (i=k+1~N).To y (1:K) obtained in symbol substitution
2k-1Individual pathi, that is, have 2k-1The state of kind.Symbol additive process is new symbol due to first symbol, remaining
K-1 symbols are the sign conditions of a upper node, therefore use path (i- (K-1)：I-1) with 2k-1Plant possible state ratio
Compared with determining previous node state.
Determine node state transfer path.Each node by that can generate 2 kinds of new states again after state transfer
(input+1/-1), i.e., 2k-1The state of kind after node transfer by becoming 2KThe state of kind.
Determine current sign y and ideal symbol StheoryThe measure distance of (i)：
As p=2, as Euclidean distance, Euclidean distance is the actual distance between two signals, can be true
Reaction actual signal and the distance between ideal signal, corresponding expression formula is：
In one embodiment, if multiplexing waveform is square wave, directly can be with Ytheory(index) measure distance is sought.
Calculate cumulative measure distance.Cumulative measure distance expression formula is designated as：
Wherein Dm,nRepresent current sign
Measure distance after cumulative, m represents index of the current sign in whole reception symbol sebolic addressing, and n represents cumulative
The index (altogether 2 of symbolKKind), diCumulative measure distance (altogether 2 after being screened before representing present nodek-1
Kind).The corresponding d of the K+1 symbol in actual treatmentiValue is above-mentioned to y (1:K) the survey in symbol substitution
Degree is apart from di；The d of K+2 symbolsiValue is changed into D(k+1)；The rest may be inferred, the d of n-th symboliValue is changed into D(N-1)。
dcurrentValue be always the measure distance of current sign and ideal symbol.
Selection optimal path.By after above-mentioned treatment, obtaining 2KPlant measure distance Dm,nWith path pathi, due to
This 2KIt is input+1 or input -1 that plant path can substantially be divided into 2 parts, i.e. previous state.Therefore by 2KIndividual road
Footpath is divided into two parts, and 2 are included per partk-1Paths.Often row measure distance corresponding to each section is carried out two-by-two
Compare, i.e., Part I the first row compares with Part II the first row, the row of Part I second and Part II second
Row compares, and by that analogy, obtains the Minimizing measure distance of every row, records the corresponding cumulative measure distance of this row
Dm,n, and be labeled as new measure distance d, while retain corresponding symbol path path, to current sign according to
Transfer path input+1 or input -1, and add 1 by the depth of corresponding path, thus get back 2k-1It is individual to estimate
Distance and its corresponding 2k-1Individual symbol path path.
According to above-mentioned steps successively to the Symbol processing of K+1~N, when having processed last symbol yNWhen,
Obtain 2k-1Individual measure distance d and its corresponding 2k-1Individual symbol path path, now the depth of path is N.It is right
2k-1Individual measure distance carries out sequence from small to large, finds out the minimum measure distance of accumulation distance, obtains its correspondence
Index, according to its index, take out path manipulative indexings decoding symbol sebolic addressing, as final decoding result.
Sequence after note decoding is Sdecoder(i), i=1~N, contrast coding sequence Sdecoder(i) and list entries xi, Ke Yijian
Whether correct decoding result is tested, while the bit error rate of computing system.
Reference picture 4, the interpretation method for OvFDM systems according to embodiments of the present invention is treating decoded signal
Preprocessing process 400 is may also include before entering row decoding, the preprocessing process 400 includes：402, will be connect
The signal to be decoded received and the OvFDM system synchronizations；And carry out numeral in 404 signals to be decoded for being received
Change is processed.
Decoding process is divided into two parts by the present invention for the interpretation method of OvFDM systems：(1：) and (K+1 K：
N decoding).Preceding K roads signal is disposably processed, obtains new by different levels the adding up step by step to K roads signal
K roads ideal signal, survey is asked successively to new ideal signal using the actual preceding K symbol for receiving symbol sebolic addressing
Degree distance, retains 2k-1Bar optimal path, actual precise path be included in certainly this 2k-1In paths, improve
The success rate of decoding.But for truncated system, its preceding K-1 symbol is known, i.e., in communication process,
Preceding K-1 roads symbol receiving-transmitting sides know mutually and reach an agreement consistent, it is not necessary to which Dui Qian K-1 roads symbol is translated
Code, the sequence of the decoding i.e. y by K roadsi(K:N), the symbol sebolic addressing number for detection being needed altogether is N-K+1；
Using the system blocked, decoding efficiency can not only be improved, the complexity of system design can also be reduced.
Optimal path, measure distance is selected to represent the distance between two signals using measure distance, in selection
During optimal path, the minimum paths of selection measure distance can accurately find very much as optimal path
Closest to the path of ideal signal, the decoding success rate of system is improve.
Comparison measure apart from when, if the only measure distance of contrast current sign and ideal symbol, with decoding
The increase of depth, optimal path might have deviation, cause the success rate reduction of final decoding.Due to symbol superposition
Inherently K symbol of process is overlapped, and symbol forward-backward correlation is larger, therefore takes present measure distance
Judged with above cumulative measure distance sum, so can more accurately be sentenced with the increase of decoding depth
Disconnected optimal path, improves decoding success rate.
In a specific embodiment of the invention, coding and decoding process is illustrated with square wave as multiplexing waveform.Set and overlap
Multiplexing number K=3, as shown in figure 5, list entries xi={+1+1-1+1-1+1+1+1-1+1 }, by compiling
Output sequence is s (t)={+1+2+1+1-1+1+1+3+1+1 } after code.Encode as can see from Figure 5 defeated
The first two symbol for going out is not the stack result of 3 road signals.
Signal after coding is transmitted by actual channel, and the symbol sebolic addressing to be decoded received in receiving terminal has partially
Difference, is designated as yi, i=1~10.The symbol sebolic addressing received in the present embodiment is yi=-0.0123,1.0439,0.369,
0.6781, -0.5921,1.0252,0.2574,2.0371,0.8769,0.9036 }, by measure distanceP values in 0 ＜ p ＜ ∞ are 2, that is, correspond to Euclidean distance, and decoding step is illustrated as a example by it
Suddenly：
Row decoding is entered to preceding 3 symbols first.As shown in Figure 6,8 kinds of permutation and combination are had, one is constituted
The matrix of 8*3.To being added up step by step backward per symbol all the way, the matrix of 8*3 sizes is formed.By matrix point
It is two parts Msub1、Msub2, Msub1And Msub2Be distinguished as：Msub1First symbol is 1, Msub2First
Symbol is -1；Alternatively, Msub1First symbol is -1, Msub2First symbol is 1.
Use yiFirst three symbol respectively with the first row and fifth line of matrix M, the second row and the 6th row ... the 4th
Row and the 8th row carry out Euclidean distance two-by-two and compare size, have obtained fifth line, the second row, the third line, fourth line
Euclidean distance, d1, d2, d3, d4 are designated as respectively.The corresponding path path of every a line is recorded simultaneously, i.e.,
It is the fifth line of msg, the second row, the third line and fourth line.Therefore by the decoding to preceding 3 symbols, obtain
4 possible paths, its corresponding symbol sebolic addressing is path1：(- 11 1), path2：(1 1-1), path3：
(1-1 1), path4：(1 -1 -1).
Then row decoding is entered to 4~10 symbols.During K=3, there are tetra- kinds of states of a, b, c, d, correspondence symbol is
(1,1), (1, -1), (- 1,1), (- 1, -1), every time by most latter two symbol in path sequences and this
Four states are compared, and determine previous node state, transfer path reference mode state transition diagram.According to Fig. 7
Node state transfer figure, it is known that path1Corresponding node a, path2Corresponding node b, path3Corresponding node c, path4
Corresponding node d.Input/output relation figure during K=3 from figure as shown in figure 8, see that node a, for (1,1), is saved
Point b is (1, -1), and node c is (- 1,1), and node d is (- 1, -1).
As K=3, possible symbol level is ± 3, ± 1 totally four kinds after superposition.That is Ytheory(1)=- 3,
Ytheory(2)=- 1, Ytheory(3)=1, Ytheory(4)=3.Corresponding ideal symbol representation is respectively：
Use the 4th symbol y4Respectively Euclidean distance is sought with these four level：
When path nodes are a, input+1 obtains+3, as a->The node transfer of a, y4Obtained with+3
Euclidean distance is designated as dcurrent(1)；Input -1 obtains+1, as a->The node transfer of b, y4The Europe obtained with+1
Family name's distance is designated as dcurrent(2)。
When path nodes are b, input+1 obtains+1, as b->The node transfer of c, y4Obtained with+1
Euclidean distance is designated as dcurrent(3)；Input -1 obtains -1, as b->The node transfer of d, y4The Euclidean obtained with -1
Distance is designated as dcurrent(4)。
When path nodes are c, input+1 obtains+1, as c->The node transfer of a, y4Obtained with+1
Euclidean distance is designated as dcurrent(5)；Input -1 obtains -1, as c->The node transfer of b, y4The Euclidean obtained with -1
Distance is designated as dcurrent(6)。
When path nodes are d, input+1 obtains -1, as d->The node transfer of c, y4The Europe obtained with -1
Family name's distance is designated as dcurrent(7)；Input -1 obtains -3, as d->The node transfer of d, y4The Euclidean obtained with -3
Distance is designated as dcurrent(8)。
By the Euclidean distance d of current signcurrentEuclidean distance d corresponding with preceding 3 symbolsiIt is separately summed and is tired out
Plus distance, i.e. D4,1=d1+dcurrent(1)、D4,2=d1+dcurrent(2)；D4,3=d2+dcurrent(3)、
D4,4=d2+dcurrent(4)；D4,5=d3+dcurrent(5)、D4,6=d3+dcurrent(6)；D4,7=d4+dcurrent(7)、
D4,8=d4+dcurrent(8)。
Seek optimal path.
Compare D4,1With D4,5Euclidean distance size obtain D4,5Euclidean distance is smaller, writes down smaller Euclidean distance D4,5
And it is labeled as new d1.Due to D4,5Cumulative Euclidean distance d before middle present node3Corresponding path is path3Sequence
Row, therefore by path3It is 4 that depth is increased by 3, and the 4th symbol is designated as+1, obtains new symbol path sequence
It is (1-1 1 1), is designated as new path1。
Compare D4,2With D4,6Euclidean distance size obtain D4,2Euclidean distance is smaller, writes down smaller Euclidean distance D4,2
And it is labeled as new d2.Due to D4,2Cumulative Euclidean distance d before middle present node1Corresponding path is path1Sequence
Row, therefore by path1It is 4 that depth is increased by 3, and the 4th symbol is designated as -1, obtains new symbol path sequence
It is (- 11 1-1), is designated as new path2。
Compare D4,3With D4,7Euclidean distance size obtain D4,3Euclidean distance is smaller, writes down smaller Euclidean distance D4,3
And it is labeled as new d3.Due to D4,3Cumulative Euclidean distance d before middle present node2Corresponding path is path2
Sequence, therefore by path2It is 4 that depth is increased by 3, and the 4th symbol is designated as+1, obtains new symbol path sequence
(1 1-1 1) are classified as, new path is designated as3。
Compare D4,4With D4,8Euclidean distance size obtain D4,4Euclidean distance is smaller, writes down smaller Euclidean distance D4,4
And it is labeled as new d4.Due to D4,4Cumulative Euclidean distance d before middle present node2Corresponding path is path2
Sequence, therefore by path2It is 4 that depth is increased by 3, and the 4th symbol is designated as -1, obtains new symbol path sequence
(1 1-1-1) is classified as, new path is designated as4。
To sum up, obtaining new possible optimal path is, path1：(1-1 1 1), path2：(- 11 1-1),
path3：(1 1-1 1), path4：(1 1 -1 -1).
Complete the decoding of all symbols.Same carries out Sequence Detection, reference according to above method to 5~10 symbols
The K=3Trellis figures of Fig. 9, the detection process for obtaining symbol is as shown in Figure 10.The symbol sebolic addressing for finally giving according to
It is secondary to be：path1：(1 1-1 1-1 1111 1), path2：(1 1-1 1-1 111 1-1), path3:
(1 1-1 1-1 11 1-1 1), path4：(1 1-1 1-1 11 1-1-1), contrast path1、path2、
path3And path4Can find, with the intensification of decoding depth, in path memory start node identical path by
Gradually unify, therefore identical path in path can first be exported during decoding, to save memory space.
Its corresponding Euclidean distance is followed successively by d1=3.5071, d2=3.0049, d3=2.4493, d4=
3.6040, size is compared to this four distances, obtain d3Euclidean distance it is minimum, then corresponding selection path3For defeated
Go out symbol sebolic addressing.
The symbol sebolic addressing for exporting is Sdecode=(1 1-1 1-1 11 1-1 1), contrast the symbol sebolic addressing of input
xi={+1+1-1+1-1+1+1+1-1+1 }, both sequences are completely the same, then decode result correct.
The present invention is used for the code translator of OvFDM systems, including：Unit for receiving signal to be decoded；
Unit for signal to be decoded to be converted into the symbol sebolic addressing to be decoded of frequency domain, the symbol sebolic addressing to be decoded includes
N number of symbol；Symbol sebolic addressing described to be decoded for that will receive is divided into the first symbol sebolic addressing (1：) and K
Two symbol sebolic addressing (K+1：N unit)；For calculating first symbol sebolic addressing (1：K) with corresponding 2K
The first distance between the preferable superposition symbol sebolic addressing in the preferable superposition symbol sebolic addressing Zhong Mei roads in road, according to described first away from
From obtaining and 2k-1The unit in the corresponding path of individual small distance；For according to described with 2k-1Individual small distance correspondence
Path to the second symbol sebolic addressing (K+1：N each symbol in) carries out Sequence Detection one by one, calculates every
Individual symbol and corresponding 2KSecond distance between the ideal symbol sequence of road ideal symbol sequence Zhong Mei roads, right
Obtain corresponding to the ideal symbol sequence of minimum range after last symbol Sequence Detection according to the second distance
Unit；For using the ideal symbol sequence corresponding to minimum range as output symbol sequence unit.
In one embodiment, first distance and the second distance are measure distance.
In one embodiment, the second distance is the distance after current sign adds up.
Code translator for OvFDM systems according to embodiments of the present invention also includes being used for symbol to be decoded
The pretreatment unit that sequence is pre-processed, the pretreatment unit includes：For the signal to be decoded that will be received with
The unit of the system synchronization；And for being digitized the unit for the treatment of to the signal to be decoded for being received.
Decoding process is divided into two parts by the present invention for the code translator of OvFDM systems：(1：) and (K+1 K：
N decoding).Preceding K roads signal is disposably processed, obtains new by different levels the adding up step by step to K roads signal
K roads ideal signal, survey is asked successively to new ideal signal using the actual preceding K symbol for receiving symbol sebolic addressing
Degree distance, retains 2k-1Bar optimal path, actual precise path be included in certainly this 2k-1In paths, improve
The success rate of decoding.But for truncated system, its preceding K-1 symbol is known, i.e., in communication process,
Preceding K-1 roads symbol receiving-transmitting sides know mutually and reach an agreement consistent, it is not necessary to which Dui Qian K-1 roads symbol is translated
Code, the sequence of the decoding i.e. y by K roadsi(K:N), the symbol sebolic addressing number for detection being needed altogether is N-K+1；
Using the system blocked, decoding efficiency can not only be improved, the complexity of system design can also be reduced.
Optimal path, measure distance is selected to represent the distance between two signals using measure distance, in selection
During optimal path, the minimum paths of selection measure distance can accurately find very much as optimal path
Closest to the path of ideal signal, the decoding success rate of system is improve.
Comparison measure apart from when, if the only measure distance of contrast current sign and ideal symbol, with decoding
The increase of depth, optimal path might have deviation, cause the success rate reduction of final decoding.Due to symbol superposition
Inherently K symbol of process is overlapped, and symbol forward-backward correlation is larger, therefore takes present measure distance
Judged with above cumulative measure distance sum, so can more accurately be sentenced with the increase of decoding depth
Disconnected optimal path, improves decoding success rate.
Generally, because data length to be decoded is more long, and with the intensification of decoding depth, add up away from
From increasing, if system will again enter row decoding output, relatively consumption system resource after the completion of all data all decoding,
Therefore preferably processing method is taken for the storage of the memory capacity and distance in path.General path selection storage length
It is 4K~5K to spend, if now path memory has been filled with, decoding judgement output does not carry out also adjudicating by force
Output, the start node with same paths is first exported；With the intensification of decoding depth, accumulation distance
Can be increasing, accumulation distance can be stored as relative distance, that is, a reference distance is defined, its value is not according to
With system depending on, apart from stored record be every paths relative value of the second distance relative to reference distance,
It is compared by relative distance when the screening of optimal path is carried out.
The code translator for OvFDM systems of the above embodiment of the present invention can be combined in OvFDM systems.
Although the present invention is described with reference to current specific embodiment, common skill in the art
Art personnel it should be appreciated that the embodiment of the above is intended merely to the explanation present invention, without departing from essence of the invention
Various equivalent change or replacement can be also made in the case of god, therefore, as long as in connotation of the invention
In the range of the change, modification of above-described embodiment will all be fallen in the range of following claims.
Claims (10)
1. a kind of interpretation method, for OvFDM systems, it is characterised in that including：
Receive signal to be decoded；
The signal to be decoded is converted into the symbol sebolic addressing to be decoded of frequency domain, the symbol sebolic addressing to be decoded includes N
Individual symbol；
The symbol sebolic addressing to be decoded is divided into the first symbol sebolic addressing (1：) and the second symbol sebolic addressing (K+1 K：N)；
The K is less than N；
Calculate first symbol sebolic addressing (1：K) with corresponding 2KThe preferable superposition symbol sebolic addressing Zhong Mei roads reason in road
Want the first distance being superimposed between symbol sebolic addressing, obtained and 2 according to first distancek-1Individual small distance is corresponding
Path；
According to described with 2k-1The corresponding path of individual small distance is to the second symbol sebolic addressing (K+1：N in)
Each symbol carries out Sequence Detection one by one, calculates each symbol and corresponding 2 in the second symbol sebolic addressingKThe preferable symbol in road
Second distance between number sequence Zhong Mei roads ideal symbol sequence, the basis after to last symbol Sequence Detection
The second distance obtains corresponding to the ideal symbol sequence of minimum range；
Using the ideal symbol sequence corresponding to minimum range as output symbol sequence.
2. the method for claim 1, it is characterised in that first distance and the second distance are equal
It is measure distance.
3. the method for claim 1, it is characterised in that calculating first symbol sebolic addressing (1：
K) with corresponding 2KThe first distance bag between the preferable superposition symbol sebolic addressing in the preferable superposition symbol sebolic addressing Zhong Mei roads in road
Include：
According to included in first symbol sebolic addressing number K of symbol is generated corresponding to K the 2 of symbolKIt is individual
It is possible to send symbol sebolic addressing；
According to described 2KIndividual first symbol for being possible to send symbol sebolic addressing is possible to send symbol by described
Number sequence is divided into Part I and Part II, and wherein each part includes 2k-1Road may send sequence；
The every road symbol for being possible to send symbol sebolic addressing is added up step by step backward, the ideal for obtaining K roads is folded
Put in marks sequence；
The distance that the symbol in first symbol sebolic addressing is superimposed symbol sebolic addressing with every road ideal is calculated, 2 are obtainedKBar
Path；
First possibility transmission sequence of symbol is differed only in by corresponding in the Part I and Part II
Distance make comparisons two-by-two respectively, obtain 2k-1Individual less distance is used as first distance.
4. the method for claim 1, it is characterised in that each symbol of the calculating and corresponding 2KRoad
Second distance between the ideal symbol sequence of ideal symbol sequence Zhong Mei roads includes：
After K symbol superposition of generation 2KRoad ideal symbol sequence；
Determine the previous node state of current sign；
State transition path is obtained according to the previous node state；
2 between current sign and ideal symbol are obtained according to the state transition pathk-1Individual small distance conduct
Second distance.
5. the method for claim 1, it is characterised in that the second distance adds up it for current sign
Distance afterwards.
6. the method for claim 1, it is characterised in that also including preprocessing process, this is pretreated
Journey includes：The signal to be decoded that will be received and the OvFDM system synchronizations；And the letter to be decoded to being received
Number it is digitized treatment.
7. a kind of code translator, for OvFDM systems, it is characterised in that including：
Unit for receiving signal to be decoded；
Unit for the signal to be decoded to be converted into the symbol sebolic addressing to be decoded of frequency domain, the symbol to be decoded
Number sequence includes N number of symbol；
It is divided into the first symbol sebolic addressing (1 for the symbol sebolic addressing to be decoded：) and the second symbol sebolic addressing (K+1 K：
N unit)；The K is less than N；
For calculating first symbol sebolic addressing (1：K) with corresponding 2KIt is every in the preferable superposition symbol sebolic addressing in road
The first distance between the preferable superposition symbol sebolic addressing in road, obtains and 2 according to first distancek-1Individual small distance pair
The unit in the path answered；
For according to described with 2k-1The corresponding path of individual small distance is to the second symbol sebolic addressing (K+1：N)
In each symbol carry out Sequence Detection one by one, calculate each symbol and corresponding 2 in the second symbol sebolic addressingKLu Li
The second distance between the ideal symbol sequence of symbol sebolic addressing Zhong Mei roads is thought, after to last symbol Sequence Detection
Obtain corresponding to the unit of the ideal symbol sequence of minimum range according to the second distance；
For using the ideal symbol sequence corresponding to minimum range as output symbol sequence unit.
8. code translator as claimed in claim 7, it is characterised in that first distance and described second away from
From being measure distance.
9. code translator as claimed in claim 7, it is characterised in that the second distance is tired for current sign
In addition the distance after.
10. a kind of OvFDM systems, it is characterised in that including translating as claimed in any one of claims 7-9
Code device.
Priority Applications (6)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510970271.4A CN106911424A (en) | 2015-12-22 | 2015-12-22 | Interpretation method, device and its system |
| KR1020187020183A KR102157757B1 (en) | 2015-12-22 | 2016-12-22 | Decoding method, device and system accordingly |
| JP2018552106A JP6618027B2 (en) | 2015-12-22 | 2016-12-22 | Decoding method, apparatus and system |
| EP16877747.2A EP3396882A4 (en) | 2015-12-22 | 2016-12-22 | Decoding method and apparatus, and system therefor |
| PCT/CN2016/111404 WO2017107937A1 (en) | 2015-12-22 | 2016-12-22 | Decoding method and apparatus, and system therefor |
| US16/014,413 US10419261B2 (en) | 2015-12-22 | 2018-06-21 | Decoding method and apparatus, and system therefor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510970271.4A CN106911424A (en) | 2015-12-22 | 2015-12-22 | Interpretation method, device and its system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106911424A true CN106911424A (en) | 2017-06-30 |
Family
ID=59199299
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510970271.4A Pending CN106911424A (en) | 2015-12-22 | 2015-12-22 | Interpretation method, device and its system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106911424A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190229838A1 (en) * | 2016-07-22 | 2019-07-25 | Shenzhen Super Data Link Technology Ltd. | Fast decoding method and device suitable for ovxdm system, and ovxdm system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1933335A (en) * | 2006-07-28 | 2007-03-21 | 华为技术有限公司 | Decoding method and decoding device |
| WO2008019529A1 (en) * | 2006-08-09 | 2008-02-21 | Daoben Li | A method and system for frequency division multiplexing |
| CN101431393A (en) * | 2007-11-05 | 2009-05-13 | 中国移动通信集团公司 | Overlapping multiplexing transmission method, base station and user terminal |
-
2015
- 2015-12-22 CN CN201510970271.4A patent/CN106911424A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1933335A (en) * | 2006-07-28 | 2007-03-21 | 华为技术有限公司 | Decoding method and decoding device |
| WO2008019529A1 (en) * | 2006-08-09 | 2008-02-21 | Daoben Li | A method and system for frequency division multiplexing |
| CN101431393A (en) * | 2007-11-05 | 2009-05-13 | 中国移动通信集团公司 | Overlapping multiplexing transmission method, base station and user terminal |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190229838A1 (en) * | 2016-07-22 | 2019-07-25 | Shenzhen Super Data Link Technology Ltd. | Fast decoding method and device suitable for ovxdm system, and ovxdm system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200177418A1 (en) | Data transmission network configuration | |
| CN101010922A (en) | Method and apparatus for calculating log-likelihood ratio for decoding in a receiver for a mobile communication system | |
| CN100521664C (en) | Method and apparatus for noise whitening filtering | |
| CN102694625A (en) | Polarization code decoding method for cyclic redundancy check assistance | |
| JP2001522197A (en) | Composite equalization and detection method for multi-user signals | |
| CN106899376B (en) | Non-coherent detection method for physical layer network coding continuous phase modulation signal | |
| KR20190138674A (en) | Transmitter and Receiver and Their Methods | |
| CN106911421A (en) | Interpretation method, device and its system | |
| CN106911424A (en) | Interpretation method, device and its system | |
| CN110166383A (en) | One kind being based on tree-shaped random search pilot design method | |
| JP2014216871A (en) | Signal processing device, signal processing method and signal processing program | |
| CN116488978B (en) | Frame synchronization method suitable for BR Bluetooth in test environment | |
| CN116338598B (en) | Anti-interference intelligent decision method for radar based on backtracking DQN | |
| US10419261B2 (en) | Decoding method and apparatus, and system therefor | |
| CN109067494B (en) | A kind of UAT data-link time synchronization method and device about CPFSK Modulation Types | |
| US20190229838A1 (en) | Fast decoding method and device suitable for ovxdm system, and ovxdm system | |
| CN106911423A (en) | Interpretation method, device and its system | |
| CN101534267A (en) | Pre-coding method and pre-coding device | |
| CN106911422A (en) | Interpretation method, device and its system | |
| CN112821895A (en) | Code identification method for realizing high error rate of signal | |
| EP2486711B1 (en) | Method and apparatus for equalization of received signals | |
| US8036258B2 (en) | Method and system for increasing transmission speed of wired or wireless signals while minimizing the bit error rate | |
| KR20100023469A (en) | Apparatus and method for generating pseudo noise code | |
| KR101483568B1 (en) | Low-complexity Cost Function Calculation for Multiple-input Multiple-output systems | |
| WO2018019109A1 (en) | Decoding method, device and system based on overlapped multiplexing |
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 |
Effective date of registration: 20190812 Address after: 518057 2nd Floor, No. 9 Software Building, Zhongxin Road, Yuehai Street, Nanshan District, Shenzhen City, Guangdong Province Applicant after: Shenzhen Guangqi Hezhong Technology Co., 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 CHAOJI DATA CHAIN TECHNOLOGY CO., LTD. |
|
| TA01 | Transfer of patent application right | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170630 |
|
| RJ01 | Rejection of invention patent application after publication |