WO2012092762A1 - 一种终端物理层资源分配方法及系统 - Google Patents

一种终端物理层资源分配方法及系统 Download PDF

Info

Publication number
WO2012092762A1
WO2012092762A1 PCT/CN2011/076631 CN2011076631W WO2012092762A1 WO 2012092762 A1 WO2012092762 A1 WO 2012092762A1 CN 2011076631 W CN2011076631 W CN 2011076631W WO 2012092762 A1 WO2012092762 A1 WO 2012092762A1
Authority
WO
WIPO (PCT)
Prior art keywords
scheduling
planning
subframe
activated
flag
Prior art date
Application number
PCT/CN2011/076631
Other languages
English (en)
French (fr)
Inventor
朱国宇
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2012092762A1 publication Critical patent/WO2012092762A1/zh

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W88/00Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/02Terminal devices
    • H04W88/06Terminal devices adapted for operation in multiple networks or having at least two operational modes, e.g. multi-mode terminals

Definitions

  • the present invention relates to the field of mobile communication technologies, and in particular, to a terminal physical layer resource allocation method and system.
  • the software of the mobile communication terminal includes protocol stack software and physical layer control software.
  • the physical layer control software receives the instructions issued by the protocol stack, and controls the physical layer hardware accelerator to perform related operations according to the instructions. Due to the characteristics of the protocol stack itself and the resource limitations of the physical layer hardware accelerator (baseband computing resources are limited rather than infinite), the physical layer control software must perform certain processing on the instructions issued by the protocol stack.
  • the protocol stack contains many different modules and is handled according to the signaling procedures specified by the protocol standards. These processes only see the sequential order in the protocol stack, but they can't see the specific time requirements between them, and they can't see the startup time requirements and completion of the physical layer when these commands are converted into physical layer operations. The specific time of operation, the specific baseband hardware and software used, and RF resources.
  • the physical layer directly executes the commands according to the protocol stack, which often leads to conflicts between the radio and baseband hardware, and the state of the baseband software, which leads to many concurrent non-existence. Execution of the task.
  • the physical layer control software accepts commands from the protocol stack, but when it is delivered to the physical layer, it comprehensively considers the state transition of the physical layer software (that is, needs to consider the state of the current physical layer), and also considers the physical layer's radio frequency, hardware, and processing. Resources, on this basis, clearly divide the tasks performed by the physical layer in each unit time (such as subframes, frames, or even longer time units), determine the order in which tasks are executed, and ensure that the physical layer can execute correctly. The operation required by the protocol stack.
  • the physical layer software scheduling of the mobile communication terminal is a complex process. It is necessary to comprehensively consider the process priority, hardware resources and radio frequency resources according to the instructions issued by the protocol stack, and reasonably arrange the initiation timing of each process.
  • the collected GAP (idle time) information is reported to the protocol stack for the heterogeneous system to arrange the measurement work.
  • the existing terminal physical layer scheduling methods are basically real-time scheduling, and such phenomena often occur.
  • a process scheduling is activated in the next subframe, but the next subframe has another higher priority and the process conflicting with the process needs to be performed, and the execution of the process needs to be cancelled.
  • the existing scheduling methods are also complicated and inefficient, and are not conducive to GAP reporting and power saving. Summary of the invention
  • the present invention provides a method for allocating physical layer resources of a terminal, which pre-plans the start time and end time of each process of the physical layer activated in a time unit;
  • the processes are scheduled according to a predetermined scheduling period, and the process of initiating or stopping execution in the next scheduling period is determined in the current scheduling period.
  • the method further includes:
  • the subframes or time slots occupied by the processes are recorded in the planning table according to the subframes or time slots occupied by the tasks included in the configuration parameters of the processes.
  • the step of recording the subframe or the time slot occupied by each process into the planning table includes: recording, in the planning table, each time slot of each process in the time unit or each time slot in each subframe Occupancy status information, where the time unit is M subframes, and M is a positive integer.
  • the scheduling period is one subframe
  • the steps of the process of initiating or stopping execution within the current scheduling period to determine the next scheduling period include:
  • the conflict check is performed. If there is a higher priority and the process that cannot be concurrent with the current process needs to be executed; or, the process has a lower priority and cannot be concurrent with the current process. The current process has been initiated and the next subframe is not the smallest granularity boundary of the lower priority process.
  • the method further includes: Recording scheduling information of each process, where the scheduling information includes:
  • Planning mark to indicate whether the process has been planned
  • a startup flag that indicates whether the process was started.
  • the step of recording scheduling information of each process includes:
  • the activation flag of the process corresponding to the message is set to be activated; when the message of the deactivation process delivered by the protocol stack is received, the activation flag of the process corresponding to the message is Set to deactivate;
  • the planning flag of the activated process is set to unplanned, or the planning flag of the default activated process is set to unplanned; after the planning of the activated process is completed, the planning mark of the planned process is set to planned ; as well as
  • the startup of the default scheduled process is marked as not started; after the process is started, the startup flag of the started process is set to started; at the end of the process, the startup flag of the finished process is set to not started.
  • the method further includes:
  • the method further includes:
  • the present invention also provides a terminal physical layer resource allocation system, the system comprising: a planning module, configured to pre-plan the start time and end time of each process of the physical layer activated in a time unit;
  • a scheduling module configured to schedule the processes according to a predetermined scheduling period, and determine, in a current scheduling period, a process of starting or stopping execution in a next scheduling period.
  • the planning module is further configured to: when planning the processes, perform the occupied subframes or time slots according to the tasks included in the configuration parameters of the processes, and occupy the processes Subframes or time slots are recorded in the planning table.
  • the planning module is configured to record, in a manner, a subframe or a time slot occupied by each process into a planning table: recording, in the planning table, each subframe or each of the processes in the time unit Occupancy status information of each time slot in a subframe, wherein the time unit is M subframes, and M is a positive integer.
  • the predetermined scheduling period is one subframe
  • the scheduling module is configured to schedule the processes by:
  • the conflict check is performed. If there is a higher priority and the process that cannot be concurrent with the current process needs to be executed; or, the process has a lower priority and cannot be concurrent with the current process. The current process has been initiated and the next subframe is not the smallest granularity boundary of the lower priority process.
  • the planning module is further configured to record the activation flag and the planning flag of each process by: when receiving the message of the activation process delivered by the protocol stack, setting the activation flag of the process corresponding to the message to be activated; When receiving the message of the deactivation process delivered by the protocol stack, the activation flag of the process corresponding to the message is deactivated; after the process is activated, the planning flag of the activated process is set to unplanned, or the process of the default activation process The planning flag is set to unplanned; after the planning of the activation process is completed, the planning mark of the planned process is set as planned;
  • the scheduling module is further configured to record the startup flag of each process by scheduling the following processes: The startup of the process after the default planning is not started; after the process is started, the startup is started. The startup flag of the process is set to Started; at the end of the process, the startup flag of the ending process is set to not started.
  • the system also includes:
  • the derivation module is configured to: deduct each process in one or more scheduling periods, and perform time slots or subframes that are not occupied by any one of the one or more scheduling periods as GAPs.
  • the present invention has at least the following beneficial effects:
  • the present invention sequentially performs the planning, scheduling and derivation of the task process, and simplifies the scheduling of the complex physical layer of the terminal, so that the scheduling process It becomes clear, simple, and easy to implement. At the same time, it can prevent the initiation of tasks that should not be initiated, affect the execution of other tasks, and improve the reliability and stability of physical layer scheduling. In addition, the subsequent operation of the system can be known in advance through deduction. Get the system's free time in advance.
  • the method of the invention is simple and easy to implement, and in the case of dual mode or multimode, more GAP can be provided for different systems for measurement and cell search of different systems, and the overall performance of the system is improved.
  • FIG. 1 is a schematic diagram of a scheduling plan table according to an embodiment of the present invention.
  • FIG. 2 is a flowchart of a class process and c class process scheduling according to an embodiment of the present invention
  • FIG. 3 is a flowchart of b-type process scheduling according to an embodiment of the present invention.
  • the core idea of the present invention is to propose a physical layer resource allocation method according to the characteristics of the physical layer of the terminal, and to process the complex physical layer resource allocation by pre-planning, scheduling and deriving the activated process in each time unit. It is simple and simple, and avoids conflicts between possible processes. In addition, it can also know the subsequent operation of the system in advance, so that the GAP of the system can be obtained in advance, and reported to the protocol stack for different system measurement and sleep use of the system.
  • the present invention provides a method for allocating physical layer resources of a terminal, and specifically adopts the following technical solutions:
  • the processes are scheduled according to a predetermined scheduling period, and the process of initiating or stopping execution in the next scheduling period is determined in the current scheduling period.
  • the sub-frames or time slots occupied by the processes are also recorded according to the tasks included in the configuration parameters of the processes, and the sub-frames or time slots occupied by the processes are recorded to the rule. In the table.
  • the time unit of the planning table is M subframes, and the occupancy status information of the process in each subframe or each time slot is also recorded in the planning table, where M is a positive integer, such as Take 16 or 32, etc.
  • the method further includes:
  • scheduling information of each process where the scheduling information includes:
  • Activation information for indicating whether the process is activated
  • Planning information indicating whether the process is planned
  • the method further includes the step of deriving:
  • the backward scheduling is continued, and after the scheduling of one or N subframes is completed, the time slot or the subframe that is not occupied by any one of the one or N subframes is reported as a GAP; N is a positive integer.
  • the following technical solution description is based on the physical layer scheduling of the TD-SCDMA (Time Division Synchronous Code Division Multiple Access) terminal, but the physical layer scheduling method of the present invention is not limited to the terminal of the TD-SCDMA, and the WCDMA (Broadband) Code division multiple access) is also applicable to physical layer scheduling of LTE (Long Term Evolution) terminals.
  • TD-SCDMA Time Division Synchronous Code Division Multiple Access
  • WCDMA Broadband Code division multiple access
  • the physical layer processes are divided into three categories according to the following characteristics:
  • each row in the scheduling plan represents a physical layer task, such as Auxiliary Common Control Physical Channel (SCCPCH) reception, measurement (MEAS), etc.; each column represents a scheduled time unit, such as a subframe. Each column can be further subdivided into smaller time units, such as time slots.
  • the length of the planning table can be determined according to system requirements.
  • the time slot of each minimum time unit in the scheduling plan table has two states:
  • OCCUP Occupied state, indicating that this time slot is occupied by a task. If it is assumed that SCCPCH procedure A needs to initiate reception in TS0 of subframe 3, then TS0 of subframe 3 of one line of SCCPCH procedure A is set to OCCUP, and other unoccupied time slots are set to NOCCUP.
  • NOCCUP - Unoccupied state if a task process does not work in certain time slots, then these time slots are set to NOCCUP.
  • Schlnfo can be implemented by an array of structures. Each cell in the array corresponds to a task process in the plan table. Each element in the array is a structure containing the following information:
  • ActStatus - the activation flag of the task process, which can take the following values: 1- indicates that the corresponding task process is activated; 0- indicates that the corresponding task process is deactivated.
  • SCCPCH task process A when the protocol stack sends a message requesting activation process A to open the SCCPCH channel, the LIS sets the ActStatus of the SCCPCH A task process to 1 after receiving the message.
  • the protocol stack sends a message requesting to close the SCCPCH channel to deactivate process A, the LIS sets the ActStatus to 0 after receiving the message.
  • PlanStatus The planning mark of the task process, which can take the following values: 1- indicates that the task process has been planned; 0- indicates that the task process has not been planned.
  • the next subframe is interrupted, and the task process is first planned.
  • the so-called planning is to record the timing of the occurrence of the task process into the planning table, except for the current subframe, each subframe of the task process will be Each time slot is set to OCCUP or NOCCUP. Assume that the current subframe is 3, ActStatus is 1, but the PlanStatus is 0, indicating that the SCCPCH receiving process is activated. If not planned, the time slot or subframe occupied by the SCCPCH process is filled according to the parameters configured by the protocol stack. Planning table, planning sub-frame 4 to SCCPCH reception of the last subframe in the planning table. It should be noted that when you write to the end of the planning table, you need to fill it out from the beginning, so you can recycle the planning table.
  • StartStatus - the start tag of the task process, which can take the following values: 1- indicates that the task has started, 0- indicates that the task process has not started.
  • the startup indicates that the configured hardware starts to work.
  • the SCCPCH frame division multiplexing process A is activated and planned.
  • the hardware needs to start the SCCPCH to complete the task A, and the physical layer control software.
  • Sending a message to the device management layer Starts the SCCPCH reception process A and sets the StartStatus to 1.
  • the StartStatus of the SCCPCH A task process needs to be set to zero.
  • the physical layer scheduling process is roughly divided into three steps: planning, scheduling, and derivation.
  • the physical layer resource allocation process in this embodiment is specifically described as follows:
  • the planning can be further divided into the following three stages:
  • Initial planning the initial planning is the first planning after the activation of the task process, and the initial planning is to plan other subframes except the current subframe. According to the previous classification of the physical layer process, the planning method is different.
  • a cycle pattern can be calculated according to the configuration parameters of the protocol stack, starting from the first subframe activated by SCCPCH, until the next SCCPCH activation, taking this time as a cycle.
  • a pattern pointer is set to point to the first active subframe of the SCCPCH procedure.
  • the first planning of the SCCPCH procedure A starts from the N+1 subframe, and the first pattern is filled in to the N+1 in the planning table.
  • the corresponding time slot in the sub-frame, then the pattern pointer is incremented by 1, and then the pattern pointer is incremented by one for each pattern until all remaining sub-frames of the current sub-frame are planned in the full plan table. Since the timing of the initiation of the task can occur periodically, after calculating a cycle, it is not necessary to calculate the initiation of the task each time. Machine. It should be noted that in the subframe in which SCCPCH procedure A occurs, only the time slot occupied by SCCPCH procedure A is set to OCCUP.
  • the initial plan can set the time slots occupied in all subframes except the current subframe to OCCUP.
  • each sub-frame is called once for each active task in the subsequent planning.
  • the subsequent planning only plans one sub-frame at a time, that is, the sub-frame that has just been released.
  • the current sub-frame is N
  • N-1 is just released. That sub-frame, just plan the sub-frame N-1.
  • the value in the pattern is filled in to the N-1 subframe in the plan table.
  • the b-class task process no subsequent planning is done.
  • Planning revocation that is, the task process is revoked, when the planning function of the calling task process finds that the ActStatus of the task process is 0, and the PlanStatus is 1, indicating that the task process has been sold by the protocol stack 4 or has been executed, by the scheduling function Withdraw, set PlanStatus to 0, then set all the subframes and time slots in this task process planning table to NOCCUP. If the startStatus of the task process is also 1, you need to set StartStatus to 0. No further planning for this task process will follow.
  • the scheduling of the task process specifically refers to the execution of a certain task process in a certain subframe.
  • the scheduling in this embodiment is a pre-frame scheduling, that is, the subframe N+1 is scheduled in the subframe N.
  • the scheduling is to determine whether each activation task process can be executed in the subframe N+1.
  • the conflict check is performed, and only when a task process with a higher priority than itself is found Need to be executed, and the high-priority task process and the task process cannot be concurrent; or the task process with lower priority than itself is started, and the next subframe is not the minimum granularity boundary of the low-priority task process (minimum granularity according to the process)
  • minimum granularity according to the process
  • the difference is that the TTI of a process is 8, the minimum granularity is 8 subframes, and the TTI of another process is 4, the minimum granularity is 4), and the task process with low priority cannot be concurrent with the task process. , is considered a conflict.
  • the task process is revoked (ie, in the scheduling plan, this will be The location corresponding to each task is filled in as NOCCUP ). Undo a minimum granularity, such as the length of a TTI.
  • FIG. 2 The flow of scheduling for the a class task process and the c class task process is shown in FIG. 2 , and FIG. 2 is described as follows:
  • Step 101 it is determined whether the task is activated, if yes, step 102 is performed, if not activated, step 109 is performed;
  • Step 102 if the task is activated, it is determined whether the next subframe of the task has a time slot in the OCCUP state, and if yes, step 103 is performed, if not, step 118 is performed;
  • Step 104 performing a conflict check for this task
  • Step 105 it is determined whether there is a conflict, if there is a conflict, step 108 is performed, if there is no conflict, step 106 is performed;
  • Step 108 If a conflict is found, the minimum granularity of the current task starting from the next subframe is cancelled, and the scheduling ends.
  • Step 109 determining whether the current task's StartStatus is equal to 1? If yes, executing step 110, if the StartStatus is not equal to 1, returning to step 101;
  • Step 110 stopping the current task
  • Step 112 Determine whether the next subframe is the minimum granularity boundary of the task, and if yes, perform step 113, and if not, end;
  • Step 113 doing a conflict check for this task
  • step 114 it is determined whether there is a conflict. If there is a conflict, step 115 is performed, and if there is no conflict, the process ends;
  • Step 115 undo the minimum granularity of the current task from the next subframe, and perform the next step.
  • Step 116 stopping the current task;
  • Step 118 If the next subframe of the task is not in the OCCUP state, determine whether the current task's StartStatus is equal to 1, if yes, execute step 119, and if the StartStatus is not equal to 1, end;
  • Step 119 stopping the current task, and performing the next step 120;
  • each sub-frame of the LIS checks whether the next sub-frame is in the task process.
  • Step 201 it is determined whether the current task is activated, if yes, step 202 is performed, if not activated, step 207 is performed;
  • Step 203 performing a conflict check for this task
  • Step 204 it is determined whether there is a conflict, if there is a conflict, step 207 is performed, if there is no conflict, step 205 is performed;
  • Step 205 the usage time slot of the next frame of the task is OCCUP, and the next step 206 is performed;
  • Step 208 stopping the task
  • the derivation of the task process is specifically based on the current sub-frame completion scheduling, and continues to be post-scheduled according to the current scheduling plan SchTable and the scheduling information Schlnfo.
  • Each time a sub-frame is scheduled the time slot or sub-frame that is not occupied by any one of the task processes is used as the GAP. In this way, the GAP that will appear later can be predicted in advance, and reported to the protocol stack for different system measurement and sleep use of the system. .
  • the GAP can no longer be occupied by the physical layer task. At this time, even if there is a class b task to be initiated, the GAP can be scheduled. The highest level, unless the protocol stack issues an order to revoke the currently reported GAP.
  • the physical layer of a communication terminal is generally divided into a plurality of states, and the priorities of the same process in different states may be different.
  • the scheduling of the physical layer is driven by a sub-frame interrupt. Each sub-frame interrupt is scheduled once, and the next sub-frame is scheduled in the current sub-frame. If the current sub-frame is N, the sub-frame N+l is scheduled.
  • PROC1 FMO - time period for inter-frequency measurement or iso-system measurement
  • PROC2 SCCPCH reception
  • PROC3 Inter-frequency BCH reception
  • PROC4 Inter-frequency measurement
  • PROC5 GAP escalation.
  • the above task processes are not necessarily activated in the same subframe, and the physical layer is activated during the process of receiving After the instruction, the ActStatus in Schlnfo is set to 1. If the task process is a class or c task process, the task process is initially planned.
  • the FMO In the FACH state, the FMO has the highest priority.
  • the FMO means that if there is an inter-frequency measurement task process during the FMO, the inter-frequency measurement is prioritized. If there is no inter-frequency measurement task process, the FMO is reported as a GAP. System measurement.
  • the priority received by the SCCPCH is second.
  • the measurement priority is lower than the SCCPCH reception, higher than the BCH reception, but the measurement has no fixed time limit, and the measurement can be performed at all idle times, and the BCH reception must be performed at some fixed time, so when scheduling, Considering that BCH reception is missed, it has to wait for the next cycle, and the time is longer.
  • the measurement can arrange the execution time by itself for a period of time, as long as it is completed within the specified time. Therefore, if the BCH reception conflicts with the measurement, the BCH reception is prioritized.
  • Sub-frames and time-slot resources that are not used by the physical layer can be reported to the protocol stack as GAPs for different system measurements.
  • the GAP reported the lowest priority and was last called once it is determined to be a GAP subframe and time slot, other processes can no longer be used. That is, after the derivation, the GAP of the physical layer is obtained, and the physical layer preferentially schedules the physical layer during scheduling.
  • the priority of the GAP is the lowest, and the time when the physical layer is not used is used as the GAP, and these times are reported as GAP and reported to the protocol. Stack, and other processes can no longer seize these times.
  • the scheduling sequence of each task process in the FACH state is FMO, SCCPCH reception, BCH reception, measurement, and GAP reporting.
  • the scheduling schedule SchTable and the scheduling information Schlnfo are designed.
  • the scheduling of each process, the planning process is described as follows:
  • FMO planning The planning of the FMO process is the same as the planning of the a-class mission process.
  • the FMO pattern is calculated according to the parameters of the protocol stack configuration for initial planning. After the initial planning, each sub-frame will be followed by subsequent planning, and only the one subframe currently released will be planned.
  • FMO scheduling belongs to a class task process, which has a fixed opportunity, but does not need to perform any operations. In the scheduling process, it only needs to maintain the state of the subframe in the scheduling table. FMO scheduling Scheduling the operation of the next subframe in the current subframe,
  • the FMO schedule does not perform any operation and returns directly.
  • the conflict check is performed for the FMO process. If there is a conflict, the next subframe state of the FMO is NOCCUP; if there is no conflict, no operation is performed and the operation is directly returned.
  • SCCPCH reception is a typical a-class task process, planning and scheduling the same class a task process planning.
  • each sub-frame will be followed by subsequent planning, and only the one subframe currently released will be planned.
  • SCCPCH received scheduling The SCCPCH received scheduling schedules the next subframe in the current subframe.
  • the status of the next subframe received by the SCCPCH in the scheduling table is NOCCUP, the StartStatus in Schlnfo is checked.
  • next subframe is the TTI boundary received by the SCCPCH
  • a collision check is performed for the SCCPCH reception.
  • StartStatus 0 to stop SCCPCH reception, and set the SCCPCH reception of the next TTI to NOCCUP in the scheduling plan.
  • next subframe FMO process is in the OCCUP state
  • the next subframe is GAP.
  • the scheduling process of SCCPCH reception can participate in Figure 2.
  • Inter-frequency BCH reception is a typical a-class mission process, planning and scheduling the same class a mission process planning.
  • Inter-frequency BCH reception planning When the inter-frequency BCH reception process is activated, the inter-frequency BCH reception pattern is calculated according to the parameters of the protocol stack configuration, and the initial planning is performed.
  • each sub-frame will be followed by subsequent planning, and only the one subframe currently released will be planned.
  • the scheduling of the inter-frequency BCH reception schedules the operation of the next subframe in the current subframe
  • StartStatus l of the inter-frequency BCH to start the inter-frequency BCH reception. If there is a conflict, the inter-frequency BCH reception of the next TTI is set in the scheduling plan table.
  • next subframe is not the TTI boundary of the inter-frequency BCH reception, no processing is done.
  • next subframe is the TTI boundary of the inter-frequency BCH reception
  • a collision check is performed for the inter-frequency BCH reception.
  • StartStatus 0 to stop the inter-frequency BCH reception, and set the inter-frequency BCH reception of the next TTI to NOCCUP in the scheduling plan.
  • next subframe FMO process is in the OCCUP state
  • the status of the next subframe SCCPCH reception is OCCUP; and the next subframe is GAP.
  • Inter-frequency measurement is a typical b-class task process.
  • the inter-frequency measurement is performed by the physical layer itself, without planning, and only scheduling.
  • the minimum execution granularity of the inter-frequency measurement is one subframe.
  • the scheduling of the inter-frequency measurement is a conflict check for the inter-frequency measurement.
  • the inter-frequency measurement is performed in the next subframe, and the state of the slot used in the next subframe of the inter-frequency measurement is set to OCCUP in the scheduling plan table.
  • the status of the next subframe SCCPCH reception is OCCUP;
  • the state of the next subframe inter-frequency BCH reception is OCCUP; and in the scheduling plan table, the state of the next subframe GAP is OCCUP.
  • the purpose of the deduction is to predict in advance the working state of the physical layer in the N sub-frames of the physical layer.
  • N For the sub-frame or time slot where the physical layer is idle, it can be used as a protocol stack on the GAP for heterogeneous system measurement.
  • the value of N depends on the system requirements.
  • the implementation of the derivation is to continue the scheduling process according to the current scheduling plan SchTable and the scheduling information Schlnfo N times, so that the physical layer working from the current subframe to the next N subframes is obtained, and the physical layer is in an idle state. Subframes and time slots, the GAP process is set to OCCUP in the scheduling plan table, that is, the deduction is completed.
  • the embodiment of the present invention further provides a terminal physical layer resource allocation system, where the system mainly includes:
  • a planning module configured to pre-plan the start time and end time of each process of the physical layer activated in a time unit
  • a scheduling module configured to schedule the processes according to a predetermined scheduling period, The pre-scheduling cycle determines the process of initiating or stopping execution within the next scheduling period.
  • the planning module is further configured to: when planning the processes, respectively, according to tasks included in the configuration parameters of the processes, performing occupied subframes or time slots, and occupying each process The sub-frames or time slots are recorded in the planning table.
  • the planning module is configured to record the subframes or time slots occupied by the processes into the planning table by: recording, in the planning table, each of the processes in the time unit The occupation status information of each time slot in each subframe or each subframe, wherein the time unit is M subframes, and M is a positive integer.
  • the scheduling period is one subframe
  • the scheduling module schedules the processes in sequence according to the priority level when the current subframe schedules the processes in the next subframe; and the process of scheduling each process includes:
  • the conflict check is performed. If there is a higher priority and the process that cannot be concurrent with the process needs to be executed; or, the process has a lower priority and cannot be concurrent with the process. The process has been initiated and the next subframe is not the smallest granularity boundary of the low priority process.
  • the planning module is further configured to record the activation mark and the planning mark of each process by: when receiving the message of the activation process delivered by the protocol stack, setting the activation flag of the corresponding process to be activated When receiving the message of the deactivation process delivered by the protocol stack, the activation flag of the corresponding process is deactivated; after the process is activated, the planning flag of the activated process is set to unplanned, or the planning flag of the default activated process Set to unplanned; after planning the activation process, set its planning mark to planned;
  • the scheduling module is further configured to record the startup flag of each process by scheduling the following processes: The startup of the process after the default planning is not started; after the process is started, the startup is started. The startup flag for the procedure is set to Started; at the end of the process, the startup flag is set to not started.
  • system further includes: a derivation module configured to perform derivation of each process in one or more scheduling periods, A time slot or a subframe that is not occupied by any one of the one or more scheduling periods is reported as a GAP.
  • modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module.
  • the invention is not limited to any particular combination of hardware and software.
  • the present invention uses the scheduling plan SchTable and the scheduling information Schlnfo to sequentially perform the planning, scheduling, and derivation of the task process, and the complex physical layer scheduling of the terminal is simplified, and the scheduling process is changed. It is clear, simple, and easy to implement. At the same time, it can prevent the initiation of tasks that should not be initiated, affect the execution of other tasks, and improve the reliability and stability of physical layer scheduling. In addition, the subsequent operation of the system can be known in advance through deduction. Get the system's free time. The method of the invention is simple and easy to implement. In the case of dual mode or multimode, more GAP can be provided for different systems for measurement and cell search of different systems, and the overall performance of the system is improved.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本发明公开了一种终端物理层资源分配方法及系统,该方法包括:预先对一个时间单元内激活的物理层的各过程的启动时间和结束时间进行规划;以及,按照预定的调度周期对各过程进行调度,在当前调度周期决定下一调度周期内发起或停止执行的过程。本发明在双模或多模情况下可以为异系统提供更多的GAP用于异系统的测量和小区搜索,提高了系统的综合性能。

