WO2019153297A1 - 数据传输方法、装置、计算机设备及存储介质 - Google Patents

数据传输方法、装置、计算机设备及存储介质 Download PDF

Info

Publication number
WO2019153297A1
WO2019153297A1 PCT/CN2018/076256 CN2018076256W WO2019153297A1 WO 2019153297 A1 WO2019153297 A1 WO 2019153297A1 CN 2018076256 W CN2018076256 W CN 2018076256W WO 2019153297 A1 WO2019153297 A1 WO 2019153297A1
Authority
WO
WIPO (PCT)
Prior art keywords
pusch
start symbol
symbol position
pucch
priority
Prior art date
Application number
PCT/CN2018/076256
Other languages
English (en)
French (fr)
Inventor
林亚男
陈文洪
Original Assignee
Oppo广东移动通信有限公司
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 Oppo广东移动通信有限公司 filed Critical Oppo广东移动通信有限公司
Priority to KR1020207026146A priority Critical patent/KR20200130295A/ko
Priority to AU2018408003A priority patent/AU2018408003A1/en
Priority to JP2020542835A priority patent/JP7177842B2/ja
Priority to CN202010251837.9A priority patent/CN111490864B/zh
Priority to CN201880048254.7A priority patent/CN110959263A/zh
Priority to EP18905623.7A priority patent/EP3751762A4/en
Priority to PCT/CN2018/076256 priority patent/WO2019153297A1/zh
Publication of WO2019153297A1 publication Critical patent/WO2019153297A1/zh
Priority to US16/886,529 priority patent/US11006399B2/en
Priority to US17/233,113 priority patent/US11785603B2/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053Allocation of signaling, i.e. of overhead other than pilot signals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044Arrangements for allocating sub-channels of the transmission path allocation of payload
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058Allocation criteria
    • H04L5/0064Rate requirement of the data, e.g. scalable bandwidth, data priority
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • H04W72/1263Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H04W72/1268Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of uplink data flows
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0023Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the signalling
    • H04L1/0027Scheduling of signalling, e.g. occurrence thereof
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/20Control channels or signalling for resource management
    • H04W72/21Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network

Definitions

  • the present invention relates to wireless network technologies, and in particular, to a data transmission method, apparatus, computer equipment, and storage medium.
  • the current 5G New Radio (NR) system determines that the physical uplink control channel (PUCCH, Physical Uplink Control CHannel) and the physical uplink shared channel (PUSCH) are not supported.
  • the uplink control information (UCI, Uplink Control Information) may be multiplexed into the PUSCH for transmission.
  • UCI Uplink Control Information
  • other PUSCHs can also be used to carry UCI.
  • the present invention provides a data transmission method, apparatus, computer device, and storage medium.
  • a data transmission method includes:
  • the terminal selects a PUSCH that meets a preset condition from at least two PUSCHs that are selected objects;
  • the terminal multiplexes the first UCI into the selected PUSCH for transmission.
  • a data transmission method includes:
  • the base station selects a PUSCH that meets a preset condition from at least two PUSCHs that are selected objects;
  • the base station receives the first UCI from the selected PUSCH.
  • a data transmission device includes: a first selection unit and a transmission unit;
  • the first selecting unit is configured to select, from the at least two PUSCHs that are the selected objects, a PUSCH that meets a preset condition;
  • the transmitting unit is configured to multiplex the first UCI into the selected PUSCH for transmission.
  • a data transmission device includes: a second selection unit and a receiving unit;
  • the second selecting unit is configured to select, from the at least two PUSCHs that are the selected objects, a PUSCH that meets a preset condition;
  • the receiving unit is configured to receive the first UCI from the selected PUSCH.
  • a computer apparatus comprising a memory, a processor, and a computer program stored on the memory and operative on the processor, the processor implementing the method as described above.
  • a computer readable storage medium having stored thereon a computer program that, when executed by a processor, implements a method as described above.
  • a PUSCH that meets a preset condition can be selected from at least two PUSCHs that are selected as targets, and then UCI can be multiplexed into the selected PUSCH for transmission, and the like.
  • UCI can be multiplexed into the selected PUSCH for transmission, and the like.
  • FIG. 1 is a flowchart of an embodiment of a data transmission method according to the present invention.
  • FIG. 2 is a schematic diagram of each PUSCH as a selection target according to the present invention.
  • FIG. 3 is a schematic structural diagram of a first embodiment of a data transmission apparatus according to the present invention.
  • FIG. 4 is a schematic structural diagram of a second embodiment of a data transmission apparatus according to the present invention.
  • FIG. 5 illustrates a block diagram of an exemplary computer system/server 12 suitable for use in implementing embodiments of the present invention.
  • FIG. 1 is a flowchart of an embodiment of a data transmission method according to the present invention. As shown in FIG. 1, the following specific implementation manners are included.
  • the terminal selects a PUSCH that meets a preset condition from at least two PUSCHs that are selected objects.
  • the terminal multiplexes the first UCI into the selected PUSCH for transmission.
  • a PUSCH that overlaps with a PUCCH to be transmitted may be selected as a selection object, that is, a PUSCH as a selection target and a PUCCH to be transmitted at least partially overlap in time.
  • the PUCCH can be used to carry the UCI.
  • the information contained in the UCI is usually information related to the current terminal status, such as whether the current terminal needs to request the uplink resource, the downlink quality detected by the current terminal, and the like.
  • UCI can be transmitted either in the PUCCH or in the PUSCH.
  • the PUSCH that meets the preset condition may be selected from the PUSCH, and the number of PUSCHs to be selected is usually multiple, that is, greater than one.
  • the terminal may select the PUSCH with the highest priority from the PUSCH that is the selected object according to one or any combination of the following priority sequences:
  • the PUSCH whose start symbol and the time domain length are both the same as the PUCCH to be transmitted (hereinafter referred to as PUCCH) has a higher priority than the PUSCH whose start symbol position is not earlier than the start symbol position of the PUCCH, and is not earlier than or equal;
  • the PUSCH having the same start symbol and the same time domain length as the PUCCH has a higher priority than the PUSCH of the start symbol position before the start symbol position of the PUCCH and the start symbol position of the PUCCH is not more than A symbols, and A is A positive integer; the specific value of A can be determined according to actual needs;
  • the PUSCH of the start symbol position not earlier than the start symbol position of the PUCCH has a higher priority than the PUSCH of the start symbol position before the start symbol position of the PUCCH and the difference from the start symbol position of the PUCCH is not more than A symbols;
  • the PUSCH with the highest start symbol position in the PUSCH that is not earlier than the start symbol position of the PUCCH has the highest priority
  • the PUSCH having the start symbol position before the start symbol position of the PUCCH and having a difference from the start symbol position of the PUCCH that is not greater than the start symbol position in the PUSCH of the A symbols has the highest priority
  • the grant-based PUSCH has a higher priority than the grant-free PUSCH
  • the slot based PUSCH has a higher priority than the non-slot based PUSCH.
  • the PUSCH based on slot scheduling is defined as PUSCH mapping type A (mapping type A), and the PUSCH based on non-slot scheduling is defined as type B.
  • the terminal when the terminal selects the PUSCH with the highest priority from the PUSCHs that are the selected objects according to one or any combination of the foregoing priority sequences, the terminal may be higher according to the priority of the different manners set in advance. In the low order, the selection is performed in various ways, wherein the latter method selects in the PUSCH selected by the adjacent former method.
  • the PUSCH with the smallest carrier number may be further selected, and the PUSCH with the smallest carrier number is used as the final required PUSCH.
  • the manner of selecting the PUSCH from the PUSCH as the selection object may include:
  • a scheduling-based PUSCH or the like is selected from the PUSCHs to be selected.
  • the selection may be performed by only one of the methods, or may be performed by a combination of at least two of them. Preferably, the latter method may be employed.
  • the priorities may be sequentially selected in a high-to-low order according to different manners, wherein the latter mode is adjacent to each other.
  • the PUSCH selected in the former manner is selected, and when the number of selected PUSCHs is greater than one, the PUSCH in which the carrier number is the smallest may be further selected.
  • FIG. 2 is a schematic diagram of each PUSCH as a selection target according to the present invention.
  • the PUSCH based on the slot scheduling may be selected from the PUSCH1, the PUSCH2, the PUSCH3, and the PUSCH4 in the manner of selecting the PUSCH based on the slot scheduling from the PUSCH as the selection target, as shown in FIG. 2, respectively.
  • PUSCH2 PUSCH3, and PUSCH4 of type A, since PUSCH1 is typeB, PUSCH1 is not selected.
  • the start symbol position is further selected from PUSCH2, PUSCH3, and PUSCH4 to be no earlier than the PUCCH in a manner of "selecting a PUSCH whose start symbol position is not earlier than the start symbol position of the PUCCH" from the PUSCH to be selected.
  • the PUSCH of the start symbol position as shown in FIG. 2, is PUSCH3 and PUSCH4, respectively. Since the start symbol position of PUSCH2 is earlier than the start symbol position of the PUCCH, PUSCH2 is not selected.
  • two PUSCHs are obtained, which are respectively PUSCH3 and PUSCH4, and the number is greater than one. Therefore, further selection is needed, that is, the PUSCH with the smallest carrier number is selected, as shown in FIG. 2, which is PUSCH3, and then PUSCH3. As the final required PUSCH.
  • the terminal may multiplex the first UCI into the finally selected PUSCH for transmission, and how to transmit is a prior art.
  • the terminal may further determine, according to the configuration information, that the second UCI is carried by using the PUCCH, where the first UCI is the same as the second UCI or the second UCI is compressed to obtain the first UCI.
  • the base station can select a PUSCH that meets a preset condition from at least two PUSCHs to be selected, and can further select the PUSCH from the selected PUSCH.
  • the first UCI is received.
  • the manner in which the base station selects the PUSCH may be the same as the terminal, and details are not described herein again.
  • FIG. 3 is a schematic structural diagram of a first embodiment of a data transmission apparatus according to the present invention. As shown in FIG. 3, the first selection unit 301 and the transmission unit 302 are included.
  • the first selecting unit 301 is configured to select a PUSCH that meets a preset condition from the at least two PUSCHs that are the selection targets.
  • the transmitting unit 302 is configured to multiplex the first UCI into the selected PUSCH for transmission.
  • the transmitting unit 302 may further determine, according to the configuration information, that the second UCI is carried by using the PUCCH, where the first UCI is the same as the second UCI, or the second UCI is compressed to obtain the first UCI.
  • the PUSCH to be selected may include a PUSCH that overlaps with the PUCCH to be transmitted in time.
  • the first selection unit 301 can select a PUSCH that meets the preset condition.
  • the first selection unit 301 may select the PUSCH with the highest priority from at least two PUSCHs that are selected according to one or any combination of the following priority order:
  • the PUSCH whose start symbol and the time domain length are both the same as the PUCCH to be transmitted has a higher priority than the PUSCH whose start symbol position is not earlier than the start symbol position of the PUCCH;
  • the PUSCH having the same start symbol and the same time domain length as the PUCCH has a higher priority than the PUSCH of the start symbol position before the start symbol position of the PUCCH and the start symbol position of the PUCCH is not more than A symbols, and A is Positive integer
  • the PUSCH of the start symbol position not earlier than the start symbol position of the PUCCH has a higher priority than the PUSCH of the start symbol position before the start symbol position of the PUCCH and the difference from the start symbol position of the PUCCH is not more than A symbols;
  • the PUSCH with the highest start symbol position in the PUSCH that is not earlier than the start symbol position of the PUCCH has the highest priority
  • the PUSCH having the start symbol position before the start symbol position of the PUCCH and having a difference from the start symbol position of the PUCCH that is not greater than the start symbol position in the PUSCH of the A symbols has the highest priority
  • the scheduling-based PUSCH has a higher priority than the unscheduled PUSCH
  • the priority of the PUSCH based on the slot scheduling is higher than the PUSCH based on the non-slot scheduling.
  • the first selection unit 301 selects the PUSCH with the highest priority from at least two PUSCHs as the selection target according to one or any combination of the foregoing priority order
  • the first selection unit 301 may be based on a priority of a different manner set in advance. According to the order of priority from high to low, the selection is sequentially performed in various manners; wherein the latter method is selected in the PUSCH selected by the adjacent former method.
  • the number of the PUSCHs that are selected in the foregoing manner may be greater than one.
  • the first selection unit 301 may further select the PUSCH with the smallest carrier number, and select the PUSCH with the smallest carrier number as the final selected PUSCH.
  • Transmission unit 302 may multiplex the first UCI into the finally selected PUSCH for transmission.
  • FIG. 4 is a schematic structural diagram of a second embodiment of a data transmission apparatus according to the present invention. As shown in FIG. 4, the second selection unit 401 and the receiving unit 402 are included.
  • the second selecting unit 401 is configured to select, from the at least two PUSCHs that are the selection targets, the PUSCH that meets the preset condition.
  • the receiving unit 402 is configured to receive the first uplink control information UCI from the selected PUSCH.
  • the PUSCH to be selected may include a PUSCH that overlaps with the PUCCH to be transmitted in time.
  • the second selecting unit 401 may select the PUSCH with the highest priority from the PUSCHs to be selected according to one or any combination of the following priority order:
  • the PUSCH whose start symbol and the time domain length are both the same as the PUCCH to be transmitted has a higher priority than the PUSCH whose start symbol position is not earlier than the start symbol position of the PUCCH;
  • the PUSCH having the same start symbol and the same time domain length as the PUCCH has a higher priority than the PUSCH of the start symbol position before the start symbol position of the PUCCH and the start symbol position of the PUCCH is not more than A symbols, and A is Positive integer
  • the PUSCH of the start symbol position not earlier than the start symbol position of the PUCCH has a higher priority than the PUSCH of the start symbol position before the start symbol position of the PUCCH and the difference from the start symbol position of the PUCCH is not more than A symbols;
  • the PUSCH with the highest start symbol position in the PUSCH that is not earlier than the start symbol position of the PUCCH has the highest priority
  • the PUSCH having the start symbol position before the start symbol position of the PUCCH and having a difference from the start symbol position of the PUCCH that is not greater than the start symbol position in the PUSCH of the A symbols has the highest priority
  • the scheduling-based PUSCH has a higher priority than the unscheduled PUSCH
  • the priority of the PUSCH based on the slot scheduling is higher than the PUSCH based on the non-slot scheduling.
  • the second selection unit 401 may perform the priority according to the priority of the different manners set in advance. In order of high to low, the selection is sequentially performed in various manners, wherein the latter method is selected in the PUSCH selected by the adjacent former method.
  • the number of PUSCHs selected in the foregoing manner may be greater than one.
  • the second selecting unit 401 may further select a PUSCH in which the carrier number is the smallest.
  • FIG. 5 illustrates a block diagram of an exemplary computer system/server 12 suitable for use in implementing embodiments of the present invention.
  • the computer system/server 12 shown in FIG. 5 is merely an example and should not impose any limitation on the function and scope of use of the embodiments of the present invention.
  • computer system/server 12 is embodied in the form of a general purpose computing device.
  • the components of computer system/server 12 may include, but are not limited to, one or more processors (processing units) 16, memory 28, and a bus 18 that connects different system components, including memory 28 and processor 16.
  • Bus 18 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any of a variety of bus structures.
  • these architectures include, but are not limited to, an Industry Standard Architecture (ISA) bus, a Micro Channel Architecture (MAC) bus, an Enhanced ISA Bus, a Video Electronics Standards Association (VESA) local bus, and peripheral component interconnects ( PCI) bus.
  • ISA Industry Standard Architecture
  • MAC Micro Channel Architecture
  • VESA Video Electronics Standards Association
  • PCI peripheral component interconnects
  • Computer system/server 12 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by computer system/server 12, including both volatile and non-volatile media, removable and non-removable media.
  • Memory 28 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and/or cache memory 32.
  • Computer system/server 12 may further include other removable/non-removable, volatile/non-volatile computer system storage media.
  • storage system 34 may be used to read and write non-removable, non-volatile magnetic media (not shown in Figure 5, commonly referred to as a "hard disk drive”).
  • a disk drive for reading and writing to a removable non-volatile disk such as a "floppy disk”
  • a removable non-volatile disk such as a CD-ROM, DVD-ROM
  • each drive can be coupled to bus 18 via one or more data medium interfaces.
  • Memory 28 can include at least one program product having a set (e.g., at least one) of program modules configured to perform the functions of various embodiments of the present invention.
  • a program/utility 40 having a set (at least one) of program modules 42 may be stored, for example, in memory 28, such program modules 42 including, but not limited to, an operating system, one or more applications, other programs Modules and program data, each of these examples or some combination may include an implementation of a network environment.
  • Program module 42 typically performs the functions and/or methods of the described embodiments of the present invention.
  • Computer system/server 12 may also be in communication with one or more external devices 14 (e.g., a keyboard, pointing device, display 24, etc.), and may also be in communication with one or more devices that enable a user to interact with the computer system/server 12. And/or in communication with any device (e.g., network card, modem, etc.) that enables the computer system/server 12 to communicate with one or more other computing devices. This communication can take place via an input/output (I/O) interface 22. Also, computer system/server 12 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and/or a public network, such as the Internet) through network adapter 20. As shown in FIG.
  • LAN local area network
  • WAN wide area network
  • public network such as the Internet
  • network adapter 20 communicates with other modules of computer system/server 12 via bus 18. It should be understood that although not shown in the figures, other hardware and/or software modules may be utilized in conjunction with computer system/server 12, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, Tape drives and data backup storage systems.
  • the processor 16 executes various functional applications and data processing by running a program stored in the memory 28, for example, implementing the method shown in FIG.
  • the present invention also discloses a computer readable storage medium having stored thereon a computer program that, when executed by a processor, implements the method as shown in FIG.
  • the computer readable medium can be a computer readable signal medium or a computer readable storage medium.
  • the computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples (non-exhaustive lists) of computer readable storage media include: electrical connections having one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read only memory (ROM), Erasable programmable read only memory (EPROM or flash memory), optical fiber, portable compact disk read only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the foregoing.
  • a computer readable storage medium can be any tangible medium that can contain or store a program, which can be used by or in connection with an instruction execution system, apparatus or device.
  • a computer readable signal medium may include a data signal that is propagated in the baseband or as part of a carrier, carrying computer readable program code. Such propagated data signals can take a variety of forms including, but not limited to, electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • the computer readable signal medium can also be any computer readable medium other than a computer readable storage medium, which can transmit, propagate, or transport a program for use by or in connection with the instruction execution system, apparatus, or device. .
  • Program code embodied on a computer readable medium can be transmitted by any suitable medium, including but not limited to wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
  • Computer program code for performing the operations of the present invention may be written in one or more programming languages, or a combination thereof, including an object oriented programming language such as Java, Smalltalk, C++, and conventional A procedural programming language - such as the "C" language or a similar programming language.
  • the program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer, partly on the remote computer, or entirely on the remote computer or server.
  • the remote computer can be connected to the user's computer through any kind of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (eg, using an Internet service provider) Internet connection).
  • LAN local area network
  • WAN wide area network
  • Internet service provider Internet service provider
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of hardware plus software functional units.
  • the above-described integrated unit implemented in the form of a software functional unit can be stored in a computer readable storage medium.
  • the above software functional unit is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor to perform the methods of the various embodiments of the present invention. Part of the steps.
  • the foregoing storage medium includes various media that can store program codes, such as a USB flash drive, a removable hard disk, a read only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

