CN106817205B

CN106817205B - Data scheduling method and device for special physical data channel

Info

Publication number: CN106817205B
Application number: CN201510846405.1A
Authority: CN
Inventors: 倪湛; 李龙文; 李智江
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2015-11-27
Filing date: 2015-11-27
Publication date: 2020-09-15
Anticipated expiration: 2035-11-27
Also published as: WO2017088551A1; CN106817205A

Abstract

The invention provides a method and a device for scheduling data of a dedicated physical data channel, belonging to the field of communication. The data scheduling method of the special physical data channel comprises the following steps: step 1: obtaining TFCI of a user needing to be demodulated; step 2: selecting corresponding time delay for each data frame in the TTI, and issuing a demodulation task at a time corresponding to one time delay Tn; and step 3: after the demodulation data of all data frames in the TTI are collected, decoding is carried out; and 4, step 4: obtaining a decoding result, and judging that scheduling interference is eliminated if the decoding is correct; if the decoding is wrong, putting the scheduling list to be demodulated into the scheduling list; and 5: if the scheduling list to be demodulated is not empty, checking the residual demodulation resources, and if the residual demodulation resources are sufficient, turning to the step 6; step 6: and (3) checking the demodulation time delay of each data frame in the TTI, and turning to the step 2 when the demodulation time delay of at least one frame of data meets a preset condition. The technical scheme of the invention can reduce the processing time delay as much as possible while ensuring the interference elimination gain.

Description

Data scheduling method and device for special physical data channel

Technical Field

The present invention relates to the field of communications, and in particular, to a method and an apparatus for scheduling data of dedicated physical data channels.

Background

Demodulation of an uplink DPDCH (Dedicated Physical Data Channel) is performed immediately after information of a control Channel is decoded, when an interference cancellation function is introduced into a system, in order to fully enjoy gain of interference cancellation, Data demodulation is performed after Channel interference cancellation of an EDPDCH (Enhanced Dedicated Physical Data Channel) is fixedly performed, and a frame of demodulated Data is transmitted each time, so that compared with the case where no interference cancellation function is introduced, delay of one frame is increased, which causes increase of the whole loopback delay and influences the feeling of a ping packet and some rate users.

Disclosure of Invention

The technical problem to be solved by the present invention is to provide a method and a device for scheduling dedicated physical data channel data, which can reduce processing delay as much as possible while ensuring interference cancellation gain.

To solve the above technical problem, embodiments of the present invention provide the following technical solutions:

in one aspect, a method for scheduling DPDCH data is provided, which includes:

step 1: acquiring a transport format combination identifier TFCI of a user needing to be demodulated;

step 2: selecting corresponding time delay for each data frame in a transmission time interval TTI, and issuing a demodulation task at a time corresponding to one time delay Tn, wherein n is 1,2,3 … …, and the time delays of different frames are independent;

and step 3: after the demodulation data of all data frames in the TTI are collected, decoding is carried out;

and 4, step 4: obtaining a decoding result, and judging that scheduling interference is eliminated if the decoding is correct; if the decoding is wrong, putting the scheduling list to be demodulated into the scheduling list;

and 5: if the scheduling list to be demodulated is not empty, checking the residual demodulation resources, and if the residual demodulation resources are sufficient, turning to the step 6;

step 6: and (3) checking the demodulation time delay of each data frame in the TTI, and turning to the step 2 when the demodulation time delay of at least one frame of data meets a preset condition.

Further, the time delay Tn in step 2 is selected from the following time instants:

acquiring the T1 moment of the TFCI information;

t2 moment when the high speed uplink packet access HSUPA 10ms TTI user once demodulates interference cancellation;

time T3 when interference cancellation of other DPDCH channels ends;

t4 moment when the secondary demodulation interference cancellation of the HSUPA 10msTTI user is finished;

the HSUPA 2ms user resolvers the T5 time at which the interference cancellation ends.

Further, the time Tn of the first demodulation is Ti + the frame length of the data frame, and i is 1,2,3,4, 5.

Further, the time Tn of the first demodulation is the minimum value of the Ti + data frame length and the antenna data storage length, and i is 1,2,3,4, 5.

Further, when the antenna data storage length is smaller than the TTI length, the length of one subframe is reserved as processing time, all data frames of the TFCI which are demodulated in the TTI are demodulated, and the demodulated data are stored.

Further, the step 3 further comprises:

and buffering the demodulated data, and decoding the demodulated data of one complete TTI.

