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
boundary
input bit
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

Method and device for matching TBS
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for matching TBS.
Background
In an IMT (International Mobile telecommunications) -2000 CDMA (Code Division Multiple Access) TDD (Time Division duplex) system, a MAC-hs (Media Access Control-hs) in a NodeB (base station) is responsible for selecting a suitable air interface for each scheduled user to transmit a MAC-hs PDU (Protocol Data Unit), i.e., HSDPA TB (Transport Block), in each HSDPA (High Speed Downlink Packet Access) scheduling TTI (Transmission Time Interval). For a terminal of a certain class, a TBS (Transport Block Size) that can be used by the terminal is a set of discrete positive integers specified by a protocol, each TBS corresponds to a TFRI (Transport Format Resource Indicator), that is, a TBS index, one to one, and a NodeB uses the TFRI to indicate the TBS used by the terminal for this data transmission.
In a 1.28 Mcps TDD system, let k be TFRI, when k =1, 2, …, 62, TFRI and TBS (L)k) The mapping relation between the two is shown as the formula [1 ]]Shown in the figure:
Figure 2011100488666100002DEST_PATH_IMAGE001
……………………[1]
wherein L ismin=240, p is a constant determined by the terminal rank.
When k = 63, the number of the bits is set to k = 63,
if the terminal HS-DSCH physical layer level is between 1 and 3, Lk=2788；
If the terminal HS-DSCH physical layer level is between 4 and 6, Lk=5600；
If the terminal HS-DSCH physical layer level is between 7 and 9, Lk=8416；
If the terminal HS-DSCH physical layer level is between 10 and 12, Lk=11226；
If the terminal HS-DSCH physical layer rank is between 13 and 15, Lk=14043。
In a 3.84 Mcps TDD system, let k be TFRI, when k =1, 2, …, 510, TFRI and TBS (L)k) The mapping relation between the two is shown as the formula [2 ]]Shown in the figure:
Figure 693386DEST_PATH_IMAGE002
……………………[2]
wherein L ismin=57，
Figure 2011100488666100002DEST_PATH_IMAGE003
；
When k =511, Lk = 102000。
In a 7.68 Mcps TDD system, let k be TFRI, when k =1, 2, …, 510, TFRI and TBS (L)k) The mapping relation between the two is shown as the formula [3 ]]Shown in the figure:
Figure 485893DEST_PATH_IMAGE004
……………………[3]
wherein L ismin=57，
Figure 2011100488666100002DEST_PATH_IMAGE005
；
When k =511, Lk = 204000。
In each TTI, the MAC-hs entity in NodeB will calculate the bit number that the current user can send in this TTI according to the resource situation of current TTI and the channel quality of current user
Figure 140996DEST_PATH_IMAGE006
. Due to the fact that
Figure 473889DEST_PATH_IMAGE006
Not necessarily in the TBS set specified by the protocol, and therefore, need to be based on
Figure 163627DEST_PATH_IMAGE006
Matching in a protocol-specified TBS set T
Figure 2011100488666100002DEST_PATH_IMAGE007
So that
Figure 861456DEST_PATH_IMAGE007
Satisfy the requirement ofAnd is
Figure 2011100488666100002DEST_PATH_IMAGE009
. To be provided with
Figure 140439DEST_PATH_IMAGE007
For the upper limit set of MAC-hs PDUs, the length of the transmitted MAC-hs PDU not including the padding bits can be derivedSo that
Figure 678047DEST_PATH_IMAGE010
Satisfy the requirement of
Figure DEST_PATH_IMAGE011
But do not
Figure 307743DEST_PATH_IMAGE010
Not necessarily T. Considering that the finally transmitted TB pad bits are to be minimized, it is necessary to minimize the number of TB padding bits
Figure 982438DEST_PATH_IMAGE010
Searching and matching in TBS set specified by protocol for input bit numberSo that
Figure 748717DEST_PATH_IMAGE012
Satisfy the requirement of
Figure DEST_PATH_IMAGE013
And is
Figure 865708DEST_PATH_IMAGE014
。I.e. the TBS finally sent by the air interface.
In the above procedure, there are two procedures for searching for a matching TBS, and each procedure for searching for a matching TBS is to find a TBS closest to (greater than or less than) an input bit number (the bit number to be matched) in a TBS set specified by a protocol according to the input bit number. In the current implementation, an array indexed by TFRI may be established according to the TBS set specified by the protocol, and the search matching of TBS may be implemented by performing a circular comparison from the maximum TFRI.
Let the input bit number be TBS′TBS corresponding to TFRI = i in the TBS set is TBS (i), i =1, 2, … TFRImaxTBS (0) =0, and the matched TBS is TBSmatch=TBS（tfrimatch). The specific matching process is shown in fig. 1, and comprises the following steps:
step 101, determining TBS′Whether greater than TBSmaxIf yes, executing step 102; otherwise, step 103 is performed.
Step 102, recording and returning tfrimatch =tfrimax，TBSmatch= TBS（tfrimax）。
Step 103, determine TBS′Whether TBS (1) is less than, if yes, execute step 104; otherwise, step 105 is performed.
Step 104, recording and returning tfrimatch =0，TBSmatch= 0。
Step 105, initialize i = tfrimax。
Step 106, determining TBS′Whether or not to satisfy TBS (i-1) fullfill′TBS is less than or equal to (i), if the judgment result is negative, the step 107 is executed; otherwise, step 108 is performed.
Step 107, let i = i-1.
After the present step is executed, the step 106 is continuously executed.
Step 108, determine whether the closest TBS needs to be matched′If yes, go to step 109; otherwise, step 110 is performed.
Step 109, record and return tfrimatch =i，TBSmatch= TBS（i）。
Step 110, recording and returning tfrimatch =i-1，TBSmatch= TBS（i-1）。
In the process of implementing the invention, the inventor finds that the prior art has at least the following problems:
since the prior art implements search matching of TBS by cyclic comparison starting from the maximum TFRI, the number of cycles increases linearly as the actually transmitted TBS becomes smaller, i.e., the TBS actually transmitted becomes smaller, the TBS is based on the input bit number′The more cycles and comparisons are required to match to the TBS. Specifically, when the bit number TBS is input′Satisfy TBS (tfri)max -1）﹤ TBS′≤TBS（tfrimax) When the number of cycles I is minimal, i.e. Imin= 1; when the input bit number TBS′Satisfy TBS′In case of = TBS (1), the number of cycles I is maximal, i.e. Imax= tfrimax. Similarly, if search matching of TBS is achieved by circular comparison starting from the minimum TFRIThe number of cycles also increases linearly with the larger TBS actually transmitted. Therefore, in the conventional method for implementing TBS search matching, when the difference between the input bit number and the TBS at the start of the loop is large, the loop times and comparison times required for matching the TBS are large, so that the processor has a large computation amount and low processing efficiency.
Disclosure of Invention
The invention aims to provide a method and a device for matching TBS, which aim to reduce the cycle times and the comparison times of the search matching process, and for this purpose, the invention adopts the following technical scheme:
a method of matching a transport block size, TBS, a TBS set divided into a plurality of search intervals, the search intervals corresponding one-to-one to transport block size, inter-cell, indices, TBSSI, the method comprising:
determining TBSSI corresponding to the input bit number;
and searching the TBS closest to the input bit number from the TBS set according to the search boundary corresponding to the determined TBSSI.
An apparatus for matching a transport block size, TBS, comprising:
the system comprises a storage module, a transmission block size distribution module and a transmission block size distribution module, wherein the storage module is used for storing a TBS set, the TBS set is divided into a plurality of search intervals, and the search intervals correspond to the transmission block size distribution index TBSSI one by one;
the determining module is used for determining the TBSSI corresponding to the input bit number;
and the searching module is used for searching the TBS closest to the input bit number from the TBS set according to the searching boundary corresponding to the determined TBSSI.
Embodiments of the present invention include advantages of searching for a TBS closest to an input bit number from a TBS set according to a search boundary corresponding to an input bit value, reducing the number of cycles and comparisons of a search matching process, reducing the amount of computation of a processor, and improving the processing efficiency of the processor. Of course, it is not necessary for any product that implements an embodiment of the invention to achieve all of the above-described advantages at the same time.
Drawings
Fig. 1 is a flow chart of a method for matching TBS in the prior art;
fig. 2 is a flowchart of a method for matching TBS according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of an optimized proportion of cycle times in an embodiment of the present invention;
fig. 4 is a schematic structural diagram of an apparatus for matching TBS according to an embodiment of the present invention.
Detailed Description
Aiming at the defects of the prior art, the embodiment of the invention provides an optimization scheme for matching TBS, which divides a TBS set specified by a protocol into a plurality of search intervals, wherein different search intervals correspond to different TBSSI (Transport Block Size selection Index), and each search interval corresponds to a search boundary. For a given input bit number, a search interval index corresponding to the input bit number can be calculated, and the TBS closest to the input bit number is searched from the TBS set according to a search boundary corresponding to the search interval index.
The technical solution of the present invention will be described clearly and completely with reference to the accompanying drawings, and it should be understood that the described embodiments are a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
In the technical scheme of the embodiment of the invention, a plurality of search intervals and TBSSIs corresponding to each search interval can be pre-established for a protocol specified TBS set, a search boundary corresponding to each search interval is determined according to the TBS and the TFRI in the TBS set, and a mapping table of the TBSSI and the search boundary is further established.
The search boundary may be a TBS index corresponding to a maximum TBS or a minimum TBS in a non-empty search interval closest to a search interval corresponding to the search boundary. When the TBSSI of the non-empty search interval is greater than the TBSSI of the search interval corresponding to the search boundary, the search boundary is the TBS index corresponding to the minimum TBS in the non-empty search interval, namely the initial TFRI; and when the TBSSI corresponding to the non-empty search interval is smaller than the TBSSI corresponding to the search boundary, the search boundary is the TBS index corresponding to the maximum TBS in the non-empty search interval, namely the termination TFRI.
Specifically, for any given TBS set T (only one T for a 3.84 Mcps TDD system and a 7.68 Mcps TDD system, one T for each terminal capability level in a 1.28 Mcps TDD system), N search intervals may be established, i.e.,
Figure DEST_PATH_IMAGE015
，
Figure 585633DEST_PATH_IMAGE016
，…，
Figure DEST_PATH_IMAGE017
wherein:
N=nmax -nmin+1……………………[4]
Figure 796166DEST_PATH_IMAGE018
……………………[5]
Figure DEST_PATH_IMAGE019
……………………[6]
search interval T of TBSSI = nn（nmin≤n≤nmax) From TBS (i.e., L) satisfying the following formulak) Consists of the following components:
Figure 400454DEST_PATH_IMAGE020
……………………[7]
that is to say that the first and second electrodes,
Figure DEST_PATH_IMAGE021
……………………[8]
in particular, T may be0 =｛L1｝，。
Search interval T when TBSSI = nnWhen the collection is non-empty, set TnAll of LkIn (1), the minimum k value is
Figure DEST_PATH_IMAGE023
Maximum k value of
Figure 665661DEST_PATH_IMAGE024
For search interval Tn(may be an empty set or a non-empty set), there is a search interval of TBSSI = p such that p is the TBSSI closest to n in the range of 0 ≦ p < n, and the search interval T ispIs a non-empty set; meanwhile, a search interval of TBSSI = q exists, so that q is n < q ≦ nmaxTBSSI closest to n in +1 range, and search interval TqIs a non-empty set. Search interval TnThe corresponding search boundary may be the starting TFRI, i.e. the search interval TqMinimum TBS index of (1); it is also possible to terminate the TFRI, i.e.,search interval TpThe maximum TBS index in (1), therefore, the values of the starting TFRI and the terminating TFRI are:
Figure DEST_PATH_IMAGE025
……………………[9]
wherein,in order to start the TFRI,
Figure DEST_PATH_IMAGE027
for terminating TFRI, the mapping table of TBSSI to the starting TFRI and the terminating TFRI is n → [ ((，
Figure 958868DEST_PATH_IMAGE027
）。
In the process of establishing the mapping table, for a given TBS set T, corresponding Lmin、L1、tfrimax、
Figure 249035DEST_PATH_IMAGE028
Are all known.
Specifically, for a 1.28 Mcps TDD system, Lmin=L1=240，tfrimax=63；
When the terminal HS-DSCH physical layer level is between 1 and 3,
Figure 129266DEST_PATH_IMAGE028
= 2788；
when the terminal HS-DSCH physical layer level is between 4 and 6,
Figure 504884DEST_PATH_IMAGE028
= 5600；
when the terminal HS-DSCH physical layer level is between 7 and 9,= 8416；
when the terminal HS-DSCH physical layer level is between 10 and 12,
Figure 273436DEST_PATH_IMAGE028
= 11226；
when the terminal HS-DSCH physical layer rank is between 13 and 15,
Figure 262252DEST_PATH_IMAGE028
= 14043。
for 3.84 Mcps TDD systems, Lmin=L1=57，tfrimax=511，
Figure 125166DEST_PATH_IMAGE028
= 102000。
For 7.68 Mcps TDD systems, Lmin=L1=57，tfrimax=511，
Figure 287157DEST_PATH_IMAGE028
= 204000。
Taking 1.28 Mcps TDD system as an example, the process of establishing the mapping table between the TBSSI and the start TFRI and the end TFRI is specifically described below, where the terminal HS-DSCH physical layer level is between 13 and 15, and the TBS set is shown in table 1:
table 1 TBS set
Figure DEST_PATH_IMAGE029
According to the formulas [4], [5] and [6], the compound can be obtained
N=58-1+1=58
Figure 224020DEST_PATH_IMAGE030
Figure DEST_PATH_IMAGE031
Thus, 58 search intervals, T, may be established1 ，T2 ，…，T58 For the TBS set shown in Table 1, the equation [7] can be used]Each TBS is divided into a search interval, and the divided search interval with TBSSI = n can be described as
Figure 383737DEST_PATH_IMAGE032
In particular, let T0 =｛L1=240｝，
Figure DEST_PATH_IMAGE033
For the TBS set shown in Table 1, the calculated L can be usedk/LminAnd TBSSI 63 TBSs (i.e., L) in the TBS setk) Divided into 58 search intervals. For example, a search interval of TBSSI =3 contains 5 TBSs, i.e., k =18, 19, 20, 21, 22.
Taking the search interval of TBSSI =21 as an example, the calculation method of the starting TFRI and the terminating TFRI may be specifically: determining two non-null intervals closest to the search interval of TBSSI =21 as a search interval of TBSSI =20 and a search interval of TBSSI =23, i.e., p =20 and q =23, and determining the starting TFRI and the terminating TFRI of the search interval of TBSSI =21 as follows according to equation [7 ]:
in a similar way, the mapping tables of the start TFRI and the end TFRI, the TBSSI and the start TFRI and the end TFRI of other search intervals can be calculated, as shown in table 2.
Table 2 mapping table of TBSSI to start and stop TFRI
Figure DEST_PATH_IMAGE035
Figure 586714DEST_PATH_IMAGE036
After dividing the TBS set into a plurality of search intervals and determining a start TFRI and an end TFRI corresponding to each search interval, the TBS may be matched in the search intervals. Let the input bit number be L′The TBS corresponding to TFRI = k in the TBS set is LkWherein k =1, 2, … tfrimaxTBS (0) =0, and the matched TBS is Lmatch=
Figure DEST_PATH_IMAGE039
. The specific matching process is shown in fig. 2, and includes the following steps:
step 201, judging L′Whether or not greater than
Figure 646385DEST_PATH_IMAGE028
If yes, go to step 202; otherwise, step 203 is executed.
Step 202, record and return tfrimatch =tfrimax，
Figure 483891DEST_PATH_IMAGE039
=
Figure 987685DEST_PATH_IMAGE028
。
Step 203, judge L′Whether or not less than L1If yes, go to step 204; otherwise, step 205 is performed.
Step 204, recording and returning tfrimatch =0，
Figure 227036DEST_PATH_IMAGE039
= 0。
Step 205, determine L′The corresponding TBSSI, and the starting TFRI of the search interval corresponding to the TBSSI.
Specifically, TBSSI may be calculated according to the following formula:
Figure DEST_PATH_IMAGE041
wherein n is′Is TBSSI.
The corresponding starting TFRI can be determined by looking up a mapping table of the TBSSI and the search boundary established in advance.
For example, L′When =5800, the corresponding TBSSI (i.e., n)′) Comprises the following steps:
by referring to table 2, the starting TFRI of the search interval of TBSSI =24 can be determined to be 51.
In step 206, i is initialized to the starting TFRI.
Step 207, judge L′Whether or not L is satisfiedi-1﹤ L′≤LiIf the judgment result is no, go to step 208; otherwise, step 209 is performed.
Step 208, let i = i-1.
After the present step is executed, the step 207 is continued.
Step 209, determine if it needs to match to the nearest L′If the determination result is yes, go to step 210; otherwise, step 211 is executed.
Step 210, recording and returning tfrimatch =i，Lmatch= Li。
Step 211, record and return tfrimatch =i-1，Lmatch= Li-1。
For example, L′If =5800, the specified search interval is TBSSI =24, and the starting TFRI is 51, and L is known from the lookup table 151=6393，L50=5987，L49=5606, due to L′=5800 unsatisfied with L50﹤L′≤L51 To satisfy L49﹤L′≤L50Thus tfri can be matched by 2 cycles and 4 comparisonsmatchAnd Lmatch. Tfri when a match to the larger of the two TBSs closest to L' is requiredmatch=50 and Lmatch= 5987; when it is required to match to the nearest L′At the lower of the two TBSs of (1), tfrimatch=49 and Lmatch=5606。
In the above embodiment, the starting TFRI is used as the initial TBS index, and the TBS closest to the input bit number is searched from the TBS set in descending order; in another embodiment of the present invention, the TBS closest to the input bit number may be searched from the TBS set in descending order using the terminating TFRI as the initial TBS index.
In addition, steps 201 to 204 in the above embodiment are preferable in the embodiment of the present invention; in other embodiments of the present invention, the above steps may not be performed, and the object of the present invention can be achieved as well. Further, step 209 in the above embodiment is also a preferable step in the embodiment of the present invention; in other embodiments of the present invention, it may also be determined whether a smaller value of the two TBSs closest to L' needs to be matched, if yes, step 211 is executed, otherwise, step 210 is executed; step 209 may not be executed, and step 210 or step 211 may be directly executed, so that the object of the present invention can be achieved.
Embodiments of the present invention include advantages of searching for a TBS closest to an input bit number from a TBS set according to a search boundary corresponding to an input bit value, reducing the number of cycles and comparisons of a search matching process, reducing the amount of computation of a processor, and improving the processing efficiency of the processor. Of course, it is not necessary for any product that implements an embodiment of the invention to achieve all of the above-described advantages at the same time.
To more clearly illustrate the advantages of embodiments of the present invention over the prior art, an optimized ratio of the number of cycles = (number of cycles required for prior art matching of TBS-number of cycles required for embodiments of the present invention matching of TBS)/number of cycles required for prior art matching of TBS may be defined. For each TBS in the TBS set as shown in table 1, the optimization ratios of the cycle number required for the prior art TBS matching, the cycle number required for the TBS matching in the embodiments of the present invention, and the corresponding cycle number are shown in table 3 and fig. 3, for example.
TABLE 3 optimization proportion table of cycle times
Figure DEST_PATH_IMAGE043
Figure 663145DEST_PATH_IMAGE044
As can be seen from table 3 and fig. 3, as the TBS is decreased, the number of cycles required for matching the TBS in the prior art increases linearly, but the number of cycles required for matching the TBS in the embodiment of the present invention does not increase much. For most TBSs, the number of cycles required to match the TBSs in the embodiments of the present invention is greatly reduced, and the maximum number of cycles can be reduced by 96.22%, compared to the prior art. For 3.84 Mcps TDD systems and 7.68 Mcps TDD systems, the optimization effect of the embodiment of the present invention is more obvious due to the larger TBS set.
According to the method for matching TBS provided in the foregoing embodiment, an embodiment of the present invention further provides an apparatus applying the method for matching TBS.
As shown in fig. 4, a schematic structural diagram of an apparatus for matching TBS in the embodiment of the present invention includes:
the storage module 410 is configured to store a TBS set, where the TBS set is divided into a plurality of search intervals, and the search intervals correspond to TBSSI one to one.
The determining module 420 is configured to determine the TBSSI corresponding to the input bit number.
A searching module 430, configured to search the TBS closest to the input bit number from the TBS set according to the search boundary corresponding to the TBSSI determined by the determining module 420.
The TBS in the TBS set corresponds to the TBS indexes one by one, and the search boundary is the TBS index corresponding to the maximum TBS or the minimum TBS in the non-empty search interval closest to the search interval corresponding to the search boundary.
When the TBSSI of the non-empty search interval is greater than the TBSSI of the search interval corresponding to the search boundary, the search boundary is the TBS index corresponding to the minimum TBS in the non-empty search interval; accordingly, the searching module 430 is specifically configured to search for the TBS closest to the input bit number from the TBS set in descending order with the search boundary as the initial TBS index.
When the TBSSI corresponding to the non-empty search interval is smaller than the TBSSI corresponding to the search boundary, the search boundary is the TBS index corresponding to the maximum TBS in the non-empty search interval; accordingly, the searching module 430 is specifically configured to search for the TBS closest to the input bit number from the TBS set in descending order with the search boundary as the initial TBS index.
The above apparatus may further comprise:
a setting module 440 configured to divide the TBS set into a plurality of search intervals by: determining the number of search intervals contained in the TBS set and the TBSSI corresponding to each search interval; and dividing each TBS in the TBS set into corresponding search intervals according to the TBSSI corresponding to each search interval.
Specifically, the setting module 440 may calculate the number of search intervals included in the TBS set according to the following formula:
N=nmax -nmin+1；
Figure 908313DEST_PATH_IMAGE046
；
Figure 674274DEST_PATH_IMAGE019
where N is the number of search intervals included in the TBS set, L1For TBS index of 1 in TBS set, LminIs a constant number of times, and is,the maximum TBS in the TBS set;
accordingly, the setup module 440 may be less than or equal to nmaxAnd is greater than or equal to nminIs taken as TBSSI corresponding to each search interval, and the search interval T of TBSSI = nnThe following formula is satisfied:
Figure DEST_PATH_IMAGE047
；
wherein L iskTBS with k is indexed for the TBS in the TBS set.
The determining module 420 is specifically configured to calculate the TBSSI corresponding to the input bit number according to the following formula:
Figure 893214DEST_PATH_IMAGE040
wherein L is′For the number of input bits, n′TBSSI, L corresponding to the number of input bitsminIs a constant.
Embodiments of the present invention include advantages of searching for a TBS closest to an input bit number from a TBS set according to a search boundary corresponding to an input bit value, reducing the number of cycles and comparisons of a search matching process, reducing the amount of computation of a processor, and improving the processing efficiency of the processor. Of course, it is not necessary for any product that implements an embodiment of the invention to achieve all of the above-described advantages at the same time.
Those skilled in the art will appreciate that the modules in the devices in the embodiments may be distributed in the devices in the embodiments according to the description of the embodiments, and may be correspondingly changed in one or more devices different from the embodiments. The modules of the above embodiments may be combined into one module, or further split into multiple sub-modules.
Through the above description of the embodiments, those skilled in the art will clearly understand that the present invention may be implemented by software plus a necessary general hardware platform, and certainly may also be implemented by hardware, but in many cases, the former is a better embodiment. Based on such understanding, the technical solutions of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for enabling a terminal device (which may be a mobile phone, a personal computer, a server, or a network device) to execute the method according to the embodiments of the present invention.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and improvements can be made without departing from the principle of the present invention, and such modifications and improvements should also be considered within the scope of the present invention.

Claims (14)

1. A method of matching a transport block size, TBS, wherein a TBS set is partitioned into a plurality of search intervals, and wherein the search intervals correspond one-to-one to transport block size, inter-cell, indices, TBSSI, the method comprising:
determining TBSSI corresponding to the input bit number;
and searching the TBS closest to the input bit number from the TBS set according to the search boundary corresponding to the determined TBSSI.
2. The method of claim 1, wherein the TBSs in the TBS set correspond to TBS indices one-to-one;
the TBS set is divided into a plurality of search intervals by:
determining the number of search intervals contained in the TBS set and the TBSSI corresponding to each search interval;
and dividing each TBS in the TBS set into corresponding search intervals according to the TBSSI corresponding to each search interval.
3. The method of claim 2, wherein the determining the number of search intervals included in the TBS set and the TBSSI corresponding to each search interval specifically comprises:
calculating the number of search intervals contained in the TBS set according to the following formula:
N=nmax -nmin+1；
Figure 2011100488666100001DEST_PATH_IMAGE002
；
Figure 2011100488666100001DEST_PATH_IMAGE004
wherein N is the number of search intervals, L, included in the TBS set1For TBS index of 1 in the TBS set, LminIs a constant number of times, and is,
Figure 2011100488666100001DEST_PATH_IMAGE006
is the maximum TBS in the TBS set;
TBSSI corresponding to each search interval is less than or equal to nmaxAnd is greater than or equal to nminTBSSI = n search interval TnThe following formula is satisfied:
Figure 2011100488666100001DEST_PATH_IMAGE008
wherein L iskThe TBS index of k is the TBS in the TBS set.
4. The method of claim 3, wherein the determining the TBSSI corresponding to the number of input bits is specifically:
calculating the TBSSI corresponding to the input bit number according to the following formula:
Figure 2011100488666100001DEST_PATH_IMAGE010
wherein L is′For the number of input bits, n′And the TBSSI corresponding to the input bit number.
5. The method of claim 1, wherein the TBSs in the TBS set correspond one-to-one to TBS indices, and wherein the search boundary is the TBS index corresponding to a maximum TBS or a minimum TBS in a non-empty search interval closest to a search interval corresponding to the search boundary.
6. The method of claim 5, wherein the search boundary is a TBS index corresponding to a minimum TBS in the non-empty search interval when the TBSSI of the non-empty search interval is greater than the TBSSI of the search interval corresponding to the search boundary;
and searching the TBS closest to the input bit number from the TBS set according to the search boundary corresponding to the determined TBSSI, specifically:
and searching the TBS closest to the input bit number from the TBS set in descending order by using the search boundary as an initial TBS index.
7. The method of claim 5, wherein the search boundary is a TBS index corresponding to a maximum TBS in the non-empty search interval when the TBSSI corresponding to the non-empty search interval is less than the TBSSI corresponding to the search boundary;
and searching the TBS closest to the input bit number from the TBS set according to the search boundary corresponding to the determined TBSSI, specifically:
and searching the TBS closest to the input bit number from the TBS set in descending order of size by using the search boundary as an initial TBS index.
8. An apparatus for matching a transport block size, TBS, comprising:
the system comprises a storage module, a transmission block size distribution module and a transmission block size distribution module, wherein the storage module is used for storing a TBS set, the TBS set is divided into a plurality of search intervals, and the search intervals correspond to the transmission block size distribution index TBSSI one by one;
the determining module is used for determining the TBSSI corresponding to the input bit number;
and the searching module is used for searching the TBS closest to the input bit number from the TBS set according to the searching boundary corresponding to the determined TBSSI.
9. The apparatus of claim 8, wherein the TBSs in the TBS set correspond to TBS indices one-to-one;
the device further comprises:
a setting module configured to divide a TBS set into a plurality of search intervals by:
determining the number of search intervals contained in the TBS set and the TBSSI corresponding to each search interval;
and dividing each TBS in the TBS set into corresponding search intervals according to the TBSSI corresponding to each search interval.
10. The apparatus of claim 9,
the setting module is specifically configured to calculate the number of search intervals included in the TBS set according to the following formula:
N=nmax -nmin+1；
Figure 50960DEST_PATH_IMAGE002
；
wherein N is the number of search intervals, L, included in the TBS set1For TBS index of 1 in the TBS set, LminIs a constant number of times, and is,
Figure 369126DEST_PATH_IMAGE006
is the maximum TBS in the TBS set;
will be less than or equal to nmaxAnd is greater than or equal to nminIs taken as TBSSI corresponding to each search interval, and the search interval T of TBSSI = nnThe following formula is satisfied:
Figure 225961DEST_PATH_IMAGE008
wherein L iskThe TBS index of k is the TBS in the TBS set.
11. The apparatus of claim 10, wherein the determining module is specifically configured to calculate the TBSSI corresponding to the input bit number according to the following formula:
Figure 636214DEST_PATH_IMAGE010
wherein L is′For the number of input bits, n′And the TBSSI corresponding to the input bit number.
12. The apparatus of claim 8, wherein the TBSs in the TBS set correspond one-to-one to TBS indices, and wherein the search boundary is the TBS index corresponding to a maximum TBS or a minimum TBS in a non-empty search interval closest to a search interval corresponding to the search boundary.
13. The apparatus of claim 12, wherein the search boundary is a TBS index corresponding to a minimum TBS in the non-empty search interval when the TBSSI of the non-empty search interval is greater than the TBSSI of a search interval corresponding to the search boundary;
the search module is specifically configured to search for a TBS closest to the input bit number from the TBS set in descending order with the search boundary as an initial TBS index.
14. The apparatus of claim 12, wherein the search boundary is a TBS index corresponding to a maximum TBS in the non-empty search interval when the TBSSI corresponding to the non-empty search interval is less than the TBSSI corresponding to the search boundary;
the search module is specifically configured to search for a TBS closest to the input bit number from the TBS set in a descending order with the search boundary as an initial TBS index.
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
WO2019096022A1 (en) Data transmission method and apparatus
US8812675B2 (en) Method for multi-point cooperation considering delay in a wireless communication system
CN102752874B (en) The dispatching method of Physical Downlink Shared Channel and device
US20130322241A1 (en) Table-based link adaptation for wireless communication network transmissions
EP1847054A1 (en) Systems and methods for optimizing the resource allocation in a wireless communication system
TW201826770A (en) Method for transmitting data, terminal equipment, and network equipment
CN110972150B (en) Network capacity expansion method and device, electronic equipment and computer storage medium
WO2017092535A1 (en) Transmission method and device for reference signal sequence
WO2016029667A1 (en) Uplink data transmission method and device
CN110035533B (en) Resource mapping method and equipment
WO2021212286A1 (en) Physical downlink control channel transmission method and apparatus, and storage medium
CN107872892A (en) A kind of wireless resource allocation methods and device
WO2016029455A1 (en) Resource allocation method and device
WO2017032059A1 (en) Buffer status report generation method and device
CN109582640A (en) A kind of data deduplication storage method, device and storage medium based on sliding window
CN109803408A (en) The transmission method and communication equipment of channel status information reports
WO2017166078A1 (en) Method and device for determining bit block size
CN102118793A (en) Method and device for matching TBS
CN104883237B (en) A kind of data transmission method, apparatus and system
CN109495968B (en) Method and device for data transmission
CN105874836A (en) Control information processing method, apparatus and system
CN111245556A (en) TBS (transport block size ratio) calculation method of 5GNR (generalized maximum likelihood ratio) and MACPDU (machine Access data Unit) multiplexing method and equipment
CN114070525A (en) Transmission method and device
WO2018018633A1 (en) Csi-rs transmission method and network device
CN110661605A (en) Method for determining downlink traffic channel TBS of sTTI 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
C12 Rejection of a patent application after its publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20110706