WO2022000431A1 - Procédé et appareil de sauts de fréquence multi-faisceaux - Google Patents

Procédé et appareil de sauts de fréquence multi-faisceaux Download PDF

Info

Publication number
WO2022000431A1
WO2022000431A1 PCT/CN2020/099967 CN2020099967W WO2022000431A1 WO 2022000431 A1 WO2022000431 A1 WO 2022000431A1 CN 2020099967 W CN2020099967 W CN 2020099967W WO 2022000431 A1 WO2022000431 A1 WO 2022000431A1
Authority
WO
WIPO (PCT)
Prior art keywords
repetition
spatial relation
nominal
pusch repetition
relation information
Prior art date
Application number
PCT/CN2020/099967
Other languages
English (en)
Inventor
Wei Ling
Chenxi Zhu
Bingchao LIU
Yi Zhang
Original Assignee
Lenovo (Beijing) Limited
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 Lenovo (Beijing) Limited filed Critical Lenovo (Beijing) Limited
Priority to PCT/CN2020/099967 priority Critical patent/WO2022000431A1/fr
Publication of WO2022000431A1 publication Critical patent/WO2022000431A1/fr

Links

Images

Classifications

    • 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/0044—Arrangements for allocating sub-channels of the transmission path allocation of payload
    • 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
    • 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/1893—Physical mapping arrangements
    • 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/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H04L5/0012—Hopping in multicarrier systems
    • 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/0001—Arrangements for dividing the transmission path
    • H04L5/0014—Three-dimensional division
    • H04L5/0023—Time-frequency-space
    • H04L5/0025—Spatial division following the spatial signature of the channel
    • 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/0091—Signaling for the administration of the divided path
    • H04L5/0094—Indication of how sub-channels of the path are allocated