Further, the step 3 comprises:

when only one TTI exists, if the antenna data storage length is larger than a preset value, all data frames in the TTI are demodulated and decoded; or

When more than two TTIs exist, decoding the latest demodulation data of each data frame in the TTIs; or

When more than two TTIs exist, after the data frame corresponding to the smaller TTI is decoded correctly, the demodulation data of the data frame corresponding to the smaller TTI is used when other TTIs are decoded; or

When there are more than two TTIs, all data frames contained in the TTI are demodulated before the end of each TTI.

Further, the step 6 comprises:

and judging whether the demodulation time delay of each data frame in the TTI is greater than the antenna data storage length, and if the demodulation time delay is greater than the antenna data storage length, not performing next demodulation.

Further, the step 6 further includes:

when the TTI is greater than 10ms, only the second frame data is demodulated next time.

An embodiment of the present invention further provides a DPDCH data scheduling apparatus, including:

an obtaining module, configured to obtain a transport format combination identifier TFCI of a user to be demodulated;

the time delay selection module is used for selecting corresponding time delay for each data frame in a transmission time interval TTI, and issuing a demodulation task at a time corresponding to one time delay Tn, wherein n is 1,2,3 … …, and the time delays of different frames are independent;

and the demodulation module is used for demodulating all data frames in the TTI.

The decoding module is used for decoding after the demodulation data of all the data frames in the TTI are collected;

the interference elimination module is used for eliminating scheduling interference when the decoding is correct;

the antenna data storage module is used for storing the demodulation data in a scheduling list to be demodulated when the decoding is wrong;

the demodulation resource updating module is used for checking the residual demodulation resources when the scheduling list to be demodulated is not empty;

and the demodulation data frame selection module is used for checking the demodulation time delay of each data frame in the TTI and judging whether at least one frame of data demodulation time delay meets the preset condition.

The embodiment of the invention has the following beneficial effects:

in the above scheme, it is considered that the demodulation scheduling policy of the DPDCH is changed under the condition of turning on the interference cancellation, so that the processing delay is reduced as much as possible while the interference cancellation gain is ensured.

Drawings

Fig. 1 is a flow chart of a dedicated physical data channel data scheduling method according to an embodiment of the present invention;

fig. 2 is a block diagram of a dedicated physical data channel data scheduling apparatus according to an embodiment of the present invention;

FIG. 3 is a diagram illustrating a specific scheduling method under two TTI configurations and sufficient demodulation resources according to an embodiment of the present invention;

fig. 4 is a schematic diagram illustrating a specific scheduling method under two TTI configurations and a condition of limited demodulation resources according to an embodiment of the present invention;

fig. 5 is a diagram illustrating a specific scheduling method under two TTI configurations according to an embodiment of the present invention.

Detailed Description

In order to make the technical problems, technical solutions and advantages to be solved by the embodiments of the present invention clearer, the following detailed description will be given with reference to the accompanying drawings and specific embodiments.

Embodiments of the present invention provide a method and an apparatus for scheduling dedicated physical data channel data, which can reduce processing delay as much as possible while ensuring interference cancellation gain.

Example one

As shown in fig. 1, the present embodiment provides a DPDCH data scheduling method, which includes:

step 2: selecting corresponding Time delay for each data frame in a Transmission Time Interval (TTI), and issuing a demodulation task at a Time corresponding to one Time delay Tn, wherein n is 1,2,3 … …, and the Time delays of different frames are independent of each other;

The technical solution of this embodiment considers that the demodulation scheduling policy of the DPDCH is changed under the condition of turning on the interference cancellation, so as to reduce the processing delay as much as possible while ensuring the interference cancellation gain.

acquiring a time T1 of TFCI (Transport Format Combination Indicator) information;

t2 moment when HSUPA (high speed uplink packet access) 10ms tti user once demodulates interference cancellation;

time T3 when interference cancellation of other DPDCH channels ends;

The selection principle of the demodulation time is fully prepared for the information required by demodulation, the interference cancellation gain can be obtained, the time points are selected for demodulation according to the existing interference cancellation system, the time points can be increased or decreased according to the difference of interference cancellation scheduling, and meanwhile, for the same user, the time points are traversed for demodulation or a part of the time points are selected for demodulation according to the use condition of resources, the type of the user in the existing system and the like.

According to the TTI configuration of the DPDCH, the time of the first demodulation is selected at the boundary of the minimum TTI, and thus the selected time may be (Tn ═ Ti + the length of the data frame).

