CN115695109A - Scrambling and descrambling method and communication device - Google Patents

Scrambling and descrambling method and communication device Download PDF

Info

Publication number
CN115695109A
CN115695109A CN202110876667.8A CN202110876667A CN115695109A CN 115695109 A CN115695109 A CN 115695109A CN 202110876667 A CN202110876667 A CN 202110876667A CN 115695109 A CN115695109 A CN 115695109A
Authority
CN
China
Prior art keywords
scrambling code
information
rnti
time
parameter
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
CN202110876667.8A
Other languages
Chinese (zh)
Inventor
罗之虎
金哲
曲韦霖
侯海龙
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN202110876667.8A priority Critical patent/CN115695109A/en
Priority to PCT/CN2022/098690 priority patent/WO2023011008A1/en
Publication of CN115695109A publication Critical patent/CN115695109A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/10Code generation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks

Landscapes

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

Abstract

The application discloses a scrambling method, a descrambling method and a communication device. In the method, first equipment generates a scrambling code according to a time parameter and scrambles first information according to the scrambling code; the first device then transmits the scrambled first information to the second device on a first channel. In the above implementation manner, the scrambling codes are generated according to the time parameters, so that the scrambling codes generated according to different time parameters are different, and under the condition of repeated transmission, because the first information to be transmitted is scrambled according to different scrambling codes, the information transmitted each time is not completely the same in the multiple repeated transmission processes of the first information. Because the information sent in the repeated transmission process is not completely the same, the possibility that the first equipment scrambles the same first information by adopting the same scrambling code within a period of time is reduced, so that the anti-interference capability of the first information transmission is improved, and the performance of the second equipment for receiving the first information is improved.

Description

Scrambling and descrambling method and communication device
Technical Field
The present application relates to the field of wireless communications, and in particular, to a scrambling method, a descrambling method, and a communications apparatus.
Background
The New Radio (NR) of the fifth-generation (5G) mobile communication technology is a global 5G standard designed based on a completely new air interface of Orthogonal Frequency Division Multiplexing (OFDM), and is also a very important cellular mobile technology base of the next generation.
When data repetition transmission is not supported, in the NR, resources occupied by 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) in a time domain are generally limited to one slot (slot). The resource position of the PDSCH/PUSCH/PDCCH/PUCCH in a time slot can be determined by the initial OFDM symbol position and the continuous OFDM symbol number in the time slot. Fig. 1 is a schematic diagram of time domain resource allocation in one slot, where S denotes an index of a starting OFDM symbol of PDSCH/PUSCH/PDCCH/PUCCH in one slot, and L denotes the number of persistent OFDM symbols of PDSCH/PUSCH/PDCCH/PUCCH, in this example, PDSCH/PUSCH/PDCCH/PUCCH lasts 11 OFDM symbols starting from OFDM symbol 3.
In NR, after the PDSCH/PUSCH/PDCCH/PUCCH is channel coded, the coded bits all need to perform scrambling operation to achieve interference randomization. The scrambling operation is to perform modulo-2 addition operation on the coded bits and the scrambled bits of the PDSCH/PUSCH/PDCCH/PUCCH.
Figure BDA0003190537630000011
Wherein b (i) represents coded bits, c (i) represents scrambled bits,
Figure BDA0003190537630000012
representing the scrambled bits.
For higher reliability, the PDSCH/PUSCH/PDCCH/PUCCH supports slot-based aggregation/repetition, and the same content may be repeatedly transmitted in multiple slots, i.e., the Transport Block (TB) carried by the PDSCH/PUSCH/PDCCH/PUCCH is repeatedly transmitted in multiple slots. Fig. 2 is a schematic diagram of repeated transmission of PDSCH/PUSCH/PDCCH/PUCCH, where 8 times of repetition occupy 8 slots, and time domain resource allocation in the 8 slots is the same, that is, S and L are the same.
In the prior art, the same scrambling code is used for each repeated transmission of the PDSCH/PUSCH/PDCCH/PUCCH in multiple repeated transmissions, which affects the interference randomization effect and further affects the performance of receiving the PDSCH/PUSCH/PDCCH/PUCCH by receiving equipment.
Disclosure of Invention
The embodiment of the application provides a scrambling method, a descrambling method and a communication device, which are used for improving the anti-interference capability of signal transmission in a scrambling mode.
In a first aspect, an embodiment of the present application provides a scrambling method, including: the first equipment generates a scrambling code according to the time parameter and scrambles the first information according to the scrambling code; the first device then transmits the scrambled first information to the second device on a first channel. In the above implementation manner, the scrambling codes are generated according to the time parameters, and the scrambling codes determined by different time parameters are different, so that the possibility that the first device scrambles the same first information by using the same scrambling code within a period of time is reduced, the anti-interference capability of the first information transmission is improved, and the performance of the second device for receiving the first information is improved.
In a possible implementation manner, the first device determines the time parameter according to a time domain resource used for sending the first information. In this implementation manner, a determination manner of a time parameter is provided, where the time parameter is related to a time domain resource for sending the first information, and when the time domain resource for sending the first information is different, different time parameters can be determined, and then different scrambling codes are determined according to different time parameters.
In one possible implementation, the time parameter is determined according to a time domain resource used for transmitting the first information.
In a possible implementation manner, the first device determines the time parameter according to a position of a time domain resource that sends the first information in the time domain resource in the n repeated transmissions. In this implementation, a determination method of a time parameter is provided, and the time parameter determined by the implementation is a relative time parameter related to a position of the first information sent in the n repeated transmissions. Different time parameters can be determined by different positions of different repetitions in the n repeated transmissions, and further, the scrambling codes determined according to the different time parameters are different. In addition, for a scene that the first information is transmitted in the unlicensed spectrum, the time parameter is determined in such a way that the first device can generate the scrambled first information in advance so as to transmit when the channel is determined to be idle. It is also an advantage that the scrambled first information can be prepared in advance and the channel can be transmitted whenever it is free.
In a possible implementation manner, the time parameter is determined according to a position of a time domain resource for sending the first information in the time domain resource in the n repeated transmissions.
In a possible implementation manner, the time parameter determined by the first device is an absolute time parameter.
In one possible implementation, the time parameter includes at least one or any combination of the following parameters: radio frame number, field number, subframe number, slot number, symbol number.
In one possible implementation, the first information is repeatedly transmitted n times, and the scrambling code of each k repeated transmissions in the n repeated transmissions is the same, where n and k are positive integers. In this implementation manner, the same scrambling code is used for every k times of repeated transmission in n times of repeated transmission, and when k is greater than 1, the number of times of scrambling code generation can be reduced, thereby reducing the complexity of scrambling code generation by the first device.
In one possible implementation, the redundancy versions of the k repeated transmissions are different. In the implementation mode, different redundancy versions are adopted for k times of repeated transmission, different coding bits can be obtained through the different redundancy versions, incremental redundancy combination is carried out among the different redundancy versions, the performance of repeated transmission can be improved, the same scrambling code is adopted for k times of repeated transmission, and the interference randomization effect cannot be influenced.
In one possible implementation, k is 2 or 4.
In a possible implementation manner, when generating a scrambling code according to a time parameter, the first device may generate the scrambling code according to the time parameter and a Radio Network Temporary Identity (RNTI); or, a scrambling code can be generated according to the time parameter and the scrambling code identifier; or, the scrambling code can be generated according to the time parameter, the RNTI and the scrambling code identifier.
In a possible implementation manner, when the first device generates the scrambling code according to the time parameter, the first device may generate the scrambling code according to a product of the time parameter and the RNTI; and/or when the first device generates the scrambling code according to the time parameter and the scrambling code identifier, the first device may generate the scrambling code according to a product of the time parameter and the scrambling code identifier. In this implementation, at first, the scrambling codes determined by different time parameters are different, so that the possibility that the first device scrambles the same first information by using the same scrambling code within a period of time can be reduced, in addition, the first 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 different scrambling codes at different times is different, the anti-interference capability of the first information transmission can be improved, and the performance of the second device for receiving the first information is improved.
In a possible implementation manner, the first channel includes any one of the following channels: PDSCH, PUSCH, PDCCH, PUCCH.
In one possible implementation manner, when the first channel is the PDSCH, the first device generates a scrambling code according to the time parameter, including:
determining a scrambling code parameter c according to the following formula 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 (ii) a 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 (ii) a 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 (ii) a 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 ) (ii) a Or
Figure BDA0003190537630000031
Figure BDA0003190537630000032
Or
Figure BDA0003190537630000034
Figure BDA0003190537630000035
Or
Figure BDA0003190537630000036
Figure BDA0003190537630000037
Or
Figure BDA0003190537630000038
Wherein n is RNTI An RNTI associated with the PDSCH; n is rep Index number for number of repeated transmission times; n is ID A scrambling code identifier or a physical layer cell identifier; n is a radical of an alkyl radical f Is the radio frame number;
Figure BDA0003190537630000039
configuring the number of time slots contained in each radio frame under mu for the subcarriers;
Figure BDA00031905376300000310
the number of symbols contained in each time slot;
Figure BDA00031905376300000311
is a time slot number; l is the number of the initial symbol of the scrambled first information in the time slot; for a maximum of two codeword transmissions, q ∈ {0,1}; 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 Is a constant;
according to the scrambling code parameter c init A scrambling code is generated.
In one possible implementation manner, when the first channel is a PUSCH, the generating, by the first device, the scrambling code according to the time parameter includes:
determining a scrambling code parameter c according to the following formula 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 (ii) a Or
c init =(k o ·n RNTI +k 1 )·((k 2 ·n rep +k 3 )moda+k 4 )·2 c +k 5 ·n ID +k 6 (ii) a Or
Figure BDA00031905376300000312
Figure BDA00031905376300000313
Or
Figure BDA00031905376300000314
Figure BDA00031905376300000315
Wherein n is RNTI An RNTI associated with the PUSCH; n is rep Index number for number of repeated transmission times; n is a radical of an alkyl radical ID A scrambling code identifier or a physical layer cell identifier; n is f Is the radio frame number;
Figure BDA00031905376300000316
configuring the number of time slots contained in each radio frame under mu for the subcarriers;
Figure BDA00031905376300000317
the number of symbols contained in each time slot;
Figure BDA00031905376300000318
is a time slot number; l is the number of the initial 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 、k 8 Is a constant;
according to the scrambling code parameter c init A scrambling code is generated.
In a possible implementation manner, when the first channel is a PDCCH, the generating, by the first device, a scrambling code according to the time parameter includes:
determining a scrambling code parameter c according to the following formula 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 (ii) a 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 (ii) a Or
Figure BDA0003190537630000041
Figure BDA0003190537630000042
Or
Figure BDA0003190537630000043
Wherein n is RNTI An RNTI associated with the PDCCH; n is rep Index number for number of repeated transmission times; n is ID A scrambling code identifier or a physical layer cell identifier; n is a radical of an alkyl radical f Is the radio frame number;
Figure BDA0003190537630000044
configuring the number of time slots contained in each radio frame under mu for the subcarriers;
Figure BDA0003190537630000045
the number of symbols contained in each time slot;
Figure BDA0003190537630000046
is a time slot number; l is the number of the initial symbol of the scrambled first information in the time slot; a. b, c, d are constants, k 0 、k 1 、k 2 、k 3 、k 4 、k 5 、k 6 、k 7 、k 8 Is a constant;
according to the scrambling code parameter c init A scrambling code is generated.
In one possible implementation manner, when the first channel PUCCH is received, the generating, by the first device, a scrambling code according to the time parameter includes:
determining a scrambling code parameter c according to the following formula 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 (ii) a Or
c init =(ko·nR N T I +k 1 )·((k 2 ·n rep +k 3 )moda+k 4 )·2b+k 5 ·n ID +k 6 (ii) a Or
Figure BDA0003190537630000047
Figure BDA0003190537630000048
Or alternatively
Figure BDA0003190537630000049
Figure BDA00031905376300000410
Wherein n is RNTI An RNTI associated with the PUCCH; n is rep Index number for number of repeated transmission times; n is ID A scrambling code identifier or a physical layer cell identifier; nf is the radio frame number;
Figure BDA00031905376300000411
configuring the number of time slots contained in each radio frame under mu for the subcarriers;
Figure BDA00031905376300000412
the number of symbols contained in each time slot;
Figure BDA00031905376300000413
is a time slot number; l is the number of the initial 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 、k 8 Is a constant;
according to the scrambling code parameter c init A scrambling code is generated.
In a second aspect, an embodiment of the present application provides a descrambling method, including: the first equipment generates a scrambling code according to the time parameter; and the first equipment descrambles the information received on the first channel according to the scrambling code so as to obtain first information. In the above implementation manner, the scrambling codes are generated according to the time parameters, and the scrambling codes determined by different time parameters are different, so that the possibility that the first device scrambles the same first information by using the same scrambling code within a period of time is reduced, the anti-interference capability of the first information transmission is improved, and the performance of the second device for receiving the first information is improved.
In one possible implementation, the method further includes: the first device determines the time parameter according to a time domain resource for receiving the first information.
In a possible implementation manner, the determining, by the first device, the time parameter according to a time domain resource used for receiving the first information includes: and the first equipment determines the time parameter according to the position of the time domain resource receiving the first information in the time domain resource in the repeated transmission of n times.
In one possible implementation, the time parameter includes at least one or any combination of the following parameters: radio frame number, field number, subframe number, slot number, symbol number.
In one possible implementation, the first information is repeatedly transmitted n times, and a scrambling code of each k times of repeated transmission in the n times of repeated transmission is the same, where n and k are positive integers.
In one possible implementation, the redundancy versions of the k repeated transmissions are different.
In one possible implementation, k is 2 or 4.
In one possible implementation manner, the generating, by the first device, a scrambling code according to a time parameter includes: generating a scrambling code according to the time parameter and the radio network temporary identifier RNTI; or generating a scrambling code according to the time parameter and the scrambling code identifier; or generating a scrambling code according to the time parameter, the RNTI and the scrambling code identification.
In a possible implementation manner, the generating a scrambling code according to the time parameter and the RNTI includes: generating a scrambling code according to the product of the time parameter and the RNTI; and/or, the generating a scrambling code according to the time parameter and the scrambling code identifier includes: and generating a scrambling code according to the product of the time parameter and the scrambling code identifier.
In one possible implementation, 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.
In a third aspect, an embodiment of the present application provides a communication apparatus, where the apparatus includes a module/unit that performs the method according to the first aspect and any one of the possible implementation manners of the first aspect; these modules/units may be implemented by hardware, or by hardware executing corresponding software.
Illustratively, a communications apparatus can include a generating module configured to generate a scrambling code based on a time parameter; the scrambling module is used for scrambling the first information according to the scrambling codes; and the sending module is used for sending the scrambled first information to the second equipment on the first channel.
In a fourth aspect, an embodiment of the present application provides a communication apparatus, which includes a module/unit for performing the method of any one of the second aspect and the possible implementation manner of the second aspect; these modules/units may be implemented by hardware, or by hardware executing corresponding software.
Illustratively, a communications apparatus can include a generating module configured to generate a scrambling code based on a time parameter; a receiving module for receiving information on a first channel; and the descrambling module is used for descrambling the information received on the first channel according to the scrambling code so as to acquire the first information.
In a fifth aspect, an embodiment of the present application provides a communication apparatus, including: a processor, and a memory and a communication interface respectively coupled to the processor; the communication interface is used for communicating with other equipment; the processor is configured to execute the instructions or the program in the memory, and execute the scrambling method according to the first aspect and any one of the possible implementations of the first aspect through the communication interface.
In a sixth aspect, an embodiment of the present application provides a communication apparatus, including: a processor, and a memory and a communication interface respectively coupled to the processor; the communication interface is used for communicating with other equipment; the processor is configured to execute the instructions or the program in the memory, and execute the descrambling method according to the second aspect and any possible implementation manner of the second aspect through the communication interface.
In a seventh aspect, embodiments of the present application provide a computer-readable storage medium, which stores computer-readable instructions that, when executed on a computer, cause the method according to the first aspect, the second aspect, and any possible implementation manner to be performed.
In an eighth aspect, embodiments of the present application provide a computer program product containing instructions that, when executed on a computer, cause the method according to the first aspect, the second aspect, and any possible implementation manner to be performed.
Drawings
Fig. 1 is a schematic diagram of time domain resource allocation of a first channel in a time slot according to an embodiment of the present application;
fig. 2 is a schematic diagram of a first channel retransmission according to an embodiment of the present application;
fig. 3 is a schematic diagram illustrating the existence of an interference signal when a first channel is repeatedly transmitted according to an embodiment of the present disclosure;
fig. 4 is a schematic diagram of a communication system architecture according to 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 an embodiment of the present application;
FIG. 7 is a schematic diagram of another embodiment provided by an embodiment of the present application;
fig. 8 is a schematic structural diagram of a communication device according to an embodiment of the present application;
fig. 9 is a schematic structural diagram of another communication device according to an embodiment of the present application;
fig. 10 is a schematic structural diagram of another communication device according to an embodiment of the present application.
Detailed Description
For higher reliability, PDSCH/PUSCH/PUCCH supports slot-based aggregation/repetition, i.e. the TBs of the PUSCH/PDSCH/PUCCH bearer are repeated on consecutive slots. Specifically, for the PDSCH, the repetition mode is slot aggregation (slot aggregation), and the number of slots occupied by the slot aggregation is configured by a parameter aggregation factor (PDSCH-aggregation factor). For PUSCH, such repetition is called slot aggregation or Type a repetition, and the number of repetitions is configured by a parameter aggregation factor (PUSCH-aggregation factor) or a number of repetitions (numberOfRepetitions). For PUCCH, this repetition is called PUCCH repetition, and the number of slots occupied by the repeated transmission is configured by the number of parameter slots (nrofllots). Although the technical names are different, the technical essence of the above slot aggregation, type a repetition, PUCCH repetition, or other repetition modes (e.g., type b repetition, etc.) is that data is repeatedly transmitted. For ease of description, this is collectively referred to herein as a repeat transmission.
However, although the repeated transmission helps the receiving end to successfully receive the effective signal, it does not have a gain effect on the signal-to-interference ratio. As shown in fig. 3, after the RV version is introduced, the redundancy versions of the previous 4 times are different, but the redundancy versions used in the 5 th to 8 th repeated transmissions are respectively the same as the redundancy versions used in the 1 st to 4 th repeated transmissions, but since the same scrambling code C0 is used in the 1 st to 8 th repeated transmissions, the information sent by the target UE in the time slot 0 and the time slot 4 is completely the same, and the information sent by the interfering UE in the time slot 0 and the time slot 4 is also completely the same, so that the signal-to-interference ratio is SIR = (S + S)/(I + I) = S/I. Therefore, under the condition of repeated transmission, the signal-to-interference ratio is not improved, namely, the anti-interference capacity of signal transmission is not improved, so that the repeated transmission does not bring obvious and effective gain effect.
The embodiment of the application provides a scrambling method, which is used for improving the signal-to-interference ratio in a repeated transmission scene and improving the gain effect of repeated transmission. The method may be applied in a communication system architecture as shown in fig. 4, which includes a network device and a terminal device as shown in fig. 4.
The network device is a Radio Access Network (RAN) device, which may also be referred to as an access network device or a base station, and is configured to access the terminal device to a wireless network. The radio access network may be a base station (base station), an evolved NodeB (eNodeB) in an LTE system or an evolved LTE system (LTE-Advanced, LTE-a), a next generation base station (next generation NodeB, gNB) in a 5G communication system, a Transmission Reception Point (TRP), a Base Band Unit (BBU), a WiFi Access Point (AP), a base station in a future mobile communication system or an access node in a WiFi system, and the like. The radio access network may also be a module or a unit that performs part of the functions of the base station, for example, a Centralized Unit (CU) or a Distributed Unit (DU). The CU here completes the functions of a radio resource control protocol and a packet data convergence layer protocol (PDCP) of the base station, and may also complete the functions of a Service Data Adaptation Protocol (SDAP); the DU performs functions of a radio link control (rlc) layer and a Medium Access Control (MAC) layer of the base station, and may also perform functions of a part of or all of a physical layer, and for detailed descriptions of the above protocol layers, reference may be made to related technical specifications of the third generation partnership project (3 rd generation partnership project,3 gpp). The radio access network device may be a macro base station, a micro base station or an indoor station, or a relay node or a donor node. The embodiments of the present application do not limit the specific technologies and the specific device forms adopted by the radio access network device.
A terminal device may also be referred to as a terminal, a User Equipment (UE), a mobile station, a mobile terminal, or the like. The terminal device can be widely applied to various scenes, for example, device-to-device (D2D), vehicle-to-electrical (V2X) communication, machine-type communication (MTC), internet of things (IOT), virtual reality, augmented reality, industrial control, automatic driving, telemedicine, smart grid, smart furniture, smart office, smart wearing, smart transportation, smart city, and the like. The terminal equipment can be a mobile phone, a tablet personal computer, a computer with a wireless transceiving function, wearable equipment, a vehicle, an unmanned aerial vehicle, a helicopter, an airplane, a steamship, a robot, a mechanical arm, intelligent household equipment and the like. The embodiment of the present application does not limit the specific technology and the specific device form adopted by the terminal device.
It should be understood that fig. 4 is only one example of a scenario that can be applied 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 that require scrambling of information to be transmitted.
Referring to fig. 5, a flow chart of a scrambling method provided in an embodiment of the present application is schematically illustrated, and as shown in the figure, the method may include the following steps:
step 501, the first device generates a scrambling code according to the time parameter.
Specifically, the time parameter is determined according to a time domain resource for transmitting the first information. The first device may determine the time parameter based on time domain resources in which the first information is transmitted. The time parameter is related to the time domain resource for sending the first information, that is, the time parameters corresponding to the first information on different time domain resources are different, so that the time parameters determined each time are different.
In a possible implementation manner, the time parameter may be an absolute time parameter, which is a time parameter corresponding to when the first information is actually transmitted. The time parameter may include at least one or any combination of the following parameters: radio frame number, field number, subframe number, slot number, symbol number, etc.
In another possible implementation manner, the time parameter is determined according to a position of the time domain resource transmitting the first information in the time domain resource in the n repeated transmissions. The first device may determine the corresponding time parameter according to a position of the time domain resource for transmitting the first information in the time domain resource in the n repeated transmissions. In this embodiment, the time parameter is determined according to the position relationship of the time domain resource of the current transmission in the time domain resource of the n-time transmission, that is, the determined time parameter is a relative time parameter. For example, the determined relative time parameter may be a number of repetitions index. Taking fig. 3 as an example, in the timeslot 0, the first message is transmitted for the first time, the index of the number of times of repetition may be 1, i.e. the relative time parameter corresponding to the timeslot 0 is 1; in the time slot 1, the first information is transmitted for the second time, the index number of the repetition times can be 2, namely the relative time parameter corresponding to the time slot 1 is 2; …; in the time slot 7, the first message is transmitted for the eighth time, and the index number of the number of repetitions may be 8, i.e. the relative time parameter corresponding to the time slot 7 is 8. It should be understood that the above-mentioned index number of the number of times of repetition may also start from 0, i.e. the index numbers of the number of times of repetition corresponding to time slots 0 to 7 are 0 to 7 respectively; alternatively, the value may be determined according to another rule. In addition, the "number of times of repetition" is only a name taken according to the above-mentioned determined relative time parameter, and other names such as "number of times of transmission" and "relative slot number in slot aggregation transmission" may be also used on the basis of the above-mentioned principle of determining the relative time parameter. The implementation method is particularly suitable for a scenario in which the first information is transmitted in the unlicensed spectrum, because in the scenario, the first device needs to monitor the first channel, and can transmit the scrambled first information only when determining that the first channel is idle, and the implementation method enables the first device to generate a corresponding scrambling code in advance and scramble the first information when the absolute time parameter of transmitting the first information is not determined, and transmit the first information to the second device when waiting for the first information to be idle.
And 502, the first device scrambles the first information according to the generated scrambling code.
The scrambling method for the information to be transmitted according to the generated scrambling code is similar to a common scrambling method, and is not described herein again.
In one possible implementation manner, 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 equation (1):
Figure BDA0003190537630000081
wherein b (i) denotes coded bits of the first information, c (i) denotes scrambling bits,
Figure BDA0003190537630000082
representing the scrambled bits.
In another possible implementation manner, the scrambling may be symbol-level scrambling, for example, the first device may first map the generated scrambling code from a bit format to a symbol format, and the mapping method is not limited in this embodiment, for example, BPSK, QPSK modulation, or other similar mapping methods may be performed; then, the scrambling code in the form of symbol and the first information to be scrambled are subjected to point-by-point multiplication operation or point-by-point conjugate multiplication operation, and the like, wherein the first information at this time is a modulated complex symbol sequence. The generated scrambling code is mapped into a symbol form by a bit form, wherein one possible mapping mode is as follows, wherein a scrambling code theta (i) in the symbol form and a scrambling code c (i) in the bit form satisfy formula (2), wherein i =0,1,2,. P-1, wherein P is the number of complex symbols corresponding to the first information to be scrambled, j is a complex unit, and j satisfies j 2 =-1。
Figure BDA0003190537630000083
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, correspondingly, the second device receives the information on the first channel, generates a scrambling code according to the time parameter, and descrambles the received information according to the generated scrambling code, so that the first information is determined, and communication between the first device and the second device is realized.
The first device may be a network device, and the second device may be a terminal device, that is, the scrambling method may be applied to downlink transmission; alternatively, the first device may be a terminal device and the second device may be a network device, that is, the scrambling method may be applied to uplink transmission. As described above, the scrambling method provided in the embodiment of the present application may also be applied to other scenarios that require scrambling of information to be transmitted, so that the first device and the second device may also be other devices except for a network device and a terminal device, which is not limited in the embodiment of the present application.
The first channel may be a PDSCH, a PUSCH, a PDCCH, or a PUCCH.
In the above-described embodiment, the scrambling codes are generated in accordance with the time parameters, so that the scrambling codes generated in accordance with different time parameters are different. Under the condition of repeated transmission, the first information to be sent is scrambled according to different scrambling codes, so that the scrambled information obtained by the first information is different in the repeated transmission process. Because the scrambled information sent in the repeated transmission process is different, the interference randomization effect is not influenced, so that the scrambled information sent by different repeated transmission times is different. In the conventional scrambling method, the scrambled information sent by different times of repeated transmission may be the same, which affects the effect of interference randomization.
For example, in the uplink transmission process, if a first terminal device (target UE) repeatedly transmits scrambled first information to a network device, there is a second terminal device (interfering UE) that repeatedly transmits scrambled second information (i.e., an interfering signal) to the network device; for the target UE, the time parameter adopted by the scrambling code generated each time is changed, so that the scrambling codes generated each time are different, and the scrambled first information is different; for the network device, it is also necessary to generate a scrambling code according to the time parameter and descramble the received information, so as to obtain the first information. If the interfering UE may also generate a scrambling code according to the time parameter and perform scrambling, information sent by the interfering UE in the repeated transmission process is different. Therefore, the method improves the effect of interference randomization in the repeated transmission process, improves the anti-interference capability of the first information transmission, and further improves the performance of the second equipment for receiving the first information.
In order to obtain a better interference randomization effect, the scrambling codes adopted in each repeated transmission can be generated according to the time parameters of the repeated transmission, so that the scrambling codes adopted in each repeated transmission are different. For example, if the scrambling code is generated according to the index number of the repetition times, when the first transmission (the index number of the repetition times is 1) is performed on the time slot 0, the scrambling code may be generated according to the index number of the repetition times 1 and the first information may be scrambled; when the second transmission (the index number of the repetition times is 2) is carried out on the time slot 1, the scrambling code can be generated according to the index number of the repetition times 2 and the first information is scrambled; and so on. For another example, if the scrambling code is generated according to the slot number in the absolute time parameter, the scrambling code may be generated according to the slot number 0 and the first information may be scrambled when the first transmission is performed on the slot 0; generating a scrambling code according to the time slot number 1 and scrambling the first information when transmitting for the second time on the time slot 1; and so on.
Accordingly, the second device, when decoding, also determines the corresponding scrambling code for each repeated transmission, thereby descrambling the information received on the first channel according to the scrambling code.
In addition, considering that Redundancy Versions (RVs) may be introduced into the repeated transmission, and the difference of the redundancy versions may cause the first information subjected to incremental redundancy to be different, the first device may not generate a new scrambling code every time of repeated transmission, and may generate a new scrambling code every k times of repeated transmission.
The design of redundancy version is used for implementing Incremental Redundancy (IR) hybrid automatic repeat request (HARQ) transmission, that is, dividing redundancy bits generated by an encoder into a plurality of groups, each RV defining a transmission start point, and using different RVs for first transmission and each HARQ retransmission respectively to implement gradual accumulation of the redundancy bits and complete incremental redundancy HARQ operation. And RV can also be introduced in NR repeated transmission to realize incremental redundancy combination between different repeated transmissions.
Taking the common dynamically scheduled PDSCH and the semi-statically scheduled PDSCH as examples, the redundancy versions for the repeated transmission can be determined according to table 1. The n repeated transmissions of the PDSCH are denoted as n transmission opportunities (transmission opportunities), n =0,1.,. PDSCH _ aggregation factor-1, where PDSCH _ aggregation factor is the number of slots occupied by the repeated transmissions of the PDSCH and can be configured by the network device. Downlink Control Information (DCI) indicates RV for first transmission opportunity, for example, when transmission opportunity n =0, DCI indicates RV id When the transmission opportunity n =1 is 0, n mod 4=1 indicates the corresponding RV from table 1 id Is 2; when transmission opportunity n =2, n mod4=2, and RV can be known from table 1 id Is 3; when transmission opportunity n =3, n mod4=3, and RV can be known from table 1 id Is 1; and so on.
TABLE 1
Figure BDA0003190537630000101
The manner of determining the RV used by the PUSCH, PUCCH, PDCCH on each transmission opportunity is similar to the PDSCH, and is not illustrated here.
When the number of redundancy versions is 4, in the first to fourth repeated transmissions, the information obtained by the incremental redundancy of the first information is different, so that even if the scrambling is performed by using the same scrambling code in the fourth repeated transmission, the finally obtained scrambled information is different. Therefore, in order to reduce the number of times of generating the scrambling codes and simplify the operations of scrambling by the first device and descrambling by the second device, a new scrambling code can be generated at every 4 repeated transmissions, and the scrambling can be performed by using the same scrambling code in the 4 repeated transmissions in one period. For example, the first device may generate scrambling code 1 according to a time parameter corresponding to a time domain resource of the first repeated transmission, and scramble the first information after incremental redundancy according to scrambling code 1 in the first to fourth repeated transmissions; the first device may generate scrambling code 2 according to the time parameter during the fifth repeated transmission, and further scramble the first information after incremental redundancy according to scrambling code 2 in the fifth to eighth repeated transmissions.
It should be understood that, although the above embodiment takes the example of using the same scrambling code every 4 times of repeated transmission, in practical application, it may also be changed according to the scene requirement, that is, in n times of repeated transmission of the first information, the same scrambling code is used every k times of repeated transmission, where n and k are both positive integers.
In order to achieve interference random maximization in n times of repeated transmission, the value of k can be made to satisfy that the redundancy versions of the k times of repeated transmission are different. Because the redundancy versions of the k repeated transmissions adopting the same scrambling code are different, the coding bits obtained according to different redundancy versions are different, and incremental redundancy combination is performed among different redundancy versions, the performance of repeated transmission can be improved, such as the signal-to-interference ratio of the prompt repeated transmission. For example, when the number of redundancy versions is 4, k may be made to take a positive integer not greater than 4.
Correspondingly, if the first device generates a new scrambling code every k times of repeated transmission, and the k times of repeated transmission in a period employ the same scrambling code to scramble the first information, the second device also generates a new scrambling code every k times of repeated transmission when descrambling, and the k times of repeated transmission in a period employ the same scrambling code to descramble the received information.
In a possible implementation manner, when the first device performs step 501, a scrambling code may be generated according to the time parameter and the RNTI, or the time parameter and the scrambling code identifier, or the time parameter and the cell identifier, or the time parameter, the RNTI identifier, and the scrambling code identifier. Accordingly, the second device also needs to generate the scrambling code according to the above manner when descrambling, so as to decode the received information.
Further, the first device may generate the scrambling code according to a product of the time parameter and the RNTI, or may generate the scrambling code according to a product of the time parameter and the scrambling code identifier (and/or the cell identifier). In addition, the scrambling code can be generated according to the value obtained by the modulus of the time parameter. Correspondingly, the second device also generates the scrambling code according to the above mode when descrambling.
In one possible design, the scrambling parameter c used to initialize the scrambling code may be generated first when the scrambling code is generated init Then initializing parameter c according to scrambling code init And generating a scrambling code. Specifically, the scrambling parameter c may be generated according to the time parameter, or the time parameter and the RNTI, or the time parameter, the RNTI and the scrambling identifier init Then based on the scrambling parameter c init And generating a scrambling code.
The way in which the scrambling code parameters are generated is illustrated below.
Example 1, if the time parameter is an index of repetition number and the first channel is a PDSCH, the first device may determine the scrambling code parameter c according to any one of the following formulas (3), (4), (5) and (6) init Then according to the scrambling code parameter c init A scrambling code is generated.
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 5 )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 5 )modc+k 6 )·(k 7 ·n ID +k 8 ) (6)
Wherein n is RNTI An RNTI associated with the PDSCH, that is, an RNTI of the terminal device; n is rep Index number for number of repeated transmission; n is ID A scrambling code identifier or a physical layer cell identifier; for a scenario supporting transmission of at most two codewords, q ∈ {0,1} represents the number of codewords, and for a scenario of transmission of at most one codeword, k in the above formula can be expressed 2 Q deletion, or substituting q =0 into the above formula; a. b, c, d are constants, k 0 、k 1 、k 2 、k 3 、k 4 、k 5 、k 6 、k 7 、k 8 Mod represents the modulo operation, which is a constant. Alternatively, the constant may be a non-negative integer.
Correspondingly, when the second equipment descrambles, the scrambling parameter c is generated according to the formula adopted by the first equipment init Thereby generating a corresponding scrambling code for descrambling.
Example 2, if the time parameter is an absolute time parameter and the first channel is the PDSCH, the first device may determine the scrambling code parameter c according to any one of the following formulas (7), (8), (9) and (10) init Then according to the scrambling parameter c init A scrambling code is generated.
Figure BDA0003190537630000111
Figure BDA0003190537630000112
Figure BDA0003190537630000113
Figure BDA0003190537630000114
Wherein n is RNTI An RNTI associated with the PDSCH, that is, an RNTI of the terminal device; n is rep Index number for number of repeated transmission; n is ID A scrambling code identifier or a physical layer cell identifier; for a scenario supporting transmission of at most two codewords, q ∈ {0,1} represents the number of codewords;
Figure BDA0003190537630000115
the number of symbols contained in each time slot;
Figure BDA0003190537630000116
is a time slot number; l is the number of the initial symbol of the scrambled first information in the time slot; for at most two codeword transmissions, q ∈ {0,1} represents the number of codewords, and for at most one codeword transmission scenario, k in the above formula can be used 2 Q deletion, or substituting q =0 into the above formula; 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 Mod represents the modulo operation, which is a constant. Optionally, the constant may be a non-negative integer.
Correspondingly, when the second equipment descrambles, the scrambling parameter c is generated according to the formula adopted by the first equipment init Thereby generating a corresponding scrambling code for descrambling.
Example 3, if the time parameter is the index of repetition number and the first channel is the PUSCH, the first device may determine the scrambling code parameter c according to any one of the following formulas (11) and (12) init Then according to the scrambling parameter c init A scrambling code is generated. c. 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)
Wherein n is RNTI An RNTI associated with the PDSCH, that is, an RNTI of the terminal device; n is a radical of an alkyl radical rep Index number for number of repeated transmission; n is ID A scrambling code identifier or a physical layer cell identifier; a. b, c are constants, k 0 、k 1 、k 2 、k 3 、k 4 、k 5 、k 6 Mod represents the modulo operation, which is a constant. Optionally, the constant may be a non-negative integer.
Correspondingly, when the second equipment descrambles, the scrambling parameter c is generated according to the formula adopted by the first equipment init Thereby generating a corresponding scrambling code for descrambling.
Example 4, if the time parameter is an absolute time parameter and the first channel is a PUSCH, the first device may determine the scrambling code parameter c according to any one of the following equations (13) and (14) init Then according to the scrambling parameter c init A scrambling code is generated.
Figure BDA0003190537630000121
Figure BDA0003190537630000122
Wherein n is RNTI An RNTI associated with the PDSCH, that is, an RNTI of the terminal device; n is rep Index number for number of repeated transmission times; n is ID A scrambling code identifier or a physical layer cell identifier;
Figure BDA0003190537630000123
the number of symbols contained in each time slot;
Figure BDA0003190537630000124
is a time slot number; l is the number of the initial 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 、k 8 Mod represents the modulo operation, which is a constant. Optionally, the constant may be a non-negative integer.
Correspondingly, when the second equipment descrambles, the scrambling parameter c is generated according to the formula adopted by the first equipment init Thereby generating a corresponding scrambling code for descrambling.
Example 5, if the time parameter is an index of repetition number and the first channel is a PDCCH, the first device may determine the scrambling code parameter c according to any one of the following formulas (15) and (16) init Then according to the scrambling parameter c init A scrambling code is generated.
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)
Wherein n is RNTI RNTI (radio network temporary identifier) associated with the PDCCH, namely RNTI of terminal equipment; n is rep Index number for number of repeated transmission times; n is ID 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 Mod represents the modulo operation, which is a constant. Optionally, the constant may be a non-negative integer.
Correspondingly, when the second equipment descrambles, the scrambling parameter c is generated according to the formula adopted by the first equipment init Thereby generating a corresponding scrambling code for descrambling.
Example 6, if the time parameter is an absolute time parameter and the first channel is a PDCCH, the first device may determine the scrambling code parameter c according to any one of the following equations (17) and (18) init Then according toScrambling code parameter c init A scrambling code is generated.
Figure BDA0003190537630000125
Figure BDA0003190537630000126
Wherein n is RNTI RNTI (radio network temporary identifier) associated with the PDCCH, namely RNTI of terminal equipment; n is rep Index number for number of repeated transmission times; n is ID A scrambling code identifier or a physical layer cell identifier; n is f Is the radio frame number;
Figure BDA0003190537630000127
configuring the number of time slots contained in each radio frame under mu for the subcarriers;
Figure BDA0003190537630000128
the number of symbols contained in each time slot;
Figure BDA0003190537630000129
is a time slot number; l is the number of the initial 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 、k 8 Mod represents the modulo operation, which is a constant. Optionally, the constant may be a non-negative integer.
Correspondingly, when the second equipment descrambles, the scrambling parameter c is generated according to the formula adopted by the first equipment init Thereby generating a corresponding scrambling code for descrambling.
Example 7, if the time parameter is the index of the number of repetitions and the first channel is the PUCCH, the first device may determine the scrambling code parameter c according to any one of the following formulas (19) and (20) init Then according to the scrambling parameter c init A scrambling code is generated.
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)
Wherein n is RNTI RNTI related to the PUCCH, namely RNTI of terminal equipment; n is rep Index number for number of repeated transmission times; n is ID A scrambling code identifier or a physical layer cell identifier; n is f Is the radio frame number;
Figure BDA0003190537630000131
configuring the number of time slots contained in each radio frame under mu for the subcarriers;
Figure BDA0003190537630000132
the number of symbols contained in each time slot;
Figure BDA0003190537630000133
is a time slot number; l is the number of the initial 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 Mod represents the modulo operation, which is a constant. Alternatively, the constant may be a non-negative integer.
Correspondingly, when the second equipment descrambles, the scrambling parameter c is generated according to the formula adopted by the first equipment init Thereby generating a corresponding scrambling code for descrambling.
Example 8, if the time parameter is an absolute time parameter and the first channel is a PUCCH, the first device may determine the scrambling code parameter c according to any one of the following formulas (21) and (22) init Then according to the scrambling parameter c init A scrambling code is generated.
Figure BDA0003190537630000134
Figure BDA0003190537630000135
Wherein n is RNTI RNTI related to the PUCCH, namely RNTI of terminal equipment; n is rep Index number for number of repeated transmission times; n is ID A scrambling code identifier or a physical layer cell identifier; n is f Is the radio frame number;
Figure BDA0003190537630000136
configuring the number of time slots contained in each radio frame under mu for the subcarriers;
Figure BDA0003190537630000137
the number of symbols contained in each time slot;
Figure BDA0003190537630000138
is a time slot number; l is the number of the initial symbol of the scrambled first information in the time slot; a. b and c are constants, k 0 、k 1 、k 2 、k 3 、k 4 、k 5 、k 6 、k 7 、k 8 Mod represents the modulo operation, which is a constant. Optionally, the constant may be a non-negative integer.
Correspondingly, when the second equipment descrambles, the scrambling parameter c is generated according to the formula adopted by the first equipment init Thereby generating a corresponding scrambling code for descrambling.
In the above 8 examples, the scrambling code parameter c for generating the scrambling code is determined from the time parameter (relative time parameter or absolute time parameter) init Thus, each time the scrambling code parameter c is determined init The scrambling parameter c is changed due to the time parameter init The change is generated, and the generated scrambling codes are different, thereby being beneficial to improving the signal-to-interference ratio in repeated transmission.
In order to better understand the scrambling method provided in the embodiments of the present application, the following description is made with reference to specific embodiments.
In one embodiment, as shown in fig. 6, it is assumed that the transmission opportunity of the first channel is 8, that is, the first information carried by the first channel is repeatedly transmitted 8 times, and continuously occupies 8 slots, and the starting OFDM symbol of the first channel on each slot is symbol 3 and lasts for 11 symbols. According to the indication of the DCI, in the 8 repeated transmissions, the RV of the corresponding first information is transmitted repeatedly every time id Is 0,2,3,1,0,2,3,1. The first device may determine a scrambling code parameter once during each retransmission, and the scrambling codes used in the 8 retransmissions are different because the time parameter during each retransmission is different, which is C 0 、C 1 、C 2 、C 3 、C 4 、C 5 、C 6 、C 7
Optionally, the first device may determine, according to the above formulas (3) to (22), a time parameter corresponding to each repetitive transmission, and determine a corresponding scrambling code parameter, thereby determining a corresponding scrambling code.
In another embodiment, as shown in fig. 7, it is still assumed that the transmission opportunity of the first channel is 8, that is, the first information carried by the first channel is repeatedly transmitted 8 times, and continuously occupies 8 slots, and the starting OFDM symbol of the first channel on each slot is symbol 3 and lasts for 11 symbols. According to the indication of the DCI, in the 8 repeated transmissions, the RV of the corresponding first information is transmitted repeatedly every time id 0,2,3,1,0,2,3,1. The first device may determine the scrambling parameter once every 4 repeated transmissions, i.e. the first device generates the scrambling code C according to the time parameter corresponding to the 0 th repeated transmission 0 And scrambling code C is adopted during the 0 th to 3rd repeated transmission 0 Generating a scrambling code C according to the time parameter corresponding to the 4 th repeated transmission 1 And scrambling code C is adopted in 4 th to 7 th repeated transmission 1 Therefore, the scrambling codes used for the 8 repeated transmissions are respectively C 0 、C 0 、C 0 、C 0 、C 1 、C 1 、C 1 、C 1 . Although the scrambling codes adopted in the 0 th to 3rd repeated transmissions are all C 0 But due to the 0 thRV adopted in repeated transmission for 3 times is different, so that finally sent information in repeated transmission for 0 to 3 times is different. Similarly, although the scrambling codes used in the 4 th to 7 th repeated transmission are all C 1 However, since the RV used in the 4 th to 7 th retransmission is different, the information to be finally transmitted in the 4 th to 7 th retransmission is different.
Optionally, the first device may determine, according to the formulas (3) to (22), time parameters corresponding to 0 th retransmission and 4 th retransmission, and determine corresponding scrambling code parameters, thereby determining corresponding scrambling codes.
Based on the same technical concept, the embodiment of the present application further provides a communication apparatus, where the communication apparatus is configured to implement the steps performed by the first device in the foregoing method embodiments.
In a possible design, the communication apparatus may include a module corresponding to one to perform the method/operation/step/action performed by the first device in the foregoing method embodiment, where the module may be a hardware circuit, a software circuit, or a combination of a hardware circuit and a software circuit.
Illustratively, the communication apparatus may include a generating module 801, a scrambling module 802, and a transmitting module 803, as shown in fig. 8. Specifically, the generating module 801 is configured to generate a scrambling code according to the time parameter; a scrambling module 802, configured to scramble the first information according to the scrambling code; a sending module 803, configured to send the scrambled first information to the second device on the first channel.
In a possible implementation manner, the communication apparatus further includes a determining module 804 configured to determine the time parameter according to a time domain resource used for transmitting the first information.
Based on the same technical concept, the embodiment of the present application further provides a communication apparatus, where the communication apparatus is configured to implement the steps performed by the second device in the foregoing method embodiments.
In a possible design, the communication apparatus may include a module corresponding to one to perform the method/operation/step/action performed by the second device in the above method embodiment, where the module may be a hardware circuit, a software circuit, or a combination of a hardware circuit and a software circuit.
Illustratively, the communication apparatus may be as shown in fig. 9, and include a generating module 901, a receiving module 902, and a descrambling module 903. Specifically, the generating module 901 is configured to generate a scrambling code according to the time parameter; a receiving module 802 for receiving information on a first channel; a descrambling module 903, configured to descramble the information received on the first channel according to the scrambling code, so as to obtain the first information.
In a possible implementation manner, the communication apparatus further includes a determining module 904 configured to determine the time parameter according to a time domain resource used for transmitting the first information.
Based on the same technical concept, the embodiment of the 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, an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, or one or more integrated circuits for controlling the execution of programs in accordance with the teachings of the present application, or the like. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in a processor.
Communication interface 1002 may be any device, such as a transceiver, for communicating with other devices or communication networks, such as an ethernet, a Radio Access Network (RAN), a Wireless Local Area Network (WLAN), etc.
In the embodiment of the present application, the processor 1001 is configured to call the communication interface 1002 to perform the receiving and/or sending functions and execute the method according to any one of the foregoing possible implementation manners.
Further, the communication apparatus may further include a memory 1003 and a communication bus 1004.
The memory 1003 is used for storing program instructions and/or data, so that the processor 1001 can call the instructions and/or data stored in the memory 1003 to implement the above functions of the processor 1001. The memory 1003 may be, but is not limited to, a read-only memory (ROM) or other type of static storage device that may store static information and instructions, a Random Access Memory (RAM) or other type of dynamic storage device that may store information and instructions, an electrically erasable programmable read-only memory (EEPROM) or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory 1003 may be a stand-alone memory, such as an off-chip memory, coupled to the processor 1001 via a communication bus 1004. The memory 1003 may also be integrated with the processor 1001.
The communication bus 1004 may include a path that conveys information between the aforementioned components.
For example, the communication device may be a first device in the foregoing method embodiment, or may be a second device in the foregoing method embodiment.
The processor 1001 is used for implementing data processing operations of the communication apparatus, and the communication interface 2002 is used for implementing receiving operations and transmitting operations of the communication apparatus.
When the communication apparatus is a first device, the processor 1001 is configured to generate a scrambling code according to a time parameter; scrambling the first information according to the scrambling codes; the scrambled first information is sent to the second device over the first channel through the communication interface 1002.
In addition, the above components may also be used to support other processes performed by the first device in the above method embodiments.
The beneficial effects can be obtained by referring to the foregoing description, and are not described in detail herein.
When the communication apparatus is a second device, the processor 1001 is configured to generate a scrambling code according to the time parameter; receiving information on the first channel through the communication interface 1002, and descrambling the received information according to the generated scrambling code to acquire the first information.
Furthermore, the above components may also be used to support other processes performed by the second device in the above method embodiments.
The beneficial effects can be obtained by referring to the foregoing description, and are not described in detail herein.
Based on the same technical concept, embodiments of the present application further provide a computer-readable storage medium, where computer-readable instructions are stored, and when the computer-readable instructions are executed on a computer, the scrambling method according to any one of the foregoing possible implementations is executed.
Embodiments of the present application provide a computer program product containing instructions, which when run on a computer, cause the computer to perform embodiments of the above-described scrambling method.
Embodiments of the present application provide a computer program product comprising instructions which, when run on a computer, cause the above-described method embodiments to be performed.
In the description of the embodiment of the present application, "and/or" describes an association relationship of an association object, which means that three relationships may exist, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The plural in the present application means two or more.
It is to be understood that the terms "first," "second," and the like, in the description of the present application, are used for distinguishing between descriptions and not necessarily for describing a sequential or chronological order, or for indicating or implying a relative importance. Reference throughout this specification to "one embodiment" or "some embodiments," or the like, means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the present application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," or the like, in various places throughout this specification are not necessarily all referring to the same embodiment, but rather "one or more but not all embodiments" unless specifically stated otherwise. The terms "comprising," "including," "having," and variations thereof mean "including, but not limited to," unless expressly specified otherwise.
The method steps in the embodiments of the present application may be implemented by hardware, or may be implemented by software instructions executed by a processor. The software instructions may be comprised of corresponding software modules that may 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, a hard disk, a removable hard disk, a 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. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an ASIC. In addition, the ASIC may reside in a base station or a terminal. Of course, the processor and the storage medium may reside as discrete components in a base station or terminal.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are performed in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, a network appliance, a user device, or other programmable apparatus. The computer program or instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer program or instructions may be transmitted from one website, computer, server or data center to another website, computer, server or data center by wire or wirelessly. The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that integrates one or more available media. The usable medium may be a magnetic medium, such as a floppy disk, a hard disk, a magnetic tape; optical media such as digital video disks; but also semiconductor media such as solid state disks. The computer readable storage medium may be volatile or nonvolatile storage medium, or may include both volatile and nonvolatile types of storage media.
In the embodiments of the present application, unless otherwise specified or conflicting with respect to logic, the terms and/or descriptions in different embodiments have consistency and may be mutually cited, and technical features in different embodiments may be combined to form a new embodiment according to their inherent logic relationship.
It is to be understood that the various numerical references referred to in the embodiments of the present application are merely for convenience of description and distinction and are not intended to limit the scope of the embodiments of the present application. The sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of the processes should be determined by their functions and inherent logic.