Definitions

  • a method may include: transmitting configuration information indicating a mapping pattern of a plurality of spatial relation information and a number of nominal PUSCH repetitions of a PUSCH transmission using the plurality of spatial relation information, wherein each single spatial relation information of the plurality of spatial relation information is associated with at least one nominal PUSCH repetition, wherein the configuration information indicates that an inter-repetition frequency hopping mechanism is used for the PUSCH transmission; for said each single spatial relation information, determining a new index for each nominal PUSCH repetition of the at least one nominal PUSCH repetitions associated with the single spatial relation information; and receiving all actual PUSCH repetition (s) within each single nominal PUSCH repetition using the spatial relation information associated with the single nominal PUSCH repetition, wherein a starting point in the frequency domain of all actual PUSCH repetition (s) within the single nominal PUSCH repetition is determined by the new index of the single nominal PUSCH repetition.
  • FIG. 2 illustrates an example of applying an inter-repetition frequency hopping mechanism for PUSCH transmission using multiple beams according to some embodiments of the present application
  • FIG. 3 is a flow chart illustrating a method for frequency hopping with multiple beams according to some other embodiments of the present application
  • FIG. 5 illustrates an example of applying an inter-repetition frequency hopping mechanism for PUSCH transmission using multiple beams according to some other embodiments of the present application.
  • FIG. 1 is a schematic diagram illustrating an exemplary wireless communication system 100 according to an embodiment of the present application.
  • the UE 102 may include computing devices, such as desktop computers, laptop computers, personal digital assistants (PDAs) , tablet computers, smart televisions (e.g., televisions connected to the Internet) , set-top boxes, game consoles, security systems (including security cameras) , vehicle on-board computers, network devices (e.g., routers, switches, and modems) , or the like.
  • the UE 102 may include a portable wireless communication device, a smart phone, a cellular telephone, a flip phone, a device having a subscriber identity module, a personal computer, a selective call receiver, or any other device that is capable of sending and receiving communication signals on a wireless network.
  • the wireless communication system 100 is compatible with any type of network that is capable of sending and receiving wireless communication signals.
  • the wireless communication system 100 is compatible with a wireless communication network, a cellular telephone network, a time division multiple access (TDMA) -based network, a code division multiple access (CDMA) -based network, an orthogonal frequency division multiple access (OFDMA) -based network, an LTE network, a 3GPP-based network, a 3GPP 5G network, a satellite communications network, a high altitude platform network, and/or other communications networks.
  • TDMA time division multiple access
  • CDMA code division multiple access
  • OFDMA orthogonal frequency division multiple access
  • PUSCH repetition type B concepts “nominal repetition” and “actual repetition” are introduced so that multiple repetitions within one slot will be identified.
  • the number of nominal repetitions is given by the parameter numberofrepetitions, for the n th nominal repetition, wherein the value of n ranges from 0 to numberofrepetitions-1, the starting slot, starting symbol, ending slot, and ending symbol of the n th nominal repetition are calculated as follows:
  • K s is the slot where the PUSCH transmission starts, and is the number of symbols per slot
  • S is the starting symbol S relative to the start of the slot
  • L is the number of consecutive symbols L counting from the symbol S allocated for each nominal repetition of a PUSCH repetition Type B transmission.
  • S and L are respectively provided by the parameters: startSymbol and length of the indexed row of the resource allocation table.
  • PUSCH repetition Type B among the starting symbol to the ending symbol, there might be one or more invalid symbols.
  • the UE determines these invalid symbols for PUSCH repetition Type B transmission based on the following rules:
  • the UE may be configured with the high layer parameter InvalidSymbolPattern, which provides a symbol level bitmap spanning one or two slots, e.g., high layer parameter symbols given by InvalidSymbolPattern. A bit value equal to 1 in the symbol level bitmap symbols indicates that the corresponding symbol is an invalid symbol for PUSCH repetition Type B transmission.
  • the UE may be additionally configured with a time-domain pattern, e.g., high layer parameter periodicityAndPattern given by InvalidSymbolPattern, where each bit of periodicityAndPattern corresponds to a unit equal to a duration of the symbol level bitmap symbols, and a bit value equal to 1 indicates that the symbol level bitmap symbols is present in the unit.
  • the periodicityAndPattern can be ⁇ 1, 2, 4, 5, 8, 10, 20 or 40 ⁇ units long, but maximum of 40ms.
  • P is the duration of periodicityAndPattern in units of ms.
  • the remaining symbols are considered as potentially valid symbols for PUSCH repetition Type B transmission.
  • the nominal repetition consists of one or more actual repetitions, where each actual repetition consists of a consecutive set of potentially valid symbols that can be used for PUSCH repetition Type B transmission within a slot.
  • An actual repetition is omitted according to the conditions in Clause 11.1 of [6, TS38.213] .
  • the redundancy version to be applied on the nth actual repetition (with the counting including the actual repetitions that are omitted) is determined according to table 6.1.2.1-2.
  • a frequency hopping mechanism may be configured by a BS or the like.
  • the frequency hopping mechanism may be one of an inter-repetition frequency hopping mechanism and an inter-slot frequency hopping mechanism.
  • the frequency hopping mechanism may be configured via a high layer parameter.
  • the high layer may be one or more layers higher than a physical layer.
  • the high layer may be a radio resource control (RRC) layer.
  • RRC radio resource control
  • the frequency hopping mechanism may be configured by the high layer parameter frequencyHopping-ForDCIFormat0_2 in pusch-Config information element (IE) as specified in 3GPP standard documents.
  • the frequency hopping mechanism may be configured by the high layer parameter frequencyHopping-ForDCIFormat0_1 provided in pusch-Config IE as specified in 3GPP standard documents.
  • the frequency hopping mechanism may be configured by the high layer parameter frequencyHopping-PUSCHRepTypeB provided in rrc-ConfiguredUplinkGrant IE as specified in 3GPP standard documents.
  • the frequency hopping mechanism follows a configuration of the activating DCI format.
  • RB start (n) is the starting RB for an actual repetition within the n-th nominal repetition
  • RB offset is the frequency offset in RBs between the two frequency hops.
  • the above equation (5) for determining the starting RB does not consider a situation of transmitting PUSCH transmissions using multiple beams, and thus it may bring some issues when using multiple beams to transmit PUSCH transmissions.
  • FIG. 2 illustrates an example of applying an inter-repetition frequency hopping mechanism for PUSCH transmission using multiple beams according to some embodiments of the present application.
  • the spatial relation information #1 (e.g., beam 201) may be used for the nominal PUSCH repetition 2000
  • the spatial relation information #2 (e.g., beam 202) may be used for the nominal PUSCH repetition 2001
  • the spatial relation information #1 (e.g., beam 201) may be used for the nominal PUSCH repetition 2002
  • the spatial relation information #2 (e.g., beam 202) may be used for the nominal PUSCH repetition 2003.
  • the UE may determine the start RB of all actual PUSCH repetitions based on the above equation (5) . Based on the equation (5) , it can be determined that the start RB for actual PUSCH repetitions 0 and 1 within nominal PUSCH repetition 2000 and actual PUSCH repetitions 4 within nominal PUSCH repetition 2002 is RB start in equation (5) , which is represented by RB start1 in FIG. 2, while the start RB for actual PUSCH repetitions 2 and 3 within nominal PUSCH repetition 2001 and actual PUSCH repetitions 5 and 6 within nominal PUSCH repetition 2003 is in equation (5) , which is represented by RB start2 in FIG. 2. That is, all actual PUSCH repetitions transmitted by beam 201 occupy the same frequency resource while all actual PUSCH repetitions transmitted by beam 202 occupy the same frequency resource, as shown in FIG. 2.
  • embodiments of the present application provides a technical solution for frequency hopping with multiple beams, especially, for inter-repetition frequency hopping for the PUSCH repetition Type B transmission, which can utilize the spatial diversity of multiple beams/TRPs of PUSCH transmission to increase the reliability and robustness. More details on embodiments of the present application will be illustrated in the following text in combination with the appended drawings.
  • FIG. 3 is a flow chart illustrating a method for frequency hopping with multiple beams according to some embodiments of the present application.
  • the method is illustrated in a system level by a UE and a BS (e.g., UE 102 and BS 101 as illustrated and shown in FIG. 1) , persons skilled in the art can understand that the method implemented in the UE and that implemented in the BS can be separately implemented and incorporated by other apparatus with the like functions.
  • a BS 101 as shown in FIG. 1 may transmit configuration information to a UE 102.
  • the UE 102 may receive the configuration information from the BS 101.
  • the configuration information may indicate a mapping pattern of a plurality of spatial relation information and a number of nominal PUSCH repetitions of a PUSCH transmission using the plurality of spatial relation information.
  • Each single spatial relation information of the plurality of spatial relation information may be associated with at least one nominal PUSCH repetition.
  • the configuration information may also indicate that an inter-repetition frequency hopping mechanism is used for the PUSCH transmission.
  • the PUSCH transmission may be a PUSCH repetition Type B transmission.
  • the first and second spatial relation information are applied to the first and second nominal PUSCH repetitions, respectively, and the same mapping pattern continues to the remaining nominal PUSCH repetitions.
  • the cyclical mapping pattern might be #1#2#1#2#1#2#1#2...for a sequence of nominal PUSCH repetitions.
  • the sequential mapping pattern is configured, the first spatial relation information is applied to the first and second nominal PUSCH repetitions, and the second spatial relation information is applied to the third and fourth nominal PUSCH repetitions, and the same mapping pattern continues to the remaining transmit units.
  • the sequential mapping pattern might be #1#1#2#2#1#1#2#2...for a sequence of nominal PUSCH repetitions.
  • this example illustrates two spatial relation information, persons skilled in the art can understand the above rules are also applied for other numbers of spatial relation information more than two spatial relation information.
  • the BS 101 may transmit the configuration information by at least one RRC signaling. Therefore, the UE may receive the configuration information via at least one RRC singling.
  • the configuration may be transmitted by only one RRC signaling.
  • the configuration information indicating the mapping pattern may be transmitted via one RRC signaling and the configuration information indicating the inter-repetition frequency hopping mechanism is used for the PUSCH transmission may be transmitted via another RRC signaling.
  • the UE 102 may associate each nominal PUSCH repetition with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern. Once the association between a nominal PUSCH repetition and a corresponding spatial relation information is determined, all actual PUSCH repetition (s) within the nominal PUSCH repetition may also be associated with the same corresponding spatial relation information. For example, the UE 102 may associate all actual PUSCH repetition (s) within the each nominal PUSCH repetition to the corresponding spatial relation information associated with the single nominal PUSCH repetition.
  • the UE 102 may associate the nominal PUSCH repetitions 0, 1, 2, and 3 with the spatial relation information #1, #2, #1, and #2, respectively. Then, all actual PUSCH repetition (s) within the nominal PUSCH repetition 0 may be associated with the spatial relation information #1, all actual PUSCH repetition (s) within the nominal PUSCH repetition 1 may be associated with the spatial relation information #2, all actual PUSCH repetition (s) within the nominal PUSCH repetition 2 may be associated with the spatial relation information #1, and all actual PUSCH repetition (s) within the nominal PUSCH repetition 3 may be associated with the spatial relation information #2.
  • the UE 102 may associate the nominal PUSCH repetitions 0, 1, 2, and 3 with the spatial relation information #1, #1, #2, and #2, respectively. Then, all actual PUSCH repetition (s) within the nominal PUSCH repetition 0 may be associated with the spatial relation information #1, all actual PUSCH repetition (s) within the nominal PUSCH repetition 1 may be associated with the spatial relation information #1, all actual PUSCH repetition (s) within the nominal PUSCH repetition 2 may be associated with the spatial relation information #2, and all actual PUSCH repetition (s) within the nominal PUSCH repetition 3 may be associated with the spatial relation information #2.
  • the BS 101 may also associate each nominal PUSCH repetition with a corresponding spatial relation information of the plurality of spatial relation information based on the mapping pattern. Once the association between a nominal PUSCH repetition and a corresponding spatial relation information is determined, all actual PUSCH repetition (s) within the nominal PUSCH repetition may also be associated with the same corresponding spatial relation information. For example, the BS 101 may associate all actual PUSCH repetition (s) within the each nominal PUSCH repetition to the corresponding spatial relation information associated with the single nominal PUSCH repetition.
  • the UE 102 may determine a new index for each nominal PUSCH repetition of the at least one nominal PUSCH repetitions associated with the single spatial relation information.
  • a range of the new index for each nominal PUSCH repetition of the at least one nominal PUSCH repetition associated with the single spatial relation information is from 0 to N, wherein N is a total number of the at least one nominal PUSCH repetition associated with the single spatial relation information minus 1.
  • the at least one nominal PUSCH repetition associated with the single spatial relation information may be indexed ascendingly in an order of original indexes of the at least one nominal PUSCH repetition.
  • the UE 102 may associate the nominal PUSCH repetitions 0, 1, 2, and 3 with the spatial relation information #1, #2, #1, and #2, respectively. That is, for the spatial relation information #1, the nominal PUSCH repetitions 0 and 2 may be associated with it.
  • the nominal PUSCH repetition indexes "0" and "2" are the original indexes of the nominal PUSCH repetitions.
  • the UE may determine the new indexes for the nominal PUSCH repetitions 0 and 2 associated with the spatial relation information #1 to be "0" and "1, " respectively.
  • the nominal PUSCH repetitions 1 and 3 may be associated with it.
  • the nominal PUSCH repetition indexes "1" and “3" are the original indexes of the nominal PUSCH repetitions.
  • the UE may determine the new indexes for the nominal PUSCH repetitions 1 and 3 associated with the spatial relation information #2 to be "0" and "1, " respectively.
  • the BS 101 may determine a new index for each nominal PUSCH repetition of the at least one nominal PUSCH repetitions associated with the single spatial relation information.
  • a range of the new index for each nominal PUSCH repetition of the at least one nominal PUSCH repetition associated with the single spatial relation information is from 0 to N, wherein N is a total number of the at least one nominal PUSCH repetition associated with the single spatial relation information minus 1.
  • the at least one nominal PUSCH repetition associated with the single spatial relation information may be indexed ascendingly in an order of original indexes of the at least one nominal PUSCH repetition.
  • the UE 102 may transmit all actual PUSCH repetition (s) within each single nominal PUSCH repetition using the spatial relation information associated with the single nominal PUSCH repetition.
  • the starting point in the frequency domain of all actual PUSCH repetition (s) within the single nominal PUSCH repetition is determined by the new index of the single nominal PUSCH repetition.
  • the starting point in the frequency domain (e.g., the starting RB) for an actual repetition within the m-th nominal repetition associated with a single spatial relation information (i.e., a single beam) may be determined by the following equation (6) .
  • m is the new index of a nominal PUSCH repetition of the at least one nominal PUSCH repetitions associated with a single spatial relation information as determined in step 304, and RB start (m) is the starting RB for an actual repetition within the m-th nominal repetition associated with the single spatial relation information;
  • RB start is the starting resource block (RB) within the UL BWP, as calculated from the resource block assignment information of resource allocation type 1 (described in subclause 6.1.2.2.2 of TS38.214) ;
  • RB offset is the frequency offset in RBs between the two frequency hops.
  • the BS 101 may receive all actual PUSCH repetition (s) within each single nominal PUSCH repetition using the spatial relation information associated with the single nominal PUSCH repetition.
  • the starting point in the frequency domain of all actual PUSCH repetition (s) within the single nominal PUSCH repetition may be determined by the new index of the single nominal PUSCH repetition.
  • the starting RB for an actual repetition within the n-th nominal repetition associated with a single spatial relation information i.e., a single beam
  • a single spatial relation information i.e., a single beam
  • FIG. 4 illustrates an example of applying an inter-repetition frequency hopping mechanism for PUSCH transmission using multiple beams according to some other embodiments of the present application.
  • the two spatial relation information may represent two beams, e.g., beam 401 and beam 402.
  • Beam 401 may correspond to the link from a UE to a first TRP
  • beam 402 may correspond to the link from the UE to a second TRP.
  • the four nominal PUSCH repetitions shown in FIG. 4 are nominal PUSCH repetition 4000, nominal PUSCH repetition 4001, nominal PUSCH repetition 4002, and nominal PUSCH repetition 4003.
  • the nominal PUSCH repetition 4000 may include two actual PUSCH repetitions numbered as 0 and 1.
  • the nominal PUSCH repetition 4001 may include two actual PUSCH repetitions numbered as 2 and 3.
  • the nominal PUSCH repetition 4002 may include one actual PUSCH repetition numbered as 4.
  • the nominal PUSCH repetition 4003 may include two actual PUSCH repetitions numbered as 5 and 6.
  • an inter-repetition frequency hopping mechanism is configured for the PUSCH repetition Type B transmission. Therefore, the UE may determine the new indexes for the nominal PUSCH repetitions 4000 and 4002 associated with the spatial relation information #1 (e.g., beam 401) to be "0" and "1” , respectively. Similarly, the UE may determine the new indexes for the nominal PUSCH repetitions 4001 and 4003 associated with the spatial relation information #2 (e.g., beam 402) to be "0" and "1” , respectively.
  • the spatial relation information #1 e.g., beam 401
  • the UE may determine the new indexes for the nominal PUSCH repetitions 4001 and 4003 associated with the spatial relation information #2 (e.g., beam 402) to be "0" and "1” , respectively.
  • the UE 102 may use the new index to determine the starting RB of all actual PUSCH repetitions based on the above equation (6) .
  • the start RB for actual PUSCH repetitions 0 and 1 within nominal PUSCH repetition 4000 is RB start (which is represented by RB start1 in FIG. 4) by substituting the new index "0" of the nominal PUSCH repetition 4000 into equation (6)
  • the start RB for actual PUSCH repetitions 2 and 3 within nominal PUSCH repetition 4001 is RB start by substituting the new index "0" of the nominal PUSCH repetition 4001 into the equation (6)
  • the start RB for actual PUSCH repetition 4 within nominal PUSCH repetition 4002 is (which is represented by RB start2 in FIG.
  • the start RB for actual PUSCH repetitions 5 and 6 within nominal PUSCH repetition 4003 is by substituting the new index "1" of the nominal PUSCH repetition 4003 into the equation (6) .
  • the actual PUSCH repetitions 0 and 1 within the nominal PUSCH repetition 4000 and the actual PUSCH repetition 4 within the nominal PUSCH repetition 4002 transmitted using the same beam 401 may occupy the different frequency resource
  • the actual PUSCH repetitions 2 and 3 within the nominal PUSCH repetition 4001 and the actual PUSCH repetitions 5 and 6 within the nominal PUSCH repetition 4003 transmitted using the same beam 402 may occupy the different frequency resource, thereby getting the frequency diversity.
  • FIG. 5 illustrates an example of applying an inter-repetition frequency hopping mechanism for PUSCH transmission using multiple beams according to some other embodiments of the present application.
  • the two spatial relation information may represent two beams, e.g., beam 501 and beam 502.
  • Beam 501 may correspond to the link from a UE to a first TRP
  • beam 502 may correspond to the link from the UE to a second TRP.
  • the four nominal PUSCH repetitions shown in FIG. 5 are nominal PUSCH repetition 5000, nominal PUSCH repetition 5001, nominal PUSCH repetition 5002, and nominal PUSCH repetition 5003.
  • the nominal PUSCH repetition 5000 may include two actual PUSCH repetitions numbered as 0 and 1.
  • the nominal PUSCH repetition 5001 may include two actual PUSCH repetitions numbered as 2 and 3.
  • the nominal PUSCH repetition 5002 may include one actual PUSCH repetition numbered as 4.
  • the nominal PUSCH repetition 5003 may include two actual PUSCH repetitions numbered as 5 and 6.
  • a sequential mapping pattern may be configured for the PUSCH repetition Type B transmission. Therefore, the UE may determine that the spatial relation information #1 (e.g., beam 501) may be associated with the nominal PUSCH repetitions 5000 and 5001, the spatial relation information #2 (e.g., beam 502) may be associated with the nominal PUSCH repetition 5002 and 5003. That is, the actual PUSCH repetitions 0 and 1 within the nominal PUSCH repetitions 5000 and the actual PUSCH repetitions 2 and3 within the nominal PUSCH repetitions 5001 may be transmitted by beam 501, while the actual PUSCH repetition 4 within the nominal PUSCH repetitions 5002 and the actual PUSCH repetitions 5 and 6 within the nominal PUSCH repetitions 5003 may be transmitted by beam 502.
  • the spatial relation information #1 e.g., beam 501
  • the spatial relation information #2 e.g., beam 502
  • an inter-repetition frequency hopping mechanism is configured for the PUSCH repetition Type B transmission. Therefore, the UE may determine the new indexes for the nominal PUSCH repetitions 5000 and 5001 associated with the spatial relation information #1 (e.g., beam 501) to be "0" and "1” , respectively. Similarly, the UE may determine the new indexes for the nominal PUSCH repetitions 5002 and 5003 associated with the spatial relation information #2 (e.g., beam 502) to be "0" and "1” , respectively.
  • the UE 102 may use the new index to determine the start RB of all actual PUSCH repetitions based on the above equation (6) .
  • the start RB for actual PUSCH repetitions 0 and 1 within nominal PUSCH repetition 5000 is RB start (which is represented by RB start1 in FIG. 5) by substituting the new index "0" of the nominal PUSCH repetition 5000 into equation (6) , the start RB for actual PUSCH repetitions 2 and 3 within nominal PUSCH repetition 5001 is (which is represented by RB start2 in FIG.
  • the start RB for actual PUSCH repetition 4 within nominal PUSCH repetition 5002 is RB start by substituting the new index "0" of the nominal PUSCH repetition 5002 into the equation (6)
  • the start RB for actual PUSCH repetitions 5 and 6 within nominal PUSCH repetition 5003 is by substituting the new index "1" of the nominal PUSCH repetition 5003 into the equation (6) .
  • the actual PUSCH repetitions 0 and 1 within the nominal PUSCH repetition 5000 and the actual PUSCH repetitions 2 and 3 within the nominal PUSCH repetition 5001 transmitted using the same beam 501 may occupy the different frequency resource
  • the actual PUSCH repetition 4 within the nominal PUSCH repetition 5002 and the actual PUSCH repetitions 5 and 6 within the nominal PUSCH repetition 5003 transmitted using the same beam 502 may occupy the different frequency resource, thereby getting the frequency diversity.
  • the apparatus 600 may include at least one non-transitory computer-readable medium 602, at least one receiving circuitry 604, at least one transmitting circuitry 606, and at least one processor 608.
  • at least one receiving circuitry 604 and at least one transmitting circuitry 606 and be integrated into at least one transceiver.
  • the at least one non-transitory computer-readable medium 602 may have computer executable instructions stored therein.
  • the at least one processor 608 may be coupled to the at least one non-transitory computer-readable medium 602, the at least one receiving circuitry 604 and the at least one transmitting circuitry 606.
  • the computer executable instructions can be programmed to implement a method with the at least one receiving circuitry 604, the at least one transmitting circuitry 606 and the at least one processor 608.
  • the method can be a method according to an embodiment of the present application, for example, the method shown in FIG. 3.
  • the method according to embodiments of the present application can also be implemented on a programmed processor.
  • the controllers, flowcharts, and modules may also be implemented on a general purpose or special purpose computer, a programmed microprocessor or microcontroller and peripheral integrated circuit elements, an integrated circuit, a hardware electronic or logic circuit such as a discrete element circuit, a programmable logic device, or the like.
  • any device on which resides a finite state machine capable of implementing the flowcharts shown in the figures may be used to implement the processor functions of this application.
  • an embodiment of the present application provides an apparatus for emotion recognition from speech, including a processor and a memory.
  • Computer programmable instructions for implementing a method for emotion recognition from speech are stored in the memory, and the processor is configured to perform the computer programmable instructions to implement the method for emotion recognition from speech.
  • the method may be a method as stated above or other method according to an embodiment of the present application.
  • An alternative embodiment preferably implements the methods according to embodiments of the present application in a non-transitory, computer-readable storage medium storing computer programmable instructions.
  • the instructions are preferably executed by computer-executable components preferably integrated with a network security system.
  • the non-transitory, computer-readable storage medium may be stored on any suitable computer readable media such as RAMs, ROMs, flash memory, EEPROMs, optical storage devices (CD or DVD) , hard drives, floppy drives, or any suitable device.
  • the computer-executable component is preferably a processor but the instructions may alternatively or additionally be executed by any suitable dedicated hardware device.
  • an embodiment of the present application provides a non-transitory, computer-readable storage medium having computer programmable instructions stored therein.
  • the computer programmable instructions are configured to implement a method for emotion recognition from speech as stated above or other method according to an embodiment of the present application.

Abstract

La présente invention porte, dans certains de ses modes de réalisation, sur un procédé et un appareil de sauts de fréquence multi-faisceaux. Un procédé donné à titre d'exemple comprend les étapes consistant à : recevoir des informations de configuration indiquant un motif de mappage d'une pluralité d'informations de relation spatiale, un certain nombre de répétitions PUSCH nominales d'une transmission PUSCH à l'aide de la pluralité d'informations de relation spatiale, chaque information de relation spatiale unique étant associée à au moins une répétition PUSCH nominale ; déterminer, pour chaque information de relation spatiale unique, un nouvel indice pour chaque répétition PUSCH nominale associée aux informations de relation spatiale unique ; et transmettre la totalité des répétitions PUSCH réelles au sein de chaque répétition PUSCH nominale unique à l'aide des informations de relation spatiale associées, un point de départ dans le domaine fréquentiel de la totalité des répétitions PUSCH réelles au sein de la répétition PUSCH nominale unique étant déterminé par le nouvel indice de la répétition PUSCH nominale unique. Les modes de réalisation de la présente invention peuvent améliorer la fiabilité et la robustesse d'une transmission PUSCH.
PCT/CN2020/099967 2020-07-02 2020-07-02 Procédé et appareil de sauts de fréquence multi-faisceaux WO2022000431A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/099967 WO2022000431A1 (fr) 2020-07-02 2020-07-02 Procédé et appareil de sauts de fréquence multi-faisceaux

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/099967 WO2022000431A1 (fr) 2020-07-02 2020-07-02 Procédé et appareil de sauts de fréquence multi-faisceaux

Publications (1)

Publication Number Publication Date
WO2022000431A1 true WO2022000431A1 (fr) 2022-01-06

Family

ID=79317253

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/099967 WO2022000431A1 (fr) 2020-07-02 2020-07-02 Procédé et appareil de sauts de fréquence multi-faisceaux

Country Status (1)

Country Link
WO (1) WO2022000431A1 (fr)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190281588A1 (en) * 2018-06-11 2019-09-12 Intel Corporation Enhanced uplink beam management
US20190319823A1 (en) * 2018-04-13 2019-10-17 Qualcomm Incorporated Uplink multi-beam operation

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190319823A1 (en) * 2018-04-13 2019-10-17 Qualcomm Incorporated Uplink multi-beam operation
US20190281588A1 (en) * 2018-06-11 2019-09-12 Intel Corporation Enhanced uplink beam management

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
INTEL CORPORATION: "Discussion on multi-beam enhancements", 3GPP DRAFT; R1-1910669 DISCUSSION ON MULTI-BEAM ENHANCEMENTS, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Chongqing, China; 20191014 - 20191018, 5 October 2019 (2019-10-05), Mobile Competence Centre ; 650, route des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France , XP051789461 *

Similar Documents

Publication Publication Date Title
US11540325B2 (en) Method and apparatus for random access on a wireless communication network
US20210185674A1 (en) Method for transmitting configuration information and terminal device
EP3393074A1 (fr) Dispositif et procédé permettant de manipuler des espaces de recherche commune
WO2021062602A1 (fr) Procédé et dispositif de partage du temps d'occupation des canaux sur le spectre sans licence
US20220247520A1 (en) Method and apparatus for hybrid automatic repeat request procedure
EP3949229B1 (fr) Procédé et appareil permettant de surveiller des canaux de commande candidats
US20220418000A1 (en) Communication methods and apparatuses
WO2020164155A1 (fr) Procédé et appareil de mise en correspondance de ressources dans un spectre sans licence
WO2023050402A1 (fr) Procédé et appareil de détermination de faisceau
WO2022000431A1 (fr) Procédé et appareil de sauts de fréquence multi-faisceaux
US20220256578A1 (en) Method and Apparatus for Overhead Reduction for Configured Grant Based Uplink Transmission
WO2022000125A1 (fr) Procédé et appareil de mappage de répétitions pusch
WO2022073231A1 (fr) Procédé et appareil de transmission pusch avec répétition
CN115280870A (zh) 用于pdcch重复的方法及设备
WO2023206416A1 (fr) Procédés et appareils de programmation de multiples transmissions de canal physique partagé de liaison descendante (pdsch)
WO2022082563A1 (fr) Procédé et appareil pour une transmission de pucch avec répétitions
WO2023050356A1 (fr) Procédés et appareils de mappage de vrb à prb
WO2023150911A1 (fr) Procédés et appareils de transmission de liaison latérale dans un spectre sans licence
WO2024073981A1 (fr) Procédé et appareil pour prendre en charge de multiples csi dans un rapport de csi
WO2023168700A1 (fr) Procédé et appareil de commutation d'état de précodage de transformée pour un pusch
WO2023283877A1 (fr) Procédé et appareil de transmission de canal de commande de liaison montante physique (pucch)
WO2024087630A1 (fr) Procédé et appareil de prise en charge de transmissions de liaison montante
WO2023283876A1 (fr) Procédé et appareil de transmission en liaison montante
WO2022077443A1 (fr) Procédés et appareils de transmission à multiples trp
WO2022205302A1 (fr) Procédé et appareil de transmission pusch avec répétitions

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

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

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 21/04/2023)

122 Ep: pct application non-entry in european phase

Ref document number: 20942678

Country of ref document: EP

Kind code of ref document: A1