CN101065919A - Multi-rate wireless communication apparatus and code distributing method - Google Patents

Multi-rate wireless communication apparatus and code distributing method Download PDF

Info

Publication number
CN101065919A
CN101065919A CNA2005800405581A CN200580040558A CN101065919A CN 101065919 A CN101065919 A CN 101065919A CN A2005800405581 A CNA2005800405581 A CN A2005800405581A CN 200580040558 A CN200580040558 A CN 200580040558A CN 101065919 A CN101065919 A CN 101065919A
Authority
CN
China
Prior art keywords
code word
code
numbers
tree
ordered series
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CNA2005800405581A
Other languages
Chinese (zh)
Inventor
黎海涛
李继峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Panasonic Holdings Corp
Original Assignee
Matsushita Electric Industrial Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from CNA2004100955061A external-priority patent/CN1780188A/en
Application filed by Matsushita Electric Industrial Co Ltd filed Critical Matsushita Electric Industrial Co Ltd
Priority to CNA2005800405581A priority Critical patent/CN101065919A/en
Publication of CN101065919A publication Critical patent/CN101065919A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

A structure for encapsulating a liquid crystal display device is disclosed. Openings are formed in a second material layer on a first substrate, exposing an underlying first material layer. The openings are substantially distributed over the perimeter of the first substrate. A sealant is placed in the openings, forming a sealant region for attachment of a second substrate to the first substrate. The sealant region is substantially perpendicular to a direction of length of the openings. In addition, the sealant contacts the first material layer and the second material layer through the openings.

Description