Description

一种终端物理层资源分配方法及系统
技术领域
本发明涉及移动通信技术领域, 更具体地, 涉及一种终端物理层资源分 配方法及系统。
背景技术
移动通信终端的软件包括协议栈软件和物理层控制软件。 物理层控制软 件接收协议栈下发的指令, 并根据这些指令控制物理层硬件加速器进行相关 的运算。 由于协议栈本身的特点以及物理层硬件加速器的资源限制 (基带运 算资源是有限的而不是无限的) , 物理层控制软件必须对协议栈下发的指令 进行一定的处理。 具体的讲, 协议栈中包含很多不同的模块, 并且按照协议 标准规定的信令流程来处理。 这些流程在协议栈中只看到先后的顺序, 但并 不能看出具体之间先后的时间要求, 也看不到这些命令转化为物理层执行操 作时, 物理层具体执行的启动时间要求、 完成操作的具体时间、 使用到的具 体基带软硬件、 射频等资源。 因此, 如果协议栈直接通过命令和物理层通信, 物理层直接按照协议栈先后命令去执行, 则经常会导致射频、基带硬件冲突, 以及基带软件的状态混乱, 从而带来很多不应该存在的并发任务的执行。
物理层控制软件接受来自协议栈的命令, 但是在下发到物理层时, 综合 考虑物理层软件的状态变迁(即需要考虑当前物理层所处的状态) , 还考虑 物理层的射频、 硬件、 处理器资源, 在此基础上清晰地划分物理层在每个单 元时间 (例如子帧、 帧甚至更长的时间单元) 内执行的任务, 确定任务执行 的先后顺序, 从而保证物理层能够正确的执行协议栈要求的操作。
移动通信终端物理层软件调度是一个复杂的过程, 需要根据协议栈下发 的指令, 综合考虑过程的优先级, 硬件资源和射频资源, 合理安排各过程的 发起时机, 在多模情况下还要收集 GAP (空闲时间 )信息上报给协议栈, 供 异系统安排测量工作。
现有的终端物理层调度方法基本都是即时调度, 时常出现这样的现象, 某一过程调度在下一子帧激活, 可是下一个子帧又有另一个更高优先级且和 本过程冲突的过程需要执行, 则又需要取消本过程的执行。 此外, 现有的调 度方式也比较复杂, 而且效率低, 并且不利于 GAP上报和省电。 发明内容
本发明的目的是提供一种终端物理层资源分配方法及系统, 调度效率更 高。
为解决上述技术问题, 本发明提供了一种终端物理层资源分配方法, 预先对一个时间单元内激活的物理层的各过程的启动时间和结束时间进 行规划; 以及
按照预定的调度周期对所述各过程进行调度, 在当前调度周期决定下一 调度周期内发起或停止执行的过程。
所述方法还包括:
在对所述各过程进行规划时, 分别根据所述各过程的配置参数中包含的 任务执行所占用的子帧或时隙, 将各过程所占用的子帧或时隙记录到规划表 中。
将各过程所占用的子帧或时隙记录到规划表中的步骤包括: 在所述规划 表中记录所述各过程在所述时间单元内的每个子帧或者每个子帧中每个时隙 的占用状态信息, 其中, 所述时间单元为 M个子帧, M为正整数。
所述调度周期为一个子帧;
在当前调度周期决定下一调度周期内发起或停止执行的过程的步骤包 括:
当前过程在下一子帧的状态为占用状态时, 则进行冲突检查, 如果有更 高优先级且与当前过程不能并发的过程需要执行; 或者, 有较低优先级且不 能与当前过程并发的过程已经启动、 且下一子帧不是该较低优先级过程的最 小粒度边界, 则撤销当前过程。
所述方法还包括: 记录所述各过程的调度信息, 所述调度信息包括:
激活标记, 用于表示过程是否被激活;
规划标记, 用于表示过程是否已规划; 和
启动标记, 用于表示过程是否被启动。
所述记录各过程的调度信息的步骤包括:
收到协议栈下发的激活过程的消息时, 将该消息对应的过程的激活标记 置为被激活; 收到协议栈下发的去激活过程的消息时, 将该消息对应的过程 的激活标记置为去激活;
过程激活后, 将激活的过程的规划标记置为未规划, 或者默认激活的过 程的规划标记置为未规划; 在对激活的过程规划完毕后, 将规划完毕的过程 的规划标记置为已规划; 以及
默认规划后的过程的启动标记为未启动; 在过程启动后, 将启动的过程 的启动标记置为已启动; 在过程结束后, 将结束的过程的启动标记置为未启 动。
所述方法还包括:
在调度过程中, 通过冲突检查撤销当前过程时, 如果当前过程的启动标 己为已启动, 则 ^!夺该启动标己置为未启动。
所述方法还包括:
对一个或多个调度周期内的各过程进行推演, 将所述一个或多个调度周 期内没有被任何一个过程占用的时隙或子帧作为空闲时间(GAP )进行上报。
本发明还提供了一种终端物理层资源分配系统, 所述系统包括: 规划模块, 其设置成预先对一个时间单元内激活的物理层各过程的启动 时间和结束时间进行规划; 以及
调度模块, 其设置成按照预定的调度周期对所述各过程进行调度, 在当 前调度周期决定下一调度周期内发起或停止执行的过程。
所述规划模块还设置成: 在对所述各过程进行规划时, 分别根据所述各 过程的配置参数中包含的任务执行所占用的子帧或时隙, 将各过程所占用的 子帧或时隙记录到规划表中。
所述规划模块是设置成通过如下方式将各过程所占用的子帧或时隙记录 到规划表中: 在所述规划表中记录所述各过程在所述时间单元内的每个子帧 或者每个子帧中每个时隙的占用状态信息,其中,所述时间单元为 M个子帧, M为正整数。
所述预定的调度周期为一个子帧;
所述调度模块是设置成通过如下方式对所述各过程进行调度:
当前过程在下一子帧的状态为占用状态时, 则进行冲突检查, 如果有更 高优先级且与当前过程不能并发的过程需要执行; 或者, 有较低优先级且不 能与当前过程并发的过程已经启动、 且下一子帧不是该较低优先级过程的最 小粒度边界, 则撤销当前过程。
所述规划模块还设置成通过如下方式记录所述每个过程的激活标记和规 划标记: 收到协议栈下发的激活过程的消息时, 将该消息对应的过程的激活 标记置为被激活; 收到协议栈下发的去激活过程的消息时, 将该消息对应的 过程的激活标记置为去激活; 过程激活后, 将激活的过程的规划标记置为未 规划, 或者默认激活的过程的规划标记置为未规划; 在对激活的过程规划完 毕后, 将规划完毕的过程的规划标记置为已规划;
所述调度模块还设置成在对所述各过程进行调度时, 通过如下方式记录 所述每个过程的启动标记: 默认规划后的过程的启动标记为未启动; 在过程 启动后, 将启动的过程的启动标记置为已启动; 在过程结束后, 将结束的过 程的启动标记置为未启动。
所述系统还包括:
推演模块, 其设置成: 对一个或多个调度周期内的各过程进行推演, 将 所述一个或多个调度周期内没有被任何一个过程占用的时隙或子帧作为 GAP 进行上才艮。
与现有技术相比, 本发明至少具有如下有益效果:
本发明通过使用调度规划表 SchTable和调度信息 Schlnfo,依次执行任务 过程的规划, 调度和推演, 将终端复杂的物理层调度化繁为简, 使调度过程 变得清晰, 简单, 易于实现; 同时还可以防止不该发起的任务发起, 影响其 他任务的执行, 提高物理层调度的可靠性和稳定性; 此外, 通过推演可以提 前获知系统后续的运行情况, 提前获得系统的空闲时间。 本发明方法简单, 易实现,在双模或多模情况下可以为异系统提供更多的 GAP用于异系统的测 量和小区搜索, 提高了系统的综合性能。
附图概述
此处所说明的附图用来提供对本发明的进一步理解, 构成本申请的一部 分, 本发明的示意性实施例及其说明用于解释本发明, 并不构成对本发明的 不当限定。 在附图中:
图 1为本发明实施例的调度规划表的示意图;
图 2为本发明实施例的 a类过程和 c类过程调度流程图;
图 3为本发明实施例的 b类过程调度流程图。
本发明的较佳实施方式
本发明的核心思想在于, 针对终端物理层的特点, 提出一种物理层资源 分配方法, 通过对每个时间单元内激活的过程进行预先规划、 调度及推演, 将复杂的物理层资源分配过程化繁为简, 且避免了可能出现的过程之间的冲 突, 此外, 还可以提前获知系统后续的运行情况, 从而可以预先获得系统的 GAP, 上报给协议栈进行异系统测量和系统的睡眠使用。
基于上述思想, 本发明提供一种终端物理层资源分配方法, 具体釆用如 下技术方案:
预先对一个时间单元内激活的每个物理层过程的启动时间和结束时间进 行规划; 以及
按照预定的调度周期对所述各过程进行调度, 在当前调度周期决定下一 调度周期内发起或停止执行的过程。
进一步地, 对所述每个过程进行所述规划时, 还根据各过程的配置参数 中包含的任务执行所占的子帧或时隙, 将各过程所占的子帧或时隙记录到规 划表中。
其中, 所述规划表的时间单元为 M个子帧, 在所述规划表中还对应每个 过程记录该过程在每个子帧或每个时隙内的占用状态信息, M为正整数, 如 可以取 16或 32等。
进一步地, 所述方法还包括:
记录所述每个过程的调度信息, 所述调度信息包括:
激活信息, 用于表示所述过程是否被激活;
规划信息, 用于表示所述过程是否已规划; 和
启动信息, 用于表示所述过程是否被启动。
进一步地, 所述方法还包括推演的步骤:
根据当前的调度结果,继续向后调度,在完成一个或 N个子帧的调度后, 将所述一个或 N个子帧中没有被任何一个过程占用的时隙或子帧作为 GAP 进行上报; 其中, N为正整数。
为了便于阐述本发明, 以下将结合附图及具体实施例对本发明技术方案 的实施作进一步详细描述。 需要说明的是, 在不冲突的情况下, 本申请中的 实施例及实施例中的特征可以相互任意组合。
实施例一
以下的技术方案描述是以 TD-SCDMA (时分同步码分多址)终端的物理 层调度为例, 但本发明的这种物理层调度方式并不局限于 TD-SCDMA的终 端, 对于 WCDMA (宽带码分多址)和 LTE (长期演进)终端的物理层调度 同样适用。
针对不同的过程, 其相应的解决方案也会不同, 本实施例中, 根据以下 特征将物理层过程分为 3类:
a)有固定的出现时机(即启动时间) , 而且是周期出现。
b)没有固定的出现时机, 物理层自己安排。
c)激活后一直存在。
在对本实施例的资源分配方法的技术方案进行具体描述之前, 首先对本 实施例方案涉及的如下参数进行说明。
A, 调度规划表(SchTable )
如图 1所示, 调度规划表中的每行代表一个物理层任务, 如辅助公共控 制物理信道(SCCPCH )接收, 测量(MEAS )等; 每列表示一个调度的时间 单元, 如子帧。 而每列又可继续细分为更小的时间单元, 如时隙。 规划表的 长度可以根据系统需求确定。
调度规划表中每个最小时间单元的时隙有两种状态:
OCCUP-占用状态, 表示这个时隙被某任务占用。 如假设 SCCPCH过程 A在子帧 3的 TS0需要启动接收,那么就将 SCCPCH过程 A所占一行的子帧 3的 TS0置为 OCCUP, 其他未占用时隙置 NOCCUP。
NOCCUP-未占用状态, 如果某任务过程在某些时隙不工作, 则将这些时 隙置为 NOCCUP。
B, 调度信息 (Schlnfo )
Schlnfo具体可以通过一个结构体数组实现,数组中的每个单元对应规划 表中的一个任务过程。 数组中每个元素是一个结构体, 包含如下信息:
1 ) ActStatus-任务过程的激活标记, 具体可取如下数值: 1-表示对应任务 过程被激活; 0-表示对应任务过程被去激活。
例如 SCCPCH任务过程 A, 当协议栈下发消息要求激活过程 A打开 SCCPCH信道时, LIS收到消息后将 SCCPCH A任务过程的 ActStatus置为 1。 当协议栈下发消息要求关闭 SCCPCH信道去激活过程 A时, LIS收到消息后 将 ActStatus置为 0。
2 ) PlanStatus-任务过程的规划标记, 具体可以取如下数值: 1-表示任务 过程已规划; 0-表示任务过程还未规划。
在任务过程激活后, 在下一个子帧中断, 首先对任务过程进行规划, 所 谓规划就是将任务过程的出现时机记录到规划表中, 除当前子帧外, 将这个 任务过程的每个子帧的每个时隙都置为 OCCUP或 NOCCUP。 假设当前子帧 为 3 , ActStatus为 1 , 但 PlanStatus为 0 , 表示 SCCPCH接收过程已激活, 未 规划, 就按照协议栈配置的参数将 SCCPCH过程所占用的时隙或子帧填满整 个规划表, 规划子帧 4到规划表中最后一个子帧的 SCCPCH接收。 需要注意 的是, 当写到规划表末尾后需要在从头填写, 这样可以循环使用规划表。
3 ) StartStatus-任务过程的启动标记, 具体可以取如下数值: 1-表示任务 过程已启动, 0-表示任务过程未启动。
所述的启动表示已配置硬件开始工作,例如 SCCPCH帧分复用过程 A被 激活并规划完毕,对于规划表中为 OCCUP的时隙需要启动硬件接收 SCCPCH 完成任务 A的操作, 则物理层控制软件向设备管理层发送消息启动 SCCPCH 接收过程 A后就将 StartStatus置为 1。 而当物理层控制软件向设备管理层发 送消息关闭 SCCPCH接收过程 A后,需要将 SCCPCH A任务过程的 StartStatus 置为 0。
物理层的调度过程大致分为三步: 规划, 调度和推演。 结合上述参数, 本实施例的物理层资源分配过程具体描述如下:
一, 对任务过程的规划
具体是指对各任务过程发起时间和结束时间的规划, 规划进一步又可分 为如下 3个阶段:
1 )初始规划, 初始规划是任务过程激活后的第一次规划, 初始规划要将 除当前子帧外的其他子帧都做规划。 按照前面对物理层过程的分类, 规划方 式有所不同。
对于 a类任务过程, 有固定的出现时间, 如 SCCPCH帧分复用, 只在一 些特定的子帧才接收 SCCPCH, 其他时间 SCCPCH接收处于关闭状态。 对于 这类任务过程, 可以根据协议栈的配置参数计算出一个周期的图样, 从 SCCPCH激活的第一个子帧开始, 直到下一次 SCCPCH激活, 将这段时间作 为一个周期。 并设一个图样指针, 指向 SCCPCH过程的第一个激活子帧。 例 如当前子帧为 N, SCCPCH过程 A从 N+1子帧开始激活, 那么 SCCPCH过 程 A的第一次规划从 N+1子帧开始, 取第一个图样填写到规划表中的 N+1 子帧中的相应时隙,然后图样指针加 1 ,之后每取一个图样就将图样指针加 1 , 直到规划满规划表中除当前子帧的所有剩余子帧。 由于任务的发起时机可以 是周期出现的, 在算出一个周期以后, 就可以不用每次都计算任务的发起时 机了。需要注意的是在 SCCPCH过程 A出现的子帧内,只将 SCCPCH过程 A 占用的时隙置为 OCCUP。
对于 b类任务过程, 由于没有固定的出现时机, 需要物理层见缝插针的 执行, 可以不做规划。
对于 c类任务过程, 由于激活后每个子帧都激活, 初始规划可以将除当 前子帧外的所有子帧内占用的时隙都置为 OCCUP。
2 ) 后续规划,后续规划每个激活任务过程每个子帧都调用一次,后续规 划一次只规划一个子帧, 就是刚刚释放的那个子帧, 如, 当前子帧为 N, N-1 为刚释放的那个子帧, 只需规划子帧 N-1即可。
对于 a类任务过程, 取图样中的数值填写到规划表中的 N-1子帧即可。 对于 b类任务过程, 不做后继规划。
对于 c类任务过程, 直接在 N-1子帧内占用的时隙填写 OCCUP即可。
3 ) 规划撤销,也就是任务过程撤销, 当调用任务过程的规划函数发现任 务过程的 ActStatus为 0, 而 PlanStatus为 1 , 表示此任务过程已被协议栈 4敦销 或已执行完毕, 由调度函数撤销, 这时将 PlanStatus置为 0, 然后将此任务过 程规划表中的所有子帧, 时隙都置为 NOCCUP, 如果任务过程的 StartStatus 也为 1 , 也需要将 StartStatus置为 0。 之后不再对此任务过程做后继规划。
二, 对任务过程的调度
对任务过程的调度具体是指在某一子帧启动或停止某任务过程的执行。 本实施例中的调度是临帧调度, 即在子帧 N调度子帧 N+l。 而调度就是 决定每个激活任务过程在子帧 N+1能否执行,如果任务过程在子帧 N+1的状 态为 OCCUP, 则做冲突检查, 只有当发现有比自己优先级高的任务过程需要 执行, 且这个高优先级任务过程和本任务过程不能并发; 或优先级比自己低 的任务过程已启动, 而且下一个子帧不是这个低优先级任务过程的最小粒度 边界(最小粒度根据过程的不同而不同, 如一个过程的 TTI为 8, 最小粒度 就是 8个子帧; 而另一个过程的 TTI为 4, 则最小粒度就是 4 ) , 且这个优先 级低的任务过程和本任务过程不能并发, 才算作冲突。 当发现本任务过程与 其他任务过程有冲突时就撤销自己的任务过程(即, 在调度规划表中, 将这 个任务对应的位置填写为 NOCCUP )。 撤销时要撤销一个最小粒度, 如一个 TTI的长度。
对于 a类任务过程和 c类任务过程的调度的流程如图 2所示, 参见图 2, 具体描述如下:
步骤 101 , 判断任务是否激活, 如果是, 则执行步骤 102, 若未激活则执 行步骤 109;
步骤 102 , 如果任务已激活, 则判断此任务下一子帧是否有时隙处于 OCCUP状态, 如果是, 则执行步骤 103 , 如果没有则执行步骤 118;
步骤 103 , 判断此任务是否已启动, 即 StartStatus=l?如果是, 则执行步 骤 112, 如果 StartStatus不等于 1则执行步骤 104;
步骤 104, 为此任务做冲突检查;
步骤 105 , 判断是否有冲突, 如果发现有冲突, 则执行步骤 108, 如果没 有冲突则执行步骤 106;
步骤 106, 如果发现没有冲突, 则置 StartStatus=l ,并执行下一步骤 107; 步骤 107 , 启动当前任务, 调度结束;
步骤 108, 发现有冲突, 则撤销从下一子帧开始当前任务一个最小粒度, 调度结束;
步骤 109, 判断当前任务的 StartStatus是否等于 1?如果是, 则执行步骤 110, 如果 StartStatus不等于 1则返回步骤 101 ;
步骤 110, 停止当前任务;
步骤 111 , 置 StartStatus=0, 调度结束;
步骤 112 , 判断下一子帧是否此任务的最小粒度边界, 如果是, 则执行 步骤 113 , 如果不是则结束;
步骤 113 , 为此任务做冲突检查;
步骤 114, 判断是否有冲突, 如果有冲突, 则执行步骤 115 , 如果没有冲 突则结束;
步骤 115 , 撤销从下一子帧开始当前任务一个最小粒度, 并执行下一步 步骤 116, 停止当前任务;
步骤 117, 置 StartStatus=0, 调度结束;
步骤 118,如果此任务下一子帧没有时隙处于 OCCUP状态, 则判断当前 任务的 StartStatus是否等于 1 , 如果是, 则执行步骤 119, 如果该 StartStatus 不等于 1则结束;
步骤 119, 停止当前任务, 并执行下一步骤 120;
步骤 120, 置 StartStatus=0, 调度结束。
对 b类任务过程的调度, 如小区搜索和测量等, 没有固定的执行时机, 由 LIS见缝插针的执行, 因此如果有这类任务过程激活, LIS每个子帧都检 查下一个子帧这个任务过程是否可以执行, 也就是为 b类任务过程做冲突检 查, 如果在 b类任务过程一个最小的执行粒度内, 有更高优先级的任务过程 需要执行, 或有优先级比本任务过程低, 但已经启动, 而且下一个子帧不是 这个低优先级任务过程的最小粒度边界, 则在子帧 N+1本任务过程有冲突, 不安排这个 b类任务过程的执行; 若没有上述的过程存在, 则在子帧 N+1本 任务过程没有冲突, 从 N+1子帧开始将此任务过程一个最小粒度范围内使用 的所有时隙都置为 OCCUP, 并调度在子帧 N+1启动这个任务过程的执行。
b类任务过程的调度的大致流程见图 3 , 当然, 对于不同的 b类任务过程 调度流程在细节上会有差别。 如图 3所示, 具体描述如下:
步骤 201 , 判断当前任务是否激活, 如果是, 则执行步骤 202, 如果未激 活则执行步骤 207;
步骤 202, 判断当前任务是否已启动, 即 StartStatus=l?如果是, 则执行 步骤 207, 如果 StartStatus不等于 1则执行步骤 203;
步骤 203 , 为此任务做冲突检查;
步骤 204, 判断是否有冲突, 如果发现有冲突, 则执行步骤 207, 如果没 有冲突则执行步骤 205;
步骤 205, 置此任务下一帧的使用时隙为 OCCUP, 并执行下一步骤 206;
11 步骤 206, 置此任务的启动标记 StartStatus=l , 调度结束; 步骤 207,判断此任务下一子帧使用的时隙是否处于 OCCUP状态,如果 是, 则结束, 如果该时隙处于 NOOCCUP状态则执行步骤 208;
步骤 208, 停止该任务;
步骤 209, 置此任务的启动标记 StartStatus=0, 调度结束。
三, 对任务过程的推演
对任务过程的推演具体就是在当前子帧完成调度的基础上, 根据当前的 调度规划表 SchTable和调度信息 Schlnfo, 继续向后调度。 每调度一个子帧, 没有被任何一个任务过程占用的时隙或子帧就作为 GAP, 用这种方式可以提 前预知后面将要出现的 GAP, 上报给协议栈做异系统测量和本系统的睡眠使 用。
物理层一旦将 GAP收集完, 并上报给协议栈后, 这个 GAP就不能再被 物理层的任务占用, 此时即使有 b类任务需要发起, 也并能调度执行, 此时 上报的 GAP的优先级最高, 除非协议栈下发指令撤销当前上报的 GAP。
以下将结合本发明的一个具体应用示例对本发明技术方案的实施作更进 一步详细的介绍。
通信终端的物理层一般都分为多个状态, 同一过程在不同状态下的优先 级可以是不同的。 物理层的调度用子帧中断驱动, 每个子帧中断做一次调度, 在当前子帧调度下一个子帧, 如果当前子帧为 N, 则调度子帧 N+l。
以 TD-SCDMA手机终端芯片物理层在 CELL— FACH态下的调度为例, 并假设在 CELL— FACH态下有以下 5个过程激活:
PROC1 : FMO-用于异频测量或异系统测量的时间段;
PROC2: SCCPCH接收;
PROC3: 异频 BCH接收;
PROC4: 异频测量;
PROC5: GAP上报。
以上这些任务过程不一定在同一个子帧激活, 物理层在收到过程激活的 指令后, 将 Schlnfo中的 ActStatus置为 1 ,任务过程如果是 a类或 c类任务过 程还有对任务过程做初始规划。
在 FACH态下, FMO的优先级最高, FMO的含义是在 FMO期间如果有 异频测量任务过程则优先完成异频测量, 如果没有异频测量任务过程, 则将 FMO作为 GAP上报, 用于异系统测量。
SCCPCH接收的优先级次之。
测量的优先级比 SCCPCH接收低, 高于 BCH接收, 但测量没有固定的 时间限制, 可以在所有的空闲时间做测量, 而 BCH接收必须在某些固定的时 间点做, 因此在进行调度时, 考虑 BCH接收如果时间错过了, 就得等下一个 周期, 时间较长, 而测量在一段时间内物理层可以自己安排执行时刻, 只要 在规定的时间内完成就可以了。 因此, 如果 BCH接收与测量冲突, 优先安排 BCH接收。
物理层不用的子帧和时隙资源, 可以作为 GAP上报给协议栈, 做异系统 测量用。 尽管 GAP上报的优先级最低, 最后被调用, 但一旦确定为 GAP的 子帧和时隙, 其他过程就不可以再使用。 即, 经过推演后得出物理层的 GAP, 物理层在调度的时候优先调度物理层的过程, GAP的优先级最低, 物理层不 使用的时间作为 GAP ,—旦这些时间作为 GAP并上报给协议栈了,其他过程 就不能再抢占这些时间。
FACH态下各任务过程的调度顺序是 FMO, SCCPCH接收, BCH接收, 测量, GAP上报。
根据以上过程信息,设计调度规划表 SchTable和调度信息 Schlnfo。各过 程的调度, 规划过程描述如下:
1. FMO的规划和调度;
FMO规划: FMO过程的规划同 a类任务过程的规划。 在 FMO过程激活 时, 根据协议栈配置的参数计算 FMO图样, 做初始规划。 初始规划后, 以后 每个子帧做后继规划, 只规划当前释放的那一个子帧。
FMO调度: FMO属 a类任务过程, 有固定的出现时机, 但不需要执行 什么操作, 在调度过程中只需维护调度规划表中子帧的状态即可。 FMO调度 在当前子帧调度下一个子帧的操作,
当调度规划表中 FMO下一个子帧的状态为 NOCCUP, FMO调度不做任 何操作, 直接返回。
当调度规划表中 FMO下一个子帧的状态为 OCCUP, 为 FMO过程做冲 突检查, 如果存在冲突, 置 FMO下一个子帧状态为 NOCCUP; 如果不存在 冲突, 不做任何操作, 直接返回。
FMO的冲突判断主要检查下一个子帧是否有其他过程处于 StartStatus=l 的状态, 而且这个过程还没有达到一个最小粒度的边界, 如 TTI边界, 如果 有这样的过程存在, FMO不能将这个正在执行的过程打断, 就是有冲突。 如 果没有这样的过程存在就是没有冲突。
2. SCCPCH接收的规划和调度;
SCCPCH接收是典型 a类任务过程,规划和调度同 a类任务过程的规划。
SCCPCH接收的规划: 在 SCCPCH接收过程激活时, 根据协议栈配置的 参数计算 SCCPCH接收的图样, 做初始规划。
初始规划后, 以后每个子帧做后继规划, 只规划当前释放的那一个子帧。
SCCPCH接收的调度: SCCPCH接收的调度在当前子帧调度下一个子帧 的操作, 当调度规划表中 SCCPCH接收的下一个子帧的状态为 NOCCUP,检 查 Schlnfo中的 StartStatus。
如果 StartStatus=l , 停止 SCCPCH接收, 置 StartStatus=0。
如果 StartStatus=0, 不做任何操作。
当调度规划表中 SCCPCH接收的下一个子帧的状态为 OCCUP时, 如果 SCCPCH接收未启动, 即 StartStatus=0, 为 SCCPCH接收做冲突检 查。
如果没有冲突, 置 SCCPCH接收的 StartStatus=l , 启动 SCCPCH接收。 如果有冲突, 在调度规划表中将下一个 TTI 的 SCCPCH接收置为
NOCCUP。
如果 SCCPCH接收已启动, 置 StartStatus=l。 如果下一个子帧不是 SCCPCH接收的 TTI边界, 不做任何处理。
如果下一个子帧是 SCCPCH接收的 TTI边界,为 SCCPCH接收做冲突检 查。
如果没有冲突, 不做任何处理。
如果有冲突, 置 StartStatus=0, 停止 SCCPCH接收, 在调度规划表中将 下一个 TTI的 SCCPCH接收置为 NOCCUP。
SCCPCH的冲突判断, 存在以下情形之一, 可以看做 SCCPCH接收存在 冲突:
调度规划表中, 下一个子帧 FMO过程处于 OCCUP状态;
异频 BCH接收已启动, 即异频 BCH接收的 Schlnfo中的 StartStatus=l , 且下一个子帧不是异频 BCH接收的 TTI边界; 以及
下一个子帧是 GAP。
当然如果有更多过程激活, 那么为 SCCPCH接收做冲突判断时, 还要考 虑其他激活过程。
SCCPCH接收的调度流程可以参加图 2。
3.异频 BCH接收的规划和调度;
异频 BCH接收是典型 a类任务过程,规划和调度同 a类任务过程的规划。 异频 BCH接收的规划: 在异频 BCH接收过程激活时, 根据协议栈配置 的参数计算异频 BCH接收的图样, 做初始规划。
初始规划后, 以后每个子帧做后继规划, 只规划当前释放的那一个子帧。 异频 BCH接收的调度
异频 BCH接收的调度在当前子帧调度下一个子帧的操作,
当调度规划表中异频 BCH接收的下一个子帧的状态为 NOCCUP, 检查 Schlnfo中的 StartStatus。
如果 StartStatus=l , 停止异频 BCH接收, 置 StartStatus=0。
如果 StartStatus=0, 不做任何操作。 当调度规划表中异频 BCH接收的下一个子帧的状态为 OCCUP时, 如果异频 BCH接收未启动, 即 StartStatus=0 ,为异频 BCH接收做冲突检 查。
如果没有冲突, 置异频 BCH接收的 StartStatus=l , 启动异频 BCH接收。 如果有冲突, 在调度规划表中将下一个 TTI 的异频 BCH接收置为
NOCCUP。
如果异频 BCH接收已启动, 置 StartStatus=l。
如果下一个子帧不是异频 BCH接收的 TTI边界, 不做任何处理。
如果下一个子帧是异频 BCH接收的 TTI边界, 为异频 BCH接收做冲突 检查。
如果没有冲突, 不做任何处理。
如果有冲突, 置 StartStatus=0, 停止异频 BCH接收, 在调度规划表中将 下一个 TTI的异频 BCH接收置为 NOCCUP。
异频 BCH接收的冲突判断, 存在以下情形之一, 可以看做异频 BCH接 收存在冲突:
调度规划表中, 下一个子帧 FMO过程处于 OCCUP状态;
调度规划表中, 下一个子帧 SCCPCH接收的状态为 OCCUP; 以及 下一个子帧是 GAP。
当然如果有更多过程激活, 那么为异频 BCH接收做冲突判断时,还要考 虑其他激活过程。
4.异频测量的调度;
异频测量是典型的 b类任务过程,异频测量由物理层自己安排时间执行, 不必做规划, 只执行调度。 而异频测量的最小执行粒度为一个子帧。 异频测 量的调度为异频测量做冲突检查。
如果没有冲突则在下一个子帧执行异频测量, 在调度规划表中将异频测 量的下一个子帧中使用的时隙的状态置为 OCCUP。
如果有冲突, 不执行任何操作。 异频测量的冲突判断,存在以下情形之一, 可以看做异频 BCH接收存在 冲突:
调度规划表中, 下一个子帧 SCCPCH接收的状态为 OCCUP;
调度规划表中, 下一个子帧异频 BCH接收的状态为 OCCUP; 以及 调度规划表中, 下一个子帧 GAP的状态为 OCCUP。
当然如果有更多过程激活, 那么为异频测量做冲突判断时, 还要考虑其 他激活过程。
5.对任务过程的推演;
推演的目的是提前预估物理层后 N个子帧内物理层的工作状态, 对于物 理层空闲的子帧或时隙, 可以作为 GAP上 4艮给协议栈, 用于异系统测量等。 N值依据系统需求而定。
推演的实现就是将激活的过程根据当前调度规划表 SchTable和调度信息 Schlnfo继续调度 N次, 这样就获得了从当前子帧向后 N个子帧的物理层的 工作情况, 对于物理层处于空闲状态的子帧和时隙, 在调度规划表中将 GAP 过程置为 OCCUP, 即完成推演。
就本应用示例来讲, 就是根据当前的调度规划表 SchTable 和调度信息 Schlnfo, 依次做如下操作:
FMO过程调度;
SCCPCH过程调度;
异频 BCH接收调度;
异频测量调度。
重发上面的过程 N次, 设置调度规划表中 GAP过程的状态。
此外, 本发明实施例中还提供了一种终端物理层资源分配系统, 该系统 主要包括:
规划模块, 其设置成预先对一个时间单元内激活的物理层各过程的启动 时间和结束时间进行规划;
调度模块, 其设置成按照预定的调度周期对所述各过程进行调度, 在当 前调度周期决定下一调度周期内发起或停止执行的过程。
更进一步地, 所述规划模块还设置成: 在对所述各过程进行规划时, 分 别根据所述各过程的配置参数中包含的任务执行所占用的子帧或时隙, 将各 过程所占用的子帧或时隙记录到规划表中。
更进一步地, 所述规划模块是设置成通过如下方式将各过程所占用的子 帧或时隙记录到规划表中: 在所述规划表中记录所述各过程在所述时间单元 内的每个子帧或者每个子帧中每个时隙的占用状态信息, 其中, 所述时间单 元为 M个子帧, M为正整数。
更进一步地, 所述调度周期为一个子帧,
所述调度模块在当前子帧对下一子帧内的各过程进行调度时, 按照优先 级高低的顺序依次对所述各过程进行调度; 且对每个过程进行调度的过程包括:
当前过程在下一子帧的状态为占用状态时, 则进行冲突检查, 如果有更 高优先级且与本过程不能并发的过程需要执行; 或者, 有较低优先级且不能 与本过程并发的过程已经启动、 且下一子帧不是该低优先级过程的最小粒度 边界, 则撤销本过程。
更进一步地, 所述规划模块还设置成通过如下方式记录所述每个过程的 激活标记和规划标记: 收到协议栈下发的激活过程的消息时, 将相应过程的 激活标记置为被激活; 收到协议栈下发的去激活过程的消息时, 将相应过程 的激活标记置为去激活; 过程激活后, 将激活的过程的规划标记置为未规划, 或者默认激活的过程的规划标记置为未规划; 在对激活的过程规划完毕后, 将其规划标记置为已规划;
所述调度模块还设置成在对所述各过程进行调度时, 通过如下方式记录 所述每个过程的启动标记: 默认规划后的过程的启动标记为未启动; 在过程 启动后, 将启动的过程的启动标记置为已启动; 在过程结束后, 将启动标记 置为未启动。
更进一步地, 所述系统还包括: 推演模块, 其设置成对一个或多个调度周期内的各过程进行推演, 将所 述一个或多个调度周期内没有被任何一个过程占用的时隙或子帧作为 GAP 进行上报。
以上仅为本发明的优选实施案例而已, 并不用于限制本发明, 本发明还 可有其他多种实施例, 在不背离本发明精神及其实质的情况下, 熟悉本领域 的技术人员可根据本发明做出各种相应的改变和变形, 但这些相应的改变和 变形都应属于本发明所附的权利要求的保护范围。
显然, 本领域的技术人员应该明白, 上述的本发明的各模块或各步骤可 以用通用的计算装置来实现, 它们可以集中在单个的计算装置上, 或者分布 在多个计算装置所组成的网络上, 可选地, 它们可以用计算装置可执行的程 序代码来实现, 从而, 可以将它们存储在存储装置中由计算装置来执行, 并 且在某些情况下, 可以以不同于此处的顺序执行所示出或描述的步骤, 或者 将它们分别制作成各个集成电路模块, 或者将它们中的多个模块或步骤制作 成单个集成电路模块来实现。 这样, 本发明不限制于任何特定的硬件和软件 结合。
工业实用性 与现有技术相比, 本发明通过使用调度规划表 SchTable 和调度信息 Schlnfo, 依次执行任务过程的规划, 调度和推演, 将终端复杂的物理层调度 化繁为简, 使调度过程变得清晰, 简单, 易于实现; 同时还可以防止不该发 起的任务发起, 影响其他任务的执行, 提高物理层调度的可靠性和稳定性; 此外, 通过推演可以提前获知系统后续的运行情况, 提前获得系统的空闲时 间。 本发明方法简单, 易实现, 在双模或多模情况下可以为异系统提供更多 的 GAP用于异系统的测量和小区搜索, 提高了系统的综合性能。

