CN102857455A - Ranging code generation method and device - Google Patents

Abstract

The invention relates to a ranging code generation method and a device. The method includes generating and storing a pseudorandom noise (PN) code in advance for a ranging code of each serial number and reading the corresponding PN codes according to the serial numbers of the ranging codes when the ranging codes are required to be generated; and initializing a pseudo random binary sequence (PBRS), subjecting the PBRS and the PN codes to relevant calculation to generate the first bit of the ranging codes, subjecting the PBRS to 143 times of displacement by using one bit as a unit, and subjecting the PBRS and the PN codes to once relevant calculation each time the displacement is performed so as to sequentially obtain follow-up bits of the ranging codes to finally obtain the ranging codes of the serial numbers. The device comprises a PN code generating module, a PN code reading module, a PRBS module and a ranging code generating module. According to the ranging code generation method and the device, generation speeds of the ranging codes of the different serial numbers are increased.

Description

Ranging code generating method and device

Technical field

The present invention relates to communication field, relate in particular to a kind of range finding (ranging) code generating method and device.

Background technology

OFDM (Orthogonal Frequency Division Multiplexing, OFDM) is a kind of Multicarrier Transmission Technology.In recent years, OFDM is widely applied, and especially at moving communicating field, OFDM is considered to a kind of key technology that has very much development prospect, and it has become one of physical-layer techniques of IEEE 802.16 agreements.

OFDMA (Orthogonal Frequency Division Multiple Access based on the IEEE802.16e agreement, OFDM) system, uplink synchronous between mobile radio station and the base station is finished by ranging, it is the function that the ranging signal has Timing Synchronization and carrier synchronization, simultaneously, the ranging signal also comprises the function of sending bandwidth request and handover request.

The detection method of ranging is that the ofdm signal that at first mobile radio station is sent carries out fast fourier transform at present, then the value and all possible user code that extract all subcarriers of ranging subchannel carry out conjugate multiplication, again the result who multiplies each other is carried out inverse Fourier transform, make it transform to time domain, the peak value and the thresholding that obtain are adjudicated, if peak value surpasses thresholding, then be judged to be user code, in addition, the position that peak value is corresponding namely is time offset.

According to the IEEE802.16e agreement, the ranging code is binary system PN (Pseudorandom Noise, the pseudo random sequence) code that is produced by PRBS (Pseudo Random Binary Sequence, pseudo-random binary sequence), the initiation sequence of PRBS is: b14...b0=0,0,1,0,1,0,1,1, s0, s1, s2, s3, s4, s5, s6, every 144bit are a ranging code, have 256 different ranging codes, sequence number is 0 ... 255.

End side in initial ranging zone with 144bit ranging code through BPSK (Binary Phase Shift Keying, two-phase PSK) is modulated on the subcarrier of 6 continuous subchannels of logic, subcarrier of each bit modulation divides six adjacent sub-channel into a ranging subchannel.

When ranging detects, need to produce possible user code and carry out related operation with all subcarriers that extract the ranging subchannel, and the ranging code generates in order, in the existing ranging detection method, base station side or be the ranging code that produces in real time current required sequence number, can detect to ranging like this and bring larger time-delay, or be the pre-stored sequenced ranging of institute code, do so then and can consume too much resource.

Summary of the invention

The objective of the invention is, a kind of ranging code generating method and device are provided, to optimize in the existing ranging detection, base station side produces the slow or excessive problem of resource consumption of ranging code of different sequence numbers.

The invention provides a kind of ranging code generating method, said method comprises:

According to the sequence number of the ranging code of system configuration, be that the ranging code of each sequence number generates a PN code and storage in advance;

When needs generate the ranging code, according to the sequence number of above-mentioned ranging code, read corresponding PN code;

Initialization PRBS;

Above-mentioned PRBS and above-mentioned PN code are carried out related operation, generate the 1st bit of above-mentioned ranging code;

Above-mentioned PRBS is carried out 143 displacements take 1bit as unit, and every displacement once, all carries out related operation one time with above-mentioned PN code, obtains successively the follow-up bit of above-mentioned ranging code, finally obtains the ranging code of 144 above-mentioned sequence number.

Preferably, the initiation sequence of above-mentioned PRBS is:

{ s6 s5 s4 s3 s2 s1 s0 1101010 0}, wherein, the default value of s6-s0 is 0.

Preferably, above-mentionedly above-mentioned PRBS and above-mentioned PN code carried out related operation be specially:

