CN102118793A - Method and device for matching TBS - Google Patents

Method and device for matching TBS Download PDF

Info

Publication number
CN102118793A
CN102118793A CN2011100488666A CN201110048866A CN102118793A CN 102118793 A CN102118793 A CN 102118793A CN 2011100488666 A CN2011100488666 A CN 2011100488666A CN 201110048866 A CN201110048866 A CN 201110048866A CN 102118793 A CN102118793 A CN 102118793A
Authority
CN
China
Prior art keywords
tbs
search
tbssi
region
correspondence
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
CN2011100488666A
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.)
Datang Mobile Communications Equipment Co Ltd
Original Assignee
Datang Mobile Communications Equipment 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
Application filed by Datang Mobile Communications Equipment Co Ltd filed Critical Datang Mobile Communications Equipment Co Ltd
Priority to CN2011100488666A priority Critical patent/CN102118793A/en
Publication of CN102118793A publication Critical patent/CN102118793A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Communication Control (AREA)

Abstract

The invention discloses a method and a device for matching TBS (transport block size). A TBS set is divided into a plurality of search sections, and the search sections are in one-to-one correspondence with TBSSI (transport block size section index); the method comprises the following steps: determining the TBSSI corresponding to the input bit number; and searching the TBS closest to the input bit number from the TBS set according to the researching boundary corresponding to the determined TBSSI. Through the adoption of the method and the device, the cycle index and the comparison times in the search matching process are reduced, the amount of calculation of the processor is reduced, and the processing efficiency of the processor is improved.

Description

