WO2022236752A1 - 无线通信方法、第一设备和第二设备 - Google Patents

无线通信方法、第一设备和第二设备 Download PDF

Info

Publication number
WO2022236752A1
WO2022236752A1 PCT/CN2021/093465 CN2021093465W WO2022236752A1 WO 2022236752 A1 WO2022236752 A1 WO 2022236752A1 CN 2021093465 W CN2021093465 W CN 2021093465W WO 2022236752 A1 WO2022236752 A1 WO 2022236752A1
Authority
WO
WIPO (PCT)
Prior art keywords
time domain
available time
domain unit
physical channel
count
Prior art date
Application number
PCT/CN2021/093465
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 EP21941325.9A priority Critical patent/EP4329399A1/en
Priority to CN202180093693.1A priority patent/CN116897571A/zh
Priority to PCT/CN2021/093465 priority patent/WO2022236752A1/zh
Publication of WO2022236752A1 publication Critical patent/WO2022236752A1/zh
Priority to US18/388,591 priority patent/US20240090039A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/189—Transmission or retransmission of more than one copy of a message
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
    • 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

Definitions

  • the embodiments of the present application relate to the communication field, and more specifically, relate to a wireless communication method, a first device, and a second device.
  • the number of repetitions of the Physical Uplink Shared Channel (PUSCH) repeated transmission is semi-statically configured.
  • the PUSCH repetitions of some slots (slots) will be ignored. (or be canceled). That is to say, in some configurations, especially in the case of time division duplexing (Time Division Duplexing, TDD), the number of repetitions configured cannot achieve an ideal coverage enhancement effect.
  • TDD Time Division Duplexing
  • PUSCH physical uplink data channel enhancement
  • Type B-based PUSCH repeated transmission For repeated transmission of PUSCH based on Type A, the terminal determines its corresponding redundancy version (redundancy version, RV) based on the nth transmission occasion (n th transmission occasion).
  • RV redundancy version
  • the corresponding PUSCH transmission is cancelled, which will lead to deterioration of decoding performance. For example, assuming that one transmission opportunity is one time slot, in the process of sending multiple PUSCH repetitions to the network device, the terminal device needs to use the time slot for sending the certain PUSCH repetition for a certain PUSCH repetition among the multiple PUSCH repetitions.
  • the time domain position of the time slot determine the version number of its corresponding redundancy version (redundancy version, RV), if the time slot used to send the PUSCH repetition is canceled, that is, the PUSCH repetition corresponding to the RV is canceled , if the canceled PUSCH repetition is the PUSCH repetition corresponding to RV0, the decoding performance will deteriorate.
  • RV redundancy version
  • the terminal determines its corresponding RV based on the number of actual repetitions (actual repetition).
  • the RV corresponding to the subsequent actual repetition will change, but the network side does not I don't know, this will lead to an inconsistency between the network side and the UE's understanding of the RV version corresponding to the PUSCH during the repeated PUSCH transmission.
  • the embodiment of the present application provides a wireless communication method, a first device, and a second device.
  • the network side and the terminal side maintain the same understanding of the RV version corresponding to each transmission during repeated transmissions. , thereby improving the communication quality.
  • the present application provides a wireless communication method, including:
  • the present application provides a wireless communication method, including:
  • the present application provides a first device configured to execute the method in the above first aspect or various implementations thereof.
  • the first device includes a functional module configured to execute the method in the foregoing first aspect or each implementation manner thereof.
  • the first device may include a processing unit configured to perform functions related to information processing.
  • the processing unit may be a processor.
  • the first device may include a sending unit and/or a receiving unit.
  • the sending unit is used to perform functions related to sending, and the receiving unit is used to perform functions related to receiving.
  • the sending unit may be a transmitter or transmitter, and the receiving unit may be a receiver or receiver.
  • the first device is a communication chip, the sending unit may be an input circuit or interface of the communication chip, and the sending unit may be an output circuit or interface of the communication chip.
  • the present application provides a second device configured to execute the method in the above second aspect or various implementations thereof.
  • the second device includes a functional module configured to execute the method in the foregoing second aspect or each implementation manner thereof.
  • the second device may include a processing unit configured to perform functions related to information processing.
  • the processing unit may be a processor.
  • the second device may include a sending unit and/or a receiving unit.
  • the sending unit is used to perform functions related to sending, and the receiving unit is used to perform functions related to receiving.
  • the sending unit may be a transmitter or transmitter, and the receiving unit may be a receiver or receiver.
  • the second device is a communication chip, the receiving unit may be an input circuit or interface of the communication chip, and the sending unit may be an output circuit or interface of the communication chip.
  • the present application provides a first device, including a processor and a memory.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program stored in the memory, so as to execute the method in the above first aspect or each implementation manner thereof.
  • processors there are one or more processors, and one or more memories.
  • the memory may be integrated with the processor, or the memory may be separated from the processor.
  • the first device further includes a transmitter (transmitter) and a receiver (receiver).
  • the present application provides a second device, including a processor and a memory.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program stored in the memory, so as to execute the method in the above second aspect or each implementation manner thereof.
  • processors there are one or more processors, and one or more memories.
  • the memory may be integrated with the processor, or the memory may be separated from the processor.
  • the second device further includes a transmitter (transmitter) and a receiver (receiver).
  • the present application provides a chip configured to implement any one of the above-mentioned first aspect to the second aspect or a method in each implementation manner thereof.
  • the chip includes: a processor, configured to call and run a computer program from the memory, so that the device installed with the chip executes any one of the above-mentioned first to second aspects or various implementations thereof method in .
  • the present application provides a computer-readable storage medium for storing a computer program, and the computer program enables the computer to execute any one of the above-mentioned first to second aspects or the method in each implementation manner thereof .
  • the present application provides a computer program product, including computer program instructions, the computer program instructions cause a computer to execute any one of the above first to second aspects or the method in each implementation manner.
  • the present application provides a computer program, which, when run on a computer, causes the computer to execute any one of the above-mentioned first to second aspects or the method in each implementation manner.
  • counting is performed based on a plurality of available time domain units corresponding to the first physical channel to obtain the count of each available time domain unit; then based on the number of repeated transmissions and the counting of each available time domain unit, sending the repeated data of the first physical channel; equivalent to, no matter whether the available time domain unit is canceled or not, it is counted, based on this, the network equipment and the terminal
  • the counting results of the available time-domain resources of the device will be consistent, which not only helps to improve the decoding performance, but also helps the network side and the terminal side to maintain the same understanding of the RV version corresponding to each transmission during repeated transmissions, thereby improving communication quality .
  • FIG. 1 is an example of a system framework provided by an embodiment of the present application.
  • FIG. 2 is a schematic diagram of repeated transmission of a time slot aggregation PUSCH provided by an embodiment of the present application.
  • FIG. 3 is a schematic diagram of time-domain resources for Type B-based PUSCH repeated transmission provided by an embodiment of the present application.
  • Fig. 4 is a schematic flowchart of a wireless communication method provided by an embodiment of the present application.
  • FIG. 5 is a schematic diagram of counting repeated transmissions based on actual PUSCH repetitions provided by an embodiment of the present application.
  • FIG. 6 is a schematic diagram of repeated transmission counting based on available time domain units provided by an embodiment of the present application.
  • FIG. 7 is a schematic diagram of determining an RV based on an actual PUSCH repetition count provided by an embodiment of the present application.
  • FIG. 8 is a schematic diagram of RV for determining a transmission opportunity provided by an embodiment of the present application.
  • FIG. 9 is a schematic diagram of determining an RV based on an available time-domain unit technique provided by an embodiment of the present application.
  • Fig. 10 is another schematic flowchart of the wireless communication method provided by the embodiment of the present application.
  • Fig. 11 is a schematic block diagram of a first device provided by an embodiment of the present application.
  • Fig. 12 is a schematic block diagram of a second device provided by an embodiment of the present application.
  • Fig. 13 is a schematic block diagram of a communication device provided by an embodiment of the present application.
  • Fig. 14 is a schematic block diagram of a chip provided by an embodiment of the present application.
  • Fig. 1 is a schematic diagram of a system framework of an embodiment of the present application.
  • a communication system 100 may include a terminal device 110 and a network device 120 .
  • the network device 120 may communicate with the terminal device 110 through an air interface. Multi-service transmission is supported between the terminal device 110 and the network device 120 .
  • the embodiment of the present application is only described by using the communication system 100 as an example, but the embodiment of the present application is not limited thereto. That is to say, the technical solutions of the embodiments of the present application can be applied to various communication systems, such as: Long Term Evolution (Long Term Evolution, LTE) system, LTE Time Division Duplex (Time Division Duplex, TDD), Universal Mobile Communication System (Universal Mobile Telecommunications System, UMTS), Internet of Things (Internet of Things, IoT) system, Narrow Band Internet of Things (NB-IoT) system, enhanced Machine-Type Communications (eMTC) system, 5G communication system (also known as New Radio (NR) communication system), or future communication systems, etc.
  • LTE Long Term Evolution
  • LTE Time Division Duplex Time Division Duplex
  • TDD Time Division Duplex
  • Universal Mobile Communication System Universal Mobile Telecommunications System
  • UMTS Universal Mobile Communication System
  • Internet of Things Internet of Things
  • NB-IoT Narrow Band Internet of Things
  • eMTC enhanced Machine-Type Communications
  • the network device 120 may be an access network device that communicates with the terminal device 110 .
  • the access network device can provide communication coverage for a specific geographical area, and can communicate with terminal devices 110 (such as UEs) located in the coverage area.
  • the network device 120 may be an evolved base station (Evolutional Node B, eNB or eNodeB) in a Long Term Evolution (Long Term Evolution, LTE) system, or a Next Generation Radio Access Network (NG RAN) device, Either a base station (gNB) in the NR system, or a wireless controller in a cloud radio access network (Cloud Radio Access Network, CRAN), or the network device 120 can be a relay station, an access point, a vehicle-mounted device, a wearable Devices, hubs, switches, bridges, routers, or network devices in the future evolution of the Public Land Mobile Network (Public Land Mobile Network, PLMN), etc.
  • Evolutional Node B, eNB or eNodeB in a Long Term Evolution (Long Term Evolution, LTE) system
  • NG RAN Next Generation Radio Access Network
  • gNB base station
  • CRAN Cloud Radio Access Network
  • the network device 120 can be a relay station, an access point, a vehicle-mounted device, a wear
  • the terminal device 110 may be any terminal device, including but not limited to a terminal device connected to the network device 120 or other terminal devices by wire or wirelessly.
  • the terminal equipment 110 may refer to an access terminal, a user equipment (User Equipment, UE), a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, user agent, or user device.
  • Access terminals can be cellular phones, cordless phones, Session Initiation Protocol (SIP) phones, IoT devices, satellite handheld terminals, Wireless Local Loop (WLL) stations, Personal Digital Assistant , PDA), handheld devices with wireless communication functions, computing devices or other processing devices connected to wireless modems, vehicle-mounted devices, wearable devices, terminal devices in 5G networks or terminal devices in future evolution networks, etc.
  • SIP Session Initiation Protocol
  • WLL Wireless Local Loop
  • PDA Personal Digital Assistant
  • the terminal device 110 can be used for device-to-device (Device to Device, D2D) communication.
  • D2D Device to Device
  • the wireless communication system 100 may also include a core network device 130 that communicates with the base station.
  • the core network device 130 may be a 5G core network (5G Core, 5GC) device, for example, Access and Mobility Management Function (Access and Mobility Management Function , AMF), and for example, authentication server function (Authentication Server Function, AUSF), and for example, user plane function (User Plane Function, UPF), and for example, session management function (Session Management Function, SMF).
  • the core network device 130 may also be a packet core evolution (Evolved Packet Core, EPC) device of the LTE network, for example, a data gateway (Session Management Function+Core Packet Gateway, SMF+PGW- C) equipment.
  • EPC packet core evolution
  • SMF+PGW-C can realize the functions of SMF and PGW-C at the same time.
  • the above-mentioned core network equipment may be called by other names, or a new network entity may be formed by dividing functions of the core network, which is not limited in this embodiment of the present application.
  • Various functional units in the communication system 100 may also establish a connection through a next generation network (next generation, NG) interface to implement communication.
  • NG next generation network
  • the terminal device establishes an air interface connection with the access network device through the NR interface to transmit user plane data and control plane signaling; the terminal device can establish a control plane signaling connection with the AMF through the NG interface 1 (N1 for short); access Network equipment such as the next generation wireless access base station (gNB), can establish a user plane data connection with UPF through NG interface 3 (abbreviated as N3); access network equipment can establish control plane signaling with AMF through NG interface 2 (abbreviated as N2) connection; UPF can establish a control plane signaling connection with SMF through NG interface 4 (abbreviated as N4); UPF can exchange user plane data with the data network through NG interface 6 (abbreviated as N6); AMF can communicate with SMF through NG interface 11 (abbreviated as N11) The SMF establishes a control plane signaling connection; the SMF may establish a control plane signaling connection with the PCF through an NG interface 7 (N7 for short).
  • gNB next generation wireless access base station
  • Figure 1 exemplarily shows a base station, a core network device, and two terminal devices.
  • the wireless communication system 100 may include multiple base station devices and each base station may include other numbers of terminals within the coverage area.
  • the device is not limited in the embodiment of this application.
  • the communication device may include a network device 120 and a terminal device 110 having a communication function, and the network device 120 and the terminal device 110 may be the devices described above, which will not be repeated here;
  • the communication device may also include other devices in the communication system 100, such as network controllers, mobility management entities and other network entities, which are not limited in this embodiment of the present application.
  • NR R15 introduces the repeated transmission of time slot aggregation PUSCH.
  • Slot aggregation PUSCH repeated transmission means that the same transmission block is repeatedly transmitted K times with different redundancy versions.
  • the base station configures the number of repetitions K for the terminal through the high-level parameter, that is, the PUSCH aggregation factor (pusch-AggregationFactor), and the terminal repeatedly sends the same transmission block on K consecutive time slots, and each time slot carries the PUSCH copy of the transmission block occupy the same symbols in the time domain.
  • the PUSCH aggregation factor pusch-AggregationFactor
  • the redundancy version (RV) of the first PUSCH copy is indicated by the uplink grant signaling, and the RVs of the remaining PUSCH copies are cycled in the order of ⁇ 0, 2, 3, 1 ⁇ .
  • RV redundancy version
  • the terminal can implement rate matching on transmission blocks through circular buffering. That is, the terminal can store the coded bits in the circular buffer, and sequentially read them from the circular buffer according to the redundancy version at each transmission, so as to realize rate matching.
  • the read position for rate matching is determined by the redundancy version rv, or the RV version can be used to indicate from which position in this buffer to fetch data.
  • RVs preset in the circular buffer, namely RV 0 , RV 1 , RV 2 and RV 3 .
  • the selection order of these 4 RVs is [0, 2, 3, 1], that is, after the first transmission, RV 0 is used as the starting position, the second transmission is based on RV 2 , and the third transmission is based on RV 3 is the starting position, and the fourth transmission takes RV 1 as the starting position, wherein, the first transmission refers to the first transmission of data, and the second, third, and fourth transmissions are data retransmissions.
  • 0, 2, 3, 1 are typical selection sequences of RVs when LTE/NR transmits data, where 0, 2, 3, and 1 are the values corresponding to the first RV (that is, RV 0 ), and the third RV ( That is, the value corresponding to RV 2 ), the value corresponding to the fourth RV (ie RV 3 ), and the value corresponding to the second RV (ie RV 1 ).
  • FIG. 2 is a schematic diagram of repeated transmission of a time slot aggregation PUSCH provided by an embodiment of the present application.
  • the base station configures the terminal to repeatedly send the transport block 4 times, and the PUSCH copy occupies symbols #0 to #11 in each time slot.
  • symbols #0 ⁇ #2 of time slot #1 and time slot #2 are semi-static downlink symbols, the second PUSCH repetition to be sent on time slot #1 and the second PUSCH repetition to be sent on time slot #2 The third PUSCH repetition will be discarded and not sent.
  • the number of repetitions of the transport block is configured by the high layer parameter RepK.
  • PUSCH physical uplink data channel enhancement
  • the base station sends an uplink grant or an authorization-free indication of one or more nominal PUSCH repeated transmissions.
  • the terminal transmits one or more actual PUSCH copies in one time slot, or transmits two or more actual PUSCH copies in multiple consecutive available time slots.
  • the base station adds a column in the time domain resource allocation table (Time Domain Resource Allocation, TDRA), which is used to indicate the number of copies of the repeated transmission of the B-type PUSCH, and its value can be ⁇ 1, 2, 3, 4, 7, 8 , 12, 16 ⁇ .
  • TDRA Time Domain Resource Allocation
  • the uplink scheduling signaling or the first type of authorization-free configuration information indicates the start symbol S and duration L of the first nominal PUSCH, and the duration L of each nominal PUSCH copy is the same, where 0 ⁇ S ⁇ 13, 1 ⁇ L ⁇ 14, high-level signaling uses 4 bits to indicate S and L respectively, and S+L>14 can be realized.
  • the transport block size (TBS) of the nominal and actual PUSCH replicas is determined according to the time domain length L of the nominal PUSCH. Starting from the second nominal PUSCH, the start symbol of a nominal PUSCH copy is the next symbol after the stop symbol of the previous nominal PUSCH copy.
  • the terminal Before the terminal determines the time domain resources of the actual PUSCH replica, it needs to determine invalid symbols, and the remaining symbols can be considered as potentially valid symbols. If the number of consecutive potential effective symbols in a nominal PUSCH copy is greater than 0, an actual PUSCH copy can be mapped, and the time domain resource of a nominal PUSCH copy can include the time domain resources of one or more actual PUSCH copies.
  • the terminal does not transmit the actual PUSCH copy of a single symbol, unless the single symbol is the duration L of the nominal PUSCH indicated by the base station.
  • FIG. 3 is a schematic diagram of time-domain resources for Type B-based PUSCH repeated transmission provided by an embodiment of the present application.
  • the base station sends an uplink grant or a grant-free instruction to indicate repeated transmission of 4 nominal PUSCHs, and the duration L of each nominal PUSCH copy is equal to 4.
  • the time domain resources of the first nominal PUSCH copy can contain the time domain resources of 2 actual PUSCH copies (i.e.
  • the time domain resource of the actual PUSCH copy (that is, the third actual PUSCH), the time domain resource of the third nominal PUSCH copy can include the time domain of two actual PUSCH copies (that is, the fourth actual PUSCH and the fifth actual PUSCH) resource, the time-domain resource of the fourth nominal PUSCH copy may contain the time-domain resources of two actual PUSCH copies; however, since the time-domain resource of the actual PUSCH copy at the front is one symbol, the actual PUSCH copy is not sent, that is, Only the copy of the actual PUSCH at a later position (that is, the sixth actual PUSCH) is sent.
  • the terminal may determine invalid symbols in at least one of the following manners:
  • the downlink symbol configured semi-statically by the upper layer parameter tdd-UL-DL-ConfigurationCommon or tdd-UL-DL-Configuration Dedicated is an invalid symbol.
  • the high-level parameter InvalidSymbolPattern configures a symbol-level bitmap (Bitmap), and a bit value of 1 indicates that the corresponding symbol is an invalid symbol.
  • Bitmap symbol-level bitmap
  • the DCI format 0_1 or 0_2 schedules PUSCH repetition, or activates the second type of authorization-free PUSCH repetition, and the DCI is configured with a 1-bit invalid symbol pattern indication information field
  • the terminal uses the invalid symbol pattern , otherwise the terminal ignores invalid symbol patterns. If the DCI does not include the invalid symbol pattern indication information field, the terminal directly applies the invalid symbol pattern according to the configuration of the high-layer parameter InvalidSymbolPattern.
  • Different DCI formats independently configure the invalid symbol pattern indication information field.
  • the repeated transmission of PUSCH based on Type A is that the user sends the same transport block (TB) on consecutive K time slots, and the symbol positions occupied in the K time slots are exactly the same (the start symbol position and the occupied symbol length are the same ).
  • the version number of the first transmission can be determined according to the indication information in the downlink control information (Downlink Control Information, DCI) domain (field), the indication information can occupy two bits, and the subsequent RV version number is according to 0, 2, 3, 1 cycle. For example, when the DCI indicates that the version number of the first transmission is 2, the subsequent version numbers are 3, 1, 0, 2, ... in sequence.
  • DCI Downlink Control Information
  • PUSCHRepTypeIndicatorForType1Configuredgrant when configured as pusch-RepTypeB, it indicates that it is a type B PUSCH repetition, otherwise it is a type A PUSCH repetition. If there are numberofrepetitions in the time domain resource allocation table, the nominal number of repeated transmissions of PUSCH is determined by a row in the TDRA table, otherwise the number of repetitions is determined by the high-level parameter repK.
  • the number of repeated transmissions of the Physical Uplink Shared Channel is semi-statically configured.
  • the repetition of some slots will be ignored. . Therefore, in some configurations, especially in the case of TDD, the number of repetitions of the configuration cannot achieve an ideal coverage enhancement effect.
  • TB processing over multi-slot TBoMS
  • TBS Transport Block Size
  • Type A-based PUSCH repeated transmission (repetition type A) is based on the redundancy version (redundancy version, RV) in each time slot for rate matching processing, if according to R15/R16
  • the rate matching mechanism of R16 performs rate matching on the transport blocks in TboMS.
  • rate matching is performed based on one RV in each time slot, since TBS is determined for multiple time slots, it is possible to lose the data corresponding to RV0 and/or RV1.
  • Systematic bits degrade the decoding performance. For example, when the symbols available for uplink transmission in a time slot are not enough to transmit a bit sequence corresponding to RV, the systematic bits corresponding to RV0 and/or RV1 may be lost, degrading the decoding performance.
  • the embodiment of the present application provides a wireless communication method, terminal equipment, and network equipment, which can not only realize the rate matching of the transport blocks in TboMS, but also avoid losing the system bit corresponding to RV0 and/or RV1, so as to improve Decoding performance for rate-matched sequences.
  • the physical layer receives a transmission block of the medium access control layer (MAC)
  • MAC medium access control layer
  • CRC Cyclic Redundancy Check
  • After adding CRC if the number of bits it contains exceeds a certain value, it needs to be divided into two or more code blocks of the same length; each code block is added with CRC; then, each code block with CRC is independently LDPC encoding is performed; then, rate matching, hybrid automatic repeat request (HARQ) processing and interleaving are performed on each encoded code block respectively.
  • CRC Cyclic Redundancy Check
  • CRC is a channel coding technology that generates a short fixed-digit check code based on data such as network packets or computer files, and is mainly used to detect or verify errors that may occur after data transmission or storage. It uses the principle of division and remainder for error detection. Specifically, the CRC forms an n-bit transmission frame T by adding (n-k) redundant bits, that is, a frame check sequence (Frame Check Sequence, FCS), after the k-bit data D to be transmitted. Rate matching means that the bits on the transmission channel are repeated, zero-filled or punctured to match the carrying capacity of the physical channel, and the bit rate required by the transmission format is reached during channel mapping.
  • FCS Frame Check Sequence
  • rate matching if the number of input bits is less than the number of output bits, it is filled with retransmission or zero bits; if the number of input bits is more than the number of output bits, it is punched.
  • Punching is to knock out some bits according to a certain pattern, that is, remove or knock out from the bit sequence, and at the same time move the following bits forward one by one. To repeat is to insert the current bit once between the current bit and the next bit.
  • Zero bit stuffing is to insert zero bits between the current bit and the next bit.
  • De-rate-matching algorithms do the opposite, recovering knocked-out bits, or knocking out repetition/zero-padding bits.
  • the coded bit sequence can be represented by d 0 , d 1 , d 2 ,...d N-1 (N is the sequence length after coding), and the sequence will be input into a In the circular buffer area of N cb .
  • E r to represent the length of the output sequence after the rate matching of the rth code block.
  • the determination process of Er can be realized by the following code:
  • N L is the number of transport layers to be mapped by the transport block
  • Q m is the modulation order
  • G is the total number of coded bits of the transport block for transmission
  • C ' C
  • C' is the number of code blocks of the scheduled transport block.
  • the first bit k 0 in the output sequence after rate matching is related to the rv id and the base graph (Base Graph, BG) of the Low Density Parity Check Code (Low Density Parity Check Code, LDPC).
  • BG is the core of the whole LDPC code design.
  • Each TB code block needs to be encoded by LDPC base graph 1 (LDPC base graph 1) or LDPC base graph 2 (LDPC base graph 2).
  • LDPC base graph 1 LDPC base graph 1
  • LDPC base graph 2 LDPC base graph 2
  • the output sequence e k after rate matching can be implemented by the following code:
  • the coded bits obtained by rate matching are interleaved and then modulated, that is, bit interleaved coded modulation, which is used to ensure the performance stability of LDPC codes in high-order modulation and fading channels.
  • the bit sequence obtained through bit selection is e 0 , e 1 , e 2 ,...,e E-1 , the bit sequence needs to be interleaved, and the sequence f 0 , f 1 , f 2 ,..., f E-1 .
  • bit interleaving can be achieved by the following code:
  • the terminal determines its corresponding redundancy version (redundancy version, RV) based on the nth transmission occasion (n th transmission occasion), and for Type B-based PUSCH repeated transmission , the terminal determines its corresponding RV based on the number of actual repetitions (actual repetition).
  • RV redundancy version
  • the terminal determines its corresponding redundancy version (redundancy version, RV) based on the nth transmission occasion (n th transmission occasion), at this time, if due to an emergency (such as sending PRACH), The PUSCH transmission corresponding to RV0 is canceled, which will lead to deterioration of decoding performance. For example, assuming that one transmission opportunity is one time slot, in the process of sending multiple PUSCH repetitions to the network device, the terminal device needs to use the PUSCH repetition method for sending the certain PUSCH repetition for one of the multiple PUSCH repetitions.
  • redundancy version redundancy version
  • the time domain position of the time slot determine the version number of its corresponding redundancy version (redundancy version, RV), if the time slot used to send the PUSCH repetition is canceled, that is, the PUSCH repetition corresponding to the RV is canceled , if the canceled PUSCH repetition is the PUSCH repetition corresponding to RV0, the decoding performance will deteriorate.
  • RV redundancy version
  • an embodiment of the present application provides a wireless communication method, a first device, and a second device.
  • the network side and the terminal side can check the RV version corresponding to each transmission during repeated transmissions. Consistency in understanding improves communication quality.
  • the wireless communication method provided by this application will be described below.
  • Fig. 4 shows a schematic flowchart of a wireless communication method 200 according to an embodiment of the present application, and the method 200 may be executed by a first device.
  • the first device may be a sender of physical channel repeated transmission, for example, the terminal device or network device shown in FIG. 1 .
  • the method 200 may include:
  • counting is performed based on a plurality of available time domain units corresponding to the first physical channel to obtain the count of each available time domain unit; then based on the number of repeated transmissions and the counting of each available time domain unit, sending the repeated data of the first physical channel; equivalent to, no matter whether the available time domain unit is canceled or not, it is counted, based on this, the network equipment and the terminal
  • the counting results of the available time-domain resources of the device will be consistent, which not only helps to improve the decoding performance, but also helps the network side and the terminal side to maintain the same understanding of the RV version corresponding to each transmission during repeated transmissions, thereby improving communication quality .
  • the available time domain unit includes at least one consecutive time slot or at least one consecutive symbol.
  • the available time domain unit is at least one symbol allocated by a time domain resource allocation table (Time Domain Resource Allocation, TDRA) in one slot, and the at least one symbol is used for uplink transmission.
  • TDRA Time Domain Resource Allocation
  • the available time domain unit is at least one symbol allocated by the time domain resource allocation table TDRA in a time slot, and the at least one symbol is used for uplink transmission.
  • the available time domain unit is the symbol allocated by TDRA in this time slot, and the symbols allocated by TDRA are all uplink symbols.
  • these uplink symbols can be the available time domain Conversely, if there is at least one symbol allocated by TDRA in a slot (slot) that is not a symbol for uplink (UL) transmission, the slot is considered to be an unavailable slot (unavailable slot). For unusable time slots, in the repeated transmission of the physical channel, the number of repetitions is not counted.
  • the available time domain unit is at least one continuous symbol, and the at least one continuous symbol is used for uplink transmission.
  • the available time domain unit is at least one continuous symbol, and the at least one continuous symbol is used for uplink transmission.
  • the terminal before determining the available time domain unit, the terminal needs to determine invalid symbols, and the remaining symbols can be considered as potentially effective symbols; if the number of consecutive potentially effective symbols in a slot is greater than 0, these effective symbols can be used as an available domain unit. Further, if the number of consecutive potentially effective symbols in a time slot is greater than 1, these effective symbols can be used as an available time domain unit.
  • the S230 may include:
  • the plurality of available time domain units includes canceled available time domain units.
  • the canceled available time domain unit includes: the canceled available time domain unit indicated by the network device, and/or the canceled available time domain unit caused by the user equipment UE but not known by the network device unit.
  • the canceled available time-domain unit caused by the user equipment UE but not known by the network device meets at least one of the following conditions: the transmit power of the available time-domain unit is limited; A first signal, where the priority of the first signal is higher than that of the physical channel.
  • the first signal includes at least one of the following: a physical uplink control channel PUCCH, a physical random access channel PRACH, and a sounding reference signal SRS.
  • PUSCH or PUCCH or PRACH for single-cell operation with two uplink carriers or operation with carrier aggregation, if in available time domain unit i, PUSCH or PUCCH or PRACH or The total UE transmit power of SRS transmission exceeds a certain threshold, and the terminal can allocate power to PUSCH/PUCCH/PRACH/SRS transmission according to the following priority order (descending order), so that in each symbol of available time domain unit i, used for The total transmit power of transmissions on the serving cells within the frequency range is less than or equal to the threshold for the frequency range.
  • PRACH has a higher priority.
  • the UE temporarily needs to transmit PRACH on the available time domain unit for transmitting PUSCH, due to power limitation, the repeated transmission of PUSCH needs to got canceled.
  • the network side does not know the special situation that the PUSCH is canceled due to the UE.
  • the total UE transmit power of each symbol in the available time domain unit may be: the linear sum of the UE transmit power of PUSCH, PUCCH, PRACH and SRS in the symbol.
  • the number of the plurality of available time domain units is greater than or equal to the number of available time domain units for actually performing repeated data transmission.
  • FIG. 5 is a schematic diagram of counting repeated transmissions based on actual PUSCH repetitions provided by an embodiment of the present application.
  • the actual number of repeated transmissions can reach the number of repeated transmissions configured by the network, thereby achieving better coverage performance, but it will also lead to inconsistencies between the network side and the UE's understanding of the number of repetitions, which will cause network devices to fail to receive correctly.
  • FIG. 6 is a schematic diagram of repeated transmission counting based on available time domain units provided by an embodiment of the present application.
  • the number of repetitions still needs to be counted, that is, the number of repeated transmissions is counted based on the available time domain units.
  • the number of repeated transmissions of the USCH is less than the network configuration. number of retransmissions.
  • the repeated transmission count is counted based on all available time domain units (including potentially canceled available time domain units caused by the UE but unknown to the network side), thus avoiding This brings about the problem that the network side and the UE have inconsistent understandings of the number of repetitions and the available time domain units used for repeated transmissions.
  • the counting method for the number of repeated transmissions provided by this application can ensure that the counting results of the available time domain resources of the network device and the terminal device will be consistent, which not only helps to improve the decoding performance, but also It is beneficial for the network side and the terminal side to maintain the same understanding of the RV version corresponding to each transmission during repeated transmission, thereby improving communication quality.
  • the S230 may include:
  • the first device counts the number of repetitions based on the plurality of available time domain units, denoted as n th , and then calculates the RV version based on the nth available time domain unit (n th available time domain unit).
  • the RV based on the RV applicable to the first available time domain unit in the plurality of available time domain units and the count of each available time domain unit, the RV is identified as 0, 2, 3, 1. Determine the RV applicable to each available time domain unit in a sequential loop manner.
  • the RV of the first available time domain unit is the RV id indicated by the downlink control information DCI used to schedule the PUSCH.
  • the RV applicable to each available time domain unit is determined according to the following table:
  • mod represents a modulo operation
  • FIG. 7 is a schematic diagram of determining an RV based on an actual PUSCH repetition count provided by an embodiment of the present application.
  • the time domain resource of an actual PUSCH repetition is a time slot
  • there are 4 actual PUSCH repetitions if none of the 4 actual PUSCH repetitions is canceled due to UE reasons but unknown to the network equipment
  • the actual PUSCH repetition the RV of the first actual PUSCH repetition is RV0
  • the RV of the second actual PUSCH repetition is RV2
  • the RV of the third actual PUSCH repetition is RV3
  • the RV of the fourth actual PUSCH repetition is RV1;
  • there is a canceled actual PUSCH repetition among the 4 actual PUSCH repetitions that is caused by the UE but is not known to the network equipment for example, suppose that the first actual PUSCH repetition among the 4 actual PUSCH repetitions is due to UE Due to the actual PUSCH repetition that is canceled but not
  • the first actual PUSCH repetition The repeated RV is RV0, but the network device will think that the RV of the first actual PUSCH repetition is RV2, and the second, third, and fourth actual PUSCH repetitions are repeated with the first and first actual PUSCH, that is, there is a pair between the network side and the UE. RV understands inconsistencies.
  • FIG. 8 is a schematic diagram of RV for determining a transmission opportunity provided by an embodiment of the present application.
  • a transmission opportunity is a time slot, as shown in Figure 8, there are 10 time slots, the RV of the first time slot is RV0, the RV of the second time slot is RV2, and the RV of the third time slot is RV3 , the RV of the 4th time slot is RV1, and so on, the RV of the 10th time slot is RV2; as shown in Figure 8, it is assumed that the terminal can time slot) for repeated transmission, if there is no canceled time slot in the 4 time slots caused by the UE but not known to the network equipment, the RV of the first time slot is RV0, and the RV of the second time slot The RV of the 4th time slot is RV2, the RV of the 4th time slot is RV1, and the RV of the 8th time slot is RV1; however, if there are cancellations in these 4 time slots caused by the UE but not known to the network
  • FIG. 9 is a schematic diagram of determining an RV based on an available time-domain unit technique provided by an embodiment of the present application.
  • an available time domain unit is an available time slot, and there are 4 available time slots, if none of the 4 available time slots is canceled due to UE but unknown to the network equipment available time slots, the RV of the first available time slot is RV0, the RV of the second available time slot is RV2, the RV of the third available time slot is RV3, and the RV of the fourth available time slot is RV1; if Among the 4 available time slots, there are canceled available time slots caused by the UE but not known by the network device.
  • the network device does not know the canceled available time slots, and the terminal device determines its corresponding RV based on the count of available time slots.
  • the RV of the first actual PUSCH repetition is RV2
  • the RV of the second actual PUSCH repetition The RV is RV3, and the RV of the third actual PUSCH repetition is RV1.
  • the counting results of the available time domain resources by the network device and the terminal device will be consistent, which not only helps to improve decoding performance, but also facilitates repeated transmission.
  • the understanding of the RV version corresponding to each transmission on the network side and the terminal side is consistent, thereby improving communication quality.
  • the first physical channel includes a physical uplink shared channel (Physical Uplink Shared Channel, PUSCH); the method 200 may also include:
  • the first indication information sent by the network device is received, where the first indication information is used for counting available time domain units including canceled available time domain units.
  • the first device is a terminal device, and the terminal device receives the first indication information sent by the network device.
  • the first physical channel includes a physical downlink shared channel (Physical Downlink Shared Channel, PDSCH); the method 200 may also include:
  • the first device is a network device, and the network device sends the first indication information to the terminal device.
  • the first physical channel may also be another physical channel, which is not specifically limited in this application.
  • the sequence numbers of the above-mentioned processes do not mean the order of execution, and the order of execution of the processes should be determined by their functions and internal logic, and should not be used in this application.
  • the implementation of the examples constitutes no limitation.
  • the terms “downlink” and “uplink” are used to indicate the transmission direction of signals or data, wherein “downlink” is used to indicate that the transmission direction of signals or data is from the station to the user equipment in the cell For the first direction, “uplink” is used to indicate that the signal or data transmission direction is the second direction from the user equipment in the cell to the station, for example, “downlink signal” indicates that the signal transmission direction is the first direction.
  • the term "and/or" is only an association relationship describing associated objects, indicating that there may be three relationships. Specifically, A and/or B may mean: A exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" in this article generally indicates that the contextual objects are an "or" relationship.
  • the wireless communication method according to the embodiment of the present application has been described in detail from the perspective of the first device above in conjunction with FIG. 4 to FIG. 9 .
  • the wireless communication method according to the embodiment of the present application will be described below from the perspective of the second device in conjunction with FIG. 10 method.
  • Fig. 10 shows a schematic flowchart of a wireless communication method 300 according to an embodiment of the present application.
  • the method 300 may be executed by a second device, which serves as a receiving end of physical channel repeated transmission, such as the network device or the terminal device shown in FIG. 1 .
  • the method 300 may include:
  • the S330 may include:
  • the plurality of available time domain units includes canceled available time domain units.
  • the canceled available time domain unit includes: the canceled available time domain unit indicated by the network device, and/or the canceled available time domain unit caused by the user equipment UE but not known to the network device time domain unit.
  • the canceled available time domain units caused by the user equipment UE but not known to the network device meet at least one of the following conditions:
  • the transmit power of the available time-domain units is limited
  • the first signal There is a first signal to be sent, the first signal having a higher priority than the physical channel.
  • the first signal includes at least one of the following:
  • Physical uplink control channel PUCCH Physical random access channel PRACH and sounding reference signal SRS.
  • the number of the plurality of available time domain units is greater than or equal to the number of available time domain units that actually receive repetitive data.
  • the S330 may include:
  • the RV of the first available time domain unit is the RV id indicated by the downlink control information DCI used to schedule the PUSCH.
  • the RV applicable to each available time domain unit is determined according to the following table:
  • mod represents a modulo operation
  • the first physical channel includes a physical uplink shared channel PUSCH; the method 300 may also include:
  • the first physical channel includes a physical downlink shared channel PDSCH; the method 300 may further include:
  • the first indication information sent by the network device is received, where the first indication information is used for counting available time domain units including canceled available time domain units.
  • the available time domain unit includes at least one consecutive time slot or at least one consecutive symbol.
  • the available time domain unit is at least one symbol allocated by a time domain resource allocation table TDRA within a time slot, and the at least one symbol is used for uplink transmission.
  • the available time domain unit is at least one continuous symbol, and the at least one continuous symbol is used for uplink transmission.
  • the steps in the method 300 can refer to the corresponding steps in the method 200, for example, the corresponding steps or schemes of determining the position offset factor and/or RV in the method 300 can refer to the corresponding steps or schemes in the method 200, for brevity , which will not be repeated here.
  • Fig. 11 is a schematic block diagram of a first device 400 according to an embodiment of the present application.
  • the first device 400 may include:
  • a determining unit 410 configured to determine the number of repeated transmissions of the first physical channel
  • the processing unit 420 is configured to perform counting based on the multiple available time domain units corresponding to the first physical channel, to obtain the count of each available time domain unit;
  • the sending unit 430 is configured to send repeated data of the first physical channel based on the repeated transmission times and the count of each available time domain unit.
  • the sending unit 430 is specifically configured to:
  • the plurality of available time domain units includes canceled available time domain units.
  • the canceled available time domain unit includes: the canceled available time domain unit indicated by the network device, and/or the canceled available time domain unit caused by the user equipment UE but not known to the network device time domain unit.
  • the canceled available time domain units caused by the user equipment UE but not known to the network device meet at least one of the following conditions:
  • the transmit power of the available time-domain units is limited
  • the first signal There is a first signal to be sent, the first signal having a higher priority than the physical channel.
  • the first signal includes at least one of the following:
  • Physical uplink control channel PUCCH Physical random access channel PRACH and sounding reference signal SRS.
  • the number of the plurality of available time domain units is greater than or equal to the number of available time domain units for actually performing repeated data transmission.
  • the sending unit 430 is specifically configured to:
  • the sending unit 430 is specifically configured to:
  • an RV applicable to each available time domain unit is determined.
  • the RV of the first available time domain unit is the RV id indicated by the downlink control information DCI used to schedule the PUSCH.
  • the sending unit 430 is specifically configured to:
  • mod represents a modulo operation
  • the first physical channel includes a physical uplink shared channel PUSCH; the sending unit 430 is further configured to:
  • the first indication information sent by the network device is received, where the first indication information is used for counting available time domain units including canceled available time domain units.
  • the first physical channel includes a physical downlink shared channel PDSCH; the sending unit 430 is further configured to:
  • the available time domain unit includes at least one consecutive time slot or at least one consecutive symbol.
  • the available time domain unit is at least one symbol allocated by a time domain resource allocation table TDRA within a time slot, and the at least one symbol is used for uplink transmission.
  • the available time domain unit is at least one continuous symbol, and the at least one continuous symbol is used for uplink transmission.
  • the device embodiment and the method embodiment may correspond to each other, and similar descriptions may refer to the method embodiment.
  • the first device 400 shown in FIG. 11 may correspond to the corresponding subject in performing the method 200 of the embodiment of the present application, and the aforementioned and other operations and/or functions of each unit in the first device 400 are for realizing the For the sake of brevity, the corresponding processes in each method in 4 will not be repeated here.
  • Fig. 12 is a schematic block diagram of a second device 500 according to an embodiment of the present application.
  • the second device 500 may include:
  • a determining unit 510 configured to determine the number of repeated transmissions of the first physical channel
  • the processing unit 520 is configured to perform counting based on the multiple available time domain units corresponding to the first physical channel, to obtain the count of each available time domain unit;
  • the receiving unit 530 is configured to receive repeated data of the first physical channel based on the repeated transmission times and the count of each available time domain unit.
  • the receiving unit 530 is specifically configured to:
  • the plurality of available time domain units includes canceled available time domain units.
  • the canceled available time domain unit includes: the canceled available time domain unit indicated by the network device, and/or the canceled available time domain unit caused by the user equipment UE but not known to the network device time domain unit.
  • the canceled available time domain units caused by the user equipment UE but not known to the network device meet at least one of the following conditions:
  • the transmit power of the available time-domain units is limited
  • the first signal There is a first signal to be sent, the first signal having a higher priority than the physical channel.
  • the first signal includes at least one of the following:
  • Physical uplink control channel PUCCH Physical random access channel PRACH and sounding reference signal SRS.
  • the number of the plurality of available time domain units is greater than or equal to the number of available time domain units that actually receive repeated data.
  • the receiving unit 530 is specifically configured to:
  • the receiving unit 530 is specifically configured to:
  • an RV applicable to each available time domain unit is determined.
  • the RV of the first available time domain unit is the RV id indicated by the downlink control information DCI used to schedule the PUSCH.
  • the receiving unit 530 is specifically configured to:
  • mod represents a modulo operation
  • the first physical channel includes a physical uplink shared channel PUSCH; the receiving unit 530 is further configured to:
  • the first physical channel includes a physical downlink shared channel PDSCH; the receiving unit 530 is further configured to:
  • the first indication information sent by the network device is received, where the first indication information is used for counting available time domain units including canceled available time domain units.
  • the available time domain unit includes at least one consecutive time slot or at least one consecutive symbol.
  • the available time domain unit is at least one symbol allocated by a time domain resource allocation table TDRA within a time slot, and the at least one symbol is used for uplink transmission.
  • the available time domain unit is at least one continuous symbol, and the at least one continuous symbol is used for uplink transmission.
  • the device embodiment and the method embodiment may correspond to each other, and similar descriptions may refer to the method embodiment.
  • the second device 500 shown in FIG. 12 may correspond to the corresponding subject in the method 300 of the embodiment of the present application, and the aforementioned and other operations and/or functions of each unit in the second device 500 are for realizing the For the sake of brevity, the corresponding processes in each method in 10 will not be repeated here.
  • the functional modules may be implemented in the form of hardware, may also be implemented by instructions in the form of software, and may also be implemented by a combination of hardware and software modules.
  • each step of the method embodiment in the embodiment of the present application can be completed by an integrated logic circuit of hardware in the processor and/or instructions in the form of software, and the steps of the method disclosed in the embodiment of the present application can be directly embodied as hardware
  • the decoding processor is executed, or the combination of hardware and software modules in the decoding processor is used to complete the execution.
  • the software module may be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, and registers.
  • the storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps in the above method embodiments in combination with its hardware.
  • the determination unit 410, the processing unit 420, the determination unit 510, and the processing unit 520 mentioned above may be implemented by a processor, and the sending unit 430 and the receiving unit 530 mentioned above may be implemented by a transceiver.
  • Fig. 13 is a schematic structural diagram of a communication device 600 according to an embodiment of the present application.
  • the communication device 600 may include a processor 610 .
  • processor 610 may invoke and run a computer program from the memory, so as to implement the method in the embodiment of the present application.
  • the communication device 600 may further include a memory 620 .
  • the memory 620 may be used to store indication information, and may also be used to store codes, instructions, etc. executed by the processor 610 .
  • the processor 610 can invoke and run a computer program from the memory 620, so as to implement the method in the embodiment of the present application.
  • the memory 620 may be an independent device independent of the processor 610 , or may be integrated in the processor 610 .
  • the communication device 600 may further include a transceiver 630 .
  • the processor 610 can control the transceiver 630 to communicate with other devices, specifically, can send information or data to other devices, or receive information or data sent by other devices.
  • Transceiver 630 may include a transmitter and a receiver.
  • the transceiver 630 may further include antennas, and the number of antennas may be one or more.
  • bus system includes not only a data bus, but also a power bus, a control bus, and a status signal bus.
  • the communication device 600 may be the terminal device in the embodiment of the present application, and the communication device 600 may implement the corresponding processes implemented by the terminal device in each method of the embodiment of the present application, that is, the terminal device in the embodiment of the present application
  • the communication device 600 may correspond to the first device 400 in the embodiment of the present application, and may correspond to a corresponding subject in performing the method 200 according to the embodiment of the present application, and details are not described here for brevity.
  • the communication device 600 may be the network device of the embodiment of the present application, and the communication device 600 may implement the corresponding processes implemented by the network device in the various methods of the embodiment of the present application. That is to say, the communication device 600 in the embodiment of the present application may correspond to the second device 500 in the embodiment of the present application, and may correspond to the corresponding subject in executing the method 300 according to the embodiment of the present application. Let me repeat.
  • a chip is also provided in the embodiment of the present application.
  • the chip may be an integrated circuit chip, which has signal processing capabilities, and can implement or execute the methods, steps and logic block diagrams disclosed in the embodiments of the present application.
  • the chip can also be called system-on-chip, system-on-chip, system-on-chip or system-on-chip, etc.
  • the chip can be applied to various communication devices, so that the communication device installed with the chip can execute the methods, steps and logic block diagrams disclosed in the embodiments of the present application.
  • FIG. 14 is a schematic structural diagram of a chip 700 according to an embodiment of the present application.
  • the chip 700 includes a processor 710 .
  • the processor 710 can invoke and run a computer program from the memory, so as to implement the method in the embodiment of the present application.
  • the chip 700 may further include a memory 720 .
  • the processor 710 can invoke and run a computer program from the memory 720, so as to implement the method in the embodiment of the present application.
  • the memory 720 may be used to store indication information, and may also be used to store codes, instructions, etc. executed by the processor 710 .
  • the memory 720 may be an independent device independent of the processor 710 , or may be integrated in the processor 710 .
  • the chip 700 may further include an input interface 730 .
  • the processor 710 can control the input interface 730 to communicate with other devices or chips, specifically, can obtain information or data sent by other devices or chips.
  • the chip 700 may further include an output interface 740 .
  • the processor 710 can control the output interface 740 to communicate with other devices or chips, specifically, can output information or data to other devices or chips.
  • the chip 700 can be applied to the network device in the embodiment of the present application, and the chip can realize the corresponding processes implemented by the first device in the various methods of the embodiments of the present application, and can also realize the various methods of the embodiments of the present application.
  • the corresponding process implemented by the second device in the method will not be repeated here.
  • bus system includes not only a data bus, but also a power bus, a control bus, and a status signal bus.
  • Processors mentioned above may include, but are not limited to:
  • DSP Digital Signal Processor
  • ASIC Application Specific Integrated Circuit
  • FPGA Field Programmable Gate Array
  • the processor may be used to implement or execute the methods, steps and logic block diagrams disclosed in the embodiments of the present application.
  • the steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor.
  • the software module may be located in a mature storage medium in the field such as random access memory, flash memory, read-only memory, programmable read-only memory or erasable programmable memory, register.
  • the storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps of the above method in combination with its hardware.
  • the storage mentioned above includes but is not limited to:
  • non-volatile memory can be read-only memory (Read-Only Memory, ROM), programmable read-only memory (Programmable ROM, PROM), erasable programmable read-only memory (Erasable PROM, EPROM), electronically programmable Erase Programmable Read-Only Memory (Electrically EPROM, EEPROM) or Flash.
  • the volatile memory can be Random Access Memory (RAM), which acts as external cache memory.
  • RAM Static Random Access Memory
  • SRAM Static Random Access Memory
  • DRAM Dynamic Random Access Memory
  • Synchronous Dynamic Random Access Memory Synchronous Dynamic Random Access Memory
  • SDRAM double data rate synchronous dynamic random access memory
  • Double Data Rate SDRAM, DDR SDRAM double data rate synchronous dynamic random access memory
  • Enhanced SDRAM, ESDRAM enhanced synchronous dynamic random access memory
  • SLDRAM synchronous connection dynamic random access memory
  • Direct Rambus RAM Direct Rambus RAM
  • Embodiments of the present application also provide a computer-readable storage medium for storing computer programs.
  • the computer-readable storage medium stores one or more programs, and the one or more programs include instructions that, when executed by a portable electronic device including a plurality of application programs, enable the portable electronic device to perform the method 200 or 300.
  • the computer-readable storage medium may be applied to the first device in the embodiments of the present application, and the computer program causes the computer to execute the corresponding processes implemented by the first device in the methods of the embodiments of the present application. For brevity, I won't repeat them here.
  • the computer-readable storage medium may be applied to the second device in the embodiment of the present application, and the computer program causes the computer to execute the corresponding process implemented by the second device in each method of the embodiment of the present application.
  • the computer program causes the computer to execute the corresponding process implemented by the second device in each method of the embodiment of the present application.
  • the embodiment of the present application also provides a computer program product, including a computer program.
  • the computer program product can be applied to the first device in the embodiment of the present application, and the computer program enables the computer to execute the corresponding process implemented by the first device in each method of the embodiment of the present application.
  • the computer program product can be applied to the second device in the embodiment of the present application, and the computer program enables the computer to execute the corresponding process implemented by the second device in each method of the embodiment of the present application.
  • the computer program product can be applied to the second device in the embodiment of the present application, and the computer program enables the computer to execute the corresponding process implemented by the second device in each method of the embodiment of the present application.
  • the embodiment of the present application also provides a computer program.
  • the computer program When the computer program is executed by the computer, the computer can execute the method in the embodiment shown in method 200 or 300 .
  • the computer program may be applied to the first device in the embodiment of the present application, and when the computer program is run on the computer, the computer executes the corresponding process implemented by the first device in each method of the embodiment of the present application, For the sake of brevity, details are not repeated here.
  • the computer program may be applied to the second device in the embodiment of the present application, and when the computer program is run on the computer, the computer executes the corresponding process implemented by the second device in each method of the embodiment of the present application, For the sake of brevity, details are not repeated here.
  • An embodiment of the present application also provides a communication system, which may include the above-mentioned terminal device and network device to form a communication system 100 as shown in FIG. 1 , which is not repeated here for brevity.
  • a communication system which may include the above-mentioned terminal device and network device to form a communication system 100 as shown in FIG. 1 , which is not repeated here for brevity.
  • system and the like in this document may also be referred to as “network management architecture” or “network system”.
  • the technical solution of the embodiment of the present application is essentially or the part that contributes to the prior art or the part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium , including several instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method described in the embodiment of the present application.
  • the aforementioned storage medium includes: various media capable of storing program codes such as U disk, mobile hard disk, read-only memory, random access memory, magnetic disk or optical disk.
  • the units/modules/components described above as separate/display components may or may not be physically separated, that is, they may be located in one place, or may also be distributed to multiple network units. Part or all of the units/modules/components can be selected according to actual needs to achieve the purpose of the embodiments of the present application.
  • the mutual coupling or direct coupling or communication connection shown or discussed above may be through some interfaces, and the indirect coupling or communication connection of devices or units may be in electrical, mechanical or other forms .