Above-mentioned PRBS is carried out multiplying with the corresponding bit position of above-mentioned PN code, and the result who again multiplying is obtained carries out Modulo-two operation.

Preferably, above-mentionedly for generating a PN code step, the ranging code of each sequence number specifically comprises in advance:

According to the PRBS model that produces the ranging code in the IEEE802.16e agreement, the generation formula that obtains PRBS is as follows:

$\left(\begin{array}{c}{x}_0\left(m\right)\\ x_1\left(m\right)\\ x_2\left(m\right)\\ x_3\left(m\right)\\ \mathrm{\&Lambda;}\\ x_{n-1}\left(m\right)\end{array}\right)=X\left(m\right)={\left(\begin{array}{cccccc}{c}_0& c_1& c_2& \mathrm{\&Lambda;}& c_{n-2}& c_{n-1}\\ 1& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 1& 0& \mathrm{\&Lambda;}& 0& 0\\ & \mathrm{<figure-callout\; id="0"\; label="M\; O\; M"\; filenames="HDA0000072378180000012.png,HDA0000072378180000021.png"\; state="\{\{state\}\}">M</figure-callout>}& & O& & M\\ 0& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 0& 0& \mathrm{\&Lambda;}& 1& 0\end{array}\right)}^m\&CenterDot;\left(\begin{array}{c}{x}_0\left(0\right)\\ x_1\left(0\right)\\ x_2\left(0\right)\\ x_3\left(0\right)\\ ...\\ x_{n-1}\left(0\right)\end{array}\right)=A^m\&CenterDot;X\left(0\right)$

Wherein, the PRBS that X (m) expression generates for the m time, the initial value of m is 1; The initiation sequence of X (0) expression PRBS; N is the dimension of vector matrix A, n=15, the first row array (c of vector matrix A ₀c ₁c ₂c ₃c ₄c ₅c ₆c ₇c ₈c ₉c ₁₀c ₁₁c ₁₂c ₁₃c ₁₄)=(1 0010010000000 1);

Make m=144*k+p, wherein, k=0,1,2 ..., 255; P=1,2,3 ..., 144, then following formula becomes:

X(m)＝A ^144*k+p·X(0)＝A ^144*k+1·A ^p-1·X(0)

According to the generation formula of above-mentioned PRBS, the generation formula that obtains the ranging code is as follows:

x _k(p)＝(c _k0?c _k1?c _k2?Λ?c _k(n-2)?c _k(n-1))·A ^p-1·X(0)

