WO2014161470A1 - 一种同频全双工调度方法和装置 - Google Patents

一种同频全双工调度方法和装置 Download PDF

Info

Publication number
WO2014161470A1
WO2014161470A1 PCT/CN2014/074528 CN2014074528W WO2014161470A1 WO 2014161470 A1 WO2014161470 A1 WO 2014161470A1 CN 2014074528 W CN2014074528 W CN 2014074528W WO 2014161470 A1 WO2014161470 A1 WO 2014161470A1
Authority
WO
WIPO (PCT)
Prior art keywords
downlink
uplink
user
resource
users
Prior art date
Application number
PCT/CN2014/074528
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 WO2014161470A1 publication Critical patent/WO2014161470A1/zh

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/54Allocation or scheduling criteria for wireless resources based on quality criteria
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/535Allocation or scheduling criteria for wireless resources based on resource usage policies

Definitions

  • the present invention relates to the field of wireless technologies in the field of communications, and in particular, to co-frequency full-duplex scheduling Method and device.
  • Time division duplex (TDD) systems such as communication systems TD-SCDMA and TD-LTE All radio frames are divided into 10 subframes and used as downlink subframes or uplink subframes. By configuration not The same number of downlink subframes and the number of uplink subframes match the asymmetric uplink and downlink services.
  • TDD time division duplex
  • TDD systems With the rapid growth of mobile Internet traffic, the capacity and coverage of TDD systems (especially It is hot and indoor). It is increasingly important to design a more flexible uplink and downlink subframe configuration mechanism. Matching the uplink and downlink dynamic characteristics of the service, and second, it is necessary to further improve the spectrum efficiency of the TDD system to enhance the network. Network capacity.
  • low-power, high-density cells are introduced in the design of next-generation communication systems. (such as a large number of pico base stations) to improve the frequency reuse rate, while the same frequency full duplex based on low power base stations Transmission technology is getting more and more attention.
  • the so-called same-frequency full-duplex the main idea is that the base station simultaneously transmits the downlink number in the same time-frequency resource. According to and receiving uplink data, it is theoretically possible to double the spectrum efficiency. Same frequency full duplex needs to be
  • the base station side is respectively configured with a receiving antenna and a transmitting antenna, and the base station needs to send a signal when receiving the uplink signal. The interference caused by the number is eliminated.
  • research institutions have achieved 73dB interference cancellation (if adopted)
  • Directional antennas can even eliminate 113dB interference) in low power base station applications (such as homes) Base stations and pico base stations, etc.) already have the implementation conditions for co-frequency full-duplex transmission.
  • the same-frequency full-duplex transmission is not recommended at the user end. Operation, in this way, one of the simplest and most effective methods is that the base station simultaneously sends and receives two different number of users. According to this, as shown in Figure 1, this also improves the transmission efficiency of the entire system.
  • the base station transmits in the same subframe.
  • the data is sent to UE1, and the data transmitted by UE2 is received in the same subframe. Therefore, the same frequency full duplex transmission.
  • the existing multi-user scheduling mechanism cannot estimate the interference between two users, so there is no The method realizes the same-frequency full-duplex transmission.
  • the invention is to overcome the serious influence of the uplink signal on the downlink signal in the prior art. Defects in Data Transmission According to an aspect of the present invention, a co-frequency full-duplex scheduling method is proposed.
  • the highest priority is found in the resource and the determined downlink user.
  • determining that the downlink user is one of a plurality of downlink users with the highest priority value determining that the downlink user is one of a plurality of downlink users with the highest priority value, and the other The downlink user is the other downlink user with the highest priority value.
  • the invention is to overcome the serious influence of the uplink signal on the downlink signal in the prior art.
  • a co-frequency full duplex scheduling apparatus is proposed.
  • a calculation allocation module configured to calculate a priority value of the downlink user according to the scheduling algorithm, and allocate the resource Assigned to identify downstream users;
  • User search module for finding resources and determining under the condition that the resource is met
  • the downlink user has an uplink user with the highest priority value and obtains the sum of the highest priority values
  • the combination selection module is used to traverse other downlink users on the resource, and is selected for determining the downlink The combination of uplink and downlink users with the highest priority value among the user and other downlink users;
  • determining that the downlink user is one of a plurality of downlink users with the highest priority value determining that the downlink user is one of a plurality of downlink users with the highest priority value, and the other The downlink user is the other downlink user with the highest priority value.
  • the base station prioritizes scheduling during resource scheduling Downlink service, and then schedule uplink services on the same resource according to the scheduling algorithm;
  • the user interferes with the uplink user, and considers the interference of the uplink user to the downlink user and
  • the principle of proportional fairness for the downlink and uplink, the user combination with the largest sum of the uplink and downlink PF values is selected.
  • the effect overcomes the serious interference of the uplink signal to the downlink signal during the same-frequency duplex transmission process, ensuring the upper The transmission quality of downlink data.
  • the invention also provides a co-frequency full-duplex scheduling method, comprising:
  • the setting of the resource For each of the N downlink users with the highest priority value, the setting of the resource is satisfied. Under certain conditions, look up the uplink of the sum of the highest priority values on the resource and the downlink user. User and obtain the sum of the highest priority values;
  • the M is greater than or equal to 1
  • the N is greater than or equal to 1 and less than or equal to M.
  • the invention also provides a co-frequency full-duplex scheduling method, comprising:
  • the setting of the resource is satisfied.
  • the M is greater than or equal to 1
  • the N is greater than or equal to 1 and less than or equal to M.
  • the present disclosure also provides a co-frequency full-duplex scheduling method, including:
  • the M is greater than or equal to 1
  • the N is greater than or equal to 1 and less than or equal to M.
  • 1 is a schematic diagram of co-frequency full-duplex transmission in the prior art
  • FIG. 2 is a schematic diagram of a base station resource according to the present invention.
  • FIG. 3 is a schematic diagram of conditions for satisfying a minimum path loss between uplink and downlink users according to the present invention
  • FIG. 4 is a schematic structural diagram of an embodiment of a co-frequency full-duplex scheduling apparatus according to the present invention.
  • the base station has N resources, and each resource can be uplink and downlink simultaneously.
  • the downlink users may be compared.
  • the core idea of the present invention is that the base station preferentially schedules downlink services on all resources. Then continue to schedule uplink services on the same resource according to certain criteria.
  • the same-frequency full-duplex scheduling method of the present invention includes:
  • Step 1 scheduling of the downlink user: the base station calculates the priority of the downlink user according to a certain scheduling algorithm.
  • Level for example, proportional fairness (PF) in the prior art
  • the algorithm allocates a downlink user on a resource according to the level of the PF value, and the PF value is the most on the resource.
  • the high T downlink users are candidates for pre-allocation. Assume that the downlink transmit power on the i-th resource is Pi (DL), the downlink user's downlink signal to interference and noise ratio is SINRi, and the PF value is the highest on the i th resource.
  • T downlink users as pre-allocation candidates, starting from the downlink user with the highest PF value (assumed to correspond Downstream mth user), that is, PFi (DL, m), for the i-th resource to be allocated to the uplink and downlink users;
  • step 1 the i-th resource uses the prior art for other allocation scheduling processes of the downlink user. carry out.
  • Step 2 scheduling of the uplink user: the base station allocates the uplink receiving power of the user on the resource i as Pi (UL), the following conditions must be met:
  • Th_1 is the base station when receiving the uplink signal The interference suppression capability value of the line signal.
  • PLmin is the minimum path loss between uplink and downlink users, and PLmin(required) is to satisfy the downlink.
  • the minimum path loss between the uplink and downlink users of the signal to interference and noise ratio is shown in Figure 3.
  • , and the corresponding minimum path loss is PLmin x+y*log10(
  • the uplink user's transmit power is the path loss plus the minimum uplink receive power.
  • the interference power of the uplink user to the downlink user is PL(a)+Pmin(UL)-PL(c).
  • the downlink user's received useful signal power is the base station downlink transmit power.
  • the downlink SINR can be expressed as P(DL)-PL(b)-(PL(a)+Pmin(UL)-PL(c))-N, N is noise power. From SINR>SINR0 Demand can be obtained
  • the uplink user sends a reference signal, and the base station obtains the quality of the uplink channel, and the downlink user obtains The uplink user has its own signal quality.
  • the base station selects the uplink users U1, ... Ux that meet the above conditions on the resource i:
  • Step 3 For the resource i, the base station according to the downlink user PFi (DL, m) with the highest PF value Perform scheduling to find the uplink user n, satisfying the following conditions: max(PFi(DL,m)+PFi(UL, n)), after scheduling, the resource i can be obtained in the state of allocating the downlink user PFi (DL, m), The sum of the highest PF values of the uplink and the downlink that can be obtained.
  • Step 4 The base station traverses T-1 PFs other than PFi (DL, m) on resource i
  • the downlink user with the highest value is adjusted according to the above steps 1-3 for each of the downlink users. Degree, obtain the pairing of the uplink and downlink users; select the highest sum of the uplink and downlink PF values from all the pairs Household combination Ux, Uy: max (PFi (DL, x) + PFi (UL, y)).
  • the base station can find the best uplink and downlink users on each resource. Pairing may also be the case where the best match cannot be found.
  • the base station preferentially dispatches the industry when the resource is scheduled And then scheduling the uplink service on the same resource according to the scheduling algorithm; considering the downlink user pair For the interference of the uplink user, the interference of the uplink user to the downlink user is considered, and according to the downlink And the principle of proportional fairness of the uplink, selecting the user combination with the largest sum of the uplink and downlink PF values, effectively overcoming In the process of co-frequency duplex transmission, the uplink signal has serious interference to the downlink signal, ensuring the number of uplink and downlink According to the transmission quality.
  • the present invention discloses a co-frequency full-duplex scheduling apparatus, including:
  • a calculation allocation module configured to calculate a priority value of the downlink user according to the scheduling algorithm, and allocate the resource Assigned to identify downstream users;
  • User search module for finding resources and determining under the condition that the resource is met
  • the downlink user has an uplink user with the highest priority value and obtains the sum of the highest priority values
  • the combination selection module is used to traverse other downlink users on the resource, and is selected for determining the downlink The combination of uplink and downlink users with the highest priority value among the user and other downlink users;
  • determining that the downlink user is one of a plurality of downlink users with the highest priority value determining that the downlink user is one of a plurality of downlink users with the highest priority value, and the other The downlink user is the other downlink user with the highest priority value.
  • the scheduling algorithm is a proportional fair PF scheduling algorithm, and the priority value is a PF value, and the calculation score is a matching module, configured to calculate a PF value of a downlink user according to a PF scheduling algorithm, and allocate resources to The downstream user with the highest PF value.
  • the setting conditions for satisfying resources include:
  • the interference suppression capability value satisfies the setting condition: Pi(DL)-Pi(UL) ⁇ Th_1,
  • the Pi (DL) is the downlink transmission power of the ith resource
  • Pi (UL) is the uplink of the ith resource.
  • Receive power Th_1 is the interference suppression capability value of the downlink signal when the base station receives the uplink signal.
  • the base station preferentially dispatches the industry when the resource is scheduled And then scheduling the uplink service on the same resource according to the scheduling algorithm; considering the downlink user pair For the interference of the uplink user, the interference of the uplink user to the downlink user is considered, and according to the downlink And the principle of proportional fairness of the uplink, selecting the user combination with the largest sum of the uplink and downlink PF values, effectively overcoming In the process of co-frequency duplex transmission, the uplink signal has serious interference to the downlink signal, ensuring the number of uplink and downlink According to the transmission quality.
  • the above detailed description first determines the downlink user, and then matches the uplink user according to the downlink user.
  • the above method is also suitable for determining the uplink user first, and then matching according to the uplink user. In the case of the downlink user, in this way, the optimal uplink and downlink user combination can also be found.
  • the same-frequency full-duplex scheduling method according to the embodiment of the present invention includes:
  • the highest priority is found in the resource and the determined uplink user.
  • determining that the uplink user is one of multiple uplink users with the highest priority value determining that the uplink user is one of multiple uplink users with the highest priority value, and the other The uplink user is the other uplink user with the highest priority value.
  • the present disclosure also provides a co-frequency full-duplex scheduling method, including:
  • the setting of the resource For each of the N downlink users with the highest priority value, the setting of the resource is satisfied. Under certain conditions, look up the uplink of the sum of the highest priority values on the resource and the downlink user. User and obtain the sum of the highest priority values;
  • the M is greater than or equal to 1
  • the N is greater than or equal to 1 and less than or equal to M.
  • the present disclosure also provides a co-frequency full-duplex scheduling method, including:
  • the setting of the resource is satisfied.
  • the M is greater than or equal to 1
  • the N is greater than or equal to 1 and less than or equal to M.
  • the present disclosure also provides a co-frequency full-duplex scheduling method, including:
  • the M is greater than or equal to 1
  • the N is greater than or equal to 1 and less than or equal to M.
  • the invention can have a plurality of different forms of specific embodiments, and the above is combined with FIG. 2 to FIG.
  • the drawings illustrate the technical solutions of the present invention, which does not mean that the specific application of the present invention is applied.
  • the examples can only be limited to a particular process or embodiment structure, and one of ordinary skill in the art will appreciate that The specific embodiments provided above are just a few examples of various preferred uses, any of which exemplifies the present invention.
  • the embodiments of the claims should be within the scope of the claimed invention.

Abstract

本发明公开了一种同频全双工调度方法和装置,该方法包括:根据调度算法计算下行用户的优先级值,将资源分配给确定下行用户;在满足资源的设定条件下,查找在资源上与确定下行用户存在最高优先级值之和的上行用户,并获得最高优先级值之和;遍历资源上的其它下行用户,选出在确定下行用户和其它下行用户中存在最高优先级值之和的上下行用户组合。本发明考虑了上行用户对于下行用户的干扰以及根据下行以及上行的比例公平原则,选择了上下行PF值之和最大的用户组合,有效克服了在同频双工传输过程中上行信号对下行信号的严重干扰,保证了上下行数据的传输质量。

Description

一种同频全双工调度方法和装置
本申请要求于2013年4月1日提交中国专利局的申请号为 201310111183.X,发明名称为“一种同频全双工调度方法和装置”的中国专 利申请的优先权。
技术领域
本发明涉及通信领域中无线技术领域,具体地,涉及同频全双工调度 方法及装置。
背景技术
在时分双工(TDD)系统中,例如通信系统TD-SCDMA和TD-LTE 都是将一个无线帧划分为10个子帧,用作下行子帧或上行子帧。通过配置不 同的下行子帧数与上行子帧数来匹配不对称的上下行业务。
随着移动互联网业务量飞速增长,TDD系统的容量和覆盖问题(尤其 是热点和室内)日益突出:一是需要设计更灵活的上下行子帧配置机制以匹 配业务上下行动态特性,二是需要进一步提高TDD系统的频谱效率以增强网 络容量。这种背景下,在新一代通信系统设计中引入了低功率的高密度小区 (如大量的微微基站)来提升频率复用率,而基于低功率基站的同频全双工 传输技术则得到越来越深度的关注。
所谓同频全双工,主要思路是基站在相同时频资源中同时发送下行数 据和接收上行数据,从而理论上可以成倍提升频谱效率。同频全双工需要在 基站端分别配置接收天线和发射天线,基站在接收上行信号时需要对发送信 号造成的干扰进行消除。目前已有研究机构实现了73dB的干扰消除(若采用 方向性天线,甚至可以消除113dB干扰),在低功率基站应用场景中(如家庭 基站和微微基站等)已具备同频全双工传输的实现条件。
由于干扰消除对硬件要求较高,因此同频全双工传输不建议在用户端 操作,这样,一个最简单而有效的方法是基站同时收发两个不同的用户端数 据,如图1所示,这样同样提高了整个系统的传输效率。
根据图1所示的现有同频全双工传输方案,基站在同一个子帧中发送 数据给UE1,在同样的子帧中接收UE2发送的数据。因此,同频全双工传输 还需要解决多用户调度问题,以及与调度相关的信令传输问题。
在实现本发明过程中,发明人发现图1介绍的全双工传输方案中至少 存在如下问题:
1、与基站同频全双工传输的两个用户,一个发送上行信号,另一个接 收下行信号,因此上行用户发送的上行信号会对占用相同资源的另一个下行 用户接收的下行信号造成干扰,如果该干扰不能避免或消除,则会造成另一 个用户接收下行数据失败。
2、现有的多用户调度机制无法估计两个用户之间的干扰情况,因此无 法实现同频全双工传输。
发明内容
本发明是为了克服现有技术中上行信号对下行信号干扰严重进而影响 数据传输的缺陷,根据本发明的一个方面,提出一种同频全双工调度方法。
根据本发明实施例的同频全双工调度方法,包括:
根据调度算法计算下行用户的优先级值,将资源分配给确定下行用户;
在满足资源的设定条件下,查找在资源上与确定下行用户存在最高优 先级值之和的上行用户,并获得最高优先级值之和;
遍历资源上的其它下行用户,选出在确定下行用户和其它下行用户中 存在最高优先级值之和的上下行用户组合;
其中,确定下行用户为优先级值最高的多个下行用户中的一个,其它 下行用户为其它的优先级值最高的下行用户。
本发明是为了克服现有技术中上行信号对下行信号干扰严重进而影响 数据传输的缺陷,根据本发明的另一个方面,提出一种同频全双工调度装置。
根据本发明实施例的同频全双工调度装置,包括:
计算分配模块,用于根据调度算法计算下行用户的优先级值,将资源 分配给确定下行用户;
用户查找模块,用于在满足资源的设定条件下,查找在资源上与确定 下行用户存在最高优先级值之和的上行用户,并获得最高优先级值之和;
组合选出模块,用于遍历资源上的其它下行用户,选出在确定下行用 户和其它下行用户中存在最高优先级值之和的上下行用户组合;
其中,确定下行用户为优先级值最高的多个下行用户中的一个,其它 下行用户为其它的优先级值最高的下行用户。
本发明的同频全双工调度方法和装置,基站在资源调度时,优先调度 下行业务,然后根据调度算法在相同的资源上调度上行业务;既考虑了下行 用户对于上行用户的干扰,又考虑了上行用户对于下行用户的干扰以及根据 下行以及上行的比例公平原则,选择了上下行PF值之和最大的用户组合,有 效克服了在同频双工传输过程中上行信号对下行信号的严重干扰,保证了上 下行数据的传输质量。
本发明还提供了一种同频全双工调度方法,包括:
根据调度算法计算一资源上的M个下行用户的优先级值;
针对优先级值最高的N个下行用户中的每一个,在满足所述资源的设 定条件下,查找在所述资源上与所述下行用户存在最高优先级值之和的上行 用户,并获得所述最高优先级值之和;
将所述资源分配给所述最高优先级值之和最大的上下行用户组合,
其中,所述M大于等于1,所述N大于等于1小于等于M。
本发明还提供了一种同频全双工调度方法,包括:
根据调度算法计算一资源上的M个上行用户的优先级值;
针对优先级值最高的N个上行用户中的每一个,在满足所述资源的设 定条件下,查找在所述资源上与所述上行用户存在最高优先级值之和的下行 用户,并获得所述最高优先级值之和;
将所述资源分配给所述最高优先级值之和最大的上下行用户组合,
其中,所述M大于等于1,所述N大于等于1小于等于M。
本公开还提供了一种同频全双工调度方法,包括:
计算一资源上的M个下行用户的优先级值;
针对优先级值最高的N个下行用户中的每一个,查找在所述资源上与 所述下行用户存在最高容量和的上行用户,并获得所述上行用户和所述下行 用户的优先级值之和;
将所述资源分配给所述最高优先级值之和最大的上下行用户组合,
其中,所述M大于等于1,所述N大于等于1小于等于M。本发明的 其它特征和优点将在随后的说明书中阐述,并且,部分地从说明书中变得显 而易见,或者通过实施本发明而了解。本发明的目的和其他优点可通过在所 写的说明书、权利要求书、以及附图中所特别指出的结构来实现和获得。
下面通过附图和实施例,对本发明的技术方案做进一步的详细描述。
附图说明
附图用来提供对本发明的进一步理解,并且构成说明书的一部分,与 本发明的实施例一起用于解释本发明,并不构成对本发明的限制。在附图中:
图1为现有技术中同频全双工传输示意图;
图2为本发明基站资源的示意图;
图3为本发明上下行用户间的最小路径损耗需满足条件的示意图;
图4为本发明同频全双工调度装置实施例的结构示意图。
具体实施方式
下面结合附图,对本发明的具体实施方式进行详细描述,但应当理解 本发明的保护范围并不受具体实施方式的限制。
如图2-3所示,基站共有N个资源,每个资源都可以同时进行上下行 资源的传输,N个资源上可以调度U个上行和D个下行的用户(U<=N,D<=N)。
为了克服现有技术中占用相同资源的上行用户对下行用户可能造成较 大干扰的问题,本发明的核心思想是,基站在所有资源上优先调度下行业务, 然后根据一定的准则继续在相同的资源上调度上行业务。
根据本发明的实施例,本发明的同频全双工调度方法包括:
步骤1,下行用户的调度:基站按照某种调度算法计算下行用户的优先 级,例如现有技术中的比例公平调度(proportional fairness,以下简称PF) 算法,根据PF值的高低在某个资源上分配下行用户,在该资源上将PF值最 高的T个下行用户作为预分配候选。假定第i个资源上的下行发送功率为Pi (DL),下行用户的下行信干噪比为SINRi,在第i个资源上将PF值最高的 T个下行用户作为预分配候选,从其中最高PF值的下行用户开始(假设对应 下行第m个用户),即PFi(DL,m),对第i个资源进行上下行用户的分配;
在步骤1中,第i个资源对下行用户的其它分配调度过程采用现有技术 完成。
步骤2,上行用户的调度:基站在资源i上分配用户的上行接收功率为 Pi(UL),需满足以下条件:
(1)Pi(DL)-Pi(UL)<Th_1,Th_1为基站接收上行信号时对下 行信号的干扰抑制能力值。
(2)PLmin>=PLmin(required),
PLmin为上下行用户间的最小路径损耗,PLmin(required)为满足下行 信干噪比的上下行用户间的最小路径损耗,如图3所示。
一般路径损耗可以写成如下形式:PL=x+y*log10(d),其中x,y为信道 模型中的常数,d为用户到基站的距离。根据上行用户和下行用户各自的路 径损耗PL(a)和PL(b),我们可以推出各自到基站的距离a,b。上下行用户之 间距离c的最小值cmin=|a-b|,对应的可能的最小的路径损耗为PLmin= x+y*log10(|a-b|)。用户n对用户m的干扰应该足够小,使得用户m的SINR 满足需求(SINR>SINR0)。
上行用户的发送功率为路径损耗加上最小的上行接收功率 PL(a)+Pmin(UL),上行用户对于下行用户的干扰功率为 PL(a)+Pmin(UL)-PL(c)。下行用户的接收有用信号功率为基站下行发送功率 减去下行链路的路径损耗,P(DL)-PL(b)。下行SINR可以表示为 P(DL)-PL(b)-(PL(a)+Pmin(UL)-PL(c))-N,N为噪声功率。从SINR>SINR0 的需求可以得到
PL(c)>=PL(a)+Pmin(UL)-(P(DL)-PL(b))+SINR0+N=PLmin(required) 所以,当PLmin>PLmin(required)时,上行用户对于下行用的干扰在可以接 受的范围内。
(3)上行用户发送参考信号,基站获得上行信道的质量,下行用户获 得上行用户到自身的信号质量。下行用户反馈下行信道质量,也要反馈对自 身干扰超过自身承受能力或者在自身承受能力之内的上行用户的ID(具体为 参考信号序列)。
基站在资源i上选择满足上述条件的上行用户U1,…Ux:
调度上行用户的时候,首先要考虑基站接收上行信号时对下行信号的 干扰抑制能力值(即上述条件(1)),然后还要考虑上行信号对于下行信号接 收的干扰水平(即上述条件(2)),如果想获得确切的上行信号对下行信号的 干扰,需要更多的信令开销,即上述条件(3)。
步骤3,对资源i,基站根据上述PF值最高的下行用户PFi(DL,m) 进行调度,找出上行用户n,满足下列条件:max(PFi(DL,m)+PFi(UL, n)),经过调度后,可以获得资源i在分配下行用户PFi(DL,m)的状态下, 能够获得的上下行最高PF值之和。
步骤4,基站在资源i上遍历除PFi(DL,m)之外的其它T-1个PF 值最高的下行用户,对于其中每个下行用户都依次按照上述步骤1-3进行调 度,获得上下行用户的配对;从所有的配对中选出上下行PF值之和最高的用 户组合Ux,Uy:max(PFi(DL,x)+PFi(UL,y))。
根据上述步骤1-4,在每个资源上,基站都可以找到最佳的上下行用户 配对,也可能存在无法找到最佳配对的情况。
本发明的同频全双工调度方法,基站在资源调度时,优先调度下行业 务,然后根据调度算法在相同的资源上调度上行业务;既考虑了下行用户对 于上行用户的干扰,又考虑了上行用户对于下行用户的干扰以及根据下行以 及上行的比例公平原则,选择了上下行PF值之和最大的用户组合,有效克服 了在同频双工传输过程中上行信号对下行信号的严重干扰,保证了上下行数 据的传输质量。
如图4所示,本发明公开了一种同频全双工调度装置,包括:
计算分配模块,用于根据调度算法计算下行用户的优先级值,将资源 分配给确定下行用户;
用户查找模块,用于在满足资源的设定条件下,查找在资源上与确定 下行用户存在最高优先级值之和的上行用户,并获得最高优先级值之和;
组合选出模块,用于遍历资源上的其它下行用户,选出在确定下行用 户和其它下行用户中存在最高优先级值之和的上下行用户组合;
其中,确定下行用户为优先级值最高的多个下行用户中的一个,其它 下行用户为其它的优先级值最高的下行用户。
其中:调度算法为比例公平PF调度算法,优先级值为PF值,计算分 配模块,具体用于根据PF调度算法计算下行用户的PF值,将资源分配给 PF值最高的下行用户。
其中,满足资源的设定条件包括:
获得基站接收上行信号时对下行信号的干扰抑制能力值,干扰抑制能 力值满足设定条件。
其中,干扰抑制能力值满足设定条件包括:Pi(DL)-Pi(UL)<Th_1, 所述Pi(DL)为第i个资源的下行发送功率,Pi(UL)为第i个资源的上行 接收功率,Th_1为基站接收上行信号时对下行信号的干扰抑制能力值。
其中,满足资源的设定条件还包括:PLmin>=PLmin(require),PLmin 为上下行用户间的最小路径损耗,PLmin(required)为满足下行信干噪比的上 下行用户间的最小路径损耗。
本发明的同频全双工调度装置,基站在资源调度时,优先调度下行业 务,然后根据调度算法在相同的资源上调度上行业务;既考虑了下行用户对 于上行用户的干扰,又考虑了上行用户对于下行用户的干扰以及根据下行以 及上行的比例公平原则,选择了上下行PF值之和最大的用户组合,有效克服 了在同频双工传输过程中上行信号对下行信号的严重干扰,保证了上下行数 据的传输质量。
上面详细介绍了先确定下行用户,然后根据下行用户匹配上行用户的 技术方案。但上述方法同样适用于先确定上行用户,然后根据上行用户匹配 下行用户的情况,利用这种方式,同样可以找到最优的上下行用户组合。
如,根据本发明实施例的同频全双工调度方法,包括:
根据调度算法计算上行用户的优先级值,将资源分配给确定上行用户;
在满足资源的设定条件下,查找在资源上与确定上行用户存在最高优 先级值之和的下行用户,并获得最高优先级值之和;
遍历资源上的其它上行用户,选出在确定上行用户和其它上行用户中 存在最高优先级值之和的上下行用户组合;
其中,确定上行用户为优先级值最高的多个上行用户中的一个,其它 上行用户为其它的优先级值最高的上行用户。
该方案的具体细节可参见上面实施例的描述。
本公开还提供了一种同频全双工调度方法,包括:
根据调度算法计算一资源上的M个下行用户的优先级值;
针对优先级值最高的N个下行用户中的每一个,在满足所述资源的设 定条件下,查找在所述资源上与所述下行用户存在最高优先级值之和的上行 用户,并获得所述最高优先级值之和;
将所述资源分配给所述最高优先级值之和最大的上下行用户组合,
其中,所述M大于等于1,所述N大于等于1小于等于M。
另外,本公开还提供了一种同频全双工调度方法,包括:
根据调度算法计算一资源上的M个上行用户的优先级值;
针对优先级值最高的N个上行用户中的每一个,在满足所述资源的设 定条件下,查找在所述资源上与所述上行用户存在最高优先级值之和的下行 用户,并获得所述最高优先级值之和;
将所述资源分配给所述最高优先级值之和最大的上下行用户组合,
其中,所述M大于等于1,所述N大于等于1小于等于M。
另外,本公开还提供了一种同频全双工调度方法,包括:
计算一资源上的M个下行用户的优先级值;
针对优先级值最高的N个下行用户中的每一个,查找在所述资源上与 所述下行用户存在最高容量和的上行用户,并获得所述上行用户和所述下行 用户的优先级值之和;
将所述资源分配给所述最高优先级值之和最大的上下行用户组合,
其中,所述M大于等于1,所述N大于等于1小于等于M。
本发明能有多种不同形式的具体实施方式,上面以图2-图4为例结合 附图对本发明的技术方案作举例说明,这并不意味着本发明所应用的具体实 例只能局限在特定的流程或实施例结构中,本领域的普通技术人员应当了解, 上文所提供的具体实施方案只是多种优选用法中的一些示例,任何体现本发 明权利要求的实施方式均应在本发明技术方案所要求保护的范围之内。
最后应说明的是:以上所述仅为本发明的优选实施例而已,并不用于 限制本发明,尽管参照前述实施例对本发明进行了详细的说明,对于本领域 的技术人员来说,其依然可以对前述各实施例所记载的技术方案进行修改, 或者对其中部分技术特征进行等同替换。凡在本发明的精神和原则之内,所 作的任何修改、等同替换、改进等,均应包含在本发明的保护范围之内。

Claims (14)

  1. 一种同频全双工调度方法,其特征在于,包括:
    根据调度算法计算下行用户的优先级值,将资源分配给确定下行用户;
    在满足所述资源的设定条件下,查找在所述资源上与所述确定下行用户 存在最高优先级值之和的上行用户,并获得所述最高优先级值之和;
    遍历所述资源上的其它下行用户,选出在所述确定下行用户和其它下行 用户中存在最高优先级值之和的上下行用户组合;
    其中,所述确定下行用户为优先级值最高的多个下行用户中的一个,所 述其它下行用户为其它的优先级值最高的下行用户。
  2. 根据权利要求1所述的方法,其特征在于,所述调度算法为比例公平 调度算法,所述优先级值为比例公平值,所述根据调度算法计算下行用户的 优先级值,将资源分配给确定下行用户的步骤包括:
    根据比例公平调度算法计算下行用户的比例公平值,将所述资源分配给 PF值最高的下行用户。
  3. 根据权利要求1所述的方法,其特征在于,所述满足资源的设定条件 包括:
    获得基站接收上行信号时对下行信号的干扰抑制能力值,所述干扰抑制 能力值满足设定条件。
  4. 根据权利要求3所述的方法,其特征在于,所述干扰抑制能力值满足 设定条件包括:Pi(DL)-Pi(UL)<Th_1
    其中,所述Pi(DL)为第i个资源的下行发送功率,Pi(UL)为第i个 资源的上行接收功率,Th_1为基站接收上行信号时对下行信号的干扰抑制能 力值。
  5. 根据权利要求3所述的方法,其特征在于,所述满足资源的设定条件 还包括:PLmin>=PLmin(required),
    其中,PLmin为上下行用户间的最小路径损耗,PLmin(required)为满足 下行信干噪比的上下行用户间的最小路径损耗。
  6. 根据权利要求1所述的方法,其特征在于,还包括:
    所述上行用户发送参考信号,基站获得上行信道的质量信息;
    所述下行用户获得上行用户到自身的信号质量信息,反馈下行信道质量 信息,并反馈对自身干扰超过自身承受能力或者在自身承受能力之内的上行 用户的参考信号序列。
  7. 一种同频全双工调度装置,其特征在于,包括:
    计算分配模块,用于根据调度算法计算下行用户的优先级值,将资源分 配给确定下行用户;
    用户查找模块,用于在满足所述资源的设定条件下,查找在所述资源上 与所述确定下行用户存在最高优先级值之和的上行用户,并获得所述最高优 先级值之和;
    组合选出模块,用于遍历所述资源上的其它下行用户,选出在所述确定 下行用户和其它下行用户中存在最高优先级值之和的上下行用户组合;
    其中,所述确定下行用户为优先级值最高的多个下行用户中的一个,所 述其它下行用户为其它的优先级值最高的下行用户。
  8. 根据权利要求7所述的装置,其特征在于,所述调度算法为比例公平 调度算法,所述优先级值为比例公平值,所述计算分配模块,具体用于根据 比例公平调度算法计算下行用户的比例公平值,将所述资源分配给比例公平 值最高的下行用户。
  9. 根据权利要求7所述的装置,其特征在于,所述满足资源的设定条件 包括:
    获得基站接收上行信号时对下行信号的干扰抑制能力值,所述干扰抑制 能力值满足设定条件。
  10. 根据权利要求9所述的装置,其特征在于,所述干扰抑制能力值满足 设定条件包括:Pi(DL)-Pi(UL)<Th_1
    其中,所述Pi(DL)为第i个资源的下行发送功率,Pi(UL)为第i个 资源的上行接收功率,Th_1为基站接收上行信号时对下行信号的干扰抑制能 力值。
  11. 根据权利要求9所述的装置,其特征在于,所述满足资源的设定条件 还包括:PLmin>=PLmin(require),
    其中,PLmin为上下行用户间的最小路径损耗,PLmin(required)为满足 下行信干噪比的上下行用户间的最小路径损耗。
  12. 一种同频全双工调度方法,其特征在于,包括:
    根据调度算法计算一资源上的M个下行用户的优先级值;
    针对优先级值最高的N个下行用户中的每一个,在满足所述资源的设定 条件下,查找在所述资源上与所述下行用户存在最高优先级值之和的上行用 户,并获得所述最高优先级值之和;
    将所述资源分配给所述最高优先级值之和最大的上下行用户组合,
    其中,所述M大于等于1,所述N大于等于1小于等于M。
  13. 一种同频全双工调度方法,其特征在于,包括:
    根据调度算法计算一资源上的M个上行用户的优先级值;
    针对优先级值最高的N个上行用户中的每一个,在满足所述资源的设定 条件下,查找在所述资源上与所述上行用户存在最高优先级值之和的下行用 户,并获得所述最高优先级值之和;
    将所述资源分配给所述最高优先级值之和最大的上下行用户组合,
    其中,所述M大于等于1,所述N大于等于1小于等于M。
  14. 一种同频全双工调度方法,其特征在于,包括:
    计算一资源上的M个下行用户的优先级值;
    针对优先级值最高的N个下行用户中的每一个,查找在所述资源上与所 述下行用户存在最高容量和的上行用户,并获得所述上行用户和所述下行用 户的优先级值之和;
    将所述资源分配给所述最高优先级值之和最大的上下行用户组合,
    其中,所述M大于等于1,所述N大于等于1小于等于M。
PCT/CN2014/074528 2013-04-01 2014-04-01 一种同频全双工调度方法和装置 WO2014161470A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201310111183.X 2013-04-01
CN201310111183.XA CN104105208B (zh) 2013-04-01 2013-04-01 一种同频全双工调度方法和装置

Publications (1)

Publication Number Publication Date
WO2014161470A1 true WO2014161470A1 (zh) 2014-10-09

Family

ID=51657600

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/074528 WO2014161470A1 (zh) 2013-04-01 2014-04-01 一种同频全双工调度方法和装置

Country Status (2)

Country Link
CN (1) CN104105208B (zh)
WO (1) WO2014161470A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105813217A (zh) * 2016-03-09 2016-07-27 北京大学 同时同频全双工用户快速分簇调度方法

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016061725A1 (zh) * 2014-10-20 2016-04-28 华为技术有限公司 无线全双工通信的方法、装置、站点及接入点
CN104981023B (zh) * 2015-06-26 2018-09-21 国家电网公司 一种电力无线通信资源调度方法
CN106877993B (zh) * 2015-12-11 2020-03-27 华为技术有限公司 一种配置方法和装置
US10009143B2 (en) * 2016-03-03 2018-06-26 Futurewei Technologies, Inc. System and method for multi-user full duplex link adaptation

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004032372A1 (en) * 2002-10-01 2004-04-15 Koninklijke Philips Electronics N.V. Telecommunication system with non-(re)allocatable and (re)allocatable timeslots
CN1826007A (zh) * 2005-02-23 2006-08-30 大唐移动通信设备有限公司 多频点条件下时分双工系统的接入优先级排队方法
CN1953350A (zh) * 2005-10-20 2007-04-25 华为技术有限公司 对用户进行上行调度以及上下行联合调度的方法
CN102448177A (zh) * 2010-10-13 2012-05-09 中国移动通信集团江苏有限公司 一种移动通信系统中的资源调度方法和装置

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20100037883A (ko) * 2008-10-02 2010-04-12 삼성전자주식회사 광대역 무선통신 시스템에서 상향링크 스케줄링 우선순위 결정 장치 및 방법
CN101868032B (zh) * 2009-04-17 2013-05-08 电信科学技术研究院 用户调度优先级的确定装置和方法以及调度装置、方法
CN102149204B (zh) * 2011-02-01 2013-10-02 华为技术有限公司 一种信道资源调度方法、系统及基站
CN102281647A (zh) * 2011-09-09 2011-12-14 华为技术有限公司 联合调度方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2004032372A1 (en) * 2002-10-01 2004-04-15 Koninklijke Philips Electronics N.V. Telecommunication system with non-(re)allocatable and (re)allocatable timeslots
CN1826007A (zh) * 2005-02-23 2006-08-30 大唐移动通信设备有限公司 多频点条件下时分双工系统的接入优先级排队方法
CN1953350A (zh) * 2005-10-20 2007-04-25 华为技术有限公司 对用户进行上行调度以及上下行联合调度的方法
CN102448177A (zh) * 2010-10-13 2012-05-09 中国移动通信集团江苏有限公司 一种移动通信系统中的资源调度方法和装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105813217A (zh) * 2016-03-09 2016-07-27 北京大学 同时同频全双工用户快速分簇调度方法

Also Published As

Publication number Publication date
CN104105208A (zh) 2014-10-15
CN104105208B (zh) 2017-09-26

Similar Documents

Publication Publication Date Title
Zeng et al. Realistic indoor hybrid WiFi and OFDMA-based LiFi networks
US9503934B2 (en) System and method for radio access virtualization
US9288817B2 (en) Method and system for coordinated scheduling based on cell priority
US20130265916A1 (en) Coordinated scheduling for time division duplex network
WO2014161470A1 (zh) 一种同频全双工调度方法和装置
JP2017511075A (ja) Ulからdlへの干渉を軽減すること
WO2013107139A1 (zh) 全双工干扰处理方法和装置
CN107113857B (zh) 第四代无线电移动网络的调度方法和系统
WO2014117730A1 (zh) 一种用户调度方法及系统
CN109716812B (zh) 用于减轻现用的频谱内的干扰的系统及方法
WO2014108028A1 (zh) 无线通信方法和无线通信设备
US10873955B2 (en) Apparatus and method for allocating radio resources
KR101568081B1 (ko) 셀룰러 시스템에서의 d2d 통신을 위한 자원 할당 방법 및 그 장치
WO2012129903A1 (zh) 避免小区间干扰的方法和装置
CN107409347B (zh) 指示通过mcs和功率约束掩码实现多点接收的控制器
CN103945386B (zh) Ad Hoc网络中空时频三维资源分配方法
US11290162B2 (en) Systems and methods for mitigating interference within actively used spectrum
KR102178532B1 (ko) 간섭 정렬 기반 주파수 할당 방법 및 이를 위한 송신 장치
Sawant et al. Outage probability analysis in hybrid cooperative cognitive radio networks
Ali et al. Effect of interference of full-duplex transmissions in underlay device-to-device communication
WO2017024570A1 (zh) 一种确定小区簇子帧配置的方法及装置
JP2012222398A (ja) 分散アンテナネットワークシステム、及びチャネル割当方法
Wang et al. Improving Device-to-Device Communication Performance in 5G Networks through Joint Power Control and Resource Allocation
Prasanth et al. Various schemes for optimizing beamforming design, power and spectrum allocation in cognitive radio networks-A survey
KR101672632B1 (ko) D2d 통신을 위한 동적 클러스터 기반의 자원 할당 방법

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: 14778625

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: 14778625

Country of ref document: EP

Kind code of ref document: A1