CN111200442A

CN111200442A - Coding and decoding method, coding and decoding device and system

Info

Publication number: CN111200442A
Application number: CN201811380009.4A
Authority: CN
Inventors: 颜冯尧
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2018-11-20
Filing date: 2018-11-20
Publication date: 2020-05-26

Abstract

The application discloses a coding and decoding method. The method comprises the following steps: firstly, a sending end acquires a first bit sequence; secondly, the sending end carries out sequence transformation on the first bit sequence to obtain a second bit sequence; thirdly, the sending end scrambles the second bit sequence by using the radio network temporary identifier RNTI to obtain a third bit sequence; then, the sending end carries out polarized Polar coding on the third bit sequence to obtain a coded bit sequence; and finally, the transmitting end transmits the coded bit sequence. Correspondingly, the receiving end sequentially executes decoding, RNTI descrambling, deserialization and CRC check processes, and finally outputs a decoded bit sequence. The coding and decoding method can rapidly and accurately recover the correct bit sequence, so that the false alarm probability of the RNTI during decoding is reduced, the decoding accuracy is improved, and the decoding performance is greatly improved.

Description

Coding and decoding method, coding and decoding device and system

Technical Field

The present application relates to the field of wireless communications, and in particular, to a coding and decoding method, a coding and decoding apparatus, and a system.

Background

In a wireless communication system, when a transmitting end transmits a bit sequence to a receiving end, the transmitting end may add a number of (e.g., 24) check bits in an information bit sequence in order to check the correctness of the received bit sequence at the receiving end. Further, the sending end may scramble the last bits (for example, the last 16 bits) of the check bits by using a Radio Network Temporary Identity (RNTI), which is called as RNTI scrambling. And then, the bit sequence scrambled by the RNTI is sent to a receiving end after the processing of channel coding, rate matching, modulation and the like. The receiving end inputs the received data to a decoder for decoding after demodulating, de-rate matching and the like, and outputs a plurality of candidate decoding paths. Since the transmitting end uses the RNTI for scrambling, the receiving end needs to use the same RNTI for descrambling. Generally, a system configures a plurality of RNTIs for a receiving end, and the RNTI used by the transmitting end for scrambling a bit sequence is one of the plurality of RNTIs, but the receiving end does not know which one of the plurality of RNTIs is specifically used by the transmitting end, so that it is necessary to perform descrambling attempts on a plurality of output candidate decoding paths one by using the plurality of RNTIs. Theoretically, only when the RNTI used by the receiving end for descrambling is the same as the RNTI used by the transmitting end for scrambling, the bit sequence after descrambling can pass through Cyclic Redundancy Check (CRC). Finally, the receiving end outputs the candidate decoding path which passes through the CRC check after the interference is removed through the RNTI as a decoding path.

In a New generation wireless communication system (NR), a polar coding method is used for channel coding, and a Serial Cancellation List (SCL) decoding algorithm is used for decoding at a receiving end. However, the current SCL decoding method has a high False Alarm Rate (FAR) and a high error rate, which leads to a decrease in decoding performance of the receiving end. For example, the information bit sequence is decoded correctly, but all candidate decoding paths descrambled by a plurality of RNTIs pass the CRC check. For another example, although the information bit sequence is decoded correctly, the RNTI corresponding to the path finally passing the CRC check is not the RNTI used when the transmitting end scrambles, which may cause a decoding error and degrade the decoding performance.

Disclosure of Invention

The application provides a coding and decoding method, device and system, which can rapidly and accurately recover a correct bit sequence, further reduce the false alarm probability during decoding, improve the accuracy of decoding, and greatly improve the decoding performance.

In a first aspect, the present application provides an encoding method, including:

a sending end obtains a first bit sequence, wherein the first bit sequence comprises: k information bits and X Cyclic Redundancy Check (CRC) bits, wherein K and X are positive integers; the sending terminal carries out sequence transformation on the first bit sequence to obtain a second bit sequence; the sending end scrambles the second bit sequence by using a Radio Network Temporary Identifier (RNTI) to obtain a third bit sequence; the sending end carries out polarized Polar coding on the third bit sequence to obtain a coded bit sequence; and the sending end sends the coded bit sequence.

In the technical scheme of the application, a sending end performs sequence transformation and RNTI scrambling on a received bit sequence. The receiving end carries out corresponding sequence change and descrambling on the sequence to be decoded, so that the receiving end can rapidly and accurately recover the correct bit sequence, the false alarm probability during decoding is further reduced, the decoding accuracy is improved, and the decoding performance is greatly improved.

With reference to the first aspect, in some implementation manners of the first aspect, the performing, by the sending end, sequence transformation on the first bit sequence to obtain a second bit sequence specifically includes:

and the sending end encrypts the first bit sequence to obtain a second bit sequence, wherein the bit value in the second bit sequence is different from the bit value in the first bit sequence.

Further, in the process of implementing sequence conversion by the above encryption manner, when decoding, the probability that the bit value in the second bit sequence is decoded incorrectly is lower than the probability that the bit value in the first bit sequence before encryption is decoded incorrectly; or, when decoding, the false alarm rate generated by decoding the bit value in the second bit sequence is lower than the false alarm rate generated by decoding the bit value in the first bit sequence before encryption; or the discrete rate of the bits in the second bit sequence is higher than the discrete rate of the bit values in the first bit sequence before encryption.

In the technical scheme of the application, the sending end changes the received bit sequence in an encryption mode, so that the error rate of decoding, namely the false alarm rate, can be reduced when the converted sequence is decoded again.

and the sending end encrypts the first bit sequence according to an asymmetric encryption formula to obtain a second bit sequence.

In addition to the scheme of sequence conversion to encryption, an asymmetric encryption scheme may be further employed to further encrypt the first bit sequence and further reduce the probability of false alarms during decoding.

With reference to the first aspect, in certain implementations of the first aspect, the asymmetric encryption formula is as follows:

M^E＝C(modP)，

m is the value of the last H bits of the first bit sequence, C is the value of the last H bits of the second bit sequence, H is an integer, P is a prime number, E is relatively prime with (P-1), mod is a modulo operation.

Further, in combination with the above implementation, in order to further reduce the false alarm probability or the error rate of decoding, the following condition may also be satisfied for E:

1<E<(P-1)，

and is

Delta. the_RNTIAnd the M, E, C, P and H are positive integers, wherein the values of the Radio Network Temporary Identifier (RNTI) are positive integers.

With reference to the first aspect, in some implementations of the first aspect, the encrypting the first bit sequence to obtain an encrypted second bit sequence specifically includes:

and the sending end encrypts the first bit sequence according to a symmetric encryption formula to obtain a second bit sequence.

Further, the symmetric encryption formula may include: DES encryption formula, AES encryption formula, SM4 encryption formula, and the like

the sending end encodes the first bit to obtain a second bit sequence, wherein a bit value in the second bit sequence is different from a bit value in the first bit sequence, and the encoding includes any one of the following: convolutional codes, Turbo codes, low density parity check, CRC, reed-muller RM, cyclic or Polar codes.

and the sending end interweaves the first bit sequence to obtain a second bit sequence after position change.

Further, the second bit sequence after the position change specifically includes: the position of each bit in the second bit sequence is different from the position of each bit in the first bit sequence.

With reference to the first aspect, in certain implementations of the first aspect, the RNTI is one of a plurality of RNTIs configured, the plurality of RNTIs configured have a same a bits, the a bits correspond to a same bit position in each RNTI of the plurality of RNTIs, the a bits have a first hamming weight, wherein the first hamming weight is a minimum value of hamming weights of H rows, the H rows correspond to H rows of a generator matrix of polarized Polar, the H bits are the number of bits of each RNTI of the plurality of RNTIs configured, 1 ≦ a ≦ H ≦ N, and A, H and N are positive integers.

In the technical scheme of the application, a transmitting end configures a plurality of RNTIs for a receiving end, and the length of the RNTIs is the same. Therefore, it can also be said that each RNTI includes a bits corresponding to the same bit position in each RNTI in the plurality of RNTIs, the a bits having a first hamming weight, wherein the first hamming weight is the minimum of the hamming weights of H rows, the H rows correspond to H rows of the N rows of the generator matrix of polarized Polar, and the H bits are the number of bits of each RNTI in the configured plurality of RNTIs. And the transmitting end scrambles the bit sequence transmitted to the receiving end by using one RNTI in the RNTIs. The receiving end descrambles the scrambled bit sequence by using the RNTIs, so that the probability of false alarm can be reduced.

With reference to the first aspect, in certain implementations of the first aspect, the RNTI is one of a plurality of configured RNTIs, the plurality of RNTIs further have the same F bits corresponding to the same bit position in each RNTI in the plurality of RNTIs, the F bits have a second hamming weight, the second hamming weight is greater than the first hamming weight, and the second hamming weight is less than a third hamming weight, where the third hamming weight is the hamming weight of the H bits other than the a bits and the F bits corresponding to the rest of the N rows of the generation matrix of polarized Polar, 1 ≦ F ≦ H, a + F ≦ H, and F is a positive integer.

On the basis of ensuring that the bits of the bit positions corresponding to the row with the minimum hamming weight are the same, the values of the bits of the bit positions corresponding to part or all of the rows with the second minimum hamming weight of the RNTIs can be further ensured to be the same. The probability of false alarms can be further reduced.

In a second aspect, the present application provides a method of coding, the method comprising:

a receiving end obtains a sequence to be decoded; the receiving end generates L first bit sequences according to the sequence to be decoded, wherein L is an integer greater than 1; the receiving end uses G configured Radio Network Temporary Identifiers (RNTIs) to descramble the L first bit sequences to obtain L second bit sequences, wherein J identical bit sequences in the L second bit sequences correspond to J different RNTIs, G is an integer larger than 1, and J is an integer and is larger than or equal to 2; the receiving end carries out sequence de-conversion corresponding to the J different RNTIs on the J second bit sequences to obtain J third bit sequences; the receiving end carries out Cyclic Redundancy Check (CRC) check on the J third bit sequences, and the third bit sequences passing the CRC check are used as output bit sequences; the receiving end outputs the output bit sequence.

With reference to the second aspect, in some implementations of the second aspect, the performing, by the receiving end, sequence de-transformation on the J second bit sequences corresponding to the J different RNTIs to obtain J third bit sequences specifically includes

And the receiving end respectively decrypts the J second bit sequences corresponding to the J different RNTIs to obtain J third bit sequences, wherein the bit value in the third bit sequences is different from the bit value in the second bit sequences.

It should be understood that advantageous technical effects of the second aspect or other implementations of the second aspect fully correspond to advantageous effects of the first aspect and other implementations of the first aspect thereof, and are not described here and below.

With reference to the second aspect, in some implementation manners of the second aspect, the decrypting, by the receiving end, the J second bit sequences corresponding to the J different RNTIs respectively, and the obtaining J third bit sequences specifically includes:

and the receiving end decrypts the J second bit sequences respectively according to J asymmetric decryption formulas corresponding to different RNTIs to obtain J third bit sequences.

With reference to the second aspect, in some implementations of the second aspect, the asymmetric decryption formula is as follows:

C^D＝M(modP),

c is a value of the last H bits of the second bit sequence, M is a value of the last H bits of the third bit sequence, P is a prime number, and D satisfies the following condition:

(E×D)modQ＝1

the E and the (P-1) are relatively prime, D, M, E, P and H are positive integers, and mod is a modulus operation.

Further, said E also satisfies 1< E < (P-1).

In combination with the second aspect, in certain implementations of the second aspect,

the decrypting, by the receiver, the J second bit sequences corresponding to the J different RNTIs, respectively, and obtaining J third bit sequences specifically includes:

and respectively decrypting the J second bit sequences according to J symmetrical decryption formulas corresponding to different RNTIs to obtain J third bit sequences.

With reference to the second aspect, in some implementation manners of the second aspect, the performing, by the receiver, sequence de-transformation on the J second bit sequences corresponding to the J different RNTIs to obtain J third bit sequences specifically includes:

the receiving end performs decoding on the J second bit sequences corresponding to J different RNTIs to obtain J third bit sequences, where a bit value in the third bit sequence is different from a bit value in the second bit sequence, and the decoding includes any one of the following: convolutional codes, Turbo codes, low density parity check, CRC, reed-solomon, RM, cyclic or Polar codes.

the performing, by the receiver, sequence-decoding transformation on the J second bit sequences corresponding to the J different RNTIs to obtain J third bit sequences specifically includes:

and the receiving end performs J-different deinterleaving corresponding to RNTIs on the L second bit sequences to obtain L position-transformed third bit sequences.

With reference to the second aspect, in certain implementations of the second aspect, the RNTI is a plurality of RNTIs configured to have a same a bits, the a bits correspond to a same bit position in each RNTI in the plurality of RNTIs, the a bits have a first hamming weight, wherein the first hamming weight is a minimum value of hamming weights of H rows, the H rows correspond to H rows in N rows of a generation matrix of polarized Polar, the H bits are the number of bits of each RNTI in the plurality of RNTIs configured, 1 ≦ a ≦ H ≦ N, and A, H and N are positive integers.

With reference to the second aspect, in certain implementations of the second aspect, the RNTI is a plurality of RNTIs that are configured, the plurality of RNTIs that are configured also have F identical bits corresponding to identical bit positions in each RNTI in the plurality of RNTIs, the F bits having a second hamming weight that is greater than the first hamming weight and that is less than a third hamming weight, wherein the third hamming weight is the hamming weight of the H bits corresponding to the remaining rows of the N rows of the generation matrix of polarization Polar except for the a bits and the F bits, 1 ≦ F ≦ H, a + F ≦ H, and F is a positive integer.

In a third aspect, the present application provides an encoding apparatus comprising:

a transceiver configured to obtain a first bit sequence, the first bit sequence comprising: k information bits and X Cyclic Redundancy Check (CRC) bits, wherein K and X are positive integers; transmitting the encoded bit sequence according to the processor indication;

the processor is used for carrying out sequence transformation on the first bit sequence to obtain a second bit sequence; scrambling the second bit sequence by using a Radio Network Temporary Identifier (RNTI) to obtain a third bit sequence; performing polarized Polar coding on the third bit sequence to obtain a coded bit sequence; instructing the transceiver to transmit the encoded bit sequence.

It should be understood that advantageous technical effects of the third aspect or other implementations of the third aspect fully correspond to advantageous effects of the first aspect and other implementations of the first aspect thereof, and are not described here and below.

With reference to the third aspect, in some implementations of the third aspect, the processor is specifically configured to: and encrypting the first bit sequence to obtain a second bit sequence, wherein the bit value in the second bit sequence is different from the bit value in the first bit sequence.

With reference to the third aspect, in some implementations of the third aspect, the processor is specifically configured to: and encrypting the first bit sequence according to an asymmetric encryption formula to obtain a second bit sequence.

With reference to the third aspect, in some implementations of the third aspect, the asymmetric encryption formula is as follows:

M^E＝C(modP)，

With reference to the third aspect, in some implementations of the third aspect, the processor is specifically configured to: and encrypting the first bit sequence according to a symmetric encryption formula to obtain a second bit sequence.

With reference to the third aspect, in some implementations of the third aspect, the processor is specifically configured to:

encoding the first bit to obtain a second bit sequence, wherein bit values in the second bit sequence are different from bit values in the first bit sequence, and the encoding includes any one of the following: convolutional codes, Turbo codes, low-density parity-check, CRC, reed-muller, RM, cyclic or Polar codes.

With reference to the third aspect, in some implementation manners of the third aspect, the processor is specifically configured to interleave the first bit sequence to obtain a second bit sequence after position change.

With reference to the third aspect, in certain implementations of the third aspect, the processor configures a plurality of RNTIs, the plurality of RNTIs having a same a bits, the a bits corresponding to a same bit position in each of the plurality of RNTIs, the a bits having a first hamming weight, wherein the first hamming weight is a minimum value of hamming weights of H rows, the H rows correspond to H rows of N rows of a generation matrix of polarization Polar, the H bits are the number of bits of each of the configured plurality of RNTIs, 1 ≦ a ≦ H ≦ N, and A, H and N are positive integers.

With reference to the third aspect, in certain implementations of the third aspect, the processor is further configured to configure a plurality of RNTIs, the plurality of RNTIs further having F same bits, the F bits corresponding to the same bit positions in each of the plurality of RNTIs, the F bits having a second hamming weight, the second hamming weight being greater than the first hamming weight, and the second hamming weight being less than a third hamming weight, wherein the third hamming weight is the hamming weight of the remaining bits of the H bits, except the a bits and the F bits, corresponding to the remaining rows of the N rows of the generation matrix of polarized Polar, 1 ≦ F ≦ H, a + F ≦ H, and F being a positive integer.

In a fourth aspect, a decoding device, the decoding device comprising:

a transceiver for obtaining a sequence to be decoded; and sending a bit sequence to be output according to the processor indication;

a processor, configured to descramble the L first bit sequences using G configured radio network temporary identifiers RNTI, to obtain L second bit sequences, where J identical bit sequences in the L second bit sequences correspond to J different RNTIs, G is an integer greater than 1, and J is an integer and greater than or equal to 2; performing sequence de-conversion corresponding to the J different RNTIs on the J second bit sequences to obtain J third bit sequences; performing Cyclic Redundancy Check (CRC) check on the J third bit sequences, and taking the third bit sequences passing the CRC check as output bit sequences; instructing the transceiving unit to transmit the output bit sequence.

It should be understood that the advantageous technical effects of the fourth aspect or other implementations of the fourth aspect fully correspond to the advantageous effects of the second aspect and other implementations of the second aspect thereof, and are not described here and below.

With reference to the fourth aspect, in certain implementations of the fourth aspect, the processor is specifically configured to:

and respectively decrypting the J second bit sequences corresponding to the J different RNTIs to obtain J third bit sequences, wherein the bit value in the third bit sequence is different from the bit value in the second bit sequence.

and respectively decrypting the J second bit sequences according to J asymmetric decryption formulas corresponding to different RNTIs to obtain J third bit sequences.

With reference to the fourth aspect, in some implementations of the fourth aspect, the asymmetric decryption formula is as follows:

C^D＝M(mod P),

c is the value of the last H bits of the second bit sequence, M is the value of the last H bits of the third bit sequence, P is a prime number,

the D satisfies the following condition:

(E×D)mod Q＝1

performing J different decoding corresponding to the RNTI to the J second bit sequences to obtain J third bit sequences, wherein a bit value in the third bit sequence is different from a bit value in the second bit sequence, and the decoding includes any one of the following: convolutional codes, Turbo codes, low density parity check, CRC, reed-muller RM, cyclic or Polar codes.

With reference to the fourth aspect, in certain implementations of the fourth aspect, the processor is specifically configured to: and performing J de-interleaving corresponding to J different RNTIs on the J second bit sequences to obtain J position-transformed third bit sequences. With reference to the fourth aspect, in certain implementations of the fourth aspect, the processor is specifically configured to configure a plurality of RNTIs, where the configured plurality of RNTIs have the same a bits, the a bits correspond to the same bit positions in each of the plurality of RNTIs, the a bits have a first hamming weight, where the first hamming weight is a minimum value of hamming weights of H rows, the H rows correspond to H rows of N rows of a generator matrix of polarization Polar, 1 ≦ a ≦ H ≦ N, and N, A and H are positive integers.

With reference to the fourth aspect, in certain implementations of the fourth aspect, the processor is specifically configured to: configuring a plurality of RNTIs, the configured RNTIs further having F same bits corresponding to same bit positions in each RNTI of the plurality of RNTIs, the F bits having a second Hamming weight that is greater than the first Hamming weight and that is less than a third Hamming weight, wherein the third Hamming weight is the Hamming weight of the remaining rows of the H rows other than the A rows and the F rows, 1 ≦ F ≦ H, A + F < H, and F is an integer.

In a fifth aspect, the present application provides an encoding apparatus comprising:

a receiving unit, configured to obtain a first bit sequence, where the first bit sequence includes: k information bits and X Cyclic Redundancy Check (CRC) bits, wherein K and X are positive integers;

a sequence transformation unit, configured to perform sequence transformation on the first bit sequence to obtain a second bit sequence;

a scrambling unit, configured to scramble the second bit sequence using a radio network temporary identifier RNTI, and obtain a scrambled third bit sequence;

the coding unit is used for carrying out polarized Polar coding on the third bit sequence to obtain a coded bit sequence;

a transmitting unit, configured to transmit the encoded bit sequence.

It should be understood that advantageous technical effects of the fifth aspect or other implementations of the fifth aspect fully correspond to advantageous effects of the first aspect and other implementations of the first aspect thereof, which are not described here and in the following.

With reference to the fifth aspect, in some implementations of the fifth aspect, the sequence transformation unit is specifically configured to:

and encrypting the first bit sequence to obtain a second bit sequence, wherein bit values in the second bit sequence are different from bit values in the first bit sequence.

and encrypting the first bit sequence according to a symmetric encryption formula to obtain a second bit sequence.

With reference to the fifth aspect, in certain implementations of the fifth aspect, the scrambling unit is further configured to configure a plurality of RNTIs, where the plurality of RNTIs have a same a bits, the a bits correspond to a same bit position in each RNTI in the plurality of RNTIs, the a bits have a first hamming weight, where the first hamming weight is a minimum value of hamming weights of H rows, the H rows correspond to H rows in N rows of a generation matrix of polarized Polar, the H bits are the number of bits of each RNTI in the configured plurality of RNTIs, 1 ≦ a ≦ H ≦ N, and A, H and N are positive integers.

In a sixth aspect, the present application provides a coding device comprising:

a receiving unit, configured to obtain a sequence to be decoded;

the decoding device comprises a processing unit, a decoding unit and a decoding unit, wherein the processing unit is used for generating L first bit sequences according to a sequence to be decoded, and L is an integer greater than 1;

a descrambling unit, configured to descramble the L first bit sequences by using G configured radio network temporary identifiers RNTI, to obtain L second bit sequences, where J identical bit sequences in the L second bit sequences correspond to J different RNTIs, G is an integer greater than 1, and J is an integer and greater than or equal to 2;

a de-sequence transforming unit, configured to perform de-sequence transformation corresponding to the J different RNTIs on the J second bit sequences to obtain J third bit sequences;

a checking unit, configured to perform Cyclic Redundancy Check (CRC) check on the J third bit sequences, and use the third bit sequences passing through the CRC check as output bit sequences;

a transmitting unit, configured to transmit the output bit sequence.

With reference to the sixth aspect, in some implementations of the sixth aspect, the deserializing unit is specifically configured to:

With reference to the sixth aspect, in some implementations of the sixth aspect, the descrambling unit is specifically configured to configure a plurality of RNTIs, where the configured plurality of RNTIs have the same a bits, the a bits correspond to the same bit positions in each RNTI in the plurality of RNTIs, the a bits have a first hamming weight, where the first hamming weight is a minimum value of hamming weights of H rows, the H rows correspond to H rows of N rows of a generation matrix of polarization Polar, 1 ≦ a ≦ H ≦ N, and N, A and H are positive integers.

Advantageous technical effects of the sixth aspect or other implementations of the sixth aspect fully correspond to the advantageous effects of the second aspect and other implementations of the second aspect, and are not described here and below.

In a seventh aspect, the present application provides a communication system, comprising: an encoding apparatus as claimed in any one of the third aspect or the third aspect and a decoding apparatus as claimed in any one of the fourth aspect or the fourth aspect.

In an eighth aspect, the present application provides a communication device for performing the method of the first aspect or any possible implementation manner of the first aspect. In particular, the communication device comprises means for performing the method of the first aspect or any possible implementation manner of the first aspect.

In a ninth aspect, the present application provides a communication device for performing the method of the second aspect or any possible implementation manner of the second aspect. In particular, the communication device comprises means for performing the method of the second aspect or any possible implementation of the second aspect.

In a tenth aspect, the present application provides a network device comprising a transceiver, a processor, and a memory. The processor is configured to control the transceiver to transmit and receive signals, the memory is configured to store a computer program, and the processor is configured to call and execute the computer program stored in the memory, so that the network device performs the method in the first aspect and any possible implementation manner of the first aspect, or the processor is configured to call and execute the computer program stored in the memory, so that the network device performs the method in the second aspect and any possible implementation manner of the second aspect.

In an eleventh aspect, the present application provides a terminal device comprising a transceiver, a processor, and a memory. The processor is configured to control the transceiver to transmit and receive signals, the memory is configured to store a computer program, and the processor is configured to call and execute the computer program stored in the memory, so that the terminal device performs the method in any possible implementation manner of the first aspect and the first aspect thereof, or the processor is configured to call and execute the computer program stored in the memory, so that the network device performs the method in any possible implementation manner of the second aspect and the second aspect thereof.

In a twelfth aspect, the present application provides a computer-readable storage medium having instructions stored thereon, which, when executed on a computer, cause the computer to perform the method of the first aspect or any possible implementation manner of the first aspect, or cause the computer to perform the method of the second aspect or any possible implementation manner of the second aspect.

In a thirteenth aspect, the present application provides a chip, which includes a memory and a processor, where the memory is used to store a computer program, and the processor is used to call and execute the computer program from the memory to perform the method in the first aspect and any possible implementation manner of the first aspect, or the processor performs the method in the second aspect or any possible implementation manner of the second aspect.

Optionally, the chip only includes a processor, and the processor is configured to read and execute the computer program stored in the memory, and when the computer program is executed, the processor executes the method in the first aspect or any possible implementation manner of the first aspect, or the processor executes the method in the second aspect or any possible implementation manner of the second aspect.

In a fourteenth aspect, the present application provides a computer program product comprising computer program code which, when run on a computer, causes the computer to perform the method of the first aspect or any possible implementation thereof or causes the computer to perform the method of the second aspect or any possible implementation thereof.

Alternatively, the memory and the processor may be physically separate units, or the memory and the processor may be integrated together.

According to the technical scheme, the reason for the generation of the RNTI false alarm is found by analyzing the characteristics of the SCL decoding algorithm of the polar code, so that the compiling method is provided. According to the method, the sequence is changed, so that the transmitting end transmits the bit sequence after sequence conversion to the receiving end. The receiving end decodes, descrambles and converts the received sequence to be decoded, so that the probability of false alarm can be reduced.

Drawings

Fig. 1 is a wireless communication system 100 suitable for use in the present application.

Fig. 2 is a schematic diagram of the encoding and decoding process of a control channel in a communication system.

Fig. 3 is a process schematic diagram of SCL coding.

Fig. 4 is a flowchart illustrating an encoding method 400 proposed in the present application.

Fig. 5 is a flowchart illustrating a decoding method 500 according to the present application.

Fig. 6 is a schematic block diagram of an encoding apparatus 60 provided herein.

Fig. 7 is a schematic block diagram of a decoding device 70 provided herein.

Fig. 8 is a schematic block diagram of an encoding apparatus 80 provided herein.

Fig. 9 is a schematic block diagram of a decoding apparatus 90 provided herein.

Fig. 10 is a schematic block diagram of a network device 1000 provided in the present application.

Fig. 11 is a schematic structural diagram of a terminal device 1300 provided in the present application.

Detailed Description

The technical solutions proposed in the present application will be described in further detail below with reference to the accompanying drawings and examples.

The wireless Communication System mentioned in the embodiment of the present application includes, but is not limited to, a global System for Mobile Communication (GSM) System, a Code Division Multiple Access (CDMA) System, a Wideband Code Division Multiple Access (WCDMA) System, a General Packet Radio Service (GPRS), a Long Term Evolution (LTE) System, a Frequency Division Duplex (FDD) System of LTE, a Time Division Duplex (TDD) of LTE, a Universal Mobile Telecommunications System (UMTS), a Worldwide Interoperability for Microwave Access (WiMAX) System, and a Mobile Broadband Access (WiMAX) System, which is a third generation enhanced Mobile Communication scenario, for short: eMBB), high-reliability Low Latency Communication (Ultra Reliable Low Latency Communication, abbreviated: URLLC) and enhanced mass Machine Type Communication (Massive Machine Type Communication, abbreviated: eMTC) or new communication systems emerging in the future, etc.

The Terminal device in the embodiments of the present application may refer to a User Equipment (UE), a Terminal (Terminal), an access Terminal, a subscriber unit, a subscriber station, a mobile station, a remote Terminal, a mobile device, a User Terminal, a wireless communication device, a User agent, or a User Equipment. The terminal device may also be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device with a Wireless communication function, a computing device or other processing devices connected to a Wireless modem, a vehicle-mounted device, a wearable device, a terminal device in a future 5G Network or a terminal device in a future evolved Public Land Mobile Network (PLMN), and the like, which is not limited in this application.