Claims

权 利 要 求 书
1、 一种终端物理层资源分配方法, 包括:
预先对一个时间单元内激活的物理层的各过程的启动时间和结束时间进 行规划; 以及
按照预定的调度周期对所述各过程进行调度, 在当前调度周期决定下一 调度周期内发起或停止执行的过程。
2、 如权利要求 1所述的方法, 还包括:
在对所述各过程进行规划时, 分别根据所述各过程的配置参数中包含的 任务执行所占用的子帧或时隙, 将各过程所占用的子帧或时隙记录到规划表 中。
3、 如权利要求 2所述的方法, 其中,
将各过程所占用的子帧或时隙记录到规划表中的步骤包括: 在所述规划 表中记录所述各过程在所述时间单元内的每个子帧或者每个子帧中每个时隙 的占用状态信息, 其中, 所述时间单元为 M个子帧, M为正整数。
4、 如权利要求 3所述的方法, 其中,
所述预定的调度周期为一个子帧;
在当前调度周期决定下一调度周期内发起或停止执行的过程的步骤包 括:
当前过程在下一子帧的状态为占用状态时, 则进行冲突检查, 如果有更 高优先级且与当前过程不能并发的过程需要执行; 或者, 有较低优先级且不 能与当前过程并发的过程已经启动、 且下一子帧不是该较低优先级过程的最 小粒度边界, 则撤销当前过程。
5、 如权利要求 1-4任一项所述的方法, 还包括:
记录所述各过程的调度信息, 所述调度信息包括:
激活标记, 用于表示过程是否被激活;
规划标记, 用于表示过程是否已规划; 和
启动标记, 用于表示过程是否被启动。
6、 如权利要求 5所述的方法, 其中,
记录各过程的调度信息的步骤包括:
收到协议栈下发的激活过程的消息时, 将该消息对应的过程的激活标记 置为被激活; 收到协议栈下发的去激活过程的消息时, 将该消息对应的过程 的激活标记置为去激活;
过程激活后, 将激活的过程的规划标记置为未规划, 或者默认激活的过 程的规划标记置为未规划; 在对激活的过程规划完毕后, 将规划完毕的过程 的规划标记置为已规划; 以及默认规划后的过程的启动标记为未启动; 在过 程启动后, 将启动的过程的启动标记置为已启动; 在过程结束后, 将结束的 过程的启动标记置为未启动。
7、 如权利要求 6所述的方法, 还包括:
在调度过程中, 通过冲突检查撤销当前过程时, 如果当前过程的启动标 己为已启动, 则 ^!夺该启动标己置为未启动。
8、 如权利要求 1- 4任一项所述的方法, 还包括:
对一个或多个调度周期内的各过程进行推演, 将所述一个或多个调度周 期内没有被任何一个过程占用的时隙或子帧作为空闲时间(GAP )进行上报。
9、 一种终端物理层资源分配系统, 包括:
规划模块, 其设置成预先对一个时间单元内激活的物理层的各过程的启 动时间和结束时间进行规划;
调度模块, 其设置成按照预定的调度周期对所述各过程进行调度, 在当 前调度周期决定下一调度周期内发起或停止执行的过程。
10、 如权利要求 9所述的系统, 其中,
所述规划模块还设置成: 在对所述各过程进行规划时, 分别根据所述各 过程的配置参数中包含的任务执行所占用的子帧或时隙, 将各过程所占用的 子帧或时隙记录到规划表中。
11、 如权利要求 10所述的系统, 其中,
所述规划模块是设置成通过如下方式将各过程所占用的子帧或时隙记录 到规划表中: 在所述规划表中记录所述各过程在所述时间单元内的每个子帧 或者每个子帧中每个时隙的占用状态信息,其中,所述时间单元为 M个子帧, M为正整数。
12、如权利要求 11所述的系统,其中,所述预定的调度周期为一个子帧; 所述调度模块是设置成通过如下方式对所述各过程进行调度:
当前过程在下一子帧的状态为占用状态时, 则进行冲突检查, 如果有更 高优先级且与当前过程不能并发的过程需要执行; 或者, 有较低优先级且不 能与当前过程并发的过程已经启动、 且下一子帧不是该较低优先级过程的最 小粒度边界, 则撤销当前过程。
13、 如权利要求 12所述的系统, 其中,
所述规划模块还设置成通过如下方式记录所述各过程的激活标记和规划 标记: 收到协议栈下发的激活过程的消息时, 将该消息对应的过程的激活标 记置为被激活; 收到协议栈下发的去激活过程的消息时, 将该消息对应的过 程的激活标记置为去激活; 过程激活后, 将激活的过程的规划标记置为未规 划, 或者默认激活的过程的规划标记置为未规划; 在对激活的过程规划完毕 后, 将规划完毕的过程的规划标记置为已规划;
所述调度模块还设置成通过如下方式记录所述每个过程的启动标记: 默 认规划后的过程的启动标记为未启动; 在过程启动后, 将启动的过程的启动 标记置为已启动; 在过程结束后, 将结束的过程的启动标记置为未启动。
14、 如权利要求 9-13任一项所述的系统, 还包括:
推演模块, 其设置成对一个或多个调度周期内的各过程进行推演, 将所 述一个或多个调度周期内没有被任何一个过程占用的时隙或子帧作为空闲时 间 ( GAP )进行上报。
PCT/CN2011/076631 2011-01-04 2011-06-30 一种终端物理层资源分配方法及系统 WO2012092762A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201110000443.7 2011-01-04
CN201110000443.7A CN102573073B (zh) 2011-01-04 2011-01-04 一种终端物理层资源分配方法及系统