Wherein, x _k(p) the expression sequence number is the ranging code of k, and k represents the sequence number of ranging code, and p represents the p bit of above-mentioned ranging code; (c _K0c _K1c _K2Λ c _{K (n-2)}c _{K (n-1)}Expression vector matrix A asks the first row array of the vector matrix that obtains behind 144*k+1 power;

According to the generation formula of above-mentioned ranging code, the generation formula of PN code that obtains ranging code correspondence is as follows:

PN _k＝(c _k0?c _k1?c _k2?Λ?c _k(n-2)?c _k(n-1))

Wherein, PN _kThe expression sequence number is the PN code of the ranging code of k.

Generate formula according to above-mentioned PN code, the ranging code that is followed successively by each sequence number generates corresponding PN code and storage.

Preferably, above-mentioned according to PN code generation formula, the ranging code that is followed successively by each sequence number generates corresponding PN code and storing step and specifically may further comprise the steps:

Make k=0,

144*k+1 power of compute vectors matrix A, wherein, vector matrix

$A=\left(\begin{array}{cccccc}{c}_0& c_1& c_2& \mathrm{\&Lambda;}& c_{n-2}& c_{n-1}\\ 1& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 1& 0& \mathrm{\&Lambda;}& 0& 0\\ & \mathrm{<figure-callout\; id="0"\; label="M\; O\; M"\; filenames="HDA0000072378180000012.png,HDA0000072378180000021.png"\; state="\{\{state\}\}">M</figure-callout>}& & O& & M\\ 0& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 0& 0& \mathrm{\&Lambda;}& 1& 0\end{array}\right),$ N=15, the first row array (c of vector matrix A ₀c ₁c ₂c ₃c ₄c ₅c ₆c ₇c ₈c ₉c ₁₀c ₁₁c ₁₂c ₁₃c ₁₄)=(1 0010010000000 1);

The first row array of the vector matrix that extraction calculates, obtaining sequence number is PN code and the storage of the ranging code correspondence of k;

Whether judge k less than 255, if, then make k=k+1, continue to carry out 144*k+1 power step of above-mentioned compute vectors matrix A; Otherwise the PN code generates complete.

Preferably, above-mentioned PRBS is carried out 143 displacements take 1bit as unit, and every displacement is once, all carries out related operation one time with above-mentioned PN code, and the follow-up bit step that obtains successively above-mentioned ranging code specifically may further comprise the steps:

Make p=1;

Above-mentioned PRBS is shifted take 1bit as unit;

The displacement PRBS that obtains and the PN code that reads are carried out multiplying;

The result that multiplying is obtained carries out Modulo-two operation, obtains p+1 bit of above-mentioned ranging code;

Whether judge p less than 143, if, then making p=p+1, the continuation execution is above-mentioned carries out shift step to PRBS take 1bit as unit, otherwise all bit of above-mentioned ranging code generate complete.

The present invention further provides a kind of ranging code generating apparatus, said apparatus comprises PN code generation module, PN code read module, PRBS module and ranging code generation module,

Above-mentioned PN generated code module is used for the ranging code sequence number according to system configuration, is PN code of ranging code generation and the storage of each sequence number;

Above-mentioned PN code read module is used for the sequence number according to the ranging code, reads corresponding PN code from above-mentioned PN code module;

Above-mentioned PRBS module is used for initialization PRBS, and above-mentioned PRBS is shifted;

Above-mentioned ranging code generation module is used for above-mentioned PRBS and above-mentioned PN code are carried out related operation, obtains the ranging code of corresponding sequence number.

Preferably, above-mentioned ranging code generation module also is used for above-mentioned PRBS is carried out multiplying with the corresponding bit of above-mentioned PN code, and the result that multiplying obtains is carried out Modulo-two operation.

Preferably, above-mentioned PN generated code module comprises the power calculating sub module, extracts submodule, sub module stored and the first counting submodule;

Above-mentioned power calculating sub module is used for 144*k+1 power of compute vectors matrix A, and result of calculation is sent to the said extracted submodule, wherein, and vector matrix

$A=\left(\begin{array}{cccccc}{c}_0& c_1& c_2& \mathrm{\&Lambda;}& c_{n-2}& c_{n-1}\\ 1& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 1& 0& \mathrm{\&Lambda;}& 0& 0\\ & \mathrm{<figure-callout\; id="0"\; label="M\; O\; M"\; filenames="HDA0000072378180000012.png,HDA0000072378180000021.png"\; state="\{\{state\}\}">M</figure-callout>}& & O& & M\\ 0& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 0& 0& \mathrm{\&Lambda;}& 1& 0\end{array}\right),$ N=15, the first row array (c of vector matrix A ₀c ₁c ₂c ₃c ₄c ₅c ₆c ₇c ₈c ₉c ₁₀c ₁₁c ₁₂c ₁₃c ₁₄)=(1 0010010000000 1);

The said extracted submodule for the first row array of extracting the vector matrix of receiving, is the PN code of the ranging code of k as sequence number, sends to above-mentioned sub module stored;

Above-mentioned sub module stored is used for the PN code that storage is received;

The first counting submodule is used for beginning counting from k=0, and whether judges k less than 255, if k less than 255, then the value with k sends to above-mentioned power calculating sub module, is that k adds up 1 simultaneously.

Preferably, above-mentioned PRBS module comprises the initialization submodule, displacement submodule and the second counting submodule,

Above-mentioned initialization submodule is used for initialization PRBS, and the PRBS after the initialization is sent to above-mentioned ranging code generation module and above-mentioned displacement submodule;

Above-mentioned displacement submodule is used for PRBS and is shifted take 1bit as unit, and the PRBS after will being shifted sends to above-mentioned ranging code generation module;

The second counting submodule is used for beginning counting from p=1, and whether judges p less than 143, and at p less than 143 o'clock, notify above-mentioned displacement submodule to continue to be shifted.

Preferably, above-mentioned ranging code generation module comprises the multiplying submodule, and Modulo-two operation submodule and ranging code produce submodule,

Above-mentioned multiplying submodule is used for PRBS and the PN code of receiving carried out multiplying, and operation result is sent to above-mentioned Modulo-two operation submodule;

Above-mentioned Modulo-two operation submodule is used for the multiplication result of receiving is carried out Modulo-two operation, and the result that will obtain sends to above-mentioned ranging code generation submodule;

Above-mentioned ranging code produces submodule, is used for the result that computing obtains according to above-mentioned Modulo-two operation submodule, produces the ranging code.

The present invention adopts the PN code that prestores, again with the mode of carrying out related operation through the PRBS after the displacement, eliminate the delay issue that brings when producing the ranging code in real time, improved the formation speed of the ranging code of different sequence numbers, reduce simultaneously resource consumption, adopted the present invention can improve the detection speed of ranging code.

Description of drawings

Accompanying drawing described herein is used to provide a further understanding of the present invention, consists of a part of the present invention, and illustrative examples of the present invention and explanation thereof are used for explaining the present invention, do not consist of improper restriction of the present invention.In the accompanying drawings:

Fig. 1 is the flow chart of ranging code generating method preferred embodiment of the present invention;

Fig. 2 is the principle schematic that produces the PRBS maker of ranging code in the IEEE802.16e agreement;

Fig. 3 is the flow chart that the present invention generates the preferred embodiment of PN code;

Fig. 4 is the flow chart of the embodiment of the present invention 2-144bit of generating the ranging code;

Fig. 5 is the theory diagram of ranging code generating apparatus preferred embodiment one of the present invention;

Fig. 6 is the theory diagram of ranging code generating apparatus preferred embodiment two of the present invention.

Embodiment

In order to make technical problem to be solved by this invention, technical scheme and beneficial effect clearer, clear, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, is not intended to limit the present invention.

As shown in Figure 1, be the flow chart of ranging code generating method preferred embodiment of the present invention, present embodiment may further comprise the steps:

Step S001: according to the sequence number of the ranging code of system configuration, for the ranging code of each sequence number generates the PN code of a correspondence and stores successively according to the sequence number of above-mentioned ranging;

As shown in Figure 2, be the principle schematic that produces the PRBS maker of ranging code in the IEEE802.16e agreement; The initiation sequence of PRBS is: b14...b0=0,0,1,0,1,0,1,1, s0, s1, s2, s3, s4, s5, s6, wherein, b0 is least significant bit (the Least Significant Bit of PRBS, LSB), b14 is the highest significant position (Most Significant Bit, MSB) of PRBS, and s6-s0=UL_PermBase, s6 is the highest order of Ul_PermBase, and generally speaking, default value is UL_PermBase=0, so the initiation sequence of PRBS acquiescence is 0x00D4.

The output Ck of PRBS maker is divided into every section 144bits, and every section is a ranging code, such as, 0-143bit is that sequence number is 0 ranging code, 144-287bit is numbered ranging code of 1 etc., altogether can generate 256 ranging codes.

As can be seen from Figure 1, the PRBS maker can only generate 15bits at every turn, so the generation sequence number is 1 ranging code, need to generate 10 times, namely altogether generate 150bits, front 144bits wherein is that sequence number is the bit of 1 ranging code, residue 6bits then is front 6 bits of the ranging code of Next Sequence, the like, until generate the sequenced ranging of institute code, according to the PRBS model that produces the ranging code in the IEEE802.16e agreement, it is as follows that PRBS generates formula as can be known:

$\left(\begin{array}{c}{x}_0\left(m\right)\\ x_1\left(m\right)\\ x_2\left(m\right)\\ x_3\left(m\right)\\ \mathrm{\&Lambda;}\\ x_{n-1}\left(m\right)\end{array}\right)=X\left(m\right)={\left(\begin{array}{cccccc}{c}_0& c_1& c_2& \mathrm{\&Lambda;}& c_{n-2}& c_{n-1}\\ 1& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 1& 0& \mathrm{\&Lambda;}& 0& 0\\ & \mathrm{<figure-callout\; id="0"\; label="M\; O\; M"\; filenames="HDA0000072378180000012.png,HDA0000072378180000021.png"\; state="\{\{state\}\}">M</figure-callout>}& & O& & M\\ 0& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 0& 0& \mathrm{\&Lambda;}& 1& 0\end{array}\right)}^m\left(\begin{array}{c}{x}_0\left(0\right)\\ x_1\left(0\right)\\ x_2\left(0\right)\\ x_3\left(0\right)\\ ...\\ x_{n-1}\left(0\right)\end{array}\right)=A^m\&CenterDot;X\left(0\right)$

Wherein, the PRBS that X (m) expression generates for the m time, m is positive natural number, the initiation sequence of X (0) expression PRBS; N is the dimension of vector matrix A, n=15, (c ₀c ₁c ₂c ₃c ₄c ₅c ₆c ₇c ₈c ₉c ₁₀c ₁₁c ₁₂c ₁₃c ₁₄)=(1 0010010000000 1); Namely will obtain the m time PRBS, then only need to ask m power (Modulo-two operation) to vector matrix A, multiplying each other with the initiation sequence of PRBS gets final product again.

Make m=144*k+p, wherein, k=0,1,2 ..., 255; P=1,2,3 ..., 144, then following formula becomes:

$X\left(m\right)={\left(\begin{array}{cccccc}{c}_0& c_1& c_2& \mathrm{\&Lambda;}& c_{n-2}& c_{n-1}\\ 1& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 1& 0& \mathrm{\&Lambda;}& 0& 0\\ & \mathrm{<figure-callout\; id="0"\; label="M\; O\; M"\; filenames="HDA0000072378180000012.png,HDA0000072378180000021.png"\; state="\{\{state\}\}">M</figure-callout>}& & O& & M\\ 0& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 0& 0& \mathrm{\&Lambda;}& 1& 0\end{array}\right)}^{144*k+p}\&CenterDot;\left(\begin{array}{c}{x}_0\left(0\right)\\ x_1\left(0\right)\\ x_2\left(0\right)\\ x_3\left(0\right)\\ ...\\ x_{n-1}\left(0\right)\end{array}\right)$

$={\left(\begin{array}{cccccc}{c}_0& c_1& c_2& \mathrm{\&Lambda;}& c_{n-2}& c_{n-1}\\ 1& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 1& 0& \mathrm{\&Lambda;}& 0& 0\\ & \mathrm{<figure-callout\; id="0"\; label="M\; O\; M"\; filenames="HDA0000072378180000012.png,HDA0000072378180000021.png"\; state="\{\{state\}\}">M</figure-callout>}& & O& & M\\ 0& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 0& 0& \mathrm{\&Lambda;}& 1& 0\end{array}\right)}^{144*k+p}\&CenterDot;\left(\begin{array}{cccccc}{c}_0& c_1& c_2& \mathrm{\&Lambda;}& c_{n-2}& c_{n-1}\\ 1& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 1& 0& \mathrm{\&Lambda;}& 0& 0\\ & \mathrm{<figure-callout\; id="0"\; label="M\; O\; M"\; filenames="HDA0000072378180000012.png,HDA0000072378180000021.png"\; state="\{\{state\}\}">M</figure-callout>}& & O& & M\\ 0& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 0& 0& \mathrm{\&Lambda;}& 1& 0\end{array}\right)\&CenterDot;\left(\begin{array}{c}{x}_0\left(0\right)\\ x_1\left(0\right)\\ x_2\left(0\right)\\ x_3\left(0\right)\\ \mathrm{\&Lambda;}\\ x_{n-1}\left(0\right)\end{array}\right)$

That is:

X(m)＝A ^144*k+p·X(0)＝A ^144*k+1·A ^p-1·X(0)

According to following formula, the generation formula of ranging code that can obtain sequence number and be k is as follows:

x _k(p)＝(c _k0?c _k1?c _k2?Λ?c _k(n-2)?c _k(n-1))·A ^p-1·X(0)

Wherein, x _k(p) the expression sequence number is the ranging code of k, and k represents the sequence number of ranging code, k=0, and 1,2 ..., 255, p represents the p bit of above-mentioned ranging code, p=1, and 2,3 ..., 144; (c _K0c _K1c _K2Λ c _{K (n-2)}c _{K (n-1)}) expression vector matrix A asks the first row array of the vector matrix that obtains behind 144*k+1 power;

According to above-mentioned formula as can be known, sequence number is that the PN code of the ranging code correspondence of k is: (c _K0c _K1c _K2Λ c _{K (n-2)}c _{K (n-1)}).

So according to foregoing description, as shown in Figure 3, this step generates specifically may further comprise the steps of PN code:

Step S0011: make k=0,

Step S0012: 144*k+1 power of compute vectors matrix A;

Step S0013: extract the first row array of the vector matrix that calculates, obtaining sequence number is the PN code of the ranging code correspondence of k;

Step S0014: store above-mentioned PN code;

Step S0015: whether judge k less than 255, if, execution in step S0016 then; Otherwise the PN code generates complete;

Step S0016: make k=k+1, execution in step S0012.

Step S002: system need to generate the ranging code;

Step S003: according to the sequence number of above-mentioned ranging code, read corresponding PN code;

Step S004: initialization PRBS;

Step S005: above-mentioned PRBS and above-mentioned PN code are carried out multiplying;

Step S006: multiplication result is carried out Modulo-two operation, obtain the 1st bit of above-mentioned ranging code;

Step S007: above-mentioned PRBS is carried out 143 displacements take 1bit as unit, and every displacement once, all carries out multiplying with above-mentioned PN code, and then multiplication result is carried out Modulo-two operation, obtains successively the follow-up bit of above-mentioned ranging code;

As shown in Figure 4, this step specifically may further comprise the steps:

Step S0071: make p=1;

Step S0072: above-mentioned PRBS is shifted take 1bit as unit;

Step S0073: the displacement PRBS that obtains and the PN code that reads are carried out multiplying;

Step S0074: the result to multiplying carries out Modulo-two operation, obtains p+1 bit of above-mentioned ranging code;

Step S0075: whether judge p less than 143, if, execution in step S0076 then, otherwise, finish, namely all bit of ranging code generate complete;

Step S0076: make p=p+1, execution in step S0072;

Step S008: the ranging code that finally produces 144 corresponding sequence numbers.

As shown in Figure 5, be the theory diagram of ranging code generating apparatus preferred embodiment one of the present invention, in the present embodiment, ranging code generating apparatus comprises PN code generation module 01, PN code read module 02, PRBS module 03 and ranging generation module 04,

PN code generation module 01 is used to the ranging code of each sequence number to generate a PN code and stores successively according to the sequence number of ranging code;

PN code read module 02 is used for the sequence number according to the ranging code, reads corresponding PN code from above-mentioned PN code module 01;

PRBS module 03 is used for initialization PRBS, and above-mentioned PRBS is shifted take 1bit as unit, and the PRBS army that the PRBS that initialization is obtained and displacement obtain sends to ranging generation module 04;

Ranging code generation module 04 is used for PRBS and the PN code of receiving carried out multiplying, and the result of multiplying is carried out Modulo-two operation, obtains the ranging code of corresponding sequence number.

As shown in Figure 6, it is the theory diagram of the preferred embodiment two of ranging code generating apparatus of the present invention, the ranging code generating apparatus of present embodiment also comprises PN code generation module 01, PN code read module 02, PRBS module 03 and ranging code generation module 04, wherein

PN generated code module 01 comprises power calculating sub module 011, extracts submodule 012, sub module stored 013 and the first counting submodule 014;

Power calculating sub module 011 is used for 144*k+1 power of compute vectors matrix A, and result of calculation is sent to extraction submodule 012;

Extract submodule 012, be used for extracting the first row array of the vector matrix of receiving, be the PN code of the ranging code of k as sequence number, and send to above-mentioned sub module stored 014;

Sub module stored 013 is used for the PN code that storage is received;

The first counting submodule 014 is used for beginning counting from k=0, and whether judges k less than 255, if k less than 255, then the value with k sends to power calculating sub module 011, is that k adds up 1 simultaneously.

PN code read module 02 is used for reading the PN code of ranging code correspondence from the sub module stored 013 of PN code generation module 01, and sends to ranging generation module 04;

PRBS module 03 comprises initialization submodule 031, displacement submodule 032 and the second counting submodule 033,

Initialization submodule 031 is used for initialization PRBS, and the PRBS after the initialization is sent to ranging code generation module 04 and displacement submodule 032;

Displacement submodule 032 be used for PRBS is shifted take 1bit as unit, and the PRBS that will obtain after will being shifted sends to ranging generation module 04;

The second counting submodule 033 is used for beginning counting from p=1, and whether judges p less than 143, and at p less than 143 o'clock, notice displacement submodule 032 continues to be shifted;

Ranging generation module 04 comprises multiplying submodule 041, and Modulo-two operation submodule 042 and ranging code produce submodule 043;

Multiplying submodule 041 is used for PRBS and the PN code of receiving carried out multiplying, and operation result is sent to Modulo-two operation submodule 042;

Modulo-two operation submodule 042 is used for the multiplication result of receiving is carried out Modulo-two operation, and the result that will obtain sends to ranging code generation submodule 043;

The ranging code produces submodule 043, is used for the result that 042 computing obtains according to the Modulo-two operation submodule, produces the ranging code.

Above-mentioned explanation illustrates and has described the preferred embodiments of the present invention, but as previously mentioned, be to be understood that the present invention is not limited to the disclosed form of this paper, should not regard the eliminating to other embodiment as, and can be used for various other combinations, modification and environment, and can in invention contemplated scope described herein, change by technology or the knowledge of above-mentioned instruction or association area.And the change that those skilled in the art carry out and variation do not break away from the spirit and scope of the present invention, then all should be in the protection range of claims of the present invention.

Claims (11)

1. range finding ranging code generating method is characterized in that described method comprises:

According to the sequence number of the ranging code of system configuration, be that the ranging code of each sequence number generates a pseudo random sequence PN code and storage in advance;

When needs generate the ranging code, according to the sequence number of described ranging code, read corresponding PN code;

Initializing pseudo random binary sequence PRBS;

Described PRBS and described PN code are carried out related operation, generate the 1st bit of described ranging code;

Described PRBS is carried out 143 displacements take 1bit as unit, and every displacement once, all carries out related operation one time with described PN code, obtains successively the follow-up bit of described ranging code, finally obtains the ranging code of 144 described sequence number.

2. method according to claim 1 is characterized in that, the initiation sequence of described PRBS is: { s6 s5 s4 s3 s2 s1 s0 1101010 0}, wherein, the default value of s6-s0 is 0.

3. method according to claim 1 and 2 is characterized in that, describedly described PRBS and described PN code are carried out related operation is specially:

Described PRBS is carried out multiplying with the corresponding bit position of described PN code, and the result who again multiplying is obtained carries out Modulo-two operation.

4. method according to claim 1 and 2 is characterized in that, describedly specifically comprises for the ranging code of each sequence number generates a PN code step in advance:

According to the PRBS model that produces the ranging code in the IEEE802.16e agreement, the generation formula that obtains PRBS is as follows:

$\left(\begin{array}{c}{x}_0\left(m\right)\\ x_1\left(m\right)\\ x_2\left(m\right)\\ x_3\left(m\right)\\ \mathrm{\&Lambda;}\\ x_{n-1}\left(m\right)\end{array}\right)=X\left(m\right)={\left(\begin{array}{cccccc}{c}_0& c_1& c_2& \mathrm{\&Lambda;}& c_{n-2}& c_{n-1}\\ 1& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 1& 0& \mathrm{\&Lambda;}& 0& 0\\ & M& & O& & M\\ 0& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 0& 0& \mathrm{\&Lambda;}& 1& 0\end{array}\right)}^m\&CenterDot;\left(\begin{array}{c}{x}_0\left(0\right)\\ x_1\left(0\right)\\ x_2\left(0\right)\\ x_3\left(0\right)\\ ...\\ x_{n-1}\left(0\right)\end{array}\right)=A^m\&CenterDot;X\left(0\right)$

Wherein, the PRBS that X (m) expression generates for the m time, the initial value of m is 1; The initiation sequence of X (0) expression PRBS; N is the dimension of vector matrix A, n=15, the first row array (c of vector matrix A ₀c ₁c ₂c ₃c ₄c ₅c ₆c ₇c ₈c ₉c ₁₀c ₁₁c ₁₂c ₁₃c ₁₄)=(1 0010010000000 1);

Make m=144*k+p, wherein, k=0,1,2 ..., 255; P=1,2,3 ..., 144, then following formula becomes:

X(m)＝A ^144*k+p·X(0)＝A ^144*k+1·A ^p-1·X(0)

According to the generation formula of described PRBS, the generation formula that obtains the ranging code is as follows:

x _k(p)＝(c _k0?c _k1?c _k2?Λ?c _k(n-2)?c _k(n-1))·A ^p-1·X(0)

Wherein, x _k(p) the expression sequence number is the ranging code of k, and k represents the sequence number of ranging code, and p represents the p bit of described ranging code; (c _K0c _K1c _K2Λ c _{K (n-2)}c _{K (n-1)}) expression vector matrix A asks the first row array of the vector matrix that obtains behind 144*k+1 power;

According to the generation formula of described ranging code, the generation formula of PN code that obtains ranging code correspondence is as follows:

PN _k＝(c _k0?c _k1?c _k2?Λ?c _k(n-2)?c _k(n-1))

Wherein, PN _kThe expression sequence number is the PN code of the ranging code of k.

Generate formula according to described PN code, the ranging code that is followed successively by each sequence number generates corresponding PN code and storage.

5. method according to claim 4 is characterized in that, described according to PN code generation formula, the ranging code that is followed successively by each sequence number generates corresponding PN code and storing step and specifically may further comprise the steps:

Make k=0,

144*k+1 power of compute vectors matrix A, wherein, vector matrix

$A=\left(\begin{array}{cccccc}{c}_0& c_1& c_2& \mathrm{\&Lambda;}& c_{n-2}& c_{n-1}\\ 1& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 1& 0& \mathrm{\&Lambda;}& 0& 0\\ & M& & O& & M\\ 0& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 0& 0& \mathrm{\&Lambda;}& 1& 0\end{array}\right),$ N=15, the first row array (c of vector matrix A ₀c ₁c ₂c ₃c ₄c ₅c ₆c ₇c ₈c ₉c ₁₀c ₁₁c ₁₂c ₁₃c ₁₄)=(1 0010010000000 1);

The first row array of the vector matrix that extraction calculates, obtaining sequence number is PN code and the storage of the ranging code correspondence of k;

Whether judge k less than 255, if, then make k=k+1, continue to carry out 144*k+1 power step of described compute vectors matrix A; Otherwise the PN code generates complete.

6. method according to claim 1, it is characterized in that described PRBS is carried out 143 displacements take 1bit as unit, and every displacement once, all carry out related operation one time with described PN code, the follow-up bit step that obtains successively described ranging code specifically may further comprise the steps:

Make p=1;

Described PRBS is shifted take 1bit as unit;

The displacement PRBS that obtains and the PN code that reads are carried out multiplying;

The result that multiplying is obtained carries out Modulo-two operation, obtains p+1 bit of described ranging code;

Whether judge p less than 143, if, then making p=p+1, the continuation execution is described carries out shift step to PRBS take 1bit as unit, otherwise all bit of described ranging code generate complete.

7. a ranging code generating apparatus is characterized in that, described device comprises PN code generation module, PN code read module, PRBS module and ranging code generation module,

Described PN generated code module is used for the ranging code sequence number according to system configuration, is PN code of ranging code generation and the storage of each sequence number;

Described PN code read module is used for the sequence number according to the ranging code, reads corresponding PN code from described PN code module;

Described PRBS module is used for initialization PRBS, and described PRBS is shifted;

Described ranging code generation module is used for described PRBS and described PN code are carried out related operation, obtains the ranging code of corresponding sequence number.

8. device according to claim 7 is characterized in that, described ranging code generation module also is used for described PRBS is carried out multiplying with the corresponding bit of described PN code, and the result that multiplying obtains is carried out Modulo-two operation.

9. according to claim 7 or 8 described devices, it is characterized in that described PN generated code module comprises the power calculating sub module, extract submodule, sub module stored and the first counting submodule;

Described power calculating sub module is used for 144*k+1 power of compute vectors matrix A, and result of calculation is sent to described extraction submodule, wherein, and vector matrix

$A=\left(\begin{array}{cccccc}{c}_0& c_1& c_2& \mathrm{\&Lambda;}& c_{n-2}& c_{n-1}\\ 1& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 1& 0& \mathrm{\&Lambda;}& 0& 0\\ & M& & O& & M\\ 0& 0& 0& \mathrm{\&Lambda;}& 0& 0\\ 0& 0& 0& \mathrm{\&Lambda;}& 1& 0\end{array}\right),$ N=15, the first row array (c of vector matrix A ₀c ₁c ₂c ₃c ₄c ₅c ₆c ₇c ₈c ₉c ₁₀c ₁₁c ₁₂c ₁₃c ₁₄)=(1 0010010000000 1);

Described extraction submodule for the first row array of extracting the vector matrix of receiving, is the PN code of the ranging code of k as sequence number, sends to described sub module stored;

Described sub module stored is used for the PN code that storage is received;

The first counting submodule is used for beginning counting from k=0, and whether judges k less than 255, if k less than 255, then the value with k sends to described power calculating sub module, is that k adds up 1 simultaneously.

10. according to claim 7 or 8 described devices, it is characterized in that described PRBS module comprises the initialization submodule, displacement submodule and the second counting submodule,

Described initialization submodule is used for initialization PRBS, and the PRBS after the initialization is sent to described ranging code generation module and described displacement submodule;

Described displacement submodule is used for PRBS and is shifted take 1bit as unit, and the PRBS after will being shifted sends to described ranging code generation module;

The second counting submodule is used for beginning counting from p=1, and whether judges p less than 143, and at p less than 143 o'clock, notify described displacement submodule to continue to be shifted.

11. according to claim 7 or 8 described devices, it is characterized in that described ranging code generation module comprises the multiplying submodule, Modulo-two operation submodule and ranging code produce submodule,

Described multiplying submodule is used for PRBS and the PN code of receiving carried out multiplying, and operation result is sent to described Modulo-two operation submodule;

Described Modulo-two operation submodule is used for the multiplication result of receiving is carried out Modulo-two operation, and the result that will obtain sends to described ranging code generation submodule;

Described ranging code produces submodule, is used for the result that computing obtains according to described Modulo-two operation submodule, produces the ranging code.

Images