A kind of method and apparatus that mates TBS
Technical field
The present invention relates to communication technical field, particularly relate to the method and apparatus of a kind of TBS of coupling.
Background technology
IMT(International Mobile Telecom, international mobile communication)-2000 CDMA(Code Division Multiple Access, code division multiple access) TDD(Time Division Duplexing, time division duplex) in the system, the NodeB(base station) the MAC-hs(Media Access Control-hs in, the media interviews controlled entity) is responsible at each HSDPA(High Speed Downlink Packet Access, high speed downlink packet inserts) scheduling TTI(Transmission Time Interval, Transmission Time Interval) in, for selecting suitable eating dishes without rice or wine, each user who is scheduled sends MAC-hs PDU(Protocol Data Unit, protocol Data Unit), be HSDPA TB(Transport Block, transmission block).For the terminal of certain grade, the operable TBS(Transport Block of terminal Size, the transmission block size) is one group of discrete positive integer set of agreement regulation, each TBS and a TFRI(Transport Format Resource Indicator, the transport format resource indication), be the TBS index, corresponding one by one, NodeB is eating dishes without rice or wine to use the employed TBS of this data transfer of TFRI indicating terminal.
In 1.28 Mcps TDD systems, establishing k is TFRI, works as k=1,2 ..., 62 o'clock, TFRI and TBS(L k) between mapping relations shown in formula [1]:
Figure 2011100488666100002DEST_PATH_IMAGE001
……………………[1]
Wherein, L Min=240, p is the constant by the terminal grade decision.
When k=63,
If terminal HS-DSCH physical layer grade between 1 to 3, L k=2788;
If terminal HS-DSCH physical layer grade between 4 to 6, L k=5600;
If terminal HS-DSCH physical layer grade between 7 to 9, L k=8416;
If terminal HS-DSCH physical layer grade between 10 to 12, L k=11226;
If terminal HS-DSCH physical layer grade between 13 to 15, L k=14043.
In 3.84 Mcps TDD systems, establishing k is TFRI, works as k=1,2 ..., 510 o'clock, TFRI and TBS(L k) between mapping relations shown in formula [2]:
Figure 693386DEST_PATH_IMAGE002
……………………[2]
Wherein, L Min=57,
Figure 2011100488666100002DEST_PATH_IMAGE003
When k=511, L k=102000.
In 7.68 Mcps TDD systems, establishing k is TFRI, works as k=1,2 ..., 510 o'clock, TFRI and TBS(L k) between mapping relations shown in formula [3]:
Figure 485893DEST_PATH_IMAGE004
……………………[3]
Wherein, L Min=57,
Figure 2011100488666100002DEST_PATH_IMAGE005
When k=511, L k=204000.
At each TTI, the MAC-hs entity among the NodeB can calculate the bit number that the active user can send at this TTI according to the resource situation of current TTI and active user's factors such as channel quality
Figure 140996DEST_PATH_IMAGE006
Because
Figure 473889DEST_PATH_IMAGE006
Not necessarily belong to the TBS set of agreement regulation, therefore, need basis
Figure 163627DEST_PATH_IMAGE006
In the TBS of agreement regulation set T, mate and obtain
Figure 2011100488666100002DEST_PATH_IMAGE007
, make
Figure 861456DEST_PATH_IMAGE007
Satisfy And
Figure 2011100488666100002DEST_PATH_IMAGE009
With
Figure 140439DEST_PATH_IMAGE007
Be upper limit group MAC-hs PDU, the length of the MAC-hs PDU that does not comprise filling bit that can obtain sending , make
Figure 678047DEST_PATH_IMAGE010
Satisfy
Figure DEST_PATH_IMAGE011
But
Figure 307743DEST_PATH_IMAGE010
Not necessarily belong to T.Consider that the TB filling bit that will make final transmission minimizes, need with
Figure 982438DEST_PATH_IMAGE010
For input bit number search coupling in the TBS of agreement regulation set obtains , make
Figure 748717DEST_PATH_IMAGE012
Satisfy
Figure DEST_PATH_IMAGE013
And
Figure 865708DEST_PATH_IMAGE014
Be the final TBS that sends that eats dishes without rice or wine.
The process that has twice search coupling TBS in the above-mentioned flow process, the process of each search coupling TBS all are to seek one near the TBS of (being greater than or less than) this input bit number in the TBS of agreement regulation set according to input bit number (bit number to be matched).In present implementation, can set up one according to the TBS set of agreement regulation is the array of index with TFRI, by beginning to carry out recycle ratio from maximum TFRI, to realize the search coupling of TBS.
If the input bit number is TBS ', the TBS of TFRI=i correspondence is TBS(i in the TBS set), i=1,2 ... tfri Max, TBS(0)=0, the TBS that matches is TBS Match=TBS(tfri Match).Concrete coupling flow process may further comprise the steps as shown in Figure 1:
Step 101 is judged TBS 'Whether greater than TBS MaxIf judged result is for being that then execution in step 102; Otherwise, execution in step 103.
Step 102 writes down and returns tfri Match=tfri Max, TBS Match=TBS(tfri Max).
Step 103 is judged TBS 'Whether less than TBS(1), if judged result is for being that then execution in step 104; Otherwise, execution in step 105.
Step 104 writes down and returns tfri Match=0, TBS Match=0.
Step 105, initialization i=tfri Max
Step 106 is judged TBS 'Whether satisfy TBS(i-1) ﹤ TBS '≤ TBS(i), if judged result is that then execution in step 107; Otherwise, execution in step 108.
Step 107 makes i=i-1.
Need to prove, execute this step after, continue execution in step 106.
Step 108 judges whether to match near TBS 'Higher value, if judged result is for being that then execution in step 109; Otherwise, execution in step 110.
Step 109 writes down and returns tfri Match=i, TBS Match=TBS(i).
Step 110 writes down and returns tfri Match=i-1, TBS Match=TBS(i-1).
In realizing process of the present invention, the inventor finds prior art, and there are the following problems at least:
Because the search coupling that prior art realizes TBS by begin recycle ratio from maximum TFRI, cycle-index is linear growth along with the diminishing of TBS of reality transmission, that is, the actual TBS that sends is more little, counts TBS according to input bit 'The circulation and the number of comparisons that match these TBS needs are just many more.Particularly, count TBS when input bit 'Satisfy TBS(tfri Max-1) ﹤ TBS '≤ TBS(tfri Max) time, cycle-index I minimum, that is, and I Min=1; When input bit is counted TBS 'Satisfy TBS '=TBS(1) time, cycle-index I maximum, that is, and I Max=tfri MaxSimilarly, if by beginning the search coupling that recycle ratio realizes TBS from minimum TFRI, the change of the TBS that cycle-index also can send along with reality is big and be linear growth.Therefore, in the method for the search of existing realization TBS coupling, when gap between input bit number and the initial TBS of circulation was big, it was bigger to mate TBS required cycle-index and number of comparisons, makes that the processor calculating amount is bigger, and treatment effeciency is lower.
Summary of the invention
The object of the present invention is to provide the method and apparatus of a kind of TBS of coupling, to have reduced the cycle-index and the number of comparisons of search matching process, for this reason, the present invention adopts following technical scheme:
A kind of method of mating transmission block size TBS, the TBS set is divided into a plurality of regions of search, and the region of search is corresponding one by one with the big minizone of transmission block index TBSSI, and described method comprises:
Determine that input bit counts the TBSSI of correspondence;
According to the search border corresponding with the TBSSI that determines, search and the immediate TBS of described input bit number from described TBS set.
A kind of device that mates transmission block size TBS comprises:
Memory module is used to store the TBS set, and described TBS set is divided into a plurality of regions of search, and the region of search is corresponding one by one with the big minizone of transmission block index TBSSI;
Determination module is used for definite input bit and counts the TBSSI of correspondence;
Search module is used for according to the search border corresponding with the TBSSI that determines, search and the immediate TBS of described input bit number from described TBS set.
Embodiments of the invention comprise following advantage, according to the search border corresponding with the input bit value, search and the immediate TBS of input bit number from the TBS set, the cycle-index and the number of comparisons of search matching process have been reduced, reduce the operand of processor, improved the treatment effeciency of processor.Certainly, arbitrary product of enforcement embodiments of the invention might not need to reach simultaneously above-described all advantages.
Description of drawings
Fig. 1 is the method flow diagram of coupling TBS of the prior art;
Fig. 2 is the method flow diagram of the coupling TBS in the embodiment of the invention;
Fig. 3 is the schematic diagram of the optimized proportion of the cycle-index in the embodiment of the invention;
Fig. 4 is the structural representation of the device of the coupling TBS in the embodiment of the invention.
Embodiment
Defective at prior art, the embodiment of the invention has proposed the prioritization scheme of a kind of TBS of coupling, the TBS set of agreement regulation is divided into a plurality of regions of search, the TBSSI(Transport Block Size Section Index that the different regions of search is corresponding different, the big minizone of transmission block index), and each region of search with the search borderline phase corresponding.For a given input bit number, can calculate the region of search index that this input bit is counted correspondence, and from the TBS set, search for and the immediate TBS of input bit number according to the search border of this region of search index correspondence.
Below in conjunction with the accompanying drawing among the present invention, the technical scheme among the present invention is carried out clear, complete description, obviously, described embodiment is a part of embodiment of the present invention, rather than whole embodiment.Based on the embodiment among the present invention, the every other embodiment that those of ordinary skills are obtained under the prerequisite of not making creative work belongs to the scope of protection of the invention.
In the technical scheme of the embodiment of the invention, can set up the TBSSI of a plurality of regions of search and each region of search correspondence at agreement regulation TBS set in advance, the search border of determining each region of search correspondence according to the TBS in the TBS set and TFRI, and then set up the mapping table on TBSSI and search border.
Wherein, the search border can be maximum TBS or the corresponding TBS index of minimum TBS in the immediate non-NULL region of search of the region of search corresponding with this search border.When the TBSSI of the region of search of the TBSSI of above-mentioned non-NULL region of search great-than search border correspondence, this search border is the TBS index of the minimum TBS correspondence in the above-mentioned non-NULL region of search, promptly initial TFRI; As the TBSSI of above-mentioned non-NULL region of search correspondence during less than the TBSSI of search border correspondence, this search border is the TBS index of the maximum TBS correspondence in the above-mentioned non-NULL region of search, promptly stops TFRI.
Particularly, only have a T, the corresponding T of each the terminal capability grade in the 1.28 Mcps TDD systems for arbitrary given TBS set T(3.84 Mcps TDD system and 7.68 Mcps TDD systems), can set up N the region of search, that is,
Figure DEST_PATH_IMAGE015
,
Figure 585633DEST_PATH_IMAGE016
...,
Figure DEST_PATH_IMAGE017
, wherein:
N=n max?-n min+1……………………[4]
Figure 796166DEST_PATH_IMAGE018
?……………………[5]
Figure DEST_PATH_IMAGE019
……………………[6]
The region of search T of TBSSI=n n(n Min≤ n≤n Max) be L by the TBS(that satisfies following formula k) form:
Figure 400454DEST_PATH_IMAGE020
……………………[7]
That is,
Figure DEST_PATH_IMAGE021
?……………………[8]
Especially, can make T 0={ L 1,
Region of search T as TBSSI=n nDuring for nonempty set, establish T nAll L kIn, minimum k value is
Figure DEST_PATH_IMAGE023
, maximum k value is
Figure 665661DEST_PATH_IMAGE024
, for region of search T nThere is the region of search of a TBSSI=p in (may be empty set, also may be nonvoid set), make p be in 0≤p＜n scope near the TBSSI of n, and region of search T pBe nonempty set; Simultaneously, there is the region of search of a TBSSI=q, makes that q is n＜q≤n MaxIn+1 scope near the TBSSI of n, and region of search T qBe nonempty set.Region of search T nCorresponding search border can be initial TFRI, that is, and and region of search T qIn minimum TBS index; Also can be termination TFRI, that is, and region of search T pIn maximum TBS index, therefore, initial TFRI and the value that stops TFRI are:
Figure DEST_PATH_IMAGE025
……………………[9]
Wherein, Be initial TFRI,
Figure DEST_PATH_IMAGE027
Be to stop TFRI, then the mapping table of TBSSI and initial TFRI and termination TFRI be n → ( ,
Figure 958868DEST_PATH_IMAGE027
).
In setting up the process of above-mentioned mapping table, for given TBS set T, corresponding L Min, L 1, tfri Max,
Figure 249035DEST_PATH_IMAGE028
All known.
Particularly, for 1.28 Mcps TDD systems, L Min=L 1=240, tfri Max=63;
When terminal HS-DSCH physical layer grade 1 between 3 the time,
Figure 129266DEST_PATH_IMAGE028
=2788;
When terminal HS-DSCH physical layer grade 4 between 6 the time,
Figure 504884DEST_PATH_IMAGE028
=5600;
When terminal HS-DSCH physical layer grade 7 between 9 the time, =8416;
When terminal HS-DSCH physical layer grade 10 between 12 the time,
Figure 273436DEST_PATH_IMAGE028
=11226;
When terminal HS-DSCH physical layer grade 13 between 15 the time,
Figure 262252DEST_PATH_IMAGE028
=14043.
For 3.84 Mcps TDD systems, L Min=L 1=57, tfri Max=511,
Figure 125166DEST_PATH_IMAGE028
=102000.
For 7.68 Mcps TDD systems, L Min=L 1=57, tfri Max=511,
Figure 287157DEST_PATH_IMAGE028
=204000.
Be example with 1.28 Mcps TDD systems below, specifically describe the process of setting up of the mapping table of TBSSI and initial TFRI and termination TFRI, wherein, terminal HS-DSCH physical layer grade is between 13 to 15, and then the TBS set is as shown in table 1:
Table 1 TBS set
Figure DEST_PATH_IMAGE029
According to formula [4], [5], [6], can get
N=58-1+1=58
Figure 224020DEST_PATH_IMAGE030
Figure DEST_PATH_IMAGE031
Therefore, can set up 58 regions of search, i.e. T 1, T 2..., T 58, at the set of the TBS shown in the table 1, can each TBS be divided in the region of search according to formula [7], the region of search of dividing the TBSSI=n that obtains can be described as
Figure 383737DEST_PATH_IMAGE032
Especially, make T 0={ L 1=240 },
Figure DEST_PATH_IMAGE033
At the set of the TBS shown in the table 1, can be according to the L that calculates k/ L MinWith TBSSI be L with 63 TBS(in the TBS set k) be divided in 58 regions of search.For example, the region of search of TBSSI=3 comprises 5 TBS, that is, and and k=18,19,20,21,22.
The region of search with TBSSI=21 is an example, initial TFRI and the computational methods that stop TFRI can be specially: determine that two non-empty intervals near the region of search of TBSSI=21 are the region of search of TBSSI=20 and the region of search of TBSSI=23, promptly, p=20 and q=23, can determine that according to formula [7] the initial TFRI and the termination TFRI of the region of search of TBSSI=21 is respectively:
According to similar method, can calculate the initial TFRI of other regions of search and stop TFRI, the mapping table of TBSSI and initial TFRI and termination TFRI, as shown in table 2.
The mapping table of table 2 TBSSI and initial TFRI and termination TFRI
Figure DEST_PATH_IMAGE035
Figure 586714DEST_PATH_IMAGE036
The TBS set is divided into a plurality of regions of search, and determines in the region of search, to mate TBS after the initial TFRI and termination TFRI of each region of search correspondence.If the input bit number is L ', the TBS of TFRI=k correspondence is L in the TBS set k, wherein, k=1,2 ... tfri Max, TBS(0)=0, the TBS that matches is L Match=
Figure DEST_PATH_IMAGE039
Concrete coupling flow process may further comprise the steps as shown in Figure 2:
Step 201 is judged L 'Whether greater than
Figure 646385DEST_PATH_IMAGE028
If judged result is for being that then execution in step 202; Otherwise, execution in step 203.
Step 202 writes down and returns tfri Match=tfri Max,
Figure 483891DEST_PATH_IMAGE039
=
Figure 987685DEST_PATH_IMAGE028
Step 203 is judged L 'Whether less than L 1If judged result is for being that then execution in step 204; Otherwise, execution in step 205.
Step 204 writes down and returns tfri Match=0,
Figure 227036DEST_PATH_IMAGE039
=0.
Step 205 is determined L 'Corresponding TBSSI, and the initial TFRI of the region of search of TBSSI correspondence.
Particularly, can calculate TBSSI according to following formula:
Figure DEST_PATH_IMAGE041
Wherein, n 'Be TBSSI.
By searching TBSSI that sets up in advance and the mapping table of searching for the border, can determine corresponding initial TFRI.
For example, L '=5800 o'clock, corresponding TBSSI(promptly, n ') be:
By question blank 2, the initial TFRI that can determine the region of search of TBSSI=24 is 51.
Step 206 is initialized as initial TFRI with i.
Step 207 is judged L 'Whether satisfy L I-1﹤ L '≤ L iIf judged result is that then execution in step 208; Otherwise, execution in step 209.
Step 208 makes i=i-1.
Need to prove, execute this step after, continue execution in step 207.
Step 209 judges whether to match near L 'Two TBS in higher value, if judged result is for being that then execution in step 210; Otherwise, execution in step 211.
Step 210 writes down and returns tfri Match=i, L Match=L i
Step 211 writes down and returns tfri Match=i-1, L Match=L I-1
For example, L '=5800 o'clock, the region of search of determining was the region of search of TBSSI=24, and initial TFRI is 51, by question blank 1 L as can be known 51=6393, L 50=5987, L 49=5606, because L '=5800 do not satisfy L 50﹤ L '≤ L 51, and satisfy L 49﹤ L '≤ L 50, therefore, can match tfri by 2 circulations and 4 comparisons MatchAnd L MatchWhen needs match near the higher value among two TBS of L ', tfri Match=50 and L Match=5987; When needs match near L 'Two TBS in smaller value the time, tfri Match=49 and L Match=5606.
Need to prove that above-mentioned execution mode, is searched for and the immediate TBS of input bit number according to order from big to small as initial TBS index with initial TFRI from the TBS set; In other execution modes of the present invention, also can will stop TFRI, according to order search and the immediate TBS of input bit number from the TBS set from small to large as initial TBS index.
In addition, the step 201 in the above-mentioned execution mode is the preferred steps in the embodiment of the invention to step 204; In other execution modes of the present invention, also can not carry out above-mentioned steps, can realize goal of the invention of the present invention equally.In addition, the step 209 in the above-mentioned execution mode also is the preferred steps in the embodiment of the invention; In other execution modes of the present invention, also can judge whether to match near the smaller value among two TBS of L ', if then execution in step 211, otherwise, execution in step 210; Execution in step 209, but direct execution in step 210 or step 211 can realize goal of the invention of the present invention equally.
Embodiments of the invention comprise following advantage, according to the search border corresponding with the input bit value, search and the immediate TBS of input bit number from the TBS set, the cycle-index and the number of comparisons of search matching process have been reduced, reduce the operand of processor, improved the treatment effeciency of processor.Certainly, arbitrary product of enforcement embodiments of the invention might not need to reach simultaneously above-described all advantages.
For the advantage of the embodiment of the invention with respect to prior art is described vividerly, can define the optimized proportion of cycle-index=(the required circulation Ci of prior art coupling TBS Shuo the required cycle-index of – embodiment of the invention coupling TBS)/required cycle-index of prior art coupling TBS.For each TBS in the TBS set as shown in table 1, cycle-index, the required cycle-index of embodiment of the invention coupling TBS that prior art coupling TBS is required, and the optimized proportion such as the table 3 and shown in Figure 3 of corresponding cycle-index.
The optimized proportion table of table 3 cycle-index
Figure DEST_PATH_IMAGE043
Figure 663145DEST_PATH_IMAGE044
By table 3 and Fig. 3 as seen, along with reducing of TBS, the required cycle-index of prior art coupling TBS is linear growth, but the growth of the required cycle-index of embodiment of the invention coupling TBS is little.For most of TBS, with respect to prior art, the required cycle-index of embodiment of the invention coupling TBS all has significantly minimizing, and maximum can reduce by 96.22% cycle-index.For 3.84 Mcps TDD systems and 7.68 Mcps TDD systems, because the TBS set is bigger, the optimization effect of the embodiment of the invention can be more obvious.
According to the method for the coupling TBS that provides in the above-mentioned execution mode, the embodiment of the invention also provides the device of the method for using above-mentioned coupling TBS.
As shown in Figure 4, the structural representation for the device of the coupling TBS in the embodiment of the invention comprises:
Memory module 410 is used to store the TBS set, and this TBS set is divided into a plurality of regions of search, and the region of search is corresponding one by one with TBSSI.
Determination module 420 is used for definite input bit and counts the TBSSI of correspondence.
Search module 430 is used for according to the corresponding search border of determining with determination module 420 of TBSSI, search and the immediate TBS of input bit number from the TBS set.
Wherein, the TBS in the TBS set is corresponding one by one with the TBS index, searches for the border and be maximum TBS or the corresponding TBS index of minimum TBS in the immediate non-NULL region of search of the region of search corresponding with this search border.
When the TBSSI of the region of search of the TBSSI of above-mentioned non-NULL region of search great-than search border correspondence, this search border is the TBS index of the minimum TBS correspondence in this non-NULL region of search; Correspondingly, above-mentioned search module 430 specifically is used for the search border as initial TBS index, according to order search and the immediate TBS of input bit number from the TBS set from big to small.
As the TBSSI of above-mentioned non-NULL region of search correspondence during less than the TBSSI of search border correspondence, this search border is the TBS index of the maximum TBS correspondence in the non-NULL region of search; Correspondingly, above-mentioned search module 430 specifically is used for the search border as initial TBS index, according to order search and the immediate TBS of input bit number from the TBS set from small to large.
Said apparatus can further include:
Module 440 is set, is used in the following manner the TBS set being divided into a plurality of regions of search: determine the quantity of the region of search that the TBS set comprises and the TBSSI of each region of search correspondence; According to the TBSSI of each region of search correspondence, each TBS in the TBS set is divided in the corresponding region of search.
Particularly, the above-mentioned module 440 that is provided with can be calculated the quantity that TBS gathers the region of search that comprises according to following formula:
N=n max?-n min+1；
Figure 908313DEST_PATH_IMAGE046
；
Figure 674274DEST_PATH_IMAGE019
Wherein, N is the quantity that TBS gathers the region of search that comprises, L 1For the TBS index in the TBS set is 1 TBS, L MinBe constant, Be the maximum TBS in the TBS set;
Correspondingly, the above-mentioned module 440 that is provided with can will be less than or equal to n MaxAnd more than or equal to n MinInteger as the TBSSI of each region of search correspondence, the region of search T of TBSSI=n nSatisfy following formula:
Figure DEST_PATH_IMAGE047
；
Wherein, L kFor the TBS index in the TBS set is the TBS of k.
Above-mentioned determination module 420 specifically is used for calculating input bit according to following formula and counts the TBSSI of correspondence:
Figure 893214DEST_PATH_IMAGE040
Wherein, L 'Be input bit number, n 'For input bit is counted the TBSSI of correspondence, L MinBe constant.
Embodiments of the invention comprise following advantage, according to the search border corresponding with the input bit value, search and the immediate TBS of input bit number from the TBS set, the cycle-index and the number of comparisons of search matching process have been reduced, reduce the operand of processor, improved the treatment effeciency of processor.Certainly, arbitrary product of enforcement embodiments of the invention might not need to reach simultaneously above-described all advantages.
It will be appreciated by those skilled in the art that the module in the device among the embodiment can be distributed in the device of embodiment according to the embodiment description, also can carry out respective change and be arranged in the one or more devices that are different from present embodiment.The module of the foregoing description can be merged into a module, also can further split into a plurality of submodules.
Through the above description of the embodiments, those skilled in the art can be well understood to the present invention and can realize by the mode that software adds essential general hardware platform, can certainly pass through hardware, but the former is better execution mode under a lot of situation.Based on such understanding, the part that technical scheme of the present invention contributes to prior art in essence in other words can embody with the form of software product, this computer software product is stored in the storage medium, comprise that some instructions are with so that a station terminal equipment (can be mobile phone, personal computer, server, the perhaps network equipment etc.) carry out the described method of each embodiment of the present invention.
The above only is a preferred implementation of the present invention; should be pointed out that for those skilled in the art, under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be looked protection scope of the present invention.

Claims (14)

1. a method of mating transmission block size TBS is characterized in that, the TBS set is divided into a plurality of regions of search, and the region of search is corresponding one by one with the big minizone of transmission block index TBSSI, and described method comprises:
Determine that input bit counts the TBSSI of correspondence;
According to the search border corresponding with the TBSSI that determines, search and the immediate TBS of described input bit number from described TBS set.
2. the method for claim 1 is characterized in that, the TBS in the described TBS set is corresponding one by one with the TBS index;
In the following manner the TBS set is divided into a plurality of regions of search:
Determine the quantity of the region of search that described TBS set comprises and the TBSSI of each region of search correspondence;
According to the TBSSI of described each region of search correspondence, each TBS in the TBS set is divided in the corresponding region of search.
3. method as claimed in claim 2 is characterized in that, the quantity of the region of search that described definite TBS set comprises and the TBSSI of each region of search correspondence are specially:
Calculate the quantity that described TBS gathers the region of search that comprises according to following formula:
N=n max?-n min+1；
Figure 2011100488666100001DEST_PATH_IMAGE002
；
Figure 2011100488666100001DEST_PATH_IMAGE004
Wherein, N is the quantity that described TBS gathers the region of search that comprises, L 1For the TBS index in the described TBS set is 1 TBS, L MinBe constant,
Figure 2011100488666100001DEST_PATH_IMAGE006
Be the maximum TBS in the described TBS set;
The TBSSI of each region of search correspondence is for being less than or equal to n MaxAnd more than or equal to n MinInteger, the region of search T of TBSSI=n nSatisfy following formula:
Figure 2011100488666100001DEST_PATH_IMAGE008
Wherein, L kFor the TBS index in the described TBS set is the TBS of k.
4. method as claimed in claim 3 is characterized in that, described definite input bit is counted the TBSSI of correspondence, is specially:
Calculate the TBSSI that described input bit is counted correspondence according to following formula:
Figure 2011100488666100001DEST_PATH_IMAGE010
Wherein, L 'Be described input bit number, n 'Count the TBSSI of correspondence for described input bit.
5. the method for claim 1, it is characterized in that, TBS in the described TBS set is corresponding one by one with the TBS index, and described search border is maximum TBS or the corresponding TBS index of minimum TBS in the immediate non-NULL region of search of the region of search corresponding with described search border.
6. method as claimed in claim 5 is characterized in that, as the TBSSI of the described non-NULL region of search during greater than the TBSSI of the region of search of described search border correspondence, described search border is the TBS index of the minimum TBS correspondence in the described non-NULL region of search;
The search border that described basis is corresponding with the TBSSI that determines, search and the immediate TBS of described input bit number from described TBS set are specially:
, from described TBS set, search for and the immediate TBS of described input bit number as initial TBS index with described search border according to order from big to small.
7. method as claimed in claim 5 is characterized in that, as the TBSSI of described non-NULL region of search correspondence during less than the TBSSI of described search border correspondence, described search border is the TBS index of the maximum TBS correspondence in the described non-NULL region of search;
The search border that described basis is corresponding with the TBSSI that determines, search and the immediate TBS of described input bit number from described TBS set are specially:
, from described TBS set, search for and the immediate TBS of described input bit number as initial TBS index with described search border according to order from small to large.
8. a device that mates transmission block size TBS is characterized in that, comprising:
Memory module is used to store the TBS set, and described TBS set is divided into a plurality of regions of search, and the region of search is corresponding one by one with the big minizone of transmission block index TBSSI;
Determination module is used for definite input bit and counts the TBSSI of correspondence;
Search module is used for according to the search border corresponding with the TBSSI that determines, search and the immediate TBS of described input bit number from described TBS set.
9. device as claimed in claim 8 is characterized in that, the TBS in the described TBS set is corresponding one by one with the TBS index;
Described device also comprises:
Module is set, is used in the following manner the TBS set being divided into a plurality of regions of search:
Determine the quantity of the region of search that described TBS set comprises and the TBSSI of each region of search correspondence;
According to the TBSSI of described each region of search correspondence, each TBS in the TBS set is divided in the corresponding region of search.
10. device as claimed in claim 9 is characterized in that,
The described module that is provided with specifically is used for calculating the quantity that described TBS gathers the region of search that comprises according to following formula:
N=n max?-n min+1；
Figure 50960DEST_PATH_IMAGE002
；
Wherein, N is the quantity that described TBS gathers the region of search that comprises, L 1For the TBS index in the described TBS set is 1 TBS, L MinBe constant,
Figure 369126DEST_PATH_IMAGE006
Be the maximum TBS in the described TBS set;
To be less than or equal to n MaxAnd more than or equal to n MinInteger as the TBSSI of each region of search correspondence, the region of search T of TBSSI=n nSatisfy following formula:
Figure 225961DEST_PATH_IMAGE008
Wherein, L kFor the TBS index in the described TBS set is the TBS of k.
11. device as claimed in claim 10 is characterized in that, described determination module specifically is used for calculating the TBSSI that described input bit is counted correspondence according to following formula:
Figure 636214DEST_PATH_IMAGE010
Wherein, L 'Be described input bit number, n 'Count the TBSSI of correspondence for described input bit.
12. device as claimed in claim 8, it is characterized in that, TBS in the described TBS set is corresponding one by one with the TBS index, and described search border is maximum TBS or the corresponding TBS index of minimum TBS in the immediate non-NULL region of search of the region of search corresponding with described search border.
13. device as claimed in claim 12 is characterized in that, as the TBSSI of the described non-NULL region of search during greater than the TBSSI of the region of search of described search border correspondence, described search border is the TBS index of the minimum TBS correspondence in the described non-NULL region of search;
Described search module specifically is used for described search border as initial TBS index, according to order search and the immediate TBS of described input bit number from described TBS set from big to small.
14. device as claimed in claim 12 is characterized in that, as the TBSSI of described non-NULL region of search correspondence during less than the TBSSI of described search border correspondence, described search border is the TBS index of the maximum TBS correspondence in the described non-NULL region of search;
Described search module specifically is used for described search border as initial TBS index, according to order search and the immediate TBS of described input bit number from described TBS set from small to large.
CN2011100488666A 2011-03-01 2011-03-01 Method and device for matching TBS Pending CN102118793A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2011100488666A CN102118793A (en) 2011-03-01 2011-03-01 Method and device for matching TBS

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2011100488666A CN102118793A (en) 2011-03-01 2011-03-01 Method and device for matching TBS

Publications (1)

Publication Number Publication Date
CN102118793A true CN102118793A (en) 2011-07-06

Family

ID=44217347

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2011100488666A Pending CN102118793A (en) 2011-03-01 2011-03-01 Method and device for matching TBS

Country Status (1)

Country Link
CN (1) CN102118793A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019024696A1 (en) * 2017-08-04 2019-02-07 电信科学技术研究院有限公司 Method, apparatus and device for determining size of transmission block
CN111919465A (en) * 2018-04-05 2020-11-10 瑞典爱立信有限公司 Transport block size selection for early transmission of data

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1867168A (en) * 2005-08-12 2006-11-22 华为技术有限公司 Method for carrying out decode processing
CN101304545A (en) * 2007-05-08 2008-11-12 上海摩波彼克半导体有限公司 Method for reinforcing size collocation of special channel transmission block in the 3rd generation mobile communication
CN101415206A (en) * 2007-10-16 2009-04-22 上海摩波彼克半导体有限公司 Method for configuring down high speed sharing channel transmission block size of 3G mobile communication

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1867168A (en) * 2005-08-12 2006-11-22 华为技术有限公司 Method for carrying out decode processing
CN101304545A (en) * 2007-05-08 2008-11-12 上海摩波彼克半导体有限公司 Method for reinforcing size collocation of special channel transmission block in the 3rd generation mobile communication
CN101415206A (en) * 2007-10-16 2009-04-22 上海摩波彼克半导体有限公司 Method for configuring down high speed sharing channel transmission block size of 3G mobile communication

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019024696A1 (en) * 2017-08-04 2019-02-07 电信科学技术研究院有限公司 Method, apparatus and device for determining size of transmission block
CN109392100A (en) * 2017-08-04 2019-02-26 电信科学技术研究院 A kind of method, device and equipment of determining transport block size
CN109392100B (en) * 2017-08-04 2021-09-10 大唐移动通信设备有限公司 Method, device and equipment for determining size of transmission block
US11212703B2 (en) 2017-08-04 2021-12-28 Datang Mobile Communications Equipment Co., Ltd. Method, apparatus and equipment for determining transport block size
CN111919465A (en) * 2018-04-05 2020-11-10 瑞典爱立信有限公司 Transport block size selection for early transmission of data

Similar Documents

Publication Publication Date Title
CN105407486B (en) A kind of method and device of the network capacity extension
CN102752874B (en) The dispatching method of Physical Downlink Shared Channel and device
EP3306832B1 (en) Method for multi-point cooperation considering delay in wireless communication system
CN110149180B (en) Distribution method of search space channel estimation number and terminal equipment
CN113746677B (en) 5G new air interface-oriented network intra-slice resource allocation method
CN108684076B (en) A kind of uplink power distribution method and mobile communication equipment
CN108650709A (en) A kind of uplink power distribution method and mobile communication system
CN110972150A (en) Network capacity expansion method and device, electronic equipment and computer storage medium
CN109548161A (en) A kind of method, apparatus and terminal device of wireless resource scheduling
CN106598727B (en) A kind of computational resource allocation method and system of communication system
CN103974426B (en) Communication means and device and cordless communication network for cordless communication network
CN111511028B (en) Multi-user resource allocation method, device, system and storage medium
CN110084380A (en) A kind of repetitive exercise method, equipment, system and medium
CN103580836B (en) UE type reports, resource allocation methods and device, UE, base station
CN103533628B (en) A kind of downlink power distributing method
CN102118793A (en) Method and device for matching TBS
WO2017054631A1 (en) Resource configuration method and network device
CN105356980A (en) Response message sending method and device
CN107070620B (en) A kind of wireless communication system resource allocation methods and device
US20230085345A1 (en) Control information dci transmission method and related device
CN110191473B (en) Network capacity expansion method and device and computer readable storage medium
CN110831220A (en) Transport Block (TB) scheduling method and device
CN102821423A (en) Method and device for receiving messages
CN103747488B (en) carrier balancing method, device and system
CN103269519A (en) Method and system for allocating processing resource in centralized-type base station architecture

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C12 Rejection of a patent application after its publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20110706