Publications (1)

Publication Number Publication Date
WO2012092762A1 true WO2012092762A1 (zh) 2012-07-12

Family

ID=46417233

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/076631 WO2012092762A1 (zh) 2011-01-04 2011-06-30 一种终端物理层资源分配方法及系统

Country Status (2)

Country Link
CN (1) CN102573073B (zh)
WO (1) WO2012092762A1 (zh)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103916970B (zh) * 2012-12-30 2017-08-01 锐迪科(重庆)微电子科技有限公司 多模单待用户设备rat事件调度方法和装置
CN103336574A (zh) * 2013-07-23 2013-10-02 北京百度网讯科技有限公司 数据中心节能控制方法与装置
WO2017132793A1 (en) * 2016-02-01 2017-08-10 Nokia Solutions And Networks Oy Method, system and apparatus
CN107295690B (zh) * 2017-06-07 2020-10-13 武汉虹信通信技术有限责任公司 一种用于lte通信系统的调度实现方法
CN112383964B (zh) * 2020-10-21 2022-07-19 武汉虹信科技发展有限责任公司 无线网络物理层的单核多任务调度方法及系统

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1917409A (zh) * 2005-08-18 2007-02-21 上海原动力通信科技有限公司 多频点hsdpa通信系统中共享数据信道扩充的方法
CN101394656A (zh) * 2007-09-21 2009-03-25 大唐移动通信设备有限公司 一种共享信道的资源分配方法及装置
CN101674151A (zh) * 2008-09-09 2010-03-17 株式会社Ntt都科摩 资源分配方法、基站和移动通信终端

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101500311B (zh) * 2008-01-31 2012-04-04 电信科学技术研究院 一种持续调度资源的分配方法、系统及装置
CN101374281B (zh) * 2008-10-23 2012-05-23 普天信息技术研究院有限公司 一种重定位场景下dpch激活时间的实现方法
CN101917223B (zh) * 2010-05-20 2015-06-03 中兴通讯股份有限公司 一种无线资源的激活时间的控制方法及用户设备

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1917409A (zh) * 2005-08-18 2007-02-21 上海原动力通信科技有限公司 多频点hsdpa通信系统中共享数据信道扩充的方法
CN101394656A (zh) * 2007-09-21 2009-03-25 大唐移动通信设备有限公司 一种共享信道的资源分配方法及装置
CN101674151A (zh) * 2008-09-09 2010-03-17 株式会社Ntt都科摩 资源分配方法、基站和移动通信终端

