CN103997389B - A kind of method and apparatus calculating NULL bit numbers in PDSCH channels - Google Patents
A kind of method and apparatus calculating NULL bit numbers in PDSCH channels Download PDFInfo
- Publication number
- CN103997389B CN103997389B CN201310054564.9A CN201310054564A CN103997389B CN 103997389 B CN103997389 B CN 103997389B CN 201310054564 A CN201310054564 A CN 201310054564A CN 103997389 B CN103997389 B CN 103997389B
- Authority
- CN
- China
- Prior art keywords
- buffer
- data
- valid data
- sent
- region
- 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.)
- Active
Links
Landscapes
- Error Detection And Correction (AREA)
Abstract
The present invention provides a kind of method and apparatus of NULL bit numbers in calculating PDSCH channels, wherein the method includes：If being less than the length of cycle BUFFER by recycling the data length that BUFFER is sent after block interleaver interweaves, judge to be located at systematic bits region or check bit region in cycle BUFFER by recycling the last one valid data that BUFFER is sent；Determine the position of the last one valid data in its residing region；It is calculated according to the position through recycling the NULL bit numbers for including in the data that BUFFER is sent.The present invention realizes quick, the easy calculating to NULL bit numbers in PDSCH channels.
Description
Technical field
The present invention relates to the Physical Downlink Shared Channel of LTE (PDSCH) more particularly to a kind of calculating PDSCH channels are hollow
The method and apparatus of data (NULL) bit number.
Background technology
In the uplink of mobile communication system, the main packet of code multiplexing processing of LTE TDD/FDD PDSCH channels
Include channel coding, rate-matched, intertexture and transmission channel multiplexing and etc., in 3GPPTS36.212, give above-mentioned steps
Concrete regulation.
Wherein, the purpose of rate-matched is the PDSCH physical channels institute in order to make the amount of bits after coding meet distribution
The amount of bits that can be carried, and LTE data volumes to be treated are larger, efficiently carrying out solution rate-matched seems extremely important.
Rate-matched specified in agreement includes：Sub-block interweaves, bit is collected and bit is selected and cut.In sub-block intertexture, group
It needs to add NULL bits appropriate before each sub-block when block length cannot meet the total length of block interleaver.But
It is unwanted to solve NULL bits in rate matching procedure, therefore how quickly to calculate NULL bit numbers to solution rate-matched
Efficiency has a significant impact.
Invention content
It is how quick to solve the present invention provides a kind of method and apparatus of NULL bit numbers in calculating PDSCH channels
The technical issues of calculating NULL bit numbers in PDSCH channels.
In order to solve the above technical problems, the present invention provides a kind of method of NULL bit numbers in calculating PDSCH channels, institute
The method of stating includes：
If being less than the cycle by the data length that circular buffer (BUFFER) is sent after block interleaver interweaves
The length of BUFFER then judges that described the last one valid data by recycling BUFFER transmissions are located in cycle BUFFER
Systematic bits region or check bit region；
Determine the position of the last one valid data in its residing region；
It is calculated according to the position through recycling the NULL bit numbers for including in the data that BUFFER is sent.
Further, judge that described the last one valid data by recycling BUFFER transmissions are located at cycle BUFFER
In systematic bits region or check bit region, including：
If the size of block interleaver is Kn, it is tb_e by recycling the valid data number that BUFFER is sent, passes through cycle
The position in block interleaver for first valid data that BUFFER is sent is k0；
If being systematic bits by recycling first valid data that BUFFER is sent, if including in Kn-k0 data
Valid data number is N, compares the size of tb_e and N；If tb_e ＜ N, by the last one data for recycling BUFFER transmissions
Systematic bits region in cycle BUFFER；If tb_e ＞ N, the last one sent by cycle BUFFER is effective
Data are located at the check bit region in cycle BUFFER；
If being check bit by recycling first valid data that BUFFER is sent, if being wrapped in 2* (Kn-k0) a data
The valid data number contained is M, compares the size of tb_e and M；If tb_e ＞ M, pass through the last one of cycle BUFFER transmissions
Valid data are located at the systematic bits region in cycle BUFFER；If tb_e ＜ M, by recycling the last of BUFFER transmissions
One valid data is located at the check bit region in cycle BUFFER.
Further, position of the last one valid data described in the determination in its residing region, including：
When by recycle BUFFER send first valid data be systematic bits, and determine by recycle BUFFER
When the last one valid data sent are located at the systematic bits region in cycle BUFFER, include in Kn-k0 data
The distributions of the tb_e data is determined using binary search in valid data, according to described in distribution determination the last one
Position of the valid data in its residing region；
When by recycle BUFFER send first valid data be systematic bits, and determine by recycle BUFFER
When the last one valid data sent are located at the check bit region in cycle BUFFER, in check bit region using folding
Half lookup method determines the distribution of tb_e-N data, determines the last one described valid data in its residing area according to the distribution
Position in domain；
When by recycle BUFFER send first valid data be check bit, and determine by recycle BUFFER
When the last one valid data sent are located at the systematic bits region in cycle BUFFER, in systematic bits region using folding
Half lookup method determines the distribution of tb_e-M data, determines the last one described valid data in its residing area according to the distribution
Position in domain；
When by recycle BUFFER send first valid data be check bit, and determine by recycle BUFFER
When the last one valid data sent are located at the check bit region in cycle BUFFER, in 2* (Kn-k0) a data packet
The distribution for being determined the tb_e data in the valid data contained using binary search is determined described last according to the distribution
Position of one valid data in its residing region.
Further, the method further includes：
If being more than the length of the cycle BUFFER by recycling the data length that BUFFER is sent after block interleaver interweaves
Degree is omitted and is calculated through recycling the NULL bit numbers for including in the data that BUFFER is sent.
In order to solve the above technical problems, the present invention provides a kind of device of NULL bit numbers in calculating PDSCH channels, institute
State device include caching (BUFFER) terminate the bit regions determining modules of data, BUFFER terminate Data Position determining module with
And NULL bit number determining modules, wherein
The BUFFER terminates the bit regions determining module of data, for passing through cycle after interweaving through block interleaver
When the data length that BUFFER is sent is less than the length of the cycle BUFFER, judgement is described to be sent most by recycling BUFFER
The latter valid data are located at systematic bits region or check bit region in cycle BUFFER, will determine that result is sent
BUFFER, which is stated, described in terminates Data Position determining module；
The BUFFER terminates Data Position determining module, for determining the last one described valid data in its residing area
Position in domain, and send the position to the NULL bit numbers determining module；
The NULL bit numbers determining module is wrapped for being calculated according to the position through recycling in the data that BUFFER is sent
The NULL bit numbers contained.
Further,
The BUFFER terminates the bit regions determining module of data, described by recycling BUFFER transmissions for judging
The last one valid data is located at systematic bits region or check bit region in cycle BUFFER, including：
The BUFFER terminates the bit regions determining module of data, for as first sent by recycling BUFFER
When valid data are systematic bits, compare the size of tb_e and N, N is the valid data number for including in Kn-k0 data；If tb_
E ＜ N are then located at the systematic bits region in cycle BUFFER by recycling the last one valid data that BUFFER is sent；
If tb_e ＞ N, it is located at the check bit in cycle BUFFER by recycling the last one valid data that BUFFER is sent
Region；And when first valid data by recycling BUFFER transmissions are check bit, compare the size of tb_e and M, M
For the valid data number for including in 2* (Kn-k0) a data；If tb_e ＞ M, pass through the last one of cycle BUFFER transmissions
Valid data are located at the systematic bits region in cycle BUFFER；If tb_e ＜ M, by recycling the last of BUFFER transmissions
One valid data is located at the check bit region in cycle BUFFER；
Wherein, Kn is the size of block interleaver, and tb_e is the valid data number sent by recycling BUFFER, and k0 is to pass through
Recycle the position in block interleaver for first valid data that BUFFER is sent.
Further,
The BUFFER terminates Data Position determining module, for determining the last one described valid data in its residing area
Position in domain, including：
The BUFFER terminates Data Position determining module, for when first significant figure sent by recycling BUFFER
According to for systematic bits, and determine to be located in cycle BUFFER by recycling the last one valid data that BUFFER is sent
When systematic bits region, the tb_e data are determined using binary search in the valid data that Kn-k0 data include
Distribution, the position of the last one valid data in its residing region is determined according to the distribution；It is recycled when passing through
First valid data that BUFFER is sent are systematic bits, and are determined effective by the last one of cycle BUFFER transmissions
When data are located at the check bit region in cycle BUFFER, tb_e-N is determined using binary search in check bit region
The distribution of a data determines the position of the last one valid data in its residing region according to the distribution；When passing through
It is check bit to recycle first valid data that BUFFER is sent, and determines the last one sent by cycle BUFFER
When valid data are located at the systematic bits region in cycle BUFFER, determined using binary search in systematic bits region
The distribution of tb_e-M data determines the position of the last one valid data in its residing region according to the distribution；
When by recycle BUFFER send first valid data be check bit, and determine by recycle BUFFER send most
When the latter valid data are located at the check bit region in cycle BUFFER, 2* (Kn-k0) a data include it is effective
The distributions of the tb_e data is determined using binary search in data, according to the distribution determine described in the last one is effective
Position of the data in its residing region.
Further,
The NULL bit numbers determining module is additionally operable to the data sent after block interleaver interweaves by recycling BUFFER
When length is more than the length of the cycle BUFFER, omits and calculate through recycling the NULL bits for including in the data that BUFFER is sent
Number.
Above-mentioned technical proposal can be known according to the specific location by recycling the last one valid data that BUUFER is sent
The distribution for the valid data that cycle BUFFER is sent is crossed by Xiaotong, after the valid data distribution of transmission determines, calculates cycle
The NULL bit numbers for including in the data that BUFFER is sent are easily achieved.
Description of the drawings
Fig. 1 is the method flow diagram for calculating NULL bit numbers in PDSCH channels of the present embodiment；
.1~2.4 Fig. 2 are distribution schematic diagram of the Null bits in interleaver in the prior art；
Fig. 3 is the exemplary schematic diagram for calculating NULL bit numbers in PDSCH channels of this application；
Fig. 4 is the structure drawing of device for calculating NULL bit numbers in PDSCH channels of the present embodiment.
Specific implementation mode
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with attached drawing to the present invention
Embodiment be described in detail.It should be noted that in the absence of conflict, in the embodiment and embodiment in the application
Feature mutually can arbitrarily combine.
Fig. 1 is the method flow diagram for calculating NULL bit numbers in PDSCH channels of the present embodiment.
S101 flows start；
S102 judges the data length sent by circular buffer (BUFFER) after block interleaver interweaves and the cycle
The length of BUFFER, if being more than the cycle BUFFER by recycling the data length that BUFFER is sent after block interleaver interweaves
Length, then follow the steps S106；Otherwise, step S103 is executed；
According to the common knowledge of this field, by recycling the data that BUFFER is sent as by block after block interleaver interweaves
The systematic bits data of intertexture, the first check bit data and the second check bit data；
Systematic bits data, the first check bit data and the second check bit data are according to side shown in .1~2.4 Fig. 2
Formula carries out block interleaving；The NULL bit numbers filled in this block interleaving modes of wherein Fig. 2 .1 are 4；This block interleaving modes of Fig. 2 .2
The NULL bit numbers of middle filling are 12；The NULL bit numbers filled in this block interleaving modes of Fig. 2 .3 are 20；This piece of Fig. 2 .4
The NULL bit numbers filled in interleaving mode are 28；
S103 judges that described the last one valid data by recycling BUFFER transmissions are located in cycle BUFFER
Systematic bits region or check bit region；
If the size of block interleaver is Kn, it is tb_e by recycling the valid data number that BUFFER is sent, passes through cycle
The position in block interleaver for first valid data that BUFFER is sent is k0；
If being systematic bits by recycling first valid data that BUFFER is sent, if including in Kn-k0 data
Valid data number is N, compares the size of tb_e and N；If tb_e ＜ N, the last one sent by cycle BUFFER is effective
Data are located at the systematic bits region in cycle BUFFER；If tb_e ＞ N, pass through the last one of cycle BUFFER transmissions
Valid data are located at the check bit region in cycle BUFFER；
If being check bit by recycling first valid data that BUFFER is sent, if being wrapped in 2* (Kn-k0) a data
The valid data number contained is M, compares the size of tb_e and M；If tb_e ＞ M, pass through the last one of cycle BUFFER transmissions
Valid data are located at the systematic bits region in cycle BUFFER；If tb_e ＜ M, by recycling the last of BUFFER transmissions
One valid data is located at the check bit region in cycle BUFFER；
S104 determines the position of the last one valid data in its residing region；
When by recycle BUFFER send first valid data be systematic bits, and determine by recycle BUFFER
When the last one valid data sent are located at the systematic bits region in cycle BUFFER, include in (Kn-k0) a data
Valid data in the distributions of the tb e data determined using binary search, according to described in distribution determination last
Position of a valid data in its residing region；
When by recycle BUFFER send first valid data be systematic bits, and determine by recycle BUFFER
When the last one valid data sent are located at the check bit region in cycle BUFFER, in check bit region using folding
Half lookup method determines the distribution of tb_e-N data, determines the last one described valid data in its residing area according to the distribution
Position in domain；
When by recycle BUFFER send first valid data be check bit, and determine by recycle BUFFER
When the last one valid data sent are located at the systematic bits region in cycle BUFFER, in systematic bits region using folding
Half lookup method determines the distribution of tb_e-M data, determines the last one described valid data in its residing area according to the distribution
Position in domain；
When by recycle BUFFER send first valid data be check bit, and determine by recycle BUFFER
When the last one valid data sent are located at the check bit region in cycle BUFFER, in 2* (Kn-k0) a data packet
The distribution for being determined the tb_e data in the valid data contained using binary search is determined described last according to the distribution
Position of one valid data in its residing region；
S105 is calculated according to the position through recycling the NULL bit numbers for including in the data that BUFFER is sent, and executes step
S107；
The S106 situations illustrate that it is to repeat to solve rate-matched, and can omit calculating includes through recycling in the data that BUFFER is sent
NULL bit numbers；
S107 flows terminate.
Specifically above-described embodiment is further described using example with one below.
As shown in figure 3, each sub-block interleaver has 7 rows, 32 row in the figure, therefore each sub-block interleaver can interleaving data
224 (Kn) are a；Each cycle BUFFER includes 224*3=672 (tb_ncb) a data.
Assuming that first data that cycle BUFFER is sent are systematic bits, and k0=14 (is used for interlacing system ratio in figure
Data where the 6th row the 1st row of special sub-block interleaver are the position where first data)；By recycling BUFFER hairs
The valid data number sent is tb_e=300；
The first step, it is 224-14=210 to calculate by recycling the systematic bits number that BUFFER is sent, wherein 11 NULL,
199 valid data；This 199 valid data are subtracted from 300 valid data, it is check bit also to remain 101 data；
Second step will be located at the valid data (7*32-12=on 1 left side of cut-off rule in this 101 check bits and Fig. 3
212) it is compared, result is 101 ＜ 212, therefore the end position of this 101 verification datas is in the left side of cut-off rule 1；
The valid data (7*16-6=106) on this 2 left side of 101 verification datas and cut-off rule are compared, as a result 101
＜ 106, therefore the end position of this 101 verification datas is in the left side of cut-off rule 2；
The valid data (7*8-4=52) on this 3 left side of 101 verification datas and cut-off rule are compared, as a result 101 ＞
52, therefore the end position of this 101 verification datas is in the right of cut-off rule 3；
101 verification datas are subtracted into 52 valid data and obtain 49 valid data；By this 49 data with positioned at point
Data (7*4-2=26) between secant 3 and cut-off rule 4 are compared, as a result 49 ＞ 26, therefore this 101 verification datas
End position be in the right of cut-off rule 4；
49 verification datas are subtracted into 26 verification datas and obtain 23 verification datas；By this 23 verification datas and segmentation
The data (7*2=14) on 5 left side of line are compared, as a result 23 ＞ 14, therefore the end position of this 101 verification datas is in and divides
The right of secant 5；
Then it 23 this 14 data is subtracted obtains 9 data；Since check bit 1 and check bit 2 pass through cycle
BUFFER, which intersects, to be sent, and can determine that the end position of this 101 verification datas is located at check bit 1 according to this 9 data
7th arranges the 4th row (columns and line number are started counting up from 0)；
4th step, according to the position of the last one bit sent by cycle BUFFER, it may be determined that by cycle
NULL data have 11+3+3=17 in the data that BUFFER is sent.
After the Null bit numbers (null_cnt) by including in the data that cycle BUFFER is sent have been calculated, according to
(tb_e+null_cnt) it can accurately calculate and need the deinterleaving number carried out, while root through recycling the data that BUFFE is sent
It is each cycle to calculate punching to fall data to need the deinterleaving number carried out, tb_ncb according to (tb_ncb-tb_e-null_cnt)
The total data number that BUFFER includes can also equally calculate initial position k1 and starting row, column that data deinterlacing is fallen in punching,
And then the processing of punctured data can be carried out in advance.If Null bits are skipped in the deinterleaving of solution rate-matched, need to calculate
The transmission data initial position K0 of Null bits is not included, data start K1 is fallen in punching, and quickly meter of the invention can also be used
Calculate the Null bit numbers that K0, K1 include.
Fig. 4 is the structure drawing of device for calculating NULL bit numbers in PDSCH channels of the present embodiment.
The device includes that BUFFER terminates the bit regions determining module of data, BUFFER terminates Data Position determining module
And NULL bit number determining modules, wherein
BUFFER terminates the bit regions determining module of data, for passing through cycle BUFFER after interweaving through block interleaver
When the data length of transmission is less than the length of the cycle BUFFER, the last one described sent by cycle BUFFER is judged
Valid data are located at systematic bits region or check bit region in cycle BUFFER, and it is described to will determine that result is sent to
It states BUFFER and terminates Data Position determining module；
The BUFFER terminates the bit regions determining module of data, described by recycling BUFFER transmissions most for judging
The latter valid data are located at systematic bits region or check bit region in cycle BUFFER, including：When by following
When first valid data that ring BUFFER is sent are systematic bits, compare the size of tb_e and N, N is to be wrapped in Kn-k0 data
The valid data number contained；If tb_e ＜ N, it is located at the cycle by recycling the last one valid data that BUFFER is sent
Systematic bits region in BUFFER；If tb_e ＞ N, the last one valid data by recycling BUFFER transmissions are located at should
Recycle the check bit region in BUFFER；And when by recycling first valid data that BUFFER is sent as check bit
When, compare the size of tb_e and M, M is the valid data number for including in 2* (Kn-k0) a data；If tb_e ＞ M, by following
The last one valid data that ring BUFFER is sent are located at the systematic bits region in cycle BUFFER；If tb_e ＜ M, lead to
Cross the check bit region that the last one valid data that cycle BUFFER is sent are located in cycle BUFFER；Wherein, Kn is
The size of block interleaver, tb_e are the valid data number sent by recycling BUFFER, and k0 is to be sent by recycling BUFFER
The position in block interleaver of first valid data；
BUFFER terminates Data Position determining module, for determining the last one described valid data in its residing region
Position, and send the position to the NULL bit numbers determining module；
The BUFFER terminates Data Position determining module, for determining the last one described valid data in its residing region
In position, including：When being systematic bits by recycling first valid data that BUFFER is sent, and determine to pass through cycle
When the last one valid data that BUFFER is sent are located at the systematic bits region in cycle BUFFER, in (Kn-k0) number
According to comprising valid data in the distributions of the tb_e data determined using binary search, according to distribution determination
Position of the last one valid data in its residing region；When first valid data sent by cycle BUFFER are to be
System bit, and determine the verification ratio being located in cycle BUFFER by recycling the last one valid data that BUFFER is sent
When the domain of special zone, the distribution of tb_e-N data is determined using binary search in check bit region, is determined according to the distribution
Position of the last one the described valid data in its residing region；When first valid data sent by recycling BUFFER
For check bit, and determine to be located in cycle BUFFER by recycling the last one valid data that BUFFER is sent be
When bit regions of uniting, the distribution of tb_e-M data is determined using binary search in systematic bits region, according to the distribution
Determine the position of the last one valid data in its residing region；When first by recycling BUFFER transmissions is effective
Data are check bit, and determine to be located in cycle BUFFER by recycling the last one valid data that BUFFER is sent
Check bit region when, the tb_e is determined using binary search in the valid data that 2* (Kn-k0) a data include
The distribution of a data determines the position of the last one valid data in its residing region according to the distribution；
NULL bit number determining modules, for including through recycling in the data that BUFFER is sent according to position calculating
NULL bit numbers；
Above-mentioned NULL bit numbers determining module is additionally operable to the data sent after block interleaver interweaves by recycling BUFFER
When length is more than the length of the cycle BUFFER, omits and calculate through recycling the NULL bits for including in the data that BUFFER is sent
Number.
One of ordinary skill in the art will appreciate that all or part of step in the above method can be instructed by program
Related hardware is completed, and described program can be stored in computer readable storage medium, such as read-only memory, disk or CD
Deng.Optionally, all or part of step of above-described embodiment can also be realized using one or more integrated circuits, accordingly
Ground, the form that hardware may be used in each module/unit in above-described embodiment are realized, the shape of software function module can also be used
Formula is realized.The present invention is not limited to the combinations of the hardware and software of any particular form.
It should be noted that the invention may also have other embodiments, without departing substantially from spirit of that invention and its essence
In the case of, those skilled in the art can make various corresponding change and deformations according to the present invention, but these are corresponding
Change and distortion should all belong to the protection domain of appended claims of the invention.
Claims (8)
1. a kind of method calculating NULL bit numbers in PDSCH channels, which is characterized in that the method includes：
If being less than the circular buffer BUFFER by the data length that circular buffer BUFFER is sent after block interleaver interweaves
Length, then judge described to be located at circular buffer BUFFER by the last one valid data that circular buffer BUFFER is sent
In systematic bits region or check bit region；
Determine the position of the last one valid data in its residing region；
The NULL bit numbers for including in the data sent through circular buffer BUFFER are calculated according to the position.
2. the method as described in claim 1, which is characterized in that judge described in sent by circular buffer BUFFER last
A valid data are located at systematic bits region or check bit region in circular buffer BUFFER, further comprise：
It is tb_e by the valid data number that circular buffer BUFFER is sent if the size of block interleaver is Kn, it is slow by recycling
The position in block interleaver for depositing first valid data of BUFFER transmissions is k0；
If being systematic bits by first valid data that circular buffer BUFFER is sent, if including in Kn-k0 data
Valid data number is N, compares the size of tb_e and N；If tb_e<N, then last number sent by circular buffer BUFFER
According to the systematic bits region in circular buffer BUFFER；If tb_e>N is then sent most by circular buffer BUFFER
The latter valid data are located at the check bit region in circular buffer BUFFER；
If being check bit by first valid data that circular buffer BUFFER is sent, if being wrapped in 2* (Kn-k0) a data
The valid data number contained is M, compares the size of tb_e and M；If tb_e>M, then sent by circular buffer BUFFER last
A valid data are located at the systematic bits region in circular buffer BUFFER；If tb_e<M then passes through circular buffer BUFFER
The last one valid data sent are located at the check bit region in circular buffer BUFFER.
3. method as claimed in claim 2, which is characterized in that the last one valid data described in the determination are in its residing area
Position in domain, further comprises：
When first valid data sent by circular buffer BUFFER are systematic bits, and determine to pass through circular buffer
When the last one valid data that BUFFER is sent are located at the systematic bits region in circular buffer BUFFER, at Kn-k0
The distribution for determining the tb_e data in the valid data that data include using binary search determines institute according to the distribution
State position of the last one valid data in its residing region；
When first valid data sent by circular buffer BUFFER are systematic bits, and determine to pass through circular buffer
When the last one valid data that BUFFER is sent are located at the check bit region in circular buffer BUFFER, in check bit
Region determines the distribution of tb_e-N data using binary search, the last one described valid data are determined according to the distribution
Position in its residing region；
When first valid data sent by circular buffer BUFFER are check bit, and determine to pass through circular buffer
When the last one valid data that BUFFER is sent are located at the systematic bits region in circular buffer BUFFER, in systematic bits
Region determines the distribution of tb_e-M data using binary search, the last one described valid data are determined according to the distribution
Position in its residing region；
When first valid data sent by circular buffer BUFFER are check bit, and determine to pass through circular buffer
When the last one valid data that BUFFER is sent are located at the check bit region in circular buffer BUFFER, in 2* (Kn-
K0 the distribution for) determining the tb_e data in the valid data that a data include using binary search, according to the distribution
Determine the position of the last one valid data in its residing region.
4. method according to any one of claims 1 to 3, which is characterized in that the method further includes：
If being more than the circular buffer BUFFER by the data length that circular buffer BUFFER is sent after block interleaver interweaves
Length, omit the NULL bit numbers for including in the data for calculating and being sent through circular buffer BUFFER.
5. a kind of device calculating NULL bit numbers in PDSCH channels, which is characterized in that described device includes circular buffer
BUFFER terminates the bit regions determining module of data, circular buffer BUFFER terminates Data Position determining module and NULL ratios
Special number determining module, wherein
The circular buffer BUFFER terminates the bit regions determining module of data, for after interweaving through block interleaver by following
When the data length that ring caches BUFFER transmissions is less than the length of the circular buffer BUFFER, pass through circular buffer described in judgement
The last one valid data that BUFFER is sent are located at systematic bits region or check bit in circular buffer BUFFER
Region will determine that result is sent to the circular buffer BUFFER and terminates Data Position determining module；
The circular buffer BUFFER terminates Data Position determining module, for determining the last one described valid data in its institute
Locate the position in region, and sends the position to the NULL bit numbers determining module；
The NULL bit numbers determining module is wrapped for being calculated in the data sent through circular buffer BUFFER according to the position
The NULL bit numbers contained.
6. device as claimed in claim 5, which is characterized in that
The circular buffer BUFFER terminates the bit regions determining module of data, described passes through circular buffer for judging
The last one valid data that BUFFER is sent are located at systematic bits region or check bit in circular buffer BUFFER
Region, including：
The circular buffer BUFFER terminates the bit regions determining module of data, is sent by circular buffer BUFFER for working as
First valid data when being systematic bits, compare the size of tb_e and N, N is the valid data for including in Kn-k0 data
Number；If tb_e<N is then located at by the last one valid data that circular buffer BUFFER is sent in circular buffer BUFFER
Systematic bits region；If tb_e>N is then located at the cycle by the last one valid data that circular buffer BUFFER is sent
Cache the check bit region in BUFFER；And when first valid data sent by circular buffer BUFFER are verification
When bit, compare the size of tb_e and M, M is the valid data number for including in 2* (Kn-k0) a data；If tb_e>M then passes through
The last one valid data that cycle BUFFER is sent are located at the systematic bits region in circular buffer BUFFER；If tb_e<
M, the then check bit being located at by the last one valid data that circular buffer BUFFER is sent in circular buffer BUFFER
Region；
Wherein, Kn is the size of block interleaver, and tb_e is the valid data number sent by circular buffer BUFFER, and k0 is to pass through
The position in block interleaver for first valid data that circular buffer BUFFER is sent.
7. device as claimed in claim 6, which is characterized in that
The circular buffer BUFFER terminates Data Position determining module, for determining the last one described valid data in its institute
Locate the position in region, including：
The circular buffer BUFFER terminates Data Position determining module, for when first sent by circular buffer BUFFER
A valid data are systematic bits, and determine that the last one valid data sent by circular buffer BUFFER are followed positioned at this
It is true using binary search in the valid data that Kn-k0 data include when ring caches the systematic bits region in BUFFER
The distribution of the fixed tb_e data determines the position of the last one valid data in its residing region according to the distribution
It sets；When first valid data sent by circular buffer BUFFER are systematic bits, and determine to pass through circular buffer
When the last one valid data that BUFFER is sent are located at the check bit region in circular buffer BUFFER, in check bit
Region determines the distribution of tb_e-N data using binary search, the last one described valid data are determined according to the distribution
Position in its residing region；When first valid data sent by circular buffer BUFFER be check bit, and really
Make the systematic bits being located at by the last one valid data that circular buffer BUFFER is sent in circular buffer BUFFER
When region, the distribution of tb_e-M data is determined using binary search in systematic bits region, institute is determined according to the distribution
State position of the last one valid data in its residing region；When first significant figure sent by circular buffer BUFFER
According to for check bit, and determine to be located at the circular buffer by the last one valid data that circular buffer BUFFER is sent
When check bit region in BUFFER, determined using binary search in the valid data that 2* (Kn-k0) a data include
The distribution of the tb_e data determines the position of the last one valid data in its residing region according to the distribution
It sets.
8. the device as described in any one of claim 5~7, which is characterized in that
The NULL bit numbers determining module is additionally operable to the data sent by circular buffer BUFFER after block interleaver interweaves
When length is more than the length of the circular buffer BUFFER, omission, which calculates in the data sent through circular buffer BUFFER, includes
NULL bit numbers.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310054564.9A CN103997389B (en) | 2013-02-20 | 2013-02-20 | A kind of method and apparatus calculating NULL bit numbers in PDSCH channels |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310054564.9A CN103997389B (en) | 2013-02-20 | 2013-02-20 | A kind of method and apparatus calculating NULL bit numbers in PDSCH channels |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103997389A CN103997389A (en) | 2014-08-20 |
| CN103997389B true CN103997389B (en) | 2018-10-02 |
Family
ID=51311401
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310054564.9A Active CN103997389B (en) | 2013-02-20 | 2013-02-20 | A kind of method and apparatus calculating NULL bit numbers in PDSCH channels |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103997389B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1708399A2 (en) * | 2005-03-28 | 2006-10-04 | Fujitsu Limited | Method of detecting an error in a control information transmitted on a downlink radio channel and mobile terminal |
| CN101986584A (en) * | 2010-10-22 | 2011-03-16 | 中国科学院计算技术研究所 | Rate de-matching device and method in 3GPP LTE |
| CN102170649A (en) * | 2011-04-19 | 2011-08-31 | 中兴通讯股份有限公司 | Method and apparatus of PDCCH blind detection apparatus |
| CN102422614A (en) * | 2009-03-12 | 2012-04-18 | 三星电子株式会社 | Method for encoding control information in a communication system, and method and apparatus for transmitting and receiving the control information |
| CN102546082A (en) * | 2010-12-23 | 2012-07-04 | 联芯科技有限公司 | Rate de-matching method and device |
-
2013
- 2013-02-20 CN CN201310054564.9A patent/CN103997389B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1708399A2 (en) * | 2005-03-28 | 2006-10-04 | Fujitsu Limited | Method of detecting an error in a control information transmitted on a downlink radio channel and mobile terminal |
| CN102422614A (en) * | 2009-03-12 | 2012-04-18 | 三星电子株式会社 | Method for encoding control information in a communication system, and method and apparatus for transmitting and receiving the control information |
| CN101986584A (en) * | 2010-10-22 | 2011-03-16 | 中国科学院计算技术研究所 | Rate de-matching device and method in 3GPP LTE |
| CN102546082A (en) * | 2010-12-23 | 2012-07-04 | 联芯科技有限公司 | Rate de-matching method and device |
| CN102170649A (en) * | 2011-04-19 | 2011-08-31 | 中兴通讯股份有限公司 | Method and apparatus of PDCCH blind detection apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103997389A (en) | 2014-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102447521B (en) | A kind of dissociation rate matching method and device | |
| CN101388751B (en) | Rate de-matching method | |
| CN101087181B (en) | A method for removing interweaving and speed match | |
| CN101510819B (en) | Method and apparatus for matching velocity | |
| CN106160937A (en) | A kind of method and device realizing code block segmentation | |
| CN110113132A (en) | A kind of coding and decoding method and terminal | |
| WO2018090629A1 (en) | Method of deinterleaving and de-rate matching, device, and computer storage medium | |
| CN102546082B (en) | Rate de-matching method and device | |
| CN105404595A (en) | Cache management method and apparatus | |
| CN104753653A (en) | Rate de-matching method, device and reception-side equipment | |
| CN103997389B (en) | A kind of method and apparatus calculating NULL bit numbers in PDSCH channels | |
| CN103336812A (en) | Webpage resource caching method and device for improving secondary loading efficiency | |
| CN102025445B (en) | Method and device for rate matching or rate dematching | |
| CN103986557A (en) | LTE Turbo code parallel block decoding method with low path delay | |
| CN104427494B (en) | The distribution method of Radio Network Temporary Identifier | |
| CN102647353B (en) | Message segment acquiring method and device | |
| CN102136888B (en) | Sub-block de-interleaving input data processing method and device | |
| EP3179374A1 (en) | Method and device for detecting authorized memory access | |
| CN102170333B (en) | A kind of parallel calculating method of interleaving address and system | |
| CN103840912B (en) | Method for rate dematching of LTE/LTE-A system traffic channel | |
| CN103684709A (en) | Method and device for merging retransmission data | |
| CN103746773A (en) | Method and system for correcting errors of decoded data by using UMTS (Universal Mobile Telecommunications System) receiver | |
| CN101908943B (en) | Channel decoding method applied to time division-synchronization code division multiple access (TD-SCDMA) | |
| CN1620050A (en) | Blind transmission format detecting method suitable for broad band CDMA system | |
| CN102118219A (en) | Serial processing method and serial processing device for rate matching |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20221117 Address after: 518055 Zhongxing Industrial Park, Liuxian Avenue, Xili street, Nanshan District, Shenzhen City, Guangdong Province Patentee after: SANECHIPS TECHNOLOGY Co.,Ltd. Address before: 518057 Ministry of justice, Zhongxing building, South Science and technology road, Nanshan District hi tech Industrial Park, Shenzhen, Guangdong Patentee before: ZTE Corp. |
|
| TR01 | Transfer of patent right |