CN1689259A - Code channel allocations in a wireless communications system - Google Patents
Code channel allocations in a wireless communications system Download PDFInfo
- Publication number
- CN1689259A CN1689259A CN 03824617 CN03824617A CN1689259A CN 1689259 A CN1689259 A CN 1689259A CN 03824617 CN03824617 CN 03824617 CN 03824617 A CN03824617 A CN 03824617A CN 1689259 A CN1689259 A CN 1689259A
- Authority
- CN
- China
- Prior art keywords
- sequence spreading
- sequence
- spreading
- available
- length
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
Systems and techniques are disclosed relating to communications. The systems and techniques involve spread-spectrum communications using a scheduler, or similar component, configured to maintain a plurality of spreading sequence assignments and a plurality of available spreading sequences each being orthogonal to the assigned spreading sequences. The scheduler may also be configured to select a spreading sequence from a group of the available spreading sequences having the same length, the selected spreading sequence being generated from a block of codes and being selected based on the number of the available spreading sequences that can be generated using the same block of codes.
Description
Require priority according to 35U.S.C. § 119
Present patent application requires the 60/409th, the priority of No. 528 interim patents, the latter is entitled as " CODECHANNEL ALLOCATIONS IN A WIRELESS COMMUNICATIONS SYSTEM ", submit on September 9th, 2002, be transferred to assignee of the present invention and incorporated herein by reference.
Background
Technical field
The present invention relates generally to communication, relate in particular to the system and the technology that are used in wireless communication system management code channel assignment.
Background technology
Modern communication system is designed to allow a plurality of users to share a common communications medium.A kind of such communication system is code division multiple access (CDMA) system.Cdma communication system is based on spread spectrum communication modulation and multiple access scheme.In cdma communication system, a large amount of signals are shared same frequency spectrum, and the result improves user capacity.This sends each signal by the different coding with modulation one carrier wave and realizes, thereby has expanded this signal on entire spectrum.The signal that is sent can be separated by correlator in receiver, and correlator uses respective coding to come de-spread expectation signal.The unmatched not desired signal of encoding only becomes noise.
In spread spectrum communication, base station controller (BSC) is commonly used to wireless network is connected to the communications infrastructure, such as wide area network (WAN) or Local Area Network.Wireless network comprises a plurality of base stations, and each all is configured to serve all users in the geographic area that is called the sub-district.In this configuration, in forward link, can use the orthogonal sequence that is called the Walsh sign indicating number separately to be operated in a plurality of users in the same cellular zone.Forward link is meant the signal transmission from the base station to user.
Along with the remarkable increase of past few years radio communication, for support that web browses, Video Applications or the like has required to the service of higher data rate.Usually, satisfy this demand by using a plurality of forward channels that traffic is sent to the user from the base station, each forward channel all has a different Walsh sign indicating number.Unfortunately, this method is tending towards introducing additional complexity in the subscriber equipment that requires the demodulation of a plurality of Walsh sign indicating number.
A kind of other method that is used to provide high data rate service has been avoided the complexity of a plurality of Walsh channels of demodulation, comprises the sequence spreading that use is derived from one or more Walsh sign indicating numbers.Yet in case used the Walsh sign indicating number, it just can not be used for generating a follow-up sequence spreading for lacking orthogonality once more.Thereby distribution needs a kind of effective method or algorithm for sequence spreading, avoids losing the required Walsh sign indicating number of structure higher speed channels.
Summary of the invention
In one aspect of the present invention, frequency spreading device comprises a scheduler, described scheduler is configured to keep a plurality of sequence spreadings and distributes and a plurality of available sequence spreading, a plurality of available sequence spreadings each all with the sequence spreading quadrature that is distributed, scheduler also is configured to from one group of available sequence spreading with equal length to select a sequence spreading, and selected sequence spreading generates and selects based on the number of the available sequence spreading that can generate with the same-code piece from an encoding block.
In the present invention on the other hand, one spread spectrum communication system device comprises and is used to keep that a plurality of sequence spreadings distribute and the device of a plurality of available sequence spreading, each of a plurality of available sequence spreadings all with the sequence spreading quadrature that is distributed, select the choice device of a sequence spreading with being used for from having the available sequence spreading of a group of equal length, the number of the available sequence spreading that selected sequence spreading generates and generates based on available same-code piece from an encoding block and selecting.
In that a further aspect of the present invention, a spread spectrum communication system device comprises and is used to keep that a plurality of sequence spreadings distribute and the device of a plurality of available sequence spreadings, each of a plurality of available sequence spreadings all with the sequence spreading quadrature that is distributed; Described device is selected a sequence spreading from one group of available sequence spreading with equal length, the number of the available sequence spreading that selected sequence spreading generates and generates based on available same-code piece from an encoding block and selecting.
Be appreciated that from following detailed description other embodiments of the invention will become more obvious for those skilled in the art, below describe in detail and only illustrate and described exemplary embodiment of the present invention by explanation.Can recognize that the present invention can have other and different embodiment, its detail can be made amendment in various others, and does not deviate from the spirit and scope of the present invention.Thereby accompanying drawing and detailed description should be regarded as coming down to illustrative, rather than restrictive.
Description of drawings
Each side of the present invention is illustrated by example, and does not add restriction, in the accompanying drawings:
Fig. 1 is the conceptual schema of cdma communication system;
Fig. 2 is the simplification functional block diagram of the basic subsystem of explanation cdma communication system;
Fig. 3 is the form of one 64 * 64 Walsh sign indicating number matrixes;
Fig. 4 is the synthetic concept map that the communication pipe with a plurality of Walsh sign indicating numbers is described;
Fig. 5 is the laminated tissue concept map of explanation from the sequence spreading of Walsh sign indicating number generation; And
Fig. 6 A-6C is the functional block diagram that is used for sequence spreading is distributed to a plurality of users' algorithm.
Describe in detail
The detailed description that proposes below in conjunction with accompanying drawing is the description of various embodiments of the present invention, rather than only represents the embodiment that the present invention can realize.Each embodiment that the present invention describes only is provided as example of the present invention or explanation, should not be regarded as more more preferred or favourable than other embodiment.Detailed description comprises and is used for thoroughly understanding detail of the present invention.Yet, it will be apparent to one skilled in the art that the present invention can not have these details and realizes.In some cases, be the notion of the present invention of avoiding confusion, known structure and equipment illustrate with the block diagram form.
Fig. 1 is the conceptual schema of cdma communication system.BSC 102 can be used to a wireless network 104 and is connected to the communications infrastructure 106, such as wide area network (WAN) or Local Area Network.Wireless network comprises a plurality of base station 108a-d, and each all is assigned to a cellular zone 110a-d.By the one or more base station 108a-d under BSC 102 control, subscriber station 112 can access communications infrastructure 106, perhaps communicates with other subscriber station (not shown).
Fig. 2 is the simplification functional block diagram of basic subsystem of the exemplary cdma communication system of key diagram 1.BSC102 comprises many selector elements, and a selector element 202 only is shown for simplicity.A selector element is exclusively used in by one or more base stations communicates by letter with each subscriber station.When starting a calling, call processing device 204 can be used to connect between selector element 202 and subscriber station 112.Scheduler 206 can distribute a Walsh sign indicating number to be identified at the forward link transmissions that subscriber station 112 is gone up in this connection to subscriber station 112 then.According to the data demand of subscriber station 112, scheduler can distribute a plurality of Walsh sign indicating numbers to support high data rate service to subscriber station 112.Perhaps, scheduler 206 can distribute a sequence spreading of deriving from a plurality of Walsh sign indicating numbers to subscriber station 112 in the mode that is described in further detail below.Be explanation the present invention, term " data " should be regarded as comprising the information of data, voice, video and/or any other type." distribution of Walsh sign indicating number " also should be regarded as comprising a Walsh sign indicating number distribution, the distribution of a plurality of Walsh sign indicating number and/or the sequence spreading of deriving from a plurality of Walsh sign indicating numbers.The Walsh sign indicating number distributes can be sent to subscriber station 112 from BSC 102, exchange of signaling message during call setup.
Selector element 202 is configured to receive data from the communications infrastructure 106.Then, selector element 202 can forward the data to each base station of communicating by letter with indication subscriber station 112.Base station 108 can comprise a data queue 208, and it is being sent to before the subscriber station 112 buffering from the data of selector element 202 by forward link.Data in the data queue 208 can be provided for element in channel 210.Element in channel 210 can provide various signal processing functions, such as convolutional encoding, with growing pseudo noise (PN) yard scramble of carrying out, interweave and modulating.Then, the modulated data that is produced is used the Walsh sign indicating number or the sequence spreading that are distributed to expand, is carried out quadrature modulation with the overhead channel combination and with short PN code.Short PN code is the coding of the second layer, and it is used for cellular zone is isolated from each other and comes.This method can be reused the Walsh sign indicating number in each cellular zone.The output of element in channel 210 can be provided for transmitter 212, before being transferred to subscriber station 112 by forward link via antenna 214 from base station 108, carries out filtering, amplification and up-conversion, becomes a carrier frequency.
The still distributed scheduling function of expectation central type is depended in the position of scheduler 206.For example, distributed scheduling scheme can use a scheduler in each base station.In this configuration, the Walsh sign indicating number that the scheduler of each base station is independent of in other cellular cell distributes, and determines the Walsh sign indicating number for the subscriber station in its cellular cell and distributes.On the contrary, the scheduling scheme of central type can use the single scheduler 206 among the BSC 102 to coordinate the Walsh sign indicating number distribution of a plurality of base stations.In either case, the Walsh sign indicating number that scheduler 206 all is responsible in the forward link distributes, so that support high data rate service and conventional voice service.
According to specific application and overall design requirement, scheduler 206 can be realized in many ways.In one embodiment, can distribute from determine the Walsh sign indicating number from the call origination request of subscriber station 112.When the user started a calling, when perhaps loading the application of originating call, subscriber station 112 can generate a call origination request, identifying user institute requested service type and required service quality.For example, call origination request can be represented that the user has started and requires the Video Applications of 64 kilobits per seconds.In this embodiment, call origination request can be sent to base station 108 from subscriber station 112 by control channel, and is provided for the scheduler 206 among the BSC 102.Then, scheduler 206 is made the Walsh sign indicating number based on this call origination request and other system restriction condition and is distributed, and described system restriction condition is distributed and/or other correlative factor such as the available maximum transmit power of: the quality of forward link, place, base station, the current Walsh sign indicating number of other subscriber station.The Walsh sign indicating number distributes can be provided for base station 108, and it is sent to subscriber station 112 by paging channel there.
The Walsh channel allocation can be made by the various algorithms of scheduler 206 usefulness.Algorithm can be optimised so that such Walsh channel allocation is provided: described Walsh channel allocation makes to the possibility minimum of subsequent subscriber stations restriction IA High Speed Channel distribution.For this notion is described, will this algorithm be described in conjunction with one 64 * 64 Walsh sign indicating number matrix.Yet the creative notion of describing among the present invention can be used with the Walsh sign indicating number matrix of any size.In addition, in order to wait other extended code to use, the variation of this algorithm be it will be apparent to those skilled in the art that with the PN sign indicating number.。
With reference to 64 * 64 Walsh sign indicating number matrixes shown in Figure 3, scheduler can distribute one of 64 different possible Walsh sign indicating numbers to subscriber station.In case distributed the Walsh sign indicating number, it just is not useable for distributing to other subscriber station in the same cellular cell.If the call origination request from subscriber station requires an IA High Speed Channel, then scheduler can be responded in many ways.Scheduler can distribute two or more available Walsh sign indicating numbers to transmit forward link data to subscriber station.Perhaps, scheduler can be derived the sequence spreading that shortens from a plurality of Walsh sign indicating numbers.By a sequence spreading that shortens is distributed to subscriber station, the Walsh sign indicating number that is used to derive this sequence spreading becomes unavailable.These Walsh sign indicating numbers are known as, and " virtual " distribute, although because they are not assigned to subscriber station technically, they are deleted from the category of available Walsh channel.For example, can construct by 32 chip common sequence from two Walsh sign indicating numbers are merged by the sequence spreading of 32 zero shortenings of forming.As shown in Figure 3, Walsh sign indicating number (W0) 302 and (W32) 304 each have by 32 the zero the highest effective chips of forming of public chip sequences conduct.Thereby 32 zero sequence spreading causes Walsh sign indicating number (W0) 302 and (W32) 304 virtual assigned.It is required that Walsh sign indicating number (W0) and virtual assigned (W32) are kept orthogonality.With the sequence spreading of this conceptual expansion, cause Walsh sign indicating number (W0) 302, (W16) 306, (W32) 304 and (W48) 308 virtual assigned to the shortenings of forming by 16 zero.
Fig. 4 is the schematic diagram of the Walsh code space of expression 32 * 32 Walsh sign indicating number matrixes.In order to further specify benefit and the effectiveness of use, will introduce the notion of communication pipe from the sequence spreading of the shortening of Walsh sign indicating number derivation.Use an independent pipeline to support from the base station to the forward-link communication of each subscriber station.For voice and low speed data application, from 32 * 32 Walsh sign indicating number matrixes, there are 32 pipelines to use.Each of 32 pipelines all uses a different Walsh sign indicating number with 32 chips to construct, and is defined as the 1x pipeline.The pipeline of higher capacity can be constructed with the sequence spreading of the shortening of deriving from a plurality of Walsh sign indicating numbers.For example, the sequence spreading of the shortening of being made up of 4 chips can be constructed from 8 Walsh sign indicating numbers shown in Figure 4.This high capacity pipe 402 is than the fast octuple of 1x pipeline (8x), but causes 8 Walsh sign indicating numbers by virtual assigned, and is not useable for distribution in the future.8x pipeline 402 can use separating pipe operation 408 to be divided into two 4x pipelines 404 and 406.Each 4x pipeline 404 and 406 comprises a sequence spreading that shortens, and the sequence spreading of this shortening is made up of 8 chips and from 4 Walsh sign indicating numbers structures, and the Walsh code space is 32/4 to be 8.On the contrary, by using merging 410, two 4x chips 404 of pipe operations and 406 can be merged back 8x pipeline 402.Yet if 8x pipeline 402 is distributed to subscriber station, two 4x pipelines 404 and 406 all are not useable for distributing in the future other subscriber station.In the mode that is described in further detail below, separating pipe operation and merging pipe operations can be used for optimizing the Walsh sign indicating number and distribute, so that make the possibility minimum of separating available high capacity pipe.Usually, the pipeline that its sequence spreading is derived from 2n Walsh sign indicating number can be divided into two less pipelines, and each all has the sequence spreading of deriving from 2n-1 Walsh sign indicating number.
For the separated and mode that merges on whole Walsh space encoder of open conduit furtherly, use tree structure shown in Figure 5 to show that in laminated tissue the Walsh code space is helpful.Tree structure comprises 2n+1 node with n+1 layer.Variable n can determine from following relational expression: the 2n=Walsh code length.For example, in 64 * 64 Walsh sign indicating number matrix, tree structure has 128 nodes of 7 layers.Top be root layer 502, node 516 is arranged, its expression has a 64x pipeline of the 1 chip sequence spreading of deriving from all 64 Walsh sign indicating numbers.The 64x pipeline can be divided into two 32x pipelines than low capacity, by two nodes, 518,520 expressions of the second layer 504.Each 32x pipeline at this layer place all has the 2 chip sequence spreadings of deriving from 32 Walsh sign indicating numbers.In a similar manner, the 3rd layer 506 comprises four 16x pipelines, and each all has the 4 chip sequence spreadings of deriving from 16 Walsh sign indicating numbers; Comprise eight 8x pipelines for the 4th layer 508, each all has the 8 chip sequence spreadings of deriving from 8 Walsh sign indicating numbers; Layer 5 510 comprises 16 4x pipelines, and each all has the 16 chip sequence spreadings of deriving from 4 Walsh sign indicating numbers; Layer 6 512 comprises 32 2x pipelines, and each all has the 32 chip sequence spreadings of deriving from 2 Walsh sign indicating numbers; Layer 7 514 comprises 64 1x pipelines, and each all has the Walsh sign indicating number of one 64 chips.
The Walsh sign indicating number can be carried out with various conventions to the distribution of node.One exemplary convention is made as " 0 " to the node at root layer 502 place.Each layer by tree structure down, the highest effective chip of each child node and father node keep identical value.Minimum effective chip of left side child node also keeps identical value with father node, and minimum effective chip of the right child node is assigned to the inverse value of father node.For example, at 502 layers, the value of node 516 is " 0 ", and the expression value is the 1 chip Walsh sign indicating number of " 0 ".At the second layer 504, the value of node 518 is " 00 ", and the value of node 520 is " 01 ".Each layer by tree can repeat similar pattern, and last one deck has 64 nodes, and each all has 64 different chip Walsh sign indicating numbers.
Distribute distribution to the Walsh sign indicating number of subscriber station corresponding to node in the tree structure.The algorithm that a kind of Walsh sign indicating number distributes can be realized according to specific program.At first, when distributing a node, be that the whole subtree of root all is marked as with this node be virtual assigned.Secondly, all to be marked as up to all father nodes of tree structure root be virtual assigned to the node that is distributed.Make the virtual assigned of these nodes in order to keep orthogonality.These nodes are also unavailable for the situation that lacks orthogonality.If with the termination of communicating by letter of subscriber station, then can in tree structure, discharge node to be used for distribution in the future.In addition, also can discharge with this node being the whole subtree of root and all virtual assigned that arrive its father node of tree structure root.
Then, this algorithm can be used to select a node in the lowermost layer of tree structure, and it can support the data rate requirement of subscriber station.If all nodes of this layer are all unavailable, algorithm just advances to next lower level so that the unappropriated node in front, location.This process continues, till selecting a node or this algorithm to determine there is not available node.Under the situation of a plurality of nodes that one deck in office can be used during algorithm identifies selection course, can distinguish priority to node and distribute arbitrarily preventing, distribution can cause the invalid deletion of node and the separation of high capacity pipe arbitrarily.Therefore, exemplary algorithm can be optimized the node distribution by distributing from the node of comparatively dense subtree.Just, when searching for the enabled node that in one deck, distributes, distinguish the priority of enabled node according to the density of distribution of their subtrees of living in.The subtree that has than the father node of overabsorption is the subtree of higher density, and its enabled node is compared with the node on the more not intensive subtree can be endowed higher priority.This priority based on density of distribution helps to reduce the separation that distributes the high-velocity duct that carries out by invalid Walsh sign indicating number.
Described an example of this process with reference to Fig. 5, Fig. 5 illustrates 64 Walsh sign indicating numbers of 514 layers, and each sequence spreading that can generate from the Walsh sign indicating number that is higher than each layer of 512,510,508,506,504 and 502.At first, if subscriber station requires a 4x pipeline, then can select a node of 510 layers, and it is distributed to this subscriber station.As mentioned above, 510 layers node generates from the Walsh sign indicating number that resides on the lowermost layer 514.For example, node 522 generates from a Walsh sign indicating number 524.Therefore if node 522 is assigned to subscriber station, then the Walsh sign indicating number of piece 524 shows as unavailablely, and should be marked as is virtual assigned.Equally, any node that one or more Walsh sign indicating numbers that can be from piece 524 generate, or generate separately or with other Walsh code combination, can be shown unavailable by the allocation table of node 522.Therefore, node 521,523,526,528,518 and 516 and piece 524 in all Walsh sign indicating numbers all should to be marked as be virtual assigned.
Then, if second a subscriber station request 16x pipeline for example, then 506 layers node can be selected, and be assigned to second subscriber station.Therefore should identify 506 layers locates one group of available node.Since the represented sequence spreading of node 528 can from Walsh code block 524 generate and the envoy put 528 unavailablely, therefore the unique enabled node on 506 layers can be a node 530,532 and 534.And in fact these nodes 530,532 and 534 each all represent the sequence spreading that can not generate from Walsh code block 524.
After having identified this group enabled node, can select one to be used for distributing to second subscriber station.Select to have avoided to distribute from the most highdensity subtree and separate high-velocity duct by invalid Walsh sign indicating number.By using this standard as seen, should select node 530 to avoid at 504 layers to the in addition segmentation of the 32x pipeline of node 520 expression.Can determine to select node 520 from the number of the unavailable node of its respective coding piece generation for each enabled node in this group by assessment.In other words,, determine the number of unavailable father node, and select the unavailable father node of maximum number to distribute to second subscriber station for each enabled node 530,532 and 534 on 506 layers.In this example, determine that then node 530 has 2 disabled father nodes (518 and 516); Node 532 has a disabled father node (520); And node 534 has a disabled father node (520).Node 530 has the unavailable node of maximum quantity that can generate from its corresponding Walsh code block 525, so node 530 is selected and be assigned to second subscriber station.Certainly, then all nodes of the sequence spreading that can the one or more Walsh sign indicating numbers from piece 525 generates of expression all should to be marked as be virtual assigned.
Fig. 6 A-6C is the FB(flow block) of explanation one exemplary algorithm, and this algorithm can be used for realizing in conjunction with the described basic conception of Fig. 5.As mentioned above, adopt this algorithm to distribute a pipeline, to support the forward-link communication from the base station to the subscriber station.This algorithm has three component parts.First component part 602 has identified available highest capacity pipe, and second component part 604 uses this pipeline in the mode of brief description.If the capacity of this pipeline exceeds the capacity requirement of subscriber station, second component part 604 is with regard to the suitable pipeline of the capacity requirement of search capacity and subscriber station.If the search of second component part is successful, then can distribute a pipeline to subscriber station.Otherwise, use the 3rd component part 606 to search for to use the separating pipe operation and have a pipeline of desired volume.
At square frame 608, the input of algorithm is the required pipe capacity of supporting from the base station to the subscriber station " j " of forward-link communication.By index variables " k " being made as index " N " and this algorithm of initialization at square frame 610 places.Because this component part of algorithm is the available highest capacity pipe of search, so index N is the top of Walsh code tree structure.For example, in one 64 * 64 Walsh sign indicating number matrix, tree structure has seven layers, and at top N=6.Whether at judgement frame 612, determining has any pipeline to use in anterior layer " k ".If this layer has a pipeline to use, then algorithm enters component part 604, and is as described below.Yet, if this layer does not have pipeline to use, in square frame 614, then reduce index variables, so that whether one deck has available pipe under checking in tree structure.Because " 0 " is the lowermost layer of tree structure, therefore at square frame 616, when the iterative process of duplicate test available pipe shown in arrow 618, these algorithm checks index variables are not less than " 0 ".If iteration proceeds to index variables are lower than " 0 " a bit, then algorithm determines not have pipeline can supply to distribute, and process stops at square frame 622.
As mentioned above, when having identified available highest capacity pipe, shown in arrow 624, algorithm enters component part 604.Should be noted that when having identified available highest capacity pipe, no matter whether the front was assigned with, all pipelines of creating from available highest capacity pipe by one or more separating pipe operations all are regarded as unavailable.Because to the higher capacity of a pipeline distribution ratio desired volume can be invalid, so component part 604 its capacity of search equal the pipeline of " j ".At first, at judgement frame 626, determine that required pipe capacity " j " is whether more than or equal to the index " k " of available highest capacity pipe.If then at square frame 628, the highest capacity pipe that algorithm is chosen in component part 602 places signs is supported the forward link transmissions between base station and the subscriber station, process stops at square frame 630.Otherwise, at square frame 632, index variables " n " are initialized as current index value " k ", and begin to search for pipeline than low capacity.At square frame 634, index " n " one deck that in tree structure, descends, at judgement frame 636, whether the index " n " of check displacement has crossed " 0 " layer of tree structure.If then the search capacity equals the pipeline failure of " j ", algorithm advances to component part 606 and carries out the separating pipe operation.Otherwise whether the pipeline at index " n " the layer place of algorithm after judgement frame 638 is determined displacement is available.If the pipeline of this layer is unavailable, then continue to determine with iterative manner, shown in arrow 640, up to find available than low capacity pipe till.Like this, determine at judgement frame 642 whether the pipeline at skew back index " n " layer place equals required pipe capacity " j ".If then at square frame 644 places, this pipeline is used for supporting the forward link transmissions between base station and the subscriber station.Otherwise, determine that at judgement frame 648 whether required pipe capacity " j " is less than the pipe capacity that is offset back index " n " layer place.If not, then algorithm advances to component part 606 and carries out separating pipe operation.Yet, be lower than the pipe capacity that is offset back index " n " layer place if determine required pipe capacity " j ", the currency of index " n " after square frame 650 is made as skew to index " k ", iterative search procedures begins once more at square frame 632.Like this, continue the pipeline that the search capacity equals " j ", till finding a pipeline or required pipe capacity to exceed the pipe capacity at skew back index " n " layer place.
Exceed in required pipe capacity " j " under the situation of skew back index " n " layer pipe capacity of locating, algorithm enters component part 606, and wherein its execution separating pipe operates in and creates less pipeline in the tree structure.At square frame 652, go up the operation of execution separating pipe at the layer of index " k " expression.At square frame 654, index " k " sends behind in tree structure, and at judgement frame 656, algorithm is determined required pipe capacity " j " whether equal the to be shifted separating pipe at back index " k " layer place.If, then one of separating pipe is distributed to subscriber station at square frame 658, algorithm stops at square frame 660.Otherwise shown in arrow 662, the separating pipe operation continues by iterative process, till finding capacity to equal the pipeline of " j ".
The realization of various illustrative logical block, module and the algorithm steps of describing in conjunction with embodiment as described herein or carry out and to use: general processor, digital signal processor (DSP), application-specific integrated circuit (ASIC) (ASIC), field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components or for carrying out the combination in any that function described here designs.General processor may be a microprocessor, yet or, processor can be processor, controller, microcontroller or the state machine of any routine.Processor also can realize with the combination of computing equipment, as, the combination of DSP and microprocessor, a plurality of microprocessor, in conjunction with one or more microprocessors of DSP kernel or other this configuration arbitrarily.
In the software module that the method for describing in conjunction with disclosed embodiment here or the step of algorithm may directly be included in the hardware, carried out by processor or in the middle of both.Software module may reside in the storage medium of RAM memory, flash memory, ROM memory, eprom memory, eeprom memory, register, hard disk, removable dish, CD-ROM or any other form as known in the art.The coupling of exemplary storage medium and processor makes that processor can be from read information, or information is write storage medium.Perhaps, storage medium can be integrated with processor.Processor and storage medium may reside among the ASIC.ASIC may reside in any position in the communication system.Perhaps, processor and storage medium may reside in the communication system as discrete component.
The description of above preferred embodiment makes those skilled in the art can make or use the present invention.The various modifications of these embodiment are conspicuous for a person skilled in the art, and Ding Yi General Principle can be applied among other embodiment and not deviate from the spirit or scope of the present invention here.Therefore, the embodiment that the present invention is not limited to illustrate here, and will meet and the principle and the novel feature the most wide in range consistent scope that disclose here.
Claims (21)
1. frequency spreading device comprises:
Scheduler, it is configured to keep a plurality of sequence spreadings and distributes and a plurality of available sequence spreading, each of described a plurality of available sequence spreadings all with the sequence spreading quadrature that is distributed, described scheduler also is configured to select a sequence spreading from one group of available sequence spreading with equal length, selected sequence spreading generates from an encoding block, and selects based on the number of the available sequence spreading that can generate with the same-code piece.
2. device as claimed in claim 1, it is characterized in that, the available sequence spreading of in described group each all generates from a different encoding block, and wherein said scheduler also is configured to select such sequence spreading: its minimized number with available its respective coding piece generation can be used sequence spreading.
3. device as claimed in claim 1, it is characterized in that, scheduler selects described sequence spreading to support transmission on the communication channel, described scheduler also is configured to: by at first determining length, then all the available sequence spreadings with described length are distributed to described group based on the capacity of communication channel, thereby determine one group of available sequence spreading.
4. device as claimed in claim 1 is characterized in that selected sequence spreading has a sequence, and its public part is from each coding in described.
5. device as claimed in claim 1 is characterized in that, described coding respectively comprises a Walsh sign indicating number.
6. device as claimed in claim 1, it is characterized in that, the available sequence spreading of in described group each all generates from a different encoding block, described scheduler also is configured to identify the available sequence spreading with shortest length in all available sequence spreadings, and selected sequence spreading is a sequence spreading from following group: the described group of encoding block certainly that generates need not generate the sequence spreading that is identified.
7. device as claimed in claim 1 is characterized in that also comprising a selector element, and it is configured to selected sequence spreading the communication of pointing to wireless device be expanded.
8. frequency spreading device comprises:
Scheduler, it is configured to keep a plurality of sequence spreadings and a plurality of available sequence spreading, each of a plurality of available sequence spreadings all with the sequence spreading quadrature that is distributed, described scheduler also is configured to identify the available sequence spreading of providing shortest length from all available sequence spreadings, determine target length and its length with the sign sequence spreading is compared, and the result selects an available sequence spreading based on the comparison.
9. device as claimed in claim 8 is characterized in that the length of selected sequence spreading is more than or equal to described target length.
10. device as claimed in claim 8 is characterized in that, described scheduler also is configured to: if target length is less than or equal to the length of the sequence spreading that identifies, then select the sequence spreading that identifies as selected sequence spreading.
11. device as claimed in claim 8, it is characterized in that, the sequence spreading that is identified generates from an encoding block, if target length is greater than the length of sign sequence spreading, then scheduler also is configured to: from available sequence spreading deletion can be from described those sequence spreadings of generating of at least one coding, if and the length of at least one remaining available sequence spreading equals target length, then from all the other available sequence spreadings, select described sequence spreading.
12. device as claimed in claim 8, it is characterized in that, the sequence spreading that is identified generates from an encoding block, if target length is greater than the length of sign sequence spreading, then scheduler also is configured to: from available sequence spreading deletion can be from described those sequence spreadings of generating of at least one coding, if and the length of all the other available sequence spreadings of neither one equals target length, then select one of deleted sequence spreading.
13. device as claimed in claim 8 is characterized in that, scheduler selects described sequence spreading to support that transmission on the communication channel, described scheduler also are configured to determine target length by the capacity of tolerance communication channel.
14. a frequency spreading device comprises:
Be used to keep that a plurality of sequence spreadings distribute and the device of a plurality of available sequence spreadings, each of described a plurality of available sequence spreadings all with the sequence spreading quadrature that is distributed; And
Be used for selecting the choice device of a sequence spreading from having the available sequence spreading of a group of equal length, selected sequence spreading generates from an encoding block, and based on selecting with the number of the available sequence spreading of same-code piece generation.
15. device as claimed in claim 14, it is characterized in that, the available sequence spreading of in described group each generates from a different encoding block, and described choice device is selected such sequence spreading: it has and can use sequence spreading with the minimized number that its corresponding encoded piece generates.
16. device as claimed in claim 14, it is characterized in that, select described sequence spreading to support transmission on the communication channel, described device also comprises such device, be used for: by at first determining length, then all the available sequence spreadings with described length are distributed to described group, thereby determine one group of available sequence spreading based on the capacity of communication channel.
17. device as claimed in claim 14 is characterized in that, selected sequence spreading has a sequence, and its public part is from each coding in described.
18. device as claimed in claim 14 is characterized in that, described coding respectively comprises a Walsh sign indicating number.
19. device as claimed in claim 14, it is characterized in that, the available sequence spreading of in described group each all generates from a different encoding block, described device also comprises such device, be used for: the available sequence spreading of providing shortest length from all available sequence spreading signs, selected sequence spreading is a sequence spreading from following group, and this group generates encoding block certainly need not generate the sequence spreading that is identified.
20. device as claimed in claim 14 is characterized in that also comprising the device that comes expanding communication with selected sequence spreading.
21. the method for a spread spectrum communication comprises:
Keep a plurality of sequence spreadings and distribute and a plurality of available sequence spreading, each of a plurality of available sequence spreadings all with the sequence spreading quadrature that is distributed; And
Select a sequence spreading from one group of available sequence spreading with equal length, selected sequence spreading generates from an encoding block, and based on selecting with the number of the available sequence spreading of same-code piece generation.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US40952802P | 2002-09-09 | 2002-09-09 | |
| US60/409,528 | 2002-09-09 | ||
| US10/645,697 | 2003-08-20 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1689259A true CN1689259A (en) | 2005-10-26 |
Family
ID=35306435
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 03824617 Pending CN1689259A (en) | 2002-09-09 | 2003-09-08 | Code channel allocations in a wireless communications system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1689259A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101911559B (en) * | 2008-01-14 | 2014-03-12 | 高通股份有限公司 | Resource allocation randomization |
| US8848913B2 (en) | 2007-10-04 | 2014-09-30 | Qualcomm Incorporated | Scrambling sequence generation in a communication system |
-
2003
- 2003-09-08 CN CN 03824617 patent/CN1689259A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8848913B2 (en) | 2007-10-04 | 2014-09-30 | Qualcomm Incorporated | Scrambling sequence generation in a communication system |
| CN101911559B (en) * | 2008-01-14 | 2014-03-12 | 高通股份有限公司 | Resource allocation randomization |
| US8787181B2 (en) | 2008-01-14 | 2014-07-22 | Qualcomm Incorporated | Resource allocation randomization |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4310272B2 (en) | OVSF code assignment | |
| CN1243426C (en) | Channel assigning device and method in CDMA communication system | |
| JP3317866B2 (en) | Spread spectrum communication system | |
| KR100279944B1 (en) | Method of walsh code allocation by group in cdma cellular system | |
| US9054788B2 (en) | Frequency hopping scheme for OFDMA system | |
| JP2009268115A (en) | Code channel assignment in wireless communication system | |
| CN1906872B (en) | Code channel management in a wireless communications system | |
| CN1284805A (en) | Method for dynamic allocation of channel code with different lengths in radio communication system | |
| CN1354928A (en) | Method and apparatus for assigning walsh codes | |
| EP1637005B1 (en) | Code channel management in a wireless communications system | |
| CN1133337C (en) | Resource allocation | |
| CN1640035A (en) | Method for assigning variable-length walsh codes for code division multiple access communications systems | |
| CN100596032C (en) | Method for allocating multiple basic intermediate codes | |
| CN1241345C (en) | Channelizing code resource dynamic optimization distribution method of wideband CDMA system | |
| CN1689259A (en) | Code channel allocations in a wireless communications system | |
| CN1197284C (en) | Method and device for transmission and construction of quasi orthogonal vectors | |
| CN1193627C (en) | Method for air interface to support variable data rate | |
| CN1588833A (en) | Distribution method for orthogonal variable frequency extension factor code | |
| CN1980108A (en) | Code-resource distribution method in CDMA communication system | |
| CN1929352B (en) | Distribution method for descending chain circuit OVSF code in SCDMA system | |
| CN101047462A (en) | Broadband CDMA multiple carrier frequency selecting method based on OVSF code | |
| KR100532308B1 (en) | Method of allocation walsh code for supporting high speed data service in code division multiple access communication system | |
| Shueh et al. | Optimum OVSF code reassignment in Wideband CDMA forward radio link | |
| KR100532344B1 (en) | Search method for idle resource of walsh code in mobile communication | |
| Wang et al. | New non-blocking EOVSF Codes for multi-rate WCDMA system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1081753 Country of ref document: HK |
|
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20051026 |
|
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: WD Ref document number: 1081753 Country of ref document: HK |