CN101938688A - Time offset calculation method and device in distance measurement - Google Patents
Time offset calculation method and device in distance measurement Download PDFInfo
- Publication number
- CN101938688A CN101938688A CN2009101500738A CN200910150073A CN101938688A CN 101938688 A CN101938688 A CN 101938688A CN 2009101500738 A CN2009101500738 A CN 2009101500738A CN 200910150073 A CN200910150073 A CN 200910150073A CN 101938688 A CN101938688 A CN 101938688A
- Authority
- CN
- China
- Prior art keywords
- peak
- ranging code
- data sequence
- time
- predetermined threshold
- 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
Images
Landscapes
- Radar Systems Or Details Thereof (AREA)
Abstract
The invention discloses a time offset calculation method and a device in distance measurement, relating to the field of communication. The method comprises the steps of sequentially extracting a data sequence of one time domain symbol from received ranging codes, and respectively attaining data sequences corresponding to the extracted data sequence from available local ranging codes; performing cross-correlation and frequency domain spreading transformation on the data sequence extracted from the received ranging codes and the data sequence attained from the local ranging codes; and finding the corresponding phase of the highest peak value exceeding a preset threshold in the transformation result, and calculating time offset corresponding to the highest peak value in each operation. The embodiment of the invention is mainly applied in the time offset adjustment in the distance measurement process of a terminal in inceptive access.
Description
Technical field
The present invention relates to the communications field, inclined to one side computational methods and device when relating in particular in the ranging process.
Background technology
Ranging (range finding) is one and finishes the process that correct time biasing, frequency shift (FS) and power are adjusted, the signal that is used to make user side to send drops in the official hour of base station so that whole cell data synchronous transmission, and arrives the base station with suitable power.
At existing WIMAX TDD (World Interoperability for Microwave AccessTime Division Duplex, the World Interoperability for Microwave Access, WiMax TDD mode) during the range finding of system, the ranging code that terminal sends in sub-frame of uplink all is arranged on the time-domain symbol, promptly described ranging code is sent on a time-domain symbol by a plurality of subchannels, whether and the base station need have identical ranging frame structure with the ranging code of described transmission, just can detect ranging code and arrive.When the base station overlength distance covers, in Initial R anging process, the base station can not be real-time detect the described ranging code that terminal sends, but need certain time delay, just can detect the described ranging code that terminal sends, thereby make the detection resource of detection resource during that detects described ranging code just greater than common covering.More and more far away along with base station coverage distance, the time delay that detects described ranging code is more and more longer, makes the detection resource of reservation big more, has caused the waste of base station resource.
The inventor finds, in the prior art ranging process the time inclined to one side computational methods owing to only support the frame structure of ranging code on time domain, to constitute this situation by a time-domain symbol, cause range of application to be subjected to unnecessary restriction.
Summary of the invention
Inclined to one side computational methods and device when embodiments of the invention provide in a kind of ranging process can be realized calculating inclined to one side when ranging code at different ranging frame structures is in ranging process.
For achieving the above object, embodiments of the invention adopt following technical scheme:
Inclined to one side computational methods in the time of in a kind of ranging process comprise:
From the ranging code that receives, take out a data sequence that time-domain symbol comprised in turn at every turn, and from available local ranging code, obtain respectively with the corresponding data sequence of the data sequence of taking out;
Described data sequence of taking out from the ranging code that receives is carried out computing cross-correlation and frequency domain expansion conversion with the described data sequence of obtaining respectively from local ranging code;
Search in the transformation results phase place of the peak-peak correspondence that surpasses predetermined threshold, and inclined to one side during according to the phase calculation of the peak-peak correspondence of each acquisition.
Inclined to one side calculation element when the embodiment of the invention also provides in a kind of ranging process comprises:
Acquiring unit is used for taking out a data sequence that time-domain symbol comprised in turn from the ranging code that receives at every turn, and from available local ranging code, obtain respectively with the corresponding data sequence of the data sequence of taking out;
The cross-correlation calculation unit is used for described data sequence of taking out from the ranging code that receives is carried out computing cross-correlation with the described data sequence of obtaining respectively from local ranging code;
Converter unit is used for the result of described computing cross-correlation is carried out the frequency domain expansion conversion;
Search the unit, be used for the data sequence of taking out from the ranging code that receives, in transformation results, search a phase place that surpasses the peak-peak correspondence of predetermined threshold at every turn;
The time inclined to one side computing unit, inclined to one side when being used for the phase calculation according to the peak-peak correspondence that finds at every turn.
After the technical scheme that the employing embodiment of the invention provides, frame structure according to the ranging code that receives, search the phase place of the peak-peak correspondence that surpasses predetermined door, if a data sequence that time-domain symbol comprised of at every turn obtaining all finds a phase place that surpasses the peak-peak correspondence of predetermined threshold, then realize calculating inclined to one side when ranging code with different frame structure is in ranging process according to described phase place from the ranging code that receives.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art, to do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is a computational methods flow chart inclined to one side in a kind of ranging process of the embodiment of the invention time;
Fig. 2 is a calculation element composition frame chart inclined to one side in a kind of ranging process of the embodiment of the invention time;
Fig. 3 is the frame structure schematic diagram of a kind of ranging code of receiving in the embodiment of the invention;
Fig. 4 is a computational methods flow chart inclined to one side in the another kind of ranging process of the embodiment of the invention time;
Fig. 5 is the frame structure schematic diagram of the another kind of ranging code that receives in the embodiment of the invention;
Fig. 6 is the frame structure schematic diagram of the another kind of ranging code that receives in the embodiment of the invention;
Fig. 7 is the frame structure schematic diagram of the another kind of ranging code that receives in the embodiment of the invention;
Fig. 8 is a calculation element composition frame chart inclined to one side in the another kind of ranging process of the embodiment of the invention time.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that is obtained under the creative work prerequisite.
The embodiment of the invention provides the time inclined to one side computational methods in a kind of ranging process, and as shown in Figure 1, this method comprises:
101, from the ranging code that receives, take out a data sequence that time-domain symbol comprised in turn at every turn, and from available local ranging code, obtain respectively with the corresponding data sequence of the data sequence of taking out.
Wherein, described available local ranging code is the ranging code that modulates, and in actual applications, can select all local ranging codes or select the local ranging code of part, and above-mentioned modulator approach can be the modulator approach of bi-phase shift keying.
When local ranging code and the ranging code equal in length that receives,, in local ranging code, choose one section sequence of same position and length according to the position and the length of this time-domain symbol in the ranging code that receives.
102, described data sequence of taking out is carried out computing cross-correlation and frequency domain expansion conversion with the described data sequence of obtaining respectively from local ranging code from the ranging code that receives.
Wherein, described computing cross-correlation can be point multiplication operation or convolution algorithm; Be understandable that described computing cross-correlation is not limited to above-mentioned computing, can also comprise other computing cross-correlations of the prior art.
Wherein, described frequency domain expansion conversion can be invert fast fourier transformation or discrete Fourier transform; Be understandable that described frequency domain expansion conversion is not limited to above-mentioned conversion, can also comprise in the prior art other frequency domain expansion conversion.
103, search in the transformation results phase place of the peak-peak correspondence that surpasses predetermined threshold, and inclined to one side during according to the phase calculation of the peak-peak correspondence of each acquisition.Described predetermined threshold can be for once the value of testing, can be according to the actual conditions setting.
Wherein, if the data sequence of at every turn taking out from the ranging code that receives all finds a phase place that surpasses the peak-peak correspondence of predetermined threshold in transformation results, inclined to one side during then according to the phase calculation of each described peak-peak correspondence that obtains.Be to carry out related operation according to described peak-peak corresponding phase to obtain partially when described, be specially: described peak-peak corresponding phase is carried out related operation, the value that related operation is obtained as the time inclined to one side.Wherein, described related operation can be but be not limited to the computing of following mode, be specially: the computing of maximizing, the computing of perhaps minimizing, the computing of perhaps averaging.For example, described related operation is the computing of maximizing, is specially partially during then according to the phase calculation of each described peak-peak correspondence that obtains, and asks the maximum phase in the described peak-peak corresponding phase, with described maximum phase as the time inclined to one side.
Inclined to one side calculation element when the embodiment of the invention provides in a kind of ranging process, as shown in Figure 2, this device comprises: acquiring unit 21, cross-correlation calculation unit 22, converter unit 23, search unit 24 and the time inclined to one side computing unit 25
Acquiring unit 21 is used for taking out a data sequence that time-domain symbol comprised in turn from the ranging code that receives at every turn, and from available local ranging code, obtain respectively with the corresponding data sequence of the data sequence of taking out.
After the data sequence that a corresponding time-domain symbol comprises in data sequence that a time-domain symbol in the described ranging code that receives is comprised and described local ranging code is taken out, by cross-correlation calculation unit 22, with described data sequence of from the ranging code that receives, taking out, carry out computing cross-correlation with each described data sequence of from local ranging code, obtaining respectively, described computing cross-correlation can be point multiplication operation or convolution algorithm, be understandable that described computing cross-correlation is not limited to above-mentioned computing, can also comprise other computing cross-correlations of the prior art; And the result of computing cross-correlation is carried out the frequency domain expansion conversion by converter unit 23, described frequency domain expansion conversion can be invert fast fourier transformation or discrete Fourier transform, be understandable that described frequency domain expansion conversion is not limited to above-mentioned conversion, can also comprise in the prior art other frequency domain expansion conversion.
After the result to described computing cross-correlation carries out the frequency domain expansion conversion, for the data sequence of from the ranging code that receives, taking out at every turn, in transformation results, search a phase place that surpasses the peak-peak correspondence of predetermined threshold by the described unit 24 of searching; If all there is the described phase place that surpasses the peak-peak correspondence of predetermined threshold in the data sequence of at every turn taking out from the ranging code that receives, when then utilizing inclined to one side computing unit 25 when described to network in the ranging process according to the phase calculation terminal initial of the described described peak-peak correspondence that finds at every turn the time inclined to one side.
Wherein, when inclined to one side computing unit 25 networks according to the phase calculation terminal initial of described peak-peak correspondence when described in the ranging process the time inclined to one side, be related operation acquisition partially when described by described peak-peak corresponding phase, be specially: described peak-peak corresponding phase is carried out related operation, the value that related operation is obtained as the time inclined to one side.Wherein, described related operation can be but be not limited to the computing of following mode, be specially: the computing of maximizing, the computing of perhaps minimizing, the computing of perhaps averaging.For example, described related operation is the computing of maximizing, is specially partially during then according to the phase calculation of each described peak-peak correspondence that obtains, and asks the maximum phase in the described peak-peak corresponding phase, with described maximum phase as the time inclined to one side.
In the technical scheme that the embodiment of the invention provides, when the described ranging code that receives is made of a time-domain symbol on time domain, inclined to one side computational methods when described, if find a phase place that surpasses the peak-peak correspondence of predetermined threshold, with described phase value as the ranging code with above-mentioned frame structure in ranging process the time inclined to one side; When the described ranging code that receives is made of at least two time-domain symbol on time domain, inclined to one side computational methods when described, to a data sequence that time-domain symbol comprised of obtaining at every turn, in transformation results, search a phase place that surpasses the peak-peak correspondence of predetermined threshold, an if data sequence that time-domain symbol comprised of at every turn obtaining, all find the phase place above the peak-peak correspondence of predetermined threshold in transformation results, then the value that described a plurality of phase places of obtaining are obtained through related operation is inclined to one side in ranging process the time as the ranging code with described frame structure.
Inclined to one side computational methods when the embodiment of the invention provides in a kind of ranging process, wherein the frame structure of ranging code as shown in Figure 3, when terminal initial networks in the present embodiment in the ranging process the time calculate partially, as shown in Figure 4, this method comprises:
401, from the ranging code that receives, take out a data sequence that time-domain symbol comprised in turn at every turn.
Because the frame structure of described ranging code is made of 3 time-domain symbol on time domain, on frequency domain, constitute by 2 subchannels, a time-domain symbol comprises two Resource Block, one of them Resource Block is made of a subchannel on frequency domain, be made of a time-domain symbol on time domain, a described data sequence that Resource Block comprised depends on quantity and each subcarrier institute data carried by data of a subcarrier that subchannel comprised.The data sequence that time-domain symbol comprised comprises 2 data sequences that Resource Block comprised in the present embodiment.
The embodiment of the invention is an example with the ranging code of the 144bit that modulates through bi-phase shift keying in the WIMAX TDD system specifically, the ranging code of described 144bit is distributed in as shown in Figure 3 the frame structure, each subchannel comprises 24 subcarriers, the data of each subcarrier carrying 1bit, obtain the data sequence of the 24bit that a Resource Block comprises thus, so the data sequence that time-domain symbol comprised is the data sequence of 48bit.
The data sequence of obtaining from the described ranging code that receives that first time-domain symbol comprised is the data sequence from 1bit to 48bit; Because local ranging code is the same with the ranging code that receives, also be ranging code, so from available local ranging code, obtain corresponding data sequence, i.e. data sequence respectively from 1bit to 48bit for the 144bit that modulates through bi-phase shift keying.
402,, carry out computing cross-correlation with the described corresponding data sequence of from each available local ranging code, obtaining respectively with a described data sequence that time-domain symbol comprised of from the ranging code that receives, taking out;
To the data sequence that first time-domain symbol comprised, then with described data sequence from 1bit to 48bit of from the ranging code that receives, taking out, carry out computing cross-correlation with the data sequence of from described available local ranging code, obtaining respectively from 1bit to 48bit, the purpose of described computing cross-correlation is complementary for judging the ranging code that ranging code that current time receives and which this locality modulate, computing cross-correlation described in the present embodiment can be point multiplication operation or convolution algorithm, be understandable that described computing cross-correlation is not limited to above-mentioned computing, can also comprise other computing cross-correlations of the prior art.
403, the result that described computing cross-correlation is obtained carries out the frequency domain expansion conversion.After the data sequence of the data sequence of the preceding 48bit of the described ranging code that receives and the preceding 48bit in each available local ranging code is carried out dot product, the result that described computing cross-correlation is obtained carries out the frequency domain expansion conversion, can be the data of 1024bit or 2048bit with the data conversion of described 48bit by frequency domain expansion.
Wherein, frequency domain expansion described in the embodiment of the invention is transformed to inverse fast Fourier transform computing or discrete Fourier transform computing, be understandable that described frequency domain expansion conversion is not limited to above-mentioned conversion, can also comprise other frequency domain expansion conversion of the prior art.
404, from the result of described frequency domain expansion conversion, to search for the peak value of each transformation results, and judge the peak value that whether exists in the described peak value that searches above predetermined threshold, the peak value of described predetermined threshold can be for once the value of testing; If have the peak value that surpasses predetermined threshold, execution in step 405; Otherwise execution in step 408.
405, write down the index of the local ranging code of the peak value correspondence that surpasses predetermined threshold, and choose largest peaks above the peak value of predetermined threshold, and write down the pairing phase place Dmax1 of described peak-peak from described.
406, judge whether the data sequence that each time-domain symbol comprised in the described ranging code that receives has got, if the described data sequence that ranging code comprised that receives has all been got, then execution in step 407; Otherwise execution in step 401.
Because the embodiment of the invention to each time-domain symbol, all needs to carry out the search of peak value with the ranging code that the frame structure of the described ranging code that receives is made of 3 time-domain symbol on time domain.Wherein, second pairing described phase place of the data sequence that time-domain symbol comprised in calculating and the described ranging code that receives is specially:
From the described ranging code that receives, obtain second data sequence that time-domain symbol comprised from 49bit to 96bit; And surpass the local ranging code of the peak value correspondence of predetermined threshold the related operation from the first time according to the index of preserving, obtain data sequence respectively from 49bit to 96bit; With described data sequence from the ranging code that receives from 49bit to 96bit, carry out dot product with the described 49bit that surpasses each corresponding local ranging code of the peak value of predetermined threshold from the peak value that obtains for the first time to the data sequence of 96bit respectively, and the data after the dot product are carried out inverse fast Fourier transform, search peak as a result according to described conversion, and judge the peak value that whether exists in the peak value search above predetermined threshold, if exist to surpass the peak value of predetermined threshold, then write down the index of the local ranging code of the described peak value correspondence that surpasses predetermined threshold; And from described surpassing the peak value of predetermined threshold choosing largest peaks, and write down the pairing phase place Dmax2 of described peak-peak.If there is not peak value, be that unit moves backward with a time-domain symbol then with detection window above predetermined threshold.
Wherein, calculating specifically comprises with the 3rd the pairing described phase place of the data sequence that time-domain symbol comprised of the described ranging code that receives:
From the described ranging code that receives, obtain the 3rd the data sequence that time-domain symbol comprised from 97bit to 144bit; And the local ranging code of the index correspondence that writes down behind the related operation from the second time, obtain data sequence respectively from 97bit to 144bit; With described data sequence from the ranging code that receives from 97bit to 144bit, the data sequence from 96bit to 144bit in corresponding with the index that writes down behind the related operation second time respectively local ranging code is carried out dot product, and the data after the dot product are carried out inverse fast Fourier transform, search peak as a result according to described conversion, and judge the peak value that whether exists in the peak value search above predetermined threshold, if exist to surpass the peak value of predetermined threshold, then write down the index of the local ranging code of the described peak value correspondence that surpasses predetermined threshold; And from described surpassing the peak value of predetermined threshold choosing largest peaks, and write down the pairing phase place Dmax3 of described peak-peak.If there is not peak value, be that unit moves backward with a time-domain symbol then with detection window above predetermined threshold.
During 407, according to the described phase place Dmax1 that calculates, Dmax2 and Dmax3 computing terminal initial network entry in the ranging process the time inclined to one side.Be to obtain partially when described, be specially by the related operation of described peak-peak corresponding phase: described peak-peak corresponding phase is carried out related operation, the value that related operation is obtained as the time inclined to one side.Wherein, described related operation can be but be not limited to the computing of following mode, be specially: the computing of maximizing, the computing of perhaps minimizing, the computing of perhaps averaging.For example, described related operation is the computing of maximizing, is specially partially during then according to the phase calculation of each described peak-peak correspondence that obtains, and asks the maximum phase in the described peak-peak corresponding phase, with described maximum phase as the time inclined to one side.
408,, be that unit moves backward with described detection window with a time-domain symbol, so that inclined to one side calculating when the ranging code that receives carried out according to the quantity of base station ranging frame structure time-domain symbol and the size of detection window.Wherein, the size of described detection window is by the frame structure decision of the ranging code of needs detection; For example when the frame structure of described ranging code as shown in Figure 3, on time domain, constitute by 3 time-domain symbol, when being made of 2 subchannels on frequency domain, the length of described detection window is the length of 3 time-domain symbol, width is the width of 2 subchannels.
Time inclined to one side computational methods for the ranging code of other frame structures, identical with the time inclined to one side computational methods in the present embodiment, number of resource blocks difference that time-domain symbol comprised in the ranging code of different frame structure just, a Resource Block is made of a subchannel on frequency domain, on time domain, constitute by a time-domain symbol, and a described data sequence that Resource Block comprised is by quantity and each subcarrier institute data carried by data decision of a subcarrier that subchannel comprised, thereby make the bit number difference of the data sequence of from the ranging code that receives and local ranging code, obtaining, below specify the bit number of the data sequence of obtaining according to the ranging code of different frame structure.The bit number of a data sequence that time-domain symbol comprised of the ranging code correspondence of different frame structure is specially:
When the frame structure of described ranging code as shown in Figure 5 the time, be that the described ranging code that receives is made of 1 time-domain symbol on time domain, when being made of 6 subchannels on frequency domain, the data sequence that time-domain symbol comprised is 6 data sequences that Resource Block comprised; And the size of detection window with ranging code correspondence of this kind frame structure is: length is the length of 1 time-domain symbol, and width is the width of 6 subchannels.
When the frame structure of described ranging code as shown in Figure 6 the time, be that the described ranging code that receives is made of 2 time-domain symbol on time domain, when being made of 3 subchannels on frequency domain, the data sequence that time-domain symbol comprised is 3 data sequences that Resource Block comprised; And the size of detection window with ranging code correspondence of this kind frame structure is: length is the length of 2 time-domain symbol, and width is the width of 3 subchannels.
When the frame structure of described ranging code as shown in Figure 7 the time, be that the described ranging code that receives is made of 6 time-domain symbol on time domain, when being made of 1 subchannel on frequency domain, the data sequence that time-domain symbol comprised is 1 data sequence that Resource Block comprised; And the size of detection window with ranging code correspondence of this kind frame structure is: length is the length of 6 time-domain symbol, and width is the width of 1 subchannel.
Inclined to one side calculation element when the embodiment of the invention provides in a kind of ranging process, as shown in Figure 8, this device comprises: acquiring unit 81, cross-correlation calculation unit 82, converter unit 83, search unit 84, the time inclined to one side computing unit 85 and memory cell 86.
Acquiring unit 81 is used for taking out a data sequence that time-domain symbol comprised in turn from the ranging code that receives at every turn, and from available local ranging code, obtain respectively with the corresponding data sequence of the data sequence of taking out.
After the data sequence that time-domain symbol comprises in data sequence that a time-domain symbol in the described ranging code that receives is comprised and available local ranging code is taken out, by described cross-correlation calculation unit 82, to described data sequence of from the ranging code that receives, taking out, carry out computing cross-correlation with the described data sequence of from each available local ranging code, obtaining respectively, described computing cross-correlation is point multiplication operation or convolution algorithm, be understandable that described computing cross-correlation is not limited to above-mentioned computing, can also comprise other computing cross-correlations of the prior art; And the result of described computing cross-correlation is carried out the frequency domain expansion conversion by described converter unit 83, frequency domain expansion described in the embodiment of the invention is transformed to inverse fast Fourier transform or discrete Fourier transform, be understandable that the frequency domain expansion conversion is not limited to above-mentioned conversion, can also comprise other frequency domain expansion conversion of the prior art.
After the result to described computing cross-correlation carries out the frequency domain expansion conversion, for the data sequence of from the ranging code that receives, taking out at every turn, search the pairing phase place of peak-peak that surpasses predetermined threshold in the transformation results by the described unit 84 of searching; If all there is the described phase place that surpasses the peak-peak correspondence of predetermined threshold in the data sequence of taking out from the ranging code that receives at every turn, it is inclined to one side in the ranging process time when then inclined to one side computing unit 85 networks according to described phase calculation terminal initial when described, be related operation acquisition partially when described by described peak-peak corresponding phase, be specially: described peak-peak corresponding phase is carried out related operation, the value that related operation is obtained as the time inclined to one side.Wherein, described related operation can be but be not limited to the computing of following mode, be specially: the computing of maximizing, the computing of perhaps minimizing, the computing of perhaps averaging.For example, described related operation is the computing of maximizing, is specially partially during then according to the phase calculation of each described peak-peak correspondence that obtains, and asks the maximum phase in the described peak-peak corresponding phase, with described maximum phase as the time inclined to one side.
Search in the process of peak value above the peak-peak corresponding phase of predetermined threshold in the described unit 84 of searching, the index stores of local ranging code that peak value is surpassed the peak value correspondence of predetermined threshold by described memory cell 86, so that when order is chosen next time-domain symbol from the described ranging code that receives, from the local ranging code of described peak value, choose respectively and a described corresponding data sequence of the data sequence that time-domain symbol comprised of from the ranging code that receives, choosing above the index correspondence of the local ranging code of the peak value correspondence of predetermined threshold.
Wherein, the described unit 84 of searching comprises: search module 841, judge module 842, choose module 843 and memory module 844.
Calculation element inclined to one side in the time of in the described ranging process is by the described unit 84 of searching, for the data sequence of from the ranging code that receives, taking out at every turn, when all searching in the transformation results the pairing phase place of peak-peak, at first by the as a result search peak of described search module 841 according to described frequency domain expansion conversion; In the process of search peak, judge the peak value that whether exists in the described peak value that searches above predetermined threshold by judge module 842; Judge the peak value that exists above predetermined threshold as if described judge module 842, then choose peak-peak from described peak value above the peak value of predetermined threshold, and write down the phase place of described peak-peak correspondence by described memory module 844 by the described module 843 of choosing.
In the embodiment of the invention, frame structure according to ranging code, the data sequence that time-domain symbol comprised of from the ranging code that receives, taking out, if all find a pairing phase place of peak-peak, the time inclined to one side calculating of the ranging code of realizing having described frame structure according to the pairing phase place of described each peak-peak in ranging process.
And when described ranging code is made of two time-domain symbol on time domain at least, the time inclined to one side calculation process in, the ranging code that will modulate with this locality that the described ranging code that receives is complementary chooses, and writes down the index of the described local ranging code of selecting; When further the ranging code that receives being mated with the local ranging code that modulates, the local ranging code corresponding with the index with the described local ranging code of selecting of last time record mates, compare with respect to mating with all available ranging codes that this locality modulates, reduced the amount of calculation in the matching process greatly, and, mate with the local ranging code corresponding with the index of the described local ranging code of selecting, be to carry out having on the basis that necessarily is complementary, make the result of described coupling more accurate, thus make calculating the time more accurate partially.
Through the above description of the embodiments, the those skilled in the art can be well understood to the present invention and can realize by the mode that software adds essential common hardware, can certainly pass through hardware, but the former is better execution mode under a lot of situation.Based on such understanding, the part that technical scheme of the present invention contributes to prior art in essence in other words can embody with the form of software product, this computer software product is stored in the storage medium that can read, floppy disk as computer, hard disk or CD etc., comprise some instructions with so that computer equipment (can be personal computer, server, the perhaps network equipment etc.) carry out the described method of each embodiment of the present invention.
The above; only be the specific embodiment of the present invention, but protection scope of the present invention is not limited thereto, anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; can expect easily changing or replacing, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of described claim.
Claims (10)
1. inclined to one side computational methods in the time of in the ranging process is characterized in that, comprising:
From the ranging code that receives, take out a data sequence that time-domain symbol comprised in turn at every turn, and from available local ranging code, obtain respectively with the corresponding data sequence of the data sequence of taking out;
Described data sequence of taking out from the ranging code that receives is carried out computing cross-correlation and frequency domain expansion conversion with the described data sequence of obtaining respectively from local ranging code;
Search in the transformation results phase place of the peak-peak correspondence that surpasses predetermined threshold, and inclined to one side during according to the phase calculation of the peak-peak correspondence of each acquisition.
2. inclined to one side computational methods in the time of in the ranging process according to claim 1 is characterized in that, the described phase place that surpasses the peak-peak correspondence of predetermined threshold in the transformation results of searching comprises:
Search peak as a result according to described frequency domain expansion conversion;
Judge the peak value that whether exists in the described peak value that searches above predetermined threshold;
If there is the peak value that surpasses predetermined threshold, then chooses peak-peak above the peak value of predetermined threshold, and write down the phase place of described peak-peak correspondence from described.
3. inclined to one side computational methods in the time of in the ranging process according to claim 1 is characterized in that, from available local ranging code, obtain respectively with the corresponding data sequence of the data sequence of taking out be specially:
When local ranging code and the ranging code equal in length that receives,, in local ranging code, choose one section sequence of same position and length according to the position and the length of this time-domain symbol in the ranging code that receives.
4. the time inclined to one side computational methods in the ranging process according to claim 1 is characterized in that, also comprise:
From the result of described conversion, choose peak value above predetermined threshold, and the index of the record local ranging code corresponding with the described peak value that surpasses thresholding;
From available local ranging code, obtain respectively with the corresponding data sequence of taking-up data sequence and specifically comprise: select the corresponding local ranging code of index of described record, obtain respectively with the corresponding data sequence of the data sequence of taking out.
5. inclined to one side computational methods in the time of in the ranging process according to claim 1 is characterized in that described computing cross-correlation specifically comprises:
Point multiplication operation or convolution algorithm.
6. inclined to one side computational methods in the time of in the ranging process according to claim 1 is characterized in that described frequency domain expansion conversion specifically comprises:
Inverse fast Fourier transform or discrete Fourier transform.
7. inclined to one side calculation element in the time of in the ranging process is characterized in that, comprising:
Acquiring unit is used for taking out a data sequence that time-domain symbol comprised in turn from the ranging code that receives at every turn, and from available local ranging code, obtain respectively with the corresponding data sequence of the data sequence of taking out;
The cross-correlation calculation unit is used for described data sequence of taking out from the ranging code that receives is carried out computing cross-correlation with the described data sequence of obtaining respectively from local ranging code;
Converter unit is used for the result of described computing cross-correlation is carried out the frequency domain expansion conversion;
Search the unit, be used for the data sequence of taking out from the ranging code that receives, in transformation results, search a phase place that surpasses the peak-peak correspondence of predetermined threshold at every turn;
The time inclined to one side computing unit, inclined to one side when being used for the phase calculation according to the peak-peak correspondence that finds at every turn.
8. inclined to one side calculation element in the time of in the ranging process according to claim 7 is characterized in that the described unit of searching comprises:
Search module is used for the search peak as a result according to described frequency domain expansion conversion;
Judge module is used for judging whether the described peak value that searches exists the peak value above predetermined threshold;
Choose module, be used for, then from described surpassing the peak value of predetermined threshold choosing peak-peak if there is the peak value that surpasses predetermined threshold;
Memory module is used to store the phase place of described peak-peak correspondence.
9. inclined to one side calculation element in the time of in the ranging process according to claim 7 is characterized in that,
Described acquiring unit specifically is used for choosing one section sequence of same position and length according to the position and the length of this time-domain symbol at the ranging code that receives in local ranging code.
10. inclined to one side calculation element in the time of in the ranging process according to claim 7 is characterized in that this device also comprises:
Memory cell is used to store the described index of searching the local ranging code of the peak value correspondence that surpasses predetermined threshold that the unit finds.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101500738A CN101938688A (en) | 2009-06-30 | 2009-06-30 | Time offset calculation method and device in distance measurement |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101500738A CN101938688A (en) | 2009-06-30 | 2009-06-30 | Time offset calculation method and device in distance measurement |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101938688A true CN101938688A (en) | 2011-01-05 |
Family
ID=43391779
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009101500738A Pending CN101938688A (en) | 2009-06-30 | 2009-06-30 | Time offset calculation method and device in distance measurement |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101938688A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103176166A (en) * | 2013-03-14 | 2013-06-26 | 东南大学 | Tracking algorithm for time difference of arrival of signals for acoustic passive positioning |
| WO2017124379A1 (en) * | 2016-01-21 | 2017-07-27 | 华为技术有限公司 | Method and apparatus for determining time offset |
-
2009
- 2009-06-30 CN CN2009101500738A patent/CN101938688A/en active Pending
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103176166A (en) * | 2013-03-14 | 2013-06-26 | 东南大学 | Tracking algorithm for time difference of arrival of signals for acoustic passive positioning |
| CN103176166B (en) * | 2013-03-14 | 2015-03-04 | 东南大学 | Tracking algorithm for time difference of arrival of signals for acoustic passive positioning |
| WO2017124379A1 (en) * | 2016-01-21 | 2017-07-27 | 华为技术有限公司 | Method and apparatus for determining time offset |
| CN108028824A (en) * | 2016-01-21 | 2018-05-11 | 华为技术有限公司 | A kind of method and device of definite time migration |
| CN108028824B (en) * | 2016-01-21 | 2020-04-28 | 华为技术有限公司 | Method and device for determining time offset |
| US10742469B2 (en) | 2016-01-21 | 2020-08-11 | Huawei Technologies Co., Ltd. | Method and apparatus for determining time offset |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7639754B2 (en) | Method of detecting a frame boundary of a received signal in digital communication system and apparatus of enabling the method | |
| US7532902B2 (en) | Method and apparatus for cell search in wireless communication system | |
| CN101577580B (en) | Frame synchronization method | |
| CN110519196B (en) | Method for searching physical cell identity, computer readable storage medium and small base station | |
| CN1318916A (en) | Base station recognition for use in spread spectrum multiple access system based on orthogonal frequency-division multiplex | |
| CN102098259B (en) | Signal emission method in multi-subband orthogonal frequency division multiplexing (OFDM) system | |
| US20170257243A1 (en) | Transmitting and receiving reference signals | |
| CN105530701A (en) | Interference source positioning method and device | |
| WO2017036325A1 (en) | Signal synchronization method and device | |
| CN103634881A (en) | Frequency point searching method and apparatus, and terminal | |
| CN101938688A (en) | Time offset calculation method and device in distance measurement | |
| CN108289070B (en) | Sending method of synchronization sequence, synchronization detection method and device | |
| CN112929904A (en) | Information transmission method and device, communication equipment and storage medium | |
| CN101702705A (en) | Synchronizing method and system for multi-carrier system | |
| CN102843777B (en) | Control method for random access signals | |
| CN100521554C (en) | Frequency domain channel estimation method based on two-value full-pass sequence protection interval filling | |
| CN101860884B (en) | Shared-frequency neighboring cell channel estimation method and device | |
| CN101312597B (en) | Channel estimation unit and channel estimation method | |
| CN101951358B (en) | OFDM (Orthogonal Frequency Division Multiplexing) timing synchronous system based on noise subspace | |
| CN110933703B (en) | User detection method, device, equipment and storage medium | |
| CN101247381B (en) | Coarse timing capturing method, device and mobile terminal | |
| CN107947908B (en) | Synchronization signal sending method, synchronization signal receiving method, network equipment and terminal equipment | |
| CN115643147B (en) | NB-IoT multi-carrier signal synchronization method, device and electronic equipment | |
| CN103780367A (en) | Method for improving data transmission rate, transmitting end and receiving end | |
| CN108512713B (en) | Method and device for calculating time delay |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20110105 |