The Network device in the embodiment of the present application may be a device for communicating with a terminal device, and the Network device may be a Base Transceiver Station (BTS) in a Global System for Mobile Communication (GSM) System or a Code Division Multiple Access (CDMA) System, a Base station (NodeB, NB) in a Wideband Code Division Multiple Access (WCDMA) System, an evolved node b (eNB, eNodeB) in an LTE System, or a wireless controller in a Cloud Radio Access Network (CRAN) scenario, or the network device may also be a relay station, an access point, a vehicle-mounted device, a wearable device, a network device in a future 5G network, and the like, which is not limited in this embodiment of the present application.

Fig. 1 is a wireless communication system 100 suitable for use in the present application. At least one network device 101 may be included in the wireless communication system 100, the network device 101 communicating with one or more terminal devices (e.g., terminal device 102 and terminal device 103 shown in fig. 1). The network device may be a base station, or a device formed by integrating the base station and a base station controller, or another device having a similar communication function.

The network device and the terminal device in fig. 1 communicate by using wireless technology. When the network device sends a signal, the network device is a sending end, and when the network device receives the signal, the network device is a receiving end. On the contrary, when the terminal device sends a signal, the terminal device is a sending end, and when the terminal device receives the signal, the terminal device is a receiving end.

Channel coding and decoding are one of the core technologies in the field of wireless communication. At present, the polar code is a channel coding technology which can theoretically prove that the polar code reaches the Shannon limit and has practical linear complexity coding and decoding capabilities. The core of the polar code structure is that through the processing of 'channel polarization', a coding method is adopted on the coding side to enable each sub-channel to present different reliability, when the code length is continuously increased, one part of channels tend to a noiseless channel with the capacity close to 1, the other part of channels tend to a full-noise channel with the capacity close to 0, and the channel with the capacity close to 1 is selected to directly transmit information to approximate the channel capacity.

The coding strategy of Polar codes just applies the characteristic of the phenomenon, and transmits useful information of users by using a noiseless channel, and transmits appointed information or unvarnished information by using a full-noise channel. Polar code is a linear block code whose generator matrix (also called encoding matrix) is F_NThe encoding process can be expressed as

Wherein the content of the first and second substances,

is a binary row vector of length N (i.e., code length), and N is 2ⁿAnd n is a positive integer. F_NIs an N × N matrix, and

is defined as log₂N matrices F₂The kronecker product of (a) and (b),

the addition and multiplication operations in the above formulas are addition and multiplication operations in binary galois fields.

In the encoding process of the Polar code,

a part of the bits used to carry information is called a set of information bits. The set of indices for these bits is denoted as A.

The other part of the Bits are set as fixed values predetermined by the receiving end and the transmitting end, which are called as fixed bit sets or Frozen bit (Frozen Bits) sets, and the set of the indexes is the complement A of A^cAnd (4) showing. The coding process of Polar code is equivalent to

Here, F_N(A) Is F_NThe sub-matrix obtained from the row corresponding to the index in the set a. F_N(A^c) Is F_NIn (A) is set^cThe sub-matrix obtained from the row corresponding to the index in (1). Mu.s_AIs composed of

The number of information bits in (1) is K.

Is composed of

The fixed set of bits, whose number is (N-K), are known bits. These fixed bits are usually set to 0, but may be arbitrarily set as long as the receiving end and the transmitting end agree in advance. Thus, the coded output of Polar codes can be simplified into

Mu in this case_AIs composed of

Set of information bits of (1), mu_AIs a row vector of length K, i.e. | a | ═ K, the symbol | | | denotes the number of elements in the set, K is the information block size, F_N(A) Is a matrix F_NOf the sub-matrix obtained from those rows corresponding to the indices in the set A, F_N(A) Is an N x N matrix.

The construction process of Polar code, namely the selection process of the set A, determines the performance of Polar code. Polar code construction process is usually to determine the co-existing N polarized channels according to the code length N, and the N polarized channels respectively correspond to the generator matrix F_NN rows. Generating a matrix F_NEach row of (a) 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 that row. The hamming weight of a row refers to the number of non-zero elements of the row. Wherein the hamming weights are all integer powers of 2. For example, hamming weights are 2, 4, 16, 32, 64, 128, 256, etc.

For example,

F₂including two rows. The hamming weight of the first row is 1 and the hamming weight of the second row is 2.

As another example of the present invention,

comprises 4 rows, and the Hamming weights are 1, 2 and 4 respectively.

Fig. 2 is a schematic diagram of the encoding and decoding process of a control channel in a communication system. As shown in fig. 2, the sending end mainly includes the following processing flows:

(1) a plurality of Cyclic Redundancy Check (CRC) bits are added in a Bit sequence of an information Source (Bit Source), and a distributed CRC structure is formed by a Bit interleaver, so that a receiving end can terminate decoding in advance.

The source bit sequence is understood as an information bit sequence which needs to be transmitted to a receiving end by a transmitting end and is a binary bit sequence. The CRC bits may also be referred to as a CRC check sequence or a CRC check code, and is also a binary bit sequence. The length of the CRC check sequence may be set by the system.

It should be understood that given a source bit sequence, its CRC check sequence can be calculated, and the specific calculation process can refer to the prior art and will not be described in detail herein.

It should be noted that when adding the CRC check sequence to the source bit sequence, the CRC check sequence is usually added directly after the source bit sequence. For example, assume that the source bit sequence is 110010 and the calculated CRC check sequence is 010100. Then the CRC check sequence is appended directly after the source bit sequence, which should be 110010010100.

The distributed CRC structure referred to herein is in contrast to the above-described addition of a CRC check sequence directly after the source bit sequence. The distributed CRC structure is to interleave the first few bits of the CRC check sequence in the source bit sequence, so that the first few bits of the CRC check sequence are dispersed in the source bit sequence, and then attach the rest bits of the CRC check sequence after the interleaved bit sequence. Continuing with the above example, assuming that the first 3 bits of the CRC check sequence are interleaved in the source bit sequence according to the system preset, 010 can be interleaved in the source bit sequence according to any one of the bit interleaving methods in the prior art to obtain an interleaved bit sequence with a length of 9 (i.e., 6+3), and then 100 is appended to the interleaved bit sequence.

In a New generation wireless communication system (NR), 24-bit CRC check sequence is adopted for channel coding, the first 8 bits of the 24 bits are interleaved in the source bit sequence, and the last 16 bits of the 24 bits are appended to the bit sequence after interleaving. Among them, the distributed CRC structure is proposed by NR specifically for polar coding of control channel, aiming at early termination of decoding. The early termination of decoding means that if the receiving end can judge that the decoding result is erroneous according to the first 8 bits of the CRC check sequence, the decoding can be terminated.

In the following, we will describe the subsequent processing by taking as an example that the CRC check sequence specified in NR is 24 bits, the first 8 bits are interleaved in the source bit sequence, and the last 16 bits are appended to the completely interleaved bit sequence.

(2) The sending end performs sequence transformation on the interleaved bit sequence to obtain a sequence-transformed bit sequence, and a method used by the sequence transformation may be implemented by an encryption algorithm, for example: the asymmetric encryption algorithm may also be implemented by encoding, for example: turbo codes, LDPC codes, etc. may also be implemented by interleaving, e.g., row-column interleaving, etc.

The principle of the asymmetric encryption algorithm is as follows:

let P be a prime number, Q-P-1;

a. optionally selecting E to meet the following conditions: e is coprime to Q, and 1< E < Q;

b. calculating E the modulo inverse element D for Q: ED mod Q is 1, i.e., ED + k Q is 1;

c. and (E, P) is regarded as a public key, and the plaintext M is encrypted by adopting the following rule to obtain C:

encryption rules: m^E＝C(modP)；

And encrypting the interleaved bit sequence according to the asymmetric encryption algorithm principle to obtain an encrypted bit sequence.

(3) And performing bit-by-bit exclusive OR on the last 16 bits of the CRC sequence and a Radio Network Temporary Identity (RNTI) with the length of 16 bits to complete RNTI scrambling.

It should be understood that the last 16 bits of the CRC check sequence are bitwise xored with the RTNI of length 16, i.e. RNTI scrambling.

Taking a sending end as a base station and a receiving end as a terminal device as an example, a cell covered by the base station has multiple terminal devices, and for each terminal device, the base station may configure multiple RNTIs for the terminal device, and the functions of the multiple RNTIs may be different. For example, one RNTI of the RNTIs is used for the network side to transmit a paging message to the terminal device, one RNTI is used for the network side to transmit a system message to the terminal device, and one RNTI is used for transmitting a random access response to the terminal device. The base station notifies the terminal device of the configured plurality of RNTIs.

Here, the RNTI used to scramble the last 16 bits of the CRC check sequence is any one of the RNTIs that the transmitting end configures for the receiving end.

(4) Mapping the bit sequence scrambled by the RNTI to the input end of an encoder according to the information bit index for polar encoding, then obtaining the required aggregation level through rate matching, modulating by Quadrature Phase Shift Keying (QPSK), and then transmitting.

Correspondingly, the receiving end mainly comprises the following processing flows:

(1) the received data is de-rate matched and then input to a decoder for decoding.

Specifically, for polar coding of the control channel, the decoding end adopts an SCL decoding algorithm for decoding.

For ease of understanding, the SCL decoding algorithm is briefly described below.

It is known from the coding principle of Polar Code that the construction of Polar Code is the problem of selection of Polar channel. Since the polarized channels are not independent from each other, but have a dependency relationship: a polarized channel with a large channel number depends on all polarized channels with smaller numbers than the channel number. Based on the dependency relationship between the polarized channels, a Successive Cancellation (SC) decoding algorithm sequentially performs decoding decision (or bit decision) on each bit according to the sequence of the channel number from small to large. And, when the ith bit is decided, the decoding decision is based on the assumption that the results of all the previous (i-1) bit decoding decisions are correct. As the code length approaches infinity, each information bit will be correctly decoded since the split channel is nearly fully polarized (channel capacity is either 0 or 1).

The above decoding process may refer to the decoding tree of fig. 3 where N is 4, and fig. 3 is an example of the decoding tree of N is 4. As shown in fig. 3, the decoding tree is a binary tree, and the structure of the decoding tree is only related to the code length N. In a decoding tree, the depth of a node is defined as the shortest path length from the root node of the decoding tree to the node. It can be seen that for a polarization code with a code length equal to N, the set of nodes in the coding tree can be divided into N +1 subsets according to depth d, denoted as V_dWherein d is 0, 1, …, N. Easy to understand, V₀Only the root node is included. Except for leaf nodes (i.e., when d ═ N) in the decoding tree, each node u in the decoding tree is connected to the succeeding node by two edges labeled 0 and 1, respectively. Sequence corresponding to a certain node u

Defined as the sequence of labels of the edges that need to be traversed to reach the node u from the root node. In addition, in the decoding tree, paths formed from the root node to any one node all correspond to a Path Metric (PM), and can be obtained through calculation. The path metric value can be used as a reference for judging the quality of the path. The label sequence of each edge which needs to pass from the root node to a certain node of the layer where the leaf node is located is a decoding path. Therefore, the decoding process of the polarization code is to find a proper path on the binary tree. As shown in fig. 3, taking code length N-4 as an example, a path with the smallest PM value is selected at each node and is extended downward, and assuming that node a extending from the root node to the leaf node layer is an optimal path, the finally determined decoding sequence is the optimal path

The SC decoding algorithm is a greedy algorithm that searches only the optimal path (e.g., according to the PM of the path) at each level of the decoding tree for the next level, so that errors cannot be modified. Aiming at the defects of the SC decoding algorithm, an SCL decoding algorithm is proposed. The number of candidate paths allowed to be reserved is increased at each layer of the decoding tree, and only the optimal path is allowed to be selected for next expansion from each layer of the SC decoding algorithm, and the maximum path allowed to be selected best is changed into the next expansion. And, the candidate path that each layer allows to be reserved is called a search width (denoted as Z). Like the SC algorithm, when decoding, the SCL algorithm still performs path search from the root node of the decoding tree to the leaf node layer by layer in sequence. Different from the SC, after path expansion of each layer is completed, Z paths with the smallest PM are selected as candidate paths, stored in a list, and wait for expansion of the next layer. From the above description, it can be seen that the SC decoding algorithm is depth-first, requiring fast arrival at leaf nodes from the root node. The SCL decoding algorithm is breadth-first, and is expanded and pruned to finally reach the leaf node. Therefore, the output of the SCL decoding algorithm is a plurality of candidate decoding paths (determined by the search width Z). The SCL coding algorithm may also be referred to as a list coding scheme for short.

If the decoding paths of the L candidates are output, the sequence to be decoded generates L bit sequences through the decoding algorithm, and each decoding path of the L candidate decoding paths has a bit sequence.

(2) And the receiving end carries out RNTI descrambling on the bit sequence output by the decoder.

As described in the processing flow of the transmitting end, the transmitting end configures a plurality of RNTIs for the receiving end. The receiving side knows that the transmitting side scrambles the transmitted bit sequence using one of the RNTIs, but does not know which RNTI is used. Therefore, the receiving end needs to perform descrambling attempts one by one using the plurality of RNTIs. Theoretically, the RNTI used by the receiving end for descrambling should be the same as the RNTI used by the transmitting end for scrambling, and the descrambled bit sequence can only pass CRC check finally. For example, assuming that the transmitting end has 8 RNTIs allocated to the receiving end, the transmitting end scrambles the latter bits of the CRC check sequence using RNTI #2 among the 8 RNTIs. Then theoretically, the bit sequence after the receiver descrambles the candidate decoding path using RNTI #2 can pass the CRC check. For clarity of description, the RNTI which is the same as the RNTI used by scrambling at the transmitting end among the RNTIs at the receiving end is called a correct RNTI, and the rest RNTIs are wrong RNTIs. For example, the transmitting side allocates 4 RNTIs to the receiving side, and these are denoted as RNTI #1, RNTI #2, RNTI #3, and RNTI #4, respectively. If the sending end uses the RNTI #3 to scramble the bit sequence, for the receiving end, the RNTI #3 is correct RNTI in the descrambling process, and the bit sequence obtained after descrambling the candidate decoding path by using the RNTI #3 can pass CRC check. In contrast, RNTI #1, RNTI #2, and RNTI #4 are erroneous RNTIs, and a bit sequence obtained after descrambling candidate decoding paths using RNTI #1, RNTI #2, or RNTI #4 cannot theoretically pass CRC check.

