WO2018176824A1 - Procédé d'accès multiple non orthogonal basé sur une fusion à granularité fine de planification et de compétition - Google Patents

Procédé d'accès multiple non orthogonal basé sur une fusion à granularité fine de planification et de compétition Download PDF

Info

Publication number
WO2018176824A1
WO2018176824A1 PCT/CN2017/107772 CN2017107772W WO2018176824A1 WO 2018176824 A1 WO2018176824 A1 WO 2018176824A1 CN 2017107772 W CN2017107772 W CN 2017107772W WO 2018176824 A1 WO2018176824 A1 WO 2018176824A1
Authority
WO
WIPO (PCT)
Prior art keywords
user
scheduling
access
resource
competition
Prior art date
Application number
PCT/CN2017/107772
Other languages
English (en)
Chinese (zh)
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 WO2018176824A1 publication Critical patent/WO2018176824A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/02—Hybrid access

Definitions

  • the present invention relates to the field of communication technologies, and in particular, to a non-orthogonal multiple access method.
  • MAC Media Access Control
  • UE User Equipments
  • KPIs key performance indicators
  • next-generation mobile wireless network needs to meet the needs of massive user connections and ultra-large-scale services, which poses great challenges to traditional wireless networks. Therefore, the industry is striving to significantly increase the number of user connections, network capacity, and spectrum utilization. technology.
  • SCMA Sparse Code Multiple Access
  • SCMA Sparse Code Multiple Access
  • 5G fifth generation mobile communication system
  • 5G fifth generation mobile communication system
  • multiple access technologies can generally be divided into two categories: 1) scheduling-based multiple access technology, often applied to cellular networks, the advantage of which is the use of resources between users. Without conflicts, resources can be better optimized and allocated, and transmission rate requirements are more easily protected; the disadvantage is that the central control node needs less flexibility, real-time guarantee is poor, and signaling overhead is large; 2) based on random competition Multiple access technology, often used in wireless local area networks, has the advantages of flexibility and robustness, good real-time guarantee, and simple implementation. The disadvantage is that data packets may be sent between multiple users, and transmission rate requirements are difficult to obtain. Very good protection. For convenience of description, the scheduling-based multiple access technology and the random access-based multiple access technology are simply referred to as scheduling access and contention access, respectively, without causing ambiguity.
  • the existing non-orthogonal multiple access technology introduces scheduling access and contention access, but the available resource partitioning of the two access modes limits network capacity, spectrum utilization, and quality of service (Quality of Service, QoS) lacks a more sophisticated and efficient multiple access method for converged scheduling access and contention access.
  • QoS Quality of Service
  • the present invention proposes a non-orthogonal multiple access method based on scheduling and competition fine-grained fusion, and the method
  • the resources used for scheduling access and the resources that the user contends for are not split, so that the resources of the two access modes are completely shared, and some user equipments are scheduled to be transmitted while other user equipments are allowed to use the same spectrum resources.
  • Random access to access which is conducive to the dynamic change of demand and resource matching, is conducive to multi-user diversity gain, and thus significantly improve network capacity, spectrum utilization and quality of service.
  • Step 1 Resource allocation phase
  • the central node in the wireless network calculates the resource area and the resource location occupied by the scheduling-competitive convergence access mode, and allocates resources for the scheduling user in the resource area, and proceeds to step 2;
  • the central node refers to a base station (BS) in a cellular network, and refers to a wireless access point (AP) in a wireless local area network;
  • BS base station
  • AP wireless access point
  • the resource refers to a time-frequency two-dimensional resource, the resource size is measured by the number of time-frequency resource blocks, and the resource location is determined by the j-th frequency unit of the ith time slot;
  • Step 2 Resource indication phase
  • Step 2.1 The central node sends a Resource Allocation Indication Frame (RAIF) to the user equipment of the cell;
  • RAIF Resource Allocation Indication Frame
  • Step 2.2 In the RAIF, indicate the resource location of the scheduling-competition and convergent access mode of the cell, and the specific indication mode is that the jth frequency of the i th slot is used for the scheduling-competition and convergent access mode, and the indicated resource location is scheduled to be used by the user. Share with competing users;
  • Step 2.3 In the resource location of the scheduling-competition and converged access mode, the RAIF indicates the resource allocation location for the scheduling user, and the specific indication manner is that the jth frequency of the i th slot is allocated to the user equipment u, and the process proceeds to step 3. ;
  • Step 3 Scheduling-competitive convergence access
  • Step 3.1 The scheduled user equipment implements uplink access by using a non-orthogonal multiple access technology at the scheduled resource location;
  • Step 3.2 The contention access user performs random competition in the resource location of the scheduling-competitive convergence access mode. If the competition is successful, the non-orthogonal multiple access technology is used to implement uplink access; if the competition fails, the current access is abandoned;
  • the manner of random competition includes but is not limited to the backoff mode and the p probability mode;
  • Step 3.3 The scheduled users and competing users in steps 3.1 and 3.2 will share the same time-frequency resources, and the transmitted information is superimposed on these shared time-frequency resources, and proceeds to step 4;
  • Step 4 Receiver User Separation Phase
  • the receiving end parses the information of the multiple users that are superimposed by the multi-user joint detection method, and the process ends.
  • the receiver user separation phase of the non-orthogonal multiple access method based on scheduling and contention fine-grained fusion uses the SCMA method, and the information resolution steps of the BS receiver are as follows:
  • the codebook in the set is known, but the activity is unknown, and proceeds to step c);
  • the invention has the beneficial effects that the fine-grained fusion of the two access modes is realized by adopting the method that the scheduling access and the competing access share the same spectrum resource, which is beneficial to the dynamic change of the demand and the resource matching, and is beneficial to multiple users.
  • Diversity gain which in turn significantly increases network capacity, spectrum utilization, and quality of service.
  • FIG. 1 is a configuration diagram of a first embodiment of the present invention.
  • Fig. 2 is a structural diagram of a first embodiment of the present invention.
  • Fig. 3 is a structural diagram of a second embodiment of the present invention.
  • Figure 4 is a structural diagram of a third embodiment of the present invention.
  • Fig. 5 is a structural diagram of a fourth embodiment of the present invention.
  • Figure 6 is a structural diagram of Embodiment 5 of the present invention.
  • Fig. 7 is a structural diagram of a sixth embodiment of the present invention.
  • Figure 8 is a structural diagram of a seventh embodiment of the present invention.
  • Figure 9 is a structural diagram of an eighth embodiment of the present invention.
  • STA refers to a station
  • IDMA refers to Interleave-Division Multiple Access.
  • the embodiment side re-described the implementation of the present invention in an SCMA-based cellular network.
  • the proposed scheduling and competition fine-grained fusion method, in order to ensure compatibility, the radio frame structure of this embodiment follows the specification of the fourth generation mobile communication system (4G).
  • Step 1 each radio frame scheduling period start time, the BS first sets the uplink and downlink time slot ratio, and proceeds to step 2;
  • Step 2 The BS calculates the location of the time-frequency resource (Resource Block, RB) that needs to be occupied by the scheduling-competition and convergence access mode in the uplink time slot, and allocates the uplink RB to the scheduled user equipment, and the allocated RB and scheduling- The RBs occupied by the competitive convergence access method overlap, and the process proceeds to step 3;
  • Resource Block Resource Block
  • Step 3 The BS broadcasts the resource allocation result through the physical downlink control channel (PDCCH), indicates the RB location occupied by the scheduling-competing and converged access mode, and indicates the RB resource of the scheduled user equipment, for the scheduled
  • PDCCH physical downlink control channel
  • Step 4 The scheduled user equipment sends data according to the allocated RB resources by SCMA, and proceeds to step 6;
  • Step 5 The contention access user equipment selects the access according to the probability p, and selects no access according to the (1-p) probability. If the access is selected, the SCMA layer consisting of several RBs is randomly selected, and the data is sent by using the SCMA method. And go to step 6; if you choose not to access, then give up this transmission opportunity, the process ends;
  • the probability p is periodically set by the base station by using downlink control signaling
  • Step 6 The BS separates the information of each uplink user by using the multi-user joint detection method from the superimposed scheduling user and the competing user signal, and the process ends.
  • FIG. 2 is a diagram of a BS receiver design of the first embodiment.
  • the RB resource corresponding to the scheduling-competition and convergence access mode is allocated to a part of the scheduling user and to a part of the contention users, and the scheduling user codebook is active.
  • the BS needs to separate the signals of the two types of user equipment from the superimposed signals.
  • the codebook in the set is known, but the activity is unknown, and proceeds to step c);
  • the second embodiment is based on the implementation method of the first embodiment.
  • the difference is that the third embodiment introduces the uplink and downlink full-duplex technology. Therefore, in the third embodiment, the uplink scheduling, the downlink scheduling, and the competing users share the same RB. Resources.
  • Step 1 each radio frame scheduling period start time, the BS first sets the uplink and downlink time slot ratio, and proceeds to step 2;
  • Step 2 The BS calculates the RB position that needs to be occupied by the scheduling-competition and converged access mode in the uplink time slot, and allocates the uplink RB and the downlink RB for the scheduled user equipment, and the allocated RB and the scheduling-competition convergence access mode.
  • the occupied RBs overlap and go to step 3;
  • Step 3 The BS broadcasts the resource allocation result, indicates the RB location occupied by the scheduling-competing and converged access mode, and indicates the RB resource of the scheduled user equipment. For the scheduled user, the process proceeds to step 4 for the contention access. The user proceeds to step 5;
  • Step 4 The scheduled user equipment sends and receives data according to the allocated RB resources through the SCMA mode, wherein the scheduled uplink user sends data, and the scheduled downlink user receives the data from the BS, and proceeds to step 6.
  • Step 5 The contention access user equipment selects the access according to the probability p, and selects no access according to the (1-p) probability. If the access is selected, the SCMA layer consisting of several RBs is randomly selected, and the data is sent by using the SCMA method. Go to step 6; if you choose not to access, discard this transmission opportunity, the process ends;
  • the probability p is set by the base station through downlink control signaling.
  • Step 6 The BS separates the information of each uplink user by using the multi-user joint detection method from the superimposed scheduling user and the competing user signal, and the user equipment adopts multiple users from the superimposed scheduling user and the competing user signal.
  • the joint detection method separates the downlink information required by itself, and the process ends.
  • Embodiment 3 focuses on implementing the scheduling and contention fine-grained fusion method proposed by the present invention in a cellular network based on Non-orthogonal Multiple Access (NOMA).
  • NOMA Non-orthogonal Multiple Access
  • Step 1 For the same time slot, frequency, and spatial stream, the BS divides the resource into N power layers (Power Layer) from the power domain for multiple user equipments to send uplink data, and each power layer corresponds to different transmit power. Then go to step 2;
  • Power Layer power layers
  • Step 2 The BS directly schedules a part of the power layers to the corresponding uplink user equipment by using the downlink control signaling, and proceeds to step 3.
  • Step 3 The BS allocates the power layer of the remaining power layer in step 2 to the contention access uplink user equipment by using the downlink control signaling, and proceeds to step 4 for the scheduled user, and proceeds to step 5 for the contention access user;
  • Step 4 The scheduled user equipment sends uplink data according to the power required by the allocated power layer, and proceeds to step 6;
  • Step 5 The contention access user equipment selects the access according to the probability p, selects no access according to the (1-p) probability, and if the access is selected, randomly selects a power layer that can be used for the competition, according to the selected power layer. The required power is sent to the uplink data, and the process proceeds to step 6. If the access is not selected, the transmission opportunity is abandoned, and the process ends.
  • the probability p is set by the base station by using downlink control signaling
  • Step 6 The BS separates the information of each user by using the multi-user joint detection method from the superimposed scheduling user and the competing user signal, and the process ends.
  • the fourth embodiment is based on the implementation method of the third embodiment.
  • the difference is that the fifth embodiment introduces the uplink and downlink full-duplex technology. Therefore, in the fourth embodiment, the uplink scheduling, the downlink scheduling, and the competing users share the same RB resource. .
  • Step 1 For the same time slot, frequency and spatial stream, the BS divides the resource into N power layers from the power domain, and proceeds to step 2;
  • Step 2 The BS uses the downlink control signaling to directly dispatch a part of the power layer to the corresponding uplink user equipment, and directly allocates some of the remaining power layers to the corresponding downlink user equipment, and proceeds to step 3;
  • Step 3 The downlink control signaling is used by the BS to allocate the subset power layer allocated to the remaining power layer after the uplink and downlink in step 2 to the contention access user equipment, and the scheduled user is transferred to step 4 for the contention access.
  • the user proceeds to step 5;
  • Step 4 The scheduled uplink user equipment sends uplink data according to the power required by the allocated power layer; the scheduled downlink user equipment waits to receive downlink data, and proceeds to step 6;
  • Step 5 The contention access user equipment selects the access according to the probability p, selects no access according to the (1-p) probability, and if the access is selected, randomly selects a power layer that can be used for the competition, according to the requirements of the selected power layer.
  • the power is sent to the uplink data, and the process proceeds to step 6. If the access is not accessed, the transmission opportunity is abandoned, and the process ends.
  • the probability p is set by the base station by using downlink control signaling
  • Step 6 The BS separates the information of each uplink user by using the multi-user joint detection method from the superimposed scheduling user and the competing user signal, and the user equipment adopts multiple users from the superimposed scheduling user and the competing user signal.
  • the joint detection method separates the downlink information required by itself, and the process ends.
  • Embodiment 5 focuses on implementing the scheduling and contention fine-grained fusion method proposed by the present invention in an SCMA-based wireless local area network.
  • the radio frame structure of Embodiment 6 follows the IEEE 802.11ax specification. .
  • Step 1 When the AP sends a Trigger Frame (TF), it first calculates the time-frequency resource unit (RU) position of the scheduling-competitive convergence access mode according to the scheduling algorithm, and is scheduled.
  • the user equipment allocates an uplink RU, and the allocated RU overlaps with the RU occupied by the scheduling-competitive convergence access mode, and proceeds to step 2;
  • Step 2 The BS sends a TF frame broadcast resource allocation result, indicating the location of the RU occupied by the scheduling-competition and convergence access mode, and indicates the RU resource of the scheduled user equipment. For the scheduled user, the user is transferred to step 3 for the contention. Enter the user and go to step 4;
  • Step 3 The scheduled user equipment sends data according to the allocated RU resources by SCMA, and proceeds to step 5;
  • Step 4 The contention access user equipment determines whether the current TF is accessed based on the backoff policy. If the access is selected, the SCMA layer consisting of several RUs is randomly selected, and the data is sent by the SCMA method, and the process proceeds to step 5; If you access, you will give up this transmission opportunity and the process ends.
  • Step 5 The AP separates the information of each uplink user by using the multi-user joint detection method from the superimposed scheduling user and the competing user signal, and the process ends.
  • Embodiment 6 focuses on implementing the scheduling and competition fine-grained in the present invention based on a multi-user shared access (MUSA)-based cellular network. Method.
  • Step 1 Each user equipment adopting the MUSA access mode has a corresponding multi-domain multi-code sequence corresponding thereto, and proceeds to step 2,
  • the complex domain multi-code sequence corresponding to the user equipment is obtained in one of two ways:
  • Manner 1 The BS assigns a complex domain multi-code sequence to the user equipment by using downlink signaling;
  • Manner 2 The user equipment itself is uniquely bound to a complex domain multi-code sequence
  • Step 2 The BS will schedule a part of users to perform uplink transmission by using downlink control signaling, and the BS proceeds to step 3, and the scheduled user equipment proceeds to step 4;
  • Step 3 The BS triggers the random access user to perform random access by using the downlink control signaling, the BS proceeds to step 6, and the random access user equipment proceeds to step 5;
  • Step 4 The scheduled user equipment uses its corresponding complex domain multi-code to perform the spread spectrum modulation transmission uplink data, and proceeds to step 6.
  • Step 5 The contention access user equipment selects the access according to the probability p, and selects no access according to the (1-p) probability. If the access is selected, the complex domain multi-code corresponding to the multi-domain multi-code is used for the spread spectrum modulation to transmit the uplink data. The method is familiar to the industry, and proceeds to step 6. If you choose not to access, the transmission opportunity is abandoned, and the process ends.
  • the probability p is set by the base station by using downlink control signaling
  • Step 6 The BS separates the information of each user by using the serial interference cancellation method from the superimposed scheduling user and the competing user signal, and the process ends.
  • Embodiment 7 focuses on implementing the scheduling and contention fine-grained fusion method proposed by the present invention in a Pattern-Division Multiple Access (PDMA)-based cellular network.
  • PDMA Pattern-Division Multiple Access
  • Step 1 The base station pre-configures the PDMA multi-user coding matrix H PDMA by means of downlink signaling, multi-user coding matrix is multiplied by the generalized channel matrix H CH to form an equivalent channel transmission matrix H, and proceeds to step 2;
  • the PDMA multi-user coding matrix H PDMA is M rows and N columns, wherein the H PDMA row set represents a resource dimension, including one or more of a spatial domain dimension, a coding domain dimension, and a power domain dimension, each row pair A resource unit in the resource dimension, the column set of H PDMA represents the user equipment, and each column corresponds to one user equipment; each element has a value of 1 or 0, wherein 1 represents the corresponding user of the column uses the corresponding row of the row
  • Step 2 The BS schedules a part of users to perform uplink transmission by using downlink control signaling, and the BS proceeds to step 3, and the scheduled user equipment proceeds to step 4;
  • Step 3 The BS triggers the random access user to perform random access by using the downlink control signaling, the BS proceeds to step 6, and the random access user equipment proceeds to step 5;
  • Step 4 The scheduled user equipment performs uplink data transmission based on the resource unit whose value is 1 in the column of the PDMA multi-user coding matrix, which is well known in the industry, and proceeds to step 6.
  • Step 5 The contention access user equipment selects access according to the probability p, and selects no access according to the (1-p) probability. If the access is selected, the user equipment is based on the resource with the value 1 in the corresponding column of the PDMA multi-user coding matrix. The uplink data transmission is performed on the unit, which is well known in the industry, and proceeds to step 6. If the selection is not accessed, the transmission opportunity is abandoned, and the process ends.
  • the probability p is set by the base station by using downlink control signaling
  • Step 6 The BS separates the information of each user by using the front-end detection and the serial interference cancellation from the superimposed scheduling user and the competing user signal, and the process ends.
  • Embodiment 8 focuses on implementing the scheduling and contention fine-grained fusion method proposed by the present invention in an Interleave-Division Multiple Access (IDMA)-based cellular network.
  • IDMA Interleave-Division Multiple Access
  • Step 1 Each user equipment has a unique corresponding interleaving sequence, and the IDMA system distinguishes different user equipments based on the interleaving sequence, and proceeds to step 2;
  • the interleaving sequence is generated in the following three ways:
  • Manner 1 The base station allocates a unique interleaving sequence for each user equipment
  • Mode 2 Each user equipment uniquely determines a static interleaving sequence
  • Manner 3 The interleaving sequence of each user equipment changes randomly with time, but the interleaving sequence of the base station is consistent with the interleaving sequence of the user equipment;
  • Step 2 The BS schedules a part of users to perform uplink transmission by using downlink control signaling, and proceeds to step 3;
  • Step 3 The BS triggers the random access user to perform random access by using the downlink control signaling, and proceeds to step 4.
  • Step 4 The data of the scheduled user equipment first passes through the universal encoder, and then passes through its own interleaver, and then is modulated and sent to the communication channel, which is well known in the industry, and proceeds to step 6;
  • the universal encoder has the following three forms:
  • Form 1 There is only one forward error corrector
  • Form 2 only one spreader
  • Form 3 first through the forward error correction, after passing through the spreader;
  • Step 5 The contention access user equipment selects access according to the probability p, and selects no access according to the (1-p) probability. If the access is selected, the data of the user equipment first passes through the universal encoder, and then passes through its own interleaver. Then, the modulation is sent to the communication channel, which is well known in the industry, and proceeds to step 6. If the selection is not accessed, the transmission opportunity is abandoned, and the process ends.
  • the probability p is set by the base station by using downlink control signaling
  • Step 6 The BS separates the information of each user from the superimposed scheduling user and the competing user signal by using a chip-level iterative decoder, and the process ends.