Multi-rade wireless communications system and code distributing method
Technical field
The present invention relates to a kind of multi-rade wireless communications device and code distributing method, for example relate to and be used to support the multi-user to insert and the multi-rade wireless communications device and the code distributing method of many antennas input and output-OFDM-code division multiplexing (hereinafter referred to as " MIMO-OFDM-CDM ") communication of variable bit rate multimedia messages transmission.
Background technology
Along with the fusion gradually of wireless network and internet, people are more and more higher to the requirement of the type of radio communication service and quality.For satisfying the requirement of radio multimedium and high speed data transfers, need the Development of New Generation wireless communication system.The MIMO-OFDM Radio Transmission Technology that wherein many antennas input and output (MIMO) and OFDM (OFDM) combine is subjected to extensive concern (referring to non-patent literature 1,2 and 3).
The MIMO-OFDM technology that MIMO and OFDM combine has both advantages, it both resolved into one group of parallel flat fading channel to frequency selectivity MIMO fading channel by the OFDM modulation, utilize MIMO to improve power system capacity again, be applicable to sound, the video multimedia business of transmission of high-rate.Except anti-frequency selective fading, also can utilize code division multiplexing (CDM, i.e. coding) technology to obtain frequency diversity (rake) to improve systematic function (for example non-patent literature 4).
The MIMO-OFDM-CDM system that non-patent literature 5 proposes can obtain frequency diversity and spectral efficient effect simultaneously, but has only studied the reception handling problem of the MIMO-OFDM-CDM system under single user's single-rate situation.Use Orthogonal Variable Spreading Factor OVSF (OVSF) spread spectrum mode, when supporting that different rates is professional, the code word that the user is distributed in requirement must be a quadrature, and this easily causes code word to block (Blockage).For solving the code word obstructing problem, non-patent literature 5 has provided the code distributing method based on topology search, as Fig. 1, its thought is to be associated with every candidate's subcode tree with a cost function, and distribute the root sign indicating number of minimum cost subcode tree to call out to new, to guarantee sign indicating number the being distributed to subcode tree of minimum cost.When new call request is served (S12), check system residual capacity (S13) is if system can support this calling (S13: "Yes"), then search for the subcode tree of minimum cost, and its root sign indicating number capacity can be supported this calling (S14).Behind the subcode tree of finding minimum cost, if this subcode tree for empty (S15: "Yes"), then directly distribute the root sign indicating number to call out to this, otherwise, give the subcode tree (S17) that the sub-code data rate is the highest in the new call distribution root sign indicating number.At last, in this subcode tree, redistribute the highest code word of sub-code data rate and give new call out (S18).Fig. 2 is the block diagram of the structure of signal receiving system in the past.
The OVSF spread spectrum has the advantage of supporting the variable Rate multimedia service by the MIMO-OFDM-CDM system, but its shortcoming is a restricted condition when using.Owing to necessarily need distribute the code word of quadrature for the user, and cause when supporting that different rates is professional the code word obstruction that becomes easily.Solve the problem that this code word is blocked, need redistribute code word to support new calling.Yet, in device in the past, owing to carry out a large amount of code word exchanges and redistribute operation, and have the high problem of complexity of system.
Non-patent literature 1:G.J.Foschini, Layered space-time architecture forwireless communication in a fading environment when using multi-elementantennas, Bell Labs Tech.J., vol.1,1996, pp.41-59.
Non-patent literature 2:I.E.Telatar, Capacity of multi-antenna Gaussian channels, Eur.Trans.Tel., vol.10, no.6, Nov./Dec.1999, pp.585-595.
Non-patent literature 3:A.J.Paularj et al., An Overview of MIMOCommunications-A Key to Gigabit Wireless, Proceedings of IEEE, vol.92, no.2, Feb.2004, pp.198-218.
Non-patent literature 4:S.Kaiser, OFDM code division multiplexing in fadingchannels, IEEE trans.Comm.., vol.50, Aug.2002, pp.1266-1273.
Non-patent literature 5:Kilsik Ha and K.B.Lee, OFDM-CDM with V-BLASTDetection and Its Extension to MIMO Systems, in Proc.IEEE VehicularTechnology Conference 2003 Spring (VTC 2003S), Jeju, Korea, vol.1, pp.764-768, Apr.2003.
Summary of the invention
Problem to be addressed by invention
The object of the present invention is to provide a kind of multi-rade wireless communications device and code distributing method, the code word obstructing problem that produces when supporting variable multimedia use in system, carrying out the low dynamic sign indicating number of complexity distributes, because the number of times redistributed lacking very, thereby can reduce the load of system.
The scheme of dealing with problems
Multi-rade wireless communications device of the present invention adopts, comprise: allocation units, occupied code word and do not have the ordered series of numbers of occupied code word among the code word group that the code tree of expression by tree structure hierarchically is associated by every kind of spread spectrum rate changes to and is divided into described occupied code word and the described ordered series of numbers that does not have the two-part optimum state of occupied code word; Memory cell is stored the described ordered series of numbers of described optimum state; And spectrum-spreading unit, use the code word of distributing to new calling according to the described ordered series of numbers of the described optimum state of described cell stores, the transmission data of giving described new calling are carried out the structure of spread processing.
Code distributing method of the present invention may further comprise the steps: will represent occupied code word among the code word group that the code tree by tree structure hierarchically is associated by every kind of spread spectrum rate and not have the ordered series of numbers of occupied code word, and change to and be divided into described occupied code word and the described ordered series of numbers that does not have the two-part optimum state of occupied code word; Store the described ordered series of numbers of described optimum state; And, give new the calling with code assignment according to the described ordered series of numbers of described optimum state of storage.
The effect of invention
According to the present invention, the code word obstructing problem that produces when supporting variable multimedia use in system carries out the low dynamic sign indicating number of complexity and distributes, because the number of times of redistributing lacking very, thereby can reduce the load of system.
Description of drawings
Fig. 1 illustrates the flow chart of code distributing method in the past;
Fig. 2 illustrates the block diagram of structure of receiving system in the past;
Fig. 3 is the block diagram of the structure of the dispensing device that relates to of signal embodiments of the present invention;
Fig. 4 is the block diagram of the structure of the receiving system that relates to of signal embodiments of the present invention;
Fig. 5 is the figure of the code tree that relates to of signal embodiments of the present invention;
Fig. 6 A is the figure of the code tree that relates to of signal working of an invention mode;
Fig. 6 B is the figure of the topological notation that relates to of signal embodiments of the present invention;
Fig. 7 A is the figure of the code tree that relates to of signal embodiments of the present invention;
Fig. 7 B is the figure of the topological notation that relates to of signal embodiments of the present invention;
Fig. 8 A is the figure of the code tree that relates to of signal embodiments of the present invention;
Fig. 8 B is the figure of the code tree that relates to of signal embodiments of the present invention;
Fig. 9 A is the figure of the code tree that relates to of signal embodiments of the present invention;
Fig. 9 B is the figure of the code tree that relates to of signal embodiments of the present invention;
Figure 10 A is the figure of the code tree that relates to of signal embodiments of the present invention;
Figure 10 B is the figure of the code tree that relates to of signal embodiments of the present invention;
Figure 11 A is the figure of the code tree that relates to of signal embodiments of the present invention;
Figure 11 B is the figure of the code tree that relates to of signal embodiments of the present invention;
Figure 11 C is the figure of the code tree that relates to of signal embodiments of the present invention;
Figure 12 A is the figure of the code tree that relates to of signal embodiments of the present invention;
Figure 12 B is the figure of the code tree that relates to of signal embodiments of the present invention;
Figure 12 C is the figure of the code tree that relates to of signal embodiments of the present invention;
Figure 13 A is the figure of the code tree that relates to of signal embodiments of the present invention;
Figure 13 B is the figure of the code tree that relates to of signal embodiments of the present invention; And
Figure 14 is the flow chart of the code distributing method that relates to of signal embodiments of the present invention.
Embodiment
The present invention, optimum state and E-t notation based on code tree provide dynamic code distributing method.Its main thought is, having under the situation of accepting the new capacity of calling out, to new call distribution code word and keep the optimum state of code tree.
Below in conjunction with accompanying drawing present embodiment is specified.Be noted that described execution mode only is for purpose of the present invention is described, rather than limitation of the scope of the invention.
(execution mode)
In the following description, will be with the example of MIMO-OFDM-CDM system as multi-rade wireless communications system, present invention is described, but should be appreciated that the present invention is not limited thereto.
For making system when the multi-user inserts, have the ability of supporting the transmission of variable Rate multimedia messages, the present invention proposed data flow before entering antenna multiplexed step, utilized and distributed the frequency expansion sequence of single Orthogonal Variable Spreading Factor OVSF (OVSF) to the information bit spread spectrum for each user.The bit stream of input is through encode, interweave, being multiplexed with a plurality of sons after the modulation, spread processing and flowing.Each sub-rheology changes the parallel data symbol into, send into CDM multiplexer spread spectrum and obtain son stream output signal, again will through interweave, signal emission after the OFDM modulation treatment.After the CDM processing, data symbol is extended on a plurality of subcarriers and transmits.What transmit on each subcarrier no longer is monadic symbols, but the linear combination of each symbol.Like this, even there is certain subcarrier to have deep fading (Deep Fading), also can from other subcarriers, recovers to transmit, thereby have the frequency diversity effect.At receiving terminal, after sign synchronization, OFDM demodulation, deinterleaving, input, recover bit stream after despreading, demodulation, deinterleaving, the decoding.For obtaining the multi-antenna channel transmission matrix, propose OFDM-CDM and send pilot frequency sequence, the receiving terminal measurement pilot signals is also carried out schemes such as AGC, sign synchronization, channel estimating.Further, at receiving terminal, for obtaining suboptimum (Suboptimum) channel capacity, the present invention proposes to adopt the reception processing scheme of sphere decoding (Spheredecoding).
Fig. 3 is for being equipped with N LThe block diagram of the MIMO-OFDM-CDM system of transmit antennas, the bit stream of input is through being encoded by chnnel coding unit T101, and T102 interweaves by interleave unit, and is multiplexing after being modulated by modulating unit T103, becomes N LHeight stream.Then, at S/P unit T105, N LIndividual sub-rheology changes P parallel data symbol into, and the parallel data symbol after the conversion is sent to CDM multiplexer T107, by spread spectrum and multiplexing, obtains the n shown in the formula (1) fSon stream output signal.
y n t = S P x n t - - - ( 1 )
In formula (1), it whenever classifies the orthogonal intersection sequence as.The n of formula (1) fSon stream output signal is when interleave unit T108 interweaves, after process OFDM modulates among IDFT unit T109 and the CP extra cell T110, from n tIndividual antenna emission (T111).After the CDM processing, data symbol is extended on a plurality of subcarriers and transmits, and what transmit on each subcarrier is the linear combination of each symbol.Like this,, also can from other subcarriers, recover to transmit, reach the frequency diversity effect even there is certain subcarrier to have the deep fading.
At receiving terminal, received signal is carried out sign synchronization by temporal frequency lock unit R212, carry out the OFDM demodulation by CP removal unit R 210 and DFT unit 209, carry out data deinterlacing by interleave unit R208, R214 carries out input by the sphere decoding receiver, by demodulating unit R203 demodulation, carries out deinterleaving by deinterleaving unit R 202, by after the decoding unit R201 decoding, revert to bit stream again.N rThe received signal of root antenna is represented by formula (2).
r n r = Σ n t = 1 N t H n r n t S P x n t + w n r - - - ( 2 )
In the formula (2), the element of channel gain matrix is the multiple Gaussian random variable of zero equal (zero mean) value and unit variance, each element of noise vector is independent same distribution (I.I.D, independentindentically distributed)) multiple Gaussian random variable.
At the MIMO-OFDM-CDM system, non-patent literature 5 has proposed the V-BLAST detection method, but there is the problem of system capacity loss in this method.In recent years, document R.wang, G.B.Giannakis, Approaching MIMO channel capacity with reduced complexity softsphere decoding, WCNC 2004 has studied the MIMO detection method based on sphere decoding.
The present invention proposes and will be applied to the MIMO-OFDM-CDM system based on the MIMO detection method of sphere decoding, is the center with the received signal, searches for to transmit in the ball of certain radius.The framework of this system can obtain the suboptimum channel capacity.During sphere decoding,, need known each subchannel fading coefficients for obtaining the Channel Transmission matrix.The MIMO-OFDM-CDM system sends pilot frequency sequence, and the receiving terminal measurement pilot signals is also carried out AGC, sign synchronization, channel estimating etc.
Systematic function when non-patent literature 5 has only been studied single user's single-rate is supported the ability of variable Rate multimedia messages transmission for making system under multi-user environment.The present invention propose undertaken by S/P unit T105 antenna multiplexed before, utilize the frequency expansion sequence that distributes single Orthogonal Variable Spreading Factor OVSF (OVSF) to each user by spectrum-spreading unit T104, to information symbol stream spread spectrum.Like this, the data flow of different rates promptly adopts the long code spread spectrum to the low speed symbols streams through the spread spectrum of different multiples, behind high speed symbols streams employing short code spread spectrum, with identical chip (Chip) speed rates (seeing the dotted portion among Fig. 3), be similar to the SF-CDMA mode herein.Note that the effect of carrying out spread spectrum before symbols streams is multiplexing is, makes system have the ability of supporting multi-user and variable Rate; Be by the effect that every antenna carries out the CDM spread spectrum in multiplexing back, data symbol expanded on the subcarrier of OFDM the effect difference of the two.
The OVSF spread spectrum makes the MIMO-OFDM-CDM system have the advantage of supporting the variable Rate multimedia service, but the shortcoming that has constraints on using is arranged.The code word that the user is distributed in its requirement must be a quadrature, is supporting different rates to be easy to cause code word to block when professional like this.For solving this code word obstructing problem, need carry out redistributing of code word can support new calling.The sign indicating number distributor that system adopts as shown in Figure 3, it comprises memory cell 101, comparing unit 102, computing unit 103,104 4 modules of allocation units.
Memory cell 101 is used for the code tree of storage system, and described code tree is in optimum state (will be described after a while).At this, code tree for to be associated by every kind of spread spectrum rate by tree structure with making the spreading code layering.
Comparing unit 102 is used for when receiving new calling, according to state that is stored in the code tree in the memory cell 101 and the required speed t of new calling, judges whether system can hold new calling.If system can not hold new calling, then keep the state of the code tree of system, do not trigger computing unit 103; If system can hold new calling, then trigger computing unit 103.
Computing unit 103 is used for state and the required speed t of new calling according to the code tree that is stored in memory cell 101, calculates, and result of calculation is offered allocation units 104.
Allocation units 104 according to the result of calculation from computing unit 103, are given new the calling with suitable code assignment, if desired, correspondingly change the code word of having distributed, thereby make the code tree of system still be in optimum state, and the code tree after will changing is stored in the memory cell 101.That is to say that allocation units 104 will be represented owing to distribute occupied code word and not be assigned with the unordered ordered series of numbers that does not promptly have occupied code word, and be altered to the ordered series of numbers that is divided into occupied code word and does not have the optimum state of occupied code word two parts.In addition, will narrate in the back for code distributing method.
At first analyze the principle that sign indicating number distributes in the OVSF spread spectrum system below.It is the Orthogonal Variable Spreading Factor OVSF (OVSF) of N with the head of a household that employing is distributed to each, to the principle of each data symbol spread spectrum of duration T (data transfer rate R=1/T).The OVSF orthogonal intersection is generated by Walsh (Walsh) sign indicating number matrix, and available code tree as Fig. 5 is represented.
Adopt the method for topological notation descriptor code tree structure to be: for the code word of ground floor, from left to right observe, if its code word can also be distributed, represent with X, as non-patent literature 6 (Thit Min, Kai, Yeung (Sunny) Siu, Dynamic assignment of OVSF codes inW-CDMA, IEEE JSAC, 2000,18 (8): 1429-1440).If this code word is occupied, represent with its capacity 1.In addition, cause it not use if its female sign indicating number is occupied, then observe this mother's sign indicating number and caused what its subcodes of ground floor can not be with (being made as K), then the code word of this K ground floor be represented with K.Observe the topological notation of code tree, can see that its numerical portion all appears at the right of ordered series of numbers, and X only appears at the ordered series of numbers left side.Be that occupied code word concentrates on code tree the right, be referred to as the optimum state of code tree.
At the optimum state of code tree, the present invention proposes to expand topological notation.Because do not have all on the left sides of occupied code word, can only carry out record with set of number.Wherein the first digit of ordered series of numbers is the number (being residual capacity) of X in the topological notation, and all the other numerals are other digital numbers (the two is consistent in proper order) except that X in the topological notation.Adopt under the situation of E-t notation record code tree, only need two groups of ordered series of numbers of record: one group is that another group is the distribution condition of ground floor code word with the code tree state of E-t notation record.Though some situation can not directly be used the E-t literary style, owing to have the character of optimum state,, also can regard as and satisfy optimum state by the exchange codeword number, be referred to as pseudo-optimum state.
The E-t notation has following character, and establishing ordered series of numbers is (S, a 1, a 2..., a k), its code tree satisfies (puppet) optimum state, and power system capacity is 2 nIn this ordered series of numbers, ordered series of numbers is except first number (residual capacity), and remaining number all satisfies: if 2 m<2 n, and have a in the ordered series of numbers q=2 M1<2 m, 2 m| a 1+ a 2+ ... + a Q-1, then exist i to satisfy q≤i, a q+ ... + a i=2 m
Fig. 5 shows the schematic diagram of code tree.Wherein descend the code word generation of the ovsf code word of one deck by last layer, each code word shows that with a unique number of plies and a branch numerical table number of plies of code word was counted since 1 to last the end of by.As the code tree of Fig. 5, two code words of the 3rd layer are to be produced by female sign indicating number of the 4th layer.Among Fig. 5, [x] represents a binary code ordered series of numbers, and [x] is its radix-minus-one complement.At each layer, from left to right several of the branch numbers of code word.If the data of the code word supporting rate R of ground floor, then the data rate of M layer code word support is 2 (M-1)* R[bps].Definition " the maximum data rate N of support MaxThe code word sum of=ground floor ", be overall system capacity.System's residual capacity be total capacity deduct the code word capacity that takies and.Work as N MaxAfter determining, then determined the code tree number of plies, each code word can be expressed as " code word=(number of plies, branch number) ".
A branch is a complete binary system subcode tree of code tree, and the uppermost code word of code tree (or subcode tree) is called the root sign indicating number of this code tree (subcode tree).Shown in Fig. 6 A, (4,1) are the root sign indicating numbers of whole code tree, and (3,1) are the root sign indicating numbers of a branch (subcode tree), and the code word that this branch comprises is (2,1), (2,2), (1,1), (1,2), (1,3) and (1,4).The code word high by the number of plies can form the low code word of all numbers of plies (subcode) by circulation, and all root sign indicating numbers that are connected to a certain low layer code word are called its female sign indicating number.If two code words all by the directly generation of last layer a certain female sign indicating number, then are called fraternal code word.All subcodes of (2,4) are fraternal code word (1,7) among Fig. 6 A, (1,8), and all female sign indicating numbers of (1,5) are (2,3), (3,2) and (4,1).In addition, according to Fig. 6 A, (1,1), (1,2), (2,2), (2,3), (3,1), and (3,2), (4,1) are for blocking code word, (1,3), (1,5), (2,1) code word for being assigned with.
Every layer code word is mutually orthogonal, two code words of different layers except one of them code word is female sign indicating number of another one code word, also equal quadrature.For guaranteeing used code word pairwise orthogonal, if some code words occupied after, then its female sign indicating number and subcode can not be used again.The figure that Fig. 6 A and Fig. 6 B block for the signal code word.When code word (2,1), after (1,3) and (1,5) was assigned with, residual capacity was (2 (4-1)-2 (2-1)-2 (1-1)-2 (1-1)) * R=4R[bps], promptly system can also supporting rate be 4R[bps] data.But code word (4,1), (3,1), (3,2), (2,2) and (2,3) quilt subcode separately blocks, (1,1), (1,2) is blocked by its female sign indicating number (2,1), causes system's appearance to be blocked.
System must redistribute code word, to support new call business after the code word obstruction occurring.As Fig. 6 A, if a speed is arranged is 4R[bps] new calling, if original data of supporting with code word (1,5) are changed into usefulness (1,4) support, can utilize code word (3,2) to support newly to call out like this, the operation that code word (1,5) is changed into (1,4) is called redistributing of code word.
Non-patent literature 6 has been introduced topological notation and come the descriptor code tree structure, and is promptly to any code tree structure, corresponding with it with unique ordered series of numbers.Its method is: for the code word of ground floor, from left to right observe one by one, if its code word can also be distributed, represent with X; Otherwise,, represent with its capacity 1 if this code word is occupied; If because of its female sign indicating number causes it not use, then observe this mother's sign indicating number and caused what its subcodes of ground floor can not be with (being made as K), then the code word of this K ground floor is represented with K.As the situation (black represents that code word is occupied, down together) of Fig. 6 A, its topological notation is shown in Fig. 6 B.Wherein, the number of X is represented the unappropriated residual capacity of system.For the topological notation of code tree, if its numeral all appears at the right of ordered series of numbers, promptly occupied code word concentrates on code tree the right, and X only appears at the state on the ordered series of numbers left side, is called the optimum state of code tree.Fig. 7 A and Fig. 7 B show two kinds of situations of optimum state, and according to topological notation, Fig. 7 A is designated as X11122, and Fig. 7 B is designated as XX24.
At the optimum state of code tree, extend out by topological notation, the present invention proposes expansion topology (E-t) notation.Because there are not all on the left sides of occupied code word, so can only carry out record with a numeral.In the ordered series of numbers ordered series of numbers, first digit is the number (being residual capacity) of the X in the topological notation, and all the other numerals are other digital numbers (the two is consistent in proper order) except that X in the topological notation.Shown in Fig. 7 A Lower Half, (111122) of E-t notation are specifically described.The number of the unappropriated code word of first " 1 " expression; Second, third and the 4th " 1 " are represented (4,2) respectively, and (4,3) and (4,4) are assigned with." 2 " on the 5th and the 6th represent that respectively (4,5) and (4,6) and (4,7) and (4,8) get clogged.In like manner, the E-t notation of the code tree shown in Fig. 7 B is expressed as (224).
According to the E-t notation, if system's residual capacity is zero, then add " 0 " in the ordered series of numbers front, as Fig. 8 A, should be expressed as 04211 according to the E-t notation; And for Fig. 8 B, the E-t notation should be expressed as 4211.
Put it briefly, the E-t notation is at first set up the optimum state of code tree.For the code word of this code tree ground floor, from left to right observe one by one then,, represent with X if its code word can also be distributed; Otherwise,, represent with its capacity " 1 " if this code word is occupied; If because of its female sign indicating number causes it not use, then observe this mother's sign indicating number and caused what its subcodes of ground floor can not be with (being made as K), then the code word of this K ground floor is represented (so far being topological notation) with K; At last, write down this state with set of number, the first digit of this ordered series of numbers is the number of X, the occupied or obstruction (expanding topological notation) of this code word of other numerals.
Adopt the E-t notation to write down under the situation of code tree, need two groups of ordered series of numbers of record: one group is the code tree state with E-t notation record, and another group is the distribution condition of record ground floor code word.Fig. 9 A is the figure of the pseudo-optimum state of expression, and Fig. 9 B is the figure of the expression optimum state corresponding with Fig. 9 A.Shown in Fig. 9 B, the state recording of its code tree is: (1111211) (each numeral code word capacity), the distribution condition of ground floor code word are 78561234 (each numeral codeword number).
Though some state can not directly represent to have the character of optimum state with the E-t notation.In addition, by the exchange codeword number, also can regard as and satisfy optimum state (being called pseudo-optimum state).As Fig. 9 A, when this state of record, the numbering of ground floor code word is 12345678, and corresponding topological notation is 21111X1.That is to say that Fig. 9 A is the ordered series of numbers of keeping the occupied code word of expression and not having the code tree relation of occupied code word.When the state of code tree was a situation shown in Fig. 9 B, the codeword number of ground floor was recorded as 78561234, and corresponding topological notation is X111211, and therefore available E-t notation is recorded as (1111211), and the state of Fig. 9 A is called pseudo-optimum state.
Said process is the numbering exchange of code word, because the external behavior of two code words is just the same, inner mutually orthogonal is so exchange is numbered inside and can not produced any influence to the outside.If codeword number exchanges, then the order of Ji Lu ordered series of numbers also should be made corresponding change.Be noted that two code words that exchange must be fraternal code words, and whether occupied irrelevant with these two code words.If the code word of exchange is not ground floor (being that two sub-code trees are numbered exchange at this moment), the code word state of Ji Lu the ground floor corresponding with it exchanges by original order is whole so, and the ordered series of numbers of record code tree state is also done same transposing.For example for (XXXX2X1) and 12345678, shown in Figure 10 A, if with (2,3) and (2,4) exchange, then E-t record ordered series of numbers becomes (512) and 12347856.
Based on code tree optimum state and E-t notation, the present invention proposes dynamic code distributing method.When system has surplus to hold new calling, give new call distribution code word and keep the optimum state of code tree.Figure 14 shows the flow chart according to code distributing method of the present invention.
Two groups of data of hypothetical record are " S, a 1, a 2..., a k" and " b 1, b 2... " (step S1401).Here " S, a 1, a 2..., a k" represent whole code tree state, wherein " S " is system's residual capacity, a i∈ { a 1, a 2..., a kIt is occupied code word capacity; " b 1, b 2... " it is the numbering of the ground floor code word of code tree.
If receiving velocity is the new calling (step S1402) of t, compare S and t (step S1403), if (step S1403: "No"), then therefore the power system capacity deficiency cancels new the calling to S<t.If (step S1403: "Yes"), then system can support new the calling to insert to S 〉=t.Then, carry out following operation:
In step S1404, carry out divide operations: establish the surplus y of S/t=x, i.e. S=t * x+y, and 0≤y<t.
In step S1405, y judges to remainder.If y=0 is (step S1405: "Yes"), the residual capacity of the doubly new call capacity of integer x is arranged in the code tree of ground floor promptly, so can directly give new call distribution numbering (b S-t+1..., b S) pairing code word.
If y ≠ 0 (step S1405: "No"), then in step S1406, x is judged.
(step S1407: "Yes"), this moment, ground floor code assignment number was an odd number, then gave new call distribution numbering (b when x is odd number S-t-y+1..., b S-y) corresponding code word, allow the new calling code word change corresponding number then, with the optimum state (step S1408) of maintenance code tree with front t numbering.That is to say, with (b S-t-y+1..., b S-y) corresponding code assignment gives new the calling, t is exchanged with the numbering of the code word of its brother's sign indicating number.
On the other hand, (step S1407: "No"), this moment, the code assignment number of ground floor was an even number when x is even number.Then as can be known: owing to have subscript p, then y+a according to the character of E-t notation described later 1+ a 2+ ... + a pIf=t is a iTake the m that is numbered of code word correspondence i, i=1 then ... p redistributes to a iCode word be m ' iHere, if m i=b p, m ' then i=b P-tIf m i=(b p, b P+1...), m ' then i=(b P-t, b P-t+1...).Promptly code word a 1, a 2..., a kTo a left t unit.At last, with the numbering b of t ground floor code word Xt+1..., b Xt+tPairing code assignment is given new call out (step S1409).That is to say, suppose y+a 1+ a 2+ ... + a p=t is at first with a 1, a 2... code word redistribute, promptly to left t unit, will [b (xt+1) ..., b (xt+t)] and corresponding code word redistributes to new calling.
Through after the above-mentioned operation, system still keeps (puppet) optimum state, in this state, if come in new a calling, just be easy to code assignment, and the number of codewords that need redistribute also seldom.For four layers of code tree, have only when the code tree record case is 512 and 5111, when the speed of coming in is 2 code word, just carries out code word and redistribute.
Specifically, the E-t notation has following character, and establishing ordered series of numbers is (S, a 1, a 2..., a k), its code tree satisfies (puppet) optimum state, and power system capacity is 2 nThe time, this ordered series of numbers remaining number except first number all satisfies: if 2 m<2 n, and have a in the ordered series of numbers q=2 M1<2 m, 2 m| a 1+ a 2+ ... + a Q-1, then exist i to satisfy q≤i, a q+ ... + a i=2 mProof to this character is as follows.
Proof: to (m+1) layer, the capacity of each code word of this layer is 2 m, because a q<2 m, can find a qA capacity be 2 mFemale sign indicating number, so must have some subcodes of this mother's sign indicating number occupied, and occupied subcode capacity and be 2 m, so this character must be demonstrate,proved.
Provide example at various situations below.Figure 11 A~Figure 11 C is the schematic diagram of indication code allocation example 1; Figure 12 A~Figure 12 C is the schematic diagram of indication code allocation example 2; And Figure 13 A and Figure 13 B show the schematic diagram of yard allocation example 3.
In Figure 11 A~Figure 11 C, become the state of Figure 11 B by translation from the state of Figure 11 A, distribute the state that becomes Figure 11 C from the state of Figure 11 B by sign indicating number again.According to the example 1 of Figure 11 A~Figure 11 B, when the E-t of code tree notation be 512 (be S=5, a 1, a 2=1,2, the numbering b of code word correspondence 1, b 2..., b 8=1,2 ..., 8), it is the new calling of 2 (t) that there is a speed in system, make division 5/2=2 (x) and surplus 1 (y), y ≠ 0 then, x is an even number.Get 1 (y)+a according to algorithm 1=2 (t), thus subscript p=1, a 1The code word correspondence be numbered 6 (m 1)=(b 1, b P+1..., b P+5), then 4 (m ' 1)=(b 1-2, b 1-2+1..., b 1-2+5).Promptly this code word to the individual code word of left 2 (t).At last, (b 2 * 2+1, b 2 * 2+2)=(b 5, b 6) corresponding code word gives new the calling.The sign indicating number batch operation as shown in Figure 8.
In Figure 12 A~Figure 12 C, distribute the state that becomes Figure 12 B from the state of Figure 12 A by sign indicating number, become Figure 12 C by the exchange codeword number from Figure 12 B.According to the example 2 of Figure 12 A~Figure 12 C, similarly the E-t notation of code tree is 512, S=5, a 1, a 2=1,2, the numbering b of code word correspondence 1, b 2..., b 8=1,2 ..., 8 when system a speed is arranged is the new calling of 3 (t), make division 5/3=1 (x) and surplus 2 (y), y ≠ 0 then, x is an odd number.According to above-mentioned algorithm, be numbered (b for new call distribution 5-3-2+1, b 5-3-2+2, b 5-2=b 1, b 2, b 3) code word, and with its brother sign indicating number exchange codeword number, to keep the optimum attitude of code tree.The sign indicating number batch operation is shown in Figure 12 A~Figure 12 C.
Similarly, in Figure 13 A and Figure 13 B, distribute the state that becomes Figure 13 B from the state of Figure 13 A by sign indicating number.According to the example 3 of Figure 13 A and Figure 13 B, the E-t notation of code tree is 62, and is same, S=6, a 1=2, the numbering b of code word correspondence 1, b 2..., b 8=1,2 ..., 8, be the new calling of 2 (t) when there is a speed in system, make division 6/2=3 (x) and surplus 0 (y), then y=0.According to above-mentioned algorithm, be numbered (b directly for new call distribution 6-2+1, b 6=b 5, b 6) code word and need not to redistribute, the sign indicating number batch operation shown in Figure 13 A and Figure 13 B.
If power system capacity is 4R, it is the Poisson process of λ that intensity is obeyed in new calling, and obeying parameter the service time in system is the negative exponent distribution of μ.Calculating shows, if business load λ/μ=5, the dynamic code distributing method of proposition need not redistributed, and utilizes the algorithm of non-patent literature 5 need carry out redistributing for 50 times.As seen, compare with conventional method, the number of times that code distributing method of the present invention is redistributed seldom can reduce overhead.
Like this, according to the embodiment of the present invention, the problem that the code word that produces when supporting variable multimedia the application at system is blocked is carried out the low dynamic sign indicating number of complexity and is distributed, because the number of times of redistributing lacking very, and can reduce system loading.In addition, according to present embodiment,, can allow the MIMO-OFDM-CDM system have the ability that the multi-user inserts and the variable Rate multimedia messages transmits by using the OVSF spread spectrum.In addition, according to present embodiment, by using sphere decoding at receiving terminal, system can obtain the suboptimum capacity.In addition, according to present embodiment,, can provide complexity to be lower than the dynamic sign indicating number Distribution Calculation method of conventional method based on the optimum state and the E-t notation of code tree.
Although illustrated and described the present invention at exemplary embodiment, code distributing method of the present invention except that being applied to the MIMO-OFDM-CDM system, can be applied to all OVSF spread spectrum communication systems.That is to say, under the situation that does not break away from the spirit and scope of the present invention, can carry out various other change, replacement and interpolations.
The industry utilizability
The multi-rade wireless communications device that the present invention relates to and code distribution method are particularly useful for supporting many The user inserts and the MIMO-OFDM-CDM of variable Rate Transmitting of Multi-media Information communicates by letter.

Claims (7)

1. multi-rade wireless communications device comprises:
Allocation units, be divided into described occupied code word and the described ordered series of numbers that does not have the two-part optimum state of occupied code word with having kept occupied code word and the described related ordered series of numbers that does not have occupied code word among the code word group that the code tree of expression by tree structure hierarchically be associated by every kind of spread spectrum rate, having changed to;
Memory cell is stored the described ordered series of numbers of described optimum state; And
Spectrum-spreading unit is used the code word of distributing to new calling according to the described ordered series of numbers of the described optimum state of described cell stores, and the transmission data of giving described new calling are carried out spread processing.
2. multi-rade wireless communications device according to claim 1, wherein,
Described allocation units, change, so that, representing the described mark X that does not have an occupied code word simultaneously on the right side of described code tree, the digital convergence that becomes the number of using topological notation to represent described occupied code word concentrates on the described optimum state of described ordered series of numbers in the left side of described code tree.
3. multi-rade wireless communications device according to claim 2, wherein,
Described allocation units change to the described ordered series of numbers that the described numerical value that does not have a number of occupied code word of expression is attached to the beginning in left side.
4. multi-rade wireless communications device according to claim 1, wherein,
Described spectrum-spreading unit uses the code word of distributing by the spread spectrum mode of orthogonal variable spread spectrum rate to carry out described spread processing.
5. multi-rade wireless communications device according to claim 1, wherein,
Described allocation units change to described optimum state with the described mark that is expressed as the code word that hierarchically is associated by every kind of spread spectrum rate in the Wo Shier code tree of described code tree.
6. code distribution method may further comprise the steps:
Be divided into described occupied code word and the described ordered series of numbers that does not have the two-part optimum state of occupied code word with having kept occupied code word and the described related ordered series of numbers that does not have occupied code word among the code word group that the code tree of expression by tree structure hierarchically be associated by every kind of spread spectrum rate, having changed to;
Store the described ordered series of numbers of described optimum state; And
According to the described ordered series of numbers of the described optimum state of storing, give new the calling with code assignment.
7. code distribution method according to claim 6, wherein,
Change, so that, representing the described mark x that does not have an occupied code word simultaneously on the right side of described code tree, the digital convergence that becomes the number of using topological notation to represent described occupied code word concentrates on the described optimum state of described ordered series of numbers in the left side of described code tree.
CNA2005800405581A 2004-11-25 2005-11-25 Multi-rate wireless communication apparatus and code distributing method Pending CN101065919A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNA2005800405581A CN101065919A (en) 2004-11-25 2005-11-25 Multi-rate wireless communication apparatus and code distributing method

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CNA2004100955061A CN1780188A (en) 2004-11-25 2004-11-25 Multi-rate radio communication system and dynamic code distributing method
CN200410095506.1 2004-11-25
PCT/JP2005/021669 WO2006057334A1 (en) 2004-11-25 2005-11-25 Multi-rate wireless communication apparatus and code distributing method
CNA2005800405581A CN101065919A (en) 2004-11-25 2005-11-25 Multi-rate wireless communication apparatus and code distributing method

Publications (1)

Publication Number Publication Date
CN101065919A true CN101065919A (en) 2007-10-31

Family

ID=38965758

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA2005800405581A Pending CN101065919A (en) 2004-11-25 2005-11-25 Multi-rate wireless communication apparatus and code distributing method

Country Status (1)

Country Link
CN (1) CN101065919A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023016338A1 (en) * 2021-08-09 2023-02-16 维沃移动通信有限公司 Data transmission processing method and apparatus, communication device, and storage medium

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023016338A1 (en) * 2021-08-09 2023-02-16 维沃移动通信有限公司 Data transmission processing method and apparatus, communication device, and storage medium
CN115706691A (en) * 2021-08-09 2023-02-17 维沃移动通信有限公司 Data transmission processing method, device, communication equipment and storage medium

Similar Documents

Publication Publication Date Title
JPWO2006057334A1 (en) Multirate wireless communication apparatus and code distribution method
CN104852790B (en) For carrying out the method and apparatus of high speed data transfers in wireless communications
CN1122374C (en) Information communication system of multi-complex coding CDMA form
CN1943144B (en) Method of allocating uplink transmission channels in a communication system
CN1165446A (en) Technique for minimizing variance of inteference in packetized interference-limited wireless communication systems
US20060045000A1 (en) Time-frequency interleaved mc-cdma for quasi-synchronous systems
CN101218845B (en) Wireless communication base station apparatus, wireless communication mobile station apparatus and pilot signal sequence allocating method in multicarrier communication
CN1762117A (en) Method and apparatus for reducing co-channel interference in a communication system
AU2772901A (en) System for allocating resources in a communication system
CN106231666B (en) Federated resource distribution method in distributing antenna system based on efficiency
CN105763294B (en) Control information processing method and device
CN103947274A (en) Allocation method for control channel candidate number and blind detection frequency, base station and user equipment
CN1906872A (en) Code channel management in a wireless communications system
CN101465718A (en) Method and apparatus for mapping codeword current to layer in multi-input multi-output system
CN101841390A (en) Transmission channel coding and multiplexing method and bit level processor
CN1133337C (en) Resource allocation
CN1284805A (en) Method for dynamic allocation of channel code with different lengths in radio communication system
CN1237836C (en) System for transmitting paging indicator in pilot channel of radio telecommunication system
CN1365584A (en) Transmission method of words representing transmission parameters respectively allocated to mobile stations communicating with base station in mobile communication system
EP1637005B1 (en) Code channel management in a wireless communications system
CN101931501A (en) Method and device for determining size of transmission blocks
CN1306738C (en) Method for obtaining path with protective body in intelligent optical network
CN101065919A (en) Multi-rate wireless communication apparatus and code distributing method
CN101827400A (en) Method and system for transmitting channel quality indicator information
CN1606842A (en) Method for code re-allocation in telecommunication systems, related system and computer product

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Open date: 20071031