(3) The receiving end carries out de-sequence transformation on the L descrambled bit sequences to obtain L de-sequence transformed bit sequences; the de-sequence transformation corresponds to the encoding time, and if the encoding time adopts an encryption mode, a decryption mode is adopted; if the coding is carried out, the sequence transformation adopts a coding mode, and the L decoded bit sequences adopt a corresponding coding mode to carry out decoding; if the coding is performed, the sequence conversion adopts an interleaving mode, and the L decoded bit sequences adopt a corresponding de-interleaving mode. J identical bit sequences in the L second bit sequences correspond to J different RNTIs, G is an integer larger than 1, J is an integer and larger than or equal to 2, and the de-sequence transformation is related to the RNTIs. The principles of the asymmetric encryption algorithm mentioned above are specifically as follows:

let P be a prime number, Q-P-1.

a. Optionally selecting E to meet the following conditions: e is coprime to Q, and 1< E < Q.

b. Calculating E the modulo inverse element D for Q: ED mod Q is 1, i.e., ED + k Q is 1.

c. And (E, P) is regarded as a public key, and (D, P) is regarded as a private key, and the ciphertext C is decrypted by adopting the following rules to obtain a plaintext M:

and (3) decryption rules: c^D＝M(modP)；

And decrypting the descrambled bit sequence according to the asymmetric encryption algorithm principle to obtain L decrypted bit sequences.

(4) And the receiving end performs CRC on the bit sequence after the sequence de-conversion, and finally selects the bit sequence which is descrambled by the correct RNTI and passes through the CRC as an output sequence, namely selects the bit sequence of the candidate decoding path which passes through the CRC for output.

The application provides a coding and decoding method, which reduces false alarm probability caused by RNTI conflict by introducing a mode of converting a sequence.

In conjunction with the encoding and decoding processes of fig. 1-3 above, fig. 4 is a schematic flow chart of an encoding method 400 proposed by the present application. As shown in fig. 4, the sending end mainly includes the following processing flows:

400. a sending end obtains a first bit sequence, wherein the first bit sequence comprises: k information bits and X Cyclic Redundancy Check (CRC) bits, wherein K and X are positive integers.

Specifically, a sending end receives K information bits, and checks CRC bits according to the K information bits and X cyclic redundancy checks, wherein K and X are positive integers.

Alternatively, the CRC check sequence may be directly appended to the information sequence, or the first bits of the CRC check sequence may be interleaved in the first bit sequence and the second bits of the CRC check sequence may be appended to the interleaved bit sequence. I.e. a distributed CRC structure as described above. Alternatively, other methods of adding CRC check sequences known in the art may be used. This is not a limitation of the present application.

Wherein the length X of the CRC check sequence may be predefined by the communication system. For example, in NR, the length of the CRC check sequence is specified to be 24, or 11, or 6. For example: with a CRC length of 24, the first 8 bits of the 24 bits are interleaved in a first bit sequence, and the last 16 bits are appended directly after the interleaved bit sequence. That is, a distributed CRC structure is formed.

Optionally, after step 400, bit interleaving may also 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, row-column interleaving may be used, or other interleaving methods may be used.

402. And the sending end carries out sequence transformation on the first bit sequence to obtain a second bit sequence.

Sequence variations here include: a value transformation of the first bit sequence, or a position transformation of the first bit sequence.

It should be understood that, whether the value of the first bit sequence is transformed or the position of the first bit sequence is transformed, the probability that the bits of the second bit sequence after the transformation are decoded in a wrong way is considered to be lower than the probability that the bits of the first bit sequence without the sequence transformation are decoded, and therefore the decoding false alarm rate is reduced. For example: the reliability of bits at certain positions in the first bit sequence is low, the bits are often decoded incorrectly during decoding, and after sequence conversion, the bits at the positions with low reliability are fixedly set, or the bits which are easy to be decoded incorrectly are converted to the positions with high reliability, so that the false alarm rate of decoding is reduced.

Further, the value transformation of the first bit sequence comprises:

the first method is as follows: and the sending end encrypts the first bit sequence to obtain a second bit sequence, wherein the bit value in the second bit sequence is different from the bit value in the first bit sequence.

It is to be understood that the value of the bit in the second bit sequence is different from the bit in the first bit sequence, so that the probability of the bit in the second bit sequence after encryption being decoded is lower than the probability of the bit in the first bit sequence without encryption being decoded, and thus the probability of the false alarm generated by decoding the second sequence is lower than the probability of the false alarm generated by decoding the first sequence.

Further, the above encryption method for changing the first sequence of bits further includes:

Wherein the symmetric encryption formula may include: DES encryption formula, AES encryption formula, SM4 encryption formula, and the like.

The DES encryption formula is a block algorithm that encrypts and decrypts data in 64-bit blocks. The key length is 56 bits, and is composed of 8 bytes, and the 8 th bit of each byte is used as parity. The key may be any 56 bit block and may be changed at any time, with few 56 bit blocks being considered weak ciphers that need to be avoided in use.

The AES encryption formula is an iterative block encryption using a substitution/permutation network (spn) that performs an encryption operation on a 128-bit block of data. In encryption, first, input 128-bit data is arranged into a 4 × 4 byte matrix, and then operations of 10 (128-bit key), 12 (192-bit key), and 14 (254-bit key) rounds are performed according to different key lengths.

The SM4 encryption formula is an iterative block cipher algorithm. The information block length of the algorithm is 128 bits. Both the encryption algorithm and the key expansion algorithm adopt 32-bit nonlinear iterative structures. The SM4 data decryption and data encryption algorithm structure is the same, except that the use sequence of the sub-ciphers is reversed, and the decryption sub-key is the reverse sequence of the encryption sub-key.

Further, the above-mentioned manner of changing the first sequence of bits by the encryption manner further includes:

The asymmetric encryption formula is as follows:

M^E＝C(mod P)，

Optionally, in order to reduce the false alarm rate of decoding and improve the accuracy of decoding, when encoding, E in the above asymmetric encryption formula may further satisfy the following condition:

1<E<(P-1)，

and is

Delta. the_RNTIAnd the value of the Radio Network Temporary Identifier (RNTI) is M, E, C, P and H which are positive integers.

The mod operation being a modulo operation, e.g. a^(p-1)1(mod p) denotes that the remainder of dividing the (p-1) power of a by p is equal to 1. Then the asymmetric encryption algorithm M^EC (mod P) denotes the remainder of the value of the last H bits of the fourth bit sequence equal to the value of the last H bits of the third bit sequence raised to the power E divided by the prime number P.

Further, M is a value of the last H bits of the second bit sequence, the H bits being the number of bits of the radio network temporary identifier RNTI, and for example, if the length of RNTI is 16 as specified in NR, H is 16.

The prime number P is a pre-configured prime number, can be specified by a communication protocol or configured by a high-level signaling or a physical-level signaling, and has a value known to a transmitting end and a receiving end. Prime number P is a fixed value if specified by the communication protocol; the prime number P may be periodically changed if configured by higher layer signaling or physical layer signaling. Optionally, in an actual polar coding application, whether the value of the prime number P is appropriate or not is associated with the length of the configured RNTI. For example, in an NR system, P takes the value 65537, which is 2¹⁶+1, the last 16 check bits of the interleaved sequence in NR can be encrypted exactly.

The above asymmetric encryption mode shows that the accuracy of decoding is the highest and the decoding efficiency is the fastest through multiple simulation results, and the specific simulation result is placed on the decoding side for description.

Optionally, the asymmetric encryption algorithm further includes:

M*E＝C(mod P)；

wherein, P is a prime number, and E satisfies the following conditions: 0< E < P, and calculating the modulo element D of E with respect to P: ED mod P is 1.

Corresponding to the asymmetric decryption algorithm:

C*D＝M(mod P)。

the above (E, P) is regarded as a public key, and the (D, P) is regarded as a private key, and the plaintext M is encrypted and decrypted by the following rule to obtain C:

for example: p65537 and E RNTI, and the modulo element D of E with respect to P is found by the extended euclidean algorithm.

The last 16 bits of crc are marked m, the encryption information of m is marked c, and the information scrambled by c and RNTI is marked n.

The transmitting end uses the above asymmetric encryption algorithm, and performs encryption and decryption, where E is RNTI, and P is 65537, or P is 65537, and RNTI is 9575, and E is 9575, and D is 63392.

Optionally, the asymmetric encryption algorithm further includes:

and (E, P) is regarded as a public key, and (D, P) is regarded as a private key, and the plaintext M is encrypted and decrypted by adopting the following rules to obtain C:

m × E ═ C (mod P); v/encryption of the content of the file,

the P2 n, E satisfies the condition that E is coprime with P, and 1< E < P.

The corresponding decryption is:

calculating E a modulo element D with respect to P: ED mod P is 1, i.e., ED + k P is 1.

C*D＝M(mod P)；

The specific scheme for reducing the false alarm of the RNTI conflict by the asymmetric encryption algorithm is as follows:

let P2 ^16 ^ 65536 and E ^ RNTI |1, find the modulo inverse element D of E with respect to P by the extended euclidean algorithm.

Encryption and scrambling at a sending end:

let E equal RNTI, P equal 65536

Descrambling and decrypting at a receiving end:

let E be RNTI; p65536, D is obtained by using an extended euclidean algorithm;

then crc check is performed.

For example, when P is 65536 and RNTI is 9575, E is RNTI |1 is 9575 and D is 9815.