Also Published As

Publication number Publication date
CN102573073A (zh) 2012-07-11
CN102573073B (zh) 2015-01-28

Similar Documents

Publication Publication Date Title
KR101993076B1 (ko) 보조 셀을 비활성화하기 위한 방법 및 장치, 및 통신 시스템
US11089619B2 (en) Data transmission method, device and system
US7925908B2 (en) Apparatus and method for controlling slotted mode of several systems using one sleep controller in a hybrid terminal of a mobile communication system
US10419941B2 (en) Sending method, device, and access point for occupying an unlicensed carrier
US10555300B2 (en) Data transmission method, data transmission site and computer storage medium
CN108702669A (zh) 具有周期性消息传递的车辆连接的调度与切换
WO2019149117A1 (zh) 选择资源的方法及装置
JP7354114B2 (ja) 帯域幅パートのメンテナンスのための方法および装置
WO2012092762A1 (zh) 一种终端物理层资源分配方法及系统
CN106686727B (zh) 多载波的竞争接入方法、装置及系统
US11825480B2 (en) Method and terminal for performing scheduling request
CN102244932A (zh) 一种资源分配的方法、系统和装置
CN110519794A (zh) 上行传输方法、装置、计算机可读存储介质及终端
CN102821454A (zh) Drx模式下终端保持上行同步的处理方法及装置
CN113812184A (zh) 非连续接收中的唤醒信令处理
CN113950151A (zh) 物理下行控制信道pdcch监测方法、装置及终端
CN113423099B (zh) 蓝牙广播事件调度方法、装置及蓝牙设备
WO2013068925A2 (en) Method and apparatus for controlling wireless devices
EP4319320A1 (en) Discontinuous reception configuration method and apparatus
CN113365326B (zh) 资源调度方法、装置、设备及存储介质
CN111897645B (zh) 多模芯片及终端设备
WO2023116445A1 (zh) 一种通信方法、装置及终端
CN116471574A (zh) 一种直通链路资源选择方法、装置及基站
CN115334694A (zh) 直通链路非连续接收方法、装置及用户设备
WO2012163241A1 (zh) 用户设备物理层资源的调度方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11854586

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11854586

Country of ref document: EP

Kind code of ref document: A1