Landscapes

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

Abstract

本发明公开了数据传输方法、装置、计算机设备及存储介质,其中方法包括:终端从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH;终端将第一UCI复用到选出的PUSCH中进行传输。应用本发明所述方案,能够实现PUSCH的合理选择等。

Description

数据传输方法、装置、计算机设备及存储介质 技术领域
本发明涉及无线网络技术,特别涉及数据传输方法、装置、计算机设备及存储介质。
背景技术
目前的5G新空口(NR,New Radio)***确定,不支持物理上行控制信道(PUCCH,Physical Uplink Control CHannel)与物理上行共享信道(PUSCH,Physical Uplink Shared Channel)的同时传输。当PUCCH与PUSCH的起始符号及时域长度相同时,可以将上行控制信息(UCI,Uplink Control Information)复用到PUSCH中传输。但除此之外,其它PUSCH也是可以用来承载UCI的。而对于如何选择适当的PUSCH来承载UCI,现有技术中还没有有效的解决方式。
发明内容
有鉴于此,本发明提供了数据传输方法、装置、计算机设备及存储介质。
具体技术方案如下:
一种数据传输方法,包括:
终端从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH;
所述终端将第一UCI复用到选出的PUSCH中进行传输。
一种数据传输方法,包括:
基站从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH;
所述基站从选出的PUSCH上接收第一UCI。
一种数据传输装置,包括:第一选择单元以及传输单元;
所述第一选择单元,用于从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH;
所述传输单元,用于将第一UCI复用到选出的PUSCH中进行传输。
一种数据传输装置,包括:第二选择单元以及接收单元;
所述第二选择单元,用于从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH;
所述接收单元,用于从选出的PUSCH上接收第一UCI。
一种计算机设备,包括存储器、处理器及存储在所述存储器上并可在所述处理器上运行的计算机程序,所述处理器执行所述程序时实现如以上所述的方法。
一种计算机可读存储介质,其上存储有计算机程序,所述程序被处理器执行时实现如以上所述的方法。
基于上述介绍可以看出,采用本发明所述方案,可从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH,进而可将UCI复用到选出的PUSCH中进行传输等,从而实现了PUSCH的合理选择,进而提升了DCI传输性能等。
附图说明
图1为本发明所述数据传输方法实施例的流程图。
图2为本发明所述作为选择对象的各PUSCH的示意图。
图3为本发明所述数据传输装置第一实施例的组成结构示意图。
图4为本发明所述数据传输装置第二实施例的组成结构示意图。
图5示出了适于用来实现本发明实施方式的示例性计算机***/服务器12的框图。
具体实施方式
为了使本发明的技术方案更加清楚、明白,以下参照附图并举实施例,对本发明所述方案进行进一步说明。
显然,所描述的实施例是本发明一部分实施例,而不是全部的实施例。基于本发明中的实施例,本领域技术人员在没有作出创造性劳动前提下所获得的所有其它实施例,都属于本发明保护的范围。
图1为本发明所述数据传输方法实施例的流程图。如图1所示,包括以下具体实现方式。
在101中,终端从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH。
在102中,终端将第一UCI复用到选出的PUSCH中进行传输。
在实际应用中,可将与待发送的PUCCH在时间上存在重叠的PUSCH作为选择对象,即作为选择对象的PUSCH与待发送的PUCCH在时间上至少部分重叠。
PUCCH可用于承载UCI,UCI中包含的信息通常都是与当前终端状态相关的信息,如当前终端是否需要请求上行资源、当前终端检测到的下行链路质量等等。
另外,UCI既可以在PUCCH中传输,也可以在PUSCH中传输。本实施例中,在确定出作为选择对象的PUSCH之后,可从中选出符合预设条件的PUSCH,作为选择对象的PUSCH通常为多个,即大于一个。
具体地,终端可以按照以下优先级顺序之一或任意组合,从作为选择对象的PUSCH中选出优先级最高的PUSCH:
起始符号以及时域长度均与待发送的PUCCH(以下简称PUCCH)相同 的PUSCH的优先级高于起始符号位置不早于PUCCH的起始符号位置的PUSCH,不早于即指晚于或等于;
起始符号以及时域长度均与PUCCH相同的PUSCH的优先级高于起始符号位置在PUCCH的起始符号位置之前且与PUCCH的起始符号位置之差不大于A个符号的PUSCH,A为正整数;A的具体取值可根据实际需要而定;
起始符号位置不早于PUCCH的起始符号位置的PUSCH的优先级高于起始符号位置在PUCCH的起始符号位置之前且与PUCCH的起始符号位置之差不大于A个符号的PUSCH;
起始符号位置不早于PUCCH的起始符号位置的PUSCH中起始符号位置最靠前的PUSCH的优先级最高;
起始符号位置在PUCCH的起始符号位置之前且与PUCCH的起始符号位置之差不大于A个符号的PUSCH中起始符号位置最靠后的PUSCH的优先级最高;
基于调度(grant-based)的PUSCH的优先级高于免调度(grant-free)的PUSCH;
基于时隙调度(slot based)的PUSCH的优先级高于基于非时隙调度(non-slot based)的PUSCH。
其中,基于时隙调度的PUSCH,标准中定义为PUSCH映射类型A(mapping typeA),基于非时隙调度的PUSCH定义为typeB。
另外,终端按照上述优先级顺序之一或任意组合,从至少两个作为选择对象的PUSCH中选出优先级最高的PUSCH时,可根据预先设定的不同方式的优先级,按照优先级由高到低的顺序,依次采用各种方式进行选择,其中,后一种方式在相邻的前一种方式选出的PUSCH中进行选择。
按照上述方式对PUSCH进行选择后,若选出的PUSCH的数量大于一,还可进一步选出其中载波编号最小的PUSCH,将载波编号最小的PUSCH作为最终所需的PUSCH。
基于上述介绍可以看出,从作为选择对象的PUSCH中选择PUSCH的方式可包括:
从作为选择对象的PUSCH中选择起始符号以及时域长度均与PUCCH相同的PUSCH;
从作为选择对象的PUSCH中选择起始符号位置不早于PUCCH的起始符号位置的PUSCH;
从作为选择对象的PUSCH中选择起始符号位置在PUCCH的起始符号位置之前且与PUCCH的起始符号位置之差不大于A个符号的PUSCH,A为正整数;
从作为选择对象的PUSCH中选择基于时隙调度的PUSCH;
从作为选择对象的PUSCH中选择基于调度的PUSCH等。
在实际应用中,可以仅采用其中的一种方式来进行选择,也可以采用其中的至少两种方式的组合的方式来进行选择,较佳地,可采用后一种方式。
另外,当采用其中的至少两种方式的组合的方式来进行选择时,可按照不同方式的优先级由高到低的顺序,依次通过各方式进行选择,其中,后一种方式在相邻的前一种方式选出的PUSCH中进行选择,进而当选出的PUSCH的数量大于一时,还可进一步选出其中载波编号最小的PUSCH。
假设共存在4个作为选择对象的PUSCH,分别为PUSCH1、PUSCH2、PUSCH3和PUSCH4,如图2所示,图2为本发明所述作为选择对象的各PUSCH的示意图。
针对图2中所示的各PUSCH,假设采用“从作为选择对象的PUSCH中选择基于时隙调度的PUSCH”以及“从作为选择对象的PUSCH中选择起始符号位置不早于PUCCH的起始符号位置的PUSCH”的方式相结合的方式来选择PUSCH,且“从作为选择对象的PUSCH中选择基于时隙调度的PUSCH”的方式的优先级高于“从作为选择对象的PUSCH中选择起始符号位置不早于PUCCH的起始符号位置的PUSCH”的方式的优先级。
那么,可首先按照“从作为选择对象的PUSCH中选择基于时隙调度的PUSCH”的方式,从PUSCH1、PUSCH2、PUSCH3和PUSCH4中选出基于时隙调度的PUSCH,如图2所示,分别为typeA的PUSCH2、PUSCH3和PUSCH4,由于PUSCH1为typeB,因此PUSCH1不会被选出。
之后,按照“从作为选择对象的PUSCH中选择起始符号位置不早于PUCCH的起始符号位置的PUSCH”的方式,从PUSCH2、PUSCH3和PUSCH4中进一步选出起始符号位置不早于PUCCH的起始符号位置的PUSCH,如图2所示,分别为PUSCH3和PUSCH4,由于PUSCH2的起始符号位置早于PUCCH的起始符号位置,因此PUSCH2不会被选出。
经过两次选择后,得到两个PUSCH,分别为PUSCH3和PUSCH4,数量大于一,因此还需要进行进一步选择,即选出其中载波编号最小的PUSCH,如图2所示,为PUSCH3,进而将PUSCH3作为最终所需的PUSCH。
在最终选出PUSCH之后,终端可将第一UCI复用到最终选出的PUSCH中进行传输,如何进行传输为现有技术。
另外,终端还可根据配置信息确定使用PUCCH承载第二UCI,第一UCI与第二UCI相同或将第二UCI压缩后得到第一UCI。
以上所述为终端侧的处理方式,基站侧的处理方式与终端侧类似,比如, 基站可从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH,进而可从选出的PUSCH上接收第一UCI。基站选择PUSCH的方式可与终端相同,不再赘述。
以上是关于方法实施例的介绍,以下通过装置实施例,对本发明所述方案进行进一步说明。
图3为本发明所述数据传输装置第一实施例的组成结构示意图。如图3所示,包括:第一选择单元301以及传输单元302。
第一选择单元301,用于从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH。
传输单元302,用于将第一UCI复用到选出的PUSCH中进行传输。
其中,传输单元302还可以根据配置信息确定使用PUCCH承载第二UCI,第一UCI与第二UCI相同,或者,将第二UCI压缩后得到第一UCI。
作为选择对象的PUSCH可包括:与待发送的PUCCH在时间上存在重叠的PUSCH。
针对作为选择对象的PUSCH,通常为多个,第一选择单元301可从中选出符合预设条件的PUSCH。
比如,第一选择单元301可按照以下优先级顺序之一或任意组合,从至少两个作为选择对象的PUSCH中选出优先级最高的PUSCH:
起始符号以及时域长度均与待发送的PUCCH相同的PUSCH的优先级高于起始符号位置不早于PUCCH的起始符号位置的PUSCH;
起始符号以及时域长度均与PUCCH相同的PUSCH的优先级高于起始符号位置在PUCCH的起始符号位置之前且与PUCCH的起始符号位置之差不大于A个符号的PUSCH,A为正整数;
起始符号位置不早于PUCCH的起始符号位置的PUSCH的优先级高于起始符号位置在PUCCH的起始符号位置之前且与PUCCH的起始符号位置之差不大于A个符号的PUSCH;
起始符号位置不早于PUCCH的起始符号位置的PUSCH中起始符号位置最靠前的PUSCH的优先级最高;
起始符号位置在PUCCH的起始符号位置之前且与PUCCH的起始符号位置之差不大于A个符号的PUSCH中起始符号位置最靠后的PUSCH的优先级最高;
基于调度的PUSCH的优先级高于免调度的PUSCH;
基于时隙调度的PUSCH的优先级高于基于非时隙调度的PUSCH。
另外,第一选择单元301在按照上述优先级顺序之一或任意组合,从至少两个作为选择对象的PUSCH中选出优先级最高的PUSCH时,可根据预先设定的不同方式的优先级,按照优先级由高到低的顺序,依次采用各种方式进行选择;其中,后一种方式在相邻的前一种方式选出的PUSCH中进行选择。
按照上述方式选出的PUSCH的数量可能大于一,当大于一时,第一选择单元301可进一步选出其中载波编号最小的PUSCH,将选出的载波编号最小的PUSCH作为最终选出的PUSCH,进而传输单元302可将第一UCI复用到最终选出的PUSCH中进行传输。
图4为本发明所述数据传输装置第二实施例的组成结构示意图。如图4所示,包括:第二选择单元401以及接收单元402。
第二选择单元401,用于从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH。
接收单元402,用于从选出的PUSCH上接收第一上行控制信息UCI。
作为选择对象的PUSCH可包括:与待发送的PUCCH在时间上存在重叠的PUSCH。
第二选择单元401可按照以下优先级顺序之一或任意组合,从作为选择对象的PUSCH中选出优先级最高的PUSCH:
起始符号以及时域长度均与待发送的PUCCH相同的PUSCH的优先级高于起始符号位置不早于PUCCH的起始符号位置的PUSCH;
起始符号以及时域长度均与PUCCH相同的PUSCH的优先级高于起始符号位置在PUCCH的起始符号位置之前且与PUCCH的起始符号位置之差不大于A个符号的PUSCH,A为正整数;
起始符号位置不早于PUCCH的起始符号位置的PUSCH的优先级高于起始符号位置在PUCCH的起始符号位置之前且与PUCCH的起始符号位置之差不大于A个符号的PUSCH;
起始符号位置不早于PUCCH的起始符号位置的PUSCH中起始符号位置最靠前的PUSCH的优先级最高;
起始符号位置在PUCCH的起始符号位置之前且与PUCCH的起始符号位置之差不大于A个符号的PUSCH中起始符号位置最靠后的PUSCH的优先级最高;
基于调度的PUSCH的优先级高于免调度的PUSCH;
基于时隙调度的PUSCH的优先级高于基于非时隙调度的PUSCH。
另外,第二选择单元401在按照上述优先级顺序之一或任意组合,从作为选择对象的PUSCH中选出优先级最高的PUSCH时,可根据预先设定的不同方式的优先级,按照优先级由高到低的顺序,依次采用各种方式进行选择,其中,后一种方式在相邻的前一种方式选出的PUSCH中进行选择。
按照上述方式选出的PUSCH的数量可能大于一,当大于一时,第二选择单元401可进一步选出其中载波编号最小的PUSCH。
图3和图4所示装置实施例的具体工作流程请参照前述方法实施例中的相应说明,不再赘述。
总之,采用本发明所述方案,可实现PUSCH的合理选择,进而提升了DCI传输性能等。
图5示出了适于用来实现本发明实施方式的示例性计算机***/服务器12的框图。图5显示的计算机***/服务器12仅仅是一个示例,不应对本发明实施例的功能和使用范围带来任何限制。
如图5所示,计算机***/服务器12以通用计算设备的形式表现。计算机***/服务器12的组件可以包括但不限于:一个或者多个处理器(处理单元)16,存储器28,连接不同***组件(包括存储器28和处理器16)的总线18。
总线18表示几类总线结构中的一种或多种,包括存储器总线或者存储器控制器,***总线,图形加速端口,处理器或者使用多种总线结构中的任意总线结构的局域总线。举例来说,这些体系结构包括但不限于工业标准体系结构(ISA)总线,微通道体系结构(MAC)总线,增强型ISA总线、视频电子标准协会(VESA)局域总线以及***组件互连(PCI)总线。
计算机***/服务器12典型地包括多种计算机***可读介质。这些介质可以是任何能够被计算机***/服务器12访问的可用介质,包括易失性和非易失性介质,可移动的和不可移动的介质。
存储器28可以包括易失性存储器形式的计算机***可读介质,例如随机存取存储器(RAM)30和/或高速缓存存储器32。计算机***/服务器12可以进一步包括其它可移动/不可移动的、易失性/非易失性计算机***存储介质。仅作为 举例,存储***34可以用于读写不可移动的、非易失性磁介质(图5未显示,通常称为“硬盘驱动器”)。尽管图5中未示出,可以提供用于对可移动非易失性磁盘(例如“软盘”)读写的磁盘驱动器,以及对可移动非易失性光盘(例如CD-ROM,DVD-ROM或者其它光介质)读写的光盘驱动器。在这些情况下,每个驱动器可以通过一个或者多个数据介质接口与总线18相连。存储器28可以包括至少一个程序产品,该程序产品具有一组(例如至少一个)程序模块,这些程序模块被配置以执行本发明各实施例的功能。
具有一组(至少一个)程序模块42的程序/实用工具40,可以存储在例如存储器28中,这样的程序模块42包括——但不限于——操作***、一个或者多个应用程序、其它程序模块以及程序数据,这些示例中的每一个或某种组合中可能包括网络环境的实现。程序模块42通常执行本发明所描述的实施例中的功能和/或方法。
计算机***/服务器12也可以与一个或多个外部设备14(例如键盘、指向设备、显示器24等)通信,还可与一个或者多个使得用户能与该计算机***/服务器12交互的设备通信,和/或与使得该计算机***/服务器12能与一个或多个其它计算设备进行通信的任何设备(例如网卡,调制解调器等等)通信。这种通信可以通过输入/输出(I/O)接口22进行。并且,计算机***/服务器12还可以通过网络适配器20与一个或者多个网络(例如局域网(LAN),广域网(WAN)和/或公共网络,例如因特网)通信。如图5所示,网络适配器20通过总线18与计算机***/服务器12的其它模块通信。应当明白,尽管图中未示出,可以结合计算机***/服务器12使用其它硬件和/或软件模块,包括但不限于:微代码、设备驱动器、冗余处理单元、外部磁盘驱动阵列、RAID***、磁带驱动器以及数据备份存储***等。
处理器16通过运行存储在存储器28中的程序,从而执行各种功能应用以及数据处理,例如实现图1中所示的方法。
本发明同时公开了一种计算机可读存储介质,其上存储有计算机程序,该程序被处理器执行时将实现如图1中所示的方法。
可以采用一个或多个计算机可读的介质的任意组合。计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的***、装置或器件,或者任意以上的组合。计算机可读存储介质的更具体的例子(非穷举的列表)包括:具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机存取存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑磁盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。在本文件中,计算机可读存储介质可以是任何包含或存储程序的有形介质,该程序可以被指令执行***、装置或者器件使用或者与其结合使用。
计算机可读的信号介质可以包括在基带中或者作为载波一部分传播的数据信号,其中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式,包括——但不限于——电磁信号、光信号或上述的任意合适的组合。计算机可读的信号介质还可以是计算机可读存储介质以外的任何计算机可读介质,该计算机可读介质可以发送、传播或者传输用于由指令执行***、装置或者器件使用或者与其结合使用的程序。
计算机可读介质上包含的程序代码可以用任何适当的介质传输,包括——但不限于——无线、电线、光缆、RF等等,或者上述的任意合适的组合。
可以以一种或多种程序设计语言或其组合来编写用于执行本发明操作的计算机程序代码,所述程序设计语言包括面向对象的程序设计语言—诸如Java、Smalltalk、C++,还包括常规的过程式程序设计语言—诸如”C”语言或类似的程序设计语言。程序代码可以完全地在用户计算机上执行、部分地在用户计算机上执行、作为一个独立的软件包执行、部分在用户计算机上部分在远程计算机上执行、或者完全在远程计算机或服务器上执行。在涉及远程计算机的情形中,远程计算机可以通过任意种类的网络——包括局域网(LAN)或广域网(WAN)—连接到用户计算机,或者,可以连接到外部计算机(例如利用因特网服务提供商来通过因特网连接)。
在本发明所提供的几个实施例中,应该理解到,所揭露的装置和方法等,可以通过其它的方式实现。例如,以上所描述的装置实施例仅仅是示意性的,例如,所述单元的划分,仅仅为一种逻辑功能划分,实际实现时可以有另外的划分方式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的,作为单元显示的部件可以是或者也可以不是物理单元,即可以位于一个地方,或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外,在本发明各个实施例中的各功能单元可以集成在一个处理单元中,也可以是各个单元单独物理存在,也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现,也可以采用硬件加软件功能单元的形式实现。
上述以软件功能单元的形式实现的集成的单元,可以存储在一个计算机可读取存储介质中。上述软件功能单元存储在一个存储介质中,包括若干指令用以使得一台计算机设备(可以是个人计算机,服务器,或者网络设备等)或处理器 (processor)执行本发明各个实施例所述方法的部分步骤。而前述的存储介质包括:U盘、移动硬盘、只读存储器(ROM)、随机存取存储器(RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述仅为本发明的较佳实施例而已,并不用以限制本发明,凡在本发明的精神和原则之内,所做的任何修改、等同替换、改进等,均应包含在本发明保护的范围之内。

Claims (24)

  1. 一种数据传输方法,其特征在于,包括:
    终端从至少两个作为选择对象的物理上行共享信道PUSCH中选出符合预设条件的PUSCH;
    所述终端将第一上行控制信息UCI复用到选出的PUSCH中进行传输。
  2. 根据权利要求1所述的方法,其特征在于,
    该方法进一步包括:所述终端根据配置信息确定使用物理上行控制信道PUCCH承载第二UCI;
    其中,所述第一UCI与所述第二UCI相同,或者,将所述第二UCI压缩后得到所述第一UCI。
  3. 根据权利要求1所述的方法,其特征在于,
    所述作为选择对象的PUSCH包括:与待发送的PUCCH在时间上存在重叠的PUSCH。
  4. 根据权利要求1所述的方法,其特征在于,
    所述终端从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH包括:
    所述终端按照以下优先级顺序之一或任意组合,从作为选择对象的PUSCH中选出优先级最高的PUSCH:
    起始符号以及时域长度均与待发送的PUCCH相同的PUSCH的优先级高于起始符号位置不早于所述PUCCH的起始符号位置的PUSCH;
    起始符号以及时域长度均与所述PUCCH相同的PUSCH的优先级高于起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号 位置之差不大于A个符号的PUSCH,所述A为正整数;
    起始符号位置不早于所述PUCCH的起始符号位置的PUSCH的优先级高于起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号位置之差不大于A个符号的PUSCH;
    起始符号位置不早于所述PUCCH的起始符号位置的PUSCH中起始符号位置最靠前的PUSCH的优先级最高;
    起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号位置之差不大于A个符号的PUSCH中起始符号位置最靠后的PUSCH的优先级最高;
    基于调度的PUSCH的优先级高于免调度的PUSCH;
    基于时隙调度的PUSCH的优先级高于基于非时隙调度的PUSCH。
  5. 根据权利要求4所述的方法,其特征在于,
    所述终端按照以下优先级顺序之一或任意组合,从至少两个作为选择对象的PUSCH中选出优先级最高的PUSCH包括:
    所述终端根据预先设定的不同方式的优先级,按照优先级由高到低的顺序,依次采用各种方式进行选择;
    其中,后一种方式在相邻的前一种方式选出的PUSCH中进行选择。
  6. 根据权利要求1所述的方法,其特征在于,
    该方法进一步包括:若选出的PUSCH的数量大于一,则进一步选出其中载波编号最小的PUSCH。
  7. 一种数据传输方法,其特征在于,包括:
    基站从至少两个作为选择对象的物理上行共享信道PUSCH中选出符合 预设条件的PUSCH;
    所述基站从选出的PUSCH上接收第一上行控制信息UCI。
  8. 根据权利要求7所述的方法,其特征在于,
    所述作为选择对象的PUSCH包括:与待发送的PUCCH在时间上存在重叠的PUSCH。
  9. 根据权利要求7所述的方法,其特征在于,
    所述基站从至少两个作为选择对象的PUSCH中选出符合预设条件的PUSCH包括:
    所述基站按照以下优先级顺序之一或任意组合,从作为选择对象的PUSCH中选出优先级最高的PUSCH:
    起始符号以及时域长度均与待发送的PUCCH相同的PUSCH的优先级高于起始符号位置不早于所述PUCCH的起始符号位置的PUSCH;
    起始符号以及时域长度均与所述PUCCH相同的PUSCH的优先级高于起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号位置之差不大于A个符号的PUSCH,所述A为正整数;
    起始符号位置不早于所述PUCCH的起始符号位置的PUSCH的优先级高于起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号位置之差不大于A个符号的PUSCH;
    起始符号位置不早于所述PUCCH的起始符号位置的PUSCH中起始符号位置最靠前的PUSCH的优先级最高;
    起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号位置之差不大于A个符号的PUSCH中起始符号位置最靠后的PUSCH的优先级最高;
    基于调度的PUSCH的优先级高于免调度的PUSCH;
    基于时隙调度的PUSCH的优先级高于基于非时隙调度的PUSCH。
  10. 根据权利要求9所述的方法,其特征在于,
    所述基站按照以下优先级顺序之一或任意组合,从至少两个作为选择对象的PUSCH中选出优先级最高的PUSCH包括:
    所述基站根据预先设定的不同方式的优先级,按照优先级由高到低的顺序,依次采用各种方式进行选择;
    其中,后一种方式在相邻的前一种方式选出的PUSCH中进行选择。
  11. 根据权利要求7所述的方法,其特征在于,
    该方法进一步包括:若选出的PUSCH的数量大于一,则进一步选出其中载波编号最小的PUSCH。
  12. 一种数据传输装置,其特征在于,包括:第一选择单元以及传输单元;
    所述第一选择单元,用于从至少两个作为选择对象的物理上行共享信道PUSCH中选出符合预设条件的PUSCH;
    所述传输单元,用于将第一上行控制信息UCI复用到选出的PUSCH中进行传输。
  13. 根据权利要求12所述的装置,其特征在于,
    所述传输单元进一步用于,根据配置信息确定使用物理上行控制信道PUCCH承载第二UCI;
    其中,所述第一UCI与所述第二UCI相同,或者,将所述第二UCI压缩后得到所述第一UCI。
  14. 根据权利要求12所述的装置,其特征在于,
    所述作为选择对象的PUSCH包括:与待发送的PUCCH在时间上存在重叠的PUSCH。
  15. 根据权利要求12所述的装置,其特征在于,
    所述第一选择单元按照以下优先级顺序之一或任意组合,从作为选择对象的PUSCH中选出优先级最高的PUSCH:
    起始符号以及时域长度均与待发送的PUCCH相同的PUSCH的优先级高于起始符号位置不早于所述PUCCH的起始符号位置的PUSCH;
    起始符号以及时域长度均与所述PUCCH相同的PUSCH的优先级高于起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号位置之差不大于A个符号的PUSCH,所述A为正整数;
    起始符号位置不早于所述PUCCH的起始符号位置的PUSCH的优先级高于起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号位置之差不大于A个符号的PUSCH;
    起始符号位置不早于所述PUCCH的起始符号位置的PUSCH中起始符号位置最靠前的PUSCH的优先级最高;
    起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号位置之差不大于A个符号的PUSCH中起始符号位置最靠后的PUSCH的优先级最高;
    基于调度的PUSCH的优先级高于免调度的PUSCH;
    基于时隙调度的PUSCH的优先级高于基于非时隙调度的PUSCH。
  16. 根据权利要求15所述的装置,其特征在于,
    所述第一选择单元按照所述优先级顺序之一或任意组合,从作为选择对 象的PUSCH中选出优先级最高的PUSCH时,根据预先设定的不同方式的优先级,按照优先级由高到低的顺序,依次采用各种方式进行选择,其中,后一种方式在相邻的前一种方式选出的PUSCH中进行选择。
  17. 根据权利要求12所述的装置,其特征在于,
    所述第一选择单元进一步用于,若选出的PUSCH的数量大于一,则进一步选出其中载波编号最小的PUSCH。
  18. 一种数据传输装置,其特征在于,包括:第二选择单元以及接收单元;
    所述第二选择单元,用于从至少两个作为选择对象的物理上行共享信道PUSCH中选出符合预设条件的PUSCH;
    所述接收单元,用于从选出的PUSCH上接收第一上行控制信息UCI。
  19. 根据权利要求18所述的装置,其特征在于,
    所述作为选择对象的PUSCH包括:与待发送的PUCCH在时间上存在重叠的PUSCH。
  20. 根据权利要求18所述的装置,其特征在于,
    所述第二选择单元按照以下优先级顺序之一或任意组合,从作为选择对象的PUSCH中选出优先级最高的PUSCH:
    起始符号以及时域长度均与待发送的PUCCH相同的PUSCH的优先级高于起始符号位置不早于所述PUCCH的起始符号位置的PUSCH;
    起始符号以及时域长度均与所述PUCCH相同的PUSCH的优先级高于起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号位置之差不大于A个符号的PUSCH,所述A为正整数;
    起始符号位置不早于所述PUCCH的起始符号位置的PUSCH的优先级高于起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号位置之差不大于A个符号的PUSCH;
    起始符号位置不早于所述PUCCH的起始符号位置的PUSCH中起始符号位置最靠前的PUSCH的优先级最高;
    起始符号位置在所述PUCCH的起始符号位置之前且与所述PUCCH的起始符号位置之差不大于A个符号的PUSCH中起始符号位置最靠后的PUSCH的优先级最高;
    基于调度的PUSCH的优先级高于免调度的PUSCH;
    基于时隙调度的PUSCH的优先级高于基于非时隙调度的PUSCH。
  21. 根据权利要求20所述的装置,其特征在于,
    所述第二选择单元按照所述优先级顺序之一或任意组合,从作为选择对象的PUSCH中选出优先级最高的PUSCH时,根据预先设定的不同方式的优先级,按照优先级由高到低的顺序,依次采用各种方式进行选择,其中,后一种方式在相邻的前一种方式选出的PUSCH中进行选择。
  22. 根据权利要求18所述的装置,其特征在于,
    所述第二选择单元进一步用于,若选出的PUSCH的数量大于一,则进一步选出其中载波编号最小的PUSCH。
  23. 一种计算机设备,包括存储器、处理器及存储在所述存储器上并可在所述处理器上运行的计算机程序,其特征在于,所述处理器执行所述程序时实现如权利要求1~11中任一项所述的方法。
  24. 一种计算机可读存储介质,其上存储有计算机程序,其特征在于, 所述程序被处理器执行时实现如权利要求1~11中任一项所述的方法。
PCT/CN2018/076256 2018-02-11 2018-02-11 数据传输方法、装置、计算机设备及存储介质 WO2019153297A1 (zh)

Priority Applications (9)

Application Number Priority Date Filing Date Title
KR1020207026146A KR20200130295A (ko) 2018-02-11 2018-02-11 데이터 전송 방법, 장치, 컴퓨터 기기 및 저장 매체
AU2018408003A AU2018408003A1 (en) 2018-02-11 2018-02-11 Data transmission method, apparatus, computer device and storage medium
JP2020542835A JP7177842B2 (ja) 2018-02-11 2018-02-11 データ伝送方法、装置、コンピュータ装置及び記憶媒体
CN202010251837.9A CN111490864B (zh) 2018-02-11 2018-02-11 数据传输方法、装置、计算机设备及存储介质
CN201880048254.7A CN110959263A (zh) 2018-02-11 2018-02-11 数据传输方法、装置、计算机设备及存储介质
EP18905623.7A EP3751762A4 (en) 2018-02-11 2018-02-11 DATA TRANSMISSION PROCESS, DEVICE, COMPUTER DEVICE AND STORAGE MEDIA
PCT/CN2018/076256 WO2019153297A1 (zh) 2018-02-11 2018-02-11 数据传输方法、装置、计算机设备及存储介质
US16/886,529 US11006399B2 (en) 2018-02-11 2020-05-28 Data transmission method, apparatus, computer device and storage medium
US17/233,113 US11785603B2 (en) 2018-02-11 2021-04-16 Method, apparatus and non-transitory computer readable medium for selecting a PUSCH to carry UCI

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2018/076256 WO2019153297A1 (zh) 2018-02-11 2018-02-11 数据传输方法、装置、计算机设备及存储介质

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/886,529 Continuation US11006399B2 (en) 2018-02-11 2020-05-28 Data transmission method, apparatus, computer device and storage medium

Publications (1)

Publication Number Publication Date
WO2019153297A1 true WO2019153297A1 (zh) 2019-08-15

Family

ID=67548080

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/076256 WO2019153297A1 (zh) 2018-02-11 2018-02-11 数据传输方法、装置、计算机设备及存储介质

Country Status (7)

Country Link
US (2) US11006399B2 (zh)
EP (1) EP3751762A4 (zh)
JP (1) JP7177842B2 (zh)
KR (1) KR20200130295A (zh)
CN (2) CN110959263A (zh)
AU (1) AU2018408003A1 (zh)
WO (1) WO2019153297A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4278530A1 (en) * 2021-01-14 2023-11-22 INTEL Corporation Mitigation of time-domain overlaps involving transport block over multiple slots transmissions

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101932116A (zh) * 2010-08-09 2010-12-29 中兴通讯股份有限公司 一种选择物理上行共享信道的方法及用户设备
CN102104972A (zh) * 2010-05-24 2011-06-22 电信科学技术研究院 Uci信息传输的配置方法和设备
WO2015109544A1 (zh) * 2014-01-24 2015-07-30 华为技术有限公司 一种信道功率分配优先级的确定方法和设备
US20160323875A1 (en) * 2010-07-26 2016-11-03 Lg Electronics Inc. Method and device for transmitting an uplink control signal in a wireless communication system

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB0525161D0 (en) * 2005-12-09 2006-01-18 Airspan Networks Inc Antenna system for wireless communications
JP2013537727A (ja) * 2010-06-07 2013-10-03 エルジー エレクトロニクス インコーポレイティド 無線通信システムにおける制御情報の伝送方法及び装置
CN103098398B (zh) 2010-07-22 2015-11-25 Lg电子株式会社 在多载波***中发送上行链路控制信息的设备和方法
US9467885B2 (en) * 2010-11-08 2016-10-11 Qualcomm Incorporated Inter-frequency measurement control in a multi-carrier system
EP2806696B1 (en) * 2012-01-20 2021-06-23 ZTE Corporation Uplink signal sending method and user equipment
CN106992847B (zh) * 2016-01-20 2021-01-26 中兴通讯股份有限公司 上行数据发送、接收方法、装置、终端及基站
US10873966B2 (en) * 2018-01-02 2020-12-22 Samsung Electronics Co., Ltd. Signaling of control information in a communication system
CN110139363B (zh) 2018-02-09 2021-11-09 维沃移动通信有限公司 发送uci的方法及用户终端

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102104972A (zh) * 2010-05-24 2011-06-22 电信科学技术研究院 Uci信息传输的配置方法和设备
US20160323875A1 (en) * 2010-07-26 2016-11-03 Lg Electronics Inc. Method and device for transmitting an uplink control signal in a wireless communication system
CN101932116A (zh) * 2010-08-09 2010-12-29 中兴通讯股份有限公司 一种选择物理上行共享信道的方法及用户设备
WO2015109544A1 (zh) * 2014-01-24 2015-07-30 华为技术有限公司 一种信道功率分配优先级的确定方法和设备

Also Published As

Publication number Publication date
CN111490864B (zh) 2022-10-28
US20210235444A1 (en) 2021-07-29
US20200296717A1 (en) 2020-09-17
CN110959263A (zh) 2020-04-03
JP2021516891A (ja) 2021-07-08
EP3751762A1 (en) 2020-12-16
JP7177842B2 (ja) 2022-11-24
KR20200130295A (ko) 2020-11-18
US11785603B2 (en) 2023-10-10
AU2018408003A1 (en) 2020-10-01
EP3751762A4 (en) 2021-06-30
US11006399B2 (en) 2021-05-11
CN111490864A (zh) 2020-08-04

Similar Documents

Publication Publication Date Title
RU2732725C1 (ru) Способ указания позиции канала и относящийся к нему продукт
US20220053068A1 (en) Methods, apparatuses and computer storage media for applet state synchronization
US10380050B2 (en) Electronic device configured to communicate with an external electronic device using a USB connector
CN109213611B (zh) 跨进程通讯方法、装置、终端及存储介质
KR102076280B1 (ko) 이동 통신 시스템에서 전자 장치의 통신 수행 방법 및 장치
US11397820B2 (en) Method and apparatus for processing data, computer device and storage medium
EP3021562A1 (en) Method for sharing screen and electronic device thereof
US20220139295A1 (en) Information display method, terminal device, and storage medium
US10241718B2 (en) Electronic device and method of analyzing fragmentation of electronic device
KR20160042739A (ko) 화면을 공유하기 위한 방법 및 그 전자 장치
US10198174B2 (en) Electronic device and method of managing memory of electronic device
US9756674B2 (en) Method of transmitting and receiving data of electronic device and electronic device using the method
US9538248B2 (en) Method for sharing broadcast channel information and electronic device thereof
CN109756568A (zh) 文件的处理方法、设备及计算机可读存储介质
CN107231644B (zh) 用于提供通信功能的方法和电子设备
KR20150066876A (ko) 사용자 인터페이스 제어 방법 및 그 전자 장치
US20200220824A1 (en) Method, a device and a storage medium of forwarding voice information in instant messaging
US20160029027A1 (en) Device and method for processing image
US10319341B2 (en) Electronic device and method for displaying content thereof
WO2021012795A1 (zh) 网络节点的调度方法、装置、电子设备和存储介质
KR102240526B1 (ko) 전자 장치의 컨텐츠 다운로드 방법 및 그 전자 장치
KR20150074415A (ko) 심카드 사용 제어 방법 및 그 전자 장치
US10075798B2 (en) Method for providing audio and electronic device adapted to the same
WO2019153297A1 (zh) 数据传输方法、装置、计算机设备及存储介质
KR102089629B1 (ko) 데이터 처리 방법 및 그 방법을 처리하는 전자장치

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2020542835

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2018905623

Country of ref document: EP

Effective date: 20200911

ENP Entry into the national phase

Ref document number: 2018408003

Country of ref document: AU

Date of ref document: 20180211

Kind code of ref document: A