Landscapes

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

Abstract

本申请实施例提供了一种无线通信方法、第一设备和第二设备，所述方法包括：确定第一物理信道的重复传输次数；基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的发送。本申请提供的方法，能够保证网络设备和终端设备对可用时域资源的计数结果会保持一致，进而不仅有利于提升译码性能，还有利于重复传输中网络侧和终端侧对每一次传输对应的RV版本的理解保持一致，进而提升通信质量。

Description

无线通信方法、第一设备和第二设备 技术领域
本申请实施例涉及通信领域，并且更具体地，涉及一种无线通信方法、第一设备和第二设备。
背景技术
截止目前，物理上行共享信道(Physical Uplink Shared Channel，PUSCH)重复传输的重复次数是半静态配置的，当和灵活时隙结构同时使用时，会导致部分时隙(slot)的PUSCH重复被忽略掉(或被取消)。也就是说，在一些配置，尤其是时分双工(Time Division Duplexing，TDD)的情况下，配置的重复次数不能达到理想的覆盖增强效果。
对于物理上行数据信道增强(PUSCH)的方案，通常分为基于Type B的PUSCH重复传输和基于Type A的PUSCH重复传输。针对基于Type A的PUSCH重复传输，终端基于第n次传输时机(n th transmission occasion)确定其对应的冗余版本(redundancy version，RV)，此时如果由于突发情况(例如发送PRACH)，RV0对应的PUSCH传输被取消(cancel)，会导致译码性能恶化。例如，假设一个传输时机为一个时隙，则终端设备在向网络设备发送多个PUSCH重复的过程中，针对该多个PUSCH重复中的某一个PUSCH重复，需要基于用于发送该某一个PUSCH重复的时隙的时域位置，确定其对应的冗余版本(redundancy version，RV)的版本号，如果在用于发送该某一个PUSCH重复的时隙被取消，即其RV对应的PUSCH重复被取消，如果被取消的PUSCH重复为RV0对应的PUSCH重复，会导致译码性能恶化。此外，针对基于Type B的PUSCH重复传输，终端基于实际重复(actual repetition)的次数确定其对应的RV，如果存在被取消的PUSCH重复，其后续实际重复对应的RV会发生变化，但是网络侧并不知道，这将会导致PUSCH重复传输中网络侧和UE对PUSCH对应的RV版本的理解存在不一致的问题。
发明内容
本申请实施例提供了一种无线通信方法、第一设备和第二设备，能够提升译码性能的基础上，在重复传输中网络侧和终端侧对每一次传输对应的RV版本的理解保持一致，进而提升通信质量。
第一方面，本申请提供了一种无线通信方法，包括：
确定第一物理信道的重复传输次数；
基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；
基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的发送。
第二方面，本申请提供了一种无线通信方法，包括：
确定第一物理信道的重复传输次数；
基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；
基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的接收。
第三方面，本申请提供了一种第一设备，用于执行上述第一方面或其各实现方式中的方法。具体地，所述第一设备包括用于执行上述第一方面或其各实现方式中的方法的功能模块。
在一种实现方式中，该第一设备可包括处理单元，该处理单元用于执行与信息处理相关的功能。例如，该处理单元可以为处理器。
在一种实现方式中，该第一设备可包括发送单元和/或接收单元。该发送单元用于执行与发送相关的功能，该接收单元用于执行与接收相关的功能。例如，该发送单元可以为发射机或发射器，该接收单元可以为接收机或接收器。再如，该第一设备为通信芯片，该发送单元可以为该通信芯片的输入电路或者接口，该发送单元可以为该通信芯片的输出电路或者接口。
第四方面，本申请提供了一种第二设备，用于执行上述第二方面或其各实现方式中的方法。具体地，所述第二设备包括用于执行上述第二方面或其各实现方式中的方法的功能模块。
在一种实现方式中，该第二设备可包括处理单元，该处理单元用于执行与信息处理相关的功能。例如，该处理单元可以为处理器。
在一种实现方式中，该第二设备可包括发送单元和/或接收单元。该发送单元用于执行与发送相关的功能，该接收单元用于执行与接收相关的功能。例如，该发送单元可以为发射机或发射器，该接收单元可以为接收机或接收器。再如，该第二设备为通信芯片，该接收单元可以为该通信芯片的输入电路或者接口，该发送单元可以为该通信芯片的输出电路或者接口。
第五方面，本申请提供了一种第一设备，包括处理器和存储器。所述存储器用于存储计算机程序， 所述处理器用于调用并运行所述存储器中存储的计算机程序，以执行上述第一方面或其各实现方式中的方法。
在一种实现方式中，该处理器为一个或多个，该存储器为一个或多个。
在一种实现方式中，该存储器可以与该处理器集成在一起，或者该存储器与处理器分离设置。
在一种实现方式中，该第一设备还包括发射机(发射器)和接收机(接收器)。
第六方面，本申请提供了一种第二设备，包括处理器和存储器。所述存储器用于存储计算机程序，所述处理器用于调用并运行所述存储器中存储的计算机程序，以执行上述第二方面或其各实现方式中的方法。
在一种实现方式中，该处理器为一个或多个，该存储器为一个或多个。
在一种实现方式中，该存储器可以与该处理器集成在一起，或者该存储器与处理器分离设置。
在一种实现方式中，该第二设备还包括发射机(发射器)和接收机(接收器)。
第七方面，本申请提供了一种芯片，用于实现上述第一方面至第二方面中的任一方面或其各实现方式中的方法。具体地，所述芯片包括：处理器，用于从存储器中调用并运行计算机程序，使得安装有所述芯片的设备执行如上述第一方面至第二方面中的任一方面或其各实现方式中的方法。
第八方面，本申请提供了一种计算机可读存储介质，用于存储计算机程序，所述计算机程序使得计算机执行上述第一方面至第二方面中的任一方面或其各实现方式中的方法。
第九方面，本申请提供了一种计算机程序产品，包括计算机程序指令，所述计算机程序指令使得计算机执行上述第一方面至第二方面中的任一方面或其各实现方式中的方法。
第十方面，本申请提供了一种计算机程序，当其在计算机上运行时，使得计算机执行上述第一方面至第二方面中的任一方面或其各实现方式中的方法。
基于以上技术方案，在第一物理信道的重复传输中，基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；然后基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的发送；相当于，不管可用时域单元是否被取消，均对其进行计数，基于此，网络设备和终端设备对可用时域资源的计数结果会保持一致，进而不仅有利于提升译码性能，还有利于重复传输中网络侧和终端侧对每一次传输对应的RV版本的理解保持一致，进而提升通信质量。
附图说明
图1是本申请实施例提供的系统框架的示例。
图2是本申请实施例提供的时隙聚合PUSCH重复传输的示意图。
图3是本申请实施例提供的基于Type B的PUSCH重复传输的时域资源示意图。
图4是本申请实施例提供的无线通信方法的示意性流程图。
图5是本申请实施例提供的基于实际PUSCH重复进行重复传输计数的示意图。
图6是本申请实施例提供的基于可用时域单元进行重复传输计数的示意图。
图7是本申请实施例提供的基于实际PUSCH重复的计数确定RV的示意图。
图8是本申请实施例提供的传输时机确定RV的示意图。
图9是本申请实施例提供的基于可用时域单元的技术确定RV的示意图。
图10是本申请实施例提供的无线通信方法的另一示意性流程图。
图11是本申请实施例提供的第一设备的示意性框图。
图12是本申请实施例提供的第二设备的示意性框图。
图13是本申请实施例提供的通信设备的示意性框图。
图14是本申请实施例提供的芯片的示意性框图。
具体实施方式
下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行描述，显然，所描述的实施例是本申请一部分实施例，而不是全部的实施例。基于本申请中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本申请保护的范围。
图1是本申请实施例的一个系统框架的示意图。
如图1所示，通信系统100可以包括终端设备110和网络设备120。网络设备120可以通过空口与终端设备110通信。终端设备110和网络设备120之间支持多业务传输。
应理解，本申请实施例仅以通信系统100进行示例性说明，但本申请实施例不限定于此。也就是说，本申请实施例的技术方案可以应用于各种通信系统，例如：长期演进(Long Term Evolution，LTE)系统、LTE时分双工(Time Division Duplex，TDD)、通用移动通信系统(Universal Mobile  Telecommunication System，UMTS)、物联网(Internet of Things，IoT)系统、窄带物联网(Narrow Band Internet of Things，NB-IoT)系统、增强的机器类型通信(enhanced Machine-Type Communications，eMTC)系统、5G通信系统(也称为新无线(New Radio，NR)通信系统)，或未来的通信系统等。
在图1所示的通信系统100中，网络设备120可以是与终端设备110通信的接入网设备。接入网设备可以为特定的地理区域提供通信覆盖，并且可以与位于该覆盖区域内的终端设备110(例如UE)进行通信。
网络设备120可以是长期演进(Long Term Evolution，LTE)系统中的演进型基站(Evolutional Node B，eNB或eNodeB)，或者是下一代无线接入网(Next Generation Radio Access Network，NG RAN)设备，或者是NR系统中的基站(gNB)，或者是云无线接入网络(Cloud Radio Access Network，CRAN)中的无线控制器，或者该网络设备120可以为中继站、接入点、车载设备、可穿戴设备、集线器、交换机、网桥、路由器，或者未来演进的公共陆地移动网络(Public Land Mobile Network，PLMN)中的网络设备等。
终端设备110可以是任意终端设备，其包括但不限于与网络设备120或其它终端设备采用有线或者无线连接的终端设备。
例如，所述终端设备110可以指接入终端、用户设备(User Equipment，UE)、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置。接入终端可以是蜂窝电话、无绳电话、会话启动协议(Session Initiation Protocol，SIP)电话、IoT设备、卫星手持终端、无线本地环路(Wireless Local Loop，WLL)站、个人数字处理(Personal Digital Assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备、5G网络中的终端设备或者未来演进网络中的终端设备等。
终端设备110可以用于设备到设备(Device to Device，D2D)的通信。
无线通信系统100还可以包括与基站进行通信的核心网设备130，该核心网设备130可以是5G核心网(5G Core，5GC)设备，例如，接入与移动性管理功能(Access and Mobility Management Function，AMF)，又例如，认证服务器功能(Authentication Server Function，AUSF)，又例如，用户面功能(User Plane Function，UPF)，又例如，会话管理功能(Session Management Function，SMF)。可选地，核心网络设备130也可以是LTE网络的分组核心演进(Evolved Packet Core，EPC)设备，例如，会话管理功能+核心网络的数据网关(Session Management Function+Core Packet Gateway，SMF+PGW-C)设备。应理解，SMF+PGW-C可以同时实现SMF和PGW-C所能实现的功能。在网络演进过程中，上述核心网设备也有可能叫其它名字，或者通过对核心网的功能进行划分形成新的网络实体，对此本申请实施例不做限制。
通信系统100中的各个功能单元之间还可以通过下一代网络(next generation，NG)接口建立连接实现通信。
例如，终端设备通过NR接口与接入网设备建立空口连接，用于传输用户面数据和控制面信令；终端设备可以通过NG接口1(简称N1)与AMF建立控制面信令连接；接入网设备例如下一代无线接入基站(gNB)，可以通过NG接口3(简称N3)与UPF建立用户面数据连接；接入网设备可以通过NG接口2(简称N2)与AMF建立控制面信令连接；UPF可以通过NG接口4(简称N4)与SMF建立控制面信令连接；UPF可以通过NG接口6(简称N6)与数据网络交互用户面数据；AMF可以通过NG接口11(简称N11)与SMF建立控制面信令连接；SMF可以通过NG接口7(简称N7)与PCF建立控制面信令连接。
图1示例性地示出了一个基站、一个核心网设备和两个终端设备，可选地，该无线通信系统100可以包括多个基站设备并且每个基站的覆盖范围内可以包括其它数量的终端设备，本申请实施例对此不做限定。
应理解，本申请实施例中网络/系统中具有通信功能的设备均可称为通信设备。以图1示出的通信系统100为例，通信设备可包括具有通信功能的网络设备120和终端设备110，网络设备120和终端设备110可以为上文所述的设备，此处不再赘述；通信设备还可包括通信系统100中的其他设备，例如网络控制器、移动管理实体等其他网络实体，本申请实施例中对此不做限定。
应理解，本文中术语“系统”和“网络”在本文中常被可互换使用。本文中术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。
为了增强上行传输的可靠性，NR R15引入了时隙聚合PUSCH重复传输。时隙聚合PUSCH重复传输是指同一个传输块采用不同的冗余版本重复传输K次。基站通过高层参数，即PUSCH聚合因子 (pusch-AggregationFactor)，为终端配置重复次数K，终端在K个连续的时隙上重复发送相同传输块，且每个时隙中承载该传输块的PUSCH副本在时域上占用相同的符号。第一个PUSCH副本的冗余版本(RV)是由上行授权信令指示的，其余PUSCH副本的RV是以{0,2,3,1}为顺序循环的。下面结合表1对RV的的传输情况进行说明。
表1
Figure PCTCN2021093465-appb-000001
如表1所示，终端可通过循环缓存对传输块实现速率匹配。即，终端可将编码比特存储在循环缓存中，每次传输时根据冗余版本从循环缓存中顺序读取，实现速率匹配。换言之，对于每次传输，速率匹配的读取位置由冗余版本rv决定，或者说，RV版本可用于指示从这个缓冲区的哪个位置来提取数据。作为示例，假设循环缓存中预先设置有4个RV，分别为RV 0、RV 1、RV 2和RV 3。这4个RV的选取顺序为[0，2，3，1]，即经第一次传输以RV 0为起始位置，第二次传输以RV 2为起始位置，第三次传输以RV 3为起始位置，第四次传输以RV 1为起始位置，其中，第一次传输是指数据的首次传输，第二、三、四次传输均为数据的重传。0、2、3、1是LTE/NR传输数据时RV典型的选取顺序，其中，0、2、3、1分别为第一个RV(即RV 0)对应的取值、第三个RV(即RV 2)对应的取值、第四个RV(即RV 3)对应的取值和第二个RV(即RV 1)对应的取值。
如果一个时隙中的PUSCH副本对应的时域资源中至少有一个半静态下行符号，那么这个时隙中的PUSCH不发送。
图2是本申请实施例提供的时隙聚合PUSCH重复传输的示意图。
如图2所示，基站配置终端将传输块重复发送4次，PUSCH副本在每个时隙中占用的都是#0～#11符号。但是，由于时隙#1和时隙#2的#0～#2符号是半静态下行符号，因此，在时隙#1上待发送的第2个PUSCH重复和时隙#2上待发送的第3个PUSCH重复会被丢弃而不进行发送。
对于上行免授权调度的时隙聚合PUSCH重复，传输块的重复次数由高层参数RepK配置。
对于物理上行数据信道增强(PUSCH)的方案，分为基于Type B的PUSCH重复传输和基于Type A的PUSCH重复传输。
其中，针对基于Type B的PUSCH重复传输，基站发送一个上行授权或者一个免授权指示一个或多个名义PUSCH重复传输。终端在一个时隙中传输一个或多个实际PUSCH副本，或者在连续多个可用的时隙中传输两个或多个实际PUSCH副本。基站在时域资源分配表(Time Domain Resource Allocation，TDRA)中增加一列，用于指示B类PUSCH重复传输的副本个数numberofrepetition，其取值可以为{1，2，3，4，7，8，12，16}。上行调度信令或者第一类免授权配置信息指示第一个名义PUSCH的起始符号S和持续时间L，每一个名义PUSCH副本的持续时间L相同，其中，0≤S≤13，1≤L≤14，高层信令各用4bit分别指示S和L，可以实现S+L>14。名义和实际PUSCH副本的传输块大小(TBS)根据名义PUSCH的时域长度L确定。从第二个名义PUSCH开始，名义PUSCH副本的起始符号是上一个名义PUSCH副本的终止符号的下一个符号。
终端在确定实际PUSCH副本的时域资源之前，需要确定无效符号，其余的符号可以认为是潜在有效符号。如果一个名义PUSCH副本在时隙内连续潜在有效符号的个数大于0，则可以映射一个实际PUSCH副本，一个名义PUSCH副本的时域资源可包含一个或多个实际PUSCH副本的时域资源。终端不发送单个符号的实际PUSCH副本，除非单个符号是基站指示的名义PUSCH的持续时间L。
图3是本申请实施例提供的基于Type B的PUSCH重复传输的时域资源示意图。
如图3所示，基站发送一个上行授权或者一个免授权指示4个名义PUSCH重复传输，每一个名义PUSCH副本的持续时间L等于4。第1个名义PUSCH副本的时域资源可包含2个实际PUSCH副本(即第1个实际PUSCH和第2个实际PUSCH)的时域资源，第2个名义PUSCH副本的时域资源可包含1个实际PUSCH副本(即第3个实际PUSCH)的时域资源，第3个名义PUSCH副本的时域资源可包含2个实际PUSCH副本(即第4个实际PUSCH和第5个实际PUSCH)的时域资源，第4个名义PUSCH副本的时域资源可包含2个实际PUSCH副本的时域资源；但是，由于位置靠前的实际PUSCH副本的时域资源为一个符号，不发送该实际PUSCH副本，即仅发送位置靠后的实际PUSCH副本(即第6个实际PUSCH)。
在一些实现方式中，终端可按照以下方式中的至少一项确定无效符号：
方式1：
高层参数tdd-UL-DL-ConfigurationCommon或tdd-UL-DL-Configuration Dedicated半静态配置的下行符号是一种无效符号。
方式2：
高层参数InvalidSymbolPattern配置符号级位图(Bitmap)，比特值为1表示相应的符号为无效符号。当DCI格式0_1或者0_2调度PUSCH重复，或者激活第二类免授权PUSCH重复，而且DCI中配置了1Bit的无效符号图样指示信息域，当无效符号图样指示信息域为1时，终端应用无效符号图样，否则终端忽略无效符号图样。如果DCI中不包含无效符号图样指示信息域，终端直接按照高层参数InvalidSymbolPattern的配置应用无效符号图样。不同的DCI格式独立配置无效符号图样指示信息域。
对于基于Type A的PUSCH重复传输，基站可以在高层信令配置的时域资源分配表格中增加一列numberofrepetitions，用于指示A类PUSCH重复传输次数K。如果没有配置numberofrepetitions，重复次数K由高层参数pusch-AggregationFactor确定。如果前述两个参数都没有配置，重复次数K＝1。基于Type A的PUSCH重复传输是用户在连续的K个时隙上发送同一个传输块(TB)，且在K个时隙中占据的符号位置完全相同(起始符号位置与占据符号长度均相同)。与HARQ相似的地方在于，二者都可以看做是信息的重传；其不同点在于，HARQ需要收到NACK才会触发重传，而PUSCH重复配置结束以后可以直接进行K次重传。第一次传输的版本号可根据下行控制信息(Downlink Control Information，DCI)域(field)中的指示信息确定，所述指示信息可占据两个比特位，之后的RV版本号按照0，2，3，1循环。比如，当DCI指示第一次传输的版本号为2，则后面的版本号依次为3，1，0,2,…。
针对免授权PUSCH重复，当高层参数PUSCHRepTypeIndicatorForType1Configuredgrant配置为pusch-RepTypeB，表明为B类PUSCH重复，否则为A类PUSCH重复。如果时域资源分配表格中有numberofrepetitions，PUSCH的名义重复传输次数由TDRA表格中的一行确定，否则重复次数由高层参数repK确定。
通过内容可知，物理上行共享信道(Physical Uplink Shared Channel，PUSCH)重复传输的重复次数是半静态配置的，当和灵活时隙结构同时使用时，会导致部分时隙(slot)的重复被忽略掉。因此，在一些配置，尤其是TDD的情况下，配置的重复次数不能达到理想的覆盖增强效果。
此外，在第三代合作伙伴计划(The 3rd Generation Partnership Project，3GPP)第17版本(R17)中，考虑在PUSCH的重复传输中将引入基于多时隙的传输块过程(TB processing over multi-slot，TBoMS)，即基于多个时隙确定传输块大小(Transport Block Size，TBS)的大小，或者说，将一个传输块(Transport Block，TB)在多个时隙上进行传输。然而，针对R15/R16的速率匹配机制，基于Type A的PUSCH重复传输(repetition type A)是在每一个时隙上基于冗余版本(redundancy version，RV)进行速率匹配处理的，如果按照R15/R16的速率匹配机制对TboMS中的传输块进行速率匹配，每一个时隙上基于一个RV进行速率匹配时，由于TBS是针对多个时隙确定的，有可能会丢失RV0和/或RV1对应的系统位，使的译码性能下降。例如，当一个时隙上可用于上行传输的符号不足以传输一个RV对应的比特序列时，可能会丢失RV0和/或RV1对应的系统位，使的译码性能下降。
基于此，本申请实施例提供了一种无线通信方法、终端设备和网络设备，不仅能够实现对TboMS中的传输块的速率匹配，还能够避免丢失RV0和/或RV1对应的系统位，以提升对速率匹配后的序列的译码性能。
为例便于理解本申请提供的方案，下面对LDPC码的编码流程进行简单说明。
在LDPC码的编码流程中，物理层在接收到媒体接入控制层(MAC)的一个传输块之后，先给它添加一个(16或24比特)的循环冗余校验(Cyclic Redundancy Check，CRC)。在添加CRC之后，如果它包含的比特数超过一定值，则需要把它分成长度相同的两个或多个码块；各个码块再各自添加CRC；然后，各个加了CRC的码块独立地进行LDPC编码；再然后，各个编码后的码块分别进行速率匹配、混合自动重传请求(HARQ)处理和交织。其中，CRC是一种根据网络数据包或计算机文件等数据产生简短固定位数校验码的一种信道编码技术，主要用来检测或校验数据传输或者保存后可能出现的错误。它是利用除法及余数的原理来作错误侦测的。具体地，CRC通过在要传输的k比特数据D后添加(n-k)比特冗余位，即帧检验序列(Frame Check Sequence，FCS)，以形成n比特的传输帧T。速率匹配(Rate matching)是指传输信道上的比特被重发(repeated)、零填充或者被打孔(punctured)，以匹配物理信道的承载能力，信道映射时达到传输格式所要求的比特速率。在速率匹配中，如果输入比特数少于输出比特数，那就是用重发或者零比特填充；如果输入比特数多于输出比特数，那就是用打孔。打孔就是依照一定的图样(pattern)把一些比特打掉，即从比特序列中移除或打掉，同时将后面的比特依次前移一位。重复就是在当前比特和后面的比特之间插入一次当前比特。零比特填充是在 当前比特和后面的比特之间插入零比特。解速率匹配算法与之相反，恢复被打掉的比特，或者打掉重复/零填充的比特。
在速率匹配过程中，可将经过编码的比特序列用d 0,d 1,d 2,...d N-1(N为编码之后的序列长度)来表示，该序列会输入到一个长度为N cb的循环缓存区中。用E r表示第r个码块经过速率匹配后的输出序列的长度。
在一种实现方式中，E r的确定过程可通过以下代码实现：
Figure PCTCN2021093465-appb-000002
其中，N L是传输块要映射的传输层数；Q m是调制阶数；G是传输块用于传输的编码后比特的总数目；如果在调度传输块的DCI中没有出现CBGTI，则C′＝C，如果在调度传输块的DCI中出现了CBGTI，则C′是调度传输块的码块的个数。
传输的冗余版本号可表示为rv id，(rv id＝0,1,2,or 3)，速率匹配后的输出序列用e k表示，k＝0,1,2,…,E-1。速率匹配后的输出序列中的第一个比特k 0与rv id和低密度奇偶校验码(Low Density Parity Check Code，LDPC)的基图(Base Graph，BG)有关。其中，BG是整个LDPC码设计的核心。每个TB码块需要通过LDPC基图1(LDPC base graph 1)或者LDPC基图2(LDPC base graph 2)编码。下面结合表2对LDPC基图和rv id的关系进行说明。
表2
Figure PCTCN2021093465-appb-000003
如图2所示，针对标识为0的RV，其对应的LDPC基图1和LDPC基图2均为0，针对标识为1、2或3的RV，其均可对应有一个LDPC基图1和一个LDPC基图2。
在一种实现方式中，经由速率匹配后输出的序列e k的可通过以下代码实现：
Figure PCTCN2021093465-appb-000004
Figure PCTCN2021093465-appb-000005
对速率匹配得到的编码比特进行交织后再调制，即比特交织编码调制，其用于保证LDPC码在高阶调制和衰落信道下的性能稳定性。经过比特选择得到的比特序列为e 0,e 1,e 2,...,e E-1，该比特序列需要进行交织，交织之后得到序列f 0,f 1,f 2,...,f E-1。
在一种实现方式中，可通过以下代码实现比特交织：
Figure PCTCN2021093465-appb-000006
下面结合表2对PUSCH重复传输过程中RV版本的具体确定方式进行说明。
表2
Figure PCTCN2021093465-appb-000007
如表2所示，针对基于Type A的PUSCH重复传输，终端基于第n次传输时机(n th transmission occasion)确定其对应的冗余版本(redundancy version，RV)，针对基于Type B的PUSCH重复传输，终端基于实际重复(actual repetition)的次数确定其对应的RV。
针对基于Type A的PUSCH重复传输，由于终端基于第n次传输时机(n th transmission occasion)确定其对应的冗余版本(redundancy version，RV)，此时如果由于突发情况(例如发送PRACH)，RV0对应的PUSCH传输被取消(cancel)，会导致译码性能恶化。例如，假设一个传输时机为一个时隙，则终端设备在向网络设备发送多个PUSCH重复的过程中，针对该多个PUSCH重复中的某一个PUSCH重复，需要基于用于发送该某一个PUSCH重复的时隙的时域位置，确定其对应的冗余版本(redundancy version，RV)的版本号，如果在用于发送该某一个PUSCH重复的时隙被取消，即其RV对应的PUSCH重复被取消，如果被取消的PUSCH重复为RV0对应的PUSCH重复，会导致译码性能恶化。
针对基于Type B的PUSCH重复传输，由于终端基于实际重复(actual repetition)的次数确定其对应的RV，如果存在被取消的PUSCH重复，其后续实际重复对应的RV会发生变化，但是网络侧并不知道，这将会导致PUSCH重复传输中网络侧和UE对PUSCH对应的RV版本的理解存在不一致的问题。
基于此，本申请实施例提供了一种无线通信方法、第一设备和第二设备，能够提升译码性能的基础上，在重复传输中网络侧和终端侧对每一次传输对应的RV版本的理解保持一致，进而提升通信质量。下面对本申请提供的无线通信方法进行说明。
图4示出了根据本申请实施例的无线通信方法200的示意性流程图，所述方法200可以由第一设备执行。该第一设备可以是物理信道重复传输的发送端，例如图1所示的终端设备或网络设备。
如图4所示，所述方法200可包括：
S210，确定第一物理信道的重复传输次数；
S220，基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；
S230，基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的发送。
基于以上技术方案，在第一物理信道的重复传输中，基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；然后基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的发送；相当于，不管可用时域单元是否被取消，均对其进行计数，基于此，网络设备和终端设备对可用时域资源的计数结果会保持一致，进而不仅有利于提升译码性能，还有利于重复传输中网络侧和终端侧对每一次传输对应的RV版本的理解保持一致，进而提升通信质量。
在一些实施例中，所述可用时域单元包括至少一个连续的时隙或至少一个连续的符号。
在一些实施例中，所述可用时域单元为一个时隙内时域资源分配表(Time Domain Resource Allocation，TDRA)分配的至少一个符号，所述至少一个符号均用于上行传输。在一种实现方式中，针对基于Type A的PUSCH重复传输，所述可用时域单元为一个时隙内时域资源分配表TDRA分配的至少一个符号，所述至少一个符号均用于上行传输。换言之，针对一个时隙而言，所述可用时域单元为这个时隙内由TDRA分配的符号，且由TDRA分配的符号均为上行符号，此时，这些上行符号可以为所述可用时域单元；反之，如果一个时隙(slot)内TDRA分配的符号至少有一个不是上行(UL)传输的符号，则认为该时隙为不可用时隙(unavailable slot)。可对于不可用时隙，在物理信道重复传输中，不进行重复次数的计数。
在一些实施例中，所述可用时域单元为至少一个连续的符号，所述至少一个连续的符号均用于上行传输。在一种实现方式中，针对基于Type B的PUSCH重复传输，所述可用时域单元为至少一个连续的符号，所述至少一个连续的符号均用于上行传输。换言之，终端在确定可用时域单元之前，需要确定无效符号，其余的符号可以认为是潜在有效符号；如果一个时隙内连续潜在有效符号的个数大于0，这些有效的符号可作为一个可用时域单元。进一步的，如果一个时隙内连续潜在有效符号的个数大于1，则这些有效的符号可作为一个可用时域单元。
在一些实施例中，所述S230可包括：
在所述计数的初始值为1，且所述每一个可用时域单元的计数小于或等于所述重复传输次数的情况下，进行所述第一物理信道的重复数据的发送，否则，终止所述第一物理信道的重复数据的发送；或者
在所述计数的初始值为0，且所述每一个可用时域单元的计数小于或等于所述重复传输次数与1的差值的情况下，进行所述第一物理信道的重复数据的发送，否则，终止所述第一物理信道的重复数据的发送。
在一些实现方式中，所述多个可用时域单元包括被取消的可用时域单元。可选的，所述被取消的可用时域单元包括：网络设备指示的被取消的可用时域单元，和/或由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元。可选的，所述由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元满足以下条件中的至少一项：可用时域单元的发射功率受限；存在待发送的第一信号，所述第一信号的优先级高于所述物理信道的优先级。可选的，所述第一信号包括以下中的至少一项：物理上行控制信道PUCCH、物理随机接入信道PRACH以及探测参考信号SRS。
作为本申请的一个示例，对于带有两个上行载波的单小区操作或带有载波聚合的操作，如果在可用时域单元i中，一个频率范围内的服务小区上的PUSCH或PUCCH或PRACH或SRS传输的总UE发送功率超过某个阈值，终端可以根据以下优先级顺序(降序)向PUSCH/PUCCH/PRACH/SRS传输分配功率，使得在可用时域单元i的每个符号中，用于在频率范围内的服务小区上的传输的总传输功率小于或等于该频率范围的阈值。其中，PRACH有着更高的优先级，因此在PUSCH重复传输过程中，如果UE临时需要在用于传输PUSCH的可用时域单元上传输PRACH，由于功率受限的原因，该次PUSCH的重复传输需要被取消。这种由UE原因导致PUSCH被取消的特殊情况，网络侧并不知道。可选的，当确定在可用时域单元i中的频率范围内的服务小区的总发射功率时，其不包括在可用时域单元i之后开始发送的功率。可用时域单元中的每个符号的总UE发射功率可以为：符号中PUSCH、PUCCH、PRACH和SRS的UE发射功率的线性值之和。
在一些实施例中，所述多个可用时域单元的数量大于或等于实际进行重复数据的发送的可用时域单元的数量。
图5是本申请实施例提供的基于实际PUSCH重复进行重复传输计数的示意图。
如图5所示，假设在PUSCH重复传输过程中，如果UE临时需要在用于传输PUSCH的可用时域单元上传输PRACH，由于PRACH有着更高的优先级，考虑到功率受限的原因，该次PUSCH的重复传输需要被取消。这种由UE原因导致PUSCH被取消的特殊情况，网络侧并不知道。为了保证PUSCH实际的重复传输次数可以达到网络配置的重复次数，则UE可以推迟PUSCH重复的发送，这种情况下UE推迟发送的PUSCH重复，且基于实际PUSCH重复进行重复传输计数，以此来保证实 际重复传输的次数可以达到网络配置的重复传输次数，进而实现更好的覆盖性能，但是同样会导致网络侧由于和UE对重复次数理解不一致，进而导致网络设备不能正确接收。
图6是本申请实施例提供的基于可用时域单元进行重复传输计数的示意图。
如图6所示，对于UE引起而网络侧不可知的被取消的PUSCH重复，仍需要进行重复次数的计数，即基于可用时域单元进行重复传输计数，此时USCH重复的传输次数小于网络配置的重复传输次数。换言之，重复传输计数是基于所有的可用时域单元进行计数的(包含UE导致而网络侧不知道的潜在被取消的可用时域单元)，由此，能够避免由于潜在被取消的可用时域单元带来的网络侧和UE对重复次数和重复传输使用的可用时域单元的理解不一致的问题。
通过对比图5和图6可见，本申请提供的重复传输次数的计数方式，能够保证网络设备和终端设备对可用时域资源的计数结果会保持一致，进而不仅有利于提升译码性能，还有利于重复传输中网络侧和终端侧对每一次传输对应的RV版本的理解保持一致，进而提升通信质量。
在一些实施例中，所述S230可包括：
基于所述每一个可用时域单元的计数，确定适用于所述每一个可用时域单元的冗余版本RV；
基于所述重复传输次数和适用于所述每一个可用时域单元的RV，进行所述第一物理信道的重复数据的发送。
简言之，第一设备基于所述多个可用时域单元进行重复次数的计数，记为n th，然后基于第n次可用时域单元(n th可用时域单元)来计算RV版本。
在一些实现方式中，基于适用于所述多个可用时域单元中的第一个可用时域单元的RV和所述每一个可用时域单元的计数，按照RV标识为0，2，3，1，的顺序循环的方式，确定适用于所述每一个可用时域单元的RV。
在一些实现方式中，所述第一个可用时域单元的RV为用于调度PUSCH的下行控制信息DCI指示的RV id。
在一些实现方式中，按照以下表格确定适用于所述每一个可用时域单元的RV：
Figure PCTCN2021093465-appb-000008
其中，mod表示取模运算。
下面结合图7至图8，对重复传输次数的不同计数方式对确定的RV产生的影响进行说明。
图7是本申请实施例提供的基于实际PUSCH重复的计数确定RV的示意图。
如图7所示，如果基于实际PUSCH重复进行重复传输次数的计数，则进一步需要基于实际PUSCH重复的计数确定其相应的RV。假设一个实际PUSCH重复的时域资源为一个时隙，如图7所示，存在4个实际PUSCH重复，如果这4个实际PUSCH重复中没有由于UE原因导致的但是网络设备并不知道的被取消的实际PUSCH重复，则第1个实际PUSCH重复的RV为RV0，第2个实际PUSCH重复的RV为RV2，第3个实际PUSCH重复的RV为RV3，第4个实际PUSCH重复的RV为RV1；但是，如果这4个实际PUSCH重复中存在由于UE原因导致的但是网络设备并不知道的被取消的实际PUSCH重复，例如，假设这4个实际PUSCH重复中的第1个实际PUSCH重复是由于UE原因导致的但是网络设备并不知道的被取消的实际PUSCH重复，则第1个实际PUSCH重复向后推迟，终端设备基于实际PUSCH重复的计数确定其相应的RV，此时，第1个实际PUSCH重复的RV为RV0，但网络设备会认为第1个实际PUSCH重复的RV为RV2，第2，3，4个实际PUSCH重复与第一个第1个实际PUSCH重复，即存在网络侧与UE对RV理解不一致问题。
图8是本申请实施例提供的传输时机确定RV的示意图。
如图8所示，如果基于传输时机进行重复传输次数的计数，则进一步需要基于传输时机的计数确定其相应的RV。假设一个传输时机为一个时隙，如图8所示，存在10个时隙，第1个时隙的RV为RV0，第2个时隙的RV为RV2，第3个时隙的RV为RV3，第4个时隙的RV为RV1，以此类推，第10个时隙的RV为RV2；如图8所示，假设终端可在4个时隙(即第1，2，4，8个时隙)上进行重复传输，如果这4个时隙中没有由于UE原因导致的但是网络设备并不知道的被取消的时隙，则第1个时隙的RV为RV0，第2个时隙的RV为RV2，第4个时隙的RV为RV1，第8个时隙的RV为RV1；但是，如果这4个时隙中存在由于UE原因导致的但是网络设备并不知道的被取消的时隙，例如，假设这4个时隙中的第1个时隙是由于UE原因导致的但是网络设备并不知道的被取消的时隙， 则发送第2，3，4个可用时隙的RV，这种情况下，对于部分帧结构可能会导致实际传输时没有能够自解码的RV版本，会导致译码性能恶化。
图9是本申请实施例提供的基于可用时域单元的技术确定RV的示意图。
如图9所示，如果基于可用时域单元进行重复传输次数的计数，则进一步需要基于可用时域单元的计数确定其相应的RV。如图9所示，假设一个可用时域单元为一个可用时隙，且存在4个可用时隙，如果这4个可用时隙中没有由于UE原因导致的但是网络设备并不知道的被取消的可用时隙，则第1个可用时隙的RV为RV0，第2个可用时隙的RV为RV2，第3个可用时隙的RV为RV3，第4个可用时隙的RV为RV1；如果这4个可用时隙中存在由于UE原因导致的但是网络设备并不知道的被取消的可用时隙，例如，假设这4个可用时隙中的第1个可用时隙是由于UE原因导致的但是网络设备并不知道的被取消的可用时隙，则终端设备基于可用时隙的计数确定其相应的RV，此时，第1个实际PUSCH重复的RV为RV2，第2个实际PUSCH重复的RV为RV3，第3个实际PUSCH重复的RV为RV1，基于此，网络设备和终端设备对可用时域资源的计数结果会保持一致，进而不仅有利于提升译码性能，还有利于重复传输中网络侧和终端侧对每一次传输对应的RV版本的理解保持一致，进而提升通信质量。
在一些实施例中，所述第一物理信道包括物理上行共享信道(Physical Uplink Shared Channel，PUSCH)；所述方法200还可包括：
接收网络设备发送的第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
换言之，第一设备为终端设备，所述终端设备接收网络设备发送的所述第一指示信息。
在一些实施例中，所述第一物理信道包括物理下行共享信道(Physical Downlink Shared Channel，PDSCH)；所述方法200还可包括：
向终端设备发送第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
换言之，所述第一设备为网络设备，所述网络设备向所述终端设备发送所述第一指示信息。
当然，所述第一物理信道也可以是其他物理信道，本申请对此不作具体限定。
以上结合附图详细描述了本申请的优选实施方式，但是，本申请并不限于上述实施方式中的具体细节，在本申请的技术构思范围内，可以对本申请的技术方案进行多种简单变型，这些简单变型均属于本申请的保护范围。例如，在上述具体实施方式中所描述的各个具体技术特征，在不矛盾的情况下，可以通过任何合适的方式进行组合，为了避免不必要的重复，本申请对各种可能的组合方式不再另行说明。又例如，本申请的各种不同的实施方式之间也可以进行任意组合，只要其不违背本申请的思想，其同样应当视为本申请所公开的内容。
还应理解，在本申请的各种方法实施例中，上述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请实施例的实施过程构成任何限定。此外，在本申请实施例中，术语“下行”和“上行”用于表示信号或数据的传输方向，其中，“下行”用于表示信号或数据的传输方向为从站点发送至小区的用户设备的第一方向，“上行”用于表示信号或数据的传输方向为从小区的用户设备发送至站点的第二方向，例如，“下行信号”表示该信号的传输方向为第一方向。另外，本申请实施例中，术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系。具体地，A和/或B可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。
上文中结合图4至图9，从第一设备的角度详细描述了根据本申请实施例提供的无线通信方法，下面将结合图10，从第二设备的角度描述根据本申请实施例的无线通信方法。
图10示出了根据本申请实施例的无线通信方法300的示意性流程图。所述方法300可以由第二设备执行，该第二设备作为物理信道重复传输的接收端，例如图1所示的网络设备或终端设备。
如图10所示，所述方法300可包括：
S310，确定第一物理信道的重复传输次数；
S320，基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；
S330，基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的接收。
在一些实施例中，所述S330可包括：
在所述计数的初始值为1，且所述每一个可用时域单元的计数小于或等于所述重复传输次数的情况下，进行所述第一物理信道的重复数据的接收，否则，终止所述第一物理信道的重复数据的接收； 或者
在所述计数的初始值为0，且所述每一个可用时域单元的计数小于或等于所述重复传输次数与1的差值的情况下，进行所述第一物理信道的重复数据的接收，否则，终止所述第一物理信道的重复数据的接收。
在一些实施例中，所述多个可用时域单元包括被取消的可用时域单元。
在一些实施例中，所述被取消的可用时域单元包括：网络设备指示的被取消的可用时域单元，和/或由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元。
在一些实施例中，所述由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元满足以下条件中的至少一项：
可用时域单元的发射功率受限；
存在待发送的第一信号，所述第一信号的优先级高于所述物理信道的优先级。
在一些实施例中，所述第一信号包括以下中的至少一项：
物理上行控制信道PUCCH、物理随机接入信道PRACH以及探测参考信号SRS。
在一些实施例中，所述多个可用时域单元的数量大于或等于实际进行重复数据的接收的可用时域单元的数量。
在一些实施例中，所述S330可包括：
基于所述每一个可用时域单元的计数，确定适用于所述每一个可用时域单元的冗余版本RV；
基于所述重复传输次数和适用于所述每一个可用时域单元的RV，进行所述第一物理信道的重复数据的接收。
在一些实施例中，基于适用于所述多个可用时域单元中的第一个可用时域单元的RV和所述每一个可用时域单元的计数，按照RV标识为0，2，3，1，的顺序循环的方式，确定适用于所述每一个可用时域单元的RV。
在一些实施例中，所述第一个可用时域单元的RV为用于调度PUSCH的下行控制信息DCI指示的RV id。
在一些实现方式中，按照以下表格确定适用于所述每一个可用时域单元的RV：
Figure PCTCN2021093465-appb-000009
其中，mod表示取模运算。
在一些实施例中，所述第一物理信道包括物理上行共享信道PUSCH；所述方法300还可包括：
向终端设备发送第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
在一些实施例中，所述第一物理信道包括物理下行共享信道PDSCH；所述方法300还可包括：
接收网络设备发送的第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
在一些实施例中，所述可用时域单元包括至少一个连续的时隙或至少一个连续的符号。
在一些实施例中，所述可用时域单元为一个时隙内时域资源分配表TDRA分配的至少一个符号，所述至少一个符号均用于上行传输。
在一些实施例中，所述可用时域单元为至少一个连续的符号，所述至少一个连续的符号均用于上行传输。
应理解，方法300中的步骤可以参考方法200中的相应步骤，例如，方法300中的确定位置偏移因子和/或RV的相应步骤或方案可以参考方法200中的相应步骤或方案，为了简洁，在此不再赘述。
上文结合图1至图10，详细描述了本申请的方法实施例，下文结合图11至图14，详细描述本申请的装置实施例。
图11是本申请实施例的第一设备400的示意性框图。
如图11所示，所述第一设备400可包括：
确定单元410，用于确定第一物理信道的重复传输次数；
处理单元420，用于基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；
发送单元430，用于基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的发送。
在一些实施例中，所述发送单元430具体用于：
在所述计数的初始值为1，且所述每一个可用时域单元的计数小于或等于所述重复传输次数的情况下，进行所述第一物理信道的重复数据的发送，否则，终止所述第一物理信道的重复数据的发送；或者
在所述计数的初始值为0，且所述每一个可用时域单元的计数小于或等于所述重复传输次数与1的差值的情况下，进行所述第一物理信道的重复数据的发送，否则，终止所述第一物理信道的重复数据的发送。
在一些实施例中，所述多个可用时域单元包括被取消的可用时域单元。
在一些实施例中，所述被取消的可用时域单元包括：网络设备指示的被取消的可用时域单元，和/或由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元。
在一些实施例中，所述由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元满足以下条件中的至少一项：
可用时域单元的发射功率受限；
存在待发送的第一信号，所述第一信号的优先级高于所述物理信道的优先级。
在一些实施例中，所述第一信号包括以下中的至少一项：
物理上行控制信道PUCCH、物理随机接入信道PRACH以及探测参考信号SRS。
在一些实施例中，所述多个可用时域单元的数量大于或等于实际进行重复数据的发送的可用时域单元的数量。
在一些实施例中，所述发送单元430具体用于：
基于所述每一个可用时域单元的计数，确定适用于所述每一个可用时域单元的冗余版本RV；
基于所述重复传输次数和适用于所述每一个可用时域单元的RV，进行所述第一物理信道的重复数据的发送。
在一些实施例中，所述发送单元430具体用于：
基于适用于所述多个可用时域单元中的第一个可用时域单元的RV和所述每一个可用时域单元的计数，按照RV标识为0，2，3，1，的顺序循环的方式，确定适用于所述每一个可用时域单元的RV。
在一些实施例中，所述第一个可用时域单元的RV为用于调度PUSCH的下行控制信息DCI指示的RV id。
在一些实施例中，所述发送单元430具体用于：
按照以下表格确定适用于所述每一个可用时域单元的RV：
Figure PCTCN2021093465-appb-000010
其中，mod表示取模运算。
在一些实施例中，所述第一物理信道包括物理上行共享信道PUSCH；所述发送单元430还用于：
接收网络设备发送的第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
在一些实施例中，所述第一物理信道包括物理下行共享信道PDSCH；所述发送单元430还用于：
向终端设备发送第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
在一些实施例中，所述可用时域单元包括至少一个连续的时隙或至少一个连续的符号。
在一些实施例中，所述可用时域单元为一个时隙内时域资源分配表TDRA分配的至少一个符号，所述至少一个符号均用于上行传输。
在一些实施例中，所述可用时域单元为至少一个连续的符号，所述至少一个连续的符号均用于上行传输。
应理解，装置实施例与方法实施例可以相互对应，类似的描述可以参照方法实施例。具体地，图11所示的第一设备400可以对应于执行本申请实施例的方法200中的相应主体，并且第一设备400中的各个单元的前述和其它操作和/或功能分别为了实现图4中的各个方法中的相应流程，为了简洁， 在此不再赘述。
图12是本申请实施例的第二设备500的示意性框图。
如图12所示，所述第二设备500可包括：
确定单元510，用于确定第一物理信道的重复传输次数；
处理单元520，用于基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；
接收单元530，用于基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的接收。
在一些实施例中，所述接收单元530具体用于：
在所述计数的初始值为1，且所述每一个可用时域单元的计数小于或等于所述重复传输次数的情况下，进行所述第一物理信道的重复数据的接收，否则，终止所述第一物理信道的重复数据的接收；或者
在所述计数的初始值为0，且所述每一个可用时域单元的计数小于或等于所述重复传输次数与1的差值的情况下，进行所述第一物理信道的重复数据的接收，否则，终止所述第一物理信道的重复数据的接收。
在一些实施例中，所述多个可用时域单元包括被取消的可用时域单元。
在一些实施例中，所述被取消的可用时域单元包括：网络设备指示的被取消的可用时域单元，和/或由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元。
在一些实施例中，所述由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元满足以下条件中的至少一项：
可用时域单元的发射功率受限；
存在待发送的第一信号，所述第一信号的优先级高于所述物理信道的优先级。
在一些实施例中，所述第一信号包括以下中的至少一项：
物理上行控制信道PUCCH、物理随机接入信道PRACH以及探测参考信号SRS。
在一些实施例中，所述多个可用时域单元的数量大于或等于实际进行重复数据的接收的可用时域单元的数量。
在一些实施例中，所述接收单元530具体用于：
基于所述每一个可用时域单元的计数，确定适用于所述每一个可用时域单元的冗余版本RV；
基于所述重复传输次数和适用于所述每一个可用时域单元的RV，进行所述第一物理信道的重复数据的接收。
在一些实施例中，所述接收单元530具体用于：
基于适用于所述多个可用时域单元中的第一个可用时域单元的RV和所述每一个可用时域单元的计数，按照RV标识为0，2，3，1，的顺序循环的方式，确定适用于所述每一个可用时域单元的RV。
在一些实施例中，所述第一个可用时域单元的RV为用于调度PUSCH的下行控制信息DCI指示的RV id。
在一些实施例中，所述接收单元530具体用于：
按照以下表格确定适用于所述每一个可用时域单元的RV：
Figure PCTCN2021093465-appb-000011
其中，mod表示取模运算。
在一些实施例中，所述第一物理信道包括物理上行共享信道PUSCH；所述接收单元530还用于：
向终端设备发送第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
在一些实施例中，所述第一物理信道包括物理下行共享信道PDSCH；所述接收单元530还用于：
接收网络设备发送的第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
在一些实施例中，所述可用时域单元包括至少一个连续的时隙或至少一个连续的符号。
在一些实施例中，所述可用时域单元为一个时隙内时域资源分配表TDRA分配的至少一个符号， 所述至少一个符号均用于上行传输。
在一些实施例中，所述可用时域单元为至少一个连续的符号，所述至少一个连续的符号均用于上行传输。
应理解，装置实施例与方法实施例可以相互对应，类似的描述可以参照方法实施例。具体地，图12所示的第二设备500可以对应于执行本申请实施例的方法300中的相应主体，并且第二设备500中的各个单元的前述和其它操作和/或功能分别为了实现图10中的各个方法中的相应流程，为了简洁，在此不再赘述。
上文中结合附图从功能模块的角度描述了本申请实施例的通信设备。应理解，该功能模块可以通过硬件形式实现，也可以通过软件形式的指令实现，还可以通过硬件和软件模块组合实现。具体地，本申请实施例中的方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路和/或软件形式的指令完成，结合本申请实施例公开的方法的步骤可以直接体现为硬件译码处理器执行完成，或者用译码处理器中的硬件及软件模块组合执行完成。可选地，软件模块可以位于随机存储器，闪存、只读存储器、可编程只读存储器、电可擦写可编程存储器、寄存器等本领域的成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法实施例中的步骤。
例如，上文涉及的确定单元410、处理单元420、确定单元510以及处理单元520可通过处理器实现，上文涉及的发送单元430和接收单元530可由收发器实现。
图13是本申请实施例的通信设备600示意性结构图。
如图13所示，所述通信设备600可包括处理器610。
其中，处理器610可以从存储器中调用并运行计算机程序，以实现本申请实施例中的方法。
如图13所示，通信设备600还可以包括存储器620。
其中，该存储器620可以用于存储指示信息，还可以用于存储处理器610执行的代码、指令等。其中，处理器610可以从存储器620中调用并运行计算机程序，以实现本申请实施例中的方法。存储器620可以是独立于处理器610的一个单独的器件，也可以集成在处理器610中。
如图13所示，通信设备600还可以包括收发器630。
其中，处理器610可以控制该收发器630与其他设备进行通信，具体地，可以向其他设备发送信息或数据，或接收其他设备发送的信息或数据。收发器630可以包括发射机和接收机。收发器630还可以进一步包括天线，天线的数量可以为一个或多个。
应当理解，该通信设备600中的各个组件通过总线系统相连，其中，总线系统除包括数据总线之外，还包括电源总线、控制总线和状态信号总线。
还应理解，该通信设备600可为本申请实施例的终端设备，并且该通信设备600可以实现本申请实施例的各个方法中由终端设备实现的相应流程，也就是说，本申请实施例的通信设备600可对应于本申请实施例中的第一设备400，并可以对应于执行根据本申请实施例的方法200中的相应主体，为了简洁，在此不再赘述。类似地，该通信设备600可为本申请实施例的网络设备，并且该通信设备600可以实现本申请实施例的各个方法中由网络设备实现的相应流程。也就是说，本申请实施例的通信设备600可对应于本申请实施例中的第二设备500，并可以对应于执行根据本申请实施例的方法300中的相应主体，为了简洁，在此不再赘述。
此外，本申请实施例中还提供了一种芯片。
例如，芯片可能是一种集成电路芯片，具有信号的处理能力，可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。所述芯片还可以称为系统级芯片，系统芯片，芯片系统或片上系统芯片等。可选地，该芯片可应用到各种通信设备中，使得安装有该芯片的通信设备能够执行本申请实施例中的公开的各方法、步骤及逻辑框图。
图14是根据本申请实施例的芯片700的示意性结构图。
如图14所示，所述芯片700包括处理器710。
其中，处理器710可以从存储器中调用并运行计算机程序，以实现本申请实施例中的方法。
如图14所示，所述芯片700还可以包括存储器720。
其中，处理器710可以从存储器720中调用并运行计算机程序，以实现本申请实施例中的方法。该存储器720可以用于存储指示信息，还可以用于存储处理器710执行的代码、指令等。存储器720可以是独立于处理器710的一个单独的器件，也可以集成在处理器710中。
如图14所示，所述芯片700还可以包括输入接口730。
其中，处理器710可以控制该输入接口730与其他设备或芯片进行通信，具体地，可以获取其他设备或芯片发送的信息或数据。
如图14所示，所述芯片700还可以包括输出接口740。
其中，处理器710可以控制该输出接口740与其他设备或芯片进行通信，具体地，可以向其他设备或芯片输出信息或数据。
应理解，所述芯片700可应用于本申请实施例中的网络设备，并且该芯片可以实现本申请实施例的各个方法中由第一设备实现的相应流程，也可以实现本申请实施例的各个方法中由第二设备实现的相应流程，为了简洁，在此不再赘述。
还应理解，该芯片700中的各个组件通过总线系统相连，其中，总线系统除包括数据总线之外，还包括电源总线、控制总线和状态信号总线。
上文涉及的处理器可以包括但不限于：
通用处理器、数字信号处理器(Digital Signal Processor，DSP)、专用集成电路(Application Specific Integrated Circuit，ASIC)、现场可编程门阵列(Field Programmable Gate Array，FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等等。
所述处理器可以用于实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。结合本申请实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成，或者用译码处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。
上文涉及的存储器包括但不限于：
易失性存储器和/或非易失性存储器。其中，非易失性存储器可以是只读存储器(Read-Only Memory，ROM)、可编程只读存储器(Programmable ROM，PROM)、可擦除可编程只读存储器(Erasable PROM，EPROM)、电可擦除可编程只读存储器(Electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(Random Access Memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(Static RAM，SRAM)、动态随机存取存储器(Dynamic RAM，DRAM)、同步动态随机存取存储器(Synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(Double Data Rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(Enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synch link DRAM，SLDRAM)和直接内存总线随机存取存储器(Direct Rambus RAM，DR RAM)。
应注意，本文描述的存储器旨在包括这些和其它任意适合类型的存储器。
本申请实施例中还提供了一种计算机可读存储介质，用于存储计算机程序。该计算机可读存储介质存储一个或多个程序，该一个或多个程序包括指令，该指令当被包括多个应用程序的便携式电子设备执行时，能够使该便携式电子设备执行方法200或300所示实施例的方法。可选的，该计算机可读存储介质可应用于本申请实施例中的第一设备，并且该计算机程序使得计算机执行本申请实施例的各个方法中由第一设备实现的相应流程，为了简洁，在此不再赘述。可选地，该计算机可读存储介质可应用于本申请实施例中的第二设备，并且该计算机程序使得计算机执行本申请实施例的各个方法中由第二设备实现的相应流程，为了简洁，在此不再赘述。
本申请实施例中还提供了一种计算机程序产品，包括计算机程序。可选的，该计算机程序产品可应用于本申请实施例中的第一设备，并且该计算机程序使得计算机执行本申请实施例的各个方法中由第一设备实现的相应流程，为了简洁，在此不再赘述。可选地，该计算机程序产品可应用于本申请实施例中的第二设备，并且该计算机程序使得计算机执行本申请实施例的各个方法中由第二设备实现的相应流程，为了简洁，在此不再赘述。
本申请实施例中还提供了一种计算机程序。当该计算机程序被计算机执行时，使得计算机可以执行方法200或300所示实施例的方法。可选的，该计算机程序可应用于本申请实施例中的第一设备，当该计算机程序在计算机上运行时，使得计算机执行本申请实施例的各个方法中由第一设备实现的相应流程，为了简洁，在此不再赘述。可选的，该计算机程序可应用于本申请实施例中的第二设备，当该计算机程序在计算机上运行时，使得计算机执行本申请实施例的各个方法中由第二设备实现的相应流程，为了简洁，在此不再赘述。
本申请实施例还提供了一种通信系统，所述通信系统可以包括上述涉及的终端设备和网络设备，以形成如图1所示的通信系统100，为了简洁，在此不再赘述。需要说明的是，本文中的术语“系统”等也可以称为“网络管理架构”或者“网络系统”等。
还应当理解，在本申请实施例和所附权利要求书中使用的术语是仅仅出于描述特定实施例的目的，而非旨在限制本申请实施例。例如，在本申请实施例和所附权利要求书中所使用的单数形式的“一种”、“所述”、“上述”和“该”也旨在包括多数形式，除非上下文清楚地表示其他含义。
所属领域的技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤， 能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请实施例的范围。如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请实施例的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器、随机存取存储器、磁碟或者光盘等各种可以存储程序代码的介质。
所属领域的技术人员还可以意识到，为描述的方便和简洁，上述描述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。在本申请提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例中单元或模块或组件的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如，多个单元或模块或组件可以结合或者可以集成到另一个系统，或一些单元或模块或组件可以忽略，或不执行。又例如，上述作为分离/显示部件说明的单元/模块/组件可以是或者也可以不是物理上分开的，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元/模块/组件来实现本申请实施例的目的。最后，需要说明的是，上文中显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
以上内容，仅为本申请实施例的具体实施方式，但本申请实施例的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请实施例揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请实施例的保护范围之内。因此，本申请实施例的保护范围应以权利要求的保护范围为准。

Claims (40)

  1. 一种无线通信方法，其特征在于，包括：
    确定第一物理信道的重复传输次数；
    基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；
    基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的发送。
  2. 根据权利要求1所述的方法，其特征在于，所述基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的发送，包括：
    在所述计数的初始值为1，且所述每一个可用时域单元的计数小于或等于所述重复传输次数的情况下，进行所述第一物理信道的重复数据的发送，否则，终止所述第一物理信道的重复数据的发送；或者
    在所述计数的初始值为0，且所述每一个可用时域单元的计数小于或等于所述重复传输次数与1的差值的情况下，进行所述第一物理信道的重复数据的发送，否则，终止所述第一物理信道的重复数据的发送。
  3. 根据权利要求1或2所述的方法，其特征在于，所述多个可用时域单元包括被取消的可用时域单元。
  4. 根据权利要求3所述的方法，其特征在于，所述被取消的可用时域单元包括：网络设备指示的被取消的可用时域单元，和/或由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元。
  5. 根据权利要求4所述的方法，其特征在于，所述由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元满足以下条件中的至少一项：
    可用时域单元的发射功率受限；
    存在待发送的第一信号，所述第一信号的优先级高于所述物理信道的优先级。
  6. 根据权利要求5所述的方法，其特征在于，所述第一信号包括以下中的至少一项：
    物理上行控制信道PUCCH、物理随机接入信道PRACH以及探测参考信号SRS。
  7. 根据权利要求1至6中任一项所述的方法，其特征在于，所述多个可用时域单元的数量大于或等于实际进行重复数据的发送的可用时域单元的数量。
  8. 根据权利要求1至7中任一项所述的方法，其特征在于，所述基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的发送，包括：
    基于所述每一个可用时域单元的计数，确定适用于所述每一个可用时域单元的冗余版本RV；
    基于所述重复传输次数和适用于所述每一个可用时域单元的RV，进行所述第一物理信道的重复数据的发送。
  9. 根据权利要求8所述的方法，其特征在于，所述基于所述每一个可用时域单元的计数，确定适用于所述每一个可用时域单元的冗余版本RV，包括：
    基于适用于所述多个可用时域单元中的第一个可用时域单元的RV和所述每一个可用时域单元的计数，按照RV标识为0，2，3，1，的顺序循环的方式，确定适用于所述每一个可用时域单元的RV。
  10. 根据权利要求9所述的方法，其特征在于，所述第一个可用时域单元的RV为用于调度PUSCH的下行控制信息DCI指示的RV id。
  11. 根据权利要求9所述的方法，其特征在于，所述基于适用于所述多个可用时域单元中的第一个可用时域单元的RV和所述每一个可用时域单元的计数，按照RV标识为0，2，3，1，的顺序循环的方式，确定适用于所述每一个可用时域单元的RV，包括：
    按照以下表格确定适用于所述每一个可用时域单元的RV：
    Figure PCTCN2021093465-appb-100001
    其中，mod表示取模运算。
  12. 根据权利要求1至11中任一项所述的方法，其特征在于，所述第一物理信道包括物理上行共享信道PUSCH；所述方法还包括：
    接收网络设备发送的第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
  13. 根据权利要求1至11中任一项所述的方法，其特征在于，所述第一物理信道包括物理下行共享信道PDSCH；所述方法还包括：
    向终端设备发送第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
  14. 根据权利要求1至13中任一项所述的方法，其特征在于，所述可用时域单元包括至少一个连续的时隙或至少一个连续的符号。
  15. 根据权利要求1至14中任一项所述的方法，其特征在于，所述可用时域单元为一个时隙内时域资源分配表TDRA分配的至少一个符号，所述至少一个符号均用于上行传输。
  16. 根据权利要求1至14中任一项所述的方法，其特征在于，所述可用时域单元为至少一个连续的符号，所述至少一个连续的符号均用于上行传输。
  17. 一种无线通信方法，其特征在于，包括：
    确定第一物理信道的重复传输次数；
    基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；
    基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的接收。
  18. 根据权利要求17所述的方法，其特征在于，所述基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的接收，包括：
    在所述计数的初始值为1，且所述每一个可用时域单元的计数小于或等于所述重复传输次数的情况下，进行所述第一物理信道的重复数据的接收，否则，终止所述第一物理信道的重复数据的接收；或者
    在所述计数的初始值为0，且所述每一个可用时域单元的计数小于或等于所述重复传输次数与1的差值的情况下，进行所述第一物理信道的重复数据的接收，否则，终止所述第一物理信道的重复数据的接收。
  19. 根据权利要求17或18所述的方法，其特征在于，所述多个可用时域单元包括被取消的可用时域单元。
  20. 根据权利要求19所述的方法，其特征在于，所述被取消的可用时域单元包括：网络设备指示的被取消的可用时域单元，和/或由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元。
  21. 根据权利要求20所述的方法，其特征在于，所述由于用户设备UE原因导致的但是网络设备并不知道的被取消的可用时域单元满足以下条件中的至少一项：
    可用时域单元的发射功率受限；
    存在待发送的第一信号，所述第一信号的优先级高于所述物理信道的优先级。
  22. 根据权利要求21所述的方法，其特征在于，所述第一信号包括以下中的至少一项：
    物理上行控制信道PUCCH、物理随机接入信道PRACH以及探测参考信号SRS。
  23. 根据权利要求17至22中任一项所述的方法，其特征在于，所述多个可用时域单元的数量大于或等于实际进行重复数据的接收的可用时域单元的数量。
  24. 根据权利要求17至23中任一项所述的方法，其特征在于，所述基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的接收，包括：
    基于所述每一个可用时域单元的计数，确定适用于所述每一个可用时域单元的冗余版本RV；
    基于所述重复传输次数和适用于所述每一个可用时域单元的RV，进行所述第一物理信道的重复数据的接收。
  25. 根据权利要求24所述的方法，其特征在于，所述基于所述每一个可用时域单元的计数，确定适用于所述每一个可用时域单元的冗余版本RV，包括：
    基于适用于所述多个可用时域单元中的第一个可用时域单元的RV和所述每一个可用时域单元的计数，按照RV标识为0，2，3，1，的顺序循环的方式，确定适用于所述每一个可用时域单元的RV。
  26. 根据权利要求25所述的方法，其特征在于，所述第一个可用时域单元的RV为用于调度PUSCH的下行控制信息DCI指示的RV id。
  27. 根据权利要求25所述的方法，其特征在于，所述基于适用于所述多个可用时域单元中的第一个可用时域单元的RV和所述每一个可用时域单元的计数，按照RV标识为0，2，3，1，的顺序循环的方式，确定适用于所述每一个可用时域单元的RV，包括：
    按照以下表格确定适用于所述每一个可用时域单元的RV：
    Figure PCTCN2021093465-appb-100002
    其中，mod表示取模运算。
  28. 根据权利要求17至27中任一项所述的方法，其特征在于，所述第一物理信道包括物理上行共享信道PUSCH；所述方法还包括：
    向终端设备发送第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
  29. 根据权利要求17至27中任一项所述的方法，其特征在于，所述第一物理信道包括物理下行共享信道PDSCH；所述方法还包括：
    接收网络设备发送的第一指示信息，所述第一指示信息用于针对可用时域单元的计数包括被取消的可用时域单元。
  30. 根据权利要求17至28中任一项所述的方法，其特征在于，所述可用时域单元包括至少一个连续的时隙或至少一个连续的符号。
  31. 根据权利要求17至29中任一项所述的方法，其特征在于，所述可用时域单元为一个时隙内时域资源分配表TDRA分配的至少一个符号，所述至少一个符号均用于上行传输。
  32. 根据权利要求17至29中任一项所述的方法，其特征在于，所述可用时域单元为至少一个连续的符号，所述至少一个连续的符号均用于上行传输。
  33. 一种第一设备，其特征在于，包括：
    确定单元，用于确定第一物理信道的重复传输次数；
    处理单元，用于基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；
    发送单元，用于基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的发送。
  34. 一种第二设备，其特征在于，包括：
    确定单元，用于确定第一物理信道的重复传输次数；
    处理单元，用于基于所述第一物理信道对应的多个可用时域单元进行计数，得到每一个可用时域单元的计数；
    接收单元，用于基于所述重复传输次数和所述每一个可用时域单元的计数，进行所述第一物理信道的重复数据的接收。
  35. 一种第一设备，其特征在于，包括：
    处理器和存储器，所述存储器用于存储计算机程序，所述处理器用于调用并运行所述存储器中存储的计算机程序，以执行权利要求1至16中任一项所述的方法。
  36. 一种第二设备，其特征在于，包括：
    处理器和存储器，所述存储器用于存储计算机程序，所述处理器用于调用并运行所述存储器中存储的计算机程序，以执行权利要求17至32中任一项所述的方法。
  37. 一种芯片，其特征在于，包括：
    处理器，用于从存储器中调用并运行计算机程序，使得安装有所述芯片的设备执行如权利要求1至16中任一项所述的方法或权利要求17至32中任一项所述的方法。
  38. 一种计算机可读存储介质，其特征在于，用于存储计算机程序，所述计算机程序使得计算机执行如权利要求1至16中任一项所述的方法或权利要求17至32中任一项所述的方法。
  39. 一种计算机程序产品，其特征在于，包括计算机程序指令，所述计算机程序指令使得计算机执行如权利要求1至16中任一项所述的方法或权利要求17至32中任一项所述的方法。
  40. 一种计算机程序，其特征在于，所述计算机程序使得计算机执行如权利要求1至16中任一项所述的方法或权利要求17至32中任一项所述的方法。
PCT/CN2021/093465 2021-05-12 2021-05-12 无线通信方法、第一设备和第二设备 WO2022236752A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP21941325.9A EP4329399A1 (en) 2021-05-12 2021-05-12 Wireless communication method, first device, and second device
CN202180093693.1A CN116897571A (zh) 2021-05-12 2021-05-12 无线通信方法、第一设备和第二设备
PCT/CN2021/093465 WO2022236752A1 (zh) 2021-05-12 2021-05-12 无线通信方法、第一设备和第二设备
US18/388,591 US20240090039A1 (en) 2021-05-12 2023-11-10 Wireless communication method, first device, and second device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2021/093465 WO2022236752A1 (zh) 2021-05-12 2021-05-12 无线通信方法、第一设备和第二设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US18/388,591 Continuation US20240090039A1 (en) 2021-05-12 2023-11-10 Wireless communication method, first device, and second device

Publications (1)

Publication Number Publication Date
WO2022236752A1 true WO2022236752A1 (zh) 2022-11-17

Family

ID=84027928

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/093465 WO2022236752A1 (zh) 2021-05-12 2021-05-12 无线通信方法、第一设备和第二设备

Country Status (4)

Country Link
US (1) US20240090039A1 (zh)
EP (1) EP4329399A1 (zh)
CN (1) CN116897571A (zh)
WO (1) WO2022236752A1 (zh)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018175597A1 (en) * 2017-03-23 2018-09-27 Sharp Laboratories Of America, Inc. User equipments, base stations and methods
CN111278056A (zh) * 2019-01-02 2020-06-12 维沃移动通信有限公司 信息传输方法、终端及网络设备
CN112218375A (zh) * 2019-07-12 2021-01-12 华为技术有限公司 确定资源分配的方法和装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018175597A1 (en) * 2017-03-23 2018-09-27 Sharp Laboratories Of America, Inc. User equipments, base stations and methods
CN111278056A (zh) * 2019-01-02 2020-06-12 维沃移动通信有限公司 信息传输方法、终端及网络设备
CN112218375A (zh) * 2019-07-12 2021-01-12 华为技术有限公司 确定资源分配的方法和装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Physical layer procedures for control (Release 16)", 3GPP STANDARD; TECHNICAL SPECIFICATION; 3GPP TS 38.213, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. V16.5.0, 30 March 2021 (2021-03-30), Mobile Competence Centre ; 650, route des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France , pages 1 - 183, XP052000308 *

Also Published As

Publication number Publication date
EP4329399A1 (en) 2024-02-28
CN116897571A (zh) 2023-10-17
US20240090039A1 (en) 2024-03-14

Similar Documents

Publication Publication Date Title
WO2019072074A1 (zh) Harq-ack反馈码本的发送方法、装置及设备
CN111436153B (zh) 一种信息处理方法、终端设备及网络设备
EP3852465B1 (en) Wireless communication method and device
US20220224452A1 (en) Feedback Information Transmission Method and Apparatus
WO2019137467A1 (zh) 上行信息传输方法及装置
US11902943B2 (en) Communication method and communications apparatus
US20230139754A1 (en) Coding method and apparatus
JP2020529179A (ja) 方法及び装置
CN112636879B (zh) 基于混合自动重传请求的码块处理的方法和装置
US20190386781A1 (en) Method and device for information transmission
TWI759507B (zh) 回饋應答訊息的傳輸方法、裝置及系統
CN116367359A (zh) 一种确定物理直连反馈信道资源的方法及装置
WO2022040964A1 (zh) 生成混合自动重复请求harq码本的方法和装置
EP3790213A1 (en) Mac-based hybrid automatic repeat request (harq)
WO2021062638A1 (zh) 发送、接收反馈信息的方法和设备
WO2018228553A1 (zh) 数据传输的方法、网络设备和终端设备
WO2022236752A1 (zh) 无线通信方法、第一设备和第二设备
WO2022236719A1 (zh) 无线通信方法、终端设备和网络设备
WO2017024528A1 (zh) 一种传输反馈信息的方法、用户设备和接入设备
WO2022267020A1 (zh) 无线通信方法、终端设备和网络设备
RU2748852C1 (ru) Способ и устройство
WO2023011090A1 (zh) 一种重传反馈信息的方法及装置
WO2022246825A1 (zh) 混合自动重传反馈码本的确定方法、装置及设备
WO2020057326A1 (zh) 竞争窗口大小调节方法和网络设备
WO2018201905A1 (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: 21941325

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 202180093693.1

Country of ref document: CN

WWE Wipo information: entry into national phase

Ref document number: 2021941325

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2021941325

Country of ref document: EP

Effective date: 20231124

NENP Non-entry into the national phase

Ref country code: DE