Claims (27)

1. A scrambling method, characterized in that the method comprises:
the first equipment generates a scrambling code according to the time parameter;
the first equipment scrambles the first information according to the scrambling codes;
and the first equipment sends the scrambled first information to the second equipment on a first channel.
2. The method of claim 1, further comprising:
and the first equipment determines the time parameter according to the time domain resource used for sending the first information.
3. The method of claim 2, wherein the determining, by the first device, the time parameter according to the time domain resource used for transmitting the first information comprises:
and the first equipment determines the time parameter according to the position of the time domain resource which sends the first information in the time domain resource in the repeated transmission of n times.
4. The method according to claim 1 or 2, wherein the time parameter comprises at least one or any combination of the following parameters: radio frame number, field number, subframe number, slot number, symbol number.
5. The method according to any of claims 1-4, wherein the first information is transmitted repeatedly n times, wherein the scrambling code of each k repeated transmissions of the n repeated transmissions is the same, and wherein n and k are positive integers.
6. The method of claim 5, wherein the k repeated transmissions have different redundancy versions.
7. The method of claim 6, wherein k is 2 or 4.
8. The method according to any of claims 1-7, wherein the first device generates a scrambling code according to a time parameter, comprising:
generating a scrambling code according to the time parameter and the radio network temporary identifier RNTI; or
Generating a scrambling code according to the time parameter and the scrambling code identifier; or
And generating a scrambling code according to the time parameter, the RNTI and the scrambling code identifier.
9. The method of claim 8, wherein generating a scrambling code according to the time parameter and the RNTI comprises: generating a scrambling code according to the product of the time parameter and the RNTI; and/or
Generating a scrambling code according to the time parameter and the scrambling code identifier comprises: and generating a scrambling code according to the product of the time parameter and the scrambling code identifier.
10. The method according to any of claims 1-9, wherein the first channel comprises any 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.
11. The method of any one of claims 1-10, wherein the first channel is a PDSCH;
the first device generates a scrambling code according to the time parameter, and the method comprises the following steps:
determining a scrambling code parameter c according to the following formula 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 (ii) a Or alternatively
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 (ii) a Or alternatively
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 (ii) a 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 ) (ii) a Or
Figure FDA0003190537620000011
Figure FDA0003190537620000012
Or
Figure FDA0003190537620000021
Figure FDA0003190537620000022
Or
Figure FDA0003190537620000023
Figure FDA0003190537620000024
Or
Figure FDA0003190537620000025
Wherein n is RNTI An RNTI associated with the PDSCH; nrep is the index number of the number of repeated transmission times; n is ID Is a scrambling code identifier or a physical layer cell identifier; nf is the radio frame number;
Figure FDA0003190537620000026
configuring the number of time slots contained in each radio frame under mu for the subcarriers;
Figure FDA0003190537620000027
the number of symbols contained in each time slot;
Figure FDA0003190537620000028
is a time slot number; l is the number of the initial symbol of the scrambled first information in the time slot; for a maximum of two codeword transmissions, qE {0,1}; 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 Is a constant;
according to the scrambling code parameter c init A scrambling code is generated.
12. The method according to any of claims 1-10, wherein the first channel is a PUSCH;
the first device generates a scrambling code according to the time parameter, and the method comprises the following steps:
determining a scrambling code parameter c according to the following formula 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 (ii) a 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 (ii) a Or
Figure FDA0003190537620000029
Figure FDA00031905376200000210
Or
Figure FDA00031905376200000211
Figure FDA00031905376200000212
Wherein n is RNTI An RNTI associated with the PUSCH; n is rep Index number for number of repeated transmission times; n is a radical of an alkyl radical ID A scrambling code identifier or a physical layer cell identifier; nf is the radio frame number;
Figure FDA00031905376200000213
configuring the number of time slots contained in each radio frame under mu for the subcarriers;
Figure FDA00031905376200000214
the number of symbols contained in each time slot;
Figure FDA00031905376200000215
is a time slot number; l is the number of the initial symbol of the scrambled first information in the time slot; a. b and c are constants, k 0 、k 1 、k 2 、k 3 、k 4 、k 5 、k 6 、k 7 、k 8 Is a constant;
according to the scrambling code parameter c init A scrambling code is generated.
13. The method of any one of claims 1-10, wherein the first channel is a PDCCH;
the first device generates a scrambling code according to the time parameter, and the method comprises the following steps:
determining a scrambling code parameter c according to the following formula 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 (ii) a 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 (ii) a Or
Figure FDA00031905376200000216
Figure FDA00031905376200000217
Or
Figure FDA00031905376200000218
Wherein n is RNTI An RNTI associated with the PDCCH; n is a radical of an alkyl radical rep Index number for number of repeated transmission times; n is ID Is a scrambling code identifier or a physical layer cell identifier; n is f Is the radio frame number;
Figure FDA0003190537620000031
configuring the number of time slots contained in each radio frame under mu for the subcarriers;
Figure FDA0003190537620000032
the number of symbols contained in each time slot;
Figure FDA0003190537620000033
is a time slot number; l is the number of the initial symbol of the scrambled first information in the time slot; a. b, c, d are constants, k 0 、k 1 、k 2 、k 3 、k 4 、k 5 、k 6 、k 7 、k 8 Is a constant;
according to the scrambling code parameter c init A scrambling code is generated.
14. The method according to any of claims 1-10, characterized in that the first channel, PUCCH;
the first device generates a scrambling code according to the time parameter, and the method comprises the following steps:
determining a scrambling code parameter c according to the following formula 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 (ii) a Or alternatively
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 (ii) a Or
Figure FDA0003190537620000034
Figure FDA0003190537620000035
Or alternatively
Figure FDA0003190537620000036
Wherein n is RNTI An RNTI associated with the PUCCH; n is rep Index number for number of repeated transmission times; n is ID Is a scrambling code identifier or a physical layer cell identifier; n is a radical of an alkyl radical f Is the radio frame number;
Figure FDA0003190537620000037
configuring the number of time slots contained in each radio frame under mu for the subcarriers;
Figure FDA0003190537620000038
the number of symbols contained in each time slot;
Figure FDA0003190537620000039
is a time slot number; l is the number of the initial 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 、k 8 Is a constant;
according to the scrambling code parameter c init A scrambling code is generated.
15. A descrambling method, characterized in that it comprises:
the first equipment generates a scrambling code according to the time parameter;
and the first equipment descrambles the information received on the first channel according to the scrambling code so as to acquire first information.
16. The method of claim 15, further comprising:
the first device determines the time parameter according to a time domain resource for receiving the first information.
17. The method of claim 16, wherein the first device determines the time parameter according to time domain resources used for receiving the first information, comprising:
and the first equipment determines the time parameter according to the position of the time domain resource receiving the first information in the time domain resource in the repeated transmission of n times.
18. The method according to claim 15 or 16, wherein the time parameter comprises at least one or any combination of the following parameters: radio frame number, field number, subframe number, time slot number, symbol number.
19. The method according to any of claims 15-18, wherein the first information is transmitted n times repeatedly, wherein the scrambling code for each k times of the n times of repeated transmission is the same, and wherein n and k are positive integers.
20. The method of claim 19, wherein the k repeated transmissions have different redundancy versions.
21. The method of claim 20, wherein k is 2 or 4.
22. The method according to any of claims 15-21, wherein the first device generates a scrambling code according to a time parameter, comprising:
generating a scrambling code according to the time parameter and the radio network temporary identifier RNTI; or alternatively
Generating a scrambling code according to the time parameter and the scrambling code identifier; or
And generating a scrambling code according to the time parameter, the RNTI and the scrambling code identifier.
23. The method of claim 22, wherein generating a scrambling code according to the time parameter and an RNTI comprises: generating a scrambling code according to the product of the time parameter and the RNTI; and/or
Generating a scrambling code according to the time parameter and the scrambling code identifier comprises: and generating a scrambling code according to the product of the time parameter and the scrambling code identifier.
24. The method according to any of claims 15-23, wherein the first channel comprises any 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.
25. A communications apparatus, comprising: a processor, and a memory and a communication interface respectively coupled to the processor; the communication interface is used for communicating with other equipment; the processor, for executing instructions or programs in the memory, to perform the method of any of claims 1-14 via the communication interface.
26. A communications apparatus, comprising: a processor, and a memory and a communication interface each coupled to the processor; the communication interface is used for communicating with other equipment; the processor, for executing instructions or programs in the memory, to perform the method of any of claims 15-24 through the communication interface.
27. A computer-readable storage medium having stored therein instructions which, when executed on a computer, cause the computer to perform the method of any one of claims 1-24.
CN202110876667.8A 2021-07-31 2021-07-31 Scrambling and descrambling method and communication device Pending CN115695109A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202110876667.8A CN115695109A (en) 2021-07-31 2021-07-31 Scrambling and descrambling method and communication device
PCT/CN2022/098690 WO2023011008A1 (en) 2021-07-31 2022-06-14 Scrambling method, descrambling method and communication apparatus

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110876667.8A CN115695109A (en) 2021-07-31 2021-07-31 Scrambling and descrambling method and communication device

Publications (1)

Publication Number Publication Date
CN115695109A true CN115695109A (en) 2023-02-03

Family

ID=85059643

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110876667.8A Pending CN115695109A (en) 2021-07-31 2021-07-31 Scrambling and descrambling method and communication device

Country Status (2)

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

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9516541B2 (en) * 2013-09-17 2016-12-06 Intel IP Corporation Congestion measurement and reporting for real-time delay-sensitive applications
CN106161302A (en) * 2015-04-09 2016-11-23 电信科学技术研究院 A kind of method and device of information transmission
US20170048014A1 (en) * 2015-08-13 2017-02-16 Spreadtrum Hong Kong Limited Apparatus and method for generating scrambling codes for repetition transmissions
EP3562248B1 (en) * 2017-01-11 2022-05-04 Huawei Technologies Co., Ltd. Message transmission method and device
CN108988978B (en) * 2017-06-01 2021-01-15 华为技术有限公司 Scrambling code sequence generation method and device

Also Published As

Publication number Publication date
WO2023011008A1 (en) 2023-02-09

Similar Documents

Publication Publication Date Title
US20220256542A1 (en) Radio station, radio terminal apparatus, and method for these
TWI771202B (en) Uplink ack resource allocation in new radio
US20190297658A1 (en) Methods and apparatus for determining device-to-device transmission patterns
AU2016244719B2 (en) Physical resource block allocation of physical downlink control and data channels
JP6926043B2 (en) Terminal equipment, base station equipment and their communication methods
US11843935B2 (en) Method of transmitting a transport block and apparatus using the same
CN110621075B (en) Method and device for transmitting data
EP3590213B1 (en) Uplink multi-bits acknowledgement for self contained transmissions
CN115553005A (en) Side feedback resource configuration method, terminal equipment and network equipment
US20220052797A1 (en) Information Transmission Method And Communications Device
CN105379133A (en) Method and apparatus for transmitting signal in wireless communication system
CN113287263B (en) Frequency hopping method and device
US10298375B2 (en) System, method, and apparatus for selecting downlink control information format
JP7110244B6 (en) Wireless communication method and device
CN117375772A (en) Method for disabling and enabling hybrid automatic repeat request feedback
CN113517948A (en) Data processing method, device and system
CN112187401A (en) Multi-time unit transmission method and related device
CN114391231B (en) Communication method and communication device
CN115695109A (en) Scrambling and descrambling method and communication device
KR20220050766A (en) Method and apparatus for transmitting and receiving broadcast signal in communication system
CN115004828A (en) Communication method and communication device
WO2024065654A1 (en) Feedback information determination method and apparatus, device, and storage medium
CN115189851B (en) Method and device for determining frequency domain resource position, terminal and network equipment
US20230224908A1 (en) Method for repeatedly transmitting control channel, terminal device, and network device
US20240073902A1 (en) Information transmission method and apparatus

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication