CN1859055B - Call processing method and device - Google Patents

Abstract

This invention relates to a call process method and a device for allocating channel codes for newly arrived calls in a SCDMA, in which, the method includes: generating allocatable idle OVSF codes corresponding to the data rate needed by step length and the arrived call, determining the influence factor for each OVSF code, which is the number of combined codes with the greatest travel length of 8 in a set of combined codes formed by multiplying the OVSF codes and all busy codes, an allocated idle OVSF code corresponding to the least influence factor is selected as a channel code to be allocated to the call, said device includes a code generation module, a code analyzing module and a code allocating module.

Description

A kind of call processing method and device

Technical field

The present invention relates to the communication technology, particularly is new call processing method and the device of calling out the allocated channel sign indicating number that arrive in the spread spectrum code division multiple access system.

Background technology

The range of linearity of the high frequency power amplifier of transmitter is limited in the communication system.Cause nonlinear distortion and intermodulation (cross-modulation) to disturb for avoiding input signal to exceed the high frequency power amplifier linear working range; (peak-to-average power ratio PAPR) carries out " back-off " (backoff) to have to equal power ratio according to the peak of input signal.PAPR is big, then needs rollback big, and average transmit power is low, and power efficiency is low.Therefore, seeking the production method that hangs down the PAPR signal is one of direction of communication industry effort.

It is the 3G (Third Generation) Moblie basic fundamental that direct sequence spread spectrum codes is divided multiple access (DS-CDMA), also is one of key technology of following radio communication, broadband wireless access.In the down link of DS-CDMA system, the channel code spread spectrum that a plurality of user's data flow points Yong not be assigned, addition again through baseband filtering, is sent to the high frequency power amplifier of base station.The sequence that addition obtains is not a constant envelope, and with the big peak value of appearance after the baseband filter impulse response convolution, thereby the input signal of high frequency power amplifier has big PAPR.

A.G.Shanbhag and E.G.Tiedemann are at paper " Peak-to-Average Reduction Via Optimal Walsh Code Allocation in Third Generation CDMA Systems " (2000 IEEE Sixth International Symposium on Spread Spectrum Techniques and Applications; Volume 2; Pages 560-564 has studied the PAPR that makes the DS-CDMA system down link of channel code of isometric Walsh sign indicating number in 6-8Sept.2000); The input signal expression formula and the instantaneous power expression formula of high frequency power amplifier have been provided; It is relevant that the instantaneous power of having pointed out signal and channel gain, maximum run are not less than the number of 8 combinational code; Provided the relation of the maximum run of Walsh sign indicating number subscript and combinational code with uncertified 2 theorems.Here, combinational code refers to the result that two Walsh sign indicating numbers multiply each other or mould 2 adds, and it also is a Walsh sign indicating number.This paper has proposed a kind of channel code allocating algorithm that can reduce PAPR: with length is that all Walsh sign indicating numbers of 64 are divided into 8 groupings (bin) according to subscript mould 8; Get a sign indicating number assignment goes out at every turn;, each gets from dividing into groups in turn; The sign indicating number (hereinafter to be referred as busy yard) that makes assignment go out is evenly dispersed in each grouping, or makes busy sign indicating number channel gain sum be evenly dispersed in each grouping.This algorithm has been taken in international monopoly (International Application PCT/US1999/024705, the 1999.10.19 of Qualcomm.International publication WO2000/024147 English 2000.4.27) " Method and apparatus for assigning Walsh codes " and Chinese invention patent (ZL99814606.4) method and apparatus of walsh code " distribute " (get into 18 days June calendar year 2001 of State Period date.December 1 2004 Granted publication day, Granted publication CN1178415C).The essence of this algorithm is: to be all Walsh sign indicating numbers of 64 of 64 be divided into after 8 groupings according to subscript mould 8 length, and the subscript that belongs to the combinational code that two channel codes combinations of different grouping obtain can not be 8 multiple; If code fetch from each divides into groups can not cause big PAPR in turn.In fact, when the subscript of combinational code was 4 multiple, maximum run also possibly be 8, and this is a defective of this algorithm.This algorithm is applicable to the DS-CDMA system that uses the isometric Walsh sign indicating number of 64 chips, like the part (radio configuration is RC1, RC2) of compatible IS-95 in second generation GSM IS-95 and the 3-G (Generation Three mobile communication system) cdma2000lx standard.

V.K.N.Lau is at three pieces of papers " On the analysis of peak-to-average ratio (PAPR) for IS95 and CDMA2000systems " (IEEE Transactions on Vehicular Technology; Volume 49; Issue 6; November 2000 Pages:2174-2188), " Peak-to-average ratio (PAR) reduction by Walsh code selection for IS-95and CDMA2000 systems " (IEE Proceedings on Communications; Vol.147; No.6, Pages:361-364, December 2000) and " Average of peak-to-average ratio (PAR) of IS95 and CDMA2000 systems-single carrier " (IEEE Communications Letters; Vol.5; No.4, Pages 160-162 has studied the PAPR that makes the DS-CDMA system down link of channel code of isometric Walsh sign indicating number in April2001); Analysis has contrasted the influence of the selection of BPSK modulation and QPSK modulation, real spread spectrum and multiple spread spectrum, Walsh sign indicating number to the instantaneous power of signal, points out and can reduce PAPR through the selectivity assignment (being called synthesis technique in the literary composition) of Walsh sign indicating number.But this paper does not sum up executable algorithm, has only provided the Walsh sign indicating number set instance of minimum PAPR of IS-95 system and maximum PAPR with computer search.The limitation of paper is to discuss the DS-CDMA system that uses the isometric Walsh sign indicating number of 64 chips that only is directed against, like the part (radio configuration is RC1, RC2) of compatible IS-95 in second generation GSM IS-95 and the 3-G (Generation Three mobile communication system) cdma2000lx standard,

The work of Shanbhag and Lau is applicable to the DS-CDMA system that uses the isometric Walsh sign indicating number of 64 chips, like the part (radio configuration is RC1, RC2) of compatible IS-95 in second generation GSM IS-95 and the 3-G (Generation Three mobile communication system) cdma2000lx standard.

3G (Third Generation) Moblie cdma2000lx system (containing RC3 and above radio configuration), WCDMA system etc. all adopt Orthogonal Variable Spreading Factor OVSF (OVSF) sign indicating number as channel code; A plurality of ovsf codes of different code length use simultaneously, support multi-user, many speed rates.People such as F.Adachi paper " Tree-structured generation of orthogonal spreading codes with different lengths for the forward link of DS-CDMA mobile radio; " (IEEE Electronics Letters; Vol.33; No.1, pp.27-28, January 1997) in provided the recurrence expansion production method of ovsf code.The ovsf code that produces with this recurrence extended method has binary tree structure, has code length to double rule between subcode and the father's sign indicating number, and non-orthogonal.Ovsf code is during as the channel code of DS-CDMA system, and assignment must satisfy two primary conditions for the new sign indicating number of calling out: code length is corresponding with the new speed that requires of calling out, and is orthogonal to the ovsf code (promptly not having set membership) that assignment is gone out.

Summary of the invention

The present invention provides a kind of spread spectrum code division multiple access system that is used for, and is new call processing method and the device of calling out the allocated channel sign indicating number that arrive, and can't reduce the problem of PAPR through selecting ovsf code to solve in the prior art.

A kind of call processing method comprises the steps:

But A, produce code length and call out corresponding assignment free orthogonal variable bandspread factor (OVSF) sign indicating number of desired data speed with arriving; But whether the number of judging the idle ovsf code of assignment is 1; But if then finish for said calling back as channel code and assignment the idle ovsf code of this unique assignment, otherwise continue;

But B, confirm the influence coefficient of the idle ovsf code of each assignment, but this influence coefficient multiply each other respectively in one group of combinational code of formation for the idle ovsf code of assignment and all busy sign indicating numbers, maximum run length is more than or equal to 8 combinational code number;

But C, the idle ovsf code of the assignment that selection minimum influence coefficient is corresponding are given said calling as channel code and assignment.

Whether also comprise the steps: to judge said code length between said steps A and the step B less than 16, but if then directly select the idle ovsf code of an assignment to finish for said calling back as channel code and assignment; Otherwise continue.

The code length of busy sign indicating number is more than or equal to 16 described in the step B.

Among the said step B, when two ovsf codes that multiply each other With

When satisfying one of following condition, With

Multiply each other form combinational code maximum run length more than or equal to 8,16≤N wherein ₁≤N ₂:

N ₁=N ₂, subscript is poor | and p-q| is 4, Be odd number, Expression min* (p, q)/4 downward rounding operation; Or

N ₁=N ₂, subscript is poor | p-q| be 4 greater than 1 positive integer doubly; Or

N ₁＜N ₂, With

Length be N ₁Father's sign indicating number

Combination, subscript is poor | and r-p| is 4, It is odd number; Or

N ₁＜N ₂, With Length be N ₁Father's sign indicating number

Combination, subscript is poor | r-p| be 4 greater than 1 positive integer doubly;

Wherein, N ₁, N ₂Be the code length of ovsf code, p, q, r are the subscripts of ovsf code.

If the code length of earlier not judging code length 16 and not limiting busy sign indicating number is more than or equal to 16 o'clock, among the said step B, two ovsf codes

With The maximum run length that forms combinational code of multiplying each other comprises the steps more than or equal to 8 determination methods, wherein N ₁≤N ₂:

B-1, judgement N ₁And N ₂All more than or equal to 16, if then continue, otherwise the maximum run length of this combinational code is less than 8;

B-2, judge whether to satisfy one of following condition, if then the maximum run length of this combinational code is more than or equal to 8; Otherwise the maximum run length of this combinational code is less than 8:

N ₁=N ₂, subscript is poor | and p-q| is 4, Be odd number,

Expression min (p, q)/4 downward rounding operation; Or

N ₁=N ₂, subscript is poor Be 4 greater than 1 positive integer doubly; Or

N ₁＜N ₂,

With Length be N ₁Father's sign indicating number Combination, subscript is poor | and r-p| is 4, It is odd number; Or

N ₁＜N ₂,

With Length be N ₁Father's sign indicating number

Combination, subscript is poor | r-p| be 4 greater than 1 positive integer doubly.

But the idle ovsf code of the assignment described in the steps A and any busy sign indicating number quadrature.

A kind of call-processing arrangement comprises calling AM access module, and said processing unit also comprises:

The sign indicating number generation module connects said calling AM access module, calls out required data rate and produces code length and the idle ovsf code of the corresponding assignment of this data rate but be used to resolve arrive;

The sign indicating number analysis module; Connect said sign indicating number generation module; Be used to judge but whether the number of the idle ovsf code of assignment is 1, but if the idle ovsf code of the assignment that then will receive is directly exported to a yard distribution modulator, otherwise confirm the influence coefficient of each idle ovsf code; This influence coefficient is that the busy sign indicating number of idle ovsf code and all multiplies each other respectively in the one group of combinational code that forms, and maximum run length is more than or equal to 8 combinational code number;

The sign indicating number distribution modulator connects the sign indicating number analysis module, is used to select a corresponding idle ovsf code of minimum influence coefficient to give said calling as channel code and assignment.

Said sign indicating number generation module further comprises:

The code length calculating sub module is used to resolve desired data speed and calculates the code length of supporting this data rate;

Busy sign indicating number sub module stored is used to store the busy sign indicating number of current all that have been assigned;

Sign indicating number produces submodule; Connect a code length calculating sub module and a busy sign indicating number sub module stored respectively, be used for producing

but support this data rate and with the idle ovsf code of the assignment of any busy sign indicating number quadrature.

Said sign indicating number analysis module also comprises: code length judgement submodule and influence coefficient are confirmed submodule; Said code length judges that submodule connects the code length calculating sub module and produces submodule with sign indicating number; Be used to judge that idle ovsf code is long whether less than 16; If but the idle ovsf code of the assignment that then will receive is directly exported to a yard distribution modulator; Confirm submodule otherwise export to influence coefficient, but after influence coefficient confirms that submodule is confirmed the influence coefficient of the idle ovsf code of each assignment respectively, but the more idle ovsf code of assignment is exported to a yard distribution modulator with corresponding influence coefficient.

Beneficial effect of the present invention is following:

Use call processing method provided by the invention and device; But when the channel code that the new arrival of idle ovsf code conduct of selecting assignment is called out; Use the back to the PAPR influence degree with reference to an ovsf code; But therefrom select the idle ovsf code of the minimum assignment of influence degree and be assigned as the channel code that new arrival is called out, in the spread spectrum code division multiple access system, realized through selecting ovsf code to reduce the purpose of transmitter high frequency power amplifier input signal PAPR.

Description of drawings

Fig. 1 is the ovsf code tree sketch map that the present invention relates to;

The generation block diagram that Fig. 2 is to use ovsf code to transmit as forward link in a kind of direct sequence spread spectrum codes division multiple access communication system of channel code;

Fig. 3, Fig. 4 are the embodiment of the invention one said call processing method flow charts based on influence coefficient assignment ovsf code;

Fig. 5, Fig. 6 are the embodiment of the invention two said call processing method flow charts based on influence coefficient assignment ovsf code;

Fig. 7, Fig. 8, Fig. 9, Figure 10 are the structural representation of the embodiment of the invention three described call-processing arrangements;

Figure 11 is the PAPR curve chart that the combinational code maximum run length of ovsf code formation does not transmit simultaneously;

Figure 12 PAPR curve chart that to be maximum run length do not transmit more than or equal to 8 combinational code number simultaneously;

Figure 13 is the signal PAPR curve chart when adopting ovsf code assigning method that the present invention proposes and adopting existing ultra-Left sign indicating number assigning method.

Embodiment

The ovsf code tree has binary tree structure, and as shown in Figure 1, Fig. 1 is the code tree sketch map that ovsf code is arranged by layer from left to right, level number k=0, and 1,2 ... K.Have 2 on the code tree k layer ^kIndividual sign indicating number, code length is N=2 ^kUse symbol W ^N _iThe expression code length is that N, subscript are i (i ∈ [0,2 ^k-1] ovsf code), following target layout is by a kind of order of standard.The another kind of symbol of expression ovsf code is that (x, y), for example (k, m) expression is positioned at code tree k layer, is designated as the ovsf code of m down two-dimensional vector.

Ovsf code produces has the recurrence propagation law, and two sign indicating numbers that linked together by the recurrence propagation law have set membership, and two such sign indicating numbers are non-orthogonal.(k, m) arriving sign indicating numbers all on code tree root sign indicating number (0, the 0) path all is sign indicating number (k, father's sign indicating number m), therefore (k, father's sign indicating number S set m) from sign indicating number _A ^{(k, m)}Can be expressed as formula 1:

$S_A^{(k,m)}=\left\{(p,q)\right|0\≤p\≤k-1,q=\left(m\right)\mathrm{mod}\left(2^p\right)\},$ k≥1，m∈[0，2 ^k-1] (1)

By sign indicating number (k, the subcode S set that m) obtains through the recurrence expansion _D ^{(k, m)}Can be expressed as formula 2:

$S_D^{(k,m)}=\left\{(p,q)\right|k+1\≤p\≤K,q=m+g\×2^k\},$ (2)

k≤K-1，m∈[0，2 ^k-1]，g∈[0，2 ^p-k-1]

Significantly, being positioned at ovsf code tree is mutually orthogonal with all yards of one deck; Ovsf code is set the sign indicating number of any two different layers, as long as there is not set membership each other, also is mutually orthogonal.

The chip of ovsf code (chip) numerical value is+1 or-1, two layer sign indicating number W together _iAnd W _jCombinational code be the corresponding chip gained that multiplies each other, this combinational code also is a sign indicating number that is positioned at this one deck, also promptly, is positioned at ovsf code tree all sign indicating numbers crowd of formation under multiplying with one deck.

Lay respectively at the sign indicating number of different layers

With When making up, With Length be respectively N ₁And N ₂, according to the recurrence propagation law of ovsf code, if N rank ovsf code is divided into 2 ^kEqual portions (k ∈ [1, log ₂N]), then each equal portions all is the benefit value of father's sign indicating number or father's sign indicating number of this yard.Length is N ₁And N ₂(the N on rank ₁＜N ₂) two quadrature ovsf codes

With

The combinational code length that constitutes is N ₁Rank, be

With

N ₁Rank father's sign indicating number (or father's sign indicating number benefit value) Multiplying each other obtains, and can be designated as W _{<P, r>}Wherein, according to formula 1: sign indicating number

Be positioned at N ₁The subscript of father's sign indicating number on rank Be that q is right

Delivery.

The maximum run length of ovsf code (maximum run-length) is the maximum number of continuous in this yard "+1 " or " 1 "; Discover, meet following three rules between the subscript numerical value of the maximum run length numerical value of the combinational code of ovsf code, ovsf code and sign indicating number:

Rule 1, N rank and following 0 the ovsf code W that is designated as ₀Maximum run length be N; If N rank ovsf code W _iSubscript i be 2 ^t1 times (t is an integer, 1≤2 ^t＜N), then the maximum run length of this ovsf code is 2 ^tIf subscript i is 2 ^tOther odd, then the maximum run length of this ovsf code is 2 ^T+1

Rule 2, for combinational code, if i ≠ j, N rank combinational code W _{<I, j>}Distance of swimming maximum be M/2.If | i-j| is 2 ^t1 times, establish that smaller value is i among i and the j, when

During for even number ( Represent downward rounding operation), combinational code W _{<I, j>}Subscript<i, j>Be exactly 2 ^t, maximum run length is 2 ^tWhen During for odd number, W _{<I, j>}Subscript<i, j>Be 2 ^tOther odd, maximum run length is 2 ^T+1If | i-j| is 2 ^tOther odd, W then _{<I, j>}Subscript<i, j>Also be 2 ^tOther odd, maximum run length is 2 ^T+1

If rule 3 requires the maximum run length of combinational code more than or equal to 8, constitute two sign indicating number W of combinational code _iAnd W _jThe subscript coefficient difference | i-j| is if 41 times, Must be odd number; Perhaps subscript is poor | and i-j| is other integral multiple of 4.

Above-mentioned 3 rules explanation when having only code length all to make up more than or equal to two ovsf codes of 16, could produce maximum run length more than or equal to 8 combinational code.

Fig. 2 is to use ovsf code as the generation block diagram that a kind of direct sequence spread spectrum codes division multiple access communication system forward link of channel code transmits, and has been used for cdma2000lx system forward link.The input signal of i channel is by channel gain { G among Fig. 2 _i, data symbol { d ⁽ⁱ⁾And channel code Wi formation, W _iSimultaneously represent that also length is N _iRank and the following ovsf code that is designated as i; Add circuit merges the signal of some channels, gets into multiplier and multiplies each other { α with short PN sequence _n+ jb _nBe n chip of short PN sequence; Get into pulse shaping filter, do convolution with the impulse response h (t) of pulse-shaping filter; Baseband signal I behind the molding filtration (t) iQ (t) is modulated onto radio frequency, ω _cIt is carrier angular frequencies; Radiofrequency signal is sent into high frequency power amplifier PA.During a data symbol the shortest, the baseband signal of forward link can be written as formula (3):

$I\left(t\right)+\mathrm{jQ}\left(t\right)=\underset{i}{\mathrm{\&Sigma;}}{G}_i\&CenterDot;(d_I^{\left(i\right)}{a}_n-d_Q^{\left(i\right)}{b}_n)\&CenterDot;W_i\left[n\right]\&CenterDot;h(t-{\mathrm{nT}}_c)+j\underset{i}{\mathrm{\&Sigma;}}{G}_i\&CenterDot;(d_Q^{\left(i\right)}{a}_n+d_I^{\left(i\right)}{b}_n)\&CenterDot;W_i\left[n\right]\&CenterDot;h(t-{\mathrm{nT}}_c)---\left(3\right)$

Wherein, 0≤t≤T _cMin (N _i), T _cBe chip time span (chip duration).

The input signal s (t) of high frequency power amplifier can be expressed as formula (4):

$s\left(t\right)=\mathrm{Re}\left\{\right[I\left(t\right)+\mathrm{jQ}\left(t\right){]e}^{-j{\mathrm{\&omega;}}_{c}t}\}$

(4)

$=I\left(t\right)\cos \left({\mathrm{\&omega;}}_{c}t\right)+Q\left(t\right)\sin \left({\mathrm{\&omega;}}_{c}t\right)$

The instantaneous power S of s (t) ²(t) can be expressed as formula (5)

S ²(t)＝I ²(t)+Q ²(t)＝∑ ₁+∑ ₂ (5)

(5) in the formula, ∑ ₁Expression chip alignment (n ₁=n ₂) item, ∑ ₁Shown in (6):

${\mathrm{\&Sigma;}}_1=\underset{i_1,i_2}{\mathrm{\&Sigma;}}\underset{n_1}{\mathrm{\&Sigma;}}{G}_{i_1}{G}_{i_2}(d_I^{\left(i_1\right)}{a}_{n_1}-d_Q^{\left(i_1\right)}{b}_{n_1})(d_I^{\left(i_2\right)}{a}_{n_1}-d_Q^{\left(i_2\right)}{b}_{n_1})W_{i_1}\left[n_1\right]W_{i_2}\left[n_1\right]h^2(t-n_1{T}_c)$

(6)

$+\underset{i_1,i_2}{\mathrm{\&Sigma;}}\underset{n_1}{\mathrm{\&Sigma;}}{G}_{i_1}{G}_{i_2}(d_Q^{\left(i_1\right)}{a}_{{\mathrm{<figure-callout\; id="1"\; label="n"\; filenames="S06157800220060307E000011.png,S06157800220060307E000051.png"\; state="\{\{state\}\}">n</figure-callout>}}_1}+d_I^{\left(i_1\right)}{b}_{n_1})(d_Q^{\left(i_2\right)}{a}_{{\mathrm{<figure-callout\; id="1"\; label="n"\; filenames="S06157800220060307E000011.png,S06157800220060307E000051.png"\; state="\{\{state\}\}">n</figure-callout>}}_1}+d_I^{\left(i_2\right)}{b}_{n_1})W_{i_1}\left[n_1\right]W_{i_2}\left[n_1\right]h^2(t-n_1{T}_c)$

(6) but the formula abbreviation is (7) formula:

${\mathrm{\&Sigma;}}_1=\underset{i_1,i_2}{\mathrm{\&Sigma;}}2\&CenterDot;G_{i_1}{G}_{i_2}(d_I^{\left(i_1\right)}{d}_I^{\left(i_2\right)}+d_Q^{\left(i_1\right)}{d}_Q^{\left(i_2\right)})\underset{n_1}{\mathrm{\&Sigma;}}{W}_{<{\mathrm{<figure-callout\; id="1"\; label="i"\; filenames="S06157800220060307E000011.png,S06157800220060307E000051.png"\; state="\{\{state\}\}">i</figure-callout>}}_1,i_2>}\left[n_1\right]h^2(t-n_1{T}_c)---\left(7\right)$

Owing to investigate the power of signal, need carry out square operation S ²(t)=I ²(t)+Q ²(t)=∑ ₁+ ∑ ₂, quadratic term (two sign indicating numbers multiply each other) appears in the product.Each sign indicating number all is a sequence, and alignment (n is arranged when multiplying each other ₁And n ₂Equate) or do not have alignment (n ₁And n ₂Etc.) two kinds of situation all can not omitted.

(7) in the formula,

It is sign indicating number And sign indicating number The alignment product, itself also be a sign indicating number, abbreviate combinational code as, if certain number of channel of using constantly is M, then the combinational code number does $\left(\begin{array}{c}\mathrm{<figure-callout\; id="2"\; label="M"\; filenames="S06157800220060307E000011.png"\; state="\{\{state\}\}">M</figure-callout>}\\ 2\end{array}\right).$ Because interval of definition is a data symbol cycle the shortest.Therefore, in (7) formula except that the shortest sign indicating number all sign indicating number alternative with his father's sign indicating number, subscript will be the subscript of his father's sign indicating number.

(5) ∑ in the formula ₂Expression n ₁≠ n ₂Item because short PN randomicity of sequences, channel code

With

To ∑ ₂There is not directly definite influence.So, only (7) formula is analysed in depth, is discussed.

Visible by (7) formula, the amplitude of signal transient power is determined by following 2 factors:

1, the maximum run length of

S ²(t) size does not rely on some channel codes, but with combinational code in identical and continuous chip maximum number, promptly maximum run length is relevant.The length of the impulse response of baseband filter is generally more than 10 chip time span in the second generation, the 3-G (Generation Three mobile communication system), and for example 48 sampling periods are grown in the impulse response of baseband filter in the cdma2000 series standard, at 12 chip time span (12T _C) interior non-zero.If

Maximum run length be 8 chips or more than, its maximum run length is suitable with filter impulse response length, square can superposeing fully when the combinational code convolution of (7) formula median filter impulse response can cause S ²(t) bigger amplitude is arranged, and then obtain bigger PAPR.

2, maximum run length is more than or equal to the number of 8 combinational code

Here being called for short maximum run length is the β sign indicating number more than or equal to 8 combinational code, given combinational code number, if wherein β sign indicating number number is many more, and S ²(t) amplitude is big more.

According to aforesaid three rules: two ovsf codes

With (N ₁≤N ₂) to obtain the β sign indicating number at first satisfied in combination:

Condition 1, code length N ₁And N ₂All more than or equal to 16;

Secondly, also need satisfy following arbitrary condition:

Condition 2, N ₁=N ₂, subscript is poor | and p-q| is 4,

It is odd number;

Condition 3, N ₁=N ₂, subscript is poor | and p-q|=4i is 4 integral multiple, i=2,3,4...;

Condition 4, N ₁＜N ₂, With

Length be N ₁Father's sign indicating number

Combination, subscript is poor | and r-p| is 4,

It is odd number;

Condition 5, N ₁＜N ₂, With

Length be N ₁Father's sign indicating number

Combination, subscript is poor | and r-p|=4i is 4 integral multiple, i=2,3,4....

To sum up, when in condition 1 and the condition 2,3,4,5 any one satisfies simultaneously, two ovsf codes

With

(N ₁≤N ₂) combination obtain the β sign indicating number.

Comprehensively above-mentioned, lower in order to make PAPR, the basic ideas of the channel code assigning method of low PAPR provided by the invention are: system when new call arrival, but select to satisfy the channel code of the idle ovsf code of assignment of following condition as this calling:

1, the code length of this free time OVSF just in time can be supported the new data rate that requires of calling out;

2, this free time OVSF and already used each busy sign indicating number quadrature;

For satisfying this condition, this free time ovsf code can not be busy sign indicating number, and can not be the father's sign indicating number or the subcode of any one busy sign indicating number, and father's sign indicating number of each busy sign indicating number or subcode can be confirmed according to formula (1) formula (2).

3, compare other idle ovsf codes, use the minimum number of the newly-increased β sign indicating number of this free time ovsf code;

Number because of the newly-increased β sign indicating number of the use of this yard; The number of the β sign indicating number that to be exactly this yard with already used each busy sign indicating number make up respectively and obtain; For describing conveniently; The number of the β sign indicating number that the present invention will increase newly because of the use of this yard is defined as influence coefficient, and method provided by the invention just is being based on influence coefficient and is selecting idle ovsf code.

Here need to prove influence coefficient h ^{(f, m)}Also can be defined as the number of all the β sign indicating numbers after idle ovsf code is assigned; Promptly hypothesis should the free time after ovsf code uses; All busy sign indicating numbers make up the combinational code of back formation in twos and gather the β sign indicating number number that comprises; But since between the existing busy sign indicating number in twos the number of the β sign indicating number of combination results confirm, with influence coefficient h ^{(f, m)}Be defined as newly-increased β sign indicating number number and can reduce data processing amount.

Below through specific embodiment and how to be described with reference to the accompanying drawings the said technical conceive of embodiment of the present invention:

Embodiment one

As shown in Figure 3, a kind of call processing method of calling out the allocated channel sign indicating number for new arrival according to the invention comprises the steps:

S101, the definite long N of ovsf code that can support of data rate that at first requires based on the arrival calling, this code length just in time can be supported the data rate of new calling requirement, confirms the code tree level number f of correspondence again based on code length;

But the Candidate key S set that S102, the idle ovsf code of generation assignment are formed _C

S _C=(f, m) | (f m) is bell idles }, S _CBut form this Candidate key S set by the idle ovsf code of the assignment of all f layers _CProduction method be: get rid of the busy sign indicating number of the OVSF that has been used on the f layer, get rid of other layers again and go up the busy sign indicating number of already used OVSF behind the father's sign indicating number or subcode on the f layer, remaining ovsf code on the f layer;

S103, judgement S set _CWhether the number of the idle ovsf code that comprises is 1, but if then execution in step S109 finishes to newly arrived calling back the idle ovsf code assignment of this unique assignment; Otherwise continue step S104;

S104, difference calculated candidate sign indicating number S set _CIn, but the influence coefficient h of the idle ovsf code of each assignment ^{(f, m)}

Influence coefficient h ^{(f, m)}But be meant the number of using the β sign indicating number that increases newly behind the idle ovsf code of an assignment, i.e. an idle ovsf code and all busy yard β sign indicating number numbers that the combinational code that is combined to form respectively set comprises.

S105, confirm all h ^{(f, m)}In minimum value h _Min

If all influence coefficient h ^{(f, m)}Result of calculation equate minimum value h then _MinEqual this result of calculation.

S106, generation minimum value h _MinBut the S set that the idle ovsf code of corresponding assignment is formed _O, S _O=(f, m) | h ^{(f, m)}=h _Min;

S107, from S _OBut the middle assignment bell idles (f, m ') of selecting;

If S set _OBut only comprise the idle ovsf code of an assignment, but then select and to carry out assignment by the idle ovsf code of assignment; If S set _OBut comprise the idle ovsf code of assignment more than, then select according to prior art, concrete system of selection is known for those skilled in the art, repeats no more here.

But newly arrived calling is given in S108, idle ovsf code (f, the m ') assignment of the assignment that will choose;

Among the step S104, but calculate one of them assignment bell idles (k, influence coefficient h m) ^{(f, m)}Flow process as shown in Figure 4, specifically comprise the steps:

S1041, initialization code (k, influence coefficient h m) ^{(k, m)}, be about to h ^{(k, m)}Put 0;

S1042, judge sign indicating number (k, m) whether the level number at place more than or equal to 4; If, execution in step S1043; Otherwise execution in step S10412, output influence coefficient h ^{(k, m)}, when (k, m) level number at place was less than 4 o'clock, and (k m) can not produce the β sign indicating number with any busy code combination to this sign indicating number, so influence coefficient h ^{(k, m)}Equal 0;

S1043, produce the S set that constitutes more than or equal to 4 busy sign indicating number by level number ' _B

According to the method for the invention, level number makes up less than the ovsf code of 4 busy sign indicating number and any length can not produce the β sign indicating number, so S set ' _BConstitute more than or equal to 4 busy sign indicating number by level number.

The condition 1 that obtains the β sign indicating number according to two ovsf code combinations among S1042 and the S1043 is judged, if condition 1 does not satisfy, then can not be combined into the β sign indicating number, influence coefficient h ^{(k, m)}Equal 0; If satisfy condition 1, then execution in step S1044-S1049 further judges whether to satisfy other any one conditions.

If the S1044-S1049 S set ' _BNon-NULL, therefrom select a sign indicating number (t, n), through judge sign indicating number (k, m) (whether t n) satisfies two ovsf codes and makes up a condition in condition 2, condition 3, condition 4 and the condition 5 that obtains the β sign indicating number with sign indicating number; If satisfy then execution in step S10410; Otherwise execution in step S10411;

S10410, with influence coefficient h ^{(k, m)}Add 1;

S10411, upgrade a sign indicating number S set ' _B, promptly from the sign indicating number S set ' _BIn remove the sign indicating number (t, n); Return 1044 then, get into next cycle period, up to the sign indicating number S set ' _BBe empty set; The influence coefficient of output this moment is exactly sign indicating number (k, influence coefficient h m) ^{(k, m)}

Through said method, but select the minimum assignment bell idles assignment of influence coefficient to give the calling that arrives, make the flat power ratio in peak of the input signal of transmitter high frequency power amplifier in the direct sequence spread spectrum codes division multiple access system minimum.

Embodiment two

As shown in Figure 5, the another kind of call processing method of calling out the allocated channel sign indicating number for new arrival according to the invention comprises the steps:

S201, the definite long N of ovsf code that can support of data rate that at first requires based on the arrival calling, this code length just in time can be supported the data rate of new calling requirement, confirms the code tree level number f of correspondence again based on code length;

But the Candidate key S set of S202, the idle ovsf code of generation assignment _C

S _C=(f, m) | (f m) is bell idles }, S _CBut form this Candidate key S set by the idle ovsf code of the assignment of all f layers _CProduction method be: get rid of the busy sign indicating number of the OVSF that has been used on the f layer, get rid of other layers again and go up the busy sign indicating number of already used OVSF behind the father's sign indicating number or subcode on the f layer, remaining ovsf code on the f layer;

S203, judgement S set _CBut whether the number of the idle ovsf code of the assignment that comprises is 1, but if then execution in step S211 finishes to newly arrived calling back the idle ovsf code assignment of this unique assignment; Otherwise continue step S204;

S204, whether judge level number f more than or equal to 4, if otherwise this sign indicating number (k m) can not produce β sign indicating number, S set with any busy code combination _CBut in the influence coefficient h of the idle ovsf code of each assignment ^{(f, m)}Be 0, so execution in step S209 and S210 are directly from S set _CBut select the idle ovsf code assignment of an assignment to give newly arrived calling, concrete system of selection is known for those skilled in the art, repeats no more here; If level number f more than or equal to 4 execution in step S205 further select;

According to the method for the invention, also can first execution in step S203, execution in step S204 again.

Among S205, the difference calculated candidate sign indicating number S set C, but the influence coefficient h of the idle ovsf code of each assignment ^{(f, m)}

Influence coefficient h ^{(f, m)}But be meant the number of using β sign indicating number newly-increased behind the idle ovsf code of an assignment, but promptly the idle ovsf code of assignment is gathered a β sign indicating number number that comprises with the combinational code that all busy sign indicating numbers are combined to form respectively.

S206, confirm all h ^{(f, m)}In minimum value h _Min

If all influence coefficient h ^{(f, m)}Result of calculation equate minimum value h then _MinEqual this result of calculation.

S207, generation minimum value h _MinBut the S set that the idle ovsf code of corresponding assignment is formed _O, S _O=(f, m) | h ^{(f, m)}=h _Min;

S208, S210, from S _OBut a middle selection assignment bell idles (f, m '), and newly arrived calling is given in the sign indicating number that will choose (f, m ') assignment;

If S set _OBut only comprise the idle ovsf code of an assignment, but then select and to carry out assignment by the idle ovsf code of assignment; If S set _OBut comprise the idle ovsf code of assignment more than, then select according to prior art, concrete system of selection is known for those skilled in the art, repeats no more here.

Among the step S205, but calculate one of them assignment bell idles (k, influence coefficient h m) ^{(f, m)}Flow process as shown in Figure 6, specifically comprise the steps:

S2051, initialization code (k, influence coefficient h m) ^{(k, m)}, be about to h ^{(k, m)}Put 0;

S2052, produce the S set that constitutes more than or equal to 4 busy sign indicating number by level number ' _B, and but execution in step S2053-S2059 confirms assignment bell idles (k, influence coefficient h m) ^{(f, m)}

If the S2053-S2058 S set ' _BNon-NULL, therefrom select a sign indicating number (t, n), judge sign indicating number (k, m) (whether t n) satisfies two ovsf codes and makes up any condition in condition 2, condition 3, condition 4 and the condition 5 that obtains the β sign indicating number with sign indicating number; If satisfy execution in step S2059; Otherwise go to step S20510;

S2059, with influence coefficient h ^{(k, m)}Add 1;

S20510, upgrade a sign indicating number S set ' _B, promptly from the sign indicating number S set ' _BIn remove the sign indicating number (t, n); Return step S2053 then, get into next cycle period, up to the sign indicating number S set ' _BBe empty set; The influence coefficient of output this moment is exactly sign indicating number (k, influence coefficient h m) ^{(k, m)}

Through said method, but select the minimum assignment bell idles assignment of influence coefficient to give the calling that arrives, make the flat power ratio in peak of the input signal of transmitter high frequency power amplifier in the direct sequence spread spectrum codes division multiple access system minimum.

Embodiment three

Technical scheme provided by the invention also can adopt device shown in Figure 7 to realize, this device is realized based on the method for the invention, comprising: call out AM access module, also comprise:

The sign indicating number generation module connects said calling AM access module, calls out required data rate and produces code length and the idle ovsf code of the corresponding assignment of this data rate but be used to resolve arrive;

The sign indicating number analysis module connects said sign indicating number generation module, is used for confirming the influence coefficient of each idle ovsf code, this influence coefficient be idle ovsf code with one group of combinational code of all busy yard formation of multiplying each other respectively in, maximum run length is more than or equal to 8 combinational code number;

The sign indicating number distribution modulator connects the sign indicating number analysis module, is used to select a corresponding idle ovsf code of minimum influence coefficient to give said calling as channel code and assignment.

As shown in Figure 8, said sign indicating number generation module further comprises:

The code length calculating sub module is used to resolve desired data speed and calculates the code length of supporting this data rate;

Busy sign indicating number sub module stored is used to store the busy sign indicating number of current all that have been assigned;

Sign indicating number produces submodule, connects a code length calculating sub module and a busy sign indicating number sub module stored respectively, but be used to produce support this data rate and with the idle ovsf code of the assignment of any busy sign indicating number quadrature.

Said sign indicating number analysis module also comprises: code length judgement submodule and influence coefficient are confirmed submodule; Said code length judges that submodule connects the code length calculating sub module and produces submodule with sign indicating number; Be used to judge that whether said code length is less than 16; If but the idle ovsf code of the assignment that then will receive is directly exported to a yard distribution modulator; Confirm submodule otherwise export to influence coefficient, but after influence coefficient confirms that submodule is confirmed the influence coefficient of the idle ovsf code of each assignment respectively, but the more idle ovsf code of assignment is exported to a yard distribution modulator with corresponding influence coefficient.

As shown in Figure 9, also comprise in the said sign indicating number analysis module: number of codes is judged submodule, is connected code length judgement submodule and influence coefficient and confirms between the submodule; Be used to judge but whether the quantity of the idle ovsf code of assignment is 1, but, confirm submodule otherwise export to influence coefficient if the idle ovsf code of the assignment that then will receive is directly exported to a yard distribution modulator.

Perhaps shown in figure 10; Number of codes judges that submodule is connected sign indicating number and produces between submodule and the code length judgement submodule; When but the quantity of the idle ovsf code of assignment equals 1; But the idle ovsf code of the assignment that directly will receive is exported to a yard distribution modulator, but otherwise the idle ovsf code of the assignment that will receive is exported to code length judgement submodule.

Like Fig. 9, shown in Figure 10, the sign indicating number distribution modulator connects busy sign indicating number sub module stored, the ovsf code information that is assigned in this this call treatment of storage simultaneously.

The beneficial effect of technical scheme according to the invention can be verified through following emulated data.

Shown in figure 11, Figure 11 be the combinational code maximum run length that constitutes of ovsf code not simultaneously, the PAPR sketch map that transmits that emulation obtains provides the cumulative probability curve of PAPR (dB of unit) more than or equal to a certain numerical value.Used channel code is as shown in table 1, for relatively convenient, makes each channel code have identical channel gain.Visible by Figure 11, the combinational code maximum run length that ovsf code constitutes in Set1 and the set of Set2 sign indicating number does not satisfy the condition 1 that constitutes the β sign indicating number all less than 8, and PAPR is less.The combinational code maximum run length that ovsf code constitutes in Set3, Set4 and the set of Set5 sign indicating number is all more than or equal to 8, and PAPR is bigger, and three curves almost overlap.The maximum run length that this explanation needs only combinational code is more than or equal to 8, and is suitable to the influence of PAPR.

Table 1 comprises the sign indicating number set of two ovsf codes

The sign indicating number set	The sign indicating number that comprises	The maximum run length of combinational code
			Set1	W 4 1、W 4 3	2
Set2	W 8 1、W 8 5	4
			Set3	W 64 5、W 64 13	8
Set4	W 64 5、W 64 21	16
			Set5	W 64 5、W 64 37	32

Shown in figure 12, Figure 12 is the transmit PAPR sketch mapes of three groups of ovsf codes as channel code, provides the cumulative probability curve of PAPR (dB of unit) more than or equal to a certain numerical value.Used channel code is as shown in table 2, and it is that 16,2 length are that 32 and 4 length are 64 ovsf code that each group all comprises 2 length.For relatively convenient, make each channel code have identical channel gain.Visible by Figure 12, β sign indicating number number is few more, and PAPR is more little.

The group of the ovsf code of many kinds of length of table 2

Shown in figure 13, it is 16: 8: 4 in the calling number ratio that the arrival interval and the service duration of 6 layers of code tree, calling all meets negative exponent distribution, data rate R, 2R, 4R, 8R, 16R that Figure 13 adopts ovsf code assigning method (inf curve) that the present invention proposes and the ultra-Left sign indicating number assigning method (lef curve) that adopts existing practicality: signal PAPR curve chart under 2: 1 conditions.

The ovsf code assigning method that adopts the present invention to propose is compared with adopting existing ultra-Left sign indicating number assigning method, and the probability of happening that the signal peak-to-average power ratio is big is obviously little.For example among Figure 13, when system loading was 5Erlang, the signal peak-to-average power ratio was that 10 decibels probability of happening is 2 * 10 during the ovsf code assigning method of employing the present invention proposition ^-4, be starkly lower than 10 when adopting existing ultra-Left sign indicating number assigning method ^-3

Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, belong within the scope of claim of the present invention and equivalent technologies thereof if of the present invention these are revised with modification, then the present invention also is intended to comprise these changes and modification interior.

Claims (10)

1. a call processing method is characterized in that, comprises the steps:

But A, produce code length and call out corresponding assignment free orthogonal variable bandspread factor (OVSF) sign indicating number of desired data speed with arriving; But whether the number of judging the idle ovsf code of assignment is 1; But if then finish for said calling back as channel code and assignment the idle ovsf code of this unique assignment, otherwise continue;

But B, confirm the influence coefficient of the idle ovsf code of each assignment, but this influence coefficient multiply each other respectively in one group of combinational code of formation for the idle ovsf code of assignment and all busy sign indicating numbers, maximum run length is more than or equal to 8 combinational code number;

But C, the idle ovsf code of the assignment that selection minimum influence coefficient is corresponding are given said calling as channel code and assignment.

2. the method for claim 1; It is characterized in that; Whether also comprise the steps: to judge said code length between said steps A and the step B less than 16, but if then directly select the idle ovsf code of an assignment to finish for said calling back as channel code and assignment; Otherwise continue.

3. method as claimed in claim 2 is characterized in that, the code length of busy sign indicating number is more than or equal to 16 described in the step B.

4. method as claimed in claim 3 is characterized in that, among the said step B, when two ovsf codes that multiply each other

With

When satisfying one of following condition, With Multiply each other the maximum run length of the combinational code that forms more than or equal to 8, wherein 16≤N ₁≤N ₂:

N ₁=N ₂, subscript is poor | and p-q| is 4, Be odd number,

Expression min (p, q)/4 downward rounding operation; Or

N ₁=N ₂, subscript is poor | p-q| be 4 greater than 1 positive integer doubly; Or

N ₁＜N ₂,

With

Length be N ₁Father's sign indicating number Combination, subscript is poor | and r-p| is 4,

It is odd number; Or

N ₁＜N ₂, With Length be N ₁Father's sign indicating number Combination, subscript is poor | r-p| be 4 greater than 1 positive integer doubly;

Wherein, N ₁, N ₂Be the code length of ovsf code, p, q, r are the subscripts of ovsf code.

5. the method for claim 1 is characterized in that, among the said step B, and two ovsf codes

With

The maximum run length that forms combinational code of multiplying each other comprises the steps more than or equal to 8 determination methods, wherein N ₁≤N ₂:

B-1, judgement N ₁And N ₂All more than or equal to 16, if then continue, otherwise the maximum run length of this combinational code is less than 8;

B-2, judge whether to satisfy one of following condition, if then the maximum run length of this combinational code is more than or equal to 8; Otherwise the maximum run length of this combinational code is less than 8:

N ₁=N ₂, subscript is poor | and p-q| is 4, Be odd number,

Expression min (p, q)/4 downward rounding operation; Or

N ₁=N ₂, subscript is poor | p-q| be 4 greater than 1 positive integer doubly; Or

N ₁＜N ₂,

With Length be N ₁Father's sign indicating number

Combination, subscript is poor | and r-p| is 4,

It is odd number; Or

N ₁＜N ₂,

With Length be N ₁Father's sign indicating number Combination, subscript is poor | r-p| be 4 greater than 1 positive integer doubly;

Wherein, N ₁, N ₂Be the code length of ovsf code, p, q, r are the subscripts of ovsf code.

6. method as claimed in claim 5 is characterized in that, the code length of busy sign indicating number is more than or equal to 16 described in the step B.

7. the method for claim 1 is characterized in that, but the idle ovsf code of the assignment described in the steps A and any busy sign indicating number quadrature.

8. a call-processing arrangement comprises calling AM access module, it is characterized in that, said processing unit also comprises:

The sign indicating number generation module connects said calling AM access module, calls out required data rate and produces code length and the idle ovsf code of the corresponding assignment of this data rate but be used to resolve arrive;

The sign indicating number analysis module; Connect said sign indicating number generation module; Be used to judge but whether the number of the idle ovsf code of assignment is 1, but if the idle ovsf code of the assignment that then will receive is directly exported to a yard distribution modulator, otherwise confirm the influence coefficient of each idle ovsf code; This influence coefficient is that the busy sign indicating number of idle ovsf code and all multiplies each other respectively in the one group of combinational code that forms, and maximum run length is more than or equal to 8 combinational code number;

The sign indicating number distribution modulator connects the sign indicating number analysis module, is used to select a corresponding idle ovsf code of minimum influence coefficient to give said calling as channel code and assignment.

9. processing unit as claimed in claim 8 is characterized in that, said sign indicating number generation module further comprises:

The code length calculating sub module is used to resolve desired data speed and calculates the code length of supporting this data rate;

Busy sign indicating number sub module stored is used to store the busy sign indicating number of current all that have been assigned;

Sign indicating number produces submodule, connects a code length calculating sub module and a busy sign indicating number sub module stored respectively, but be used to produce support this data rate and with the idle ovsf code of the assignment of any busy sign indicating number quadrature.

10. processing unit as claimed in claim 9; It is characterized in that; Said sign indicating number analysis module also comprises: code length judgement submodule and influence coefficient are confirmed submodule, and said code length judges that submodule connects code length calculating sub module and sign indicating number generation submodule, is used to judge that idle ovsf code is long whether less than 16; If but the idle ovsf code of the assignment that then will receive is directly exported to a yard distribution modulator; Confirm submodule otherwise export to influence coefficient, but after influence coefficient confirms that submodule is confirmed the influence coefficient of the idle ovsf code of each assignment respectively, but the more idle ovsf code of assignment is exported to a yard distribution modulator with corresponding influence coefficient.

Images