WO2020048542A1 - 配置无线网络临时标识rnti的方法和装置 - Google Patents

配置无线网络临时标识rnti的方法和装置 Download PDF

Info

Publication number
WO2020048542A1
WO2020048542A1 PCT/CN2019/104807 CN2019104807W WO2020048542A1 WO 2020048542 A1 WO2020048542 A1 WO 2020048542A1 CN 2019104807 W CN2019104807 W CN 2019104807W WO 2020048542 A1 WO2020048542 A1 WO 2020048542A1
Authority
WO
WIPO (PCT)
Prior art keywords
rows
rntis
hamming weight
bit
bits
Prior art date
Application number
PCT/CN2019/104807
Other languages
English (en)
French (fr)
Inventor
张公正
颜冯尧
朱景龙
杨星
高飞
武雨春
魏岳军
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2020048542A1 publication Critical patent/WO2020048542A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H04L5/001—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT the frequencies being arranged in component carriers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H04L1/0058—Block-coded modulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals

Definitions

  • the present application relates to the field of wireless communications, and in particular, to a method and device for configuring an RNTI.
  • a transmitting end when a transmitting end sends a bit sequence to a receiving end, in order to verify the correctness of the received bit sequence at the receiving end, the transmitting end may add several (for example, 24) check bits to the information bit sequence. . Further, the transmitting end may use a wireless network temporary identity (RNTI) to mask the last few bits (for example, the last 16 bits) of the check bit. This process is called RNTI masking. Finally, the bit sequence masked by the RNTI is sent to the receiving end through processing such as channel coding and modulation. The receiving end inputs the received data to a decoder for decoding after processing such as demodulation, and outputs multiple candidate decoding paths.
  • RNTI wireless network temporary identity
  • the transmitting end uses RNTI for masking
  • the receiving end needs to perform an unmasking attempt.
  • the system is configured with multiple RNTIs for the receiving end, and the RNTI used by the transmitting end to mask the bit sequence is one of these RNTIs, but the receiving end does not know that the transmitting end specifically uses these multiple RNTIs. Which of the three RNTIs needs to be used for unmasking attempts one by one. Theoretically, only when the RNTI used for demasking at the receiving end and the RNTI used for masking at the transmitting end are the same, the bit sequence after demasking can pass the cyclic redundancy check (CRC). Finally, the receiving end will output the candidate decoding path that passes the CRC after being demasked by the RNTI as the decoding path.
  • CRC cyclic redundancy check
  • channel coding will use polar codes (ie, polar codes).
  • the receiving end uses a serial cancellation list (SCL) decoding algorithm for decoding.
  • SCL serial cancellation list
  • FAR false alarm probability
  • the information bit sequence is decoded correctly, but the candidate decoding paths that have respectively been demasked by multiple RNTIs have passed the CRC.
  • the information bit sequence is decoded correctly, but the RNTI corresponding to the path that finally passes the CRC is not the RNTI used when the transmitting end masks.
  • the information bit sequence is decoded incorrectly, and the RNTI corresponding to the path passing the CRC is not the RNTI used when the transmitting end masks. It can be seen that the false alarm probability is high, which will directly affect the correctness of the information received by the receiving end.
  • This application provides a method and device for configuring an RNTI, which can reduce the false alarm probability.
  • the present application provides a method for configuring an RNTI.
  • the method includes: a transmitting end configuring multiple wireless network temporary identifiers RNTI, each RNTI in the multiple RNTIs includes L bits, and the L bits correspond to pole L of the N rows of the generation matrix of the encoding code, each of the N rows having a Hamming weight, wherein the multiple RNTIs have the same I bit, and the I bit is in the multiple
  • Each RNTI of the RNTI corresponds to the same bit position, and the I bit corresponds to I of the M rows having the first Hamming weight in the L rows, and the first Hamming weight is the L
  • the minimum value of the Hamming weight of the line is 1 ⁇ I ⁇ M ⁇ L ⁇ N, and N, L, I, and M are integers; the transmitting end sends configuration information to the receiving end, and the configuration information is used to indicate the multiple RNTIs.
  • each RNTI includes L bits, and the L bits correspond to L rows of the N rows of the generation matrix of the polarization code.
  • Each of the L rows has a Hamming weight, so the L rows correspond to multiple (may be equal to or less than L) Hamming weights. These multiple Hamming weights vary from small to large.
  • Each of the plurality of RNTIs has the same value of a bit at a bit position corresponding to the row with the smallest Hamming weight.
  • the transmitting end uses one of the multiple RNTIs to mask the bit sequence sent to the receiving end.
  • the receiving end uses the multiple RNTIs to unmask the masked bit sequence, which can reduce the probability of false alarms.
  • the multiple RNTIs also have J identical bits, and the J bits correspond to the same bit position in each of the multiple RNTIs.
  • the J bits correspond to the J rows of the P rows having the second Hamming weight among the L rows, the second Hamming weight is greater than the first Hamming weight, and the second Hamming weight is less than the L rows except Hamming weights of the I rows and the remaining rows other than the P rows, 1 ⁇ J ⁇ L, I + J ⁇ L, and J is an integer.
  • the value of the bits at the bit positions corresponding to some or all of the rows with the second-smaller Hamming weight of the plurality of RNTIs can be further guaranteed. the same. Can further reduce the probability of false alarms.
  • the multiple RNTIs also have R identical bits, and the R identical bits correspond to the same bit position in each of the multiple RNTIs ,
  • the R bits correspond to the R rows of the Q rows having the third Hamming weight in the L rows, the third Hamming weight is greater than the second Hamming weight, and the third Hamming weight is less than the L rows
  • the Hamming weights of the other rows except the I rows, the P rows, and the Q rows are 1 ⁇ R ⁇ L, I + J + R ⁇ L, and R is an integer.
  • bit configuration to the bit position corresponding to the row of the next-small Hamming weight is the same, which can further reduce the false alarm probability.
  • the transmitting end configures multiple RNTIs, including: the transmitting end configures the multiple RNTIs according to the Hamming weights of the L rows of the generation matrix; or The terminal configures the plurality of RNTIs according to the reliability parameters of the L rows of the generation matrix, wherein the reliability parameters of each row are used to characterize the reliability of the polarized channel corresponding to the row; or The Hamming weights of the L rows of the matrix and the reliability parameters of the L rows configure the multiple RNTIs.
  • the transmitting end may configure the multiple RNTIs according to a Hamming weight of the L rows and / or a reliability parameter of the L rows of the generation matrix.
  • the multiple RNTIs can be flexibly configured in different situations.
  • the transmitting end configures the multiple RNTIs according to the Hamming weights of the L rows of the generation matrix and the reliability parameters of the L rows, including: When the Hamming weights of at least two of the L lines are the same, the bits of the bit positions corresponding to the at least two lines of the multiple RNTIs are configured according to the reliability parameters of the at least two lines, where the The bit configurations of the plurality of RNTIs corresponding to the bit positions of the at least two rows having a smaller reliability are the same.
  • the method further includes: the transmitting end adds a cyclic redundancy check CRC bit to a first bit sequence that needs to be sent to the receiving end to obtain a second bit sequence; transmitting The end uses one of the multiple RNTIs to mask the second bit sequence to obtain a third bit sequence; the transmitting end sends the third bit sequence to the receiving end.
  • the present application provides a method for configuring an RNTI.
  • the method includes: a receiving end receives configuration information from a transmitting end, the configuration information is used to indicate multiple RNTIs, and each of the multiple RNTIs includes L bits , The L bits correspond to L rows of the N rows of the generation matrix of the polarization code, each of the N rows has a Hamming weight, wherein the multiple RNTIs have the same I bit, The I bit corresponds to the same bit position in each RNTI of the plurality of RNTIs, and the I bit corresponds to I of the M rows having the first Hamming weight among the L rows, and the first Han
  • the light weight is the minimum value of the Hamming weight of the L rows, 1 ⁇ I ⁇ M ⁇ L ⁇ N, and N, L, I, and M are integers; the receiving end uses the multiple RNTIs for multiple candidates The decoding path is unmasked.
  • the multiple RNTIs also have J identical bits, and the J bits correspond to the same bit position in each of the multiple RNTIs, the The J bits correspond to the J rows of the P rows having the second Hamming weight among the L rows, the second Hamming weight is greater than the first Hamming weight, and the second Hamming weight is less than the L rows except Hamming weights of the I rows and the remaining rows other than the P rows, 1 ⁇ J ⁇ L, I + J ⁇ L, and J is an integer.
  • the multiple RNTIs also have R identical bits, and the R identical bits correspond to the same bit position in each of the multiple RNTIs ,
  • the R bits correspond to the R rows of the Q rows having the third Hamming weight in the L rows, the third Hamming weight is greater than the second Hamming weight, and the third Hamming weight is less than the L rows
  • the Hamming weights of the other rows except the I rows, the P rows, and the Q rows are 1 ⁇ R ⁇ L, I + J + R ⁇ L, and R is an integer.
  • the multiple RNTIs also have R identical bits, and the R identical bits correspond to the same bit position in each of the multiple RNTIs ,
  • the R bits correspond to the R rows of the Q rows having the third Hamming weight in the L rows, the third Hamming weight is greater than the second Hamming weight, and the third Hamming weight is less than the L rows
  • the Hamming weights of the other rows except the I rows, the P rows, and the Q rows are 1 ⁇ R ⁇ L, I + J + R ⁇ L, and R is an integer.
  • the multiple RNTIs are configured by the transmitting end according to the Hamming weights of the L rows of the generation matrix; or, the multiple RNTIs are configured by the transmitting end according to the generation matrix
  • the reliability parameters of the L rows are configured, wherein the reliability parameters of each row are used to characterize the reliability of the polarized channel corresponding to the row; or, the plurality of RNTIs Hamming weight and reliability parameters of L rows are configured.
  • the multiple RNTIs when the Hamming weight of at least two of the L rows is the same, the multiple RNTIs have a smaller weight than the at least two rows.
  • the bit configurations of the bit positions corresponding to the reliability rows are the same.
  • the method further includes: the receiving end receives the sequence to be decoded from the transmitting end, and decodes the sequence to be decoded to obtain multiple candidate decoding paths; receiving The terminal output uses the candidate decoding path of the CRC that passes the cyclic redundancy check CRC after unmasking any one of the multiple RNTIs as the decoding path.
  • the present application provides a communication apparatus for performing the first aspect or the method in any possible implementation manner of the first aspect.
  • the communication apparatus includes a unit that executes the first aspect or the method in any possible implementation manner of the first aspect.
  • the present application provides a communication apparatus for performing the second aspect or the method in any possible implementation manner of the second aspect.
  • the communication apparatus includes a unit that executes the second aspect or the method in any possible implementation manner of the second aspect.
  • the present application provides a network device, including a transceiver, a processor, and a memory.
  • the processor is used to control the transceiver to send and receive signals
  • the memory is used to store the computer program
  • the processor is used to call and run the computer program stored in the memory, so that the network device executes the first aspect and the method in any possible implementation manner of the first aspect.
  • the present application provides a terminal device including a transceiver, a processor, and a memory.
  • the processor is used to control the transceiver to send and receive signals
  • the memory is used to store the computer program
  • the processor is used to call and run the computer program stored in the memory, so that the terminal device executes the second aspect and the method in any possible implementation manner of the second aspect.
  • the present application provides a computer-readable storage medium.
  • the computer-readable storage medium stores instructions. When the instructions are run on a computer, the computer is caused to execute the first aspect or any possible implementation manner of the first aspect. Method.
  • the present application provides a computer-readable storage medium.
  • the computer-readable storage medium stores instructions. When the instructions are run on a computer, the computer is caused to execute the second aspect or any possible implementation manner of the second aspect. Methods.
  • the present application provides a chip, including a memory and a processor.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program from the memory to execute the first aspect and any of the first aspect.
  • the chip only includes a processor, and the processor is configured to read and execute the computer program stored in the memory.
  • the processor executes the method in the first aspect or any possible implementation manner of the first aspect. .
  • the present application provides a chip, including a memory and a processor.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program from the memory to execute the second aspect or any possible implementation of the second aspect. Way in the way.
  • the above chip only includes a processor, and the processor is configured to read and execute the computer program stored in the memory.
  • the processor executes the method in the second aspect or any possible implementation manner of the second aspect. .
  • the present application provides a computer program product including computer program code, and when the computer program code runs on a computer, the computer causes the computer to execute the method in the first aspect or any possible implementation manner thereof. .
  • the present application provides a computer program product including computer program code.
  • the computer program code runs on a computer, the computer causes the computer to execute the method in the second aspect or any possible implementation manner thereof.
  • the foregoing memory and the memory may be physically independent units, or the memory may be integrated with the processor.
  • the present application provides a method for configuring an RNTI.
  • the method includes: the transmitting end configures a length N of a wireless network temporary identifier RNTI according to needs, selects M bits to generate multiple first bit sequences, M ⁇ N, N and M are integers; each first bit sequence in the plurality of first bit sequences is linearly coded to obtain a plurality of second bit sequences, and the plurality of second bit sequences are identical to the plurality of first bit sequences.
  • the transmitting end sends configuration information to the receiving end, and the configuration information is used to indicate L second bit sequences in the plurality of second bit sequences, where L ⁇ 2 and is an integer.
  • each second bit sequence is an RNTI. Therefore, the generated multiple second RNTIs can form a candidate set of RNTIs.
  • the transmitting end randomly selects L RNTIs from the candidate RNTI set, and notifies the receiving end of the selected L RNTIs. Subsequently, the transmitting end uses one of the L RNTIs to mask the bit sequence to be masked, and sends the masked bit sequence to the receiving end.
  • the receiving end uses the L RNTI to perform a demasking attempt on the bit sequence to be demasked. The process of adding and unmasking the RNTI is the same as that in the method of the first aspect, and will not be described again.
  • the encoding method used when the first bit sequence is encoded may be any one of the following encodings: convolutional code, Turbo code, LDPC, CRC code, RM code, and cyclic code.
  • the method further includes: performing bit interleaving on each second bit sequence in the plurality of second bit sequences, and using the plurality of bit sequences obtained after interleaving as the candidate set of the RNTI.
  • bit sequence obtained after bit interleaving of each second bit sequence is an RNTI.
  • the present application provides a communication device for performing the thirteenth aspect or the method in any possible implementation manner of the thirteenth aspect.
  • the communication device includes a unit that executes the method in the thirteenth aspect or any possible implementation of the thirteenth aspect.
  • the functions of the communication device may be partially or completely implemented by software.
  • the communication device may include a memory and a processor, where the memory is used to store a computer program, and the processor reads and runs the computer program from the memory to perform the method in the thirteenth aspect.
  • the communication device includes a processor, the memory for storing the computer program is located outside the communication device, and the processor is connected to the memory through a circuit / wire.
  • the communication device may be a chip or an integrated circuit.
  • the present application provides a chip including a memory and a processor.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program from the memory to execute the thirteenth aspect and its thirteenth aspect. Methods in any possible implementation.
  • the present application provides a computer-readable storage medium.
  • the computer-readable storage medium stores instructions, and when the instructions run on the computer, the computer is caused to execute the thirteenth aspect or any of the thirteenth aspects. Method in implementation.
  • the present application provides a computer program product that includes computer program code, and when the computer program code runs on a computer, causes the computer to execute the method in the thirteenth aspect or any of its possible implementations .
  • the technical solution provided in this application analyzes the characteristics of the SCL decoding algorithm of the polar code and finds the cause of the RNTI false alarm, so as to propose a method for configuring the RNTI.
  • the multiple RNTIs configured according to this method meet some characteristics (for details, see the description in the description).
  • the transmitting end uses one of the multiple RNTIs to mask the bit sequence sent to the receiving end.
  • the receiving end uses the multiple RNTIs to unmask the bit sequence received from the transmitting end, which can reduce the probability of false alarms.
  • FIG. 1 is a wireless communication system 100 applicable to the present application.
  • FIG. 1 is the basic flow of wireless communication.
  • FIG. 3 is a schematic diagram of a channel coding and decoding process provided by the present application.
  • Figure 4 is a schematic diagram of the SCL decoding process.
  • FIG. 5 is a schematic diagram of a case of false alarm.
  • FIG. 6 is a schematic diagram of another case of false alarm.
  • FIG. 10 is a schematic diagram of the Hamming weight of the corresponding row of the RNTI pair and the generation matrix that causes false alarms.
  • FIG. 14 is a flowchart of a method 200 for configuring an RNTI provided in this application.
  • FIG. 15 is a flowchart of another method 300 for configuring an RNTI provided by this application.
  • FIG. 16 is a schematic block diagram of a communication device 500 provided in the present application.
  • FIG. 17 is a schematic block diagram of a communication device 600 provided in the present application.
  • FIG. 18 is a schematic block diagram of a communication device 700 provided in the present application.
  • FIG. 19 is a schematic block diagram of a communication device 800 provided in the present application.
  • FIG. 20 is a schematic structural diagram of a network device 3000 provided in the present application.
  • FIG. 21 is a schematic structural diagram of a terminal device 900 provided in the present application.
  • the wireless communication systems mentioned in the embodiments of the present application include, but are not limited to, a global mobile communication (GSM) system, a code division multiple access (CDMA) system, and a wideband code division multiple access (CDMA) system.
  • GSM global mobile communication
  • CDMA code division multiple access
  • CDMA wideband code division multiple access
  • WCDMA wideband code division multiple access
  • GPRS general packet radio service
  • LTE long term evolution
  • FDD LTE frequency division duplex
  • TDD LTE Time division duplex
  • UMTS universal mobile telecommunication system
  • WiMAX worldwide interoperability for microwave communication
  • 3G mobile communication systems three generations of next-generation 5G mobile communication systems
  • Large application scenarios namely enhanced mobile bandwidth (eMBB), high reliability, low latency communication (URLLC) and enhanced mass machine type communication (eMTC) or new emerging in the future Pass Systems.
  • eMBB enhanced mobile bandwidth
  • URLLC low latency communication
  • eMTC enhanced mass machine type communication
  • the terminal devices involved in the embodiments of the present application may refer to user equipment (UE), terminals, access terminals, user units, user stations, mobile stations, mobile stations, remote stations, remote terminals, mobile devices, User terminal, terminal, wireless communication device, user agent or user device.
  • Terminal equipment can also be cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital processing (PDA), wireless communications Functional handheld devices, computing devices, or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, terminal devices in the future 5G network, or public land mobile network (PLMN) in future evolution Terminal equipment and the like are not limited in this application.
  • the network device involved in the embodiment of the present application may be a device for communicating with a terminal device, and the network device may be a Global System for Mobile Communication (GSM) system or a code division multiple access (CDMA) system.
  • the base station (base transceiver, station, or BTS) in) may also be a base station (nodeB, NB) in a wideband code division multiple access (WCDMA) system, or may be an evolved base station in an LTE system ( (evolutional nodeB, eNB or eNodeB), or a wireless controller in a cloud radio access network (CRAN) scenario, or the network device may also be a relay station, access point, vehicle device, wearable device As well as network equipment in future 5G networks, this application does not limit this.
  • GSM Global System for Mobile Communication
  • CDMA code division multiple access
  • the base station may also be a base station (nodeB, NB) in a wideband code division multiple access (WCDMA) system, or may be an evolved
  • FIG. 1 is a wireless communication system 100 suitable for the present application.
  • the wireless communication system 100 may include at least one network device 101, and the network device 101 communicates with one or more terminal devices (for example, the terminal device 102 and the terminal device 103 shown in FIG. 1).
  • the network device may be a base station, or a device in which the base station is integrated with a base station controller, or may be another device having a similar communication function.
  • Wireless technology is used for communication between the network device and the terminal device in FIG. 1.
  • the network device When a network device sends a signal, the network device is the transmitting end, and when the network device receives the signal, it is the receiving end.
  • the terminal device Conversely, when a terminal device sends a signal, the terminal device is a transmitting end, and when the terminal device receives a signal, it is a receiving end.
  • Figure 2 is the basic flow of wireless communication.
  • the source sends out the source code, channel code, and digital modulation in sequence.
  • the destination is output through digital demodulation, channel decoding, and source decoding.
  • Channel codec is one of the core technologies in the field of wireless communication.
  • polar codes are a channel coding technology that can theoretically prove to reach the Shannon limit and have practical linear complexity coding and decoding capabilities.
  • the core of the construction of the polarization code is through the "channel polarization" processing.
  • the coding method is used to make each subchannel show different reliability.
  • some channels will tend to have a capacity close to 1.
  • the other part of the channel tends to a full-noise channel with a capacity close to 0, and chooses to directly transmit information on a channel with a capacity close to 1 to approximate the channel capacity.
  • F N (A) is a sub-matrix in F N obtained by the row corresponding to the index in the set A.
  • F N (A C ) is a sub-matrix in F N obtained by the row corresponding to the index in the set A C.
  • u A is A set of information bits in K, number K.
  • NK The set of fixed bits in (NK) is a known bit. These fixed bits are usually set to 0, but as long as the receiving end and the transmitting end agree in advance, the fixed bits can be set arbitrarily.
  • u A U A is a row vector of length K, that is,
  • K, the symbol
  • the submatrix obtained by the rows corresponding to the indexes in the set A, F N (A) is an N ⁇ N matrix.
  • the construction process of the Polar code determines the performance of the Polar code.
  • the process of constructing a Polar code is generally determined by the existence of N polarized channels based on the length N of the mother code, and the N polarized channels correspond to the N rows of the generation matrix F N respectively.
  • Each row of the generating matrix F N has a Hamming weight (also referred to as a row weight), and the Hamming weight of each row reflects the reliability of the polarization channel corresponding to the row.
  • the Hamming weight of a row refers to the number of non-zero elements of the row. Among them, Hamming weights are all integer powers of two. For example, Hamming weighs 2, 4, 16, 32, 64, 128, 256, and so on.
  • F 2 consists of two lines. Hamming weight in the first row is 1, and Hamming weight in the second row is 2.
  • F 4 consists of 4 rows, with Hamming weights of 1, 2, 2, and 4, respectively.
  • FIG. 3 is a schematic diagram of a channel coding and decoding process using a Polar code as a coding scheme provided in the present application.
  • the transmitting end mainly includes the following processing flow.
  • the bit sequence to be transmitted can be understood as an information bit sequence that the transmitting end needs to send to the receiving end, which is a binary bit sequence.
  • the CRC bits mentioned here can also be called CRC check sequence or CRC check code, which is also a binary bit sequence.
  • the length of the CRC check sequence can be set by the communication system.
  • the CRC check sequence is usually directly added after the bit sequence to be sent. For example, suppose the bit sequence to be transmitted is 110010, and the calculated CRC check sequence is 010100. Then the CRC check sequence is directly appended to the bit sequence to be transmitted, and should be 110010010100.
  • part of the bits in the CRC check sequence can also be interleaved in the bit sequence to be sent, which is called a distributed CRC structure.
  • a distributed CRC structure part of the bits (for example, the first few bits) of the CRC check sequence will be scattered in the bit sequence to be transmitted, and the remaining bits in the CRC check sequence will be appended after the interleaved bit sequence is completed.
  • the first 3 bits of the CRC check sequence are interleaved in the bit sequence to be transmitted.
  • the 010 can be interleaved according to any bit interleaving method in the prior art.
  • an interleaved bit sequence having a length of 9 that is, 6 + 3) is obtained, and 100 is appended to the interleaved bit sequence.
  • NR new radio
  • the channel coding uses a 24-bit CRC check sequence, and the first 8 bits of these 24 bits are dispersed in the to-be-sent bit sequence through interleaving, and the last 16 of these 24 bits Bits are appended to the bit sequence after the interleaving is completed.
  • the purpose of the distributed CRC structure is to terminate decoding early. Early termination of decoding means that if the receiving end can judge that the decoding result is wrong according to the first 8 bits of the CRC check sequence, it can terminate decoding.
  • the base station can configure multiple RNTIs for the terminal devices.
  • the functions of these multiple RNTIs may be Is different.
  • one of the multiple RNTIs is used by a network device to send a paging message to a terminal device
  • an RNTI is used by a network device to send a system message to the terminal device
  • an RNTI is used to send a random access response to the terminal device Wait.
  • the base station notifies the terminal device of the multiple RNTIs configured.
  • the RNTI used to mask the last 16 bits of the CRC check sequence is one of the multiple RNTIs configured by the transmitting end for the receiving end.
  • the receiving end mainly includes the following processing flow:
  • the received data is de-rate matched and then input to the decoder for decoding.
  • the decoding method commonly used at the decoding end is the SCL decoding algorithm.
  • the structure of the polar code is a matter of selecting a polarized channel.
  • Each polarization channel is not independent of each other, but has a dependency relationship: a polarization channel with a large channel number depends on all polarization channels with a smaller number.
  • SC serial cancellation
  • the decoding tree is a binary tree, and the structure of the decoding tree is only related to the code length N.
  • the path formed from the root node to any node corresponds to a path metric (PM) and can be calculated.
  • the path metric value can be used as a reference to judge the pros and cons of the path.
  • the SC decoding algorithm is a greedy algorithm. At each layer of the decoding tree, only the optimal path (for example, according to the PM of the path) is searched for the next layer, so the error cannot be modified.
  • people have proposed the SCL decoding algorithm. Increase the number of candidate paths allowed in each layer of the decoding tree. From each layer of the SC decoding algorithm, only the "optimal one path for next expansion" is allowed to be changed to "the maximum allowed to select the best path for Next expansion. " And, the candidate path that is allowed to be retained in each layer is called a search width (denoted as Z).
  • the SCL algorithm still starts from the root node of the decoding tree and searches the leaf node layer by layer in turn.
  • the Z path with the smallest PM is selected as the candidate path and saved in a list, waiting for the next layer expansion.
  • the SC decoding algorithm is depth-first, and it is required to quickly reach the leaf node from the root node.
  • the SCL decoding algorithm is breadth-first. It is first expanded, then pruned, and finally reaches the leaf node. It can be seen that the output of the SCL decoding algorithm is a plurality of (determined by the search width Z) candidate decoding paths.
  • the SCL decoding algorithm can also be referred to as a list decoding scheme for short.
  • the receiving end de-masks the candidate decoding sequence output by the decoder.
  • the transmitting end configures multiple RNTIs for the receiving end.
  • the receiving end it knows that the transmitting end uses one of the multiple RNTIs to mask the transmitted bit sequence, but it does not know which RNTI was specifically used. Therefore, the receiving end needs to use the multiple RNTIs to perform unmasking attempts one by one.
  • the RNTI used by the receiver for demasking should be the same as the RNTI used by the transmitter for masking, and the unmasked bit sequence can finally pass the CRC.
  • the transmitting end is configured with 5 RNTIs for the receiving end, and the transmitting end uses RNTI # 1 among the 5 RNTIs to mask the last few bits of the CRC check sequence. Then in theory, the bit sequence after the receiver decodes the candidate decoding path using RNTI # 1 can pass the CRC.
  • the RNTI that is the same as the RNTI used by the transmitting end to mask the RNTI on the receiving end as the correct RNTI, and the remaining RNTIs are incorrect RNTIs.
  • the transmitting end configures three RNTIs for the receiving end, which are denoted as RNTI # 1, RNTI # 2, and RNTI # 3, respectively.
  • RNTI # 2 is the correct RNTI, which is obtained after unmasking the candidate decoding path using RNTI # 2.
  • the bit sequence can pass the CRC.
  • RNTI # 1 and RNTI # 3 are erroneous RNTIs. The bit sequences obtained after unmasking the candidate decoding paths using RNTI # 1 or RNTI # 3 cannot theoretically pass the CRC.
  • the receiving end performs a CRC check on the bit sequence after demasking, and finally selects the candidate decoding path that has been demasked by the correct RNTI and passes the CRC as the decoding result.
  • RNTI demasking Since there are multiple candidate decoding paths, for each candidate decoding path, RNTI demasking and CRC checking are required. Finally, the correct RNTI demasking is selected from the multiple candidate decoding paths, and the candidate decoding path passing the CRC is used as the final decoding result.
  • the decoding result is correct, but there are multiple candidate decoding paths that have passed the CRC after being demasked by different RNTIs.
  • each path is represented by P).
  • the receiver uses two RNTIs (one of which is the same as the RNTI used by the sender when it is masked, and is recorded as RNTI # 1. The other is different from the RNTI used by the sender, which is described as RNTI # 2, and decodes the candidate The path is unmasked, and then enters the CRC check unit for CRC check. It was found that one of the eight paths (P 1 shown in FIG. 5) passed the CRC after being unmasked using RNTI # 1. And another of these 8 paths (P 5 shown in FIG. 5 ) also passed the CRC after being unmasked using RNTI # 2.
  • RNTI # 2 described in FIG. 5 refers to any RNTI different from RNTI # 1 among multiple RNTIs configured by the transmitting end for the receiving end, and does not limit which RNTI # 2 is specifically among the multiple RNTIs.
  • RNTI # 2 refers to any RNTI different from RNTI # 1 among multiple RNTIs configured by the transmitting end for the receiving end, and does not limit which RNTI # 2 is specifically among the multiple RNTIs.
  • the decoding result is correct, but the wrong RNTI passes the check, and the correct RNTI fails the CRC.
  • FIG. 6 is a schematic diagram of another case of false alarm. Similar to FIG. 5, it is assumed that the transmitting end is configured with multiple RNTIs for the receiving end. The transmitting end uses RNTI # 1 to perform masking on the bit sequence to be transmitted. The receiving end uses RNTI # 1 to unmask each candidate decoding path output by the decoder, and then enters the CRC check unit. As a result, all paths cannot pass the CRC. However, the receiving end uses other RNTIs in the multiple RNTIs to unmask the candidate decoding path and then enters the CRC check unit, but one path (such as P 3 shown in FIG. 6) can pass the CRC. In FIG.
  • RNTI # 2 an RNTI used when passing a CRC path is referred to as RNTI # 2.
  • RNTI # 2 here refers to any RNTI different from RNTI # 1 among the multiple RNTIs configured by the transmitting end for the receiving end, and does not limit which of the multiple RNTIs the RNTI # 2 is specifically.
  • the decoding result is wrong, and the wrong RNTI passes the CRC.
  • the receiving end uses the correct RNTI to unmask each candidate decoding path output by the decoder, and then enters the CRC check unit, but all the paths cannot pass the CRC check, that is, the CRC check is wrong.
  • the receiver uses the wrong RNTI to unmask the candidate decoding path, one path can pass the CRC, but the decoded bit sequence is different from the bit sequence to be sent. That is to say, the decoding result is wrong, and the RNTI used by the receiver to unmask the candidate decoding path is also wrong.
  • the probability of such false alarms is 10 -7 and below.
  • the inventor of the present application made in-depth analysis and found that the false alarm is caused by the receiver using a list decoding scheme (ie, the above-mentioned SCL decoding algorithm). The reason for the false alarm will be described below in conjunction with formula (1).
  • c 1 ⁇ CW, c ′ 1 ⁇ CW C , CW is a set of legal codewords
  • CW C is a complement of a set of legal codewords, that is, a set of illegal codewords.
  • c u ⁇ F N
  • c a legal codeword
  • c an illegal codeword
  • u the bit sequence to be encoded in the polar coding principle introduced above
  • the bit sequence corresponding to the fixed bit in 0 is set
  • F N the generation matrix of the polar code.
  • the bit sequence to be encoded Including information bits and fixed bits. Specifically, when the fixed bits (that is, the corresponding bit positions) are set to 0, the bit sequence to be encoded is multiplied by the generation matrix F N (multiplication on the binary Galois field). That is a legal codeword.
  • the candidate decoding path is decoded.
  • it was hidden it happened to use another wrong RNTI.
  • the bit sequence passed the CRC check.
  • this application provides a method for configuring RNTI, which can reduce the false alarm probability.
  • the technical solution of this application may be applied to a scenario in which an RNTI is configured in any of the foregoing wireless communication systems.
  • the technical solution of the present application is applicable to a scenario in which the control channel adopts polar coding, for example, a scenario in which a base station configures an RNTI for a terminal device in a NR.
  • a base station configures an RNTI for a terminal device in a NR.
  • the control channel adopts polar coding, that is, downlink control information (downlink control information (DCI)) uses polar coding.
  • DCI downlink control information
  • NR specifies that the length interval of DCI using polar coding is [12,140]. More specifically, the length interval [12,140] of DCI may adopt 5 aggregation levels, and the 5 aggregation levels are 1CCE, 2CCE, 4CCE, 8CCE, and 16CCE, respectively.
  • the code lengths after rate matching corresponding to each aggregation level are 108, 216, 432, 864, and 1728.
  • the length of the DCI that can be carried in theory and the rate matching method used can be shown in Table 1.
  • Target code length E value A value interval Rate matching mode 1CCE 108 [12,23] Puncture 1CCE 108 [24,83] Shortening 2CCE 216 [12,70] Puncture 2CCE 216 [71,140] Shortening 4CCE 432 [12,140] Puncture 8CCE 864 [12,140] Repetition 16CCE 1728 [12,140] Repetition
  • the E value represents the length after rate matching, which can also be called the target code length
  • the A value represents the length of the information bit sequence before encoding.
  • Puncture in the rate matching mode indicates puncturing, shortening indicates shortening, and repetition indicates repetition.
  • the Hamming weight of the corresponding row of the last 16 bits of the DCI in the generation code of the polar code (that is, the polar code) and the reliability thereof are calculated, and FIGS. 7 to 9 can be obtained.
  • the first line of each DCI interval is Hamming weight
  • the second line is the reliability of the polarization channel corresponding to the line.
  • the data content shown in FIG. 7 to FIG. 9 can be expressed or stored in the form of a table.
  • the inventor of the present application found that the conflicting "RNTI pairs" are almost all the bit XOR of the bit positions corresponding to the rows with the smallest Hamming weight in all the rows of the generation matrix corresponding to the two RNTIs, or The sum of the bit exclusive ORs of the bit positions corresponding to the row with the sub-small Hamming weight is 1.
  • 216 indicates the target code length
  • 80 indicates the number of information bits.
  • Table 1 it is determined that the aggregation level corresponding to the target code length 216 is 2CCE.
  • 80 falls in the interval of 2CCE [71,140].
  • the Hamming weight and reliability of the 16-bit RNTI corresponding to the pattern (216, 80) in the generation matrix can be determined from FIG. 8.
  • the inventors have found that in the case where the sum of the bit XOR of the bit positions of the RNTI corresponding to the row with the second-smallest Hamming weight in the generation matrix is 1, the probability of false alarms is also high.
  • RNTI0 and RNTI1 are converted into binary sequences, and then the respective 16-bits of RNTI0 and RNTI1 and the corresponding 16-bit RNTI of (108, 20) in the generation matrix are compared with Hamming weight and reliability.
  • the bit XOR of the bit positions of the RNTI corresponding to the row with a smaller Hamming weight is 1.
  • the bit position of the bit position of the RNTI corresponding to the row with the smallest Hamming weight is XORed.
  • the ratio of the bit exclusive OR of the bit positions of the RNTI corresponding to a row with a weight of sub-small Hamming is 1, and / or the ratio of the bit positions of the RNTI corresponding to a row with a weight of sub-small Hamming
  • the sum of the exclusive ORs is 1, and it is common for false alarms to occur.
  • Each RNTI in the plurality of RNTIs includes L bits, and the L bits correspond to L rows in N rows of the generation matrix of the polarization code, and each of the N rows has a Hamming weight,
  • the multiple RNTIs have the same I bit, and the I bit corresponds to the same bit position in each of the multiple RNTIs, and the I bit corresponds to the first Hamming weight in the L rows.
  • I of the M rows is the minimum value of the Hamming weights of the L rows, 1 ⁇ I ⁇ M ⁇ L ⁇ N, and N, L, I, and M are integers.
  • the RNTI includes L bits, which means that the length of the RNTI is L.
  • the length of the RNTI can be specified by the system. For example, in NR, the control channel uses polar coding, and the length of the RNTI is specified to be 16.
  • the plurality of RNTIs also have J identical bits, and the J bits correspond to the same bit position in each of the RNTIs of the plurality of RNTIs, and the J bits correspond to the second Han in the L rows.
  • J of the P rows of light weight are included in the second hamming weight.
  • the second hamming weight is greater than the first hamming weight, and the second hamming weight is less than the hamming weight of the remaining lines except the I line and the P line, 1 ⁇ J ⁇ P ⁇ L, I + J ⁇ L, and J is an integer.
  • the plurality of RNTIs also have R identical bits, the R identical bits correspond to the same bit position in each of the RNTIs of the plurality of RNTIs, and the R bits correspond to the L rows having R of the Q rows of the third Hamming weight, the third Hamming weight is greater than the second Hamming weight, and the third Hamming weight is less than the L rows except the I line, the P lines, and the Hamming weight of the remaining rows except the Q rows, 1 ⁇ R ⁇ L, I + J + R ⁇ L, R is an integer.
  • each RNTI includes L bits, and the L bits correspond to L rows of the N rows of the generation matrix of the polar code.
  • Each of the L rows of the generated matrix has a Hamming weight, then the L rows correspond to multiple (may be equal to or less than L) Hamming weights. These multiple Hamming weights vary from small to large. For the multiple RNTIs, first, it is necessary to ensure that the bit values of the bit positions corresponding to the rows with the smallest Hamming weight are the same.
  • the values of the bits at the bit positions corresponding to all the rows with the smallest Hamming weight may be the same.
  • the values of the bits at the bit positions corresponding to a part of the rows with the smallest Hamming weight may be the same.
  • it can be further ensured that the values of the bits at the bit positions corresponding to some or all of the rows with a sub-hamming weight are the same.
  • FIG. 11 is a reference table for configuring the RNTI when the aggregation level is 1CCE.
  • “*” marked in FIG. 11 indicates the highest priority bit position where the same bit should be configured.
  • the priority marked with "**” is lower than the priority with "*”.
  • the bits marked with "**” are also configured as the same. There is no restriction on the bit position corresponding to the unmarked line.
  • FIG. 12 is a reference table for configuring the RNTI when the aggregation level is 2CCE.
  • FIG. 13 is a reference table for configuring the RNTI when the aggregation level is 4CCE.
  • the meanings of “*” or “**” in FIG. 12 and FIG. 13 are the same as those in FIG. 11 and will not be described again.
  • the aggregation level corresponding to the target code length 432 as 4CCE is determined to be [39,140].
  • the bits of the bit position of the RNTI corresponding to “*” are the same.
  • it is also possible to configure that the bits of the bit position of the RNTI corresponding to "**" are the same.
  • 32 is the smallest Hamming weight among all 16 rows, and there is 1 row.
  • Hamming's weight of 64 rows a total of 4 rows.
  • the lowest configuration can be considered by setting the bit corresponding to a bit position in the RNTI of a row with a Hamming weight of 32 to 0, as shown in FIG. Further, the bits corresponding to the four bit positions in the RNTI of the four rows with a Hamming weight of 64 can be configured to zero. Referring to FIG. 13, the four bit positions are the second, third, fifth, and ninth bit positions of the RNTI, respectively.
  • all the bits in the corresponding bit positions in the RNTI of the above-mentioned Hamming weights of 32, 64, and 128 are configured as 0, that is, the same as the transmitting end, then
  • the 1,2,3,4,5,6,7,9,10,11,13th bit positions of the RNTI allocated to the receiving end are all configured as 0 for a total of 11 bit positions.
  • the remaining five (ie, 16-11) bit positions are not limited, and each bit can be configured as 0 or 1. Therefore, the RNTI at the receiving end can have 25 possible configurations. These 2 5 configurations can be seen in Table 2.
  • bit portion at the bit position corresponding to a row with a Hamming weight of 64 when configured as 0, since the Hamming weights of these rows are all equal, at this time, it can be configured by combining the reliability corresponding to these rows .
  • a bit at a bit position corresponding to a row with lower reliability among all the rows with a Hamming weight of 64 may be configured as 0.
  • part of the rows may also be randomly selected from all the rows with a Hamming weight of 64, and the bits at the bit positions corresponding to the rows are configured to be the same as the transmitting end, that is, to 0.
  • this configuration method can also be applied to the configuration of bit positions corresponding to other Hamming-weighted rows.
  • the number of RNTIs available for allocation to the receiving end is generally 16 or 32.
  • the configuration requirements are reduced (for example, only the row with the smallest Hamming weight is guaranteed to have the same bit position in the RNTI as the transmitting end, and there is no guarantee that the Hamming weight is the second or second smaller row.
  • the number of RNTIs available for allocation will be greater.
  • FIG. 14 is an application example of a method 200 for configuring an RNTI provided by the present application.
  • the transmitting end configures the multiple RNTIs.
  • the multiple RNTIs meet the characteristics described above, and are not repeated here.
  • the transmitting end sends configuration information to the receiving end, and the receiving end receives the configuration information from the transmitting end, and the configuration information is used to indicate the multiple RNTIs.
  • the configuration information may be sent periodically or aperiodically, which is not limited in this application.
  • the receiving end can obtain the multiple RNTIs according to the configuration information for use in subsequent DCI reception.
  • the RNTI may also be configured according to the above rules, and stored at the transmitting end and the receiving end for backup.
  • steps 230-260 may also be included.
  • the transmitting end adds a CRC check sequence to the first bit sequence that needs to be sent to the receiving end to obtain a second bit sequence.
  • the CRC check sequence can be directly appended to the first bit sequence, or the first few bits of the CRC check sequence can be interleaved in the first bit sequence, and the last few bits of the CRC check sequence can be interleaved. Bits are appended to the interleaved bit sequence. That is the distributed CRC structure as mentioned above. Alternatively, other methods for adding a CRC check sequence in the prior art may also be used. This application does not limit this.
  • the length of the CRC check sequence can be predefined by the communication system. For example, in NR, the length of the CRC check sequence is specified as 24. The first 8 bits of the 24 bits are interleaved in the first bit sequence, and the last 16 bits are directly attached to the interleaved bit sequence. That is, a distributed CRC structure is formed.
  • bit interleaving may be performed on the bit sequence after the CRC check sequence is added.
  • the method of bit interleaving is not limited in this application. For example, it can be row-column interleaving, or other interleaving methods.
  • the transmitting end uses one of the multiple RNTIs to mask the second bit sequence to obtain a third bit sequence.
  • step 240 the transmitting end uses one of the multiple RNTIs to perform RNTI masking on the interleaved bit sequence.
  • the transmitting end sends a third bit sequence to the receiving end.
  • the third bit sequence is sent after processing processes such as polar coding, rate matching, and QPSK modulation as shown in FIG. 3.
  • the receiving end receives the sequence to be decoded from the transmitting end, and outputs multiple candidate decoding paths after demodulation, de-rate matching, and SCL decoding.
  • the receiving end uses the multiple RNTIs to perform an unmasking attempt on the multiple candidate decoding paths, and outputs the candidate decoding path that passes the CRC after the unmasking as a decoding path.
  • the receiving end uses the multiple RNTIs to perform a demasking attempt on the multiple candidate decoding paths, and finally outputs a candidate decoding path that passes the CRC after demasking using one of the multiple RNTIs as a decoding path.
  • step 270 in theory, only after the receiving end unmasks the candidate decoding paths by using the first RNTI of the multiple RNTIs, one candidate decoding path can pass the CRC. This candidate decoding path is the decoding path that the receiving end should finally output.
  • the false alarm ratio (FAR) caused by RNTI conflicts on the order of 10 -4 to 10 -3 when the PDCCH is polar coded can be reduced to less than 10 -6 .
  • the above method 200 for configuring an RNTI is mainly applicable to a scenario in which polar coding is adopted for a PDCCH.
  • This application also provides a method 300 for configuring an RNTI, which can be applied to any scenario where RNTI conflicts need to be avoided.
  • the number of the bit sequence in the following method 300 is not related to the number of the bit sequence in the above method 200.
  • the first bit sequence shown in FIG. 15 and the first bit sequence in the above method 200 are only used to distinguish from other bit sequences in the respective embodiments, and there is no correlation between the two.
  • FIG. 15 is a flowchart of another method 300 for configuring an RNTI provided by the present application.
  • N bits are selected to generate multiple first bit sequences.
  • N is the length of the RNTI.
  • the value of N may be defined by the communication system.
  • Each first bit sequence is a random sequence.
  • the first bit sequence consists of 0's and 1's.
  • the first bit sequence is referred to as S.
  • the encoding method used is not limited to the use of convolutional code, turbo code, low density parity check (LDPC) code, cyclic redundancy check (cyclic redundancy check) (CRC) code, Reed-Muller (RM) code and cyclic code.
  • LDPC low density parity check
  • CRC cyclic redundancy check
  • RM Reed-Muller
  • G is a coding matrix of size M ⁇ N, and the linear coding operation is performed in the binary domain GF (2).
  • the first bit sequence S is a random sequence generated by M bits. Therefore, by traversing all the possibilities of the first bit sequence S, there will be 2 M possibilities, that is, in step 310, 2 M is generated. First bit sequences. Each first bit sequence S is linearly encoded with the encoding matrix G, and a second bit sequence of length N is obtained. Therefore, 2 M first bit sequences are linearly encoded by the encoding matrix G, respectively, and 2 M second bit sequences will be obtained. The 2 M second bit sequences are in one-to-one correspondence with the 2 M first bit sequences, and each second bit sequence is obtained by linearly encoding the corresponding first bit sequence. Each second bit sequence is an RNTI, so 2 M RNTIs are obtained.
  • the 2 M second bit sequences generated in step 320 are output, that is, the candidate RNTI set.
  • the candidate RNTI set here refers to a candidate set that can be used to configure the RNTI. In other words, in a scenario where an RNTI needs to be configured, multiple RNTIs can be selected from the candidate RNTI set.
  • step 340 may be further included.
  • the bit sequence obtained after each second bit sequence is interleaved is one RNTI.
  • the following uses a CRC code to linearly encode the first bit sequence to explain the process of generating a candidate RNTI set.
  • the length of the information field and the check field can be arbitrarily selected.
  • the R-bit check code is spliced after the M-bit information code to obtain a CRC code of length N.
  • N M
  • g (x) a CRC check code of a K-bit information code
  • g (x) is called a generator polynomial of this CRC code.
  • an 8-bit CRC check code of the first bit sequence S can be calculated by using g_8 (x).
  • g_8 (x) represents a polynomial corresponding to a CRC length of 8.
  • the 8-bit CRC check code is concatenated with 8 bits of the first bit sequence S to obtain a 16-bit sequence. These 16-bit sequences can be used as RNTI.
  • the above-mentioned 8-bit CRC check code is concatenated with 8 bits of the first bit sequence S to obtain 16 bits, and the 16 bits may be interleaved, and the interleaved sequence may be used as the RNTI.
  • the first bit sequence to traverse all possible there will be 28 possible. These 28 possible bit sequences are first calculated as described above corresponds to the CRC. Each CRC check code is concatenated with a corresponding first bit sequence to obtain a second bit sequence. A total of 2 8 second bit sequences will be obtained. This second bit sequence 28 can be set as an alternative RNTI.
  • steps 310-340 of the method 300 are a process of configuring the RNTI at the transmitting end, and are illustrated in several steps in FIG. 15 for convenience of description. In specific implementation, steps 310-340 may also be combined into one step for generating a candidate RNTI set.
  • the method 300 may further include one or more of steps 350-380.
  • the transmitting end sends configuration information to the receiving end, and the receiving end receives the configuration information from the transmitting end.
  • the configuration information is used to indicate L RNTIs in the multiple candidate RNTI sets. Because the transmitting end usually configures multiple RNTIs for the receiving end, L ⁇ 2 and is an integer. Of course, the value of L may be defined by the communication system, or may also be determined by the transmitting end according to needs.
  • the L RNTIs can be arbitrarily selected from the candidate RNTI set.
  • the RNTI set with the above characteristics can be stored for backup at the transmitting end and the receiving end, without the need for the transmitting end to generate and send the RNTI set to the receiving end.
  • the transmitting end uses one of the L RNTIs to perform masking on a bit sequence to be transmitted to obtain a masked bit sequence.
  • the transmitting end sends the masked bit sequence to the receiving end.
  • the receiving end uses the L RNTIs to perform the demasking on the bit sequence to be demasked.
  • the receiver When the receiver performs RNTI unmasking, it uses the L RNTIs to try one by one.
  • the process of adding and unmasking the RNTI is the same as that of the method 200, and details are not described herein again.
  • the method 300 mainly uses linear coding to expand the Hamming distance between RNTIs, and plays a role in reducing the RNTI false alarm.
  • the method 300 can be applied to some communication systems that do not use polar coding, and has a wider application range.
  • the RNTI in the candidate RNTI set generated according to the foregoing method 300 may reduce a higher false alarm probability due to RNTI conflicts.
  • FIG. 16 is a schematic block diagram of a communication apparatus 500 provided by the present application.
  • the communication device 500 includes a processing unit 510 and a communication unit 520.
  • a processing unit 510 configured to generate multiple RNTIs, each of the multiple RNTIs includes L bits, and the L bits correspond to L rows of N rows of a generation matrix of a polarization code, where Each of the N rows has a Hamming weight, wherein the plurality of RNTIs have the same I bit, and the I bits correspond to the same bit position in each of the plurality of RNTIs ,
  • the I bits correspond to I of the M lines having the first Hamming weight among the L lines, and the first Hamming weight is a minimum value of the Hamming weight of the L lines , 1 ⁇ I ⁇ M ⁇ L ⁇ N, and N, L, I, and M are integers.
  • the communication unit 520 is configured to send configuration information, and the configuration information is used to indicate to the receiving end the multiple RNTIs generated by the processing unit 510.
  • the transmitting ends in the apparatus 500 and the method 200 correspond completely, and the corresponding units of the apparatus 500 are respectively used to execute the corresponding steps and / or processes performed by the transmitting end in the method 200 or the embodiments thereof.
  • the processing unit 510 is configured to execute the steps implemented by the transmitting end in the method 200 or the embodiments thereof. For example, the processing unit 510 performs step 210, step 230, or step 240 in FIG.
  • the communication unit 520 in the apparatus 500 performs the steps of sending or receiving in the method 200 or the embodiments thereof. For example, step 220 and step 250 of sending configuration information to the receiving end in FIG. 14 are performed.
  • the processing unit 510 may be a processor.
  • the communication unit 520 may be a transceiver.
  • the transceiver includes a receiver and a transmitter, and has the functions of receiving and transmitting at the same time.
  • the processing unit 510 may be a processing device, and the foregoing functions of the processing device may be partially or completely implemented by software.
  • the processing device may include a memory and a processor, where the memory is used to store a computer program, and the processor reads and runs the computer program from the memory to execute the method 200 or the embodiments thereof. Operations and / or processes performed by the client.
  • the processing device when part or all of the processing device is implemented by software, the processing device includes a processor.
  • the memory for storing the computer program is located outside the processing device, and the processor is connected to the memory through a circuit / wire for reading and executing the computer program stored in the memory.
  • the processing device when part or all of the above functions of the processing device are implemented by hardware, the processing device includes a logic circuit.
  • the logic circuit has the function of configuring multiple RNTIs in the method embodiment; the output interface circuit is configured to output the multiple RNTIs configured by the processing device.
  • the processing device further includes an input interface circuit for obtaining a Hamming weight of L rows of the N rows of the generation matrix of the polarization code and / or a polarization corresponding to the L rows.
  • Channel reliability parameters a logic circuit, specifically configured to configure the plurality of RNTIs according to the Hamming weight of the L rows and / or reliability parameters of the polarization channels corresponding to the L rows.
  • the processing device may be a chip or an integrated circuit.
  • the processing unit 510 may be a processor
  • the communication unit 520 may be a transceiver.
  • the transceiver includes a receiver and a transmitter, and has the functions of receiving and transmitting at the same time.
  • FIG. 17 is a schematic block diagram of a communication device 600 provided by the present application. As shown in FIG. 17, the communication device 600 includes a communication unit 610 and a processing unit 620.
  • a communication unit 610 is configured to receive configuration information from a transmitting end, where the configuration information is used to indicate multiple RNTIs.
  • Each of the multiple RNTIs includes L bits, and the L bits correspond to a generation matrix of a polarization code.
  • Each RNTI in the RNTI corresponds to the same bit position, and the I bit corresponds to one of the M rows having the first Hamming weight among the L rows, and the first Hamming weight is
  • the minimum value of the Hamming weight of the L rows is 1 ⁇ I ⁇ M ⁇ L ⁇ N, and N, L, I, and M are integers.
  • the processing unit 620 is configured to unmask multiple candidate decoding paths according to multiple RNTIs indicated by the configuration information received by the communication unit 610.
  • the receiving end in the apparatus 600 and the method 200 correspond completely, and the corresponding units of the apparatus 600 are respectively used to execute the corresponding steps and / or processes performed by the receiving end in the method 200 or the embodiments thereof.
  • the processing unit 620 is configured to execute the steps implemented in the method 200 or the embodiments thereof by the receiving end. For example, the processing unit 620 performs steps 260 and 270 in FIG. 14.
  • the communication unit 610 in the apparatus 600 is configured to perform the steps of sending or receiving in the method 200 or the embodiments thereof. For example, step 220 of receiving configuration information from the transmitting end in FIG. 14 is performed, or step of receiving a sequence to be decoded from the transmitting end is performed.
  • the processing unit 620 may be a processing device, and the foregoing functions of the processing device may be partially or completely implemented by software.
  • the processing device may include a memory and a processor, where the memory is used to store a computer program, and the processor reads and runs the computer program from the memory to implement de-masking of multiple candidate decoding paths. .
  • the processing device when part or all of the processing device is implemented by software, the processing device includes a processor.
  • the memory for storing the computer program is located outside the processing device, and the processor is connected to the memory through a circuit / wire for reading and executing the computer program stored in the memory.
  • the processing device when part or all of the above functions of the processing device are implemented by hardware, includes: an input interface circuit for obtaining a sequence to be decoded; a logic circuit for decoding a sequence to be decoded, Obtain multiple candidate decoding paths; the logic circuit is also used to use multiple RNTIs indicated by the configuration information to unmask the multiple candidate decoding paths and perform CRC on the bit sequence after unmasking; the output interface circuit uses The candidate decoding path that passes the CRC after demasking is used as the decoding path.
  • the processing device may be a chip or an integrated circuit.
  • the communication unit 610 may be a transceiver
  • the processing unit 620 may be a processor
  • FIG. 18 is a schematic block diagram of a communication apparatus 700 provided in the present application.
  • the communication device 700 includes a processing unit 710 and a communication unit 720.
  • a processing unit 710 is configured to select M bits to generate a plurality of first bit sequences according to the length N of the wireless network temporary identifier RNTI configured, and M ⁇ N, and is an integer; each of the plurality of first bit sequences Linearly encode the first bit sequences to obtain multiple second bit sequences, and the multiple second bit sequences correspond to the multiple first bit sequences in a one-to-one manner;
  • the communication unit 720 is configured to send configuration information, where the configuration information is used to indicate L second bit sequences in the plurality of second bit sequences, where L ⁇ 2 and is an integer.
  • the transmitters in the device 700 and the method 300 correspond completely, and the corresponding units of the device 700 are respectively used to execute the corresponding steps and / or processes performed by the transmitter in the method 300 or the embodiments thereof.
  • the processing unit 710 is configured to execute steps implemented by the transmitting end in the method 300 or the embodiments thereof. For example, the processing unit 710 performs steps 310, 320, 340, and the like.
  • the communication unit 720 is configured to perform the steps of sending and receiving in the method 300. For example, step 350 of sending configuration information to the receiving end and step 370 of sending a masked bit sequence to the receiving end are performed.
  • the processing unit 710 may be a processor.
  • the communication unit 720 may be a transceiver.
  • the transceiver includes a receiver and a transmitter, and has the functions of receiving and transmitting at the same time.
  • the processing unit 710 may be a processing device, and the foregoing functions of the processing device may be partially or completely implemented by software.
  • the processing device may include a memory and a processor, where the memory is used to store a computer program, and the processor reads and runs the computer program from the memory to execute the method 300 or the methods described in the embodiments. Operations and / or processes performed by the client.
  • the processing device when part or all of the processing device is implemented by software, the processing device includes a processor.
  • the memory for storing the computer program is located outside the processing device, and the processor is connected to the memory through a circuit / wire for reading and executing the computer program stored in the memory.
  • the processing device when part or all of the above functions of the processing device are implemented by hardware, the processing device includes a logic circuit.
  • the logic circuit has a function of configuring multiple RNTIs in the method 300; an output interface circuit is configured to output the multiple RNTIs.
  • the processing device may be a chip or an integrated circuit.
  • FIG. 19 is a schematic block diagram of a communication apparatus 800 provided in the present application.
  • the communication device 800 includes a communication unit 810 and a processing unit 820.
  • a communication unit 810 configured to receive configuration information from a transmitting end, where the configuration information is used to indicate L second bit sequences, L ⁇ 2 and being an integer;
  • the processing unit 820 is configured to perform an unmasking attempt on the bit sequence to be unmasked according to the multiple RNTIs indicated by the configuration information received by the communication unit 810.
  • the receiving end in the device 800 corresponds to the receiving end in the method 300, and the corresponding units of the device 800 are respectively used to execute the corresponding steps and / or processes performed by the receiving end in the method 300 or the embodiments thereof.
  • the processing unit 820 is configured to execute the steps implemented in the method 300 or the embodiments thereof by the receiving end. For example, the processing unit 820 performs step 380 of RNTI unmasking.
  • the communication unit 810 in the apparatus 800 is configured to perform the steps of sending or receiving in the method 300 or the embodiments thereof. For example, step 350 of receiving configuration information from a transmitting end, and step 370 of receiving a masked bit sequence from a transmitting end are performed.
  • the processing unit 820 may be a processing device, and the above functions of the processing device may be partially or completely implemented by software.
  • the processing device may include a memory and a processor, where the memory is used to store a computer program, and the processor reads and runs the computer program from the memory to perform corresponding operations performed by the receiving end in the method 300 And / or process.
  • the processing device when part or all of the processing device is implemented by software, the processing device includes a processor.
  • the memory for storing the computer program is located outside the processing device, and the processor is connected to the memory through a circuit / wire for reading and executing the computer program stored in the memory.
  • the processing device when part or all of the above functions of the processing device are implemented by hardware, the processing device includes: an input interface circuit for obtaining a bit sequence to be unmasked; a logic circuit for using L indicated by the configuration information A second bit sequence is used to unmask the bit sequence to be unmasked to obtain the unmasked bit sequence; an output interface circuit is used to output the bit sequence after unmasking.
  • bit sequence after demasking can be input to a CRC check unit for CRC check, which is the same as the method 200, and is not repeated here.
  • the processing device may be a chip or an integrated circuit.
  • a network device is a transmitting end, and a terminal device is a receiving end.
  • the terminal device is the transmitting end, and the network device is the receiving end.
  • the transmitting end described herein may be the transmitting end described in method 200, or may also be the transmitting end in method 300.
  • the receiving end may be the receiving end in the method 200, or may also be the receiving end in the method 300.
  • the following transmission (the transmitting end is a network device and the receiving end is a terminal device) is taken as an example to describe the network device and the terminal device provided in this application.
  • FIG. 20 is a schematic structural diagram of a network device 3000 provided in the present application.
  • the network device 3000 may be applied to the wireless communication system shown in FIG. 1 described above, and has a function of a transmitting end (for example, a base station) described in the method embodiment of the present application.
  • a transmitting end for example, a base station
  • the network device 3000 may include one or more radio frequency units, such as a remote radio unit (RRU) 3100 and one or more baseband units (BBU).
  • the baseband unit can also be referred to as a digital unit (DU) 3200.
  • the RRU 3100 may be referred to as a transceiver unit, and corresponds to the communication unit 620 in FIG. 9.
  • the transceiver unit 3100 may also be referred to as a transceiver, a transceiver circuit, or a transceiver, etc., which may include at least one antenna 3101 and a radio frequency unit 3102.
  • the transceiver unit 3100 may include a receiving unit and a transmitting unit.
  • the receiving unit may correspond to a receiver (or a receiver or a receiving circuit), and the transmitting unit may correspond to a transmitter (or a transmitter or a transmitting circuit).
  • the RRU 3100 part is mainly used for transmitting and receiving radio frequency signals and converting radio frequency signals and baseband signals, for example, for sending configuration information of a first random access resource to a terminal device.
  • the BBU 3200 part is mainly used for baseband processing and controlling base stations.
  • the RRU 3100 and the BBU3200 may be physically located together or physically separated, that is, a distributed base station.
  • the BBU 3200 is the control center of the network equipment 3000, and may also be called a processing unit, which is mainly used to complete baseband processing functions, such as channel coding, multiplexing, modulation, and spread spectrum.
  • the BBU Processed Unit
  • it may correspond to the processing unit 510 in FIG. 16.
  • it corresponds to the processing unit 710 in FIG. 18.
  • the BBU 3200 may be composed of one or more boards, and multiple boards may jointly support a wireless access network (for example, an LTE network) of a single access system, or may separately support different access systems. Wireless access network (for example, LTE network, 5G network or other network).
  • the BBU 3200 further includes a memory 3201 and a processor 3202.
  • the memory 3201 is configured to store necessary instructions and data.
  • the processor 3202 is configured to control the network device 3000 to perform necessary actions.
  • the processor 3202 is configured to control the network device 3000 to execute an operation process performed by the network device in the foregoing method embodiment.
  • the memory 3201 and the processor 3202 may serve one or more single boards. That is, the memory and processor can be set separately on each board. It is also possible that multiple boards share the same memory and processor. In addition, the necessary circuits can be set on each board.
  • the network device 3000 shown in FIG. 20 can implement various processes related to the network device in the method embodiments in FIG. 1 to FIG. 15.
  • the operations and / or functions of each unit in the network device 3000 are respectively to implement corresponding processes in the method embodiments. To avoid repetition, detailed descriptions are appropriately omitted here.
  • the above BBU 3200 can be used to perform the actions implemented by the network device described in the previous method embodiments.
  • step 210 of configuring multiple RNTIs and adding a CRC check sequence to the first bit sequence are performed.
  • step 310 of generating a plurality of first bit sequences is performed, step 320 of linearly encoding the plurality of first bit sequences to generate a plurality of second bit sequences, and step 340 of bit interleaving the second bit sequence Wait.
  • the RRU 3100 can be used to perform the sending or receiving actions described in the foregoing method embodiments.
  • step 220 of sending configuration information to the terminal device in the method 200 of FIG. 14 is performed, or step 250 of sending a third bit sequence to the terminal device is performed.
  • step 350 of sending configuration information to the receiving end in method 300, and step 370 of sending a masked bit sequence to the receiving end are performed.
  • FIG. 21 is a schematic structural diagram of a terminal device 900 provided in the present application.
  • the terminal device 900 includes: one or more processors 901, one or more memories 902, and one or more transceivers 903.
  • the processor 901 is configured to control the transceiver 903 to transmit and receive signals
  • the memory 902 is configured to store a computer program
  • the processor 901 is configured to call and run the computer program from the memory 902 to execute the method 200 for configuring the RNTI provided by the present application or each of the methods
  • a corresponding process and / or operation performed by the receiving end in the method 300 and its various embodiments is performed.
  • the terminal device 900 may be the terminal device 102 or 103 in the wireless communication system shown in FIG. 1.
  • the chip described in the embodiment of the present application may be a field-programmable gate array (FPGA), an application-specific integrated circuit (ASIC), a system chip (SoC), a central Processor (central processor unit, CPU), network processor (NP), digital signal processing circuit (digital signal processor, DSP), and also a microcontroller (microcontroller unit, MCU, programmable controller ( programmable logic device (PLD) or other integrated chip.
  • FPGA field-programmable gate array
  • ASIC application-specific integrated circuit
  • SoC system chip
  • CPU central processor unit, CPU
  • NP network processor
  • DSP digital signal processing circuit
  • microcontroller unit microcontroller unit, MCU, programmable controller (programmable logic device (PLD) or other integrated chip.
  • the processor in the embodiment of the present application may be an integrated circuit chip and has a signal processing capability.
  • each step of the foregoing method embodiment may be completed by using an integrated logic circuit of hardware in a processor or an instruction in a form of software.
  • the above-mentioned processor may be a general-purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), an FPGA or other programmable logic device, a discrete gate or transistor logic device, a discrete Hardware components.
  • a general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the steps of configuring the RNTI in the method 200 or the method 300 disclosed in the embodiment of the present application may also be performed by a hardware processor, or may be performed by a processor in the processor.
  • the combination of hardware and software modules is completed.
  • the software module may be located in a mature storage medium such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, and the like.
  • the storage medium is located in a memory, and the processor reads the information in the memory and completes the steps of the foregoing method in combination with its hardware.
  • the memory in the embodiment of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (erasable PROM, EPROM), electrical memory Erase programmable read-only memory (EPROM, EEPROM) or flash memory.
  • the volatile memory may be a random access memory (RAM), which is used as an external cache.
  • RAM random access memory
  • DRAM dynamic random access memory
  • SDRAM synchronous dynamic random access memory
  • double SDRAM double SDRAM
  • DDR SDRAM double data rate synchronous dynamic random access memory
  • enhanced SDRAM enhanced SDRAM
  • SLDRAM synchronous connection dynamic random access memory
  • direct RAMbus RAM direct RAMbus RAM
  • the foregoing memory and the memory may be physically independent units, or the memory may be integrated with the processor.
  • the present application also provides a computer-readable storage medium.
  • the computer-readable storage medium stores computer instructions. When the computer instructions are run on a computer, the computer executes the corresponding operations performed by the transmitting end in the method 200 and / Or process.
  • the present application also provides a computer program product.
  • the computer program product includes computer program code.
  • the computer program code runs on a computer, the computer causes the computer to perform corresponding operations and / or processes performed by the transmitting end in method 200 or method 300. .
  • the present application also provides a chip, including a memory and a processor.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program from the memory to perform the corresponding operations performed by the transmitting end in the method 200 or the method 300 and / Or process.
  • the present application provides a computer-readable storage medium.
  • the computer-readable storage medium stores computer instructions.
  • the computer instructions executes the corresponding method executed by the receiving end in method 200 or method 300. Operations and / or processes.
  • the present application also provides a computer program product.
  • the computer program product includes computer program code, and when the computer program code runs on a computer, the computer causes the computer to perform corresponding operations and / or processes performed by the receiving end in method 200 or method 300. .
  • the present application further provides a chip (or a chip system), which includes a memory and a processor.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program from the memory to execute the method 200 of the embodiment of the application or Corresponding operations and / or processes performed by the receiving end in the method 300.
  • the present application further provides a communication system including a transmitting end and a receiving end in the method 200, or a transmitting end and a receiving end in the method 300.
  • a component may be, but is not limited to, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and / or a computer.
  • an application running on a computing device and a computing device can be components.
  • One or more components can reside in a process and / or thread of execution.
  • Components may be located on one computer and / or distributed between two or more computers.
  • these components can execute from various computer readable media having various data structures stored thereon.
  • a component may be based on data that has one or more data packets (e.g., data from two components that interact with another component between a local system, a distributed system, and / or a network, such as the Internet that interacts with other systems through signals)
  • the signals communicate through local and / or remote processes.
  • the disclosed systems, devices, and methods may be implemented in other ways.
  • the device embodiments described above are only schematic.
  • the division of the unit is only a logical function division.
  • multiple units or components may be combined. Or it can be integrated into another system, or some features can be ignored or not implemented.
  • the displayed or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, which may be electrical, mechanical or other forms.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, may be located in one place, or may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the embodiments of the present application.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each of the units may exist separately physically, or two or more units may be integrated into one unit.
  • the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium.
  • the technical solution of this application is essentially a part that contributes to the existing technology or a part of the technical solution can be embodied in the form of a software product.
  • the computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method described in the embodiments of the present application.

Landscapes

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

Abstract

本申请提供了一种配置无线网络临时标识RNTI的方法，能够降低虚警概率。该方法包括：发射端配置多个无线网络临时标识RNTI，该多个RNTI中的每个RNTI包括L个比特，该L个比特对应极化码的生成矩阵的N个行中的L个行，该N个行中的每个行具有一个汉明重量，其中，该多个RNTI具有相同的I个比特，该I个比特在该多个RNTI中的每个RNTI中对应相同的比特位置，该第I个比特对应该L个行中具有第一汉明重量的M个行中的I个行，第一汉明重量为该L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数；发射端向接收端发送配置信息，配置信息用于指示该多个RNTI。

Description

配置无线网络临时标识RNTI的方法和装置
本申请要求于2018年09月07日提交国家知识产权局、申请号为201811044422.3、申请名称为“配置无线网络临时标识RNTI的方法和装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及无线通信领域，尤其涉及一种配置RNTI的方法和装置。
背景技术
在无线通信系统中，发射端向接收端发送比特序列时，为了在接收端检验接收到的比特序列的正确性，发射端可以在信息比特序列中添加若干个(例如，24个)校验比特。进一步地，发射端可以采用无线网络临时标识(radio network tempory identity,RNTI)对校验比特的后几位(例如，最后16位)加掩(mask)，这个过程称为RNTI加掩。最后，经过RNTI加掩的比特序列经过信道编码和调制等处理被发送至接收端。接收端对接收到的数据经过解调等处理之后输入至译码器进行译码，输出多个候选译码路径。由于发射端使用RNTI进行了加掩，接收端需要进行解掩尝试。一般地，系统为接收端配置有多个RNTI，而上述发射端对比特序列进行加掩所使用的RNTI是这多个RNTI中的一个，但是接收端并不知道发射端具体使用的是这多个RNTI中的哪一个，因此需要使用这多个RNTI一一进行解掩尝试。理论上，只有在接收端进行解掩使用的RNTI和发射端进行加掩所使用的RNTI相同的情况下，解掩之后的比特序列才能通过循环冗余校验(cyclic redundancy check,CRC)。最终，接收端会将经过RNTI解掩之后通过CRC的候选译码路径输出作为译码路径。
在新无线(new radio,NR)中，信道编码将采用极化码(即，polar码)。接收端采用串行抵消列表(successive cancellation list，SCL)译码算法进行译码。实践发现，采用SCL译码的虚警概率(false alarm ratio,FAR)较高。例如，信息比特序列译码正确，但是分别经过多个RNTI解掩的候选译码路径都通过了CRC。又例如，信息比特序列译码正确，但是最终通过CRC的路径对应的RNTI并不是发射端加掩时使用的RNTI。再例如，信息比特序列译码错误，并且通过CRC的路径对应的RNTI也不是发射端加掩时使用的RNTI。由此可见，虚警概率较高，这样会直接影响接收端接收信息的正确性。
发明内容
本申请提供一种配置RNTI的方法和装置，能够降低虚警概率。
第一方面，本申请提供了一种配置RNTI的方法，该方法包括：发射端配置多个无线网络临时标识RNTI，该多个RNTI中的每个RNTI包括L个比特，该L个比特对应极化码的生成矩阵的N个行中的L个行，该N个行中的每个行具有一个汉明重量，其中，该 多个RNTI具有相同的I个比特，该I个比特在该多个RNTI中的每个RNTI中对应相同的比特位置，该I个比特对应该L个行中具有第一汉明重量的M个行中的I个行，第一汉明重量为所述L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数；发射端向接收端发送配置信息，配置信息用于指示该多个RNTI。
在本申请的技术方案中，发射端为接收端配置多个RNTI，该多个RNTI的长度都是相同的，记作L。因此，也可以说每个RNTI包括L个比特，该L个比特对应极化码的生成矩阵的N个行中的L个行。该L行中的每个行都具有一个汉明重量，那么这L个行对应多个(可能等于或小于L个)汉明重量。这多个汉明重量有大有小。该多个RNTI中的每个RNTI中与最小汉明重量的行对应的比特位置的比特的值相同。满足这样的特点的多个RNTI，发射端使用该多个RNTI中的一个RNTI对发送给接收端的比特序列进行加掩。接收端使用该多个RNTI对给加掩的比特序列进行解掩，可以降低发生虚警的概率。
结合第一方面，在第一方面的某些实现方式中，该多个RNTI还具有J个相同的比特，该J个比特在该多个RNTI中的每个RNTI中对应相同的比特位置，该J个比特对应该L个行中具有第二汉明重量的P个行中的J个行，第二汉明重量大于第一汉明重量，且第二汉明重量小于该L个行中除了该I个行和该P个行之外的其余行的汉明重量，1≤J≤L，I+J<L，且J为整数。
在保证最小汉明重量的行对应的比特位置的比特相同的基础上，可以进一步保证该多个RNTI的与具有次小汉明重量的行的部分行或全部行对应的比特位置的比特的值相同。可以进一步降低虚警的概率。
结合第一方面，在第一方面的某些实现方式中，该多个RNTI还具有R个相同的比特，该R个相同的比特在该多个RNTI中的每个RNTI中对应相同的比特位置，该R个比特对应该L个行中具有第三汉明重量的Q个行中的R个行，第三汉明重量大于第二汉明重量，且第三汉明重量小于该L个行中除了该I个行、该P个行和该Q个行之外的其余行的汉明重量，1≤R≤L，I+J+R<L，R为整数。
在本实施例中，除了将该多个RNTI的与生成矩阵的上述L个行中具有最小汉明重量和次小汉明重量的行对应的比特位置的比特配置为相同，还可以将进一步扩展到次次小汉明重量的行对应的比特位置的比特配置为相同，可以更进一步地降低虚警概率。
结合第一方面，在第一方面的某些实现方式中，发射端配置多个RNTI，包括：发射端根据生成矩阵的所述L个行的汉明重量，配置该多个RNTI；或者，发射端根据生成矩阵的该L个行的可靠度参数，配置该多个RNTI，其中，每个行的可靠度参数用于表征所述行对应的极化信道的可靠度；或者，发射端根据生成矩阵的所述L个行的汉明重量和该L个行的可靠度参数，配置该多个RNTI。
发射端可以根据生成矩阵的所述L个行的汉明重量和/或所述L个行的可靠度参数来配置该多个RNTI。可以在不同的情况下，采用灵活配置该多个RNTI。
结合第一方面，在第一方面的某些实现方式中，发射端根据生成矩阵的该L个行的汉明重量和该L个行的可靠度参数，配置该多个RNTI，包括：在该L个行中至少两个行的汉明重量相同的情况下，根据该至少两个行的可靠度参数，配置该多个RNTI的与该至少两个行对应的比特位置的比特，其中，该多个RNTI的与该至少两个行中具有较小可靠度的行对应的比特位置的比特配置为相同。
结合第一方面，在第一方面的某些实现方式中，该方法还包括：发射端在需要发送给接收端的第一比特序列中添加循环冗余校验CRC比特，得到第二比特序列；发射端使用该多个RNTI中的一个RNTI对第二比特序列加掩，得到第三比特序列；发射端向接收端发送第三比特序列。
第二方面，本申请提供一种配置RNTI的方法，该方法包括：接收端从发射端接收配置信息，该配置信息用于指示多个RNTI，该多个RNTI中的每个RNTI包括L个比特，该L个比特对应极化码的生成矩阵的N个行中的L个行，该N个行中的每个行具有一个汉明重量，其中，该多个RNTI具有相同的I个比特，该I个比特在该多个RNTI中的每个RNTI中对应相同的比特位置，该I个比特对应该L个行中具有第一汉明重量的M个行中的I个行，第一汉明重量为该L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数；接收端使用所述多个RNTI，对多个候选译码路径进行解掩。
应理解，第二方面或第二方面的其它实现方式的有益技术效果与第一方面及其第一方面的其它实现方式的有益效果完全对应，这里不再赘述。
结合第二方面，在第二方面的某些实现方式中，该多个RNTI还具有J个相同的比特，该J个比特在该多个RNTI中的每个RNTI中对应相同的比特位置，该J个比特对应该L个行中具有第二汉明重量的P个行中的J个行，第二汉明重量大于第一汉明重量，且第二汉明重量小于该L个行中除了该I个行和该P个行之外的其余行的汉明重量，1≤J≤L，I+J<L，且J为整数。
结合第二方面，在第二方面的某些实现方式中，该多个RNTI还具有R个相同的比特，该R个相同的比特在该多个RNTI中的每个RNTI中对应相同的比特位置，该R个比特对应该L个行中具有第三汉明重量的Q个行中的R个行，第三汉明重量大于第二汉明重量，且第三汉明重量小于该L个行中除了该I个行、该P个行和该Q个行之外的其余行的汉明重量，1≤R≤L，I+J+R<L，R为整数。
结合第二方面，在第二方面的某些实现方式中，该多个RNTI还具有R个相同的比特，该R个相同的比特在该多个RNTI中的每个RNTI中对应相同的比特位置，该R个比特对应该L个行中具有第三汉明重量的Q个行中的R个行，第三汉明重量大于第二汉明重量，且第三汉明重量小于该L个行中除了该I个行、该P个行和该Q个行之外的其余行的汉明重量，1≤R≤L，I+J+R<L，R为整数。
结合第二方面，在第二方面的某些实现方式中，该多个RNTI是发射端根据生成矩阵的该L个行的汉明重量配置的；或者，该多个RNTI是发射端根据生成矩阵的该L个行的可靠度参数配置的，其中，每个行的可靠度参数用于表征所述行对应的极化信道的可靠度；或者，该多个RNTI是发射端根据生成矩阵的该L个行的汉明重量和可靠度参数配置的。
结合第二方面，在第二方面的某些实现方式中，在该L个行中至少两个行的汉明重量相同的情况下，该多个RNTI的与该至少两个行中具有较小可靠度的行对应的比特位置的比特配置为相同。
结合第二方面，在第二方面的某些实现方式中，该方法还包括：接收端从发射端接收待译码序列，并对待译码序列进行译码，得到多个候选译码路径；接收端输出使用该多个RNTI中的任意一个RNTI解掩后通过循环冗余校验CRC的候选译码路径作为译码路径。
第三方面，本申请提供一种通信装置，用于执行第一方面或第一方面的任意可能的实现方式中的方法。具体地，该通信装置包括执行第一方面或第一方面的任意可能的实现方式中的方法的单元。
第四方面，本申请提供一种通信装置，用于执行第二方面或第二方面的任意可能的实现方式中的方法。具体地，该通信装置包括执行第二方面或第二方面的任意可能的实现方式中的方法的单元。
第五方面，本申请提供一种网络设备，包括收发器、处理器和存储器。处理器用于控制收发器收发信号，存储器用于存储计算机程序，处理器用于调用并运行存储器中存储的计算机程序，使得网络设备执行第一方面及其第一方面任意可能的实现方式中的方法。
第六方面，本申请提供一种终端设备，包括收发器、处理器和存储器。处理器用于控制收发器收发信号，存储器用于存储计算机程序，处理器用于调用并运行存储器中存储的计算机程序，使得终端设备执行第二方面及其第二方面任意可能的实现方式中的方法。
第七方面，本申请提供一种计算机可读存储介质，该计算机可读存储介质中存储有指令，当指令在计算机上运行时，使得计算机执行上述第一方面或第一方面任意可能的实现方式中的方法。
第八方面，本申请提供一种计算机可读存储介质，该计算机可读存储介质中存储有指令，当指令在计算机上运行时，使得计算机执行第二方面或第二方面任意可能的实现方式中的方法。
第九方面，本申请提供一种芯片，包括存储器和处理器，存储器用于存储计算机程序，处理器用于从存储器中调用并运行该计算机程序，以执行上述第一方面及其第一方面任意可能的实现方式中的方法。
可选地，该芯片仅包括处理器，处理器用于读取并执行存储器中存储的计算机程序，当计算机程序被执行时，处理器执行第一方面或第一方面任意可能的实现方式中的方法。
第十方面，本申请提供一种芯片，包括存储器和处理器，存储器用于存储计算机程序，处理器用于从存储器中调用并运行该计算机程序，以执行第二方面或第二方面任意可能的实现方式中的方法。
可选地，上述芯片仅包括处理器，处理器用于读取并执行存储器中存储的计算机程序，当计算机程序被执行时，处理器执行第二方面或第二方面任意可能的实现方式中的方法。
第十一方面，本申请提供一种计算机程序产品，该计算机程序产品包括计算机程序代码，当计算机程序代码在计算机上运行时，使得计算机执行上述第一方面或其任意可能的实现方式中的方法。
第十二方面，本申请提供一种计算机程序产品，该计算机程序产品包括计算机程序代码，当计算机程序代码在计算机上运行时，使得计算机执行第二方面或其任意可能的实现方式中的方法。
可选的，上述的存储器与存储器可以是物理上相互独立的单元，或者，存储器也可以和处理器集成在一起。
第十三方面，本申请提供一种配置RNTI的方法，该方法包括：发射端根据需要配置的无线网络临时标识RNTI的长度N，选取M个比特生成多个第一比特序列，M≤N，N和M为整数；对该多个第一比特序列中的每个第一比特序列进行线性编码，得到多个第 二比特序列，该多个第二比特序列与该多个第一比特序列一一对应；发射端向接收端发送配置信息，该配置信息用于指示该多个第二比特序列中的L个第二比特序列，L≥2且为整数。
这里，每个第二比特序列即是一个RNTI。因此，生成的多个第二RNTI可以组成一个RNTI的备选集合。发射端从该备选RNTI集合中任意选取L个RNTI，并将选取的该L个RNTI通知给接收端。后续，发射端使用该L个RNTI中的一个RNTI对待加掩的比特序列进行加掩，并向接收端发送经过加掩的比特序列。接收端使用该L个RNTI对待解掩的比特序列进行解掩尝试。其中，RNTI加掩和RNTI解掩的过程与第一方面的方法中相同，不再赘述。
可选地，对第一比特序列进行编码编码时采用的编码方式可以为如下任意一种编码：卷积码、Turbo码、LDPC、CRC码、RM码和循环码。
可选地，该方法还包括：对该多个第二比特序列中的每个第二比特序列进行比特交织，并将交织后得到的多个比特序列作为所述RNTI的备选集合。
这里，每一个第二比特序列经过比特交织之后得到的比特序列，即是一个RNTI。
第十四方面，本申请提供一种通信装置，用于执行第十三方面或第十三方面的任意可能的实现方式中的方法。具体地，该通信装置包括执行第十三方面或第十三方面的任意可能的实现方式中的方法的单元。
可选地，该通信装置的功能可以部分或全部通过软件实现。当全部通过软件实现时，该通信装置可以包括存储器和处理器，其中，存储器用于存储计算机程序，处理器从存储器中读取并运行该计算机程序，以执行第十三方面中的方法。
可选地，该通信装置包括处理器，该用于存储计算机程序的存储器位于该通信装置之外，处理器通过电路/电线与该存储器连接。
可选地，该通信装置可以为芯片或集成电路。
第十五方面，本申请提供一种芯片，包括存储器和处理器，存储器用于存储计算机程序，处理器用于从存储器中调用并运行该计算机程序，以执行第十三方面及其第十三方面任意可能的实现方式中的方法。
第十六方面，本申请提供一种计算机可读存储介质，该计算机可读存储介质中存储有指令，当指令在计算机上运行时，使得计算机执行第十三方面或第十三方面任意可能的实现方式中的方法。
第十七方面，本申请提供一种计算机程序产品，该计算机程序产品包括计算机程序代码，当计算机程序代码在计算机上运行时，使得计算机执行第十三方面或其任意可能的实现方式中的方法。
本申请提供的技术方案，通过分析polar码的SCL译码算法本身的特点，发现了发生RNTI虚警的原因，从而提出一种配置RNTI的方法。根据该方法配置的多个RNTI满足一些特点(具体参见说明书中的说明)。发射端使用该多个RNTI中的一个RNTI对发送给接收端的比特序列进行加掩。接收端使用该多个RNTI对从发射端接收的比特序列进行解掩，可以降低发生虚警的概率。
附图说明
图1是适用于本申请的无线通信系统100。
图2是无线通信的基本流程。
图3是本申请提供的信道编码和译码流程示意图。
图4是SCL译码的过程示意图。
图5是虚警的一种情况的示意图。
图6是虚警的另一种情况的示意图。
图7是CCE＝1时DCI的最后16位比特在生成矩阵中对应行的汉明重量和可靠度。
图8是CCE＝2时DCI的最后16位比特在生成矩阵中对应行的汉明重量和可靠度。
图9是CCE＝4时DCI的最后16位比特在生成矩阵中对应行的汉明重量和可靠度。
图10是导致虚警发生的RNTI对与生成矩阵的对应行的汉明重量的示意图。
图11是针对CCE＝1时配置RNTI的参考表。
图12是针对CCE＝2时时配置RNTI的参考表。
图13是针对CCE＝2时时配置RNTI的参考表。
图14是本申请提供的配置RNTI的方法200的流程图。
图15是本申请提供的另一种配置RNTI的方法300的流程图。
图16是本申请提供的一种通信装置500的示意性框图。
图17是本申请提供的一种通信装置600的示意性框图。
图18是本申请提供的一种通信装置700的示意性框图。
图19是本申请提供的一种通信装置800的示意性框图。
图20是本申请提供的一种网络设备3000的结构示意图。
图21是本申请提供的一种终端设备900的结构示意图。
具体实施方式
下面将结合附图，对本申请中的技术方案进行描述。
本申请实施例中提及的无线通信系统，包括但不限于全球移动通讯(global system of mobile communication，GSM)系统、码分多址(code division multiple access，CDMA)系统、宽带码分多址(wideband code division multiple access，WCDMA)系统、通用分组无线业务(general packet radio service，GPRS)、长期演进(long term evolution，LTE)系统、LTE的频分双工(frequency division duplex，FDD)系统、LTE的时分双工(time division duplex，TDD)、通用移动通信系统(universal mobile telecommunication system，UMTS)、全球互联微波接入(worldwide interoperability for microwave access，WiMAX)通信系统、下一代5G移动通信系统的三大应用场景，即增强移动带宽(enhance mobile broadband，eMBB)，高可靠性低延迟通信(ultra reliable low latency communication，URLLC)和增强海量机器连接通信(massive machine type communication，eMTC)或者将来出现的新的通信系统等。
本申请实施例中涉及的终端设备可以指用户设备(user equipment，UE)、终端(terminal)、接入终端、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置。终端设备还可以是蜂窝电话、无绳电话、会话启动协议(session initiation protocol，SIP)电话、无线本地环路(wireless  local loop，WLL)站、个人数字处理(personal digital assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备，未来5G网络中的终端设备或者未来演进的公用陆地移动通信网络(public land mobile network，PLMN)中的终端设备等，本申请对此不作限定。
本申请实施例中涉及的网络设备可以是用于与终端设备通信的设备，该网络设备可以是全球移动通讯(global system of mobile communication，GSM)系统或码分多址(code division multiple access，CDMA)中的基站(base transceiver station，BTS)，也可以是宽带码分多址(wideband code division multiple access，WCDMA)系统中的基站(nodeB，NB)，还可以是LTE系统中的演进型基站(evolutional nodeB，eNB或eNodeB)，还可以是云无线接入网络(cloud radio access network，CRAN)场景下的无线控制器，或者该网络设备还可以为中继站、接入点、车载设备、可穿戴设备以及未来5G网络中的网络设备等，本申请对此不作限定。
参见图1，图1是适用于本申请的无线通信系统100。无线通信系统100中可以包括至少一个网络设备101，网络设备101与一个或多个终端设备(例如，图1中所示的终端设备102和终端设备103)进行通信。网络设备可以是基站，也可以是基站与基站控制器集成后的设备，还可以是具有类似通信功能的其它设备。
图1中的网络设备与终端设备之间采用无线技术进行通信。当网络设备发送信号时，网络设备为发射端，当网络设备接收信号时，其为接收端。反之，当终端设备发送信号时，终端设备为发射端，当终端设备接收信号时，其为接收端。
图2是无线通信的基本流程，在发送端，信源依次信源编码、信道编码、数字调制后发出。在接收端，依次通过数字解调、信道译码、信源解码输出信宿。
信道编解码是无线通信领域的核心技术之一。目前，极化码是可理论证明达到香农极限，并且具有可实用的线性复杂度编译码能力的信道编码技术。极化码构造的核心是通过“信道极化”的处理，在编码端采用编码的方法使各个子信道呈现出不同的可靠性，当码长持续增加时，一部分信道将趋向于容量接近于1的无噪信道，另一部分信道趋向于容量接近于0的全噪信道，选择在容量接近于1的信道上直接传输信息以逼近信道容量。
Polar码的编码策略正是应用了这种现象的特性，利用无噪信道传输用户有用的信息，全噪信道传输约定的信息或者不传信息。Polar码是一种线性分组码，其生成矩阵(也称为编码矩阵)为F N，编码过程可以表示为
Figure PCTCN2019104807-appb-000001
其中，
Figure PCTCN2019104807-appb-000002
是一个二进制的行矢量，长度为N(即,码长),且N＝2 n，n为正整数。F N是一个N×N的矩阵，且
Figure PCTCN2019104807-appb-000003
定义为log2 N个矩阵F 2的克罗内克(Kronecker)乘积，
Figure PCTCN2019104807-appb-000004
以上各式中涉及的加法、乘法操作均为二进制伽罗华域上的加法、乘法操作。
Polar码的编码过程中，
Figure PCTCN2019104807-appb-000005
中的一部分比特用来携带信息，称为信息比特集合。这些比特的索引的集合记作A。
Figure PCTCN2019104807-appb-000006
中的另外的一部分比特设置为接收端和发送端预先约定的固定值，称之为固定比特集合或冻结比特(frozen bits)集合，其索引的集合用A的补集A c表示。Polar码的编码过程相当于
Figure PCTCN2019104807-appb-000007
这里，F N(A)是F N中由集合A中的索引对应的行得到的子矩阵。F N(A C)是F N中由集合A C中的索引对应的行得 到的子矩阵。u A为
Figure PCTCN2019104807-appb-000008
中的信息比特集合，数量为K。
Figure PCTCN2019104807-appb-000009
为
Figure PCTCN2019104807-appb-000010
中的固定比特集合，其数量为(N-K)，是已知比特。这些固定比特通常被设置为0，但是只要接收端和发送端预先约定，固定比特可以被任意设置。从而，Polar码的编码输出可简化为
Figure PCTCN2019104807-appb-000011
这里的u A为
Figure PCTCN2019104807-appb-000012
中的信息比特集合，u A为长度K的行矢量，即|A|＝K,符号||表示集合中元素的个数，K为信息块大小，F N(A)是矩阵F N中由集合A中的索引对应的那些行得到的子矩阵，F N(A)是一个N×N的矩阵。
Polar码的构造过程即集合A的选取过程，决定了Polar码的性能。Polar码的构造过程通常是，根据母码码长N确定共存在N个极化信道，这N个极化信道分别对应生成矩阵F N的N个行。生成矩阵F N的每一行都具有一个汉明重量(也可以称作行重)，每一行的汉明重量反映了该行对应的极化信道的可靠度。一个行的汉明重量是指该行非零元素的个数。其中，汉明重量都是2的整数次幂。例如，汉明重量为2、4、16、32、64、128、256等。
例如，
Figure PCTCN2019104807-appb-000013
F 2包括两行。第一行的汉明重量为1，第二行的汉明重量为2。
又例如，
Figure PCTCN2019104807-appb-000014
F 4包括4行，汉明重量分别为1、2、2、4。
参见图3，图3是本申请提供的采用Polar码作为编码方案的信道编码和译码流程示意图。如图3所示，发射端主要包括如下处理流程。
(1)在待发送比特序列中添加若干循环冗余校验(cyclic redundancy check,CRC)比特，经过比特交织器构成分布式CRC结构，便于接收端提前终止译码。
其中，待发送比特序列可以理解为发射端需要发送给接收端的信息比特序列，它是一个二进制的比特序列。另外，这里所说的若干CRC比特，也可以称为CRC校验序列或者CRC校验码，它也是一个二进制的比特序列。CRC校验序列的长度可以由通信系统设定。
应理解，给定一个待发送比特序列，可以计算得到它的CRC校验序列，具体的计算过程可以参考现有技术，这里不作详述。
需要说明的是，在待发送比特序列中添加CRC校验序列时，通常是将CRC校验序列直接加在待发送比特序列之后。例如，假定待发送比特序列是110010，计算得到的CRC校验序列为010100。那么将CRC校验序列直接附加在待发送比特序列之后，应为110010010100。
除了将CRC校验序列直接添加在待发送比特序列之后，还可以将CRC校验序列中的部分比特交织在待发送比特序列中，称为分布式CRC结构。在分布式CRC结构中，CRC校验序列的部分比特比特(例如前几个比特)将分散在待发送比特序列中，再将CRC校验序列中的其余比特附加在完成交织的比特序列之后。继续以上面的示例来说明，假定按照通信系统预设，是将CRC校验序列的前3位交织在待发送比特序列中，可以按照现有技术中的任意一种比特交织方法，将010交织在待发送比特序列中，得到一个长度为9(即， 6+3)的交织后的比特序列，再将100附在这个交织后的比特序列之后。
在新无线(new radio,NR)中规定，信道编码采用24位的CRC校验序列，并且这24位中的前8位比特通过交织分散在待发送比特序列中，这24比特中的后16位比特附在完成交织的比特序列之后。其中，分布式CRC结构目的在于提前终止译码。提前终止译码是指在如果接收端可以根据CRC检验序列的前8个比特判断出译码结果出错，就可以终止译码。
以下，我们以NR中规定的CRC校验序列为24位，前8个比特交织在待发送比特序列中，最后16个比特附在完成交织的比特序列之后作为示例，说明后续的处理过程。
(2)CRC校验序列的最后16位比特与一个16位长度的无线网络临时标识(radio network tempory identity,RNTI)做逐比特异或，完成RNTI加掩。
应理解，CRC校验序列的最后16位比特与长度为16的RTNI逐比特异或的过程，即是RNTI加掩。
以发射端为基站，接收端为终端设备为例，基站覆盖的小区内有多个终端设备，对于每一个终端设备而言，基站可以为终端设备配置多个RNTI，这多个RNTI的功能可能是不同的。例如，这多个RNTI中的某个RNTI用于网络设备向终端设备发送寻呼消息，某个RNTI用于网络设备向终端设备发送系统消息，某个RNTI用于向终端设备发送随机接入响应等。基站会将配置的该多个RNTI通知给终端设备。
这里，对CRC校验序列的最后16位进行加掩所使用的RNTI是发射端为接收端配置的该多个RNTI中的某一个。
(3)将完成RNTI加掩的比特序列按信息位索引映射至编码器的输入端进行polar编码，然后经过速率匹配得到需要的聚合等级，经正交相移键控(quadrature phase shift keyin,QPSK)调制后发射。
相对应地，接收端主要包括如下处理流程：
(1)对接收到的数据解速率匹配，然后输入译码器进行译码。
具体地，对于控制信道的polar编码，译码端通行的译码方法是SCL译码算法。
为了便于理解，下面对SCL译码算法进行简单说明。
根据极化码(polar code)的编码原理可以知道，极化码的构造就是极化信道的选择问题。由于各个极化信道之间并不是相互独立的，而是具有依赖关系的：信道序号大的极化信道依赖于所有比其序号小的极化信道。基于极化信道之间的这种依赖关系，串行抵消(successive cancellation,SC)译码算法按照信道序号从小到大的顺序依次对每个比特进行译码判决(或者称为比特判决)。并且，在对第i个比特进行判决时，是基于之前所有(i-1)个比特译码判决的结果都是正确的假设条件。当码长趋近于无穷时，由于分裂信道接近于完全极化(信道容量或者为0，或者为1)，每个信息比特都会被正确译码。但是，在有限码长下，由于信道极化并不完全，依然会存在一些信息比特无法被正确译码。如果前面(i-1)个信息比特的译码中发生了错误，由于译码器在对后面的信息比特译码时需要用到这(i-1)个的信息比特的估计值，从而会导致错误的传递。
上述译码的过程可以参见图4所示的N＝4的译码树。参见图4，图4是N＝4的译码树的示例。如图4所示，译码树即是一个二叉树，译码树的结构仅与码长N有关。在译码树上，一个节点的深度定义为译码树的根节点到该节点的最短路径长度。可以看到，对于 一个码长等于的极化码，译码树上的节点组成的集合能够按照深度d划分为N+1个子集，记作V d，其中，d＝0,1,…,N。容易理解，V 0仅包含根节点。除了译码树上的叶子节点(即d＝N时)，译码树上的每一个节点 分别通过两条分别标记 和 的边与后继节点相连。某一个节点 所对应的序列
Figure PCTCN2019104807-appb-000015
定义为从根节点到达该节点 所需要经过的各个边的标记序列。另外，在译码树中，从根节点到任意一个节点所形成的路径，都对应一个路径度量值(path metric,PM)，可以计算得到。路径度量值可以作为判断该路径的优劣的参考。从根节点到叶子节点所在层的某一节点所需要经过的各个边的标记序列即是一条译码路径。因此，极化码的译码过程也就是在二叉树上寻找合适的路径。如图4中所示，以码长N＝4为例，在每个节点处选择PM值最小的路径向下扩展，假定从根节点延伸至叶子节点层的节点A为最优路径，那么最终确定出的译码序列即为
Figure PCTCN2019104807-appb-000016
SC译码算法是一种贪婪算法，在译码树的每一层仅仅搜索最优路径(例如，根据路径的PM)就进行下一层，所以无法对错误进行修改。针对SC译码算法的缺点，人们提出了SCL译码算法。在译码树的每一层增加允许保留的候选路径数量，从SC译码算法的每一层仅允许选择“最优的一条路径进行下一步扩展”改为“最大允许选择最好的路径进行下一步扩展”。并且，将每一层允许保留的候选路径称为搜索宽度(记作Z)。与SC算法一样，SCL算法在进行译码时，依然从译码树的根节点开始，逐层依次向叶子节点层进行路径搜索。与SC不同的是，完成每一层的路径扩展后，选择PM最小的Z条路径作为候选路径，保存在一个列表中，等待进行下一层的扩展。经过上述的说明，可以知道SC译码算法是深度优先的，要求从根节点快速到达叶子节点。而SCL译码算法是广度优先的，先扩展、再剪枝，最终达到叶子节点。由此可知，SCL译码算法的输出为多个(由搜索宽度Z决定)候选译码路径。SCL译码算法也可简称为list译码方案。
(2)接收端对译码器输出的候选译码序列进行RNTI解掩。
如上文发射端的处理流程中所述，发射端为接收端配置了多个RNTI。对于接收端而言，它知道发射端是采用该多个RNTI中的某一个RNTI对发送的比特序列进行加掩的，但是，它并不知道具体是采用了哪一个RNTI。因此，接收端需要使用该多个RNTI一一进行解掩尝试。理论上，接收端进行解掩使用的这个RNTI与发射端进行加掩所使用的RNTI应该相同，解掩后的比特序列最终才能通过CRC。例如，假设发射端为接收端配置有5个RNTI，发射端使用这5个RNTI中的RNTI#1对上述CRC校验序列的后几位进行加掩。那么理论上，接收端使用RNTI#1对候选译码路径解掩之后的比特序列才能通过CRC。为了描述上的清楚，我们将接收端的这多个RNTI中与发射端加掩使用的RNTI相同的这个RNTI称为正确的RNTI，其余的RNTI则是错误的RNTI。例如，发射端为接收端配置了3个RNTI，分别记作RNTI#1、RNTI#2和RNTI#3。如果发射端使用RNTI#2对比特序列进行加掩，则对于接收端而言，在解掩的过程中，RNTI#2是正确的RNTI，使用RNTI#2对候选译码路径解掩之后得到的比特序列才能通过CRC。相比之下，RNTI#1和RNTI#3是错误的RNTI，使用RNTI#1或RNTI#3对候选译码路径解掩之后得到的比特序列，理论上都不能通过CRC。
(3)接收端对解掩之后的比特序列进行CRC校验，最终选择经过正确的RNTI解掩并通过CRC的候选译码路径作为译码结果输出。
由于候选译码路径有多条，因此，针对每一条候选译码路径，都需要进行RNTI解掩 和CRC校验。最终从该多个候选译码路径中选择经过正确的RNTI解掩，并通过CRC的候选译码路径作为最终的译码结果。
但是，实践发现译码的虚警概率较高。根据实践总结，主要有如下几种类型的虚警。
1、译码结果正确，但是有多条候选译码路径分别经过不同的RNTI解掩之后，都通过了CRC。
图5中，每条路径用P表示)。接收端使用两个RNTI(其中一个RNTI与发送端加掩时使用的RNTI相同，记作RNTI#1。另一个与发送端加掩时使用的RNTI不同，记作RNTI#2)对候选译码路径进行解掩，然后进入CRC校验单元进行CRC校验。结果发现，这8条路径中有一条路径(如图5中所示的P 1)在使用RNTI#1解掩之后，通过了CRC。而这8条路径中有另一条路径(如图5中所示的P 5)在使用RNTI#2解掩之后，也通过了CRC。
应理解，图5中所述的RNTI#2是指发射端为接收端配置的多个RNTI中与RNTI#1不同的任意一个RNTI，并不限定RNTI#2具体是该多个RNTI中的哪一个。
2、译码结果正确，但是错误的RNTI通过校验，正确的RNTI未通过CRC。
参见图6，图6是虚警的另一种情况的示意图。与图5中类似，假定发射端为接收端配置了多个RNTI。其中，发射端使用RNTI#1对待发送的比特序列进行加掩。而接收端使用RNTI#1对译码器输出的各个候选译码路径进行解掩，然后进入CRC校验单元，结果全部路径都不能通过CRC。但是，接收端使用该多个RNTI中的其它RNTI对候选译码路径进行解掩，再进入CRC校验单元，却有一条路径(如图6中所示的P 3)可以通过CRC。图6中，将通过CRC的路径时使用的RNTI记作RNTI#2。同样地，这里的RNTI#2是指发射端为接收端配置的多个RNTI中与RNTI#1不同的任意一个RNTI，并不限定RNTI#2具体是该多个RNTI中的哪一个。
3、译码结果错误，且错误的RNTI通过CRC。
接收端使用正确的RNTI对译码器输出的各个候选译码路径进行解掩，然后进入CRC校验单元，但是全部路径都不能通过CRC校验，即CRC校验出错。但是如果接收端使用错误的RNTI对候选译码路径进行解掩，却有一条路径可以通过CRC，但是译出的比特序列与待发送比特序列不同。即是说，译码结果错误，且接收端对候选译码路径解掩使用的RNTI也错误。不过，此类虚警的发生概率在10 -7及以下。
本申请的发明人深入分析，发现虚警是由于接收端使用列表(list)译码方案(即，上述SCL译码算法)导致的。下面结合公式(1)说明发生虚警的原因。
Figure PCTCN2019104807-appb-000017
其中，c 1∈CW，c′ 1∈CW C，CW是合法码字集合，CW C是合法码字集合的补集，即不合法码字的集合。从公式(1)可以看出，发射端使用RNTI#1对合法码字c 1进行加掩。而接收端的译码结果为码字c′ 1，并且使用RNTI#2对码字c′ 1解掩之后的比特序列最终通过了CRC，使得接收端误以为译码结果正确。但实际上，译码结果错误且解掩使用的RNTI错误，从而产生了虚警，增加了虚警概率。
这里，如果一个码字c满足c＝u·F N，则c是合法码字，否则c是不合法码字。其中，u是上文介绍的polar编码原理中待编码的比特序列
Figure PCTCN2019104807-appb-000018
中的固定比特设置为0时对应的比特序列，F N为polar码的生成矩阵。根据上文已知待编码的比特序列
Figure PCTCN2019104807-appb-000019
包括信息比特和固 定比特，具体地，将固定比特(也即对应的比特位置)设置为0时，待编码的比特序列与生成矩阵F N相乘(二进制伽罗华域上的乘法)得到的即是合法码字。
即是说，在接收端采用list译码方案输出的多条候选译码路径中，如果有一条候选译码路径的某个或某几个比特译错，而在对该候选译码路径进行解掩时，又恰好使用了一个错误的RNTI。使用该错误的RNTI对该候选译码路径进行解掩(即，上文所述的逐比特异或)，恰好使得该候选译码路径上译错的这几个比特得到纠正，最终解掩之后的比特序列通过了CRC校验。
为此，本申请提供一种配置RNTI的方法，可以降低虚警概率。
本申请的技术方案可以应用在上述任意一种无线通信系统中配置RNTI的场景。举个例子，本申请的技术方案适用于控制信道采用polar编码的场景下，例如，NR中基站为终端设备配置RNTI的场景。在本申请中，通过为小区(cell)内的终端设备合理配置RNTI，可以降低整个无线通信系统中由于RNTI冲突导致的虚警。
NR中规定控制信道采用polar编码，也即，下行控制信息(downlink control information，DCI)采用polar编码。并且，NR规定了采用polar编码的DCI的长度区间为[12,140]。更具体地，DCI的长度区间[12,140]可以采用5个聚合等级，这5个聚合等级分别为1CCE、2CCE、4CCE、8CCE和16CCE。每个聚合等级对应的速率匹配之后的码长为108、216、432、864和1728。对于每个聚合等级，理论上可以承载的DCI的长度以及采用的速率匹配方式可以参见表1所示。
表1
聚合等级 目标码长E值 A值区间 速率匹配方式
1CCE 108 [12,23] Puncture
1CCE 108 [24,83] Shortening
2CCE 216 [12,70] Puncture
2CCE 216 [71,140] Shortening
4CCE 432 [12,140] Puncture
8CCE 864 [12,140] Repetition
16CCE 1728 [12,140] Repetition
表1中，E值表示速率匹配之后的长度，也可以称为目标码长，A值表示编码之前信息比特序列的长度。另外，速率匹配方式中的Puncture表示打孔，shortening表示缩短，repetition表示重复。
在每个聚合等级，计算出DCI的最后16位在极化码(也即polar码)的生成矩阵中所对应的行的汉明重量及其可靠度，可以得到图7至图9。
图7示出了聚合等级为1(即，CCE＝1)时DCI的最后16位比特在生成矩阵中对应行的汉明重量和可靠度。图8示出了聚合等级为2(即，CCE＝2)时DCI的最后16位比特在生成矩阵中对应行的汉明重量和可靠度。图9示出了为聚合等级为4(即，CCE＝4)时DCI的最后16位比特在生成矩阵中对应行的汉明重量和可靠度。
另外，CCE＝8和CCE＝16的情况与图9所示相同，这里不再列出。也即，聚合等级等于8或16时，也可以查询图9。
其中，图7至图9中的每个聚合等级中，每个DCI区间的第一行为汉明重量，第二行为该行对应的极化信道的可靠度。图7至图9所展示的数据内容可以表格的形式表达或存储。
本申请的发明人发现，发生冲突的“RNTI对”几乎都是两个RNTI对应的生成矩阵的所有行中具有最小汉明重量的行对应的比特位置的比特异或之和为1，或者是具有次小汉明重量的行对应的比特位置的比特异或之和为1。
例如，(216，80)这个码型为例，RNTI0＝9575，RNTI1＝9677，存在第一类虚警。其中，216表示目标码长，80表示信息比特的个数。根据表1确定目标码长216对应的聚合等级为2CCE。根据根据图8可知，80落在2CCE的区间[71,140]。码型(216，80)对应的16位RNTI在生成矩阵中对应行的汉明重量和可靠度从图8中可以确定。将RNTI0和RNTI1转化为二进制序列分别为RNTI0＝0010010101100111，RNTI1＝0010010111001101。将RNTI0和RNTI1各自的16个比特和(216，80)对应的16位RNTI在生成矩阵中的对应行的汉明重量和可靠度对比来看，可以如图10所示。参见图10，图10以RNTI为16个比特，RNTI0＝9575，RNTI1＝9677为例说明导致虚警发生的RNTI对与生成矩阵的对应行的汉明重量的示意图。从图10可见，最小汉明重量8对应的RNTI0的比特为0，对应RNTI1的比特为1，RNTI0和RNTI1的该比特位置的比特值异或之和为1。
进一步地，发明人发现，生成矩阵中具有次小汉明重量的行对应的RNTI的比特位置的比特异或之和为1的情况下，发生虚警的概率也很高。
例如，(108,20)这个码型，RNTI0＝9575，RNTI1＝9328，虚警也很高。根据表1，确定目标码长108对应的聚合等级为1CCE。根据图7，确定80落在1CCE的区间[12,22]。并且根据图7，也可以确定(108,20)对应的16位RNTI在生成矩阵中对应行的汉明重量和可靠度。同样地，将RNTI0和RNTI1转化为二进制序列，再将RNTI0和RNTI1各自的16比特和(108，20)对应的16位RNTI在生成矩阵中对应行的汉明重量和可靠度对比来看，具有较小汉明重量的行对应的RNTI的比特位置的比特异或之和为1。
虽然上述码型(216,80)和(108,20)仅是作为示例进行说明，但是发明人发现，对于很多码型，具有最小汉明重量的行对应的RNTI的比特位置的比特异或之和为1，和/或具有次小汉明重量的行对应的RNTI的比特位置的比特异或之和为1，和/或具有次次小汉明重量的行对应的RNTI的比特位置的比特异或之和为1，发生虚警的情况是普遍存在的。
由此，本申请的技术方案提出，对于每个聚合等级的所有DCI区间，发射端为接收端配置的多个RNTI，需要满足如下特点：
该多个RNTI中的每个RNTI包括L个比特，该L个比特对应极化码的生成矩阵的N个行中的L个行，该N个行中的每个行具有一个汉明重量，该多个RNTI具有相同的I个比特，该I个比特在该多个RNTI中的每个RNTI中对应相同的比特位置，该I个比特对应所述L个行中具有第一汉明重量的M个行中的I个行。其中，第一汉明重量为该L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数。
应理解，RNTI包括L个比特，即是说RNTI的长度为L。其中，RNTI的长度可以由系统规定。例如，在NR中，控制信道采用polar编码，规定RNTI的长度为16。
进一步地，该多个RNTI还具有J个相同的比特，该J个比特在该多个RNTI中的每 个RNTI中对应相同的比特位置，该J个比特对应该L个行中具有第二汉明重量的P个行中的J个行。其中，第二汉明重量大于第一汉明重量，且第二汉明重量小于L个行除了该I个行和该P个行之外的其余行的汉明重量，1≤J≤P<L，I+J<L，且J为整数。
再进一步地，该多个RNTI还具有R个相同的比特，该R个相同的比特在该多个RNTI中的每个RNTI中对应相同的比特位置，该R个比特对应该L个行中具有第三汉明重量的Q个行中的R个行，第三汉明重量大于第二汉明重量，且第三汉明重量小于L个行中除了该I个行、该P个行和该Q个行之外的其余行的汉明重量，1≤R≤L，I+J+R<L，R为整数。
换句话说，发射端为接收端配置多个RNTI，该多个RNTI的长度都是相同的，记作L。因此，也可以说每个RNTI包括L个比特，该L个比特对应polar码的生成矩阵的N个行中的L个行。生成矩阵的所述L行中的每个行都具有一个汉明重量，那么这L个行对应多个(可能等于或小于L个)汉明重量。这多个汉明重量有大有小。该多个RNTI，首先需要保证具有最小汉明重量的行对应的比特位置的比特的值相同。可选地，可以是所有最小汉明重量的行对应的比特位置的比特的值都相同。或者，也可以是最小汉明重量的行中的一部分行对应的比特位置的比特的值相同。在此基础上，可以进一步保证具有次小汉明重量的行的部分行或全部行对应的比特位置的比特的值相同。以此类推，还可以扩展到次次小行，或者以此规律继续扩展。
根据本申请的技术方的设计思路，针对上述每个聚合等级对应的DCI区间，总结每个区间的RNTI配置方案可以参照图11-图13。
图11是针对聚合等级为1CCE时配置RNTI的参考表。其中，图11中标有“*”表示最高优先级的应该配置相同比特的比特位置。标有“**”的优先级低于“*”的优先级，可以在保证“*”对应的比特位置的比特相同的基础上，将标有“**”的比特位置的比特也配置为相同。对于没有作标记的行对应的比特位置，可以不作限制。
图12是针对聚合等级为2CCE时配置RNTI的参考表。图13是针对聚合等级为4CCE时配置RNTI的参考表。其中，图12和图13的“*”或“**”的含义与图11相同，不再赘述。
下面以(432,60)这个码型给出配置多个RNTI的示例。
首先根据上述表1确定目标码长432对应的聚合等级为4CCE。再根据码长60和图13确定60对应的DCI区间为[39,140]。根据本申请的技术方案，图13中，“*”对应的RNTI的比特位置的比特相同。进一步地，还可以配置“**”对应的RNTI的比特位置的比特相同。从图13中可以看出，32是所有16个行的汉明重量中最小的汉明重量，有1个行。其次是汉明重量为64的行，共有4个行。汉明重量大于32和64的其余行对应的汉明重量中，128是最小的汉明重量，共有6个行。假设发射端的RNTI＝0，最低配置可以考虑将汉明重量为32的行在RNTI中对应的1个比特位置的比特配置为0，参见图13，该比特位置为RNTI的第1个比特位置。进一步地，可以将汉明重量为64的4个行在RNTI中对应的4个比特位置的比特配置为0。参见图13，该4个比特位置分别为RNTI的第2个、第3个、第5个和第9个比特位置。再进一步地，如果考虑比较优选的配置的情况下，则将上述汉明重量为32、64和128的行在RNTI中对应的比特位置的比特全部配置为0，即与发射端保持相同，则配置给接收端的RNTI的第1，2，3，4，5，6，7，9，10，11，13个比特位置全部配置为0，共11个比特位置。剩余的5个(即，16-11)比特位置不作限定， 每个比特都可以配置为0或1。所以，接收端的RNTI可以有2 5种可能的配置。这2 5种配置可以参见表2中。
表2
1 0000 0000 0000 0000
2 0000 0000 0000 0001
3 0000 0000 0000 0010
4 0000 0000 0000 0011
5 0000 0000 0000 0100
6 0000 0000 0000 0101
7 0000 0000 0000 0110
8 0000 0000 0000 0111
9 0000 0000 0001 0000
10 0000 0000 0000 1001
11 0000 0000 0000 1010
12 0000 0000 0001 1011
13 0000 0000 0001 0100
14 0000 0000 0001 0101
15 0000 0000 0001 0110
16 0000 0000 0001 0111
17 0000 0001 0000 0000
18 0000 0001 0000 0001
19 0000 0001 0000 0010
20 0000 0001 0000 0011
21 0000 0001 0000 0100
22 0000 0001 0000 0101
23 0000 0001 0000 0110
24 0000 0001 0000 0111
25 0000 0001 0001 0000
26 0000 0001 0001 0001
27 0000 0001 0001 0010
28 0000 0001 0001 0011
29 0000 0001 0001 0100
30 0000 0001 0001 0101
31 0000 0001 0001 0110
32 0000 0001 0001 0111
可选地，在将汉明重量为64的行对应的比特位置上的比特部分配置为0时，由于这些行的汉明重量都是相等的，这时可以结合这些行对应的可靠度来配置。例如，可以将汉明重量为64的所有行中可靠度较低的这些行对应的比特位置上的比特配置为0。可选地， 也可以从汉明重量为64的所有行中随机选择部分行，将这部分行对应的比特位置上的比特配置为和发射端相同，也即配置为0。同理，这种配置方法也可以应用在其它汉明重量的行对应的比特位置的配置。
根据本申请的技术方案，对于每种聚合等级的每个DCI区间，如果考虑比较优选的配置，可供分配给接收端的RNTI一般为16或32个。当然了，如果降低配置的要求(例如，仅保证汉明重量最小的行在RNTI中对应的比特位置与发射端相同，而不保证汉明重量的次小行或次次小行。又例如，仅保证汉明重量最小行和次小行在RNTI中对应的全部比特位置中的一部分比特位置与发射端相同)，可供分配的RNTI的数量就会多一些。本领域技术人员根据本申请技术方案的设计思路，容易想到多种可能的配置方式，这里不再一一列举。
上面对本申请提出的配置RNTI的技术方案进行了详细说明。下面说明发射端和接收端对该多个RNTI的使用。
参见图14，图14是本申请提供的配置RNTI的方法200的应用示例。
210、发射端端配置该多个RNTI。
其中，该多个RNTI满足上文所述的特点，这里不再赘述。
220、发射端向接收端发送配置信息，接收端从发射端接收该配置信息，该配置信息用于指示该多个RNTI。
这里，配置信息可以是基于周期发送或非周期发送的，本申请不作限定。接收端根据配置信息，可以获得该多个RNTI，以在后续接收DCI时使用。
可选的，作为代替步骤210-220的一种方式，也可以按照上述规则配置好RNTI，存储在发射端和接收端备用。
可选地，还可以包括步骤230-260。
230、发射端对需要发送给接收端的第一比特序列添加CRC校验序列，得到第二比特序列。
可选地，可以将CRC校验序列直接附在第一比特序列之后，或者，也可以将CRC校验序列的前几个比特交织在第一比特序列中，再将CRC校验序列的后几个比特附在交织后的比特序列之后。即如上文所说的分布式CRC结构。或者，还可以采用现有技术中其它的添加CRC校验序列的方法。本申请对此不作限定。
其中，CRC校验序列的长度可以由通信系统预定义。例如，在NR中，规定CRC校验序列的长度为24。该24个比特的前8个比特交织在第一比特序列中，最后16个比特直接附在交织后的比特序列后面。也即，形成分布式CRC结构。
可选地，在步骤230之后，还可以对添加CRC校验序列之后的比特序列进行比特交织。本申请中不限定比特交织的方法。例如，可以是行列交织，或者其它的交织方法。
240、发射端使用该多个RNTI中的一个RNTI对第二比特序列进行加掩，得到第三比特序列。
应理解，使用该多个RNTI中的一个RNTI对第二比特序列进行加掩，具体是使用该多个RNTI中的一个RNTI对CRC校验序列的最后几个(例如，最后16个)校验位逐比特进行异或的过程。完成RNTI加掩之后的比特序列称为第三比特序列。
应理解，如果在步骤230之后进行了比特交织。那么在步骤240中，发射端使用该多 个RNTI中的一个RNTI对交织后的比特序列进行RNTI加掩。
250、发射端向接收端发送第三比特序列。
发射端在完成RNTI加掩，得到第三比特序列之后，第三比特序列经过如图3中所示polar编码、速率匹配、QPSK调制等处理流程之后被发送。
260、接收端从发射端接收待译码序列，经过解调、解速率匹配和SCL译码，输出多个候选译码路径。
270、接收端使用该多个RNTI对该多个候选译码路径进行解掩尝试，将解掩之后通过CRC的候选译码路径作为译码路径输出。
接收端使用该多个RNTI一一对该多个候选译码路进行解掩尝试，最终输出使用该多个RNTI中的某一个RNTI解掩之后通过CRC的候选译码路径作为译码路径。
假设将步骤240中发射端对第二比特序列进行加掩使用的RNTI记作第一RNTI。在步骤270中，理论上，接收端只有在使用该多个RNTI中的第一RNTI对该多个候选译码路径进行解掩之后，有一条候选译码路径能够通过CRC。这条候选译码路径即是接收端最终应该输出的译码路径。
采用本申请技术方案，可以将PDCCH进行polar编码时10 -4～10 -3量级的RNTI冲突造成的虚警概率(false alarm ratio,FAR)降低至10 -6以下。
以上配置RNTI的方法200主要适用于针对PDCCH采用polar编码的场景。本申请还提供一种配置RNTI的方法300，可以应用于任何需要避免RNTI冲突的场景。
需要说明的是，以下方法300中比特序列的编号与上述方法200中比特序列的编号互不相关。例如，图15中所示的第一比特序列与上述方法200中的第一比特序列仅用于在各自的实施例中与其它比特序列区分，两者之间没有任何关联。
参见图15，图15是本申请提供的另一种配置RNTI的方法300的流程图。
310、根据需要配置的RNTI的长度N，选取M个比特，生成多个第一比特序列。
其中，1≤M≤N，且M和N为整数。N为RNTI的长度。具体地，N的值可以由通信系统定义。例如，在LTE和NR中，RNTI的长度为16，也即N＝16。
每个第一比特序列为一个随机序列。第一比特序列由0和1组成。以下，将第一比特序列记作S。
320、对该多个第一比特序列进行线性编码，得到多个第二比特序列。
这里，对第一比特序列进行线性编码时，采用的编码方式不限于采用卷积码、Turbo码、低密度奇偶校验(low density parity check code,LDPC)、循环冗余校验(cyclic redundancy check,CRC)码、里德米勒(Reed-Muller,RM)码和循环码等编码方式。
具体地，对第一比特序列进行线性编码的过程可以用公式(2)表示：
RNTI＝S·G         (2)
其中，G为大小为M×N的编码矩阵，线性编码的运算在二进制域GF(2)内进行。
应理解，第一比特序列S是一个由M个比特生成的随机序列，因此，遍历第一比特序列S所有的可能，将会有2 M个种可能，也即，步骤310中，生成2 M个第一比特序列。每个第一比特序列S与编码矩阵G进行线性编码，将得到一个长度为N的第二比特序列。因此，2 M个第一比特序列分别通过编码矩阵G进行线性编码，将得到2 M个第二比特序列。该2 M个第二比特序列与该2 M个第一比特序列一一对应，每个第二比特序列是对应的第一 比特序列经过线性编码得到的。每个第二比特序列即是一个RNTI，因此得到2 M个RNTI。
330、输出备选RNTI集合。
将步骤320中生成的2 M个第二比特序列输出，即是备选RNTI集合。
这里的备选RNTI集合是指可以作为配置RNTI的一个备选集合。换句话说，在需要配置RNTI的场景下，可以从该备选RNTI集合中选取多个RNTI。
可选地，作为一种实现方式，在对第一比特序列进行线性编码得到第二比特序列之后，还可以包括步骤340。
340、对该多个第二比特序列中的每个第二比特序列进行比特交织，将交织后得到的多个比特序列作为该备选RNTI集合。
在对第二比特序列进行交织的情况下，每一个第二比特序列交织后得到的比特序列为一个RNTI。
作为一个示例，下面以采用CRC码对第一比特序列进行线性编码，来说明生成备选RNTI集合的过程。
首先，假设N＝16。选取M＝8，并选取多项式g_8(x)。
根据CRC码的基本原理，其信息字段和校验字段的长度可以任意选定。例如，在M位信息码后拼接R位的校验码，得到长度为N的CRC码。对于一个给定的(N，M)码，可以证明存在一个最高次幂为N-K＝R的多项式g(x)。根据g(x)可以生成K位信息码的CRC校验码，而g(x)叫做这个CRC码的生成多项式。生成多项式可以由发射端和接收端约定。例如，g(x)＝x 8+x 2+1，或者，g(x)＝x 8+x 5+x 4+1。
这里，对于8比特的第一比特序列S，利用g_8(x)可以计算得到第一比特序列S的8比特的CRC校验码。g_8(x)表示CRC长度为8对应的多项式。将这8比特的CRC校验码与第一比特序列S的8比特级联，得到16比特的序列。这各16比特的序列即可以作为RNTI。
可选地，上述8比特的CRC校验码与第一比特序列S的8比特进行级联，得到16比特之后，还可以对这16比特进行交织，再将交织后的序列作为RNTI。
同样地，遍历第一比特序列的所有可能，将会有2 8种可能。这2 8种可能的第一比特序列分别按照上述方法计算得到对应的CRC校验码。每个CRC校验码和对应的第一比特序列进行级联，得到一个第二比特序列。总共将得到2 8个第二比特序列。这2 8个第二比特序列可以作为备选RNTI集合。
方法300的上述步骤310-340是发射端配置RNTI的过程，图15中为了便于说明而分为几个步骤说明。具体实现时，步骤310-340也可以合并为一个步骤，用于生成备选RNTI集合。
可选地，方法300还可以包括步骤350-380中的一个或多个步骤。
350、发射端向接收端发送配置信息，接收端从发射端接收该配置信息。
其中，该配置信息用于指示该多个备选RNTI集合中的L个RNTI。由于发射端通常为接收端配置多个RNTI，因此，L≥2且为整数。当然，L的取值可以是通信系统定义的，或者，也可以是发射端根据需要确定的。该L个RNTI可以从该备选RNTI集合中任意选取。
同理，作为代替性的方案，可以在发射端和接收端存储具有上述特点的RNTI集合备 用，而无需发射端生成并向接收端发送RNTI集合。
360、发射端使用该L个RNTI中的一个RNTI对待发送的比特序列进行加掩，得到加掩后的比特序列。
370、发射端向接收端发送该加掩后的比特序列。
380、接收端使用该L个RNTI对待解掩的比特序列进行解掩。
接收端在进行RNTI解掩时，使用该L个RNTI一一进行尝试。其中，RNTI加掩和RNTI解掩的过程与方法200相同，不再赘述。
与方法200可以降低RNTI虚警的原理不同，方法300主要是利用线性编码来扩大RNTI之间的汉明距离，起到降低RNTI虚警的作用。方法300可以应用在一些不使用polar编码的通信系统中，适用范围更广。
应理解，根据上述方法300生成的备选RNTI集合中的RNTI可以降低由于RNTI冲突导致的较高的虚警概率。
以上对本申请提供的配置RNTI的方法进行了说明。下面说明本申请提供的通信装置。
参见图16，图16是本申请提供的通信装置500的示意性框图。如图16所示，通信装置500包括处理单元510和通信单元520。
处理单元510，用于生成多个RNTI，所述多个RNTI中的每个RNTI包括L个比特，所述L个比特对应极化码的生成矩阵的N个行中的L个行，所述N个行中的每个行具有一个汉明重量，其中，所述多个RNTI具有相同的I个比特，所述I个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述I个比特对应所述L个行中具有第一汉明重量的M个行中的I个行，所述第一汉明重量为所述L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数。
通信单元520，用于发送配置信息，配置信息用于向接收端指示处理单元510生成的该多个RNTI。
装置500和方法200中的发射端完全对应，装置500的相应单元分别用于执行方法200或其各实施例中由发射端执行的相应步骤和/或流程。其中，处理单元510用于执行方法200或其各实施例中由发射端的内部实现的步骤。例如，处理单元510执行图14中的步骤210、步骤230或步骤240。装置500中的通信单元520执行方法200或其各实施例中发送或接收的步骤。例如，执行图14中向接收端发送配置信息的步骤220、步骤250。
这里，处理单元510可以是处理器。通信单元520可以收发器。收发器包括接收器和发射器，同时具有接收和发射的功能。
可选地，处理单元510可以是一个处理装置，处理装置的上述功能可以部分或全部通过软件实现。当全部通过软件实现时，处理装置可以包括存储器和处理器，其中，存储器用于存储计算机程序，处理器从存储器中读取并运行该计算机程序，以执行方法200或其各实施例中由发射端执行的相应操作和/或流程。
在一个可能的设计中，处理装置的部分或全部通过软件实现时，处理装置包括处理器。用于存储计算机程序的存储器位于处理装置之外，处理器通过电路/电线与存储器连接，用于读取并执行该存储器中存储的计算机程序。
在一个可能的设计中，处理装置的上述功能的部分或全部通过硬件实现时，处理装置包括逻辑电路。逻辑电路具有实现方法实施例中配置多个RNTI的功能；输出接口电路， 用于输出处理装置配置的所述多个RNTI。
在一种可能的设计中，处理装置还包括输入接口电路，用于获取极化码的生成矩阵的N个行中的L个行的汉明重量和/或与该L个行对应的极化信道的可靠度参数；逻辑电路，具体用于根据该L个行的汉明重量和/或该L个行对应的极化信道的可靠度参数，配置所述多个RNTI。
在具体实现时，该处理装置可以为芯片或集成电路。
作为一种实现方式，处理单元510可以为处理器，通信单元520可以为收发器。收发器包括接收器和发射器，同时具有接收和发射的功能。
参见图17，图17是本申请提供的通信装置600的示意性框图。如图17所示，通信装置600包括通信单元610和处理单元620。
通信单元610，用于从发射端接收配置信息，该配置信息用于指示多个RNTI，所述多个RNTI中的每个RNTI包括L个比特，所述L个比特对应极化码的生成矩阵的N个行中的L个行，所述N个行中的每个行具有一个汉明重量，其中，所述多个RNTI具有相同的I个比特，所述I个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述I个比特对应所述L个行中具有第一汉明重量的M个行中的I个行，所述第一汉明重量为所述L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数。
处理单元620，用于根据通信单元610接收到的配置信息指示的多个RNTI，对多个候选译码路径进行解掩。
装置600和方法200中的接收端完全对应，装置600的相应单元分别用于执行方法200或其各实施例中由接收端执行的相应步骤和/或流程。其中，处理单元620用于执行方法200或其各实施例中由接收端内部实现的步骤。例如，处理单元620执行图14中的步骤260、步骤270。装置600中的通信单元610用于执行方法200或其各实施例中发送或接收的步骤。例如，执行图14中从发射端接收配置信息的步骤220，或者执行从发射端接收待译码序列的步骤。
可选地，处理单元620可以是一个处理装置，处理装置的上述功能可以部分或全部通过软件实现。当全部通过软件实现时，处理装置可以包括存储器和处理器，其中，存储器用于存储计算机程序，处理器从存储器中读取并运行该计算机程序，以实现对多个候选译码路径进行解掩。
在一个可能的设计中，处理装置的部分或全部通过软件实现时，处理装置包括处理器。用于存储计算机程序的存储器位于处理装置之外，处理器通过电路/电线与存储器连接，用于读取并执行该存储器中存储的计算机程序。
在一个可能的设计中，处理装置的上述功能的部分或全部通过硬件实现时，处理装置包括：输入接口电路，用于获取待译码序列；逻辑电路，用于对待译码序列进行译码，得到多个候选译码路径；逻辑电路还用于使用配置信息指示的多个RNTI对该多个候选译码路径进行解掩尝试，并对解掩之后的比特序列进行CRC；输出接口电路，用于输出解掩之后通过CRC的候选译码路径作为译码路径。
在具体实现时，该处理装置可以为芯片或集成电路。
作为一种实现方式，通信单元610可以为收发器，处理单元620可以为处理器。
参见图18，图18是本申请提供的通信装置700的示意性框图。如图18所示，通信 装置700包括处理单元710和通信单元720。
处理单元710，用于根据需要配置的无线网络临时标识RNTI的长度N，选取M个比特生成多个第一比特序列，M≤N，且为整数；对该多个第一比特序列中的每个第一比特序列进行线性编码，得到多个第二比特序列，该多个第二比特序列与该多个第一比特序列一一对应；
通信单元720，用于发送配置信息，该配置信息用于指示该多个第二比特序列中的L个第二比特序列，L≥2且为整数。
装置700和方法300中的发射端完全对应，装置700的相应单元分别用于执行方法300或其各实施例中由发射端执行的相应步骤和/或流程。其中，处理单元710用于执行方法300或其各实施例中由发射端的内部实现的步骤。例如，处理单元710执行步骤310，步骤320，步骤340等。通信单元720用于执行方法300中发送和接收的步骤。例如，执行向接收端发送配置信息的步骤350、向接收端发送加掩后的比特序列的步骤370。
这里，处理单元710可以是处理器。通信单元720可以收发器。收发器包括接收器和发射器，同时具有接收和发射的功能。
可选地，处理单元710可以是一个处理装置，处理装置的上述功能可以部分或全部通过软件实现。当全部通过软件实现时，处理装置可以包括存储器和处理器，其中，存储器用于存储计算机程序，处理器从存储器中读取并运行该计算机程序，以执行方法300或其各实施例中由发射端执行的相应操作和/或流程。
在一个可能的设计中，处理装置的部分或全部通过软件实现时，处理装置包括处理器。用于存储计算机程序的存储器位于处理装置之外，处理器通过电路/电线与存储器连接，用于读取并执行该存储器中存储的计算机程序。
在一个可能的设计中，处理装置的上述功能的部分或全部通过硬件实现时，处理装置包括逻辑电路。逻辑电路具有实现方法300中配置多个RNTI的功能；输出接口电路，用于输出所述多个RNTI。
在具体实现时，该处理装置可以为芯片或集成电路。
参见图19，图19是本申请提供的通信装置800的示意性框图。如图19所示，通信装置800包括通信单元810和处理单元820。
通信单元810，用于从发射端接收配置信息，该配置信息用于指示L个第二比特序列，L≥2且为整数；
处理单元820，用于根据通信单元810接收到的配置信息指示的多个RNTI，对待解掩的比特序列进行解掩尝试。
装置800和方法300中的接收端完全对应，装置800的相应单元分别用于执行方法300或其各实施例中由接收端执行的相应步骤和/或流程。其中，处理单元820用于执行方法300或其各实施例中由接收端内部实现的步骤。例如，处理单元820执行RNTI解掩的步骤380。装置800中的通信单元810用于执行方法300或其各实施例中发送或接收的步骤。例如，执行从发射端接收配置信息的步骤350、从发射端接收加掩后的比特序列的步骤370等。
可选地，处理单元820可以是一个处理装置，处理装置的上述功能可以部分或全部通过软件实现。当全部通过软件实现时，处理装置可以包括存储器和处理器，其中，存储器 用于存储计算机程序，处理器从存储器中读取并运行该计算机程序，以执行方法300中由接收端执行的相应操作和/或流程。
在一个可能的设计中，处理装置的部分或全部通过软件实现时，处理装置包括处理器。用于存储计算机程序的存储器位于处理装置之外，处理器通过电路/电线与存储器连接，用于读取并执行该存储器中存储的计算机程序。
在一个可能的设计中，处理装置的上述功能的部分或全部通过硬件实现时，处理装置包括：输入接口电路，用于获取待解掩的比特序列；逻辑电路，用于使用配置信息指示的L个第二比特序列对待解掩的比特序列进行解掩，得到解掩后的比特序列；输出接口电路，用于输出解掩之后的比特序列。
后续，解掩之后的比特序列可以输入CRC校验单元进行CRC校验，与方法200相同，这里不再赘述。
在具体实现时，该处理装置可以为芯片或集成电路。
在图1所示的无线通信系统中，在下行传输时，网络设备为发射端，终端设备为接收端。在上行传输时，终端设备为发射端，网络设备为接收端。这里所述的发射端可以是方法200中所述的发射端，或者，也可以是方法300中的发射端。接收端可以是方法200中的接收端，或者，也可以是方法300中的接收端。
下面以下行传输(发射端为网络设备，接收端为终端设备)为例，说明本申请提供的网络设备和终端设备。
参见图20，图20是本申请提供的网络设备3000的示意性结构图。如图20所示，网络设备3000可以应用于上述图1所示的无线通信系统中，具有本申请的方法实施例中描述的发射端(例如，可以是基站)的功能。
网络设备3000可以包括一个或多个射频单元，如远端射频单元(remote radio unit，RRU)3100和一个或多个基带单元(baseband unit，BBU)。基带单元也可以称为数字单元(digital unit，DU)3200。所述RRU 3100可以称为收发单元，与图9中的通信单元620对应。可选地，该收发单元3100还可以称为收发机、收发电路、或者收发器等等，其可以包括至少一个天线3101和射频单元3102。可选地，收发单元3100可以包括接收单元和发送单元，接收单元可以对应于接收器(或称接收机、接收电路)，发送单元可以对应于发射器(或称发射机、发射电路)。所述RRU 3100部分主要用于射频信号的收发以及射频信号与基带信号的转换，例如，用于向终端设备发送第一随机接入资源的配置信息。所述BBU 3200部分主要用于进行基带处理，对基站进行控制等。所述RRU 3100与BBU3200可以是物理上设置在一起，也可以物理上分离设置的，即分布式基站。
所述BBU 3200为网络设备3000的控制中心，也可以称为处理单元，主要用于完成基带处理功能，如信道编码，复用，调制，扩频等。例如所述BBU(处理单元)配置所述多个RNTI。例如，可以与图16中的处理单元510对应。或者，与图18中的处理单元710对应。
在一个示例中，所述BBU 3200可以由一个或多个单板构成，多个单板可以共同支持单一接入制式的无线接入网(例如，LTE网)，也可以分别支持不同接入制式的无线接入网(例如，LTE网、5G网或其它网)。所述BBU 3200还包括存储器3201和处理器3202。所述存储器3201用以存储必要的指令和数据。所述处理器3202用于控制网络设备3000 进行必要的动作，例如，用于控制网络设备3000执行上述方法实施例中由网络设备执行的操作流程。所述存储器3201和处理器3202可以服务于一个或多个单板。也就是说，可以每个单板上单独设置存储器和处理器。也可以是多个单板共用相同的存储器和处理器。此外每个单板上还可以设置有必要的电路。
应理解，图20所示的网络设备3000能够实现图1至图15的方法实施例中涉及网络设备的各个过程。网络设备3000中的各个单元的操作和/或功能，分别为了实现方法实施例中的相应流程。为避免重复，此处适当省略详述描述。
上述BBU 3200可以用于执行前面方法实施例中描述的由网络设备内部实现的动作，例如，在方法200中，执行配置多个RNTI的步骤210、对第一比特序列添加CRC校验序列的步骤230、对第二比特序列进行RNTI加掩的步骤240等。在方法300中，执行生成多个第一比特序列的步骤310，对该多个第一比特序列进行线性编码生成多个第二比特序列的步骤320，对第二比特序列进行比特交织的步骤340等。而RRU 3100可以用于执行前面方法实施例中描述的发送或接收的动作。例如，执行图14的方法200中向终端设备发送配置信息的步骤220，或者执行向终端设备发送第三比特序列的步骤250。又例如，执行方法300中向接收端发送配置信息的步骤350、向接收端发送加掩后的比特序列的步骤370等。
参见图21，图21是本申请提供的终端设备900的示意性结构图。如图21所示，终端设备900包括：一个或多个处理器901，一个或多个存储器902，一个或多个收发器903。处理器901用于控制收发器903收发信号，存储器902用于存储计算机程序，处理器901用于从存储器902中调用并运行该计算机程序，以执行本申请提供的配置RNTI的方法200或其各实施例中由接收端执行的相应流程和/或操作。或者，执行方法300及其各实施例中由接收端执行的相应流程和/或操作。
例如，终端设备900可以是图1所示的无线通信系统中的终端设备102或103。
本申请实施例中所述的芯片，可以是现场可编程门阵列(field-programmable gate array，FPGA)、专用集成芯片(application specific integrated circuit，ASIC)、系统芯片(system on chip，SoC)、中央处理器(central processor unit，CPU)、网络处理器(network processor，NP)、数字信号处理电路(digital signal processor，DSP)，还可以是微控制器(micro controller unit，MCU、可编程控制器(programmable logic device，PLD)或其它集成芯片。
本申请实施例中的处理器可以是一种集成电路芯片，具有信号的处理能力。在实现过程中，上述方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器可以是通用处理器、数字信号处理器(digital signal processor，DSP)、专用集成电路(application specific integrated circuit，ASIC)、FPGA或其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。本申请实施例公开的方法200或方法300中配置RNTI的步骤(例如，方法200中的步骤210，方法300中的步骤310-340)也可以由硬件处理器执行完成，或者由处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。
本申请实施例中的存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(read-only memory，ROM)、可编程只读存储器(programmable ROM，PROM)、可擦除可编程只读存储器(erasable PROM，EPROM)、电可擦除可编程只读存储器(electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(random access memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(static RAM，SRAM)、动态随机存取存储器(dynamic RAM，DRAM)、同步动态随机存取存储器(synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(direct rambus RAM，DR RAM)。应注意，本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
可选的，上述的存储器与存储器可以是物理上相互独立的单元，或者，存储器也可以和处理器集成在一起。
此外，本申请还提供一种计算机可读存储介质，该计算机可读存储介质中存储有计算机指令，当该计算机指令在计算机上运行时，使得计算机执行方法200中由发射端执行的相应操作和/或流程。
本申请还提供一种计算机程序产品，该计算机程序产品包括计算机程序代码，当该计算机程序代码在计算机上运行时，使得计算机执行方法200或方法300中由发射端执行的相应操作和/或流程。
本申请还提供一种芯片，包括存储器和处理器，存储器用于存储计算机程序，处理器用于从存储器中调用并运行该计算机程序，以执行方法200或方法300中由发射端执行的相应操作和/或流程。
此外，本申请提供一种计算机可读存储介质，该计算机可读存储介质中存储有计算机指令，当该计算机指令在计算机上运行时，使得计算机执行方法200或方法300中由接收端执行的相应操作和/或流程。
本申请还提供一种计算机程序产品，该计算机程序产品包括计算机程序代码，当该计算机程序代码在计算机上运行时，使得计算机执行方法200或方法300中由接收端执行的相应操作和/或流程。
本申请还提供一种芯片(或者，芯片系统)，包括存储器和处理器，存储器用于存储计算机程序，处理器用于从存储器中调用并运行该计算机程序，以执行本申请实施例的方法200或方法300中由接收端执行的相应操作和/或流程。
本申请还提供一种通信系统，包括方法200中的发射端和接收端，或者方法300中的发射端和接收端。
在本说明书中使用的术语“部件”、“模块”、“系统”等用于表示计算机相关的实体、硬件、固件、硬件和软件的组合、软件或执行中的软件。例如，部件可以是但不限于，在处理器上运行的进程、处理器、对象、可执行文件、执行线程、程序和/或计算机。通过图示，在计算设备上运行的应用和计算设备都可以是部件。一个或多个部件可驻留在进程和/或执行线程中。部件可位于一个计算机上和/或分布在两个或更多个计算机之间。此外， 这些部件可从上面存储有各种数据结构的各种计算机可读介质执行。部件可根据具有一个或多个数据分组(例如，来自与本地系统、分布式系统和/或网络间的另一部件交互的二个部件的数据，例如，通过信号与其它系统交互的互联网)的信号通过本地和/或远程进程来通信。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、或者计算机软件和电子硬件的结合来实现，具体取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，上述描述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例也仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本申请实施例的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (36)

  1. 一种配置无线网络临时标识RNTI的方法，其特征在于，包括：
    发射端配置多个无线网络临时标识RNTI，所述多个RNTI中的每个RNTI包括L个比特，所述L个比特对应极化码的生成矩阵的N个行中的L个行，所述N个行中的每个行具有一个汉明重量，其中，所述多个RNTI具有相同的I个比特，所述I个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述I个比特对应所述L个行中具有第一汉明重量的M个行中的I个行，所述第一汉明重量为所述L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数；
    所述发射端向接收端发送配置信息，所述配置信息用于指示所述多个RNTI。
  2. 根据权利要求1所述的方法，其特征在于，所述多个RNTI还具有J个相同的比特，所述J个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述J个比特对应所述L个行中具有第二汉明重量的P个行中的J个行，所述第二汉明重量大于所述第一汉明重量，且所述第二汉明重量小于所述L个行除了所述I个行和所述P个行之外的其余行的汉明重量，1≤J≤L，I+J<L，且J为整数。
  3. 根据权利要求1或2所述的方法，其特征在于，所述多个RNTI还具有R个相同的比特，所述R个相同的比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述R个比特对应所述L个行中具有第三汉明重量的Q个行中的R个行，所述第三汉明重量大于所述第二汉明重量，且所述第三汉明重量小于所述L个行中除了所述I个行、所述P个行和所述Q个行之外的其余行的汉明重量，1≤R≤L，I+J+R<L，R为整数。
  4. 根据权利要求1-3中任一项所述的方法，其特征在于，所述发射端配置多个RNTI，包括：
    所述发射端根据所述生成矩阵的所述L个行的汉明重量，配置所述多个RNTI；
    或者，
    所述发射端根据所述生成矩阵的所述L个行的可靠度参数，配置所述多个RNTI，其中，每个行的可靠度参数用于表征所述行对应的极化信道的可靠度；
    或者，
    所述发射端根据所述生成矩阵的所述L个行的汉明重量和所述L个行的可靠度参数，配置所述多个RNTI。
  5. 根据权利要求4所述的方法，其特征在于，所述发射端根据所述生成矩阵的所述L个行的汉明重量和所述L个行的可靠度参数，配置所述多个RNTI，包括：
    在所述L个行中至少两个行的汉明重量相同的情况下，根据所述至少两个行的可靠度参数，配置所述多个RNTI的与所述至少两个行对应的比特位置的比特，其中，所述多个RNTI的与所述至少两个行中具有较小可靠度的行对应的比特位置的比特配置为相同。
  6. 根据权利要求1-5中任一项所述的方法，其特征在于，所述方法还包括：
    所述发射端在需要发送给所述接收端的第一比特序列中添加循环冗余校验CRC比特，得到第二比特序列；
    所述发射端使用所述多个RNTI中的一个RNTI对所述第二比特序列加掩，得到第三 比特序列；
    所述发射端向所述接收端发送所述第三比特序列。
  7. 一种配置无线网络临时标识RNTI的方法，其特征在于，包括：
    接收端从发射端接收配置信息，所述配置信息用于指示多个RNTI，所述多个RNTI中的每个RNTI包括L个比特，所述L个比特对应极化码的生成矩阵的N个行中的L个行，所述N个行中的每个行具有一个汉明重量，其中，所述多个RNTI具有相同的I个比特，所述I个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述I个比特对应所述L个行中具有第一汉明重量的M个行中的I个行，所述第一汉明重量为所述L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数；
    所述接收端使用所述多个RNTI，对多个候选译码路径进行解掩。
  8. 根据权利要求7所述的方法，其特征在于，所述多个RNTI还具有J个相同的比特，所述J个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述J个比特对应所述L个行中具有第二汉明重量的P个行中的J个行，所述第二汉明重量大于所述第一汉明重量，且所述第二汉明重量小于所述L个行除了所述I个行和所述P个行之外的其余行的汉明重量，1≤J≤L，I+J<L，且J为整数。
  9. 根据权利要求7或8所述的方法，其特征在于，所述多个RNTI还具有R个相同的比特，所述R个相同的比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述R个比特对应所述L个行中具有第三汉明重量的Q个行中的R个行，所述第三汉明重量大于所述第二汉明重量，且所述第三汉明重量小于所述L个行中除了所述I个行、所述P个行和所述Q个行之外的其余行的汉明重量，1≤R≤L，I+J+R<L，R为整数。
  10. 根据权利要求7-9中任一项所述的方法，其特征在于，所述多个RNTI是所述发射端根据所述生成矩阵的所述L个行的汉明重量配置的；或者，
    所述多个RNTI是所述发射端根据所述生成矩阵的所述L个行的可靠度参数配置的，其中，每个行的可靠度参数用于表征所述行对应的极化信道的可靠度；或者，
    所述多个RNTI是所述发射端根据所述生成矩阵的所述L个行的汉明重量和可靠度参数配置的。
  11. 根据权利要求10所述的方法，其特征在于，在所述L个行中至少两个行的汉明重量相同的情况下，所述多个RNTI的与所述至少两个行中具有较小可靠度的行对应的比特位置的比特配置为相同。
  12. 根据权利要求7-11中任一项所述的方法，其特征在于，所述方法还包括：
    所述接收端从发射端接收待译码序列，并对所述待译码序列进行译码，得到所述多个候选译码路径；
    所述接收端输出使用所述多个RNTI中的任意一个RNTI解掩后通过循环冗余校验CRC的候选译码路径作为译码路径。
  13. 一种配置无线网络临时标识RNTI的装置，其特征在于，包括：
    处理单元，用于配置多个无线网络临时标识RNTI，所述多个RNTI中的每个RNTI包括L个比特，所述L个比特对应极化码的生成矩阵的N个行中的L个行，所述N个行中的每个行具有一个汉明重量，其中，所述多个RNTI具有相同的I个比特，所述I个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述I个比特对应所述L个 行中具有第一汉明重量的M个行中的I个行，所述第一汉明重量为所述L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数；
    通信单元，用于向接收端发送配置信息，所述配置信息用于指示所述多个RNTI。
  14. 根据权利要求13所述的装置，其特征在于，所述多个RNTI还具有J个相同的比特，所述J个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述J个比特对应所述L个行中具有第二汉明重量的P个行中的J个行，所述第二汉明重量大于所述第一汉明重量，且所述第二汉明重量小于所述L个行除了所述I个行和所述P个行之外的其余行的汉明重量，1≤J≤L，I+J<L，且J为整数。
  15. 根据权利要求13或14所述的装置，其特征在于，所述多个RNTI还具有R个相同的比特，所述R个相同的比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述R个比特对应所述L个行中具有第三汉明重量的Q个行中的R个行，所述第三汉明重量大于所述第二汉明重量，且所述第三汉明重量小于所述L个行中除了所述I个行、所述P个行和所述Q个行之外的其余行的汉明重量，1≤R≤L，I+J+R<L，R为整数。
  16. 根据权利要求13-15中任一项所述的装置，其特征在于，所述处理单元用于：
    根据所述生成矩阵的所述L个行的汉明重量，配置所述多个RNTI；或者，
    根据所述生成矩阵的所述L个行的可靠度参数，配置所述多个RNTI，其中，每个行的可靠度参数用于表征所述行对应的极化信道的可靠度；或者，
    根据所述生成矩阵的所述L个行的汉明重量和所述L个行的可靠度参数，配置所述多个RNTI。
  17. 根据权利要求16所述的装置，其特征在于，所述处理单元用于在所述L个行中至少两个行的汉明重量相同的情况下，根据所述至少两个行的可靠度参数，配置所述多个RNTI的与所述至少两个行对应的比特位置的比特，其中，所述多个RNTI的与所述至少两个行中具有较小可靠度的行对应的比特位置的比特配置为相同。
  18. 根据权利要求13-17中任一项所述的装置，其特征在于，所述处理单元还用于：
    在需要发送给所述接收端的第一比特序列中添加循环冗余校验CRC比特，得到第二比特序列；
    使用所述多个RNTI中的第一RNTI对所述第二比特序列加掩，得到第三比特序列，所述第一RNTI为所述多个RNTI中的任意一个RNTI；
    以及，所述通信单元用于向所述接收端发送所述第三比特序列。
  19. 一种配置无线网络临时标识RNTI的装置，其特征在于，包括：
    通信单元，用于从发射端接收配置信息，所述配置信息用于指示多个RNTI，所述多个RNTI中的每个RNTI包括L个比特，所述L个比特对应极化码的生成矩阵的N个行中的L个行，所述N个行中的每个行具有一个汉明重量，其中，所述多个RNTI具有相同的I个比特，所述I个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述I个比特对应所述L个行中具有第一汉明重量的M个行中的I个行，所述第一汉明重量为所述L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数；
    处理单元，用于使用所述多个RNTI，对多个候选译码路径进行解掩。
  20. 根据权利要求19所述的装置，其特征在于，所述多个RNTI还具有J个相同的比特，所述J个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述J个比 特对应所述L个行中具有第二汉明重量的P个行中的J个行，所述第二汉明重量大于所述第一汉明重量，且所述第二汉明重量小于所述L个行除了所述I个行和所述P个行之外的其余行的汉明重量，1≤J≤L，I+J<L，且J为整数。
  21. 根据权利要求19或20所述的装置，其特征在于，所述多个RNTI还具有R个相同的比特，所述R个相同的比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述R个比特对应所述L个行中具有第三汉明重量的Q个行中的R个行，所述第三汉明重量大于所述第二汉明重量，且所述第三汉明重量小于所述L个行中除了所述I个行、所述P个行和所述Q个行之外的其余行的汉明重量，1≤R≤L，I+J+R<L，R为整数。
  22. 根据权利要求19-21中任一项所述的装置，其特征在于，所述多个RNTI是所述发射端根据所述生成矩阵的所述L个行的汉明重量配置的；或者，
    所述多个RNTI是所述发射端根据所述生成矩阵的所述L个行的可靠度参数配置的，其中，每个行的可靠度参数用于表征所述行对应的极化信道的可靠度；或者，
    所述多个RNTI是所述发射端根据所述生成矩阵的所述L个行的汉明重量和可靠度参数配置的。
  23. 根据权利要求22所述的装置，其特征在于，在所述L个行中至少两个行的汉明重量相同的情况下，所述多个RNTI的与所述至少两个行中具有较小可靠度的行对应的比特位置的比特配置为相同。
  24. 根据权利要求19-23中任一项所述的装置，其特征在于，所述处理单元用于：
    从发射端接收待译码序列，并对所述待译码序列进行译码，得到所述多个候选译码路径；
    输出使用所述多个RNTI中的任意一个RNTI解掩后通过循环冗余校验CRC的候选译码路径作为译码路径。
  25. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质中存储有指令，当所述指令在计算机上运行时，如权利要求1-12中任一项所述的方法被执行。
  26. 一种芯片，其特征在于，包括：
    存储器，用于存储计算机程序；
    处理器，用于执行所述存储器中存储的所述计算机程序，当所述计算机程序被执行时，如权利要求1-12中任一项所述的方法被执行。
  27. 一种通信设备，其特征在于，包括：
    处理器，用于配置多个无线网络临时标识RNTI，所述多个RNTI中的每个RNTI包括L个比特，所述L个比特对应极化码的生成矩阵的N个行中的L个行，所述N个行中的每个行具有一个汉明重量，其中，所述多个RNTI具有相同的I个比特，所述I个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述I个比特对应所述L个行中具有第一汉明重量的M个行中的I个行，所述第一汉明重量为所述L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数；
    收发器，用于向接收端发送配置信息，所述配置信息用于指示所述处理器配置的所述多个RNTI。
  28. 一种通信设备，其特征在于，包括：
    收发器，用于从发射端接收配置信息，所述配置信息用于指示多个RNTI，所述多个 RNTI中的每个RNTI包括L个比特，所述L个比特对应极化码的生成矩阵的N个行中的L个行，所述N个行中的每个行具有一个汉明重量，其中，所述多个RNTI具有相同的I个比特，所述I个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述I个比特对应所述L个行中具有第一汉明重量的M个行中的I个行，所述第一汉明重量为所述L个行的汉明重量中的最小值，1≤I≤M≤L≤N，且N、L、I和M为整数；
    处理器，用于使用所述收发器接收到的所述配置信息指示的所述多个RNTI，对多个候选译码路径进行解掩。
  29. 根据权利要求27或28所述的通信设备，其特征在于，所述多个RNTI还具有J个相同的比特，所述J个比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述J个比特对应所述L个行中具有第二汉明重量的P个行中的J个行，所述第二汉明重量大于所述第一汉明重量，且所述第二汉明重量小于所述L个行除了所述I个行和所述P个行之外的其余行的汉明重量，1≤J≤L，I+J<L，且J为整数。
  30. 根据权利要求27-29中任一项所述的通信设备，其特征在于，所述多个RNTI还具有R个相同的比特，所述R个相同的比特在所述多个RNTI中的每个RNTI中对应相同的比特位置，所述R个比特对应所述L个行中具有第三汉明重量的Q个行中的R个行，所述第三汉明重量大于所述第二汉明重量，且所述第三汉明重量小于所述L个行中除了所述I个行、所述P个行和所述Q个行之外的其余行的汉明重量，1≤R≤L，I+J+R<L，R为整数。
  31. 根据权利要求27所述的通信设备，其特征在于，所述处理器具体用于：
    根据所述生成矩阵的所述L个行的汉明重量，配置所述多个RNTI；或者，
    根据所述生成矩阵的所述L个行的可靠度参数，配置所述多个RNTI，其中，每个行的可靠度参数用于表征所述行对应的极化信道的可靠度；或者，
    根据所述生成矩阵的所述L个行的汉明重量和所述L个行的可靠度参数，配置所述多个RNTI。
  32. 根据权利要求31所述的通信设备，其特征在于，所述处理器具体用于：
    在所述L个行中至少两个行的汉明重量相同的情况下，根据所述至少两个行的可靠度参数，配置所述多个RNTI的与所述至少两个行对应的比特位置的比特，其中，所述多个RNTI的与所述至少两个行中具有较小可靠度的行对应的比特位置的比特配置为相同。
  33. 根据权利要求27,31-32中任一项所述的通信设备，其特征在于，所述处理器用于：
    在需要发送给所述接收端的第一比特序列中添加循环冗余校验CRC比特，得到第二比特序列；
    使用所述多个RNTI中的一个RNTI对所述第二比特序列加掩，得到第三比特序列；
    所述收发器，还用于向所述接收端发送所述第三比特序列。
  34. 根据权利要求28所述的通信设备，其特征在于，所述多个RNTI是所述发射端根据所述生成矩阵的所述L个行的汉明重量配置的；或者，
    所述多个RNTI是所述发射端根据所述生成矩阵的所述L个行的可靠度参数配置的，其中，每个行的可靠度参数用于表征所述行对应的极化信道的可靠度；或者，
    所述多个RNTI是所述发射端根据所述生成矩阵的所述L个行的汉明重量和可靠度参 数配置的。
  35. 根据权利要求34所述的通信设备，其特征在于，在所述L个行中至少两个行的汉明重量相同的情况下，所述多个RNTI的与所述至少两个行中具有较小可靠度的行对应的比特位置的比特配置为相同。
  36. 根据权利要求28,34-35中任一项所述的通信设备，其特征在于，所述收发器还用于从发射端接收待译码序列；
    所述处理器，还用于对所述待译码序列进行译码，得到所述多个候选译码路径；
    所述处理器，还用于输出使用所述多个RNTI中的任意一个RNTI解掩后通过循环冗余校验CRC的候选译码路径作为译码路径。
PCT/CN2019/104807 2018-09-07 2019-09-06 配置无线网络临时标识rnti的方法和装置 WO2020048542A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811044422.3A CN110890949B (zh) 2018-09-07 2018-09-07 配置无线网络临时标识rnti的方法和装置
CN201811044422.3 2018-09-07

Publications (1)

Publication Number Publication Date
WO2020048542A1 true WO2020048542A1 (zh) 2020-03-12

Family

ID=69723000

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/104807 WO2020048542A1 (zh) 2018-09-07 2019-09-06 配置无线网络临时标识rnti的方法和装置

Country Status (2)

Country Link
CN (1) CN110890949B (zh)
WO (1) WO2020048542A1 (zh)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170289869A1 (en) * 2016-03-29 2017-10-05 Sharp Laboratories Of America, Inc. User equipments, base stations and methods
CN107342774A (zh) * 2017-04-25 2017-11-10 华为技术有限公司 编码方法、译码方法、装置和设备
CN107370564A (zh) * 2016-05-13 2017-11-21 中兴通讯股份有限公司 极化码处理方法及装置、节点

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102056198B (zh) * 2009-10-31 2015-06-03 华为技术有限公司 一种下行信道传输及检测方法、装置和系统
WO2012044088A2 (ko) * 2010-09-29 2012-04-05 엘지전자 주식회사 다중 안테나 지원 무선 통신 시스템에서 효율적인 피드백 방법 및 장치
CN107359967B (zh) * 2017-07-17 2020-04-17 北京航空航天大学 一种基于极化码的降低pdcch盲检次数的盲检方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170289869A1 (en) * 2016-03-29 2017-10-05 Sharp Laboratories Of America, Inc. User equipments, base stations and methods
CN107370564A (zh) * 2016-05-13 2017-11-21 中兴通讯股份有限公司 极化码处理方法及装置、节点
CN107342774A (zh) * 2017-04-25 2017-11-10 华为技术有限公司 编码方法、译码方法、装置和设备

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
SEQUANS COMMUNICATIONS: "Enhancements for Polar code construction", 3GPP TSG-RAN WG1 #89 R1-1707221, 19 May 2017 (2017-05-19), XP051261722 *

Also Published As

Publication number Publication date
CN110890949B (zh) 2021-06-01
CN110890949A (zh) 2020-03-17

Similar Documents

Publication Publication Date Title
US10966118B2 (en) Channel encoding method and communication device
US10917112B2 (en) Apparatus and methods for error detection coding
EP3573244B1 (en) Polar code encoding method and device
US11025278B2 (en) Polar coding encoding/decoding method and apparatus
CN109039344B (zh) 编码输入数据为极性码的方法及设备、解码方法及其设备
EP3614589B1 (en) Information transmission method, decoding method and device
US11239945B2 (en) Encoding method, decoding method, apparatus, and device
CN108282259B (zh) 一种编码方法及装置
KR102662470B1 (ko) 조기 종료를 위해 극성 코드에서 분산 crc를 인터리빙하는 시스템 및 방법
CN110663189B (zh) 用于极化编码的方法和装置
WO2020048537A1 (zh) 级联编码的方法和装置
US11601176B2 (en) Channel state information encoding method and apparatus, storage medium and processor
CN111200442A (zh) 编译码方法、编码译码装置以及系统
WO2020147526A1 (zh) 一种级联crc码的极化码编码方法及装置
US11637569B2 (en) Apparatus and method for polar coding and decoding for channels associated with complementary index sets
CN112106302B (zh) 降低复杂度的极化编码和解码
WO2018098691A1 (zh) 一种控制信道生成方法、控制信道检测方法及相关设备
US10581464B2 (en) Encoder device, decoder device, and methods thereof
TWI791023B (zh) 編碼輸入資料為極性碼的方法及設備、解碼方法及用以解碼碼字的設備
WO2020048542A1 (zh) 配置无线网络临时标识rnti的方法和装置
JPWO2019096271A5 (zh)

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19857012

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19857012

Country of ref document: EP

Kind code of ref document: A1