It should be understood that: when n <16, a segmented encryption manner may be used, for example, n is 4, each segment is encrypted with 4 bits long, and E _ i (RNTI > 4 |1& (1 < 4 × (i +1) -1) may be made, where i is 0, 1, 2, 3.

The second method comprises the following steps: the manner of sequence transformation may further include:

Here, the above-described encoding scheme is linear encoding, and the encoding scheme used is not limited to encoding schemes such as convolutional codes, Turbo codes, Low Density Parity Check (LDPC) codes, Cyclic Redundancy Check (CRC) codes, Reed-Muller (RM) codes, and cyclic codes.

And thirdly, interleaving the first bit sequence by the sending terminal to obtain a second bit sequence with changed position.

Here, the position of the bit in the second bit sequence is different from the position of the bit in the first bit sequence, mainly considering the reduction of the decoding error probability by means of position transformation, for example: by converting the low reliability position in the first sequence, which is often easily decoded, to a high reliability position, which is not easily decoded.

Specific interleaving may include row-column interleaving, and the like. Examples are as follows: the first sequence includes: (0101) interleaving the first sequence is as follows: the second sequence includes: (1010) the interleaving process is as follows: the sequence is read row by row from left to right, and the second sequence of outputs may be output by column, i.e. the second sequence of outputs may be: (1010).

When polar coding is performed by the above-mentioned sequence conversion method 10^-4～10^-3False alarm probability (FAR) caused by magnitude of RNTI collision is reduced to 10^-6The following.

The above coding method continues as follows:

404. and the sending end scrambles the second bit sequence by using the radio network temporary identifier RNTI to obtain a third bit sequence.

RNTI, an identity that is a different UE within signal information between the UE and the eNB.

It is to be appreciated that scrambling the second bit sequence using one of the plurality of RNTIs is a process of bitwise xoring the last (e.g., last 16) check bits of the first bit sequence using one of the plurality of RNTIs. The bit sequence after completing RNTI scrambling is referred to as a third bit sequence.

Specifically, the transmitting end configures the plurality of RNTIs.

The plurality of RNTIs may be existing RNTI values, or may be a plurality of RNTI values generated, and one RNTI is selected from the generated plurality of RNTI sets to scramble the second bit sequence.

The sending end sends configuration information to the receiving end, and the receiving end receives the configuration information from the sending end, wherein the configuration information is used for indicating the RNTIs.

Here, the configuration information may be transmitted periodically or non-periodically, and the present application is not limited thereto. The receiving end can obtain the plurality of RNTIs according to the configuration information for use in subsequent receiving DCI.

Optionally, the above mentioned procedure of the configuration of the sending end may also configure the RNTI according to the above rule, and store the RNTI in the sending end and the receiving end for standby.

It should be understood that the set of RNTIs is described in two ways below:

the first method is as follows: the existing RNTI value sets are as in table 1 below, and one RNTI is selected from the following RNTI values for scrambling in the following manner:

TABLE 1

The RNTI is a 16-bit sequence; secondly, it can be seen that the value of P-RNTI is FFFE, the value of SI-RNTI is FFFF, and the value of M-RNTI is FFFD, which is common to all terminal devices.

P-RNTI: the Paging RNTI is used for analyzing Paging information and corresponds to a Paging PCCH;

SI-RNTI: represents System Information RNTI, which is used for transmission of SIB Information (i.e., System Information), corresponding to BCCH;

RA-RNTI: the RNTI of the Radom Access is used for responding to the PRACH and corresponds to the DL-SCH of the RACH Response;

C-RNTI: cell RNTI is used for transmitting service information of UE;

T-CRNTI: the Temporary C-RNTI is used in RACH mainly and corresponds to Random Access Response Grant in PUSCH and a Random Access process message 3; a message in PDSCH;

SPS-C-RNTI: semi persistent Scheduling C-RNTI, used for Semi persistent Scheduling PDSCH transmission;

TPC-PUCCH-RNTI: the system represents Transmit Power Control-Physical Uplink Control channel-RNTI which is used for analyzing PUCCH Uplink Power Control information;

TPC-PUSCH-RNTI: the system represents Transmit Power Control-Physical Uplink SharedChannel-RNTI which is used for analyzing PUSCH Uplink Power Control information;

M-RNTI: the MBMS RNTI, Multimedia Broadcast Multicast service RNTI;

and in the second mode, the sending end generates a new RNTI value set.

First, a plurality of RNTIs configured by a transmitting end have the following features:

the RNTI is one of a plurality of configured RNTIs, the plurality of configured RNTIs have the same A bits, the A bits correspond to the same bit positions in each RNTI in the plurality of RNTIs, the A bits have a first Hamming weight, wherein the first Hamming weight is the minimum value of Hamming weights of H rows, the H rows correspond to the H rows in N rows of a generation matrix of polarized Polar, the H bits are the number of bits of each RNTI in the plurality of configured RNTIs, A is more than or equal to 1 and is less than or equal to H and is less than or equal to N, and A, H and N are positive integers.

Second, the RNTI is one of a plurality of configured RNTIs, the RNTIs further have the same F bits, the F bits correspond to the same bit position in each RNTI in the plurality of RNTIs, the F bits have a second hamming weight, the second hamming weight is greater than the first hamming weight, and the second hamming weight is less than a third hamming weight, wherein the third hamming weight is the hamming weight of the remaining bits of the H bits, except the a bits and the F bits, corresponding to the remaining rows of the N rows of the generation matrix of polarized Polar, F is greater than or equal to 1 and less than or equal to H, a + F is less than or equal to H, and F is a positive integer.

The first and second types of configurations for the plurality of RNTIs may be combined with each other, the first and second types of configurations jointly determine the plurality of RNTIs, or the plurality of RNTIs may be configured in the first type of configuration, or the plurality of RNTIs may be configured in the second type of configuration.

The above-described specific configuration of the plurality of RNTIs will be described in detail in the following embodiments.

406. And the sending end carries out polarized Polar coding on the third bit sequence to obtain a coded bit sequence.

The sending end encodes the third bit sequence according to an encoding formula of Polar codes to obtain an encoded bit sequence, wherein the encoding formula is as follows:

the above-mentioned

Is a coded bit sequence with a length of N;

the above-mentioned

Is a bit sequence to be coded generated according to the third bit sequence, and the length is N;

the G is_NIs an N × N matrix, and

wherein the content of the first and second substances,

is defined as log₂N matrices F₂The kronecker product of (a), the matrix

408. And the sending end sends the coded bit sequence.

Further, the encoding method may further include:

410. and carrying out rate matching and Quadrature Phase Shift Keying (QPSK) modulation on the coded bit sequence, and then sending the coded bit sequence to a receiving end.

The coded bit sequence is sent to the receiving end after the processing procedures such as rate matching, QPSK modulation and the like as shown in fig. 2.

The coded bit sequence also needs to be sub-block interleaved before rate matching, and the method of bit interleaving is not limited in the application. For example, row interleaving may be used, or other interleaving methods.

Correspondingly, as shown in fig. 5, the receiving end mainly includes the following processing flows:

500. the receiving end obtains a sequence to be decoded.

502. The receiving end generates L first bit sequences according to the sequence to be decoded, wherein L is an integer greater than 1;

the receiving end receives the sequence to be decoded from the transmitting end, and outputs L candidate decoding paths through demodulation, rate de-matching and SCL decoding, wherein each candidate path comprises a first bit sequence.

504. The receiving end uses G configured Radio Network Temporary Identifiers (RNTIs) to descramble the L first bit sequences to obtain L second bit sequences, wherein J identical bit sequences in the L second bit sequences correspond to J different RNTIs, G is an integer larger than 1, and J is an integer and is larger than or equal to 2.

And the receiving end uses the configured RNTIs to perform descrambling attempts on the candidate decoding paths one by one.

It should be understood that after attempting to descramble bit sequences on multiple candidate decoding paths with multiple different RNTIs, at least 2 larger identical bit sequences are obtained. Wherein RNTIs corresponding to the same bit sequence and used for descrambling are different.

For the process of configuring multiple RNTIs, please refer to the scrambling process of step 404 in the above embodiment of the encoding method, where multiple RNTIs are used for descrambling.

The RNTIs are configured RNTIs, the configured RNTIs have the same A bits, the A bits correspond to the same bit positions in each RNTI in the RNTIs, the A bits have first Hamming weights, the first Hamming weights are the minimum value of the Hamming weights of H rows, the H rows correspond to the H rows in N rows of a generation matrix of polarized Polar, the H bits are the number of bits of each RNTI in the configured RNTIs, A is larger than or equal to 1 and smaller than or equal to H and smaller than or equal to N, and A, H and N are positive integers.

Further, the RNTIs are configured RNTIs, the configured RNTIs further have F same bits, the F bits correspond to the same bit positions in each RNTI in the RNTIs, the F bits have a second Hamming weight, the second Hamming weight is greater than the first Hamming weight, and the second Hamming weight is less than a third Hamming weight, wherein the third Hamming weight is the Hamming weight of the remaining rows of the N rows of the generation matrix of the polarized Polar to which the remaining bits of the H bits other than the A bits and the F bits correspond, where 1 ≦ F ≦ H, A + F ≦ H, and F is a positive integer.

506. And the receiving end performs sequence de-conversion corresponding to the J second bit sequences and the J different RNTIs to obtain J third bit sequences.

The various sequence transformation methods mentioned in step 402 of the above-mentioned encoding process are performed with corresponding de-sequence transformation methods, such as: encryption is adopted in the encoding process, so that a corresponding decryption mode is adopted; if the coding process adopts coding, the corresponding coding is adopted for decoding; if the encoding process adopts interleaving, a de-interleaving mode is adopted.

It should be understood that for the same bit sequence after descrambling, different manners of de-sequence transformation are employed.

In a first way,

It should be understood that the decryption corresponding to the J different RNTIs can be understood as: because the bit sequences descrambled by the RNTIs are the same, but the same bit sequence is descrambled by adopting different RNTIs, the corresponding decryption formulas are different when the RNTIs are different in the decryption process at the receiving end, and the same bit sequence after descrambling is recovered by different decryption formulas, so that the correct bit sequence can be obtained, and the bit sequence after passing the verification is output through CRC verification.

Further, the receiving end decrypts the L second bit sequences respectively according to an asymmetric decryption formula, so as to obtain L third bit sequences.

The asymmetric decryption formula is as follows:

C^D＝M(mod P),

(E×D)mod Q＝1

Optionally, E satisfies the following condition:

1<E<(P-1)，

and is

And the decryption of the descrambled bit sequence is to decrypt the descrambled decoding sequence respectively by a D value calculated by each RNTI in the configured RNTIs according to an asymmetric decryption algorithm. It should be understood that the receiving end needs to decrypt the descrambled sequence one by using the plurality of D values, according to the principle of an asymmetric encryption algorithm, correct decryption can be performed only by solving the D value by using the RNTI which is the same as the RNTI used when the transmitting end scrambles, and if the RNTIs used when the transmitter scrambles are different, decryption formulas corresponding to different RNTIs are adopted.

Further, the J second bit sequences are decrypted respectively according to the symmetric decryption formulas corresponding to J different RNTIs, so as to obtain J third bit sequences.

The specific symmetric decryption formula corresponds to the symmetric encryption formula during encoding.

The above mentioned encryption formulas are decrypted by using corresponding decryption formulas, such as asymmetric decryption formulas and symmetric decryption formulas.

It should be noted that the decryption formulas for different RNTIs are also different.

And in a second mode, the receiving end performs J different decoding corresponding to the RNTI to the J second bit sequences to obtain J third bit sequences, wherein a bit value in the third bit sequence is different from a bit value in the second bit sequence, the decoding is performed according to a coding mode, and the coding mode includes any one of the following: convolutional codes, Turbo codes, low density parity check, CRC, reed-muller RM, cyclic or Polar codes.

And thirdly, the receiving end performs J-piece de-interleaving corresponding to J-piece RNTIs on the J second bit sequences to obtain J position-transformed third bit sequences.

The three types of sequence de-conversion modes are different in RNTI (radio network temporary identifier) adopted during descrambling and different in sequence de-conversion mode. The J second bit sequences are the same bit sequences obtained after descrambling through different RNTIs, and the false alarm rate of the RNTIs can be reduced through sequence conversion of solutions corresponding to the different RNTIs. For example: 2 identical descrambled bit sequences, sequence 1 adopts sequence conversion corresponding to RNTI1, sequence 2 adopts sequence conversion corresponding to RNTI2, sequence 1 after sequence conversion is different from sequence 2 after sequence conversion corresponding to RNTI2, and CRC check of 508 below shows that sequence 1 after sequence conversion passes CRC check, sequence 2 after sequence conversion does not pass CRC check, and therefore the probability of false alarm caused by that two descrambled bit sequences pass CRC check is reduced. 508. And the receiving end carries out Cyclic Redundancy Check (CRC) check on the J third bit sequences, and the third bit sequences passing the CRC check are used as output bit sequences.

510. The receiving end outputs the output bit sequence.

The receiving end finally outputs a candidate decoding path which is correctly decrypted and passes through the CRC check, the candidate decoding path is a decoding path which is finally output, and the bit sequence output on the decoding path is the correct bit sequence.

In the encoding method disclosed in the above embodiment of the present application, first, a sending end obtains a first bit sequence including information bits and cyclic redundancy check bits; secondly, the sending end interweaves the first bit sequence to obtain a second bit sequence; thirdly, the sending end encrypts the second bit sequence to obtain a third bit sequence; then, the sending end carries out RNTI scrambling on the third bit sequence to obtain a fourth bit sequence; then, the sending end carries out polarized Polar coding on the fourth bit sequence to obtain a coded bit sequence; and finally, the transmitting end transmits the coded bit sequence. Correspondingly, the receiving end sequentially executes decoding, RNTI descrambling, decryption and CRC check processes, and finally outputs a decoded bit sequence. The coding and decoding method can quickly and accurately recover the correct bit sequence, thereby reducing the false alarm probability during decoding, improving the decoding accuracy and greatly improving the decoding performance.

The following describes the simulation result obtained by the above encoding and decoding method:

in the embodiment of the present application, the RNTI collision false alarms of the coding and decoding method in the prior art and the information bit sequences with different aggregation dimensions and Downlink Control Information (DCI) sizes are simulated, and table 2 below shows the values of DCI sizes used for simulation with different aggregation dimensions and DCI sizes.

TABLE 2

Next, a comparison table of the number of false alarm times of RNTI collision occurring between the prior art when the aggregation dimension is 2 and the DCI size is 80 and the coding and decoding method proposed in the present application will be shown to verify the false alarm reduction effect of the proposed coding and decoding method 200. Setting the channel type as Additive White Gaussian Noise (AWGN) channel, and the information bit length is 80 (namely DCI size is 80)The length of the cyclic redundancy check bit is 24, the length of the RNTI is 16, and the simulation times are 10⁷. It is assumed that four RNTIs are allocated to the transmitter, where RNTI0 is 10010101100111, RNTI1 is 10010101100110, RNTI2 is 10010101101101, and RNTI3 is 10010111001101. The transmitting side scrambles by using the RNTI0, and the receiving side descrambles by using the RNTI0, the RNTI1, the RNTI2 and the RNTI 3. Assuming that RNTI0 used when the transmitting end scrambles is called a correct RNTI for the descrambling process, other RNTIs are called erroneous RNTIs.

Table 3 below is a comparison table of the number of times of RNTI collision false alarms when using wrong RNTIs, i.e., RNTI1, RNTI2, and RNTI3, to descramble the codes by using the coding and decoding method proposed in the prior art and the present application.

TABLE 3

The header AL2DCI80 in table 3 represents a bit sequence with an aggregation dimension of 2 information bits length of 80; the SNR in the first column is the signal-to-noise ratio, the higher the signal-to-noise ratio is, the better the channel quality is represented, and table 3 shows the comparison of the false alarm times of RNTIs under different channel qualities; the second row of BLER is the block error rate of the prior art, which can represent the decoding performance, and the comparison table 3 is the comparison of the false alarm probability of RNTI collision performed under the condition of the same decoding performance, as can be seen from the difference between the BLER of the second row of prior art and the block error rate value corresponding to BLER _ en of the coding and decoding method provided by the present application; the third column, the fourth column and the fifth column are respectively 10 times of simulation when the prior art uses RNTI1, RNTI2 and RNTI3 for descrambling⁷The number of times of RNTI false alarms under the condition is represented by using the fifth column and the sixth row number 3969 as an example, the number of times of simulation is 10 when the signal to noise ratio is-4, the block error rate is 0.8597 and the descrambling time is-4 when the RNTI3 is used for descrambling⁷3969 times of RNTI collision false alarms, the probability of the RNTI collision false alarm is 3.969 × 10^-4(ii) a The sixth column BLER _ en is the block error rate of the coding and decoding method proposed in this application; the seventh column, the eighth column and the ninth column respectively represent that when the coding and decoding method provided by the application uses RNTI1, RNTI2 and RNTI3 to descramble, the simulation times are 10⁷Number of RNTI false alarms occurring under conditionsThe ninth column, sixth row, numeral 7, is taken as an example to represent that the signal-to-noise ratio is-4, the block error rate is 0.8597, and the simulation times are 10 when descrambling is performed by using the RNTI3⁷When there are 7 RNTI collision false alarms, the probability of the RNTI collision false alarm is 7 × 10^-7(ii) a By RNTI conflict false alarm probability 3.969 10^-4，7*10^-7As can be seen from comparison with other values in the three, four, and five columns and the seven, eight, and nine columns in table 2, the coding and decoding method 200 provided in the present application can greatly reduce the collision false alarm probability of the RNTI.

In addition to the example in table 3, the following table also shows a comparison table of the number of false alarm times of RNTI collision occurring between the prior art when the aggregation dimension is 1 and the DCI size is 40 and the coding and decoding method proposed in the present application, so as to verify the false alarm reduction effect of the proposed coding and decoding method 200. The comparison table is identical to the comparison table 2 except that the aggregation dimension is 1, and the information bit length is 40 (i.e., the DCI size is 40).

TABLE 4

The meanings of the columns in Table 4 are the same as those in Table 3, and are not described in detail. Wherein, the third column, the fourth column and the fifth column are respectively 10 times of simulation when the RNTI1, the RNTI2 and the RNTI3 are used for descrambling in the prior art⁷The number of false alarms of RNTI under the condition, taking the fourth column and the fourth row number 1463 as an example, represents that the signal to noise ratio is-3, the block error rate is 0.7747 and the simulation number is 10 when the RNTI2 is used for descrambling⁷If 1463 false alarms of RNTI collision occur, the probability of false alarm of RNTI collision is 1.463 x 10^-4(ii) a The seventh column, the eighth column and the ninth column respectively represent that when the coding and decoding method provided by the application uses RNTI1, RNTI2 and RNTI3 to descramble, the simulation times are 10⁷The number of times of RNTI false alarms under the condition, taking the fourth row number 4 of the eighth column as an example, represents that the signal-to-noise ratio is-3 and the block error rate is 0.7747 when the RNTI2 is used for descrambling, and the simulation is carried outNumber of times is 10⁷If 4 RNTI collision false alarms occur under the condition(s), the probability of the RNTI collision false alarm is 4x 10^-7(ii) a False alarm probability of RNTI conflict 1.463 x 10^-4，4*10^-7As can be seen from comparison with other values in the three, four, and five columns and the seven, eight, and nine columns in table 3, the coding and decoding method 200 provided in the present application can greatly reduce the collision false alarm probability of the RNTI.

Tables 3 and 4 are only two examples of all simulation comparisons in the present application in table 2, and other examples are not described in detail. As can be seen from tables 3 and 4, the coding and decoding method provided by the present application can quickly and accurately select the correct decoding path by adding the step of asymmetric encryption and decryption in the prior art, and accurately recover the first bit sequence through the correct decoding path, so that the false alarm probability during decoding is 10^-4Left and right are reduced to a theoretical value of 10^-7And nearby, the decoding efficiency is improved, and the decoding performance is improved.

The encoding and decoding method 400 proposed in the present application is explained in detail above. A method of configuring the plurality of RNTIs according to a specific rule mentioned in the above-mentioned step 404 will be described in detail below.

The sending end needs to satisfy the following characteristics for a plurality of RNTIs configured by the receiving end:

each of the plurality of RNTIs includes L bits corresponding to L rows of N rows of a generator matrix of a polarization code, each of the N rows having a hamming weight, the plurality of RNTIs having identical I bits corresponding to identical bit positions in each of the plurality of RNTIs, the I bits corresponding to I rows of M rows of the L rows having a first hamming weight. Wherein the first Hamming weight is the minimum of the Hamming weights of the L rows, I is greater than or equal to 1 and less than or equal to M and less than or equal to L and less than or equal to N, and N, L, I and M are integers.

It is to be understood that the RNTI comprises L bits, that is to say the RNTI is L in length. Wherein, the length of the RNTI can be specified by the system. For example, in NR, the control channel is polar-coded, and the length of RNTI is specified to be 16.

Further, the plurality of RNTIs also have J identical bits corresponding to identical bit positions in each of the plurality of RNTIs, the J bits corresponding to J of the P rows having the second hamming weight among the L rows. Wherein the second Hamming weight is greater than the first Hamming weight, and the second Hamming weight is less than the Hamming weight of the other rows except the I rows and the P rows, J is greater than or equal to 1 and less than or equal to P < L, I + J < L, and J is an integer.

Still further, the RNTIs also have R identical bits corresponding to identical bit positions in each RNTI of the RNTIs, the R bits corresponding to R rows of Q rows having a third Hamming weight among the L rows, the third Hamming weight being greater than the second Hamming weight and less than the Hamming weights of the remaining ones of the L rows other than the I row, the P row and the Q row, R being 1. ltoreq. R.ltoreq.L, I + J + R < L, R being an integer.

In other words, the transmitting end configures a plurality of RNTIs for the receiving end, and the RNTIs have the same length and are denoted as L. Therefore, it can also be said that each RNTI includes L bits corresponding to L rows of the N rows of the generation matrix of the polar code. Each of the L rows of the generator matrix has a hamming weight, and the L rows correspond to a plurality (possibly equal to or less than L) of hamming weights. The plurality of hamming weights are large and small. The RNTIs are required to ensure that the bit values of the bit positions corresponding to the row having the minimum hamming weight are the same. Alternatively, the values of the bits of the bit positions corresponding to all the rows of the minimum hamming weight may be the same. Alternatively, the bit values of the bit positions corresponding to some of the lines of the minimum hamming weight may be the same. On the basis, the bit values of the bit positions corresponding to part of or all of the rows with the second smallest hamming weight can be further ensured to be the same. And by analogy, the method can also be extended to the next small row or extended continuously according to the rule.

According to the technical scheme of the application, for each DCI interval of each aggregation level, if a more preferable configuration is considered, the number of RNTIs available for allocation to the receiving end is generally 16 or 32. Of course, if the configuration requirement is reduced (e.g., only the row with the smallest hamming weight is guaranteed to correspond to the same bit position in the RNTI as the transmitting end, and the next smallest row or the next smallest row of hamming weight is not guaranteed. The technical idea of the technical solution of the present application is that a person skilled in the art can easily think of many possible configurations, which are not listed here.

The embodiment of the application also provides another method for configuring the RNTI.

Firstly, a sending end selects M bits according to the length N of an RNTI (radio network temporary identifier) required to be configured, and generates a plurality of first bit sequences.

Wherein M is more than or equal to 1 and less than or equal to N, and M and N are integers. And N is the length of RNTI. In particular, the value of N may be defined by the communication system. For example, in LTE and NR, the length of RNTI is 16, i.e., N ═ 16.

Each first bit sequence is a random sequence. The first bit sequence consists of 0 and 1. Hereinafter, the first bit sequence is denoted as S.

Secondly, the sending end carries out linear coding on the plurality of first bit sequences to obtain a plurality of second bit sequences.

Here, when the first bit sequence is linearly encoded, the encoding method used is not limited to the encoding methods such as convolutional code, Turbo code, Low Density Parity Check (LDPC) code, Cyclic Redundancy Check (CRC) code, Reed-Muller (RM) code, and cyclic code.

Specifically, the process of linearly encoding the first bit sequence can be expressed by equation (2):

RNTI＝S·G (2)

wherein G is a coding matrix of size M × N, and the operation of linear coding is performed in the binary field GF (2).

It will be appreciated that the first bit sequence S is a random sequence generated by M bits, and thus, all possibilities to traverse the first bit sequence S will be 2^MOne possibility, namely, in step 310, 2 is generated^MA first bit sequence. And performing linear coding on each first bit sequence S and the coding matrix G to obtain a second bit sequence with the length of N. Thus, 2^MThe first bit sequence is respectively subjected to linear coding through a coding matrix G to obtain 2^MA second bit sequence. The 2^MA second bit sequence and the 2^MThe first bit sequences are in one-to-one correspondence, and each second bit sequence is obtained by linearly coding the corresponding first bit sequence. Each second bit sequence is an RNTI, thus yielding 2^MAnd (4) each RNTI.

And thirdly, the sending end outputs an alternative RNTI set.

2 to be generated^MThe second bit sequence output is the alternative RNTI set.

The alternative RNTI set is an alternative set which can be used as the configuration RNTI. In other words, in a scenario where RNTI configuration is required, a plurality of RNTIs may be selected from the candidate RNTI set.

As an example, the process of generating the alternative RNTI set is described below as a linear coding of the first bit sequence with a CRC code.

First, assume that N is 16. Choose M ═ 8, and choose polynomial g _8 (x).

The lengths of the information field and the check field can be arbitrarily selected according to the basic principle of the CRC code. For example, after the M-bit information code, the check code of R bits is concatenated to obtain the CRC code with length N. For a given (N, M) code, it can be shown that there is a polynomial g (x) with the highest power N-K-R. The CRC check code of the K-bit information code can be generated from g (x), which is called the generator polynomial of this CRC code. The generator polynomial may be agreed upon by the sender and receiver. For example, g (x) ═ x⁸+x²+1, or, g (x) ═ x⁸+x⁵+x⁴+1。

Here, for the first bit sequence S of 8 bits, the CRC check code of 8 bits of the first bit sequence S can be calculated 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 the 8 bits of the first bit sequence S to obtain a 16-bit sequence. These 16-bit sequences can be referred to as RNTIs.

Optionally, after the 8-bit CRC check code is concatenated with the 8 bits of the first bit sequence S to obtain 16 bits, the 16 bits may also be interleaved, and then the interleaved sequence is used as the RNTI.

Likewise, all possibilities to traverse the first bit sequence will have 2⁸And (4) carrying out the following steps. This 2⁸And calculating the possible first bit sequences according to the method to obtain the corresponding CRC check codes. And each CRC code is cascaded with the corresponding first bit sequence to obtain a second bit sequence. In total will yield 2⁸A second bit sequence. This 2⁸The second bit sequence may serve as an alternative RNTI set.

The above steps are processes of configuring the RNTI by the transmitting end, and are divided into several steps for convenience of description. In a specific implementation, the above steps may also be combined into one step, and used to generate the alternative RNTI set.

The transmitting end transmits configuration information to the receiving end, and the receiving end receives the configuration information from the transmitting end.

Wherein the configuration information is used for indicating L RNTIs in the multiple candidate RNTI sets. Since the transmitting end usually configures a plurality of RNTIs for the receiving end, L is an integer greater than or equal to 2. Of course, the value of L may be defined by the communication system, or may also be determined by the sending end as needed. The L RNTIs may be arbitrarily selected from the candidate RNTI set.

Similarly, as an alternative scheme, the RNTI sets with the above characteristics can be stored at the sending end and the receiving end for standby, and the sending end does not need to generate and send the RNTI sets to the receiving end.

And fourthly, the transmitting end scrambles the bit sequence to be transmitted by using one RNTI in the L RNTIs to obtain the scrambled bit sequence.

Fifthly, the sending end sends the scrambled bit sequence to the receiving end.

And sixthly, the receiving end descrambles the bit sequence to be descrambled by using the L RNTIs.

When the receiving end descrambles the RNTIs, the L RNTIs are used for trying one by one. The processes of RNTI scrambling and RNTI descrambling are the same as the scrambling process, and are not described again.

The scrambling method of the RNTIs mainly utilizes linear coding to enlarge the Hamming distance between the RNTIs and plays a role in reducing false alarm of the RNTIs.

In addition, in the present application, the coding may be performed in a coding manner, in combination with a scrambling manner of the RNTI and the sequence transformation, the RNTI is descrambled during decoding, and then the decoding process is completed by performing the sequence de-transformation, and the coding process in fig. 4 and the decoding process in fig. 5 have been described in detail in combination with the sequence transformation and the scrambling process of the RNTI in the above embodiments, and will not be described herein again.

The above embodiments of the present application disclose a coding and decoding method. The method comprises the following steps: firstly, a sending end acquires a first bit sequence containing information bits and cyclic redundancy check bits; secondly, the sending end interweaves the first bit sequence to obtain a second bit sequence; thirdly, the sending end encrypts the second bit sequence to obtain a third bit sequence; then, the transmitting end carries out RNTI scrambling on the third bit sequence to obtain a fourth bit sequence; then, the sending end carries out polarized Polar coding on the fourth bit sequence to obtain a coded bit sequence; and finally, the transmitting end transmits the coded bit sequence. Correspondingly, the receiving end sequentially executes decoding, RNTI descrambling, decryption and CRC check processes, and finally outputs a decoded bit sequence. The coding and decoding method can rapidly and accurately recover the correct bit sequence, further reduce the false alarm probability during decoding, improve the accuracy of decoding and greatly improve the decoding performance.

One of the encoding and

decoding methods

400 and 500 provided by the present application is described in detail above. The following describes a communication apparatus provided in the present application.

Fig. 6 is a schematic block diagram of an encoding apparatus 60 provided herein. As shown in fig. 6, the encoding apparatus 60 includes a receiving unit 600, a sequence transforming unit 602, a scrambling unit 604, an encoding unit 606, and a transmitting unit 608.

The receiving unit 600 is configured to obtain a first bit sequence, where the first bit sequence includes: k information bits and X Cyclic Redundancy Check (CRC) bits, wherein K and X are positive integers;

a sequence transformation unit 602, configured to perform sequence transformation on the first bit sequence to obtain a second bit sequence;

a scrambling unit 604, configured to scramble the second bit sequence using a radio network temporary identifier RNTI, to obtain a third bit sequence after scrambling;

an encoding unit 606, configured to perform Polar encoding on the third bit sequence to obtain an encoded bit sequence;

a transmitting unit 608, configured to transmit the coded bit sequence.

The apparatus 60 and the transmitting end in the method 400 completely correspond, and corresponding units of the apparatus 60 are respectively configured to execute the method 400 or corresponding steps and/or flows executed by the transmitting end in each embodiment thereof.

Further, the sequence transformation unit performs the sequence transformation in the following ways.

The first method is as follows: the sequence transformation unit is specifically configured to:

Further, the sequence transformation unit is specifically configured to:

and encrypting the first bit sequence according to an asymmetric encryption formula to obtain a second bit sequence.

The asymmetric encryption formula may be as follows:

M^E＝C(mod P)，

Further, the sequence transformation unit is specifically configured to:

In a second aspect, the sequence transformation unit is specifically configured to:

The third mode is that the sequence transformation unit is specifically configured to: specifically, the method is used for interleaving the first bit sequence to obtain a second bit sequence after position change.

Further, the scrambling unit 604 is further configured to configure a plurality of RNTIs, where the plurality of RNTIs have the same a bits, the a bits correspond to the same bit position in each of the plurality of RNTIs, the a bits have a first hamming weight, where the first hamming weight is a minimum value of hamming weights of H rows, the H rows correspond to H rows of N rows of a generation matrix of polarized Polar, the H bits are the number of bits of each of the configured plurality of RNTIs, a is greater than or equal to 1 and less than or equal to H and less than or equal to N, and A, H and N are positive integers.

Further, the scrambling unit 604 is further configured to configure a plurality of RNTIs, where the RNTIs further have F same bits, the F bits correspond to the same bit positions in each of the RNTIs, the F bits have a second hamming weight, the second hamming weight is greater than the first hamming weight, and the second hamming weight is less than a third hamming weight, where the third hamming weight is the hamming weight of the remaining H bits except the a bits and the F bits corresponding to the remaining N rows of the generation matrix of polarized Polar, 1 ≦ F ≦ H, a + F ≦ H, and F is a positive integer.

Referring to fig. 7, fig. 7 is a schematic block diagram of a decoding apparatus 70 provided herein. As shown in fig. 7, the decoding apparatus 70 includes:

a receiving unit 700, configured to obtain a sequence to be decoded;

a processing unit 702, configured to generate L first bit sequences according to a sequence to be decoded, where L is an integer greater than 1;

a descrambling unit 704, configured to descramble the L first bit sequences by using G configured radio network temporary identifiers RNTI, to obtain L second bit sequences, where J identical bit sequences in the L second bit sequences correspond to J different RNTIs, G is an integer greater than 1, and J is an integer and greater than or equal to 2;

a deserializing unit 706, configured to perform deserializing corresponding to the J different RNTIs on the J second bit sequences to obtain J third bit sequences;

a checking unit 708, configured to perform cyclic redundancy check CRC check on the J third bit sequences, and use the third bit sequences that pass the CRC check as output bit sequences;

a transmitting unit 710, configured to transmit the output bit sequence.

The receiving ends in the apparatus 70 and the method 500 completely correspond, and the corresponding units of the apparatus 70 are respectively used for executing the corresponding steps and/or processes executed by the receiving end in the method 500 or its embodiments.

Further, the deserializing unit performs the deserializing operation in the following manners.

The first mode is that the sequence decoding transformation unit is specifically configured to decrypt the J second bit sequences respectively corresponding to the J different RNTIs to obtain J third bit sequences, where a bit value in the third bit sequence is different from a bit value in the second bit sequence.

Further, the deserializing unit is specifically configured to: and respectively decrypting the J second bit sequences according to J asymmetric decryption formulas corresponding to different RNTIs to obtain J third bit sequences.

Optionally, the asymmetric decryption formula is as follows:

C^D＝M(mod P),

the D satisfies the following condition:

(E×D)mod Q＝1

Further, the sequence de-converting unit is specifically configured to decrypt the J second bit sequences respectively according to symmetric decryption formulas corresponding to J different RNTIs, so as to obtain J third bit sequences.

In a second manner, the sequence decoding transforming unit is specifically configured to perform J different decoding corresponding to the RNTIs on the J second bit sequences to obtain J third bit sequences, where bit values in the third bit sequences are different from bit values in the second bit sequences, and the decoding includes any one of the following: convolutional codes, Turbo codes, low density parity check, CRC, reed-muller RM, cyclic or Polar codes.

The solution sequence transformation unit is specifically configured to: and performing J-different deinterleaving corresponding to RNTIs on the L second bit sequences to obtain L position-transformed third bit sequences.

Further, the deserializing unit is specifically configured to configure a plurality of RNTIs, where the configured RNTIs have a same a bits, the a bits correspond to a same bit position in each of the RNTIs, the a bits have a first hamming weight, where the first hamming weight is a minimum value of hamming weights of H rows, the H rows correspond to H rows of N rows of a generation matrix of polarization Polar, 1 ≦ a ≦ H ≦ N, and N, A and H are positive integers.

Further, the deserializing unit is specifically configured to: configuring a plurality of RNTIs, the configured RNTIs further having F same bits corresponding to same bit positions in each RNTI of the plurality of RNTIs, the F bits having a second Hamming weight that is greater than the first Hamming weight and that is less than a third Hamming weight, wherein the third Hamming weight is the Hamming weight of the remaining rows of the H rows excluding the A rows and the F rows, 1 ≦ F ≦ H, A + F < H, and F is an integer.

Referring to fig. 8, fig. 8 is a schematic block diagram of an encoding apparatus 80 provided in the present application. As shown in fig. 8, the encoding device 80 includes: a transceiver 800 and a processor 802.

A transceiver 800 configured to obtain a first bit sequence, the first bit sequence comprising: k information bits and X Cyclic Redundancy Check (CRC) bits, wherein K and X are positive integers; transmitting the encoded bit sequence according to the processor indication;

a processor 802, configured to perform sequence transformation on the first bit sequence to obtain a second bit sequence; scrambling the second bit sequence by using a Radio Network Temporary Identifier (RNTI) to obtain a third bit sequence; performing polarized Polar coding on the third bit sequence to obtain a coded bit sequence; instructing the transceiver to transmit the encoded bit sequence.

Wherein the processor 802 is configured to perform the method 400 or the steps implemented internally by the transmitting end in the embodiments thereof. For example, processor 800 performs step 402, step 404, or step 406 in fig. 4. The transceiver 800 in the device 800 performs the steps of the method of transmitting or receiving in fig. 4 or embodiments thereof. For example, step 400 and step 408 of transmitting the configuration information to the receiving end in fig. 4 are performed.

Here, the transceiver includes a receiver and a transmitter, and has both a receiving and a transmitting function.

Alternatively, the processor may be a processing device, and the above-mentioned functions of the processor may be partially or entirely implemented by software. When implemented entirely in software, the processing device may include a memory for storing a computer program and a processor that reads from the memory and executes the computer program to perform the corresponding operations and/or procedures of the method of fig. 4 or its embodiments performed by the transmitting end.

In a possible design, when part or all of the processor is implemented by software, the coding device includes a processor, a memory for storing the computer program and located outside the processor, and the processor is connected with the memory through a circuit/wire for reading and executing the computer program stored in the memory.

In one possible design, when part or all of the above functions of the processor are implemented by hardware, the processor includes logic circuitry. The logic circuit has the function of realizing the processor in the method embodiment; an interface circuit, comprising: the input interface circuit and the output interface circuit are used for realizing the input and output functions of the transceiver.

In particular implementations, the processor may be a chip or an integrated circuit.

Referring to fig. 9, fig. 9 is a schematic block diagram of a decoding apparatus 90 provided herein. As shown in fig. 9, the decoding apparatus 90 includes a transceiver 900 and a processor 902.

A transceiver 900 for obtaining a sequence to be decoded; and sending a bit sequence to be output according to the processor indication;

a processor 902, configured to generate L first bit sequences according to a sequence to be decoded, where L is an integer greater than 1; descrambling the L first bit sequences by using G configured Radio Network Temporary Identifiers (RNTIs) to obtain L second bit sequences, wherein J identical bit sequences in the L second bit sequences correspond to J different RNTIs, G is an integer larger than 1, and J is an integer and is larger than or equal to 2; performing sequence de-conversion corresponding to the J different RNTIs on the J second bit sequences to obtain J third bit sequences; performing Cyclic Redundancy Check (CRC) check on the J third bit sequences, and taking the third bit sequences passing the CRC check as output bit sequences; instructing the transceiving unit to transmit the output bit sequence.

The apparatus 90 and the method correspond exactly to the receiving end in fig. 5, and corresponding units of the apparatus 90 are respectively configured to execute corresponding steps and/or processes performed by the receiving end in the method of fig. 5 or its embodiments. The processor 902 is configured to execute the steps implemented internally by the receiving end in the decoding side of fig. 5 or in various embodiments thereof. For example, processor 902 performs steps 502, 504, 506, and 508 of FIG. 5. The transceiver 900 in the apparatus 600 is configured to perform the steps of transmitting or receiving in fig. 5 or its various embodiments. For example, step 500 of receiving the sequence to be decoded from the transmitting end in fig. 5 is performed, or step 510 of transmitting the output bit sequence is performed.

Alternatively, the above-described functions of the processor may be partially or entirely implemented by software. When implemented entirely in software, the processor may include a processor and a memory, the memory storing a computer program that the processor reads from the memory and executes.

In one possible design, when the processor is implemented partly or entirely in software, the memory for storing the computer program is located outside the processor, and the processor is connected to the memory by a circuit/wire for reading and executing the computer program stored in the memory.

In one possible design, when part or all of the above functions of the processor are implemented by hardware, the processor includes: the input interface circuit is used for acquiring a sequence to be decoded; the logic circuit is used for generating L first bit sequences according to a sequence to be decoded, wherein L is an integer greater than 1; descrambling the L first bit sequences by using a configured Radio Network Temporary Identifier (RNTI) to obtain L second bit sequences; performing de-sequence transformation on the L second bit sequences to obtain L third bit sequences; performing Cyclic Redundancy Check (CRC) check on the L third bit sequences, and taking the third bit sequences passing the CRC check as output bit sequences; instructing the transceiving unit to transmit the output bit sequence; and the output interface circuit is used for outputting the output bit sequence.

In the wireless communication system shown in fig. 1, in downlink transmission, a network device is a transmitting end, and a terminal device is a receiving end. In uplink transmission, the terminal device is a sending end, and the network device is a receiving end. The transmitting end described herein may be the transmitting end described in the method corresponding to fig. 4, or a receiving end corresponding to other embodiments. The receiving end may be the receiving end in the method corresponding to fig. 5, or the receiving end corresponding to other embodiments.

The following takes downlink transmission (a sending end is a network device, and a receiving end is a terminal device) as an example to describe the network device and the terminal device provided by the present application.

Referring to fig. 10, fig. 10 is a schematic block diagram of a network device 1000 provided in the present application. As shown in fig. 10, the network device 1000 may be applied to the wireless communication system shown in fig. 1, and has the functions of the transmitting end (e.g., may be a base station) described in the method embodiment of the present application.

The network device 1000 may include one or more radio frequency units, such as a Remote Radio Unit (RRU) 1100 and one or more baseband units (BBUs). The baseband unit may also be referred to as a Digital Unit (DU) 1200. The RRU1100 may be referred to as a transceiver unit, and corresponds to a receiving unit or a sending unit in fig. 6 or fig. 7, or may be a transceiver in fig. 8 or fig. 9. Alternatively, the transceiver unit 1100 may also be referred to as a transceiver, a transceiver circuit, or a transceiver, etc., which may include at least one antenna 1101 and a radio frequency unit 1102. Alternatively, the transceiver unit 1100 may include a receiving unit and a transmitting unit, the receiving unit may correspond to a receiver (or receiver, receiving circuit), and the transmitting unit may correspond to a transmitter (or transmitter, transmitting circuit). The RRU1100 is mainly used for receiving and transmitting radio frequency signals and converting the radio frequency signals and baseband signals, for example, for sending configuration information of the first random access resource to the terminal device. The BBU 1200 is mainly used for performing baseband processing, controlling a base station, and the like. The RRU1100 and the BBU 1200 may be physically disposed together or may be physically disposed separately, that is, distributed base stations.

The BBU 1200 is a control center of the network device 1000, and may also be referred to as a processing unit, and is mainly used for performing baseband processing functions, such as channel coding, multiplexing, modulation, spreading, and the like. For example, the BBU (processing unit) performs functions such as sequence transformation, scrambling, and the like. For example, may correspond to the processor in fig. 8 or fig. 9.

In an example, the BBU 1200 may be formed by one or more boards, and the boards may collectively support a radio access network of a single access system (e.g., an LTE network), or may respectively support radio access networks of different access systems (e.g., an LTE network, a 5G network, or other networks). The BBU 1200 also includes a memory 1201 and a processor 1202. The memory 1201 is used to store necessary instructions and data. The processor 1202 is configured to control the network device 1000 to perform necessary actions, for example, to control the network device 1000 to execute the operation flows executed by the network device in the foregoing method embodiments. The memory 1201 and the processor 1202 may serve one or more boards. That is, the memory and processor may be provided separately on each board. Multiple boards may share the same memory and processor. In addition, each single board can be provided with necessary circuits.

It should be understood that the network device 1000 shown in fig. 10 is capable of implementing various processes involving network devices in the method embodiments of fig. 1-9. The operations and/or functions of the units in the network device 1000 are respectively for implementing the corresponding flows in the method embodiments. To avoid repetition, detailed description is appropriately omitted herein.

The BBU 1200 described above can be used to perform actions described in the previous method embodiments that are implemented internally by the network device, e.g., in applying a corresponding coding method, performing the steps of sequence transformation 402, scrambling 404, etc. And RRU1100 may be used to perform the transmit or receive actions described in the previous method embodiments. For example, step 400 of receiving information bits of the terminal device in the method of fig. 4 is performed, or step of transmitting a third bit sequence to the terminal device is performed in fig. 5.

Referring to fig. 11, fig. 11 is a schematic structural diagram of a terminal device 1300 provided in the present application. As shown in fig. 11, in one example, terminal apparatus 1300 includes: the antenna and the control circuit with transceiving functions may be considered as a transceiving unit 1311 of the terminal 1300 and the processor with processing functions may be considered as a processing unit 1312 of the terminal 1300. As shown in fig. 11, terminal 1300 includes a transceiving unit 1311 and a processing unit 1312. A transceiver unit may also be referred to as a transceiver, a transceiving device, etc. Optionally, a device for implementing the receiving function in the transceiver 1311 may be regarded as a receiving unit, and a device for implementing the transmitting function in the transceiver 1311 may be regarded as a transmitting unit, that is, the transceiver 1311 includes a receiving unit and a transmitting unit. For example, the receiving unit may also be referred to as a receiver, a receiving circuit, etc., and the sending unit may be referred to as a transmitter, a transmitting circuit, etc. Optionally, the receiving unit and the sending unit may be integrated into one unit, or may be multiple units independent of each other. The receiving unit and the transmitting unit can be in one geographical position or can be dispersed in a plurality of geographical positions.

The processing unit 1312 includes: and the processor is used for performing the functions of descrambling, deserializing, checking and the like in the figure 5. Such as steps 502, 504, 506, and 508 in fig. 5. The memory may be integral with the processor or separate from the processor.

For example, the terminal device 1300 may be the

terminal device

102 or 103 in the wireless communication system shown in fig. 1.

The chip described in this embodiment of the present application may be a field-programmable gate array (FPGA), an Application Specific Integrated Circuit (ASIC), a system on chip (SoC), a Central Processing Unit (CPU), a Network Processor (NP), a digital signal processing circuit (DSP), a microcontroller (micro controller unit, MCU), a programmable logic controller (PLD), or other integrated chips.

The processor in the embodiment of the present application may be an integrated circuit chip having signal processing capability. In implementation, the steps of the above method embodiments may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The 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, discrete gate or transistor logic device, or 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 the method fig. 4 or the method fig. 5 sequence transformation or the step of the perturbation (for example, steps 402 and 404 in the method fig. 4, and steps 502-508 in the method fig. 5) disclosed in the embodiments of the present application may also be performed by a hardware processor, or performed by a combination of hardware and software modules in a processor. The software module can be located in 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 other storage media mature in the field. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor.

The memory in the embodiments of the present application may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The non-volatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable Programmable ROM (EPROM), an Electrically Erasable Programmable ROM (EEPROM), or a flash memory. Volatile memory can be Random Access Memory (RAM), which acts as external cache memory. By way of example, but not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), double data rate SDRAM, enhanced SDRAM, SLDRAM, Synchronous Link DRAM (SLDRAM), and direct bus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.

Alternatively, the memory and the storage may be physically separate units, or the memory and the processor may be integrated together.

In addition, the present application also provides a computer-readable storage medium, in which computer instructions are stored, and when the computer instructions are executed on a computer, the computer is caused to execute the corresponding operations and/or procedures performed by the sending end in fig. 4 of the method, or the corresponding operations and/or procedures performed by the receiving end in fig. 5 of the method.

The present application also provides a computer program product, which includes computer program code, when the computer program code runs on a computer, to make the computer execute the corresponding operations and/or procedures performed by the sending end in the method fig. 4, or execute the corresponding operations and/or procedures performed by the receiving end in the method fig. 5.

The present application also provides a chip, which includes a memory and a processor, where the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory, so as to execute the corresponding operation and/or procedure executed by the sending end in the method fig. 4, or execute the corresponding operation and/or procedure executed by the receiving end in the method fig. 5.

The present application further provides a communication system including the transmitting end in fig. 4 or the receiving end in method fig. 5.

As used in this specification, the terms "component," "module," "system," and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device can be a component. One or more components may reside within a process and/or thread of execution. A component may be located on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate by way of local and/or remote processes based on a signal having one or more data packets (e.g., data from two components interacting with another component in a local system, distributed system, and/or across a network, such as the internet with other systems by way of the signal).

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware depending on the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

It is clear to those skilled in the art that the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the several embodiments provided in the present application, the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are also merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions in actual implementation, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the elements can be selected according to actual needs to achieve the purpose of the embodiments of the present application.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application.

The foregoing is only illustrative of the present application. Any changes or substitutions that may be easily conceived by a person skilled in the art within the technical scope of the present disclosure are intended to be covered by the scope of the present disclosure. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A method of encoding, the method comprising:

a sending end obtains a first bit sequence, wherein the first bit sequence comprises: k information bits and X Cyclic Redundancy Check (CRC) bits, wherein K and X are positive integers;

the sending terminal carries out sequence transformation on the first bit sequence to obtain a second bit sequence;

the sending end scrambles the second bit sequence by using a Radio Network Temporary Identifier (RNTI) to obtain a third bit sequence;

the sending end carries out polarized Polar coding on the third bit sequence to obtain a coded bit sequence;

and the sending end sends the coded bit sequence.

2. The method of claim 1, wherein the sequence transformation of the first bit sequence by the sending end to obtain the second bit sequence specifically comprises:

3. The method of claim 2, wherein the sequence transformation of the first bit sequence by the sending end to obtain the second bit sequence specifically comprises:

4. The method of claim 3, wherein the asymmetric encryption formula is as follows:

M^E＝C(modP)，

5. The method according to claim 3, wherein the encrypting the first bit sequence to obtain the encrypted second bit sequence specifically comprises:

6. The method of claim 1, wherein the sequence transformation of the first bit sequence by the sending end to obtain the second bit sequence specifically comprises:

7. The method of claim 1, wherein the sequence transformation of the first bit sequence by the sending end to obtain the second bit sequence specifically comprises:

8. The method of any one of claims 1-7, wherein the RNTI is one of a plurality of RNTIs configured with a same number A of bits corresponding to a same bit position in each RNTI of the plurality of RNTIs, the A bits having a first Hamming weight, wherein the first Hamming weight is a minimum of Hamming weights of H rows corresponding to H rows of N rows of a generating matrix of polarization Polar, the H bits are the number of bits of each RNTI of the plurality of RNTIs configured, 1& ltoreq A & ltoreq H & ltoreq N, and A, H and N are positive integers.

9. The method of any of claims 1-6, wherein the RNTI is one of a plurality of RNTIs configured, the plurality of RNTIs further having the same F bits corresponding to the same bit positions in each of the plurality of RNTIs, the F bits having a second Hamming weight, the second Hamming weight being greater than the first Hamming weight, and the second Hamming weight being less than a third Hamming weight, wherein the third Hamming weight is the Hamming weight of the remaining N rows of the generation matrix of polarization Polar corresponding to the remaining H bits other than the A bits and the F bits, 1 ≦ F ≦ H, A + F ≦ H, and F is a positive integer.

10. A method of decoding, the method comprising:

a receiving end obtains a sequence to be decoded;

the receiving end generates L first bit sequences according to the sequence to be decoded, wherein L is an integer greater than 1;

the receiving end uses G configured Radio Network Temporary Identifiers (RNTIs) to descramble the L first bit sequences to obtain L second bit sequences, wherein J identical bit sequences in the L second bit sequences correspond to J different RNTIs, G is an integer larger than 1, and J is an integer and is larger than or equal to 2;

the receiving end carries out sequence de-conversion corresponding to the J different RNTIs on the J second bit sequences to obtain J third bit sequences;

the receiving end carries out Cyclic Redundancy Check (CRC) check on the J third bit sequences, and the third bit sequences passing the CRC check are used as output bit sequences;

the receiving end outputs the output bit sequence.

11. The method according to claim 10, wherein the receiving end performs de-sequence transformation on the J second bit sequences corresponding to the J different RNTIs, and obtaining J third bit sequences specifically includes:

12. The method according to claim 11, wherein the receiving end decrypts the J second bit sequences corresponding to the J different RNTIs, respectively, and obtains J third bit sequences specifically includes:

13. The method of claim 12, wherein the asymmetric decryption formula is as follows:

C^D＝M(modP),

(E×D)modQ＝1

14. The method according to claim 11, wherein the receiving end decrypts the J second bit sequences corresponding to the J different RNTIs, respectively, and obtains J third bit sequences specifically includes:

15. The method according to claim 10, wherein the receiving end performs de-sequence transformation on the J second bit sequences corresponding to the J different RNTIs, and obtaining J third bit sequences specifically includes:

the receiving end performs decoding on the J second bit sequences corresponding to J different RNTIs to obtain J third bit sequences, where bit values in the third bit sequences are different from bit values in the second bit sequences, and the decoding includes any one of the following: convolutional codes, Turbo codes, low density parity check, CRC, reed-muller RM, cyclic or Polar codes.

16. The method according to claim 10, wherein the receiving end performs de-sequence transformation on the J second bit sequences corresponding to the J different RNTIs, and obtaining J third bit sequences specifically includes:

17. The method of any of claims 10-16, wherein the RNTI is a plurality of RNTIs configured with a same number a of bits corresponding to a same bit position in each RNTI in the plurality of RNTIs, the a bits having a first hamming weight, wherein the first hamming weight is a minimum of the hamming weights of H rows corresponding to H rows in N rows of a generator matrix of polarized Polar, the H bits are the number of bits of each RNTI in the plurality of RNTIs configured, 1 ≦ a ≦ H ≦ N, and A, H and N are positive integers.

18. The method of any of claims 10-17, wherein the RNTI is a configured plurality of RNTIs, the configured plurality of RNTIs further having F identical bits corresponding to identical bit positions in each of the plurality of RNTIs, the F bits having a second hamming weight, the second hamming weight being greater than the first hamming weight, and the second hamming weight being less than a third hamming weight, wherein the third hamming weight is the hamming weight of the H bits corresponding to the remaining N rows of the generating matrix of polarized Polar except for the a bits and the F bits, 1 ≦ F ≦ H, a + F ≦ H, and F being a positive integer.

19. An encoding apparatus, characterized in that the encoding apparatus comprises:

20. The encoding device of claim 19, wherein the processor is specifically configured to: and encrypting the first bit sequence to obtain a second bit sequence, wherein the bit value in the second bit sequence is different from the bit value in the first bit sequence.

21. The encoding device of claim 20, wherein the processor is specifically configured to: and encrypting the first bit sequence according to an asymmetric encryption formula to obtain a second bit sequence.

22. The encoding apparatus of claim 21, wherein the asymmetric encryption formula is as follows:

M^E＝C(modP)，

23. The encoding device of claim 20, wherein the processor is specifically configured to: and encrypting the first bit sequence according to a symmetric encryption formula to obtain a second bit sequence.

24. The encoding device of claim 19, wherein the processor is specifically configured to:

encoding the first bit to obtain a second bit sequence, wherein bit values in the second bit sequence are different from bit values in the first bit sequence, and the encoding includes any one of the following: convolutional codes, Turbo codes, low density parity check, CRC, reed-muller RM, cyclic or Polar codes.

25. The encoding device according to claim 19, wherein the processor is configured to interleave the first bit sequence to obtain the second bit sequence after position change.

26. The encoding apparatus of any one of claims 19-25, wherein the processor configures a plurality of RNTIs, the plurality of RNTIs having a same a bits, the a bits corresponding to a same bit position in each of the plurality of RNTIs, the a bits having a first hamming weight, wherein the first hamming weight is a minimum of hamming weights of H rows, the H rows correspond to H rows of N rows of a generation matrix of polarized Polar, the H bits are a number of bits of each of the configured plurality of RNTIs, 1 ≦ a ≦ H ≦ N, and A, H and N are positive integers.

27. The encoding apparatus of any one of claims 19-26, wherein the processor is further configured to configure a plurality of RNTIs, the plurality of RNTIs further having F identical bits corresponding to identical bit positions in each of the plurality of RNTIs, the F bits having a second hamming weight, the second hamming weight being greater than the first hamming weight, and the second hamming weight being less than a third hamming weight, wherein the third hamming weight is the hamming weight of the H bits other than the a bits and the F bits corresponding to the remaining N rows of the generation matrix of polarization polars, 1 ≦ F ≦ H, a + F ≦ H, and F being a positive integer.

28. A decoding apparatus, characterized in that the decoding apparatus comprises:

the processor is used for generating L first bit sequences according to the sequence to be decoded, wherein L is an integer larger than 1; descrambling the L first bit sequences by using G configured Radio Network Temporary Identifiers (RNTIs) to obtain L second bit sequences, wherein J identical bit sequences in the L second bit sequences correspond to J different RNTIs, G is an integer larger than 1, and J is an integer and is larger than or equal to 2; performing sequence de-conversion corresponding to the J different RNTIs on the J second bit sequences to obtain J third bit sequences; performing Cyclic Redundancy Check (CRC) check on the J third bit sequences, and taking the third bit sequences passing the CRC check as output bit sequences; instructing the transceiving unit to transmit the output bit sequence.

29. The coding device of claim 28, wherein the processor is specifically configured to:

30. The coding device of claim 29, wherein the processor is specifically configured to: and respectively decrypting the J second bit sequences according to J asymmetric decryption formulas corresponding to different RNTIs to obtain J third bit sequences.

31. The decoding apparatus according to claim 30, wherein the asymmetric decryption formula is as follows:

C^D＝M(modP),

the D satisfies the following condition:

(E×D)modQ＝1

32. The coding device of claim 29, wherein the processor is specifically configured to: and respectively decrypting the J second bit sequences according to J symmetrical decryption formulas corresponding to different RNTIs to obtain J third bit sequences.

33. The coding device of claim 28, wherein the processor is specifically configured to: performing J different decoding corresponding to the RNTI to the J second bit sequences to obtain J third bit sequences, wherein bit values in the third bit sequences are different from bit values in the second bit sequences, and the decoding includes any one of the following: convolutional codes, Turbo codes, low density parity check, CRC, reed-muller RM, cyclic or Polar codes.

34. The coding device of claim 28, wherein the processor is specifically configured to: and performing J de-interleaving corresponding to J different RNTIs on the J second bit sequences to obtain J position-transformed third bit sequences.

35. The decoding apparatus of any of claims 28-34, wherein the processor is specifically configured to configure a plurality of RNTIs, wherein the configured plurality of RNTIs have the same a bits, the a bits correspond to the same bit positions in each of the plurality of RNTIs, the a bits have a first hamming weight, wherein the first hamming weight is the minimum value of hamming weights of H rows, the H rows correspond to H rows of N rows of a generating matrix of polarized Polar, 1 ≦ a ≦ H ≦ N, and N, A and H are positive integers.

36. The decoding device according to any of claims 28-35, wherein the processor is specifically configured to: configuring a plurality of RNTIs, the configured RNTIs further having F same bits corresponding to same bit positions in each RNTI of the plurality of RNTIs, the F bits having a second Hamming weight that is greater than the first Hamming weight and that is less than a third Hamming weight, wherein the third Hamming weight is the Hamming weight of the remaining rows of the H rows other than the A rows and the F rows, 1 ≦ F ≦ H, A + F < H, and F is an integer.

37. An encoding apparatus, comprising:

a transmitting unit, configured to transmit the encoded bit sequence.

38. The encoding device according to claim 37, wherein the sequence transformation unit is specifically configured to:

and encrypting the first bit sequence to obtain a second bit sequence, wherein the bit value in the second bit sequence is different from the bit value in the first bit sequence.

39. The encoding device according to claim 38, wherein the sequence transformation unit is specifically configured to:

40. The encoding device according to claim 38, wherein the sequence transformation unit is specifically configured to:

41. The encoding apparatus as claimed in any one of claims 37 to 40, wherein the scrambling unit is further configured to configure a plurality of RNTIs, the plurality of RNTIs having the same A bits corresponding to the same bit positions in each RNTI of the plurality of RNTIs, the A bits having a first Hamming weight, wherein the first Hamming weight is a minimum value of Hamming weights of H rows corresponding to the H rows of the N rows of the generation matrix of polarized Polar, the H bits are the number of bits of each RNTI of the configured plurality of RNTIs, 1 ≦ A ≦ H ≦ N, and A, H and N are positive integers.

42. A decoding apparatus, characterized in that the decoding apparatus comprises:

a receiving unit, configured to obtain a sequence to be decoded;

a de-sequence transformation unit, configured to perform de-sequence transformation corresponding to the J different RNTIs on the J second bit sequences to obtain J third bit sequences;

a transmitting unit, configured to transmit the output bit sequence.

43. The decoding device of claim 42, wherein the deserializing unit is specifically configured to:

44. The decoding device according to claim 43, wherein the deserializing unit is specifically configured to:

45. The decoding device according to claim 43, wherein the deserializing unit is specifically configured to:

46. The decoding device of any of claims 42-43, wherein the descrambling unit is specifically configured to configure a plurality of RNTIs, the configured plurality of RNTIs have the same A bits, the A bits correspond to the same bit positions in each of the plurality of RNTIs, the A bits have a first Hamming weight, wherein the first Hamming weight is the minimum value of Hamming weights of H rows, the H rows correspond to H rows of N rows of a generating matrix of polarized Polar, 1 ≦ A ≦ H ≦ N, and N, A and H are positive integers.

47. A communication system, the system comprising: an encoding apparatus as claimed in any one of claims 19 to 27 and a decoding apparatus as claimed in any one of claims 28 to 36.