Landscapes

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

Abstract

L'invention concerne un procédé d'accès multiple non orthogonal basé sur une fusion à granularité fine de planification et de compétition, qui se rapporte au domaine technique des communications. Une zone de ressources et une position de ressources occupées par un mode d'accès avec fusion planification-compétition sont calculées, et une ressource est attribuée à un utilisateur de planification; un nœud central envoie une trame d'indication d'attribution de ressource à un équipement d'utilisateur de la cellule courante; et enfin, des informations émises par l'utilisateur de planification et des informations émises par un utilisateur de compétition sont superposées sur une ressource temps-fréquence au moyen d'un accès avec fusion planification-compétition, et une extrémité réceptrice analyse les informations superposées au moyen d'une détection combinée multiutilisateur. En utilisant le procédé d'accès de planification et d'accès de compétition partageant la même ressource du spectre de fréquences, la présente invention réalise une fusion à granularité fine de deux modes d'accès, facilitant ainsi la mise en adéquation d'une demande modifiée dynamiquement et d'une ressource, facilitant un gain en diversité multiutilisateur, et améliorant donc significativement une capacité de réseau, un taux d'utilisation du spectre de fréquences et une qualité de service.
PCT/CN2017/107772 2017-04-01 2017-10-26 Procédé d'accès multiple non orthogonal basé sur une fusion à granularité fine de planification et de compétition WO2018176824A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710211241.4 2017-04-01
CN201710211241.4A CN106912111A (zh) 2017-04-01 2017-04-01 一种基于调度与竞争细粒度融合的非正交多址接入方法

Publications (1)

Publication Number Publication Date
WO2018176824A1 true WO2018176824A1 (fr) 2018-10-04

Family

ID=59195339

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/107772 WO2018176824A1 (fr) 2017-04-01 2017-10-26 Procédé d'accès multiple non orthogonal basé sur une fusion à granularité fine de planification et de compétition

Country Status (2)

Country Link
CN (1) CN106912111A (fr)
WO (1) WO2018176824A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020094048A1 (fr) 2018-11-08 2020-05-14 Huawei Technologies Co., Ltd. Signal de référence basé sur un segment
EP4012996A4 (fr) * 2019-09-10 2022-10-05 Sony Group Corporation Dispositif et procédé de communication sans fil, et terminal de communication sans fil et procédé

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106912111A (zh) * 2017-04-01 2017-06-30 西北工业大学 一种基于调度与竞争细粒度融合的非正交多址接入方法
CN108521317B (zh) * 2018-04-09 2020-10-30 哈尔滨工业大学 一种基于异步检测的scma上行链路传输方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101167395A (zh) * 2005-03-31 2008-04-23 株式会社Ntt都科摩 上行链路中的物理信道的无线资源分配方法以及用于移动台的发射机
CN104202749A (zh) * 2014-01-23 2014-12-10 中兴通讯股份有限公司 无线资源确定、获取方法及装置
US20150009917A1 (en) * 2013-07-08 2015-01-08 Electronics And Telecommunications Research Institute Method and terminal for distributed access
CN106912111A (zh) * 2017-04-01 2017-06-30 西北工业大学 一种基于调度与竞争细粒度融合的非正交多址接入方法

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101132225B (zh) * 2006-08-24 2012-04-11 中兴通讯股份有限公司 上行增强系统中共享非调度资源和调度资源的传输方法
CN104796959B (zh) * 2015-05-08 2018-03-20 东南大学 一种簇结构多载波水声传感器网络的混合型mac协议方法
CN105472752B (zh) * 2016-01-21 2019-05-28 清华大学 一种上行随机接入方法
CN106160815B (zh) * 2016-06-15 2019-09-24 西北工业大学 基于空时频码跳变的非正交多址接入方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101167395A (zh) * 2005-03-31 2008-04-23 株式会社Ntt都科摩 上行链路中的物理信道的无线资源分配方法以及用于移动台的发射机
US20150009917A1 (en) * 2013-07-08 2015-01-08 Electronics And Telecommunications Research Institute Method and terminal for distributed access
CN104202749A (zh) * 2014-01-23 2014-12-10 中兴通讯股份有限公司 无线资源确定、获取方法及装置
CN106912111A (zh) * 2017-04-01 2017-06-30 西北工业大学 一种基于调度与竞争细粒度融合的非正交多址接入方法

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020094048A1 (fr) 2018-11-08 2020-05-14 Huawei Technologies Co., Ltd. Signal de référence basé sur un segment
CN112956270A (zh) * 2018-11-08 2021-06-11 华为技术有限公司 基于分段的参考信号
EP3861820A4 (fr) * 2018-11-08 2021-11-17 Huawei Technologies Co., Ltd. Signal de référence basé sur un segment
CN112956270B (zh) * 2018-11-08 2023-02-03 华为技术有限公司 基于分段的参考信号
EP4012996A4 (fr) * 2019-09-10 2022-10-05 Sony Group Corporation Dispositif et procédé de communication sans fil, et terminal de communication sans fil et procédé

