WO2023011008A1 - 一种加扰、解扰方法及通信装置 - Google Patents

一种加扰、解扰方法及通信装置 Download PDF

Info

Publication number
WO2023011008A1
WO2023011008A1 PCT/CN2022/098690 CN2022098690W WO2023011008A1 WO 2023011008 A1 WO2023011008 A1 WO 2023011008A1 CN 2022098690 W CN2022098690 W CN 2022098690W WO 2023011008 A1 WO2023011008 A1 WO 2023011008A1
Authority
WO
WIPO (PCT)
Prior art keywords
scrambling code
information
rnti
time
time parameter
Prior art date
Application number
PCT/CN2022/098690
Other languages
English (en)
French (fr)
Inventor
罗之虎
金哲
曲韦霖
侯海龙
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2023011008A1 publication Critical patent/WO2023011008A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/10—Code generation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks

Definitions

  • the present application relates to the field of wireless communication, and in particular to a scrambling and descrambling method and a communication device.
  • the fifth-generation (the fifth-generation, 5G) mobile communication technology new radio (new radio, NR) is a global 5G standard based on a new air interface design based on orthogonal frequency division multiplexing (OFDM).
  • OFDM orthogonal frequency division multiplexing
  • physical downlink shared channel (physical downlink shared channel, PDSCH), physical uplink shared channel (physical uplink shared channel, PUSCH), physical downlink control channel (physical downlink control channel, PDCCH), Resources occupied by a physical uplink control channel (physical uplink control channel, PUCCH) in the time domain are usually limited to one slot.
  • the resource position of PDSCH/PUSCH/PDCCH/PUCCH in a time slot can be determined by the starting OFDM symbol position and the number of continuous OFDM symbols in a time slot.
  • Figure 1 is a schematic diagram of time-domain resource allocation in a time slot
  • S represents the index of the OFDM symbol that PDSCH/PUSCH/PDCCH/PUCCH starts in a time slot
  • L represents the number of OFDM symbols that PDSCH/PUSCH/PDCCH/PUCCH lasts
  • PDSCH/PUSCH/PDCCH/PUCCH starts from OFDM symbol 3 and lasts for 11 OFDM symbols.
  • the coded bits need to perform scrambling operation to realize interference randomization.
  • the scrambling operation is to perform a modulo 2 addition operation on the coded bits and scrambled bits of the PDSCH/PUSCH/PDCCH/PUCCH.
  • b(i) represents coding bits
  • c(i) represents scrambling code bits
  • PDSCH/PUSCH/PDCCH/PUCCH supports time slot-based aggregation/repetition, and the same content can be repeatedly transmitted in multiple time slots, that is, the transmission block carried by PDSCH/PUSCH/PDCCH/PUCCH ( transport block, TB) repeated transmission over multiple time slots.
  • Fig. 2 is a schematic diagram of repeated transmission of PDSCH/PUSCH/PDCCH/PUCCH, 8 time slots are occupied by 8 times of repetition, and time domain resource allocation in 8 time slots is the same, that is, S and L are the same.
  • PDSCH/PUSCH/PDCCH/PUCCH uses the same scrambling code for each repeated transmission in multiple repeated transmissions, which will affect the interference randomization effect, and then affect the performance of receiving devices receiving PDSCH/PUSCH/PDCCH/PUCCH .
  • Embodiments of the present application provide a scrambling and descrambling method and a communication device, which are used to improve the anti-interference capability of signal transmission through scrambling.
  • an embodiment of the present application provides a scrambling method, including: the first device generates a scrambling code according to a time parameter, and scrambles the first information according to the scrambling code; The second device sends the scrambled first information.
  • the scrambling code is generated according to the time parameter, and the scrambling code determined by different time parameters is different, thus reducing the possibility that the first device uses the same scrambling code to scramble the same first information within a period of time performance, thereby improving the anti-interference ability of the first information transmission, and further improving the performance of the second device receiving the first information.
  • the first device determines the foregoing time parameter according to a time domain resource used for sending the first information.
  • a method for determining the time parameter is provided.
  • the time parameter is related to the time domain resource for sending the first information.
  • the time parameter is determined according to time domain resources used for sending the first information.
  • the first device determines the time parameter according to a position of the time domain resource for sending the first information in the time domain resource in the n repeated transmissions.
  • a method for determining a time parameter is provided.
  • the time parameter determined by this implementation is related to the position of the first information sent this time in the n repeated transmissions, and is a relative time parameter. Different repetitions have different positions in the n repeated transmissions, so different time parameters can be determined, and further, different scrambling codes determined according to different time parameters are different.
  • the time parameter is determined in this way, so that the first device can generate the scrambled first information in advance, so as to send it when the channel is determined to be idle.
  • the first information after scrambling can be prepared in advance, and the channel can be sent at any time when it is free.
  • the time parameter is determined according to a position of the time domain resource for sending the first information in the time domain resource in the n repeated transmissions.
  • the time parameter determined by the first device is an absolute time parameter.
  • the time parameter includes at least one or any combination of the following parameters: radio frame number, field frame number, subframe number, time slot number, and symbol number.
  • the first information is repeatedly transmitted n times, and the scrambling code for k repeated transmissions in the n repeated transmissions is the same, where n and k are positive integers.
  • the same scrambling code is used for every k repeated transmissions in n times of repeated transmissions.
  • k is greater than 1, the number of scrambling code generation times can be reduced, thereby reducing the complexity of generating scrambling codes by the first device.
  • redundancy versions of the k repeated transmissions are different.
  • different redundant versions are used for k repeated transmissions, and different coded bits can be obtained through different redundant versions.
  • Incremental redundancy merging between different redundant versions can improve the performance of repeated transmissions, k
  • the repeated transmission uses the same scrambling code, which will not affect the interference randomization effect.
  • k is 2 or 4.
  • the first device when it generates the scrambling code according to the time parameter, it may generate the scrambling code according to the time parameter and a radio network temporary identity (RNTI); or, may generate the scrambling code according to the time parameter and the scrambling code.
  • RNTI radio network temporary identity
  • the scrambling code can be generated according to the code identifier; or, the scrambling code can also be generated according to the time parameter, the RNTI and the scrambling code identifier.
  • the first device when generating the scrambling code according to the time parameter, may generate the scrambling code according to the product of the time parameter and the RNTI; and/or, the first device may generate the scrambling code according to the time parameter and the scrambling code identifier
  • the scrambling code can be generated according to the product of the time parameter and the scrambling code identifier.
  • the scrambling codes determined by different time parameters are different, so the possibility that the first device uses the same scrambling code to scramble the same first information within a period of time can be reduced.
  • the first The device generates the scrambling code according to the product of the time parameter and the RNTI, and/or, generates the scrambling code according to the product of the time parameter and the scrambling code identifier.
  • the degree of the scrambling code is different at different times, which can improve the resistance of the first information transmission. Interference capability, thereby improving the performance of the second device for receiving the first information.
  • the foregoing first channel includes any one of the following channels: PDSCH, PUSCH, PDCCH, and PUCCH.
  • the first device when the first channel is PDSCH, the first device generates a scrambling code according to a time parameter, including:
  • c init (k 0 n RNTI +k 1 ) 2 a +((k 2 n rep +k 3 )modb+k 4 ) 2 c +k 5 n ID +k 6 ; or
  • c init (k 0 ⁇ n RNTI +k 1 ) ⁇ ((k 2 ⁇ n rep +k 3 )moda+k 4 ) ⁇ 2 b +k 5 ⁇ n ID +k 6 ; or
  • c init (k 0 ⁇ n RNTI +k 1 ) ⁇ 2 a +(k 2 ⁇ q+k 3 ) ⁇ 2 b +((k 4 ⁇ n rep +k 5 )modc+k 6 ) ⁇ 2 d + k 7 n ID +k 8 ; or
  • c init (k 0 ⁇ n RNTI +k 1 ) ⁇ 2 a +(k 2 ⁇ q+k 3 ) ⁇ 2 b +((k 4 ⁇ n rep +k 5 )modc+k 6 ) ⁇ (k 7 n ID +k 8 ); or
  • n RNTI is the RNTI associated with the PDSCH;
  • n rep is an index number of repeated transmission times;
  • n ID is a scrambling code identifier or a physical layer cell identifier;
  • a, b, c, d are constants, k 0 , k 1 , k 2 , k 3 , k 4 , k 5 , k 6 , k 7 , k 8 , k 9 , k 10 are constants;
  • the first device when the first channel is PUSCH, the first device generates a scrambling code according to a time parameter, including:
  • c init (k 0 n RNTI +k 1 ) 2 a +((k 2 n rep +k 3 )modb+k 4 ) 2 c+k 5 n ID +k 6 ; or
  • c init (k 0 n RNTI +k 1 ) ((k 2 n rep +k 3 )moda+k 4 ) 2 c+k 5 n ID +k 6 ; or
  • n RNTI is the RNTI associated with the PUSCH;
  • n rep is an index number of repeated transmission times;
  • n ID is a scrambling code identifier or a physical layer cell identifier;
  • n f is a radio frame number; Configure the number of time slots contained in each radio frame under ⁇ for subcarriers; is the number of symbols contained in each slot; is the time slot number;
  • l is the number of the starting symbol of the scrambled first information in the time slot;
  • a, b, c are constants, k 0 , k 1 , k 2 , k 3 , k 4 , k 5 , k 6 , k 7 , and k 8 are constants;
  • the first device when the first channel is a PDCCH, the first device generates a scrambling code according to a time parameter, including:
  • c init ((k 0 ⁇ n RNTI +k 1 ) ⁇ 2 a +((k 2 ⁇ n rep +k 3 )modb+k 4 ) ⁇ 2 c+k 5 ⁇ n ID +k 6 )mod 2 d ;or
  • c init ((k 0 ⁇ n RNTI +k 1 ) ⁇ ((k 2 ⁇ n rep +k 3 )moda+k 4 ) ⁇ 2 b +k 5 ⁇ n ID +k 6 ) mod 2 c ; or
  • n RNTI is the RNTI associated with the PDCCH;
  • n rep is an index number of repeated transmission times;
  • n ID is a scrambling code identifier or a physical layer cell identifier;
  • a, b, c, d are constants, k 0 , k 1 , k 2 , k 3 , k 4 , k 5 , k 6 , k 7 , k 8 are constants;
  • the first device when the first channel is PUCCH, the first device generates a scrambling code according to a time parameter, including:
  • c init (k 0 n RNTI +k 1 ) 2 a +((k 2 n rep +k 3 )modb+k 4 ) 2 c +k 5 n ID +k 6 ; or
  • c init (k 0 ⁇ n RNTI +k 1 ) ⁇ ((k 2 ⁇ n rep +k 3 )moda+k 4 ) ⁇ 2 b +k 5 ⁇ n ID +k 6 ; or
  • n RNTI is the RNTI associated with the PUCCH;
  • n rep is an index number of repeated transmission times;
  • n ID is a scrambling code identifier or a physical layer cell identifier;
  • n f is a radio frame number; Configure the number of time slots contained in each radio frame under ⁇ for subcarriers; is the number of symbols contained in each slot; is the time slot number;
  • l is the number of the starting symbol of the scrambled first information in the time slot;
  • a, b, c are constants, k 0 , k 1 , k 2 , k 3 , k 4 , k 5 , k 6 , k 7 , and k 8 are constants;
  • the embodiment of the present application provides a descrambling method, including: the first device generates a scrambling code according to a time parameter; the first device descrambles the information received on the first channel according to the scrambling code , to get the first message.
  • the scrambling code is generated according to the time parameter, and the scrambling code determined by different time parameters is different, thus reducing the possibility that the first device uses the same scrambling code to scramble the same first information within a period of time performance, thereby improving the anti-interference ability of the first information transmission, and further improving the performance of the second device receiving the first information.
  • the method further includes: the first device determining the time parameter according to a time domain resource used to receive the first information.
  • the determining, by the first device, the time parameter according to the time domain resource used to receive the first information includes: The position of the resource in the time domain resource in the n repeated transmissions determines the time parameter.
  • the time parameter includes at least one or any combination of the following parameters: radio frame number, field frame number, subframe number, time slot number, and symbol number.
  • the first information is repeatedly transmitted n times, and the scrambling code for k repeated transmissions in the n repeated transmissions is the same, where n and k are positive integers.
  • redundancy versions of the k repeated transmissions are different.
  • the k is 2 or 4.
  • the first device generating a scrambling code according to a time parameter includes: generating a scrambling code according to the time parameter and a wireless network temporary identifier RNTI; or generating a scrambling code according to the time parameter and a scrambling code identifier A scrambling code; or, generating a scrambling code according to the time parameter, the RNTI, and the scrambling code identifier.
  • the generating the scrambling code according to the time parameter and the RNTI includes: generating the scrambling code according to the product of the time parameter and the RNTI; and/or, the generating the scrambling code according to the time parameter and the RNTI Generating a scrambling code with the code identifier includes: generating a scrambling code according to a product of the time parameter and the scrambling code identifier.
  • the first channel includes any one of the following channels: a physical downlink shared channel PDSCH, a physical uplink shared channel PUSCH, a physical downlink control channel PDCCH, and a physical uplink control channel PUCCH.
  • the embodiment of the present application provides a communication device, the device includes modules/units that perform the methods of the above-mentioned first aspect and any possible implementation manner of the first aspect; these modules/units can be implemented by hardware, Corresponding software implementation can also be executed by hardware.
  • the communication device may include a generating module, configured to generate a scrambling code according to a time parameter; a scrambling module, configured to scramble the first information according to the scrambling code; and a sending module, configured to transmit the scrambling code on the first channel to The second device sends the scrambled first information.
  • a generating module configured to generate a scrambling code according to a time parameter
  • a scrambling module configured to scramble the first information according to the scrambling code
  • a sending module configured to transmit the scrambling code on the first channel to The second device sends the scrambled first information.
  • an embodiment of the present application provides a communication device, the device includes a module/unit for performing the method of the above-mentioned second aspect and any possible implementation manner of the second aspect; these modules/units may be implemented by hardware, Corresponding software implementation can also be executed by hardware.
  • the communication device may include a generating module, configured to generate a scrambling code according to a time parameter; a receiving module, configured to receive information on a first channel; and a descrambling module, configured to generate a scrambling code on the first channel according to the scrambling code The received information is descrambled to obtain the first information.
  • a generating module configured to generate a scrambling code according to a time parameter
  • a receiving module configured to receive information on a first channel
  • a descrambling module configured to generate a scrambling code on the first channel according to the scrambling code The received information is descrambled to obtain the first information.
  • the embodiment of the present application provides a communication device, including: a processor, and a memory and a communication interface respectively coupled to the processor; the communication interface is used to communicate with other devices; the processor , for running an instruction or a program in the memory, and executing the scrambling method according to the first aspect and any possible implementation manner of the first aspect through the communication interface.
  • the embodiment of the present application provides a communication device, including: a processor, and a memory and a communication interface respectively coupled to the processor; the communication interface is used to communicate with other devices; the processor , for running instructions or programs in the memory, and executing the descrambling method according to the second aspect and any possible implementation manner of the second aspect through the communication interface.
  • an embodiment of the present application provides a computer-readable storage medium, where computer-readable instructions are stored in the computer-readable storage medium, and when the computer-readable instructions are run on a computer, the first The method described in the aspect, the second aspect, and any possible implementation manner is executed.
  • the embodiment of the present application provides a computer program product containing instructions, when it is run on a computer, the method as described in the first aspect, the second aspect and any possible implementation manner is executed .
  • FIG. 1 is a schematic diagram of time-domain resource allocation of a first channel within a time slot provided by an embodiment of the present application
  • FIG. 2 is a schematic diagram of repeated transmission of the first channel provided by the embodiment of the present application.
  • FIG. 3 is a schematic diagram of an interference signal when the first channel is repeatedly transmitted according to an embodiment of the present application
  • FIG. 4 is a schematic diagram of a communication system architecture provided by an embodiment of the present application.
  • FIG. 5 is a schematic flowchart of a scrambling method provided in an embodiment of the present application.
  • Fig. 6 is a schematic diagram of a specific embodiment provided by the embodiment of the present application.
  • Fig. 7 is a schematic diagram of another specific embodiment provided by the embodiment of the present application.
  • FIG. 8 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • FIG. 9 is a schematic structural diagram of another communication device provided by an embodiment of the present application.
  • FIG. 10 is a schematic structural diagram of another communication device provided by an embodiment of the present application.
  • PDSCH/PUSCH/PUCCH supports slot-based aggregation/repetition, that is, TBs carried by PUSCH/PDSCH/PUCCH are repeated on consecutive slots.
  • this repetition mode is called slot aggregation (slot aggregation), and the number of slots occupied by slot aggregation is configured by the parameter aggregation factor (pdsch-AggregationFactor).
  • slot aggregation For PUSCH, this repetition is called slot aggregation or Type A repetition, and the number of repetitions is configured by the parameter aggregation factor (pusch-AggregationFactor) or number of repetitions (numberOfRepetitions).
  • this repetition is called PUCCH repetition, and the number of time slots occupied by repeated transmission is configured by the parameter number of time slots (nrofSlots).
  • time slot aggregation Type A repetition, PUCCH repetition, or other repetition methods (such as Type B repetition, etc.)
  • Type B repetition or other repetition methods
  • the embodiment of the present application provides a scrambling method, which is used to improve the signal-to-interference ratio in a scenario of repeated transmission, and improve the gain effect of repeated transmission.
  • the method can be applied to the communication system architecture as shown in FIG. 4.
  • the communication system architecture includes network equipment and terminal equipment.
  • the network device is a radio access network (radio access network, RAN) device, and the radio access network device may also be called an access network device or a base station, and is used for connecting a terminal device to a wireless network.
  • the wireless access network may be a base station (base station), an evolved base station (evolved NodeB, eNodeB) in an LTE system or an evolved LTE system (LTE-Advanced, LTE-A), or a next-generation base station in a 5G communication system (next generation NodeB, gNB), transmission reception point (transmission reception point, TRP), base band unit (base band unit, BBU), WiFi access point (access point, AP), base station or WiFi system in the future mobile communication system Access nodes in etc.
  • the radio access network combination may also be a module or unit that completes some functions of the base station, for example, it may be a centralized unit (central unit, CU) or a distributed unit (distributed unit, DU).
  • the CU here completes the functions of the radio resource control protocol and the packet data convergence protocol (PDCP) of the base station, and also completes the function of the service data adaptation protocol (SDAP); the DU completes the functions of the base station
  • the functions of the radio link control layer and the medium access control (medium access control, MAC) layer can also complete the functions of part of the physical layer or all of the physical layer.
  • 3GPP third generation partnership project
  • the radio access network equipment may be a macro base station, a micro base station or an indoor station, or a relay node or a donor node.
  • the embodiment of the present application does not limit the specific technology and specific equipment form adopted by the radio access network equipment.
  • the terminal equipment may also be called a terminal, a user equipment (user equipment, UE), a mobile station, a mobile terminal, and the like.
  • Terminal devices can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (internet of things, IOT), virtual reality, augmented reality, industrial control, automatic driving, telemedicine, smart grid, smart furniture, smart office, smart wear, smart transportation, smart city, etc.
  • Terminal devices can be mobile phones, tablet computers, computers with wireless transceiver functions, wearable devices, vehicles, drones, helicopters, airplanes, ships, robots, robotic arms, smart home devices, etc.
  • the embodiment of the present application does not limit the specific technology and specific device form adopted by the terminal device.
  • FIG. 4 is only an example of a scenario applicable to the scrambling method provided in the embodiment of the present application, but the scrambling method provided in the embodiment of the present application may also be applied to other scenarios where information to be sent needs to be scrambled.
  • FIG. 5 it is a schematic flow chart of the scrambling method provided by the embodiment of the present application. As shown in the figure, the method may include the following steps:
  • Step 501 the first device generates a scrambling code according to a time parameter.
  • the time parameter is determined according to the time domain resource for sending the first information.
  • the first device may determine the time parameter according to the time domain resource for sending the first information.
  • the time parameter is related to the time domain resource that sends the first information, that is, the time parameters corresponding to the first information on different time domain resources are different, so that the time parameter determined each time is different.
  • the time parameter may be an absolute time parameter, which is a corresponding time parameter when the first information is actually sent.
  • the time parameter may include at least one or any combination of the following parameters: radio frame number, field frame number, subframe number, time slot number, symbol number, and the like.
  • the time parameter is determined according to the position of the time domain resource for sending the first information in the time domain resource in the n repeated transmissions.
  • the first device may determine a corresponding time parameter according to the position of the time domain resource for sending the first information in the time domain resource in the n repeated transmissions.
  • the determined time parameter is a relative time parameter.
  • the determined relative time parameter may be a repetition number index number.
  • the first information is transmitted for the first time, and its repetition index number can be 1, that is, the relative time parameter corresponding to slot 0 is 1; in time slot 1, the first information is transmitted for the second time, its repetition index number can be 2, that is, the relative time parameter corresponding to slot 1 is 2; ...; in time slot 7, the first information is transmitted for the eighth time, and its repetition index number can be 8, that is, the relative time parameter corresponding to slot 7 is 8.
  • the above repetition index numbers may also start from 0, that is, the repetition index numbers corresponding to slots 0 to 7 are respectively 0 to 7; or, they may be values determined according to other rules.
  • the "repeat times index number” is only the name taken according to the above-mentioned determination of the relative time parameters, and other names can also be used on the basis of the above-mentioned principle of determining the relative time parameters, such as "transmission times index number", "time slot Relative slot numbers in aggregated transmissions", etc.
  • This implementation is especially applicable to the scenario where the first information is transmitted in an unlicensed spectrum, because in this scenario, the first device needs to monitor the first channel, and can only send the scrambled first channel when it is determined that the first channel is idle.
  • This method enables the first device to generate corresponding scrambling codes in advance and scramble the first information when it is uncertain about the absolute time parameters for sending the first information, and wait for the first information to be sent to the second device.
  • Step 502 the first device scrambles the first information according to the generated scrambling code.
  • the method of scrambling the information to be sent according to the generated scrambling code is similar to the common scrambling method, and will not be repeated here.
  • the scrambling may be bit-level scrambling, for example, the generated scrambling code may be modulo 2 added to the first information to be scrambled, as shown in the following formula (1) :
  • b(i) represents the coding bit of the first information
  • c(i) represents the scrambling code bit
  • the scrambling may be symbol-level scrambling.
  • the first device may first map the generated scrambling code from bit form to symbol form.
  • the mapping method is not described in the embodiment of this application. Make restrictions, such as BPSK, QPSK modulation, or other similar forms of mapping methods; then perform point-by-point multiplication or point-by-point conjugate multiplication operations on the scrambling code in symbol form and the first information to be scrambled , the first information at this time is the modulated complex symbol sequence.
  • Step 503 the first device sends the scrambled first information to the second device on the first channel.
  • the first device sends the scrambled first information to the second device on the first channel.
  • the second device receives the information on the first channel, generates a scrambling code according to the time parameter, and uses the generated scrambling code to The received information is descrambled, so as to determine the first information, and realize the communication between the first device and the second device.
  • the first device may be a network device
  • the second device may be a terminal device, that is, the above-mentioned scrambling method may be applied to downlink transmission; or, the first device may be a terminal device, and the second device may be a network device, that is, , the above scrambling method can be applied to uplink transmission.
  • the scrambling method provided by the embodiment of the present application can also be applied to other scenarios where information to be sent needs to be scrambled, so the first device and the second device can also be other than network devices and terminal devices Other devices are not limited in this embodiment of the present application.
  • the above-mentioned first channel may be PDSCH, PUSCH, PDCCH or PUCCH.
  • the scrambling codes are generated according to the time parameters, so that the scrambling codes generated according to different time parameters are different.
  • different scrambled information is obtained during multiple repeated transmissions of the first information. Since the scrambled information sent during the repeated transmission is different, the effect of interference randomization is not affected, so the scrambled information sent with different times of repeated transmission is different.
  • the scrambled information sent with different repeated transmission times may be the same, which affects the effect of interference randomization.
  • the first terminal device target UE
  • second terminal device interfering UE
  • Second information i.e. interference signal
  • the time parameter used for each generated scrambling code will change, so that each generated scrambling code is different, so that the first scrambling code after scrambling The information is different; for a network device, it is also necessary to generate a scrambling code according to a time parameter and descramble the received information, so as to obtain the first information.
  • the interfering UE may also generate a scrambling code according to the time parameter and perform scrambling, the information sent by the interfering UE during the repeated transmission is also different. It can be seen that, after adopting the above method, the effect of interference randomization in the repeated transmission process is improved, the anti-interference capability of the first information transmission is improved, and the performance of the second device receiving the first information is further improved.
  • the scrambling code used in each repeated transmission can be a scrambling code generated according to the time parameters of the current repeated transmission, so that the scrambling code used in each repeated transmission Are not the same.
  • the scrambling code is generated according to the repetition index number
  • the scrambling code when the first transmission is performed on time slot 0 (the repetition index number is 1), the scrambling code can be generated according to the repetition index number 1 and the first information can be scrambled ;
  • a scrambling code may be generated according to the repetition index number 2 and scramble the first information; and so on.
  • the scrambling code when the first transmission is made on time slot 0, the scrambling code can be generated according to the time slot number 0 and the first information is scrambled; During the second transmission on slot 1, a scrambling code may be generated according to slot number 1 and the first information may be scrambled; and so on.
  • the second device when decoding, the second device also determines a corresponding scrambling code for each repeated transmission, so as to descramble the information received on the first channel according to the scrambling code.
  • redundancy version (redundancy version, RV) may be introduced in repeated transmission, and the difference in the redundancy version will make the first information after incremental redundancy different, so the first device may not need to A new scrambling code is generated during repeated transmission, and a new scrambling code can be generated every k times of repeated transmission.
  • RV redundancy version
  • the redundant version was originally designed to implement incremental redundancy (IR) hybrid automatic repeat request (HARQ) transmission, that is, the redundant bits generated by the encoder are divided into several groups, and each RV A transmission start point is defined, and different RVs are used for the first transmission and each HARQ retransmission, so as to realize the gradual accumulation of redundant bits and complete the incremental redundant HARQ operation.
  • IR incremental redundancy
  • HARQ hybrid automatic repeat request
  • the RV can also be introduced in NR repeated transmission to realize incremental redundancy merging between different repeated transmissions.
  • the redundant version of repeated transmission can be determined according to Table 1.
  • DCI downlink control information
  • the manner of determining the RV adopted by the PUSCH, PUCCH, and PDCCH on each transmission opportunity is similar to the above-mentioned PDSCH, and will not give examples one by one here.
  • the number of redundant versions is 4, in the first to fourth repeated transmissions, the information obtained after incremental redundancy of the first information is different, which makes even in these four repeated transmissions, Even if the same scrambling code is used for scrambling, the finally obtained scrambled information will be different. Therefore, in order to reduce the number of times of scrambling code generation and simplify the operation of scrambling by the first device and descrambling by the second device, a new scrambling code can be generated every 4 times of repeated transmission, and 4 times of repeated transmission in one cycle The same scrambling code is used for scrambling.
  • the first device may generate the scrambling code 1 according to the time parameter corresponding to the time domain resource of the first repeated transmission, and in the first to fourth repeated transmissions, the scrambling code 1 is used to generate the scrambling code 1 after incremental redundancy scramble the first information; the first device can generate scrambling code 2 according to the time parameter in the fifth repeated transmission, and then in the fifth to eighth repeated transmissions, the scrambling code 2 is used for incremental redundancy After the first information is scrambled.
  • every 4 repeated transmissions of the first information every The same scrambling code is used for k repeated transmissions, where n and k are both positive integers.
  • the value of k may satisfy that redundancy versions of the k times of repeated transmissions are different. Since the redundant versions of k repeated transmissions using the same scrambling code are different, the coded bits obtained according to different redundant versions are also different. Incremental redundancy merging between different redundant versions can improve the performance of repeated transmissions. For example, the signal-to-interference ratio of repeated transmissions is prompted. For example, when the number of redundant versions is 4, k may be a positive integer not greater than 4.
  • the first device generates a new scrambling code every k repeated transmissions, and k repeated transmissions within a period use the same scrambling code to scramble the first information
  • the second device descrambles
  • a new scrambling code is also generated every k repeated transmissions, and the same scrambling code is used to descramble the received information for k repeated transmissions within a cycle.
  • the first device when it performs the above step 501, it may generate a scrambling code according to the time parameter and RNTI, or may generate a scrambling code according to the time parameter and the scrambling code identifier, or may also generate a scrambling code according to the time parameter
  • the scrambling code can be generated according to the cell identifier, or the scrambling code can also be generated according to the time parameter, the RNTI identifier and the scrambling code identifier.
  • the second device when descrambling, the second device also needs to generate a scrambling code according to the above manner, so as to decode the received information.
  • the first device may generate the scrambling code according to the product of the time parameter and the RNTI, or may generate the scrambling code according to the product of the time parameter and the scrambling code identifier (and/or cell identifier).
  • the scrambling code may also be generated according to the modulus value of the time parameter.
  • the second device when descrambling, the second device also generates a scrambling code according to the foregoing manner.
  • a scrambling code parameter c init for initializing the scrambling code may be generated first, and then the scrambling code is generated according to the scrambling code initialization parameter c init .
  • the scrambling code parameter c init may be generated according to the time parameter, or the time parameter and the RNTI, or the time parameter, the RNTI, and the scrambling code identifier, and then the scrambling code is generated according to the scrambling code parameter c init .
  • the manner of generating the scrambling code parameter is illustrated below with an example.
  • Example 1 If the time parameter is the repetition number index number and the first channel is PDSCH, the first device can perform any one of the following formulas (3), formula (4), formula (5), and formula (6) Determine the scrambling code parameter c init , and then generate a scrambling code according to the scrambling code parameter c init .
  • c init (k 0 ⁇ n RNTI +k 1 ) ⁇ ((k 2 ⁇ n rep +k 3 )moda+k 4 ) ⁇ 2 b +k 5 ⁇ n ID +k 6 (4)
  • c init (k 0 ⁇ n RNTI +k 1 ) ⁇ 2 a +(k 2 ⁇ q+k 3 ) ⁇ 2 b +((k 4 ⁇ n rep +k 3 )modc+k 6 ) ⁇ 2 d + k 7 n ID +k 8 (5)
  • c init (k 0 ⁇ n RNTI +k 1 ) ⁇ 2 a +(k 2 ⁇ q+k 3 ) ⁇ 2 b +((k 4 ⁇ n rep +k 3 )modc+k 6 ) ⁇ (k 7 n ID +k 8 ) (6)
  • n RNTI is the RNTI associated with the PDSCH, that is, the RNTI of the terminal device; n rep is the index number of repeated transmission times; n ID is the scrambling code identifier or the physical layer cell identifier; for scenarios that support up to two codeword transmissions, q ⁇ 0,1 ⁇ represents the number of codewords.
  • the above constants may be non-negative integers.
  • the second device when descrambling, the second device generates a scrambling code parameter c init according to the formula adopted by the first device, so as to generate a corresponding scrambling code for descrambling.
  • Example 2 If the time parameter is an absolute time parameter and the first channel is PDSCH, the first device can determine according to any of the following formulas (7), formula (8), formula (9), and formula (10) The scrambling code parameter c init , and then generate the scrambling code according to the scrambling code parameter c init .
  • the second device when descrambling, the second device generates a scrambling code parameter c init according to the formula adopted by the first device, so as to generate a corresponding scrambling code for descrambling.
  • Example 3 If the time parameter is the repetition index number and the first channel is PUSCH, the first device can determine the scrambling parameter c init according to any of the following formulas (11) and (12), and then according to the scrambling The code parameter c init produces a scrambling code.
  • c init (k 0 ⁇ n RNTI +k 1 ) ⁇ ((k 2 ⁇ n rep +k 3 )moda+k 4 ) ⁇ 2 c +k 5 ⁇ n ID +k 6 (12)
  • n RNTI is the RNTI associated with the PDSCH, that is, the RNTI of the terminal device; n rep is the index number of repeated transmission times; n ID is the scrambling code identifier or the physical layer cell identifier; a, b, and c are constants, and k 0 , k 1 , k 2 , k 3 , k 4 , k 5 , and k 6 are constants, and mod means modulo operation.
  • the above constants may be non-negative integers.
  • the second device when descrambling, the second device generates a scrambling code parameter c init according to the formula adopted by the first device, so as to generate a corresponding scrambling code for descrambling.
  • Example 4 If the time parameter is an absolute time parameter and the first channel is PUSCH, the first device can determine the scrambling code parameter c init according to any of the following formulas (13) and (14), and then according to the scrambling code The parameter c init generates scrambling codes.
  • n RNTI is the RNTI associated with the PDSCH, that is, the RNTI of the terminal device; n rep is the index number of repeated transmission times; n ID is the scrambling code identifier or the physical layer cell identifier; is the number of symbols contained in each slot; is the time slot number; l is the number of the starting symbol of the scrambled first information in the time slot; a, b, c are constants, k 0 , k 1 , k 2 , k 3 , k 4 , k 5 , k 6 , k 7 , and k 8 are constants, and mod means modulo operation.
  • the above constants may be non-negative integers.
  • the second device when descrambling, the second device generates a scrambling code parameter c init according to the formula adopted by the first device, so as to generate a corresponding scrambling code for descrambling.
  • the first device may determine the scrambling parameter c init according to any of the following formulas (15) and (16), and then according to the scrambling The code parameter c init produces a scrambling code.
  • n RNTI is the RNTI associated with the PDCCH, that is, the RNTI of the terminal device; n rep is the index number of repeated transmission times; n ID is the scrambling code identifier or the physical layer cell identifier; a, b, c, and d are constants, k 0 , k 1 , k 2 , k 3 , k 4 , k 5 , and k 6 are constants, and mod means modulo operation.
  • the above constants may be non-negative integers.
  • the second device when descrambling, the second device generates a scrambling code parameter c init according to the formula adopted by the first device, so as to generate a corresponding scrambling code for descrambling.
  • the first device may determine the scrambling parameter c init according to any one of the following formulas (17) and (18), and then according to the scrambling The code parameter c init produces a scrambling code.
  • n RNTI is the RNTI associated with the PDCCH, that is, the RNTI of the terminal device;
  • n rep is an index number of repeated transmission times;
  • n ID is a scrambling code identifier or a physical layer cell identifier;
  • n f is a radio frame number; Configure the number of time slots contained in each radio frame under ⁇ for subcarriers; is the number of symbols contained in each slot; is the time slot number; l is the number of the starting symbol of the scrambled first information in the time slot;
  • a, b, c are constants, k 0 , k 1 , k 2 , k 3 , k 4 , k 5 , k 6 , k 7 , and k 8 are constants, and mod means modulo operation.
  • the above constants may be non-negative integers.
  • the second device when descrambling, the second device generates a scrambling code parameter c init according to the formula adopted by the first device, so as to generate a corresponding scrambling code for descrambling.
  • the first device may determine the scrambling parameter c init according to any of the following formulas (19) and (20), and then according to the scrambling The code parameter c init produces a scrambling code.
  • n RNTI is the RNTI associated with the PUCCH, that is, the RNTI of the terminal device; n rep is the index number of repeated transmission times; n ID is the scrambling code identifier or the physical layer cell identifier; n f is the radio frame number; Configure the number of time slots contained in each radio frame under ⁇ for subcarriers; is the number of symbols contained in each slot; is the time slot number; l is the number of the starting symbol of the scrambled first information in the time slot; a, b, c are constants, k 0 , k 1 , k 2 , k 3 , k 4 , k 5 , k 6 is a constant, and mod represents modulo operation.
  • the above constants may be non-negative integers.
  • the second device when descrambling, the second device generates a scrambling code parameter c init according to the formula adopted by the first device, so as to generate a corresponding scrambling code for descrambling.
  • the first device may determine the scrambling code parameter c init according to any of the following formulas (21) and (22), and then according to the scrambling code The parameter c init generates scrambling codes.
  • n RNTI is the RNTI associated with the PUCCH, that is, the RNTI of the terminal device; n rep is the index number of repeated transmission times; n ID is the scrambling code identifier or the physical layer cell identifier; n f is the radio frame number; Configure the number of time slots contained in each radio frame under ⁇ for subcarriers; is the number of symbols contained in each slot; is the time slot number; l is the number of the starting symbol of the scrambled first information in the time slot; a, b, c are constants, k 0 , k 1 , k 2 , k 3 , k 4 , k 5 , k 6 , k 7 , and k 8 are constants, and mod means modulo operation.
  • the above constants may be non-negative integers.
  • the second device when descrambling, the second device generates a scrambling code parameter c init according to the formula adopted by the first device, so as to generate a corresponding scrambling code for descrambling.
  • the scrambling code parameter c init used to generate the scrambling code is determined according to the time parameter (relative time parameter or absolute time parameter), therefore, each time the scrambling code parameter c init is determined because the time parameter changes so that The change of the scrambling code parameter c init leads to different generated scrambling codes, which helps to improve the signal-to-interference ratio during repeated transmission.
  • the transmission opportunities of the first channel are 8, that is, the first information carried by the first channel is repeatedly sent 8 times, occupying 8 time slots continuously, and the first channel is The start OFDM symbol on each slot is symbol 3 and lasts 11 symbols.
  • the RV ids of the first information corresponding to each repeated transmission are 0, 2, 3, 1, 0, 2, 3, 1.
  • the first device may determine a scrambling code parameter for each repeated transmission. Since the time parameters for each repeated transmission are different, the scrambling codes used for the 8 repeated transmissions are also different, respectively C 0 , C 1 , C 2 , C 3 , C 4 , C 5 , C 6 , C 7 .
  • the first device may determine a time parameter corresponding to each repeated transmission according to the foregoing formulas (3) to (22), determine a corresponding scrambling code parameter, and thereby determine a corresponding scrambling code.
  • the transmission opportunities of the first channel are 8, that is, the first information carried by the first channel is repeatedly sent 8 times, occupying 8 time slots continuously, and the first The channel starts with OFDM symbol 3 on each slot and lasts 11 symbols.
  • the RV ids of the first information corresponding to each repeated transmission are 0, 2, 3, 1, 0, 2, 3, 1.
  • the first device can determine the scrambling code parameter once every 4 times of repeated transmission, that is, the first device generates the scrambling code C 0 according to the time parameter corresponding to the 0th repeated transmission, and uses the scrambling code C 0 for the 0th to 3rd repeated transmission code C 0 , generate the scrambling code C 1 according to the time parameter corresponding to the fourth repeated transmission, and use the scrambling code C 1 for the fourth to seventh repeated transmissions, so the scrambling codes used for the eight repeated transmissions are respectively C 0 , C 0 , C 0 , C 0 , C 1 , C 1 , C 1 , C 1 .
  • the scrambling codes used in the 0th to 3rd repeated transmissions are all C 0
  • the information finally sent in the 0th to 3rd repeated transmissions All are different.
  • the scrambling codes used in the 4th to 7th repeated transmissions are all C 1
  • the RVs used in the 4th to 7th repeated transmissions are all different, the final The information sent is all different.
  • the first device may determine the time parameters corresponding to the 0th repeated transmission and the 4th repeated transmission according to the above formulas (3) to (22), and determine the corresponding scrambling code parameters, thereby determining the corresponding scrambling code .
  • the embodiments of the present application further provide a communication device, which is used to implement the steps performed by the first device in the above method embodiments.
  • the communication device may include a module corresponding to the method/operation/step/action performed by the first device in the above method embodiment.
  • the module may be a hardware circuit, software, or It can be implemented by combining hardware circuits with software.
  • the communication device may include a generating module 801 , a scrambling module 802 and a sending module 803 as shown in FIG. 8 .
  • the generation module 801 is used to generate a scrambling code according to the time parameter;
  • the scrambling module 802 is used to scramble the first information according to the scrambling code;
  • the sending module 803 is used to transmit the information to the second information on the first channel The device sends the scrambled first information.
  • the communications apparatus further includes a determining module 804, configured to determine the time parameter according to the time domain resource used for sending the first information.
  • an embodiment of the present application further provides a communication device, which is used to implement the steps performed by the second device in the above method embodiment.
  • the communication device may include a module corresponding to the method/operation/step/action performed by the second device in the above method embodiment, and the module may be a hardware circuit, software, or It can be implemented by combining hardware circuits with software.
  • the communication device may include a generating module 901 , a receiving module 902 and a descrambling module 903 as shown in FIG. 9 .
  • the generation module 901 is used to generate a scrambling code according to the time parameter;
  • the receiving module 902 is used to receive information on the first channel;
  • the descrambling module 903 is used to receive information on the first channel according to the scrambling code pair. The information is descrambled to obtain the first information.
  • the communications apparatus further includes a determining module 904, configured to determine the time parameter according to the time domain resource used for sending the first information.
  • the embodiment of the present application also provides a communication device.
  • the communication device includes a processor 1001 as shown in FIG. 10 , and a communication interface 1002 connected to the processor 1001 .
  • the processor 1001 may be a general-purpose processor, a microprocessor, a specific integrated circuit (application specific integrated circuit, ASIC), a field programmable gate array (field programmable gate array, FPGA) or other programmable logic devices, discrete gate or transistor logic device, or one or more integrated circuits used to control the execution of the program of this application, etc.
  • a general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the methods disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules in the processor.
  • Communication interface 1002 using any device such as a transceiver, for communicating with other devices or communication networks, such as Ethernet, radio access network (radio access network, RAN), wireless local area networks (wireless local area networks, WLAN), etc. .
  • radio access network radio access network
  • WLAN wireless local area networks
  • the processor 1001 is configured to call the communication interface 1002 to perform a function of receiving and/or sending, and execute the method described in any one of the preceding possible implementation manners.
  • the communication device may further include a memory 1003 and a communication bus 1004 .
  • the memory 1003 is configured to store program instructions and/or data, so that the processor 1001 invokes the instructions and/or data stored in the memory 1003 to implement the above functions of the processor 1001 .
  • the memory 1003 may be a read-only memory (read-only memory, ROM) or other types of static storage devices that can store static information and instructions, random access memory (random access memory, RAM) or other types that can store information and instructions It can also be an electrically erasable programmable read-only memory (EEPROM) or can be used to carry or store desired program code in the form of instructions or data structures and can be stored by the computer Any other medium, but not limited to.
  • the memory 1003 may exist independently, such as an off-chip memory, and is connected to the processor 1001 through the communication bus 1004 .
  • the memory 1003 can also be integrated with the processor 1001.
  • Communication bus 1004 may include a path for communicating information between the components described above.
  • the communication apparatus may be the first device in the foregoing method embodiments, or may be the second device in the foregoing method embodiments.
  • the processor 1001 is used to realize the data processing operation of the communication device
  • the communication interface 2002 is used to realize the receiving operation and the sending operation of the communication device.
  • the processor 1001 is configured to generate a scrambling code according to a time parameter; scramble the first information according to the scrambling code; The scrambled first information is sent.
  • the foregoing components may also be used to support other processes performed by the first device in the foregoing method embodiments.
  • reference may be made to the foregoing description, and details are not repeated here.
  • the processor 1001 is configured to generate a scrambling code according to a time parameter; receive information on the first channel through the communication interface 1002, and descramble the received information according to the generated scrambling code , to get the first message.
  • the foregoing components may also be used to support other processes performed by the second device in the foregoing method embodiments.
  • reference may be made to the foregoing description, and details are not repeated here.
  • the embodiment of the present application also provides a computer-readable storage medium, the computer-readable storage medium stores computer-readable instructions, and when the computer-readable instructions are run on a computer, such as The scrambling method described in any one of the foregoing possible implementation manners is executed.
  • An embodiment of the present application provides a computer program product containing instructions, which when run on a computer, causes the computer to execute the above embodiment of the scrambling method.
  • Embodiments of the present application provide a computer program product containing instructions, which, when run on a computer, enable the above method embodiments to be executed.
  • the method steps in the embodiments of the present application may be implemented by means of hardware, or may be implemented by means of a processor executing software instructions.
  • Software instructions can be composed of corresponding software modules, and software modules can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only Memory, registers, hard disk, removable hard disk, CD-ROM or any other form of storage medium known in the art.
  • An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium.
  • the storage medium may also be a component of the processor.
  • the processor and storage medium can be located in the ASIC.
  • the ASIC can be located in the base station or the terminal.
  • the processor and the storage medium may also exist in the base station or the terminal as discrete components.
  • all or part of them may be implemented by software, hardware, firmware or any combination thereof.
  • software When implemented using software, it may be implemented in whole or in part in the form of a computer program product.
  • the computer program product comprises one or more computer programs or instructions. When the computer program or instructions are loaded and executed on the computer, the processes or functions described in the embodiments of the present application are executed in whole or in part.
  • the computer may be a general purpose computer, a special purpose computer, a computer network, network equipment, user equipment, or other programmable devices.
  • the computer program or instructions may be stored in or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer program or instructions may be downloaded from a website, computer, A server or data center transmits to another website site, computer, server or data center by wired or wireless means.
  • the computer-readable storage medium may be any available medium that can be accessed by a computer, or a data storage device such as a server or a data center integrating one or more available media.
  • the available medium may be a magnetic medium, such as a floppy disk, a hard disk, or a magnetic tape; it may also be an optical medium, such as a digital video disk; and it may also be a semiconductor medium, such as a solid state disk.
  • the computer readable storage medium may be a volatile or a nonvolatile storage medium, or may include both volatile and nonvolatile types of storage media.

Landscapes

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

Abstract

本申请公开了一种加扰、解扰方法及通信装置。该方法中，第一设备根据时间参数生成扰码，并根据扰码对第一信息进行加扰；然后第一设备在第一信道上向第二设备发送加扰后的第一信息。在上述实现方式中，根据时间参数生成扰码，使得根据不同时间参数生成的扰码有所不同，使得在重复传输的情况下，由于根据不同的扰码对待发送的第一信息进行加扰，使得第一信息在多次重复传输过程中，每次发送的信息不完全相同。由于重复传输过程中发送的信息不完全相同，因此降低了第一设备在一段时间内对相同的第一信息采用相同的扰码进行加扰的可能性，从而提高了第一信息传输的抗干扰能力，进而提升第二设备接收第一信息的性能。

Description

一种加扰、解扰方法及通信装置
相关申请的交叉引用
本申请要求在2021年07月31日提交中国专利局、申请号为202110876667.8、申请名称为“一种加扰、解扰方法及通信装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及无线通信领域，尤其涉及一种加扰、解扰方法及通信装置。
背景技术
第五代(the fifth-generation，5G)移动通信技术新无线(new radio，NR)是基于正交频分复用(orthogonal frequency division multiplexing，OFDM)的全新空口设计的全球性5G标准，也是下一代非常重要的蜂窝移动技术基础。
在不支持数据重复传输时，NR中，物理下行共享信道(physical downlink shared channel，PDSCH)、物理上行共享信道(physical uplink shared channel，PUSCH)、物理下行控制信道(physical downlink control channel，PDCCH)、物理上行控制信道(physical uplink control channel，PUCCH)在时域上占用的资源通常限制在一个时隙(slot)内。通过一个时隙内起始OFDM符号位置以及持续的OFDM符号个数就可以确定PDSCH/PUSCH/PDCCH/PUCCH在该时隙内的资源位置。图1为一个时隙内时域资源分配示意图，S表示PDSCH/PUSCH/PDCCH/PUCCH在一个时隙内起始OFDM符号的索引，L表示PDSCH/PUSCH/PDCCH/PUCCH持续的OFDM符号个数，本示例中PDSCH/PUSCH/PDCCH/PUCCH从OFDM符号3开始，持续11个OFDM符号。
在NR中，PDSCH/PUSCH/PDCCH/PUCCH在信道编码后，编码比特都需要执行加扰操作，实现干扰随机化。加扰操作就是将PDSCH/PUSCH/PDCCH/PUCCH的编码比特和扰码比特做模2加运算。
Figure PCTCN2022098690-appb-000001
其中，b(i)表示编码比特，c(i)表示扰码比特，
Figure PCTCN2022098690-appb-000002
表示加扰后的比特。
为获得更高的可靠性，PDSCH/PUSCH/PDCCH/PUCCH支持基于时隙的聚合/重复，相同的内容可以在多个时隙内重复传输，即PDSCH/PUSCH/PDCCH/PUCCH承载的传输块(transport block，TB)在多个时隙上重复传输。图2为PDSCH/PUSCH/PDCCH/PUCCH重复传输示意图，重复8次共占用8个时隙，8个时隙内时域资源分配相同，即S和L相同。
现有技术中，PDSCH/PUSCH/PDCCH/PUCCH在多次重复传输中每次重复传输都使用相同的扰码，会影响干扰随机化效果，进而影响接收设备接收PDSCH/PUSCH/PDCCH/PUCCH的性能。
发明内容
本申请实施例提供一种加扰、解扰方法及通信装置，用于实现通过加扰方式提高信号传输的抗干扰能力。
第一方面，本申请实施例提供一种加扰方法，包括：第一设备根据时间参数生成扰码，并根据扰码对第一信息进行加扰；然后第一设备在第一信道上向第二设备发送加扰后的第一信息。在上述实现方式中，根据时间参数生成扰码，不同时间参数确定的扰码是不同的，因此降低了第一设备在一段时间内对相同的第一信息采用相同的扰码进行加扰的可能性，从而提高了第一信息传输的抗干扰能力，进而提升第二设备接收第一信息的性能。
在一种可能的实现方式中，第一设备根据用于发送第一信息的时域资源确定上述时间参数。在该实现方式中，提供了一种时间参数的确定方式，时间参数与发送第一信息的时域资源相关，发送第一信息的时域资源不同时，可以确定出不同的时间参数，进而根据不同时间参数确定的扰码不同。
在一种可能的实现方式中，所述时间参数是根据用于发送第一信息的时域资源确定的。
在一种可能的实现方式中，第一设备根据发送第一信息的时域资源在n次重复传输中的时域资源中的位置，确定所述时间参数。在该实现方式中，提供了一种时间参数的确定方式，通过该实现方式确定出的时间参数，与此次发送第一信息在n次重复传输中的位置相关，为相对时间参数。不同重复在n次重复传输中的位置不同，可以确定出不同的时间参数，进而根据不同时间参数确定的扰码不同。此外，对于在非授权频谱传输第一信息的场景，采用这种方式确定时间参数，使得第一设备可以提前生成加扰后的第一信息，从而在确定信道空闲时进行发送。还有一个好处就是加扰后的第一信息可以提前准备，信道随时空闲可以随时发送。
在一种可能的实现方式中，所述时间参数是根据发送第一信息的时域资源在n次重复传输中的时域资源中的位置确定的。
在一种可能的实现方式中，第一设备确定出的时间参数为绝对时间参数。
在一种可能的实现方式中，所述时间参数包括以下参数中的至少一项或任意组合：无线帧号，半帧号，子帧号，时隙号，符号号。
在一种可能的实现方式中，第一信息被重复传输n次，所述n次重复传输中每k次重复传输的扰码相同，其中n和k为正整数。在该实现方式中，n次重复传输中每k次重复传输采用相同的扰码，在k大于1时，可以减少扰码生成的次数，进而可以降低第一设备生成扰码的复杂度。
在一种可能的实现方式中，所述k次重复传输的冗余版本不同。在该实现方式中，k次重复传输采用不同的冗余版本，通过不同冗余版本可以获得不同的编码比特，不同冗余版本之间进行增量冗余合并，可以提升重复传输的性能，k次重复传输采用相同扰码，不会影响干扰随机化效果。
在一种可能的实现方式中，k为2或4。
在一种可能的实现方式中，第一设备在根据时间参数生成扰码时，可以根据时间参数与无线网络临时标识(radio network tempory identity，RNTI)生成扰码；或者，可以根据时间参数与扰码标识生成扰码；或者，还可以根据时间参数、RNTI和扰码标识生成扰码。
在一种可能的实现方式中，第一设备在根据时间参数生成扰码时，可以根据时间参数与RNTI的乘积生成扰码；和/或，第一设备在根据时间参数与扰码标识生成扰码时，可以根据时间参数与扰码标识的乘积生成扰码。在该实现方式中，首先不同时间参数确定的扰 码是不同的，因此可以降低第一设备在一段时间内对相同的第一信息采用相同的扰码进行加扰的可能性，此外，第一设备根据时间参数与RNTI的乘积生成扰码，和/或，根据时间参数与扰码标识的乘积生成扰码，在不同时刻扰码不一样的程度是不同的，可以提高第一信息传输的抗干扰能力，进而提升第二设备接收第一信息的性能。
在一种可能的实现方式中，上述第一信道包括以下信道中的任一种：PDSCH，PUSCH，PDCCH，PUCCH。
在一种可能的实现方式中，当第一信道为PDSCH时，第一设备根据时间参数生成扰码，包括：
根据如下公式确定扰码参数c init：
c init＝(k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)·2 c+k 5·n ID+k 6；或者
c init＝(k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)·2 b+k 5·n ID+k 6；或者
c init＝(k 0·n RNTI+k 1)·2 a+(k 2·q+k 3)·2 b+((k 4·n rep+k 5)modc+k 6)·2 d+k 7·n ID+k 8；或者
c init＝(k 0·n RNTI+k 1)·2 a+(k 2·q+k 3)·2 b+((k 4·n rep+k 5)modc+k 6)·(k 7·n ID+k 8)；或者
Figure PCTCN2022098690-appb-000003
Figure PCTCN2022098690-appb-000004
或者
Figure PCTCN2022098690-appb-000005
Figure PCTCN2022098690-appb-000006
或者
Figure PCTCN2022098690-appb-000007
Figure PCTCN2022098690-appb-000008
或者
Figure PCTCN2022098690-appb-000009
其中，n RNTI为所述PDSCH关联的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；n f为无线帧号；
Figure PCTCN2022098690-appb-000010
为子载波配置μ下每个无线帧内包含的时隙数量；
Figure PCTCN2022098690-appb-000011
为每个时隙内包含的符号数量；
Figure PCTCN2022098690-appb-000012
为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；对于最多两个码字传输，q∈{0,1}；a、b、c、d为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8、k 9、k 10为常数；
根据所述扰码参数c init产生扰码。
在一种可能的实现方式中，当第一信道为PUSCH时，第一设备根据时间参数生成扰码，包括：
根据如下公式确定扰码参数c init：
c init＝(k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)· 2c+k 5·n ID+k 6；或者
c init＝(k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)· 2c+k 5·n ID+k 6；或者
Figure PCTCN2022098690-appb-000013
Figure PCTCN2022098690-appb-000014
或者
Figure PCTCN2022098690-appb-000015
其中，n RNTI为所述PUSCH关联的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；n f为无线帧号；
Figure PCTCN2022098690-appb-000016
为子载波配置μ下每个无线帧内包含的时 隙数量；
Figure PCTCN2022098690-appb-000017
为每个时隙内包含的符号数量；
Figure PCTCN2022098690-appb-000018
为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；a、b、c为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8为常数；
根据所述扰码参数c init产生扰码。
在一种可能的实现方式中，当第一信道为PDCCH时，第一设备根据时间参数生成扰码，包括：
根据如下公式确定扰码参数c init：
c init＝((k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)· 2c+k 5·n ID+k 6)mod 2 d；或者
c init＝((k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)·2 b+k 5·n ID+k 6)mod 2 c；或者
Figure PCTCN2022098690-appb-000019
Figure PCTCN2022098690-appb-000020
或者
Figure PCTCN2022098690-appb-000021
其中，n RNTI为所述PDCCH关联的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；n f为无线帧号；
Figure PCTCN2022098690-appb-000022
为子载波配置μ下每个无线帧内包含的时隙数量；
Figure PCTCN2022098690-appb-000023
为每个时隙内包含的符号数量；
Figure PCTCN2022098690-appb-000024
为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；a、b、c、d为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8为常数；
根据所述扰码参数c init产生扰码。
在一种可能的实现方式中，当第一信道PUCCH时，第一设备根据时间参数生成扰码，包括：
根据如下公式确定扰码参数c init：
c init＝(k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)·2 c+k 5·n ID+k 6；或者
c init＝(k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)·2 b+k 5·n ID+k 6；或者
Figure PCTCN2022098690-appb-000025
Figure PCTCN2022098690-appb-000026
或者
Figure PCTCN2022098690-appb-000027
其中，n RNTI为所述PUCCH关联的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；n f为无线帧号；
Figure PCTCN2022098690-appb-000028
为子载波配置μ下每个无线帧内包含的时隙数量；
Figure PCTCN2022098690-appb-000029
为每个时隙内包含的符号数量；
Figure PCTCN2022098690-appb-000030
为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；a、b、c为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8为常数；
根据所述扰码参数c init产生扰码。
第二方面，本申请实施例提供一种解扰方法，包括：第一设备根据时间参数生成扰码；所述第一设备根据所述扰码对在第一信道上接收到的信息进行解扰，以获取第一信息。在上述实现方式中，根据时间参数生成扰码，不同时间参数确定的扰码是不同的，因此降低了第一设备在一段时间内对相同的第一信息采用相同的扰码进行加扰的可能性，从而提高了第一信息传输的抗干扰能力，进而提升第二设备接收第一信息的性能。
在一种可能的实现方式中，所述方法还包括：所述第一设备根据用于接收所述第一信 息的时域资源确定所述时间参数。
在一种可能的实现方式中，所述第一设备根据用于接收所述第一信息的时域资源确定所述时间参数，包括：所述第一设备根据接收所述第一信息的时域资源在n次重复传输中的时域资源中的位置，确定所述时间参数。
在一种可能的实现方式中，所述时间参数包括以下参数中的至少一项或任意组合：无线帧号，半帧号，子帧号，时隙号，符号号。
在一种可能的实现方式中，所述第一信息被重复传输n次，所述n次重复传输中每k次重复传输的扰码相同，其中n和k为正整数。
在一种可能的实现方式中，所述k次重复传输的冗余版本不同。
在一种可能的实现方式中，所述k为2或4。
在一种可能的实现方式中，所述第一设备根据时间参数生成扰码，包括：根据所述时间参数与无线网络临时标识RNTI生成扰码；或者，根据所述时间参数与扰码标识生成扰码；或者，根据所述时间参数、RNTI和扰码标识生成扰码。
在一种可能的实现方式中，所述根据所述时间参数与RNTI生成扰码，包括：根据所述时间参数与RNTI的乘积生成扰码；和/或，所述根据所述时间参数与扰码标识生成扰码，包括：根据所述时间参数与扰码标识的乘积生成扰码。
在一种可能的实现方式中，所述第一信道包括以下信道中的任一种：物理下行共享信道PDSCH，物理上行共享信道PUSCH，物理下行控制信道PDCCH，物理上行控制信道PUCCH。
第三方面，本申请实施例提供一种通信装置，所述装置包括执行上述第一方面以及第一方面的任意一种可能实现方式的方法的模块/单元；这些模块/单元可以通过硬件实现，也可以通过硬件执行相应的软件实现。
示例性的，通信装置可以包括生成模块，用于根据时间参数生成扰码；加扰模块，用于根据所述扰码对第一信息进行加扰；发送模块，用于在第一信道上向第二设备发送加扰后的第一信息。
第四方面，本申请实施例提供一种通信装置，所述装置包括执行上述第二方面以及第二方面的任意一种可能实现方式的方法的模块/单元；这些模块/单元可以通过硬件实现，也可以通过硬件执行相应的软件实现。
示例性的，通信装置可以包括生成模块，用于根据时间参数生成扰码；接收模块，用于在第一信道上接收信息；解扰模块，用于根据所述扰码对在第一信道上接收到的信息进行解扰，以获取第一信息。
第五方面，本申请实施例提供一种通信装置，包括：处理器，以及分别与所述处理器耦合的存储器和通信接口；所述通信接口，用于与其他设备进行通信；所述处理器，用于运行所述存储器内的指令或程序，通过所述通信接口执行如第一方面以及第一方面的任意一种可能实现方式的加扰方法。
第六方面，本申请实施例提供一种通信装置，包括：处理器，以及分别与所述处理器耦合的存储器和通信接口；所述通信接口，用于与其他设备进行通信；所述处理器，用于运行所述存储器内的指令或程序，通过所述通信接口执行如第二方面以及第二方面的任意一种可能实现方式的解扰方法。
第七方面，本申请实施例中提供一种计算机可读存储介质，所述计算机可读存储介质 中存储有计算机可读指令，当所述计算机可读指令在计算机上运行时，使得如第一方面、第二方面以及任一种可能实现方式所述的方法被执行。
第八方面，本申请实施例提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得如第一方面、第二方面及任一种可能的实现方式所述的方法被执行。
附图说明
图1为本申请实施例提供的第一信道在一个时隙内的时域资源分配示意图；
图2为本申请实施例提供的第一信道重复传输示意图；
图3为本申请实施例提供的第一信道重复传输时存在干扰信号的示意图；
图4为本申请实施例提供的通信系统架构示意图；
图5为本申请实施例提供的一种加扰方法流程示意图；
图6为本申请实施例提供的一个具体实施例示意图；
图7为本申请实施例提供的另一个具体实施例示意图；
图8为本申请实施例提供的一种通信装置的结构示意图；
图9为本申请实施例提供的另一种通信装置的结构示意图；
图10为本申请实施例提供的又一种通信装置的结构示意图。
具体实施方式
为了获得更高的可靠性，PDSCH/PUSCH/PUCCH支持基于时隙(slot)的聚合/重复，即PUSCH/PDSCH/PUCCH承载的TB在连续的时隙上重复。具体的，对于PDSCH，这种重复方式成为时隙聚合(slot aggregation)，时隙聚合占用的时隙数通过参数聚合因子(pdsch-AggregationFactor)配置。对于PUSCH，这种重复称为时隙聚合或Type A重复，重复次数通过参数聚合因子(pusch-AggregationFactor)或重复次数(numberOfRepetitions)配置。对于PUCCH，这种重复称为PUCCH重复，重复传输占用的时隙数通过参数时隙数量(nrofSlots)配置。上述时隙聚合、Type A重复、PUCCH重复，或者其他重复方式(如Type B重复等)，虽然技术名称表述不同，但其技术实质都是数据被重复传输。为了便于描述，本文中统一称为重复传输。
然而，重复传输虽然有助于接收端成功接收到有效信号，但对于信干比并没有起到增益效果。如图3所示，在引入RV版本后，前4次的冗余版本各不相同，但第5-8次重复传输时采用的冗余版本分别与第1-4次重复传输时采用的冗余版本相同，但由于第1-8次重复传输时均采用相同的扰码C0，则目标UE在时隙0和时隙4上发送的信息完全相同，干扰UE在时隙0和时隙4上发送的信息也完全相同，则其信干比为SIR＝(S+S)/(I+I)＝S/I。由此可见，重复传输的情况下，其信干比没有得到提升，即，没有提升信号传输的抗干扰能力，使得重复传输的没有带来明显有效的增益效果。
本申请实施例提供一种加扰方法，用于提高重复传输场景下的信干比，提升重复传输的增益效果。该方法可以应用于如图4所示的通信系统架构中，如图4所示，该通信系统架构包括网络设备和终端设备。
其中，网络设备为无线接入网(radio access network，RAN)设备，无线接入网设备又可称为接入网设备或基站，用于将终端设备接入到无线网络。所述无线接入网可以是基 站(base station)、LTE系统或演进的LTE系统(LTE-Advanced，LTE-A)中的演进型基站(evolved NodeB，eNodeB)、5G通信系统中的下一代基站(next generation NodeB，gNB)、发送接收点(transmission reception point，TRP)、基带单元(base band unit，BBU)、WiFi接入点(access point，AP)、未来移动通信系统中的基站或WiFi系统中的接入节点等。无线接入网合并也可以是完成基站部分功能的模块或单元，例如，可以是集中式单元(central unit，CU)，或者分布式单元(distributed unit，DU)。这里的CU完成基站的无线资源控制协议和分组数据汇聚层协议(packet data convergence protocol，PDCP)的功能，还可以完成业务数据适配协议(service data adaptation protocol，SDAP)的功能；DU完成基站的无线链路控制层和介质访问控制(medium access control，MAC)层的功能，还可以完成部分物理层或全部物理层的功能，有关上述各个协议层的具体描述，可以参考第三代合作伙伴计划(3rd generation partnership project，3GPP)的相关技术规范。无线接入网设备可以是宏基站，也可以是微基站或室内站，还可以是中继节点或施主节点等。本申请的实施例对无线接入网设备所采用的具体技术和具体设备形态不做限定。
终端设备，也可以称为终端、用户设备(user equipment，UE)、移动台、移动终端等。终端设备可以广泛应用于各种场景，例如，设备到设备(device-to-device，D2D)、车物(vehicle to everything，V2X)通信、机器类通信(machine-type communication，MTC)、物联网(internet of things，IOT)、虚拟现实、增强现实、工业控制、自动驾驶、远程医疗、智能电网、智能家具、智能办公、智能穿戴、智能交通、智慧城市等。终端设备可以是手机、平板电脑、带无线收发功能的电脑、可穿戴设备、车辆、无人机、直升机、飞机、轮船、机器人、机械臂、智能家居设备等。本申请的实施例对终端设备所采用的具体技术和具体设备形态不做限定。
应当理解，图4仅为能够适用于本申请实施例提供的加扰方法的一种场景示例，但本申请实施例提供加扰方法也可以应用于其他需要对待发送信息进行加扰的场景中。
参见图5，为本申请实施例提供的加扰方法的流程示意图，如图所示，该方法可以包括以下步骤：
步骤501、第一设备根据时间参数生成扰码。
具体的，该时间参数是根据发送第一信息的时域资源确定的。第一设备可以根据发送第一信息的时域资源确定该时间参数。时间参数与发送第一信息的时域资源相关，即，不同时域资源上的第一信息所对应的时间参数不同，从而实现每次确定出的时间参数不同。
在一种可能的实现方式中，该时间参数可以是绝对时间参数，是实际发送第一信息时对应的时间参数。该时间参数可以包括以下参数中的至少一项或任意组合：无线帧号，半帧号，子帧号，时隙号，符号号等。
在另一种可能的实现方式中，该时间参数是根据发送第一信息的时域资源在n次重复传输中的时域资源中的位置确定的。第一设备可以根据发送第一信息的时域资源在n次重复传输中的时域资源中的位置，确定相应的时间参数。在该实施例中，由于时间参数是根据当次传输的时域资源在n次传输的时域资源中的位置关系确定出的，即，确定出的时间参数为相对时间参数。例如，确定出的相对时间参数可以是重复次数索引号。以图3为例，在时隙0中，第一信息被第一次传输，其重复次数索引号可以为1，即时隙0对应的相对时间参数为1；在时隙1中，第一信息被第二次传输，其重复次数索引号可以为2，即时隙1对应的相对时间参数为2；…；在时隙7中，第一信息被第八次传输，其重复次数索 引号可以为8，即时隙7对应的相对时间参数为8。应当理解，上述重复次数索引号也可以从0开始，即时隙0～时隙7对应的重复次数索引号分别为0～7；或者，也可以是根据其他规则确定的数值。此外，“重复次数索引号”仅为根据上述确定相对时间参数所取的名称，在基于上述确定相对时间参数原理的基础上，也可以采用其他名称，例如“传输次数索引号”，“时隙聚合传输中的相对时隙号”等。该实现方式尤其适用于在非授权频谱传输第一信息的场景，因为在该场景下，使得第一设备需要对第一信道进行监听，在确定第一信道空闲时才能够发送加扰后的第一信息，而该方式使得第一设备在不确定发送第一信息的绝对时间参数时，也能够提前生成相应的扰码并对第一信息进行加扰，等待第一信息空闲时将其发送给第二设备。
步骤502、第一设备根据生成的扰码对第一信息进行加扰。
根据生成的扰码对待发送的信息进行加扰的方式，与常见的加扰方式类似，此处不再赘述。
在一种可能的实现方式中，所述加扰可以是比特级的加扰，比如，生成的扰码可以与待加扰的第一信息进行模2加运算，如下述公式(1)所示：
Figure PCTCN2022098690-appb-000031
其中，b(i)表示第一信息的编码比特，c(i)表示扰码比特，
Figure PCTCN2022098690-appb-000032
表示加扰后的比特。
在另一种可能的实现方式中，所述加扰可以是符号级的加扰，比如，第一设备可以先将生成的扰码由比特形式映射成符号形式，映射的方法本申请实施例不做限制，比如可以进行BPSK、QPSK调制，或者其它类似形式的映射方法；然后再将符号形式的扰码与待加扰的第一信息进行逐点相乘操作或者逐点共轭相乘操作等，此时的第一信息为调制后的复数符号序列。生成的扰码由比特形式映射成符号形式，其中一种可能的映射方式如下，其中符号形式的扰码θ(i)和比特形式的扰码c(i)满足公式(2)，其中i＝0，1，2，…P-1,其中P为待加扰的第一信息对应的复数符号个数，j为复数单位，j满足j 2＝-1。
Figure PCTCN2022098690-appb-000033
步骤503、第一设备在第一信道上向第二设备发送加扰后的第一信息。
第一设备在第一信道上向第二设备发送加扰后的第一信息，相应的，第二设备在第一信道上接收信息，并根据时间参数生成扰码，根据生成的扰码对接收到的信息进行解扰，从而确定出第一信息，实现第一设备与第二设备的通信。
其中，第一设备可以是网络设备，第二设备可以是终端设备，即，上述加扰方法可以应用于下行传输中；或者，第一设备可以是终端设备，第二设备可以是网络设备，即，上述加扰方法可以应用于上行传输中。如前所述，本申请实施例提供的加扰方法还可以应用于其他需要对待发送信息进行加扰的场景中，故第一设备和第二设备也可以是除了网络设备和终端设备之外的其他设备，本申请实施例对此不做限定。
上述第一信道可以是PDSCH、PUSCH、PDCCH或PUCCH。
在上述实施例中，根据时间参数生成扰码，使得根据不同时间参数生成的扰码有所不同。使得在重复传输的情况下，由于根据不同的扰码对待发送的第一信息进行加扰，使得 第一信息在多次重复传输过程中，得到的加扰后的信息有所不同。由于重复传输过程中发送的加扰后的信息不同，没有影响到干扰随机化的效果，使得不同重复传输次数发送的加扰后的信息有所不同。而在传统的加扰方式中，不同重复传输次数发送的加扰后的信息可能相同，则影响了干扰随机化的效果。
例如，在上行传输过程中，若第一终端设备(目标UE)向网络设备重复传输加扰后的第一信息，同时存在第二终端设备(干扰UE)向网络设备重复传输加扰后的第二信息(即干扰信号)；对于目标UE来说，其每次生成的扰码时所采用的时间参数会发生变化，使得每次生成的扰码有所不同，从而使得加扰后的第一信息有所不同；对于网络设备来说，也需要根据时间参数生成扰码并对接收到的信息进行解扰，从而得到第一信息。若干扰UE也可能根据时间参数生成扰码并进行加扰，则干扰UE发送在重复传输过程中发的信息也各不相同。由此可见，采用上述方法后提高了重复传输过程中干扰随机化的效果，提高了第一信息传输的抗干扰能力，进而提升第二设备接收第一信息的性能。
为了获取较好的干扰随机化效果，每次重复传输时所采用的扰码，都可以是根据当次重复传输的时间参数所生成的扰码，从而使得每次重复传输时采用的扰码都不相同。例如，若根据重复次数索引号生成扰码，则在时隙0上第一次传输(重复次数索引号为1)时，可以根据重复次数索引号1生成扰码并对第一信息进行加扰；在时隙1上第二次传输(重复次数索引号为2)时，可以根据重复次数索引号2生成扰码并对第一信息进行加扰；以此类推。又例如，若根据绝对时间参数中的时隙号生成扰码，则在时隙0上第一次传输时，可以根据时隙号0生成扰码并对第一信息进行加扰；则在时隙1上第二次传输时，可以根据时隙号1生成扰码并对第一信息进行加扰；以此类推。
相应的，第二设备在解码时，也针对每次重复传输确定相对应的扰码，从而根据扰码对在第一信道接收到的信息进行解扰。
此外，考虑到重复传输中可能会引入冗余版本(redundancy version，RV)，而冗余版本的不同会使得经过增量冗余的第一信息有所不同，故第一设备也可以不必每次重复传输时都生成新的扰码，可以每k次重复传输生成一个新的扰码。
冗余版本的设计之初用于实现增量冗余(incremental redundancy，IR)混合自动重传请求(hybrid automatic repeat request，HARQ)传输，即将编码器生成的冗余比特分成若干组，每个RV定义一个传输开始点，首次传送和各次HARQ重传分别使用不同的RV，以实现冗余比特的逐步积累，完成增量冗余HARQ操作。而在NR重复传输中也可以引入RV，以实现不同次重复传输之间的增量冗余合并。
以常见的动态调度的PDSCH和半静态调度的PDSCH为例，重复传输的冗余版本可以根据表1确定。将PDSCH的n次重复传输记为n个传输机会(transmission occasion)，n＝0,1,…,pdsch_AggregationFactor-1，其中pdsch_AggregationFactor为PDSCH重复传输时占用的时隙数量，可以由网络设备配置。下行控制信息(downlink control information，DCI)指示第一次传输机会的RV，比如传输机会n＝0时，DCI指示RV id为0，传输机会n＝1时，n mod 4＝1，根据表1可知对应RV id为2；传输机会n＝2时，n mod 4＝2，根据表1可知RV id为3；传输机会n＝3时，n mod 4＝3，根据表1可知RV id为1；以此类推。
表1
Figure PCTCN2022098690-appb-000034
Figure PCTCN2022098690-appb-000035
确定PUSCH、PUCCH、PDCCH在每个传输机会上采用的RV的方式，与上述PDSCH类似，此处不再一一举例。
当冗余版本数量为4时，在第一次至第四次重复传输中，第一信息经过增量冗余后得到的信息均有所差异，这就使得即使在这四次重复传输时，即使采用了相同的扰码进行加扰，最终得到的加扰后的信息也会有所不同。因此，为了减少生成扰码的次数，简化第一设备加扰、第二设备解扰的操作，可以令每4次重复传输时产生一个新的扰码，而在一个周期内的4次重复传输中采用相同的扰码进行加扰。例如，第一设备可以根据第一次重复传输的时域资源所对应的时间参数生成扰码1，而在第一次至第四次重复传输中均根据扰码1对经过增量冗余后的第一信息进行加扰；第一设备可以根据第五次重复传输时的时间参数生成扰码2，进而在第五次至第八次重复传输中均根据扰码2对经过增量冗余后的第一信息进行加扰。
应当理解，虽然上述实施例中以每4次重复传输采用相同的扰码为例，但在实际应用中，也可以根据场景需求进行变换，即，在第一信息的n次重复传输中，每k次重复传输采用相同的扰码，其中，n、k均为正整数。
为了实现n次重复传输中干扰随机最大化，可以令k的取值满足该k次重复传输的冗余版本不同。由于采用相同扰码的k次重复传输的冗余版本不同，根据不同冗余版本而获得的编码比特也不相同，不同冗余版本之间进行增量冗余合并，可以提升重复传输的性能，如提示重复传输的信干比。例如，当冗余版本数量为4时，可以令k取不大于4的正整数。
相应的，若第一设备每k次重复传输生成一个新的扰码，且在一个周期内的k重复传输采用相同的扰码对第一信息进行加扰，则第二设备在解扰时，也每k次重复传输生成一个新的扰码，且在一个周期内的k重复传输采用相同的扰码对接收到的信息进行解扰。
在一种可能的实现方式中，第一设备在执行上述步骤501时，可以根据时间参数与RNTI生成扰码，或者，可以根据时间参数与扰码标识生成扰码，或者，还可以根据时间参数和小区标识生成扰码，或者，还可以根据时间参数、RNTI标识以及扰码标识生成扰码。相应的，第二设备在解扰时，也需要根据上述方式生成扰码，从而对接收到的信息进行解码。
进一步的，第一设备可以根据时间参数与RNTI的乘积生成扰码，或者，可以根据时间参数与扰码标识(和/或小区标识)的乘积生成扰码。此外，还可以根据时间参数取模后的值生成扰码。相应的，第二设备在解扰时，也根据上述方式生成扰码。
在一种可能的设计中，在生成扰码时可以先生成用于对扰码进行初始化的扰码参数c init，然后根据扰码初始化参数c init生成扰码。具体的，可以根据时间参数，或者时间参数与RNTI，或者时间参数、RNTI及扰码标识生成扰码参数c init，然后根据该扰码参数c init生成扰码。
下面对生成扰码参数的方式进行举例说明。
示例1、若时间参数为重复次数索引号、第一信道为PDSCH时，第一设备可以根据下 述公式(3)、公式(4)、公式(5)、公式(6)中的任一种确定扰码参数c init，然后根据扰码参数c init产生扰码。
c init＝(k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)·2 c+k 5·n ID+k 6   (3)
c init＝(k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)·2 b+k 5·n ID+k 6     (4)
c init＝(k 0·n RNTI+k 1)·2 a+(k 2·q+k 3)·2 b+((k 4·n rep+k 3)modc+k 6)·2 d+k 7·n ID+k 8   (5)
c init＝(k 0·n RNTI+k 1)·2 a+(k 2·q+k 3)·2 b+((k 4·n rep+k 3)modc+k 6)·(k 7·n ID+k 8)   (6)
其中，n RNTI为该PDSCH关联的RNTI，即终端设备的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；对于支持最多两个码字传输的场景，q∈{0,1}表示码字数量，对于最多一个码字传输的场景，可以将上述公式中的k 2·q删除，或者将q＝0带入上述公式；a、b、c、d为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8为常数，mod表示取模运算。可选的，上述常数可以为非负整数。
相应的，第二设备在解扰时，根据第一设备所采用的公式生成扰码参数c init，从而生成相应的扰码进行解扰。
示例2、若时间参数为绝对时间参数、第一信道为PDSCH时，第一设备可以根据下述公式(7)、公式(8)、公式(9)、公式(10)中的任一种确定扰码参数c init，然后根据扰码参数c init产生扰码。
Figure PCTCN2022098690-appb-000036
Figure PCTCN2022098690-appb-000037
Figure PCTCN2022098690-appb-000038
Figure PCTCN2022098690-appb-000039
其中，n RNTI为该PDSCH关联的RNTI，即终端设备的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；对于支持最多两个码字传输的场景，q∈{0,1}表示码字数量；
Figure PCTCN2022098690-appb-000040
为每个时隙内包含的符号数量；
Figure PCTCN2022098690-appb-000041
为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；对于最多两个码字传输，q∈{0,1}表示码字数量，对于最多一个码字传输的场景，可以将上述公式中的k 2·q删除，或者将q＝0带入上述公式；a、b、c、d为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8、k 9、k 10为常数，mod表示取模运算。可选的，上述常数可以为非负整数。
相应的，第二设备在解扰时，根据第一设备所采用的公式生成扰码参数c init，从而生成相应的扰码进行解扰。
示例3、若时间参数为重复次数索引号、第一信道为PUSCH时，第一设备可以根据下述公式(11)、公式(12)中的任一种确定扰码参数c init，然后根据扰码参数c init产生扰码。
c init＝(k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)·2 c+k 5·n ID+k 6   (11)
c init＝(k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)·2 c+k 5·n ID+k 6    (12)
其中，n RNTI为该PDSCH关联的RNTI，即终端设备的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；a、b、c为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6为 常数，mod表示取模运算。可选的，上述常数可以为非负整数。
相应的，第二设备在解扰时，根据第一设备所采用的公式生成扰码参数c init，从而生成相应的扰码进行解扰。
示例4、若时间参数为绝对时间参数、第一信道为PUSCH时，第一设备可以根据下述公式(13)、公式(14)中的任一种确定扰码参数c init，然后根据扰码参数c init产生扰码。
Figure PCTCN2022098690-appb-000042
Figure PCTCN2022098690-appb-000043
其中，n RNTI为该PDSCH关联的RNTI，即终端设备的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；
Figure PCTCN2022098690-appb-000044
为每个时隙内包含的符号数量；
Figure PCTCN2022098690-appb-000045
为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；a、b、c为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8为常数，mod表示取模运算。可选的，上述常数可以为非负整数。
相应的，第二设备在解扰时，根据第一设备所采用的公式生成扰码参数c init，从而生成相应的扰码进行解扰。
示例5、若时间参数为重复次数索引号、第一信道为PDCCH时，第一设备可以根据下述公式(15)、公式(16)中的任一种确定扰码参数c init，然后根据扰码参数c init产生扰码。
c init＝((k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)·2 c+k 5·n ID+k 6)mod 2 d   (15)
c init＝((k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)·2 b+k 5·n ID+k 6)mod 2 c   (16)
其中，n RNTI为所述PDCCH关联的RNTI，即终端设备的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；a、b、c、d为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6为常数，mod表示取模运算。可选的，上述常数可以为非负整数。
相应的，第二设备在解扰时，根据第一设备所采用的公式生成扰码参数c init，从而生成相应的扰码进行解扰。
示例6、若时间参数为绝对时间参数、第一信道为PDCCH时，第一设备可以根据下述公式(17)、公式(18)中的任一种确定扰码参数c init，然后根据扰码参数c init产生扰码。
Figure PCTCN2022098690-appb-000046
Figure PCTCN2022098690-appb-000047
其中，n RNTI为所述PDCCH关联的RNTI，即终端设备的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；n f为无线帧号；
Figure PCTCN2022098690-appb-000048
为子载波配置μ下每个无线帧内包含的时隙数量；
Figure PCTCN2022098690-appb-000049
为每个时隙内包含的符号数量；
Figure PCTCN2022098690-appb-000050
为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；a、b、c为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8为常数，mod表示取模运算。可选的，上述常数可以为非负整数。
相应的，第二设备在解扰时，根据第一设备所采用的公式生成扰码参数c init，从而生成相应的扰码进行解扰。
示例7、若时间参数为重复次数索引号、第一信道为PUCCH时，第一设备可以根据下述公式(19)、公式(20)中的任一种确定扰码参数c init，然后根据扰码参数c init产生扰码。
c init＝(k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)·2 c+k 5·n ID+k 6    (19)
c init＝(k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)·2 b+k 5·n ID+k 6      (20)
其中，n RNTI为所述PUCCH关联的RNTI，即终端设备的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；n f为无线帧号；
Figure PCTCN2022098690-appb-000051
为子载波配置μ下每个无线帧内包含的时隙数量；
Figure PCTCN2022098690-appb-000052
为每个时隙内包含的符号数量；
Figure PCTCN2022098690-appb-000053
为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；a、b、c为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6为常数，mod表示取模运算。可选的，上述常数可以为非负整数。
相应的，第二设备在解扰时，根据第一设备所采用的公式生成扰码参数c init，从而生成相应的扰码进行解扰。
示例8、若时间参数为绝对时间参数、第一信道为PUCCH时，第一设备可以根据下述公式(21)、公式(22)中的任一种确定扰码参数c init，然后根据扰码参数c init产生扰码。
Figure PCTCN2022098690-appb-000054
Figure PCTCN2022098690-appb-000055
其中，n RNTI为所述PUCCH关联的RNTI，即终端设备的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；n f为无线帧号；
Figure PCTCN2022098690-appb-000056
为子载波配置μ下每个无线帧内包含的时隙数量；
Figure PCTCN2022098690-appb-000057
为每个时隙内包含的符号数量；
Figure PCTCN2022098690-appb-000058
为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；a、b、c为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8为常数，mod表示取模运算。可选的，上述常数可以为非负整数。
相应的，第二设备在解扰时，根据第一设备所采用的公式生成扰码参数c init，从而生成相应的扰码进行解扰。
在上述8个示例中，根据时间参数(相对时间参数或绝对时间参数)确定用于生成扰码的扰码参数c init，因此，每次确定扰码参数c init时由于时间参数发生了变化使得扰码参数c init发生变化，进而导致生成的扰码不同，从而有助于提高重复传输时的信干比。
为了更加理解本申请实施例提供的加扰方法，下面结合具体实施例进行说明。
在一个具体实施例中，如图6所示，假设第一信道的传输机会为8，即第一信道所承载的第一信息被重复发送8次，连续占用8个时隙，第一信道在每个时隙上的起始OFDM符号为符号3，持续11个符号。根据DCI的指示，在这8个次重复传输中，每次重复传输对应的第一信息的RV id为0，2，3，1，0，2，3，1。第一设备可以在每次重复传输时，确定一次扰码参数，由于每次重复传输时的时间参数有所不同，因此这8次重复传输所使用的扰码也各不相同，分别为C 0、C 1、C 2、C 3、C 4、C 5、C 6、C 7。
可选的，第一设备可以根据上述公式(3)～(22)确定每次重复传输对应的时间参数，确定出相应的扰码参数，从而确定出相应的扰码。
在另一个具体实施例中，如图7所示，仍假设第一信道的传输机会为8，即第一信道所承载的第一信息被重复发送8次，连续占用8个时隙，第一信道在每个时隙上的起始OFDM符号为符号3，持续11个符号。根据DCI的指示，在这8个次重复传输中，每次 重复传输对应的第一信息的RV id为0，2，3，1，0，2，3，1。第一设备可以每4次重复传输，确定一次扰码参数，即，第一设备根据第0次重复传输对应的时间参数生成扰码C 0，并在第0～3次重复传输时均采用扰码C 0，根据第4次重复传输对应的时间参数生成扰码C 1，并在第4～7次重复传输时均采用扰码C 1，因此这8次重复传输所使用的扰码分别为C 0、C 0、C 0、C 0、C 1、C 1、C 1、C 1。虽然在第0～3次重复传输时所采用的扰码均为C 0，但由于第0～3次重复传输时采用的RV均不相同，故第0～3次重复传输时最终发送的信息均不相同。同理，虽然在第4～7次重复传输时所采用的扰码均为C 1，但由于第4～7次重复传输时采用的RV均不相同，故第4～7次重复传输时最终发送的信息均不相同。
可选的，第一设备可以根据上述公式(3)～(22)确定第0次重复传输、第4次重复传输对应的时间参数，确定出相应的扰码参数，从而确定出相应的扰码。
基于相同的技术构思，本申请实施例还提供一种通信装置，该通信装置用于实现上述方法实施例中第一设备所执行的步骤。
在一种可能的设计中，该通信装置可以包括执行上述方法实施例中第一设备执行的方法/操作/步骤/动作所一一对应的模块，该模块可以是硬件电路，也可是软件，也可以是硬件电路结合软件实现。
示例性的，该通信装置可以如图8所示，包括生成模块801、加扰模块802和发送模块803。具体的，生成模块801，用于根据时间参数生成扰码；加扰模块802，用于根据所述扰码对第一信息进行加扰；发送模块803，用于在第一信道上向第二设备发送加扰后的第一信息。
在一种可能的实现方式中，该通信装置还包括确定模块804，用于根据用于发送所述第一信息的时域资源确定所述时间参数。
基于相同的技术构思，本申请实施例还提供一种通信装置，该通信装置用于实现上述方法实施例中第二设备所执行的步骤。
在一种可能的设计中，该通信装置可以包括执行上述方法实施例中第二设备执行的方法/操作/步骤/动作所一一对应的模块，该模块可以是硬件电路，也可是软件，也可以是硬件电路结合软件实现。
示例性的，该通信装置可以如图9所示，包括生成模块901、接收模块902，解扰模块903。具体的，生成模块901，用于根据时间参数生成扰码；接收模块902，用于在第一信道上接收信息；解扰模块903，用于根据所述扰码对在第一信道上接收到的信息进行解扰，以获取第一信息。
在一种可能的实现方式中，该通信装置还包括确定模块904，用于根据用于发送所述第一信息的时域资源确定所述时间参数。
基于相同的技术构思，本申请实施例还提供一种通信装置。该通信装置包括如图10所示的处理器1001，以及与处理器1001连接的通信接口1002。
处理器1001可以是通用处理器，微处理器，特定集成电路(application specific integrated circuit，ASIC)，现场可编程门阵列(field programmable gate array，FPGA)或者其他可编程逻辑器件，分立门或者晶体管逻辑器件，或一个或多个用于控制本申请方案程序执行的集成电路等。通用处理器可以是微处理器或者任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件模块组合执行完成。
通信接口1002，使用任何收发器一类的装置，用于与其他设备或通信网络通信，如以太网，无线接入网(radio access network，RAN)，无线局域网(wireless local area networks，WLAN)等。
在本申请实施例中，处理器1001用于调用通信接口1002执行接收和/或发送的功能，并执行如前任一种可能实现方式所述的方法。
进一步的，该通信装置还可以包括存储器1003以及通信总线1004。
存储器1003，用于存储程序指令和/或数据，以使处理器1001调用存储器1003中存储的指令和/或数据，实现处理器1001的上述功能。存储器1003可以是只读存储器(read-only memory，ROM)或可存储静态信息和指令的其他类型的静态存储设备，随机存取存储器(random access memory，RAM)或者可存储信息和指令的其他类型的动态存储设备，也可以是电可擦可编程只读存储器(electrically erasable programmable read-only memory，EEPROM)或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。存储器1003可以是独立存在，例如片外存储器，通过通信总线1004与处理器1001相连接。存储器1003也可以和处理器1001集成在一起。
通信总线1004可包括一通路，在上述组件之间传送信息。
示例性的，通信装置可以为上述方法实施例中的第一设备，也可以是上述方法实施例中的第二设备。
其中，处理器1001用于实现通信装置的数据处理操作，通信接口2002用于实现通信装置的接收操作和发送操作。
当该通信装置为第一设备时，处理器1001用于根据时间参数生成扰码；根据所述扰码对第一信息进行加扰；通过所述通信接口1002在第一信道上向第二设备发送加扰后的第一信息。
此外，上述各个部件还可以用于支持上述方法实施例中第一设备所执行的其它过程。有益效果可参考前面的描述，此处不再赘述。
当该通信装置为第二设备时，处理器1001用于根据时间参数生成扰码；通过所述通信接口1002在第一信道上接收信息，并根据生成的扰码对接收到的信息进行解扰，以获取第一信息。
此外，上述各个部件还可以用于支持上述方法实施例中第二设备所执行的其它过程。有益效果可参考前面的描述，此处不再赘述。
基于相同的技术构思，本申请实施例还提供一种计算机可读存储介质，所述计算机可读存储介质中存储有计算机可读指令，当所述计算机可读指令在计算机上运行时，使得如前所述任一种可能的实现方式所述的加扰方法被执行。
本申请实施例提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述加扰方法的实施例。
本申请实施例提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得上述方法实施例被执行。
本申请实施例的描述中，“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。本申请中所涉及的多个，是指两个或两个以上。
另外，需要理解的是，在本申请的描述中，“第一”、“第二”等词汇，仅用于区分描述的目的，而不能理解为指示或暗示相对重要性，也不能理解为指示或暗示顺序。在本说明书中描述的参考“一个实施例”或“一些实施例”等意味着在本申请的一个或多个实施例中包括结合该实施例描述的特定特征、结构或特点。由此，在本说明书中的不同之处出现的语句“在一个实施例中”、“在一些实施例中”、“在其他一些实施例中”、“在另外一些实施例中”等不是必然都参考相同的实施例，而是意味着“一个或多个但不是所有的实施例”，除非是以其他方式另外特别强调。术语“包括”、“包含”、“具有”及它们的变形都意味着“包括但不限于”，除非是以其他方式另外特别强调。
本申请的实施例中的方法步骤可以通过硬件的方式来实现，也可以由处理器执行软件指令的方式来实现。软件指令可以由相应的软件模块组成，软件模块可以被存放于随机存取存储器、闪存、只读存储器、可编程只读存储器、可擦除可编程只读存储器、电可擦除可编程只读存储器、寄存器、硬盘、移动硬盘、CD-ROM或者本领域熟知的任何其它形式的存储介质中。一种示例性的存储介质耦合至处理器，从而使处理器能够从该存储介质读取信息，且可向该存储介质写入信息。当然，存储介质也可以是处理器的组成部分。处理器和存储介质可以位于ASIC中。另外，该ASIC可以位于基站或终端中。当然，处理器和存储介质也可以作为分立组件存在于基站或终端中。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机程序或指令。在计算机上加载和执行所述计算机程序或指令时，全部或部分地执行本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、网络设备、用户设备或者其它可编程装置。所述计算机程序或指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机程序或指令可以从一个网站站点、计算机、服务器或数据中心通过有线或无线方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是集成一个或多个可用介质的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质，例如，软盘、硬盘、磁带；也可以是光介质，例如，数字视频光盘；还可以是半导体介质，例如，固态硬盘。该计算机可读存储介质可以是易失性或非易失性存储介质，或可包括易失性和非易失性两种类型的存储介质。
在本申请的各个实施例中，如果没有特殊说明以及逻辑冲突，不同的实施例之间的术语和/或描述具有一致性、且可以相互引用，不同的实施例中的技术特征根据其内在的逻辑关系可以组合形成新的实施例。
可以理解的是，在本申请的实施例中涉及的各种数字编号仅为描述方便进行的区分，并不用来限制本申请的实施例的范围。上述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定。

Claims (27)

  1. 一种加扰方法，其特征在于，所述方法包括：
    第一设备根据时间参数生成扰码；
    所述第一设备根据所述扰码对第一信息进行加扰；
    所述第一设备在第一信道上向第二设备发送加扰后的第一信息。
  2. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    所述第一设备根据用于发送所述第一信息的时域资源确定所述时间参数。
  3. 根据权利要求2所述的方法，其特征在于，所述第一设备根据用于发送所述第一信息的时域资源确定所述时间参数，包括：
    所述第一设备根据发送所述第一信息的时域资源在n次重复传输中的时域资源中的位置，确定所述时间参数。
  4. 根据权利要求1或2所述的方法，其特征在于，所述时间参数包括以下参数中的至少一项或任意组合：无线帧号，半帧号，子帧号，时隙号，符号号。
  5. 根据权利要求1-4任一项所述的方法，其特征在于，所述第一信息被重复传输n次，所述n次重复传输中每k次重复传输的扰码相同，其中n和k为正整数。
  6. 根据权利要求5所述的方法，其特征在于，所述k次重复传输的冗余版本不同。
  7. 根据权利要求6所述的方法，其特征在于，所述k为2或4。
  8. 根据权利要求1-7任一项所述的方法，其特征在于，所述第一设备根据时间参数生成扰码，包括：
    根据所述时间参数与无线网络临时标识RNTI生成扰码；或者
    根据所述时间参数与扰码标识生成扰码；或者
    根据所述时间参数、RNTI和扰码标识生成扰码。
  9. 根据权利要求8所述的方法，其特征在于，所述根据所述时间参数与RNTI生成扰码，包括：根据所述时间参数与RNTI的乘积生成扰码；和/或
    所述根据所述时间参数与扰码标识生成扰码，包括：根据所述时间参数与扰码标识的乘积生成扰码。
  10. 根据权利要求1-9任一项所述的方法，其特征在于，所述第一信道包括以下信道中的任一种：物理下行共享信道PDSCH，物理上行共享信道PUSCH，物理下行控制信道PDCCH，物理上行控制信道PUCCH。
  11. 根据权利要求1-10中任一项所述的方法，其特征在于，所述第一信道为PDSCH；
    所述第一设备根据时间参数生成扰码，包括：
    根据如下公式确定扰码参数c init：
    c init＝(k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)·2 c+k 5·n ID+k 6；或者
    c init＝(k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)·2 b+k 5·n ID+k 6；或者
    c init＝(k 0·n RNTI+k 1)·2 a+(k 2·q+k 3)·2 b+((k 4·n rep+k 5)modc+k 6)·2 d+k 7·n ID+k 8；或者
    c init＝(k 0·n RNTI+k 1)·2 a+(k 2·q+k 3)·2 b+((k 4·n rep+k 5)modc+k 6)·(k 7·n ID+k 8)；或者
    Figure PCTCN2022098690-appb-100001
    Figure PCTCN2022098690-appb-100002
    或者
    Figure PCTCN2022098690-appb-100003
    Figure PCTCN2022098690-appb-100004
    或者
    Figure PCTCN2022098690-appb-100005
    Figure PCTCN2022098690-appb-100006
    或者
    Figure PCTCN2022098690-appb-100007
    其中，n RNTI为所述PDSCH关联的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；n f为无线帧号；
    Figure PCTCN2022098690-appb-100008
    为子载波配置μ下每个无线帧内包含的时隙数量；
    Figure PCTCN2022098690-appb-100009
    为每个时隙内包含的符号数量；
    Figure PCTCN2022098690-appb-100010
    为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；对于最多两个码字传输，q∈{0,1}；a、b、c、d为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8、k 9、k 10为常数；
    根据所述扰码参数c init产生扰码。
  12. 根据权利要求1-10中任一项所述的方法，其特征在于，所述第一信道为PUSCH；
    所述第一设备根据时间参数生成扰码，包括：
    根据如下公式确定扰码参数c init：
    c init＝(k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)·2 c+k 5·n ID+k 6；或者
    c init＝(k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)·2 c+k 5·n ID+k 6；或者
    Figure PCTCN2022098690-appb-100011
    Figure PCTCN2022098690-appb-100012
    或者
    Figure PCTCN2022098690-appb-100013
    其中，n RNTI为所述PUSCH关联的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；n f为无线帧号；
    Figure PCTCN2022098690-appb-100014
    为子载波配置μ下每个无线帧内包含的时隙数量；
    Figure PCTCN2022098690-appb-100015
    为每个时隙内包含的符号数量；
    Figure PCTCN2022098690-appb-100016
    为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；a、b、c为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8为常数；
    根据所述扰码参数c init产生扰码。
  13. 根据权利要求1-10中任一项所述的方法，其特征在于，所述第一信道为PDCCH；
    所述第一设备根据时间参数生成扰码，包括：
    根据如下公式确定扰码参数c init：
    c init＝((k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)·2 c+k 5·n ID+k 6)mod 2 d；或者
    c init＝((k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)·2 b+k 5·n ID+k 6)mod 2 c；或者
    Figure PCTCN2022098690-appb-100017
    Figure PCTCN2022098690-appb-100018
    或者
    Figure PCTCN2022098690-appb-100019
    其中，n RNTI为所述PDCCH关联的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；n f为无线帧号；
    Figure PCTCN2022098690-appb-100020
    为子载波配置μ下每个无线帧内包含的时隙数量；
    Figure PCTCN2022098690-appb-100021
    为每个时隙内包含的符号数量；
    Figure PCTCN2022098690-appb-100022
    为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；a、b、c、d为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8为常数；
    根据所述扰码参数c init产生扰码。
  14. 根据权利要求1-10中任一项所述的方法，其特征在于，所述第一信道PUCCH；
    所述第一设备根据时间参数生成扰码，包括：
    根据如下公式确定扰码参数c init：
    c init＝(k 0·n RNTI+k 1)·2 a+((k 2·n rep+k 3)modb+k 4)·2 c+k 5·n ID+k 6；或者
    c init＝(k 0·n RNTI+k 1)·((k 2·n rep+k 3)moda+k 4)·2 b+k 5·n ID+k 6；或者
    Figure PCTCN2022098690-appb-100023
    Figure PCTCN2022098690-appb-100024
    或者
    Figure PCTCN2022098690-appb-100025
    其中，n RNTI为所述PUCCH关联的RNTI；n rep为重复传输次数索引号；n ID为扰码标识或物理层小区标识；n f为无线帧号；
    Figure PCTCN2022098690-appb-100026
    为子载波配置μ下每个无线帧内包含的时隙数量；
    Figure PCTCN2022098690-appb-100027
    为每个时隙内包含的符号数量；
    Figure PCTCN2022098690-appb-100028
    为时隙号；l为加扰后的第一信息在时隙中起始符号的编号；a、b、c为常数，k 0、k 1、k 2、k 3、k 4、k 5、k 6、k 7、k 8为常数；
    根据所述扰码参数c init产生扰码。
  15. 一种解扰方法，其特征在于，包括：
    第一设备根据时间参数生成扰码；
    所述第一设备根据所述扰码对在第一信道上接收到的信息进行解扰，以获取第一信息。
  16. 根据权利要求15所述的方法，其特征在于，所述方法还包括：
    所述第一设备根据用于接收所述第一信息的时域资源确定所述时间参数。
  17. 根据权利要求16所述的方法，其特征在于，所述第一设备根据用于接收所述第一信息的时域资源确定所述时间参数，包括：
    所述第一设备根据接收所述第一信息的时域资源在n次重复传输中的时域资源中的位置，确定所述时间参数。
  18. 根据权利要求15或16所述的方法，其特征在于，所述时间参数包括以下参数中的至少一项或任意组合：无线帧号，半帧号，子帧号，时隙号，符号号。
  19. 根据权利要求15-18任一项所述的方法，其特征在于，所述第一信息被重复传输n次，所述n次重复传输中每k次重复传输的扰码相同，其中n和k为正整数。
  20. 根据权利要求19所述的方法，其特征在于，所述k次重复传输的冗余版本不同。
  21. 根据权利要求20所述的方法，其特征在于，所述k为2或4。
  22. 根据权利要求15-21任一项所述的方法，其特征在于，所述第一设备根据时间参数生成扰码，包括：
    根据所述时间参数与无线网络临时标识RNTI生成扰码；或者
    根据所述时间参数与扰码标识生成扰码；或者
    根据所述时间参数、RNTI和扰码标识生成扰码。
  23. 根据权利要求22所述的方法，其特征在于，所述根据所述时间参数与RNTI生成 扰码，包括：根据所述时间参数与RNTI的乘积生成扰码；和/或
    所述根据所述时间参数与扰码标识生成扰码，包括：根据所述时间参数与扰码标识的乘积生成扰码。
  24. 根据权利要求15-23任一项所述的方法，其特征在于，所述第一信道包括以下信道中的任一种：物理下行共享信道PDSCH，物理上行共享信道PUSCH，物理下行控制信道PDCCH，物理上行控制信道PUCCH。
  25. 一种通信装置，其特征在于，包括：处理器，以及分别与所述处理器耦合的存储器和通信接口；所述通信接口，用于与其他设备进行通信；所述处理器，用于运行所述存储器内的指令或程序，通过所述通信接口执行如权利要求1-14任一项所述的方法。
  26. 一种通信装置，其特征在于，包括：处理器，以及分别与所述处理器耦合的存储器和通信接口；所述通信接口，用于与其他设备进行通信；所述处理器，用于运行所述存储器内的指令或程序，通过所述通信接口执行如权利要求15-24任一项所述的方法。
  27. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质中存储有指令，当所述指令在计算机上运行时，使得所述计算机执行如权利要求1-24任一项所述的方法。
PCT/CN2022/098690 2021-07-31 2022-06-14 一种加扰、解扰方法及通信装置 WO2023011008A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110876667.8 2021-07-31
CN202110876667.8A CN115695109A (zh) 2021-07-31 2021-07-31 一种加扰、解扰方法及通信装置

Publications (1)

Publication Number Publication Date
WO2023011008A1 true WO2023011008A1 (zh) 2023-02-09

Family

ID=85059643

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/098690 WO2023011008A1 (zh) 2021-07-31 2022-06-14 一种加扰、解扰方法及通信装置

Country Status (2)

Country Link
CN (1) CN115695109A (zh)
WO (1) WO2023011008A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105453456A (zh) * 2013-09-17 2016-03-30 英特尔Ip公司 物理广播信道(pbch)内容的传输
CN106161302A (zh) * 2015-04-09 2016-11-23 电信科学技术研究院 一种信息传输的方法及装置
US20170048014A1 (en) * 2015-08-13 2017-02-16 Spreadtrum Hong Kong Limited Apparatus and method for generating scrambling codes for repetition transmissions
WO2018129816A1 (zh) * 2017-01-11 2018-07-19 华为技术有限公司 一种消息传输方法及设备
CN108988978A (zh) * 2017-06-01 2018-12-11 华为技术有限公司 扰码序列生成方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105453456A (zh) * 2013-09-17 2016-03-30 英特尔Ip公司 物理广播信道(pbch)内容的传输
CN106161302A (zh) * 2015-04-09 2016-11-23 电信科学技术研究院 一种信息传输的方法及装置
US20170048014A1 (en) * 2015-08-13 2017-02-16 Spreadtrum Hong Kong Limited Apparatus and method for generating scrambling codes for repetition transmissions
WO2018129816A1 (zh) * 2017-01-11 2018-07-19 华为技术有限公司 一种消息传输方法及设备
CN108988978A (zh) * 2017-06-01 2018-12-11 华为技术有限公司 扰码序列生成方法及装置

Also Published As

Publication number Publication date
CN115695109A (zh) 2023-02-03

Similar Documents

Publication Publication Date Title
TWI771202B (zh) 新無線電中的上行鏈路ack資源分配
CN113615117A (zh) 用于多源传输的码分复用(cdm)组
US11419120B2 (en) Information transmission method and communications device
WO2018027982A1 (zh) 发送参考信号的方法和装置及接收参考信号的方法和装置
WO2018006752A1 (zh) 无线通信的方法和装置
US20230337216A1 (en) Method and device for communication in wireless communication system supporting groupcast
WO2020220253A1 (zh) 一种信息传输方法和通信设备
WO2021017949A1 (zh) 一种数据传输方法、装置及系统
WO2018228522A1 (zh) 发送参考信号的方法、接收参考信号的方法和通信装置
WO2017000900A1 (zh) 传输信息的方法和设备
WO2021147214A1 (zh) 通信方法和通信装置
WO2019029579A1 (zh) 无线通信的方法、芯片和系统
US20240236973A1 (en) Wireless communication methods
WO2022199607A1 (zh) 数据传输方法及装置
WO2020098662A1 (zh) 发送和接收物理下行控制信道的方法以及通信装置
WO2020052469A1 (zh) 发送和接收侧行链路控制信息的方法以及装置
WO2021000937A1 (zh) 多时间单元传输方法及相关装置
WO2020259356A1 (zh) 通信方法和通信装置
CN115380588A (zh) 信息传输方法及装置
WO2023011008A1 (zh) 一种加扰、解扰方法及通信装置
WO2021227849A1 (zh) 通信方法和通信装置
WO2022205022A1 (zh) 用于传输参考信号的方法和装置
WO2021159507A1 (zh) 用于确定传输块大小的方法和通信装置
WO2024119494A1 (zh) 通信方法、装置、系统及计算机相关产品
WO2018137130A1 (zh) Harq进程的配置方法、装置及设备

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 22851724

Country of ref document: EP

Kind code of ref document: A1