Further, the time selection for the first demodulation is also limited by the storage length of the antenna data, the time Tn for the first demodulation is the minimum value of the Ti + data frame length and the antenna data storage length, and i is 1,2,3,4, 5.

Further, the step 3 further comprises:

buffering the demodulated data, storing the latest demodulated data in each frame, covering the primary demodulated data with the secondary demodulated data, forming a complete TTI data by decoding the primary demodulated data of the first frame and the primary demodulated data of the second frame, and sending the complete TTI data to a decoder for decoding.

Further, the step 3 comprises:

In summary, in the embodiment, in the case of configuring one TTI, after the decoding result is obtained, it is determined whether to perform re-demodulation, and in the case of sufficient antenna data length, all frames in the TTI are demodulated each time; for the condition that a plurality of TTIs are configured, whether demodulation is carried out again needs to be judged if each TTI decoding result is obtained, and the decoding adopts the latest demodulation data of each frame in the TTI; for the condition that a plurality of TTIs are configured, the resources are limited, and for the data frames contained after the small TTI decoding is correct, the data frames are not demodulated again and are directly used for the long TTI decoding; for the case where a plurality of TTIs are configured, the resources are not limited, and all data frames contained in the TTI are demodulated before the end of each TTI.

Further, the step 6 comprises:

and judging whether the demodulation time delay of each data frame in the TTI is greater than the antenna data storage length, if the demodulation time delay is greater than the antenna data storage length, not performing next demodulation, otherwise, normally performing the next demodulation.

Further, the step 6 further includes:

when the TTI is greater than 10ms, due to different demodulation delays, received gains for interference cancellation are different for multiple frames in the TTI, and the gain received for the first frame is larger, and if the resource is insufficient, the next demodulation can be performed only for the second frame.

Example two

As shown in fig. 2, the present embodiment provides a DPDCH data scheduling apparatus, which includes:

In the technical scheme of this embodiment, it is considered that the demodulation scheduling policy of the DPDCH is changed under the condition of turning on the interference cancellation, so that the processing delay is reduced as much as possible while the interference cancellation gain is ensured.

EXAMPLE III

The present embodiment provides a DPDCH configured with two TTIs, where the two TTIs are 10ms TTI and 20ms TTI, respectively, and when demodulation resources are sufficient, the specific scheduling method of the present embodiment is as shown in fig. 3:

for 10ms TTI, directly decoding after demodulation is finished, and decoding error of a frame 0 is kept until 5 time points are demodulated and decoded; if one of the decoding is correct, no subsequent demodulation decoding is performed, as shown in fig. 3 for

frames

2,3,4, 5.

For a 20ms TTI, the frames n, n +1 constitute a complete TTI;

the decoding time of the TTI consisting of

frames

0,1 is as follows:

first decoding time: when the down-demodulation of the frame 1 is completed, the data is sent to the decoder together with the last demodulated data of the frame 0, that is, the once demodulated result of the frame 1 and the 4 th demodulated data of the frame 0 are sent to the decoder for decoding.

And the second decoding time: the 4 th demodulation of frame 0 and the 2 nd demodulation of frame 1;

third decoding time: the 5 th demodulation of frame 0 and the 2 nd demodulation of frame 1;

fourth decoding time: the 5 th demodulation of frame 0 and the 3 rd demodulation of frame 1;

fifth decoding time: the 5 th demodulation of frame 0 and the 4 th demodulation of frame 1;

sixth decoding time: the 5 th demodulation of frame 0 and the 5 th demodulation of frame 1;

if the decoding is correct at any time, the subsequent decoding is not required to be carried out.

When the demodulation resources are limited, as shown in fig. 4, a part of the time is selected for demodulation scheduling.

If the frame 0 is demodulated only at T1, T3, and T5, other frames can also be selectively scheduled and demodulated according to the decoding condition and demodulation resources.

Example four

In this embodiment, a DPDCH storing 4 frames of antenna data and configuring two TTIs, which are 20ms TTI and 40ms TTI, is provided, as shown in fig. 5, a specific scheduling method in this embodiment includes the following steps:

step 1: acquiring the TFCI of 20ms tti at the end of frame 1, as shown in fig. 5, issuing

frame

0,1 demodulation, where the time delay of frame 0 is (T1+ data frame length > -T4), and the time delay of frame 1 is T1;