Also Published As

Publication number Publication date
CN106912111A (zh) 2017-06-30

Similar Documents

Publication Publication Date Title
CN112514285B (zh) 卫星内切换
EP3589040B1 (fr) Configuration d'occasions de recherche de mobile dans un système de communication mobile pour des signaux de recherche de mobile transmis sur plusieurs rayons
CN112534766B (zh) 同步信号块和剩余最小系统信息在无执照系统中的集成
WO2018176824A1 (fr) Procédé d'accès multiple non orthogonal basé sur une fusion à granularité fine de planification et de compétition
CN112189317B (zh) 用于无线系统的速率匹配资源集
JP7186780B2 (ja) 探索空間セットの結合および省略
CN109952720A (zh) 波束成形系统中的新型无线电随机接入
CN113615270B (zh) 用于定位的波形报告
CN110476468A (zh) 对用于发送寻呼消息和同步信号的天线端口的准共址
CN106936556B (zh) 一种面向窄带物联网的时频二维稀疏码多址接入方法
WO2019104685A1 (fr) Procédé de communication et dispositif de communication
CN112514280A (zh) 在drx循环的接通周期期间的波束扫描
WO2014177094A2 (fr) Dispositif, procédé de traitement de brouillage, unité de commande de réseau et terminal
US20230037980A1 (en) Method and device for performing paging in mobile communication system
TW202135594A (zh) 用於多鏈路無線通訊設備的群組資料傳輸
US11689950B2 (en) Channel state information reference signal multiplexing with synchronization signal blocks
KR20230005153A (ko) 거리-기반 cot(channel occupancy time) 공유
CN115606131A (zh) 处于不活跃或空闲模式时针对多播传输的反馈
CN112514496A (zh) 因波束而异的系统信息调度窗口设计
CN115668790A (zh) 用于多传送接收点的发射波束选择方案
CN118158782A (zh) 通信方法及装置
WO2022000295A1 (fr) Transmission de multidiffusion basée sur un signal de synchronisation
US20190132072A1 (en) Electronic device and method for interleave division multiple access communication
CN115152300A (zh) 控制资源配置
CN105517118A (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: 17903481

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

Country of ref document: EP

Kind code of ref document: A1

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM XXXX DATED DD/MM/YYYY)