step 2: demodulating the frame 1 for 2 times at the time of T2, wherein the time delay of the time frame 0 is the length of a T2+ data frame, and since the demodulation in the interval of T4< (T2+ data frame length) < T5 is not beneficial, the demodulation of the frame 0 is not carried out, and the secondary demodulation result of the frame 1 and the primary demodulation result of the frame 0 are sent to a decoder for decoding;

and step 3: demodulating frame 1 2 times at time T3, where the time delay of frame 0 is T3+ data frame length, and because T5 < (T3+ data frame length), demodulating and decoding frame 0 and frame 1 at the same time;

and 4, step 4: acquiring TFCI of

frames

2 and 3, namely the end of 40ms TTI, and issuing demodulation of the

frames

2 and 3;

and 5: sending the second demodulation result of the frame 0, the third demodulation result of the frame 1 and the first demodulation result of the

frames

2 and 3 into a decoder for decoding;

step 6: and the decoding of 40ms TTI is wrong, because the delay of the frame 0 exceeds the storage length of the antenna data at the moment, the frame 1 schedules three times of demodulation, the

frames

2 and 3 schedule two times of demodulation, the secondary demodulation result of the frame 0, the three times of demodulation of the frame 1 and the three times of demodulation of the

frames

2 and 3 are sent to a decoder for decoding, the decoding is correct, and the scheduling is finished.

Many of the functional units described in this specification have been labeled as modules, in order to more particularly emphasize their implementation independence.

In embodiments of the present invention, modules may be implemented in software for execution by various types of processors. An identified module of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions which may, for instance, be constructed as an object, procedure, or function. Nevertheless, the executables of an identified module need not be physically located together, but may comprise disparate instructions stored in different physical locations which, when joined logically together, comprise the module and achieve the stated purpose for the module.

Indeed, a module of executable code may be a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Likewise, operational data may be identified within the modules and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed over different locations including over different storage devices, and may exist, at least partially, merely as electronic signals on a system or network.

When a module can be implemented by software, considering the level of existing hardware technology, a module implemented by software may build a corresponding hardware circuit to implement a corresponding function, without considering cost, and the hardware circuit may include a conventional Very Large Scale Integration (VLSI) circuit or a gate array and an existing semiconductor such as a logic chip, a transistor, or other discrete components. A module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices or the like.

In the embodiments of the methods of the present invention, the sequence numbers of the steps are not used to limit the sequence of the steps, and for those skilled in the art, the sequence of the steps is not changed without creative efforts.

While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims.

Claims

1. A method for scheduling DPDCH data in a Dedicated Physical Data Channel (DPDCH), comprising:

and step 3: after the demodulated data of all data frames in the TTI are collected, decoding is carried out, wherein when only one TTI exists, if the antenna data storage length is larger than a preset value, all data frames in the TTI are decoded after being demodulated;

2. The DPDCH data scheduling method of claim 1, wherein the time delay Tn in step 2 is selected from the following time instants:

acquiring the T1 moment of the TFCI information;

t3 moment when DPDCH channel interference cancellation of other users ends;

3. The DPDCH data scheduling method of claim 2, wherein the time Tn of the first demodulation is Ti + the frame length of the data frame, i is 1,2,3,4, 5.

4. The DPDCH data scheduling method of claim 2, wherein the time Tn of the first demodulation is the minimum of the frame length of Ti + data frame and the antenna data storage length, i is 1,2,3,4, 5.

5. The DPDCH data scheduling method of claim 4, wherein when the antenna data storage length is less than the TTI length, the length of one subframe is reserved as the processing time, all data frames in the TTI where the TFCI has been demodulated are demodulated, and the demodulated data are stored.

6. The DPDCH data scheduling method of claim 1, wherein the step 3 further includes:

7. The DPDCH data scheduling method of claim 1, wherein the step 3 further includes:

8. The DPDCH data scheduling method of claim 1, wherein the step 6 includes:

9. The DPDCH data scheduling method of claim 1, wherein the step 6 further includes:

10. A Dedicated Physical Data Channel (DPDCH) data scheduling apparatus, comprising:

the demodulation module is used for demodulating all data frames in the TTI;

the decoding module is used for decoding after the demodulated data of all the data frames in the TTI is collected, wherein when only one TTI exists, if the antenna data storage length is larger than a preset value, all the data frames in the TTI are decoded after being demodulated;

11. The DPDCH data scheduling apparatus of claim 10, wherein the decoding after the collection of the demodulated data of all data frames in the TTI further comprises: