WO2020220920A1 - 一种编码方法及通信设备 - Google Patents

一种编码方法及通信设备 Download PDF

Info

Publication number
WO2020220920A1
WO2020220920A1 PCT/CN2020/082846 CN2020082846W WO2020220920A1 WO 2020220920 A1 WO2020220920 A1 WO 2020220920A1 CN 2020082846 W CN2020082846 W CN 2020082846W WO 2020220920 A1 WO2020220920 A1 WO 2020220920A1
Authority
WO
WIPO (PCT)
Prior art keywords
code
bit
information
bits
sequence
Prior art date
Application number
PCT/CN2020/082846
Other languages
English (en)
French (fr)
Inventor
王献斌
张华滋
李榕
黄凌晨
戴胜辰
童佳杰
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP20799365.0A priority Critical patent/EP3952159A4/en
Priority to BR112021021861A priority patent/BR112021021861A2/pt
Priority to KR1020217038824A priority patent/KR20220005540A/ko
Publication of WO2020220920A1 publication Critical patent/WO2020220920A1/zh
Priority to US17/511,905 priority patent/US11764812B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
    • H03M13/2906—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes using block codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65—Purpose and implementation aspects
    • H03M13/6561—Parallelized implementations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used

Definitions

  • This application relates to the field of communication technology, and in particular to an encoding method and communication equipment.
  • the rapid evolution of wireless communication indicates that the future 5G communication system will show some new characteristics.
  • the three most typical communication scenarios include Enhanced Mobile Broadband (eMBB) and Massive Machine Type Communication (mMTC).
  • eMBB Enhanced Mobile Broadband
  • mMTC Massive Machine Type Communication
  • URLLC Ultra Reliable Low Latency Communication
  • Polar Codes is a coding method proposed based on channel polarization.
  • the polarization code sequence is the first and only known channel coding method that can be strictly proven to "reach" the channel capacity.
  • the embodiments of the present application provide an encoding method and communication equipment, which are beneficial to reducing decoding delay.
  • an embodiment of the present application provides an encoding method.
  • Encoding is performed by the encoding method described in the first aspect, and
  • Kronecker product operation can be performed on P 2 and P 3 to obtain P 1 .
  • the first code can be constructed from two codes with the same code length and the number of information bits, which is convenient for implementation.
  • n 2 n 3
  • k 2 k 3
  • P 2 is equal to P 3 .
  • the second code and the third code can be understood as the same code. Therefore, the first code can be constructed based on one code, which is convenient for implementation.
  • k 1 k 4
  • k 4 is the length of the information bit sequence to be encoded.
  • a first code whose number of information bits is equal to the length of the information bit sequence to be encoded can be constructed. After the first code is constructed, the information bits of the first code can be directly filled with the information in the information bit sequence to be encoded, and the frozen bits of the first code are filled with a fixed value, and then the bit vector obtained after the bit value is filled coding.
  • k 4 is the length of the information bit sequence to be encoded.
  • a first code whose number of information bits is greater than the length of the information bit sequence to be encoded can be constructed, and then the information bit sequence to be encoded is encoded according to P 1 of the first code.
  • the specific implementation manner of encoding the information bit sequence to be encoded according to the binary vector P 1 of the first code is: determining the binary vector P 4 corresponding to the fourth code according to P 1 , and P 4 indicates the first code.
  • the fourth code can be constructed according to the first code, and then the information bit sequence to be coded is coded according to P 4 of the fourth code.
  • the set S 2 is a set of subsets S 1
  • S 1 is at the set of 1-bit information indicating the P bits set
  • S 2 P 4 is information indicating a set of bit information bits .
  • P 4 can be obtained by changing part of the information bits indicated by P 1 to frozen bits.
  • the specific implementation manner of determining the binary vector P 4 corresponding to the fourth code according to P 1 is: determining the set S 3 from the set S 1 , and modifying the information bits included in the set S 3 to frozen bits
  • the first encoding process at least one information bit of the first inner code can be changed into a frozen bit; the first information bit is determined from the set S 3 ; the first information bit in P 1 is modified to a frozen bit to obtain a binary vector P 5; binary vectors to obtain a first code based on the binary vector P 4 P 5.
  • the fourth code constructed based on this optional implementation manner is beneficial to reduce the code rate of the inner code.
  • the set S 3 comprises a plurality of information bits, the first set of information bits as compared to the other information bits S 3, the first information bit is modified freeze bit, a first inner code becomes Information bits for frozen bits are ranked the lowest in reliability.
  • the fourth code constructed based on this optional implementation manner is beneficial to reduce the code rate of the inner code and improve the transmission reliability.
  • the binary vector P. 5 in accordance with a first code to obtain a binary vector P is 4 DETAILED DESCRIPTION: determining a set S 4, S 4 bits set information included in the information bits. 5 indicated by P
  • at least one information bit of the second inner code in the second encoding process can be changed into a frozen bit
  • the first inner code is the outer code in the second encoding process
  • the second inner code is the first encoding
  • the outer code in the process determine the second information bit from the set S 4 ; modify the second information bit in P 5 to a frozen bit to obtain a binary vector P 6 ; obtain the binary vector P of the first code according to the binary vector P 6 4 .
  • the fourth code constructed based on this optional implementation manner is beneficial to reduce the code rate of the inner code.
  • the set S 4 comprises a plurality of information bits, second information bit in comparison to other collection of information bits 4 S, a second information bit is modified freeze bit, the second inner code becomes Information bits for frozen bits are ranked the lowest in reliability.
  • the fourth code constructed based on this optional implementation manner is beneficial to reduce the code rate of the inner code and improve the transmission reliability.
  • n 1 , n 2 and n 3 are integer powers of 2.
  • the encoded information bit sequence to be encoded according to a first binary code vector P 1 acquires the encoded bit sequences DETAILED DESCRIPTION: determining a first binary code in accordance with a first vector P
  • the seven-code binary vector P 7 indicates the information bits, frozen bits, and non-send bits of the seventh code.
  • the code length of the seventh code is n 7
  • the number of information bits of the seventh code is k 7 .
  • the number of free-to-send bits of the code is n 1 -n 7 , k 7 is equal to the length of the information bit sequence to be encoded, and n 7 is an integer greater than k 7 , k 1 is greater than or equal to k 7 ; encode the information bit sequence to be coded according to the binary vector P 7 of the seventh code to obtain the encoded first bit sequence of length n 1 ; the non-send bits in the first bit sequence After removal, the second bit sequence with a length of n 7 is obtained; the specific implementation of outputting the encoded bit sequence is: outputting the second bit sequence. Based on this optional implementation manner, a code of any code length can be constructed.
  • the specific implementation manner of determining the binary vector P 7 of the seventh code according to the binary vector P 1 of the first code is: according to the first preset The rule sequentially changes the elements indicating information bits in P 1 to the elements indicating non-sending bits until the number of elements indicating non-sending bits in P 1 is equal to n 1 -n 7 , and the binary vector P 7 is obtained , the value of the non-sending bits The value of the information bit independent of the seventh code. Based on the P 7 determined by the optional implementation manner, the second bit sequence obtained after encoding may not lack the content corresponding to the information bit, which is beneficial to ensure the integrity of the information.
  • the elements indicating information bits in P 1 may be sequentially modified to the elements indicating non-sending bits until P 1
  • the number of elements indicating the non-sending bits is equal to n 1 -n 7
  • the binary vector P 7 is obtained .
  • the first binary sequence includes the binary sequence numbers of the elements in P 1 arranged in descending order or descending order.
  • Second binary sequence also comprises a binary number P 1 of the element. The first binary sequence and the second binary sequence are interleaved. Based on this alternative embodiment, P 7 can be accurately determined.
  • an embodiment of the present application provides an encoding method, which includes: obtaining a sequence of information bits to be encoded; encoding the sequence of information bits to be encoded according to the binary vector P 1 of the first code, and obtaining the encoded bits sequence; wherein, P 1 indicates the information bits of the code bits of the first and freezing, P 1 is determined according to a target sequence and the number of information bits of the first code k, the number of information bits of the first code is equal to k information bit sequence to be coded 1
  • the length of the first code is n 1
  • the target sequence is a sequence of sequence numbers less than or equal to n 1 extracted from the stored sequence of length M.
  • the sequence of length M includes M bits The sequence number corresponding to each bit of, M is greater than or equal to n 1 ; output the encoded bit sequence.
  • Encoding is performed by the encoding method described in the second aspect, and parallel decoding can be performed during the decoding process, which is beneficial to reduce the decoding delay.
  • the set S 1 is determined from the information bits of the second binary code is indicated by the vector P 2, S 1 set information bits included in the bit modification is frozen, a first encoding process can be made At least one information bit of the first inner code becomes a frozen bit; the first information bit is determined from the set S 1 ; the first information bit in P 2 is modified to a frozen bit, and the binary vector P 3 of the third code is obtained.
  • the code length of the second code is M, the number of information bits of the second code is K, the code length of the third code is M, and the number of information bits of the third code is K-1; determine that the sequence number corresponding to the first information bit is K ; Traverse K from M to 1, and determine the sequence number corresponding to each bit in the sequence of length M. Based on the M-length sequence generated by this optional implementation manner, encoding is performed according to the M-length sequence, which is beneficial to reduce the inner code rate.
  • the set S 1 includes a plurality of information bits
  • the first information bit is compared with other information bits in the set S 1 , and when the first information bit is modified to a frozen bit, the first inner code changes Information bits for frozen bits are ranked the lowest in reliability.
  • encoding is performed according to the sequence of length M, which is beneficial to reduce the inner code rate and improve the transmission reliability.
  • a communication device which can execute the method of any one of the foregoing first aspect, second aspect, optional implementation manner of the first aspect, and optional implementation manner of the second aspect.
  • This function can be realized by hardware, or by hardware executing corresponding software.
  • the hardware or software includes one or more units corresponding to the above-mentioned functions.
  • the unit can be software and/or hardware.
  • a communication device in a fourth aspect, includes: a processor, a memory, and a communication interface; the processor, the communication interface and the memory are connected; wherein the communication interface may be a transceiver.
  • the communication interface is used to realize communication with other network elements.
  • one or more programs are stored in the memory, and the processor calls the programs stored in the memory to implement the first aspect, the second aspect, the optional implementation manners of the first aspect, and the possibilities of the second aspect.
  • the implementation manners and beneficial effects of the network device to solve the problem can be found in the foregoing first aspect, second aspect, optional implementation manners of the first aspect, and optional second aspect
  • the method and beneficial effects of any one of the embodiments will not be repeated here.
  • a computer program product which when running on a computer, causes the computer to execute the above-mentioned first aspect, second aspect, optional implementation of the first aspect, and optional implementation of the second aspect Any one of the methods.
  • a chip product that executes the method of any one of the foregoing first aspect, second aspect, optional implementation manner of the first aspect, and optional implementation manner of the second aspect.
  • a computer-readable storage medium stores instructions that, when run on a computer, cause the computer to execute the first, second, and first aspects above.
  • Figure 1 is a schematic diagram of an existing communication process
  • Figure 2 is a schematic diagram of a fence diagram provided by an embodiment of the present application.
  • FIG. 3 is a schematic flowchart of an encoding method provided by an embodiment of the present application.
  • FIG. 4 is a schematic diagram of another fence diagram provided by an embodiment of the present application.
  • FIG. 5 is a schematic diagram of another fence diagram provided by an embodiment of the present application.
  • FIG. 6 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • FIG. 7 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • FIG. 8 is a schematic flowchart of another encoding method provided by an embodiment of the present application.
  • FIG. 9 is a schematic diagram of a first binary sequence and a second binary sequence provided by an embodiment of the present application.
  • FIG. 10 is a schematic diagram of another fence diagram provided by an embodiment of the present application.
  • Fig. 11 is a schematic diagram of another fence diagram provided by an embodiment of the present application.
  • the embodiments of the present application provide an encoding method and communication equipment, which are beneficial to reducing decoding delay.
  • 5G communication system Global System of Mobile communication (“GSM”) system, Code Division Multiple Access (“CDMA”) system, Wideband Code Division Multiple Access (Wideband Code Division Multiple) Access (“WCDMA”) system, General Packet Radio Service (“GPRS”), Long Term Evolution (“LTE”) system, LTE Frequency Division Duplex (“Frequency Division Duplex”) "FDD”) system, LTE Time Division Duplex (Time Division Duplex, "TDD”), Universal Mobile Telecommunication System (Universal Mobile Telecommunication System, "UMTS”), etc.
  • GSM Global System of Mobile communication
  • CDMA Code Division Multiple Access
  • WCDMA Wideband Code Division Multiple Access
  • GPRS General Packet Radio Service
  • LTE Long Term Evolution
  • LTE Frequency Division Duplex Frequency Division Duplex
  • TDD Time Division Duplex
  • TDD Universal Mobile Telecommunication System
  • UMTS Universal Mobile Telecommunication System
  • Figure 1 is the basic flow of communication using wireless technology.
  • a communication device before sending information, a communication device needs to perform source coding on the information to be sent, then channel coding the source-coded information, and then send the channel-coded information.
  • the receiving end After receiving the channel-encoded information, the receiving end first performs channel decoding on the channel-encoded information, and then performs source decoding on the channel-decoded information, and finally obtains the information sent by the transmitting end.
  • channel coding plays a vital role in the reliability of information transmission in the entire communication system.
  • u N (u 1 , u 2 ,..., u N ) is a binary row vector
  • u N is the bit vector to be encoded
  • the length is N (ie, the code length).
  • F N is an N ⁇ N matrix, and Here Defined as the Kronecker product of log 2 N matrices F 2 , Is the operator of Kronecker product.
  • the addition and multiplication operations mentioned above are all addition and multiplication operations on the binary galois field.
  • a part of the bits in u N are used to carry information and are called information bits.
  • the other part of the bits is used to carry a fixed value pre-appointed by the transceiver, and is called a fixed bit, or called a frozen bit.
  • the frozen bit is used for description in the rest of this application.
  • the frozen bit usually carries a value of 0.
  • u N determined for the information-carrying bit information, i.e., determining which positions in the u N bits are used to carry information.
  • the process of determining the information bits used to carry information in u N is called code construction.
  • FIG. 2 is a fence diagram for representing the channel coding process.
  • u 16 (u 1 , u 2 ,..., u 16 ) in the fence diagram.
  • c 16 (c 1 , c 2 ,..., c 16 ).
  • u 6 , u 7 , u 8 , u 10 , u 11 , u 12 , u 14 , u 15 , u 16 are information bits, Used to fill in information.
  • u 1 to u 5 , u 9 and u 13 are frozen bits, which are used to fill a fixed value pre-appointed by the transceiver end, such as 0. That is, in Figure 2, the solid nodes corresponding to u 1 to u 16 represent information bits, and the hollow nodes represent frozen bits.
  • determination information bits and the need to freeze the bits u 16, u 16 that is need to confirm the information bits and frozen bits are filled with the information in the received information bit sequence to be encoded, and the frozen bits in u 16 are filled with a fixed value pre-appointed by the transceiver end, such as 0.
  • the communication device encodes the padding information and the fixed value u 16 , and finally obtains the encoded bit sequence c 16 .
  • the foregoing communication device may be an access network device or a terminal device, or the foregoing communication device may be other devices that need to perform channel coding, which is not limited in the embodiment of the present application.
  • the access network device can provide communication coverage for a specific geographic area, and can communicate with terminal devices located in the coverage area, and the access network device can support communication protocols of different standards, or can support different communication modes .
  • the access network equipment may be an evolved base station (evolutional node B, eNB or eNodeB) in an LTE system, or a radio network controller in a cloud radio access network (cloud radio access network, CRAN), or may be
  • the access network equipment in the 5G network such as gNB, may be a small station, a micro station, or a transmission reception point (TRP), or a relay station, an access point, or a public land mobile network that will evolve in the future.
  • Land mobile network (PLMN) access network equipment, or various types of equipment that undertake base station functions in the future.
  • terminal equipment can refer to access terminals, user equipment (UE), user units, user stations, mobile stations, mobile stations, remote stations, remote terminals, mobile terminals, user terminals, terminals, wireless communication equipment, users Agent or user device.
  • the access terminal can be a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), with wireless communication Functional handheld devices, computing devices or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, terminal devices in the Internet of Things, virtual reality devices, terminal devices in 5G networks or future communication networks, or future public evolution Terminal equipment in public land mobile network (PLMN), etc.
  • SIP session initiation protocol
  • WLL wireless local loop
  • PDA personal digital assistant
  • FIG. 3 is a schematic flowchart of an encoding method provided by an embodiment of the present application.
  • the encoding method includes the following steps 301 to 303, where:
  • the communication device obtains an information bit sequence to be encoded.
  • the communication device encodes the information bit sequence to be encoded according to the binary vector P 1 of the first code, and obtains the encoded bit sequence.
  • P 1 2 and the third code binary vectors The binary vectors P 3 P determines the second code, the information bits indicating P. 1 and freezing the first code bit, P 2 indicate information bits and second code bits freezing, P 3 indicates the information bits and freeze bits of the third code.
  • the code length of the first code is n 1
  • the number of information bits of the first code is k 1
  • the code length of the second code is n 2
  • the number of information bits of the second code is k 2
  • the code length of the third code is n 3
  • the number of information bits of the third code is k 3 .
  • n 1 n 2 *n 3
  • k 1 k 2 *k 3 .
  • P 1 can be expressed as P 2 can be expressed as P 3 can be expressed as
  • p 1,z 1, it means that the z-th bit of the first code is an information bit.
  • p 2,z 0, it means that the z-th bit of the second code is a frozen bit.
  • p 2,z 1, it means that the z-th bit of the second code is an information bit.
  • p 3,z 0, it means that the z-th bit of the third code is a frozen bit.
  • the first code is a (32, 4) code, that is, the code length n 1 of the first code is 32, and the number of information bits k 1 is 4.
  • P 1 [0000000000000000000000110011].
  • P 1 indicates that the first bit to the 26th bit, the 29th bit and the 30th bit of the first code are frozen bits, and the 27th, 28th, 31st and 32nd bits are Information bits.
  • the second code is a (8, 2) code, that is, the code length n 2 of the second code is 8, and the number of information bits k 2 is 2.
  • P 2 [00000011].
  • P 2 indicates that the first to sixth bits of the second code are frozen bits, and the seventh and eighth bits are information bits.
  • the third code is a (4, 2) code, that is, the code length n 3 of the third code is 4, and the number of information bits k 3 is 2.
  • P 3 [0011].
  • P 3 indicates that the first bit and the second bit of the third code are frozen bits, and the third bit and the fourth bit are information bits.
  • P 1 indicates that the first bit to the 26th bit, the 29th bit and the 30th bit of the first code are frozen bits, and the 27th, 28th, 31st and 32nd bits are Information bits.
  • P 2 indicates that the first to sixth bits of the second code are frozen bits, and the seventh and eighth bits are information bits.
  • P 3 indicates that the first bit and the second bit of the third code are frozen bits, and the third bit and the fourth bit are information bits.
  • P 1 , P 2 , P 3 , P 4 , P 5 , P 6 and P 7 indicate information bits and freeze bits are all described using the first method as an example. That is, 0 indicates that the corresponding bit is a frozen bit, and 1 indicates that the corresponding bit is an information bit.
  • n 1 , n 2 , and n 3 are integer powers of 2.
  • n 1 is 16, n 2 is 8, and n 3 is 2.
  • n 1 is 32, n 2 is 8, and n 3 is 4.
  • n 1 is 64, n 2 is 16, and n 3 is 4.
  • n 1 , n 2 , and n 3 may not be an integer power of 2.
  • n 1 is 72, n 2 is 12, and n 3 is 6.
  • n 1 is 60, n 2 is 10, and n 3 is 6.
  • n 2 is different from n 3
  • k 2 is different from k 3
  • the first code may be a (32, 8) code, that is, the code length n 1 of the first code is 32, and the number of information bits k 1 is 8.
  • the second code may be a (8, 4) code, that is, the code length n 2 of the second code is 8, and the number of information bits k 2 is 4.
  • the third code may be a (4, 2) code, that is, the code length n 3 of the third code is 4, and the number of information bits k 3 is 2.
  • n 2 and n 3 are the same, and k 2 and k 3 are different.
  • the first code may be a (64, 8) code, that is, the code length n 1 of the first code is 64, and the number of information bits k 1 is 8.
  • the second code may be a (8, 4) code, that is, the code length n 2 of the second code is 8, and the number of information bits k 2 is 4.
  • the third code may be a (8, 2) code, that is, the code length n 3 of the third code is 8, and the number of information bits k 3 is 2.
  • n 2 is different from n 3
  • k 2 is the same as k 3
  • the first code may be a (128, 16) code, that is, the code length n 1 of the first code is 128, and the number of information bits k 1 is 16.
  • the second code may be a (8, 4) code, that is, the code length n 2 of the second code is 8, and the number of information bits k 2 is 4.
  • the third code may be a (16, 4) code, that is, the code length n 3 of the third code is 16, and the number of information bits k 3 is 4.
  • n 2 is the same as n 3
  • k 2 is the same as k 3
  • the first code may be a (64, 16) code, that is, the code length n 1 of the first code is 64, and the number of information bits k 1 is 16.
  • the second code may be a (8, 4) code, that is, the code length n 2 of the second code is 8, and the number of information bits k 2 is 4.
  • the third code may be a (8, 4) code, that is, the code length n 3 of the third code is 8, and the number of information bits k 3 is 4.
  • the communication device determines the code length n 2 and the number of information bits of the second code according to the code length n 1 of the first code and the number of information bits k 1 k 2 , and determine the code length n 3 of the third code and the number of information bits k 3 .
  • the communication device determines the code length of the second code n 2 and the number of information bits k 2 and the code length of the third code n 3 and the number of information bits k 3 , it determines the binary vector P 2 of the second code and the binary vector of the third code. P 3 . Then determine P 1 according to P 2 and P 3 .
  • the communication device can encode the information bit sequence to be encoded according to P 1 to obtain the encoded bit sequence.
  • the code length and the number of information bits of the second code and the third code may also be preset.
  • the communication device After the communication device receives the information bit sequence to be encoded, there is no need to determine the code length n 2 of the second code and the number of information bits k 2 according to the code length n 1 of the first code and the number of information bits k 1 , and determine the code of the third code Length n 3 and the number of information bits k 3 .
  • the communication device After the communication device receives the information bit sequence to be encoded, it can directly determine P 2 of the second code and P 3 of the third code, then determine P 1 according to P 2 and P 3 , and then perform processing according to P 1 for the information bit sequence to be encoded Encoding to obtain the encoded bit sequence.
  • the second code and the third code may be Polar codes
  • the existing Polar code construction method may be used to determine P 2 of the second code and P 3 of the third code.
  • methods such as Gaussian approximation (GA), density evolution (DE), PW, or NR can be used to determine P 2 of the second code and P 3 of the third code.
  • the principle of determining P 3 of the third code is the same, and will not be repeated here.
  • the communication device samples the positions of sequence elements less than or equal to 8 from PW, NR or other pre-stored sequences to obtain a sequence of length 8 [8 7 6 4 5 3 twenty one]. This sequence represents the order of the sub-channel reliability corresponding to each bit of the second code.
  • the reliability of the sub-channel corresponding to the first bit of the second code ranks 8th; the reliability of the sub-channel corresponding to the second bit of the second code ranks 7; the sub-channel corresponding to the third bit of the second code The reliability ranks 6th; the subchannel reliability corresponding to the 4th bit of the second code ranks 4th; the subchannel reliability corresponding to the 5th bit of the second code ranks 5th; the 6th bit of the second code
  • the communication device can determine the bit with higher reliability of the corresponding subchannel of the second code as the information bit.
  • the principle of determining the P3 of the third code is the same, and will not be repeated here.
  • the communication device After the communication device determines P 2 and P 3 , it can perform Kronecker product operation on P 2 and P 3 to obtain the binary vector P 1 of the first code.
  • the first code is (16, 9) code
  • the second code is (4, 3) code
  • the third code is (4, 3) code.
  • P 2 may not be equal to P 3 .
  • P 3 the same length P 2 and P 3
  • P 2 and P 3 the same length
  • k 1 k 4 , or k 4 ⁇ k 1 .
  • the k 4 is the length of the information bit sequence to be encoded.
  • the number of information bits of the first code is equal to the length of the information bit sequence to be encoded.
  • the communication device determines P 1 of the first code, it can directly fill the information in the information bit sequence to be encoded into the information bits of the first code, and fill the frozen bits of the first code with a fixed value, such as 0.
  • the communication device fills in the information and fixed value in the first code, it gets Then right Code to get
  • the communication device receives a sequence of information bits to be encoded.
  • the length k 4 of the information bit sequence to be encoded is 4.
  • the communication device determines that the number of information bits k 1 of the first code is 4 according to the information bit sequence to be encoded.
  • the code length n 1 of the first code may be preset, such as 32.
  • the number of information bits k 1 and the code length n 1 of the first code are preset, and the number of information bits k 1 of the first code is 4 and the code length n 1 is 32.
  • the communication device factorizes the code length n 1 of the first code (32, 4) and the number of information bits k 1 to obtain the code length n 2 of the second code and the number of information bits k 2 , and the code length of the third code n 3 and the number of information bits k 3 .
  • n 2 is 8
  • k 2 is 2
  • n 3 4
  • k 3 is 2. That is, the second code is (8, 2) code
  • the third code is (4, 2) code.
  • the communication device receives a sequence of information bits to be encoded.
  • the length k 4 of the information bit sequence to be encoded is 9.
  • the communication device determines that the number of information bits k 1 of the first code is 9 according to the information bit sequence to be encoded.
  • the code length n 1 of the first code may be preset, such as 16.
  • the number of information bits k 1 and the code length n 1 of the first code are preset, the number of information bits k 1 of the first code is 9, and the code length n 1 is 16.
  • the communication device factorizes the code length n 1 of the first code (16, 9) and the number of information bits k 1 to obtain the code length n 2 of the second code and the number of information bits k 2 , and the code length of the third code n 3 and the number of information bits k 3 .
  • n 2 is 4, k 2 is 3, n 3 is 4, and k 3 is 3. That is, the second code is (4, 3) code, and the third code is (4, 3) code.
  • the communication device fills the first to fifth, ninth, and 13th bits of the first code with a fixed value, such as 0.
  • the communication device fills the bit value in the information bit sequence to be encoded in the 6th to 8th bits of the first code, the 10th to 12th bits as information bits, and the 14th to 16th bits. .
  • u 16 is obtained.
  • k 4 is the length of the information bit sequence to be encoded.
  • k 4 is equal to 3 and k 1 is equal to 4.
  • k 4 is equal to 5 and k 1 is equal to 9.
  • the communication device may first determine the number of information bits of the fourth code.
  • the number of information bits of the fourth code is equal to the length of the information bit sequence to be encoded.
  • the code length and the number of information bits of the first code are determined according to the code length and the number of information bits of the fourth code.
  • the code length of the fourth code may be preset.
  • the code length and the number of information bits of the second code and the third code are determined according to the code length and the number of information bits of the first code.
  • the communication device After determining the code length of the second code and the third code and the number of information bits, the communication device determines P 2 of the second code and P 3 of the third code, and then determines P 1 according to P 2 and P 3 . After the communications device determines P 1, 4, and then encoded according to P 4 information bit sequence to be encoded according to P 1 P determined.
  • the communication device receives a sequence of information bits to be encoded.
  • the length k 4 of the information bit sequence to be encoded is 6.
  • the communication device determines that the number of information bits of the fourth code is k 4 , that is, 6 according to the length of the information bit sequence to be encoded.
  • the communication device determines the code length n 1 and the number of information bits k 1 of the first code according to the code length n 4 of the fourth code and the number of information bits k 4 .
  • the code length of the fourth code may be preset, for example, n 4 may be 16. Therefore, the fourth code is (16, 6) code. Since n 4 is equal to n 1 , Therefore, the code length n 1 of the first code is equal to 16, and the number of information bits k 1 of the first code is equal to 9. That is, the first code is (16, 9) code.
  • P 4 indicates that the first to sixth, eighth, ninth, thirteenth and fourteenth bits of the fourth code are frozen bits, and the seventh and fourth bits of the fourth code 10 bits to 12th bit, 15th bit and 16th bit are information bits.
  • the communication device fills the first to sixth bits, the eighth bit, the ninth bit, the 13th bit, and the 14th bit of the fourth code with a fixed value, such as 0.
  • the communication device fills the bit values in the information bit sequence to be encoded in the 7th bit, 10th bit to 12th bit, 15th bit and 16th bit of the fourth code.
  • u 16 is obtained.
  • the set S 2 is a set of subsets S 1, S 1 is at the set of 1-bit information indicating the P bits set, S 2 P 4 is information indicating a set of bit information bits .
  • the specific implementation manner of the communication device determining the binary vector P 4 corresponding to the fourth code according to P 1 is: determining the set S 3 from the set S 1 , and modifying the information bits included in the set S 3 to freeze bit, it allows the first inner code encoding process, the first bit of the at least one information bit becomes frozen; S 3 is determined from a first set of information bits; P 1 in the first information bit modifications as frozen bits, to obtain binary vectors P 5; P 4 binary vectors to obtain a first code based on the binary vector P 5.
  • the communication device receives a sequence of information bits to be encoded.
  • the length k 4 of the information bit sequence to be encoded is 6.
  • the fourth code is (16,6) code.
  • the first code is (16, 9) code.
  • the following description is supplemented by the corresponding fence diagram.
  • the corresponding fence graph has a total of log 2 (n 1 ) layers.
  • place it before The first-order operation is used as the first outer code.
  • the operation of the order is the first inner code. Since n 1 is equal to 16, for the fence diagram shown in FIG. 4, the first two-level operations are regarded as the first outer code, and the latter two-level operations are regarded as the first inner code.
  • the coding process represented by the fence diagram shown in FIG. 4 is the first coding process.
  • the bits of the first code [u 5 , u 6 , u 7 , u 8 , u 9 , u 10 , u 11 , u 12 , u 13 , u 14 , u 15 , u 16 ] correspond to the
  • the codeword bits of an outer code are respectively [x 5 , x 6 , x 7 , x 8 , x 9 , x 10 , x 11 , x 12 , x 13 , x 14 , x 15 , x 16 ].
  • the codeword bits of the first outer code [x 5 , x 6 , x 7 , x 8 ] satisfy the following relationship:
  • the information bit u 8 is modified to a frozen bit
  • the information bit x 8 of the first inner code will also become a frozen bit
  • the information bit x 8 of the first inner code will become a frozen bit to reduce the code rate of the inner code.
  • the relationship satisfied by x 9 , x 10 , x 11 , x 12 , x 13 , x 14 , x 15 , and x 16 is the same, and will not be repeated here.
  • This application only uses the code word bit of the first outer code [x 5 , x 6 , x 7 , x 8 ] are taken as an example for description.
  • information may be sequentially traverse bit set S 1, determining a modified bit is frozen, it is possible to make the information bits of the first inner code becomes frozen bits of information bits S 1 of the.
  • the first information bit is modified freeze bit
  • a first inner code becomes frozen information bits
  • the fourth code is (16, 8) code
  • the first code is (16, 9) code.
  • P 5 [0000011001110111].
  • the number of information bits in P 5 is equal to the number of information bits of the fourth code k 4 .
  • the communication device can directly determine P 5 as P 4 , and then encode the information bit sequence to be encoded according to P 4 .
  • the communication device obtains the binary vector P 4 of the first code according to the binary vector P 5 as follows: determine the set S 4 from the information bits indicated by P 5 , and when the information bits included in the set S 4 are modified to frozen bits , Can make at least one information bit of the second inner code in the second encoding process become frozen bits, the first inner code is the outer code in the second encoding process, and the second inner code is the outer code in the first encoding process; S 4 is determined from a second set of information bits; P 5 the second information bits in a frozen modified bits to obtain binary vectors P 6; P 6 binary vectors obtained according to a first binary code vector P 4.
  • the information bits indicated by P 5 include [u 6 , u 7 , u 10 , u 11 , u 12 , u 14 , u 15 , u 16 ].
  • the coding process represented by the fence diagram shown in FIG. 5 is the second coding process.
  • the first outer code of the fence diagram shown in FIG. 4 is the second inner code of the fence diagram shown in FIG. 5.
  • the first inner code of the fence diagram shown in FIG. 4 is the second outer code of the fence diagram shown in FIG. 5.
  • the principle of determining the set S 4 from the information bits indicated by P 5 is similar to the principle of determining the set S 3 from the information bits indicated by P 1 .
  • second information bit may be any one of a set of information bits S 4.
  • S 4 [u 14 , u 15 , u 16 ]
  • the second information bit may be u 14 , u 15 or u 16 .
  • the second bits of information may be compared to the set S 4 additional information bits, the second information bit is modified freeze bit, a second bit inner code becomes frozen
  • the reliability of x 14 is less than the reliability of x 15 , and the reliability of x 15 is less than the reliability of x 16 . Therefore, the communication device determines u 14 as the second information bit. When a set S 4 only one bit of information, the information bits of the second information bit.
  • the communication device outputs the encoded bit sequence.
  • the communication device encodes the information bit sequence to be encoded according to the binary vector P 1 of the first code, and after obtaining the encoded bit sequence, outputs the encoded bit sequence. After the communication device outputs the coded bit sequence, it can send the coded bit sequence.
  • the communication device can encode the information bit sequence to be encoded according to the binary vector P 1 of the first code, obtain the encoded bit sequence, and output The encoded bit sequence. It can be seen that the method described in FIG. 3 provides a new encoding method. When encoding is performed by this encoding method, parallel decoding can be performed during the decoding process, which is beneficial to reduce the decoding delay.
  • FIG. 8 is a schematic flowchart of another encoding method provided by an embodiment of the present application.
  • the encoding method includes the following steps 801-805.
  • step 801 refer to the description of step 301, which is not repeated here.
  • steps 802 to 804 are a specific implementation manner in which the communication device encodes the information bit sequence to be encoded according to the binary vector P 1 of the first code, and obtains the encoded bit sequence.
  • Step 805 is a specific implementation of step 303. among them:
  • the communication device obtains an information bit sequence to be encoded.
  • the communication device determines the binary vector P 7 of the seventh code according to the binary vector P 1 of the first code.
  • first code vector P described and first binary code to determine the binary vector P 1 of the first embodiment may refer to the above description of FIG. 3 corresponding to the respective embodiments, and are not repeated herein.
  • the binary vector P 7 indicates the information bits, freeze bits and non-send bits of the seventh code.
  • the code length of the seventh code is n 7
  • the number of information bits of the seventh code is k 7
  • the number of non-send bits of the seventh code is n 1 -n 7
  • k 7 is equal to the length of the information bit sequence to be encoded
  • k 1 is greater than or equal to k 7 .
  • k 1 k 7 +n 1 -n 7 .
  • the seventh code is a (13, 6) code
  • the first code may be a (16, 9) code or a (16, 6) code.
  • the seventh code is a (50, 2) code
  • the first code can be a (64, 16) code or a (64, 2) code.
  • a preset value can be used to indicate the non-sending bit. For example, take the default value of 2 as an example.
  • the preset value can be 3, 4, or 5 or other values.
  • the communication device sequentially modifies the elements indicating information bits in P 1 to the elements indicating non-sending bits according to the first preset rule, until the number of elements indicating non-sending bits in P 1 is equal to n 1 -n 7 , and the binary vector P is obtained 7.
  • the value of this exemption bit is independent of the value of the information bit of the seventh code.
  • the second bit sequence obtained after encoding may not lack the content corresponding to the information bit, which is beneficial to ensure the integrity of the information.
  • the transmission-free bits may also be referred to as shortened bits.
  • the communication device is specifically based on the first binary sequence and the second binary sequence, and according to the first preset rule, sequentially modify the element indicating the information bit in P 1 to the element indicating the non-sending bit until P 1
  • the number of elements indicating the non-sending bits in is equal to n 1 -n 7 , and the binary vector P 7 is obtained .
  • the first binary sequence includes the binary sequence numbers of the elements in P 1 arranged in descending order or descending order.
  • Second binary sequence also comprises a binary number P 1 of the element. The first binary sequence and the second binary sequence are interleaved.
  • the communication device may first determine the number of information bits of the seventh code.
  • the number of information bits of the seventh code is equal to the length of the information bit sequence to be encoded.
  • the communication device determines the code length n 1 and the number of information bits k 1 of the first code according to the code length and the number of information bits of the seventh code.
  • the communication device determines that the code length n 1 of the first code is 16, and the number of information bits k 1 is 9. After that, the communication device determines the code length and the number of information bits of the second code and the third code according to the code length n 1 of the first code and the number of information bits k 1 . After determining the code length of the second code and the third code and the number of information bits, the communication device determines P 2 of the second code and P 3 of the third code, and then determines P 1 according to P 2 and P 3 .
  • the left frame of Figure 9 represents the first binary sequence
  • the first binary sequence includes the binary sequence numbers of the elements in P 1
  • the binary sequence numbers in the left frame follow the sequence numbers from top to bottom Arranged in increasing order.
  • No. 0,0001 0000 denotes a first element P 1 of the second number represents the element P 1 of the 1, ..., and so on
  • Serial No. 16 1111 denotes P 1 of the element 15.
  • the right frame of FIG. 9 represents the second binary sequence, and the binary sequence number in the right frame of FIG. 9 is interleaved with the binary sequence number in the left frame.
  • the communication device may determine the transmission bit is used to indicate an element-free until the P 1 for instructing transmission of a first binary sequence from the Free and second binary sequences in order from bottom to top
  • the number of bit elements is equal to 3. Take the element value 2 to indicate that the bit is not sent as an example.
  • the communication device determines the element corresponding to 1111 from the first binary sequence to indicate the non-send bit. Therefore, the communication device modifies the value of the 16th element in P 1 to 2.
  • the communication device determines the element corresponding to 1011 from the second binary sequence for the second time to indicate the non-sending bit. Therefore, the communication device modifies the value of the 12th element in P 1 to 2.
  • the communication device determines the element corresponding to 1110 from the first binary sequence for the third time to indicate the non-sending bit. Therefore, the communication device modifies the value of the 15th element in P 1 to 2.
  • P 7 [0000011101120122].
  • the value of the non-send bit is independent of the value of the information bit of the seventh code.
  • the description is supplemented by the corresponding fence diagram.
  • the first outer code of the fence diagram shown in FIG. 10 is the second inner code of the fence diagram shown in FIG. 11.
  • the first inner code of the fence diagram shown in FIG. 10 is the second outer code of the fence diagram shown in FIG. 11.
  • the communication device can perform encoding through the encoding process of the fence diagram shown in FIG. 10 or FIG. 11.
  • u 6 , u 7 , u 8 , u 10 , u 11 , u 14 are information bits, u 1 , u 2 , u 3 , u 4 , u 5 , u 9 , u 13
  • c 12 , c 15 , and c 16 are non-send bits
  • u 12 , u 15 , and u 16 are bits before coding corresponding to the non-send bits. It can be seen from FIG. 10 and FIG. 11 that the value of the non-send bit c 16 is determined based on the value of u 16 .
  • the value of the non-send bit c 12 is determined based on the values of u 12 and u 16 .
  • the value of the non-send bit c 15 is determined based on the values of u 15 and u 16 .
  • the sending-free bits c 16 , c 16 and c 16 have no relation to the value of the information bit. Therefore, even if c 16 , c 16 and c 16 are removed, the content corresponding to the information bit will not be missing in the second bit sequence, which is beneficial to ensure the integrity of the information.
  • the communication device can start from the first binary sequence and the second binary sequence in the order from top to bottom.
  • the element used to indicate the non-send bit is determined in the sequence.
  • the specific implementation principle and the communication device determine the element used to indicate the non-send bit from the first binary sequence and the second binary sequence in a bottom-up order. The principle is the same and will not be repeated here.
  • the communication device sequentially modifies the elements indicating frozen bits in P 1 to the elements indicating non-sending bits until the number of elements indicating non-sending bits in P 1 is equal to n 1 -n 7 , and the binary vector P is obtained 7 .
  • the transmission-free bits can be reasonably determined.
  • the non-send bits may also be referred to as puncture bits.
  • the communication device is specifically based on the first binary sequence and the second binary sequence, and in accordance with the second preset rule, sequentially modify the element indicating the frozen bit in P 1 to the element indicating the no-sending bit until P 1
  • the number of elements indicating the non-sending bits in is equal to n 1 -n 7 , and the binary vector P 7 is obtained .
  • the first binary sequence includes the binary sequence numbers of the elements in P 1 arranged from largest to bottom or from smallest to largest.
  • Second binary sequence also comprises a binary number P 1 of the element. The first binary sequence and the second binary sequence are interleaved.
  • the code length of the seventh code is 13 as n 7 and the number of information bits k 7 of the seventh code is equal to 6 as an example.
  • the communication equipment is determined based on the same principle in the above example
  • the communication device determines the first binary sequence and the second binary sequence. For the description of the first binary sequence and the second binary sequence, please refer to the above description.
  • the communication device may be in order from the bottom from a first binary sequence and second binary
  • the element used to indicate the non-send bit is determined in the sequence.
  • the specific implementation principle and the communication device determine the element used to indicate the non-send bit from the first binary sequence and the second binary sequence in a bottom-up order. The principle is the same and will not be repeated here.
  • the communication device encodes the information bit sequence to be encoded according to the binary vector P 7 of the seventh code, to obtain an encoded first bit sequence of length n 1 .
  • the communication device outputs the second bit sequence.
  • the value of the bit before encoding corresponding to the free-to-send bit is a value pre-appointed by the transceiver.
  • u 6 , u 7 , u 8 , u 10 , u 11 , u 14 are information bits, u 1 , u 2 , u 3 , u 4 , u 5 , u 9 , u 13
  • u 12 , u 15 , and u 16 are the bits before encoding corresponding to the non-sending bits.
  • the communication device fills u 6 , u 7 , u 8 , u 10 , u 11 , u 14 with the information in the received information bit sequence to be encoded, and freezes the bits u 1 , u 2 , u 3 , u 4 , u 5 , U 9 , u 12 , u 13 , u 15 , u 16 are filled with a fixed value pre-appointed by the transceiver end, such as 0.
  • the communication device fills u 12 , u 15 , and u 16 with the values pre-appointed by the transceiver.
  • the value filled in the free-to-send bit of the communication device may be the same as or different from the fixed value filled in the frozen bit.
  • the communication device After the communication device encodes u 1 to u 16 , the first bit sequence c 1 to c 16 is obtained .
  • the communication device removes the sending-free bits c 16 , c 15 and c 12 , and the remaining bits c 1 to c 11 , c 13 and c 14 form a second bit sequence.
  • the communication device outputs the second bit sequence.
  • the communication device can construct a code of any code length.
  • the embodiment of the present application also provides another encoding method, and the following continues to introduce another encoding method:
  • the communication device After the communication device receives the information bit sequence to be encoded, the communication device encodes the information bit sequence to be encoded according to the binary vector P 1 of the first code to obtain the encoded bit sequence. After obtaining the coded bit sequence, the communication device outputs the coded bit sequence.
  • P 1 indicates the information bits of the code bits of the first and freezing
  • P 1 is determined according to a target sequence and the number of information bits of the first code k
  • the number k of information bits of the first code length information bit sequence to be encoded is equal to 1
  • the code length of the first code is n 1
  • the target sequence is a sequence of sequence numbers less than or equal to n 1 extracted from the stored sequence of length M.
  • the sequence of length M includes M bits The sequence number corresponding to each bit, M is greater than or equal to n 1 .
  • M is 16.
  • the communication device can store a sequence of length 16.
  • the sequence [10 14 12 16 13 7 6 9 11 5 2 4 15 8 3 1].
  • the sequence indicates that the sequence number corresponding to bit u 1 is 10.
  • the sequence number corresponding to bit u 2 is 14.
  • the sequence number corresponding to bit u 3 is 12.
  • the sequence number corresponding to bit u 4 is 16.
  • the sequence number corresponding to bit u 5 is 13.
  • the sequence number corresponding to bit u 6 is 7.
  • the sequence number corresponding to bit u 7 is 6.
  • the sequence number corresponding to bit u 8 is 9.
  • the sequence number corresponding to bit u 9 is 11.
  • the sequence number corresponding to bit u 10 bits is 5.
  • the sequence number corresponding to bit u 11 is 2.
  • the sequence number corresponding to bit u 12 is 4.
  • the sequence number corresponding to bit u 13 is 15.
  • the sequence number corresponding to bit u 14 is 8.
  • the sequence number corresponding to bit u 15 is 3.
  • the communication device can determine that the number of information bits of the first code is 15.
  • the code length of the first code may be preset, such as 16. That is, the first code is (16, 15) code.
  • the communication device obtains the target sequence from the stored sequence of length 16 according to the code length of the first code.
  • the communication device can determine that the number of information bits of the first code is 9.
  • the code length of the first code may be preset, such as 16. That is, the first code is (16, 9) code.
  • the communication device obtains the target sequence from the stored sequence of length 16 according to the code length of the first code.
  • the communication device may also generate a sequence of length M in advance.
  • Communications device generates the length of M sequences are particular embodiments: determining from information bits of the second binary code vector indicated by the set of P 2 S 1, S 1 set information bits included in the bit modification is frozen, can be made In the first encoding process, at least one information bit of the first inner code becomes a frozen bit; the first information bit is determined from the set S 1 ; the first information bit in P 2 is modified to a frozen bit to obtain the binary of the third code Vector P 3 , the code length of the second code is M, the number of information bits of the second code is K, the code length of the third code is M, and the number of information bits of the third code is K-1; determine that the first information bit corresponds to The sequence number of is K; traverse K from M to 1, and determine the sequence number corresponding to each bit in the sequence of length M.
  • the set S 1 includes multiple information bits, the first information bit is compared with other information bits in the set S 1 , and when the first information bit is modified to a frozen bit, the first inner code becomes the information of the frozen bit The reliability of the bits is ranked the lowest.
  • the first information bit may be any one of a collection of information bits in S 1.
  • the second code and the third code are different from the second code and the third code in the embodiment described in FIG. 3 above.
  • the code length of the second code is M
  • the number of information bits of the second code is K
  • the code length of the third code is M
  • the number of information bits of the third code is K-1.
  • a sequence of length 16 needs to be generated.
  • K 16.
  • the set S 1 can be determined from the information bits indicated by P 2 of the second code according to the same principle as the determination of the set S 3 in the foregoing method embodiment.
  • the communication device determines that the sequence number corresponding to u 4 in the sequence of length 16 is 16.
  • a sequence with an even power of 2 length can be constructed by the above sequence construction method provided in the embodiments of this application, or can be obtained from a longer sequence through the nesting feature (for example, a sequence with a length of 1024 can be obtained from the above-mentioned length of 4096 Read the serial number less than or equal to 1024 in the sequence of ).
  • the sequence of even power of 2 constructed by the above sequence construction method may be the same or different from the sequence of even power of 2 obtained from a longer sequence through the nesting feature.
  • the storage method of the sequence has nesting characteristics, which helps to reduce the required storage unit.
  • the nesting feature makes it possible to use M-length sequences to construct arbitrary mother-code length sequences less than M length.
  • a 2048-long sequence can be read from a 4096-length mother code sequence, and a 512-long sequence can be read from a 1024-long sequence.
  • an example of reading the length of 2048 from the above 4096-long sequence is described, and the sequence number is shown in Table 3 below.
  • the embodiment of the present invention may divide the device into functional modules according to the foregoing method examples.
  • each functional module may be divided corresponding to each function, or two or more functions may be integrated into one module.
  • the above-mentioned integrated modules can be implemented in the form of hardware or software functional modules. It should be noted that the division of modules in the embodiment of the present invention is illustrative, and is only a logical function division, and there may be other division methods in actual implementation.
  • FIG. 6 shows a schematic structural diagram of a communication device according to an embodiment of the present application.
  • the communication device shown in FIG. 6 may be used to perform part or all of the functions of the communication device in the method embodiment described in FIG. 3 above.
  • the communication device shown in FIG. 6 may include a processing module 601 and a communication module 602. among them:
  • P 2 is equal to P 3 .
  • k 1 k 4
  • k 4 is the length of the information bit sequence to be encoded.
  • k 4 is the length of the information bit sequence to be encoded.
  • the way that the processing module 601 encodes the information bit sequence to be encoded according to the binary vector P 1 of the first code is specifically: determining the binary vector P 4 corresponding to the fourth code according to P 1 , and P 4 indicates the value of the fourth code.
  • the set S 2 is a set of subsets S 1, S 1 is a set P bit information indicating a bit set consisting of, S 2 P 4 as indicated by bit information consisting of the information bit set.
  • the processing module 601 determines binary vectors P 1 P 4 corresponding to the code of the fourth embodiment is specifically by: determining when the set S 1 from the set S 3, S. 3 set information bits included in the bit modification is frozen, can be Make at least one information bit of the first inner code in the first encoding process a frozen bit; determine the first information bit from the set S 3 ; modify the first information bit in P 1 to a frozen bit to obtain a binary vector P 5 ; Obtain the binary vector P 4 of the first code according to the binary vector P 5 .
  • the set S 3 comprises a plurality of information bits, the first set of information bits as compared to the other information bits 3 S, first information bit is modified freeze bit, a first inner code becomes frozen information bits The reliability of the bits is ranked the lowest.
  • the processing module 601 to obtain binary vectors P of the first embodiment according to the binary code vector P 4. 5 specifically comprises: determining the information bits from the set S P. 5 indicated by 4, the information included in the set S 4 bits for the modified When the bit is frozen, at least one information bit of the second inner code in the second encoding process can be changed into a frozen bit.
  • the first inner code is the outer code in the second encoding process
  • the second inner code is the information bit in the first encoding process.
  • Outer code determine the second information bit from the set S 4 ; modify the second information bit in P 5 to a frozen bit to obtain a binary vector P 6 ; obtain the binary vector P 4 of the first code according to the binary vector P 6 .
  • the set S 4 includes a plurality of information bits
  • the second information bit is compared with other information bits in the set S 4 , and when the second information bit is modified to a frozen bit, the second inner code becomes the information of the frozen bit
  • the reliability of the bits is ranked the lowest.
  • n 1 , n 2 and n 3 are integer powers of 2.
  • FIG. 6 shows a schematic structural diagram of a communication device according to an embodiment of the present application.
  • the communication device shown in FIG. 6 may be used to perform part or all of the functions of the communication device in the foregoing method embodiment.
  • the communication device shown in FIG. 6 may include a processing module 601 and a communication module 602. among them:
  • the communication module 602 is used to obtain the information bit sequence to be coded; the processing module 601 is used to code the information bit sequence to be coded according to the binary vector P 1 of the first code to obtain the coded bit sequence; where P 1 indicates information bits of the first bit code and freezing, P 1 is determined based on the number 1 and the target sequence of k information bits of the first code, the first number of information bits of the k code length information bit sequence to be encoded is equal to 1, the first code
  • the code length is n 1
  • the target sequence is a sequence composed of sequence numbers less than or equal to n 1 extracted from the stored sequence of length M.
  • the sequence of length M includes the sequence corresponding to each of the M bits Number, M is greater than or equal to n 1 ; the processing module 601 is also used to output the encoded bit sequence.
  • the processing module 601 is further configured to determine a set S 1, S 1 set information included in the information bits from the second binary code vector P 2 indicates the bits modified to freeze bit, allows the first coding In the process, at least one information bit of the first internal code becomes a frozen bit; the processing module 601 is also used to determine the first information bit from the set S 1 ; the processing module 601 is also used to change the first information bit in P 2 Modified to freeze bits to obtain the binary vector P 3 of the third code, the code length of the second code is M, the number of information bits of the second code is K, the code length of the third code is M, and the number of information bits of the third code The processing module 601 is also used to determine that the sequence number corresponding to the first information bit is K, and to traverse K from M to 1 to determine the sequence number corresponding to each bit in the sequence of length M.
  • the set S 1 includes multiple information bits, the first information bit is compared with other information bits in the set S 1 , and when the first information bit is modified to a frozen bit, the first inner code becomes the information of the frozen bit The reliability of the bits is ranked the lowest.
  • FIG. 7 is a schematic structural diagram of a communication device disclosed in an embodiment of the present application.
  • the communication device includes a processor 701, a memory 702, and a communication interface 703. Among them, the processor 701, the memory 702 and the communication interface 703 are connected.
  • the processor 701 may be a central processing unit (CPU), a general-purpose processor, a co-processor, a digital signal processor (digital signal processor, DSP), or an application-specific integrated circuit (ASIC). , Field Programmable Gate Array (FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof.
  • the processor 701 may also be a combination that implements computing functions, for example, it includes a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and so on.
  • the communication interface 703 is used to implement communication with other communication devices or other communication components in the same communication device.
  • the processor 701 calls the program code stored in the memory 702 to execute the steps executed by the communication device in the foregoing method embodiment.
  • the memory 702 is also used to store cache data during the execution of the above method.
  • the memory 702 is also used to store the sequence in Table 1 or similar sequences.
  • the memory 702 and the processor 701 are coupled with each other, and optionally, may also be integrated together.
  • the embodiment of the present invention also provides a computer-readable storage medium, where instructions are stored in the computer-readable storage medium, and when it runs on a processor, the method flow of the foregoing method embodiment is realized.
  • the embodiment of the present invention also provides a computer program product.
  • the computer program product runs on a processor, the method flow of the above method embodiment is realized.
  • the embodiment of the present application also provides a chip system, which includes a processor, which is used to support a communication device to realize the functions involved in the above-mentioned embodiments, for example, to generate or process data and/or information involved in the above-mentioned methods. .
  • the chip system may further include a memory, which is used to store necessary program instructions and data.
  • the chip system can be composed of chips, or include chips and other discrete devices.
  • the communication device provided in the embodiment of the present application has a principle of solving the problem similar to the principle of the access network device or the first node in the method embodiment of the present application. Therefore, the implementation of each device can refer to the implementation of the method. For concise description, I won't repeat it here.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Dc Digital Transmission (AREA)

Abstract

本申请实施例公开了一种编码方法及通信设备，该方法包括：获取待编码的信息比特序列；根据第一码的二进制矢量P1对待编码的信息比特序列进行编码，获取编码后的比特序列；其中，P1根据第二码的二进制矢量P2和第三码的二进制矢量P3确定，P1指示第一码的信息比特和冻结比特，P2指示第二码的信息比特和冻结比特，P3指示第三码的信息比特和冻结比特，第一码的码长为n1，第一码的信息比特数量为k1，第二码的码长为n2，第二码的信息比特数量为k2，第三码的码长为n3，第三码的信息比特数量为k3，n1＝n2*n3，k1＝k2*k3；输出编码后的比特序列。通过本申请实施例所描述的编码方式进行编码，在译码过程中可以进行并行译码，有利于减小译码时延。

Description

一种编码方法及通信设备 技术领域
本申请涉及通信技术领域，尤其涉及一种编码方法及通信设备。
背景技术
无线通信的快速演进预示着未来5G通信系统将呈现出一些新的特点，最典型的三个通信场景包括增强型移动宽带(Enhanced Mobile Broadband，eMBB)，海量机器连接通信(Massive Machine Type Communication，mMTC)和高可靠低时延通信(Ultra Reliable Low Latency Communication，URLLC)，这些通信场景的需求将对现有LTE技术提出新的挑战。
通信系统通常采用信道编码提高数据传输的可靠性，信道编码作为最基本的无线接入技术，是满足5G通信需求的重要研究对象之一。在香农理论提出后，各国学者一直致力于寻找能够达到香农极限同时具有相对较低复杂度的编译码方法。极化码(Polar Codes)是基于信道极化提出的一种编码方式。极化码序列是第一种、也是已知的唯一一种能够被严格证明“达到”信道容量的信道编码方法。
在实际应用中发现，对采用Polar码进行编码的比特序列进行译码时，必须串行译码各个信息比特，这样会导致译码时延较大。因此，目前亟待提出一种新的编码方法，以便在译码时能够并行对各个信息比特进行译码，从而减小译码时延。
发明内容
本申请实施例提供了一种编码方法及通信设备，有利于减小译码时延。
第一方面，本申请实施例提供了一种编码方法，该方法包括：获取待编码的信息比特序列；根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码，获取编码后的比特序列；其中，P 1根据第二码的二进制矢量P 2和第三码的二进制矢量P 3确定，P 1指示第一码的信息比特和冻结比特，P 2指示第二码的信息比特和冻结比特，P 3指示第三码的信息比特和冻结比特，第一码的码长为n 1，第一码的信息比特数量为k 1，第二码的码长为n 2，第二码的信息比特数量为k 2，第三码的码长为n 3，第三码的信息比特数量为k 3，n 1＝n 2*n 3，k 1＝k 2*k 3；输出编码后的比特序列。通过第一方面所描述的编码方式进行编码，在译码过程中可以进行并行译码，有利于减小译码时延。
作为一种可选的实施方式，
Figure PCTCN2020082846-appb-000001
基于该可选的实施方式，能够对P 2和P 3进行克罗内克积运算，以得到P 1。
作为一种可选的实施方式，n 2＝n 3，k 2＝k 3。基于该可选的实施方式，能够根据两个相同码长和信息比特数量的码构造第一码，便于实现。
作为一种可选的实施方式，n 2＝n 3，k 2＝k 3，P 2等于P 3。基于该可选的实施方式，实际上第二码和第三码可理解为同一个码，因此，根据一个码就可构造第一码，便于实现。
作为一种可选的实施方式，k 1＝k 4，k 4为待编码的信息比特序列的长度。基于该可选的实施方式，可构造一个信息比特数量等于待编码的信息比特序列的长度的第一码。构造第一码之后，就可直接在第一码的信息比特填充待编码的信息比特序列中的信息，并在第一 码的冻结比特填充固定值，再对填充比特值之后得到的比特向量进行编码。
作为一种可选的实施方式，k 4<k 1，
Figure PCTCN2020082846-appb-000002
其中，该k 4为待编码的信息比特序列的长度。基于该可选的实施方式，可构造一个信息比特数量大于待编码的信息比特序列的长度的第一码，再根据第一码的P 1对待编码的信息比特序列进行编码。
作为一种可选的实施方式，根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码的具体实施方式为：根据P 1确定第四码对应的二进制矢量P 4，P 4指示第四码的信息比特和冻结比特，第四码的码长为n 4，第四码的信息比特数量为k 4，n 4＝n 1；根据P 4对待编码的信息比特序列进行编码。基于该可选的实施方式，可根据第一码构造第四码，再根据第四码的P 4对待编码的信息比特序列进行编码。
作为一种可选的实施方式，集合S 2为集合S 1的子集，集合S 1为P 1指示的信息比特组成的信息比特集合，S 2为P 4指示的信息比特组成的信息比特集合。基于该可选的实施方式，将P 1指示的一部分信息比特改为冻结比特，即可得到P 4。
作为一种可选的实施方式，根据P 1确定第四码对应的二进制矢量P 4的具体实施方式为：从集合S 1中确定集合S 3，集合S 3中包括的信息比特修改为冻结比特时，能够使第一编码过程中第一内码的至少一个信息比特变为冻结比特；从集合S 3中确定第一信息比特；将P 1中的第一信息比特修改为冻结比特，得到二进制矢量P 5；根据二进制矢量P 5得到第一码的二进制矢量P 4。基于该可选的实施方式构造的第四码，有利于减小内码码率。
作为一种可选的实施方式，集合S 3中包括多个信息比特，第一信息比特相较于集合S 3中的其他信息比特，第一信息比特修改为冻结比特时，第一内码变为冻结比特的信息比特的可靠度排序最低。基于该可选的实施方式构造的第四码，有利于减小内码码率以及提高传输可靠度。
作为一种可选的实施方式，根据二进制矢量P 5得到第一码的二进制矢量P 4的具体实施方式为：从P 5指示的信息比特中确定集合S 4，集合S 4中包括的信息比特为修改为冻结比特时，能够使第二编码过程中第二内码的至少一个信息比特变为冻结比特，第一内码为第二编码过程中的外码，第二内码为第一编码过程中的外码；从集合S 4中确定第二信息比特；将P 5中的第二信息比特修改为冻结比特，得到二进制矢量P 6；根据二进制矢量P 6得到第一码的二进制矢量P 4。基于该可选的实施方式构造的第四码，有利于减小内码码率。
作为一种可选的实施方式，集合S 4中包括多个信息比特，第二信息比特相较于集合S 4中的其他信息比特，第二信息比特修改为冻结比特时，第二内码变为冻结比特的信息比特的可靠度排序最低。基于该可选的实施方式构造的第四码，有利于减小内码码率以及提高传输可靠度。
作为一种可选的实施方式，n 1、n 2和n 3为2的整数次方。
作为一种可选的实施方式，根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码，获取编码后的比特序列的具体实施方式为：根据第一码的二进制矢量P 1确定第七码的二进制矢量P 7，二进制矢量P 7指示第七码的信息比特、冻结比特和免发送比特，第七码的码长为n 7，第七码的信息比特数量为k 7，第七码的免发送比特数量为n 1-n 7，k 7等于待编 码的信息比特序列的长度，n 7为大于k 7的整数，
Figure PCTCN2020082846-appb-000003
k 1大于或等于k 7；根据第七码的二进制矢量P 7对待编码的信息比特序列进行编码，得到长度为n 1的编码后的第一比特序列；将第一比特序列中的免发送比特去除，得到长度为n 7的第二比特序列；输出编码后的比特序列的具体实施方式为：输出第二比特序列。基于该可选的实施方式，能够构造出任意码长的码。
作为一种可选的实施方式，k 7＝k 1+n 1-n 7，根据第一码的二进制矢量P 1确定第七码的二进制矢量P 7的具体实施方式为：按照第一预设规则依次将P 1中指示信息比特的元素修改为指示免发送比特的元素，直到P 1中指示免发送比特的元素的数量等于n 1-n 7，得到二进制向量P 7，免发送比特的值独立于第七码的信息比特的值。基于该可选的实施方式确定的P 7，可以使编码后得到的第二比特序列不缺失信息比特对应的内容，有利于保证信息的完整性。
可选的，具体可基于第一二进制序列和第二二进制序列，按照第一预设规则依次将P 1中指示信息比特的元素修改为指示免发送比特的元素，直到P 1中指示免发送比特的元素的数量等于n 1-n 7，得到二进制向量P 7。其中，第一二进制序列中包括从大到小顺序排列或从小到大顺序排列的P 1中的元素的二进制序号。第二二进制序列中也包括P 1中的元素的二进制序号。第一二进制序列和第二二进制序列相交织。基于该可选的实施方式能够准确地确定P 7。
第二方面，本申请实施例提供了一种编码方法，该方法包括：获取待编码的信息比特序列；根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码，获取编码后的比特序列；其中，P 1指示第一码的信息比特和冻结比特，P 1根据目标序列和第一码的信息比特数量k 1确定，第一码的信息比特数量k 1等于待编码的信息比特序列的长度，第一码的码长为n 1，目标序列为从存储的长度为M的序列中提取的小于或等于n 1的顺序号组成的序列，长度为M的序列中包括M个比特中的每个比特对应的顺序号，M大于或等于n 1；输出编码后的比特序列。通过第二方面所描述的编码方式进行编码，在译码过程中可以进行并行译码，有利于减小译码时延。
作为一种可选的实施方式，从第二码的二进制矢量P 2指示的信息比特中确定集合S 1，集合S 1中包括的信息比特为修改为冻结比特时，能够使第一编码过程中第一内码的至少一个信息比特变为冻结比特；从集合S 1中确定第一信息比特；将P 2中的第一信息比特修改为冻结比特，得到第三码的二进制矢量P 3，第二码的码长为M，第二码的信息比特数量为K，第三码的码长为M，第三码的信息比特数量为K-1；确定第一信息比特对应的顺序号为K；将K从M到1进行遍历，确定长度为M的序列中每个比特对应的顺序号。基于该可选的实施方式生成的长度为M的序列，根据该长度为M的序列进行编码，有利于减小内码码率。
作为一种可选的实施方式，集合S 1中包括多个信息比特，第一信息比特相较于集合S 1中的其他信息比特，第一信息比特修改为冻结比特时，第一内码变为冻结比特的信息比特的可靠度排序最低。基于该可选的实施方式生成的长度为M的序列，根据该长度为M的序列进行编码，有利于减小内码码率以及提高传输可靠度。
第三方面，提供了一种通信设备，可执行上述第一方面、第二方面、第一方面的可选 的实施方式和第二方面的可选的实施方式中任意一项的方法。该功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。该硬件或软件包括一个或多个与上述功能相对应的单元。该单元可以是软件和/或硬件。基于同一发明构思，该通信设备解决问题的原理以及有益效果可以参见上述第一方面、第二方面、第一方面的可选的实施方式和第二方面的可选的实施方式中任意一项的方法以及有益效果，重复之处不再赘述。
第四方面，提供了一种通信设备，该网络设备包括：处理器、存储器、通信接口；处理器、通信接口和存储器相连；其中，通信接口可以为收发器。通信接口用于实现与其他网元之间的通信。其中，一个或多个程序被存储在存储器中，该处理器调用存储在该存储器中的程序以实现上述第一方面、第二方面、第一方面的可选的实施方式和第二方面的可选的实施方式中任意一项的方法，该网络设备解决问题的实施方式以及有益效果可以参见上述第一方面、第二方面、第一方面的可选的实施方式和第二方面的可选的实施方式中任意一项的方法以及有益效果，重复之处不再赘述。
第五方面，提供了一种计算机程序产品，当其在计算机上运行时，使得计算机执行上述第一方面、第二方面、第一方面的可选的实施方式和第二方面的可选的实施方式中任意一项的方法。
第六方面，提供了一种芯片产品，执行上述第一方面、第二方面、第一方面的可选的实施方式和第二方面的可选的实施方式中任意一项的方法。
第七方面，提了供一种计算机可读存储介质，所述计算机可读存储介质中存储有指令，当其在计算机上运行时，使得计算机执行上述第一方面、第二方面、第一方面的可选的实施方式和第二方面的可选的实施方式中任意一项的方法。
附图说明
图1是现有的一种通信流程的示意图；
图2是本申请实施例提供的一种篱笆图的示意图；
图3是本申请实施例提供的一种编码方法的流程示意图；
图4是本申请实施例提供的另一种篱笆图的示意图；
图5是本申请实施例提供的又一种篱笆图的示意图；
图6是本申请实施例提供的一种通信设备的结构示意图；
图7是本申请实施例提供的一种通信设备的结构示意图；
图8是本申请实施例提供的另一种编码方法的流程示意图；
图9是本申请实施例提供的一种第一二进制序列和第二二进制序列的示意图；
图10是本申请实施例提供的又一种篱笆图的示意图；
图11是本申请实施例提供的又一种篱笆图的示意图。
具体实施方式
下面结合附图对本申请具体实施例作进一步的详细描述。
本申请实施例提供了一种编码方法及通信设备，有利于减小译码时延。
其中，本发明实施例的技术方案可以应用于各种通信系统。例如，5G通信系统、全球 移动通讯(Global System of Mobile communication，简称“GSM”)系统、码分多址(Code Division Multiple Access，简称“CDMA”)系统、宽带码分多址(Wideband Code Division Multiple Access，简称“WCDMA”)系统、通用分组无线业务(General Packet Radio Service，简称“GPRS”)、长期演进(Long Term Evolution，简称“LTE”)系统、LTE频分双工(Frequency Division Duplex，简称“FDD”)系统、LTE时分双工(Time Division Duplex，简称“TDD”)、通用移动通信系统(Universal Mobile Telecommunication System，简称“UMTS”)等。
图1是采用无线技术进行通信的基本流程。如图1所示，通信设备在发送信息之前，需要对待发送的信息进行信源编码，再将信源编码后的信息进行信道编码，再将信道编码后的信息进行发送。接收端在接收该信道编码后的信息之后，先对该信道编码后的信息进行信道译码，再对该信道译码后的信息进行信源译码，最后得到发送端发送的信息。其中，信道编码在整个通信系统中对信息传输的可靠度起到至关重要的作用。
其中，信道编码过程为c N＝u NF N。u N＝(u 1,u 2,...,u N)是一个二进制的行矢量，u N为待编码的比特向量，长度为N(即码长)。F N是一个N×N的矩阵，且
Figure PCTCN2020082846-appb-000004
这里
Figure PCTCN2020082846-appb-000005
定义为log 2N个矩阵F 2的克罗内克(Kronecker)乘积，
Figure PCTCN2020082846-appb-000006
为Kronecker乘积的操作符。以上涉及的加法、乘法操作均为二进制伽罗华域(galois field)上的加法、乘法操作。
其中，u N中的一部分比特用来携带信息，称为信息比特。另外的一部分比特用于携带收发端预先约定的固定值，称之为固定比特，或称为冻结比特，本申请后文中均使用冻结比特进行描述。例如，通常冻结比特携带的值为0。在进行编码之前，需要确定u N中用于携带信息的信息比特，即确定u N中哪些位置的比特用于携带信息。确定u N中用于携带信息的信息比特的过程称为码的构造。
例如，以篱笆图(trellis graph)对信道编码过程进行描述。图2是用于表示信道编码过程的篱笆图。如图2所示，篱笆图中u 16＝(u 1,u 2,...,u 16)。c 16＝(c 1,c 2,...,c 16)。待编码的比特向量(u 1,u 2,...,u 16)中u 6，u 7，u 8，u 10，u 11，u 12，u 14，u 15，u 16为信息比特，用于填充信息。u 1～u 5，u 9和u 13为冻结比特，用于填充收发端预先约定的固定值，例如0。即图2中，u 1～u 16对应的实心节点表示信息比特，空心节点表示冻结比特。通信设备在进行编码之前，需要先确定u 16中的信息比特和冻结比特，即需要先确定u 16中的信息位和冻结位。然后在u 16中的信息比特中填充接收的待编码的信息比特序列中的信息，并在u 16中的冻结比特填充收发端预先约定的固定值，如0。然后通信设备再对填充信息和固定值的u 16进行编码，最后得到编码后的比特序列c 16。
其中，上述通信设备可以为接入网设备或终端设备，或者，上述通信设备可以为其他需要进行信道编码的设备，本申请实施例不做限定。
其中，接入网设备可以为特定的地理区域提供通信覆盖，并且可以与位于所述覆盖区 域内的终端设备进行通信，接入网设备可以支持不同制式的通信协议，或者可以支持不同的通信模式。例如，接入网设备可以是LTE系统中的演进型基站(evolutional node B，eNB或eNodeB)，或者是云无线接入网络(cloud radio access network，CRAN)中的无线网络控制器，或者可以为5G网络中的接入网设备，如gNB，或者可以为小站、微站或者传输接收点(transmission reception point，TRP)，还可以是中继站、接入点或者未来演进的公共陆地移动网络(public land mobile network，PLMN)中的接入网设备、或者未来的各种形式的承担基站功能的设备等。
其中，终端设备可以指接入终端、用户设备(user equipment，UE)、用户单元、用户站、移动站、移动台、远方站、远程终端、移动终端、用户终端、终端、无线通信设备、用户代理或用户装置。接入终端可以是蜂窝电话、无绳电话、会话发起协议(session initiation protocol，SIP)电话、无线本地环路(wireless local loop，WLL)站、个人数字处理(personal digital assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备、物联网中的终端设备、虚拟现实设备、5G网络或者未来通信网络中的终端设备或者未来演进的公共陆地移动网络(public land mobile network，PLMN)中的终端设备等。
下面进一步对本申请所提供的编码方法及通信设备进行介绍。
请参见图3，图3是本申请实施例提供的一种编码方法的流程示意图。如图3所示，该编码方法包括如下步骤301～303，其中：
301、通信设备获取待编码的信息比特序列。
302、通信设备根据第一码的二进制矢量P 1对该待编码的信息比特序列进行编码，获取编码后的比特序列。
其中，P 1根据第二码的二进制矢量P 2和第三码的二进制矢量P 3确定，P 1指示第一码的信息比特和冻结比特，P 2指示第二码的信息比特和冻结比特，P 3指示第三码的信息比特和冻结比特。第一码的码长为n 1，第一码的信息比特数量为k 1。第二码的码长为n 2，第二码的信息比特数量为k 2。第三码的码长为n 3，第三码的信息比特数量为k 3。n 1＝n 2*n 3，k 1＝k 2*k 3。
其中，P 1可以表示为
Figure PCTCN2020082846-appb-000007
P 2可以表示为
Figure PCTCN2020082846-appb-000008
P 3可以表示为
Figure PCTCN2020082846-appb-000009
可选的，p 1,z＝0时，表示第一码的第z位为冻结比特。p 1,z＝1时，表示第一码的第z位为信息比特。p 2,z＝0时，表示第二码的第z位为冻结比特。p 2,z＝1时，表示第二码的第z位为信息比特。p 3,z＝0时，表示第三码的第z位为冻结比特。p 3,z＝1时，表示第三码的第z位为信息比特。
例如，第一码为(32，4)码，即第一码的码长n 1为32，信息比特数量k 1为4。 P 1＝[00000000000000000000000000110011]。P 1指示第一码的第1个比特～第26个比特、第29个比特和第30个比特为冻结比特，第27个比特、第28个比特、第31个比特和第32个比特为信息比特。第二码为(8，2)码，即第二码的码长n 2为8，信息比特数量k 2为2。P 2＝[00000011]。P 2指示第二码的第1个比特～第6个比特为冻结比特，第7个比特和第8个比特为信息比特。第三码为(4，2)码，即第三码的码长n 3为4，信息比特数量k 3为2。P 3＝[0011]。P 3指示第三码的第1个比特和第2个比特为冻结比特，第3个比特和第4个比特为信息比特。
当然也可以p 1,z＝1时，表示第一码的第z位为冻结比特。p 1,z＝0时，表示第一码的第z位为信息比特。p 2,z＝1时，表示第二码的第z位为冻结比特。p 2,z＝0时，表示第二码的第z位为信息比特。p 3,z＝1时，表示第三码的第z位为冻结比特。p 3,z＝0时，表示第三码的第z位为信息比特。
例如，第一码为(32，4)码，P 1＝[11111111111111111111111111001100]。P 1指示第一码的第1个比特～第26个比特、第29个比特和第30个比特为冻结比特，第27个比特、第28个比特、第31个比特和第32个比特为信息比特。第二码为(8，2)码，P 2＝[11111100]。P 2指示第二码的第1个比特～第6个比特为冻结比特，第7个比特和第8个比特为信息比特。第三码为(4，2)码，P 3＝[1100]。P 3指示第三码的第1个比特和第2个比特为冻结比特，第3个比特和第4个比特为信息比特。
为方便描述，本申请实施例后文中，P 1、P 2、P 3、P 4、P 5、P 6和P 7指示信息比特和冻结比特的方式都以第一种方式为例进行描述，即0指示对应的比特为冻结比特，1指示对应的比特为信息比特。
可选的，n 1，n 2，n 3为2的整数次方。例如，n 1为16，n 2为8，n 3为2。或者，n 1为32，n 2为8，n 3为4。或者，n 1为64，n 2为16，n 3为4。
可选的，n 1，n 2，n 3也可不是2的整数次方。例如，n 1为72，n 2为12，n 3为6。或者，n 1为60，n 2为10，n 3为6。
可选的，n 2与n 3不同，k 2与k 3不同。例如，第一码可以为(32，8)码，即第一码的码长n 1为32，信息比特数量k 1为8。第二码可以为(8，4)码，即第二码的码长n 2为8，信息比特数量k 2为4。第三码可以为(4，2)码，即第三码的码长n 3为4，信息比特数量k 3为2。
可选的，n 2与n 3相同，k 2与k 3不同。例如，第一码可以为(64，8)码，即第一码的码长n 1为64，信息比特数量k 1为8。第二码可以为(8，4)码，即第二码的码长n 2为8，信息比特数量k 2为4。第三码可以为(8，2)码，即第三码的码长n 3为8，信息比特数量k 3为2。
可选的，n 2与n 3不同，k 2与k 3相同。例如，第一码可以为(128，16)码，即第一码的码长n 1为128，信息比特数量k 1为16。第二码可以为(8，4)码，即第二码的码长n 2为8，信息比特数量k 2为4。第三码可以为(16，4)码，即第三码的码长n 3为16，信息比特数量k 3为4。
可选的，n 2与n 3相同，k 2与k 3相同。例如，第一码可以为(64，16)码，即第一码的码长n 1为64，信息比特数量k 1为16。第二码可以为(8，4)码，即第二码的码长n 2为8，信息比特数量k 2为4。第三码可以为(8，4)码，即第三码的码长n 3为8，信息比特数量k 3为4。
作为一种可选的实施方式，通信设备接收待编码的信息比特序列之后，通信设备根据第一码的码长n 1和信息比特数量k 1确定第二码的码长n 2和信息比特数量k 2，以及确定第三码的码长n 3和信息比特数量k 3。通信设备确定第二码的码长n 2和信息比特数量k 2和第三码的码长n 3和信息比特数量k 3之后，确定第二码的二进制矢量P 2和第三码的二进制矢量P 3。再根据P 2和P 3确定P 1。通信设备确定P 1之后，就可根据P 1对待编码的信息比特序列进行编码，获取编码后的比特序列。
或者，第二码和第三码的码长和信息比特数量也可以是预先设定好的。通信设备接收待编码的信息比特序列之后，无需根据第一码的码长n 1和信息比特数量k 1确定第二码的码长n 2和信息比特数量k 2，以及确定第三码的码长n 3和信息比特数量k 3。通信设备接收待编码的信息比特序列之后，可直接确定第二码的P 2和第三码的P 3，再根据P 2和P 3确定P 1，再根据P 1对待编码的信息比特序列进行编码，获取编码后的比特序列。
可选的，第二码和第三码可以是Polar码，可以采用现有的Polar码构造方法确定第二码的P 2和第三码的P 3。例如，可通过高斯近似(gaussian approximation，GA)、密度进化(density evolution，DE)、PW或NR等方法确定第二码的P 2和第三码的P 3。
例如，以采用GA或DE方法确定P 2为例。确定第二码(8，2)的P 2时，通信设备确定第二码的各个比特对应的子信道容量，选择对应的子信道容量较大的比特为信息比特。例如，第二码的第7个比特和第8个比特对应的子信道容量较大，则确定第7个比特和第8个比特为信息比特。即如果p 2,z＝0时，表示第二码的第z位为冻结比特，p 2,z＝1时，表示第二码的第z位为信息比特，则P 2＝[00000011]。确定第三码的P 3的原理相同，在此不赘述。
再如，以采用PW或NR方法确定P 2为例。确定第二码(8，2)的P 2时，通信设备从PW、NR或者其他预先存储的序列中采样序列元素小于和等于8的位置，得到长度为8的序列[8 7 6 4 5 3 2 1]。该序列表示第二码的各个比特对应的子信道可靠度的排序。例如，第二码的第1个比特对应的子信道可靠度排名第8；第二码的第2个比特对应的子信道可靠 度排名第7；第二码的第3个比特对应的子信道可靠度排名第6；第二码的第4个比特对应的子信道可靠度排名第4；第二码的第5个比特对应的子信道可靠度排名第5；第二码的第6个比特对应的子信道可靠度排名第3；第二码的第7个比特对应的子信道可靠度排名第2；第二码的第8个比特对应的子信道靠度排名第1。根据该序列，通信设备可将第二码的对应的子信道可靠度较高的比特确定为信息比特。例如，第二码的第7个比特和第8个比特对应的子信道的信道可靠度最高，则通信设备将第二码的第7个比特和第8个比特确定为信息比特。即如果p 2,z＝0时，表示第二码的第z位为冻结比特，p 2,z＝1时，表示第二码的第z位为信息比特，则得到的P 2＝[00000011]。确定第三码的P3的原理相同，在此不赘述。
作为一种可选的实施方式，
Figure PCTCN2020082846-appb-000010
通信设备确定P 2和P 3之后，可以将P 2和P 3进行克罗内克积运算，以得到第一码的二进制矢量P 1。
例如，P 2＝[00000011]，P 3＝[0011]，
Figure PCTCN2020082846-appb-000011
作为一种可选的实施方式，n 2＝n 3，k 2＝k 3时，P 2等于P 3。
例如，第一码为(16，9)码，第二码为(4，3)码，第三码为(4，3)码。P 2＝P 3＝[0111]，
Figure PCTCN2020082846-appb-000012
作为一种可选的实施方式，n 2＝n 3，k 2＝k 3时，P 2也可不等于P 3。例如，虽然P 2和P 3的长度相同，但P 2和P 3中的值不相同。
本申请实施例中，k 1＝k 4，或者，k 4<k 1。该k 4为待编码的信息比特序列的长度。k 1＝k 4时，通信设备根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码的具体实施方式与k 4<k 1时，通信设备根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码的具体实施方式不相同。下面对k 1＝k 4和k 4<k 1的场景分别进行详细的介绍。
一、k 1＝k 4的场景：在这种场景下，第一码的信息比特数量等于待编码的信息比特序列的长度。通信设备确定第一码的P 1之后，就可直接将待编码的信息比特序列中的信息填充 至第一码的信息比特中，并在第一码的冻结比特填充固定值，例如0。通信设备在第一码填充信息和固定值之后，就得到
Figure PCTCN2020082846-appb-000013
然后对
Figure PCTCN2020082846-appb-000014
进行编码，得到
Figure PCTCN2020082846-appb-000015
Figure PCTCN2020082846-appb-000016
举例来说，通信设备接收待编码的信息比特序列。该待编码的信息比特序列的长度k 4为4。通信设备接收该待编码的信息比特序列之后，根据待编码的信息比特序列确定第一码的信息比特数量k 1为4。第一码的码长n 1可以是预先设定好的，例如为32。或者，第一码的信息比特数量k 1和码长n 1都是预先设置好的，第一码的信息比特数量k 1为4和码长n 1为32。
通信设备对第一码(32，4)的码长n 1和信息比特数量k 1进行因式分解，得到第二码的码长n 2和信息比特数量k 2，以及第三码的码长n 3和信息比特数量k 3。其中，n 1＝n 2*n 3，k 1＝k 2*k 3。例如，得到n 2为8，k 2为2，n 3为4，k 3为2。即第二码为(8，2)码，第三码为(4，2)码。
通信设备采用上述GA、DE、PW或NR方法确定第二码的二进制矢量P 2＝[00000011]，第三码的二进制矢量P 3＝[0011]。通信设备确定P 2和P 3之后，对P 2和P 3进行克罗内克积运算，得到第一码的二进制矢量P 1。即
Figure PCTCN2020082846-appb-000017
即P 1指示第一码的第1个比特～第26个比特、第29个比特和第30个比特为冻结比特，第27个比特、第28个比特、第31个比特和第32个比特为信息比特。通信设备在第一码的第1个比特～第26个比特、第29个比特和第30个比特填充固定值，例如0。通信设备在第一码的第27个比特、第28个比特、第31个比特和第32个比特填充待编码的信息比特序列中的比特值。通信设备将第一码的各个比特填充值之后，就得到u 32。然后通信设备对u 32进行编码，得到c 32，c 32＝u 32F 32。
再举例来说，通信设备接收待编码的信息比特序列。该待编码的信息比特序列的长度k 4为9。通信设备接收该待编码的信息比特序列之后，根据待编码的信息比特序列确定第一码的信息比特数量k 1为9。第一码的码长n 1可以是预先设定好的，例如为16。或者，第一码的信息比特数量k 1和码长n 1都是预先设置好的，第一码的信息比特数量k 1为9，码长n 1为16。
通信设备对第一码(16，9)的码长n 1和信息比特数量k 1进行因式分解，得到第二码的码长n 2和信息比特数量k 2，以及第三码的码长n 3和信息比特数量k 3。其中，n 1＝n 2*n 3，k 1＝k 2*k 3。例如，得到n 2为4，k 2为3，n 3为4，k 3为3。即第二码为(4，3)码，第三码为(4，3)码。
通信设备采用上述GA、DE、PW或NR方法确定第二码的二进制矢量P 2＝[0111]，第三码的二进制矢量P 3＝[0111]。通信设备确定P 2和P 3之后，对P 2和P 3进行克罗内克积运算，得到第一码的二进制矢量P 1。即
Figure PCTCN2020082846-appb-000018
即P 1指示第一码的第1个比特～第5个比特、第9个比特和第13个比特为冻结比特，第6个比特～第8个比特、第10个比特～第12个比特为信息比特、第14个比特～第16个比特为信息比特。通信设备在第一码的第1个比特～第5个比特、第9个比特和第13个比特填充固定值，例如0。通信设备在第一码的第6个比特～第8个比特、第10个比特～第12个比特为信息比特、第14个比特～第16个比特填充待编码的信息比特序列中的比特值。通信设备将第一码的各个比特填充值之后，就得到u 16。然后通信设备对u 16进行编码，得到c 16，c 16＝u 16F 16。
二、k 4<k 1的场景：在这种场景下，
Figure PCTCN2020082846-appb-000019
k 4为待编码的信息比特序列的长度。例如，k 4等于3，k 1等于4。k 4等于5，k 1等于9。
作为一种可选的实施方式，通信设备根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码的具体实施方式为：通信设备根据P 1确定第四码对应的二进制矢量P 4，该P 4指示第四码的信息比特和冻结比特，该第四码的码长为n 4，该第四码的信息比特数量为k 4，n 4＝n 1；通信设备根据P 4对待编码的信息比特序列进行编码。
可选的，通信设备接收待编码的信息比特序列之后，可以先确定第四码的信息比特数量。其中，第四码的信息比特数量等于待编码的信息比特序列的长度。通信设备确定第四码的信息比特数量之后，根据第四码的码长和信息比特数量确定第一码的码长和信息比特数量。其中，第四码的码长可以是预先设定好的。通信设备确定第一码的码长和信息比特数量之后，根据第一码的码长和信息比特数量确定第二码和第三码的码长和信息比特数量。通信设备确定第二码和第三码的码长和信息比特数量之后，确定第二码的P 2和第三码的P 3，再根据P 2和P 3确定P 1。通信设备确定P 1之后，根据P 1确定P 4，再根据P 4对对待编码的信息比特序列进行编码。
举例来说，通信设备接收待编码的信息比特序列。该待编码的信息比特序列的长度k 4为6。通信设备根据待编码的信息比特序列的长度确定第四码的信息比特数量为k 4，即6。通信设备根据第四码的码长n 4和信息比特数量k 4确定第一码的码长n 1和信息比特数量k 1。第四码的码长可以是预先设置好的，例如，n 4可以是16。因此，第四码为(16，6)码。由于n 4等于n 1，
Figure PCTCN2020082846-appb-000020
因此第一码的码长n 1等于16，第一码的信息比特数量k 1等于9。即第一码为(16，9)码。
通信设备对第一码(16，9)的码长n 1和信息比特数量k 1进行因式分解，得到第二码 的码长n 2和信息比特数量k 2，以及第三码的码长n 3和信息比特数量k 3。由于n 1＝n 2*n 3，k 1＝k 2*k 3。因此，n 2可以为4，k 2可以为3，n 3可以为4，k 3可以为3。即第二码为(4，3)码，第三码为(4，3)码。通信设备采用上述GA、DE、PW或NR方法确定第二码的二进制矢量P 2＝[0111]，第三码的二进制矢量P 3＝[0111]。通信设备确定P 2和P 3之后，对P 2和P 3进行克罗内克积运算，得到第一码的二进制矢量P 1。即
Figure PCTCN2020082846-appb-000021
通信设备确定P 1之后，根据P 1确定第四码(16，6)的P 4，再根据P 4对待编码的信息比特序列进行编码。例如，P 4＝[0000001001110011]。P 4指示第四码的第1个比特～第6个比特、第8个比特、第9个比特、第13个比特和第14个比特为冻结比特，第四码的第7个比特、第10个比特～第12个比特、第15个比特和第16个比特为信息比特。通信设备在第四码的第1个比特～第6个比特、第8个比特、第9个比特、第13个比特和第14个比特填充固定值，例如0。通信设备在第四码的第7个比特、第10个比特～第12个比特、第15个比特和第16个比特填充待编码的信息比特序列中的比特值。通信设备将第四码的各个比特填充值之后，就得到u 16。然后通信设备对u 16进行编码，得到c 16，c 16＝u 16F 16。
作为一种可选的实施方式，集合S 2为集合S 1的子集，集合S 1为P 1指示的信息比特组成的信息比特集合，S 2为P 4指示的信息比特组成的信息比特集合。
例如，P 1＝[0000011101110111]，P 4＝[0000001001110011]。P 1指示第一码的第1个比特～第5个比特、第9个比特和第13个比特为冻结比特，第6个比特～第8个比特、第10个比特～第12个比特为信息比特、第14个比特～第16个比特为信息比特。因此，集合S 1包括的信息比特为：第6个比特～第8个比特、第10个比特～第12个比特为信息比特、第14个比特～第16个比特。即S 1＝[u 6,u 7,u 8,u 10,u 11,u 12,u 14,u 15,u 16]。
P 4指示第四码的第1个比特～第6个比特、第8个比特、第9个比特、第13个比特和第14个比特为冻结比特，第四码的第7个比特、第10个比特～第12个比特、第15个比特和第16个比特为信息比特。因此，集合S 2包括的信息比特为：第7个比特、第10个比特～第12个比特、第15个比特和第16个比特。即S 2＝[u 7,u 10,u 11,u 12,u 15,u 16]可见，集合S 1的信息比特包括集合S 2的信息比特。
作为一种可选的实施方式，通信设备根据P 1确定第四码对应的二进制矢量P 4的具体实施方式为：从集合S 1中确定集合S 3，集合S 3中包括的信息比特修改为冻结比特时，能够使第一编码过程中第一内码的至少一个信息比特变为冻结比特；从集合S 3中确定第一信息比特；将P 1中的第一信息比特修改为冻结比特，得到二进制矢量P 5；根据二进制矢量P 5得到第一码的二进制矢量P 4。
举例来说，通信设备接收待编码的信息比特序列。该待编码的信息比特序列的长度k 4为6。第四码为(16，6)码。第一码为(16，9)码。第一码的P 1＝[0000011101110111]。即S 1＝[u 6,u 7,u 8,u 10,u 11,u 12,u 14,u 15,u 16]。
为了便于说明如何从集合S 1中确定集合S 3，下文辅以对应的篱笆图进行说明。对于码长为n 1的编码，其对应的篱笆图共log 2(n 1)层。对于图4所示的篱笆图，将其前
Figure PCTCN2020082846-appb-000022
阶的运算作为第一外码，后
Figure PCTCN2020082846-appb-000023
阶作的运算为第一内码。由于n 1等于16，因此，对于图4所示的篱笆图，将前两阶的运算作为第一外码，后两阶的运算作为第一内码。其中，图4所示的篱笆图所表示的编码过程为第一编码过程。
如图4所示，第一码的比特[u 5，u 6，u 7，u 8，u 9，u 10，u 11，u 12，u 13，u 14，u 15，u 16]对应第一外码的码字比特分别为[x 5，x 6，x 7，x 8，x 9，x 10，x 11，x 12，x 13，x 14，x 15，x 16]。其中，第一外码的码字比特[x 5，x 6，x 7，x 8]，满足以下关系：
Figure PCTCN2020082846-appb-000024
可见，如果将信息比特u 8修改为冻结比特，第一内码的信息比特x 8也会变为冻结比特，第一内码的信息比特x 8变为冻结比特有利于降低内码码率。x 9，x 10，x 11，x 12，x 13，x 14，x 15，x 16满足的关系同理，在此不赘述，本申请只以第一外码的码字比特[x 5，x 6，x 7，x 8]为例进行说明。
因此，可依次遍历集合S 1中的信息比特，确定修改为冻结比特时，能够使第一内码的信息比特变为冻结比特的S 1中的信息比特。根据上述方法，遍历集合S 1中的信息比特之后，可确定u 8修改为冻结比特时，能够使第一内码的信息比特x 8修改为冻结比特。u 12修改为冻结比特时，能够使第一内码的信息比特x 12修改为冻结比特。u 16修改为冻结比特时，能够使第一内码的信息比特x 16修改为冻结比特。因此，通信设备确定集合S 3＝[u 8，u 12，u 16]。
通信设备确定集合S 3之后，可从集合S 3中选择一个第一信息比特。并将P 1中该第一信息比特修改为冻结比特，得到P 5，再根据P 5确定P 4。例如，第一信息比特为u 8，那么，P 5＝[0000011001110111]。通信设备根据P 5＝[0000011001110111]确定P 4。
其中，如果集合S 3中具有多个信息比特，第一信息比特可以为集合S 3中的任意一个信 息比特。例如，如果S 3＝[u 8，u 12，u 16]，则第一信息比特可以为u 8、u 12或u 16。
或者，如果集合S 3中具有多个信息比特，第一信息比特相较于集合S 3中的其他信息比特，该第一信息比特修改为冻结比特时，第一内码变为冻结比特的信息比特的可靠度排序最低。例如，如果S 3＝[u 8，u 12，u 16]，u 8修改为冻结比特时，第一内码的信息比特x 8变为冻结比特。u 12修改为冻结比特时，第一内码的信息比特x 12变为冻结比特。u 16修改为冻结比特时，第一内码的信息比特x 16变为冻结比特。x 8的可靠度小于x 12的可靠度，x 12的可靠度小于x 16的可靠度。因此，通信设备确定u 8为第一信息比特。
如果集合S 3中只有一个信息比特，则该信息比特为第一信息比特。
值得一提的是，如果第四码为(16，8)码，第一码为(16，9)码。P 5＝[0000011001110111]。P 5中信息比特的数量等于第四码的信息比特数量k 4。那么通信设备可直接将P 5确定为P 4，再根据P 4对待编码的信息比特序列进行编码。
作为一种可选的实施方式，如果P 5中信息比特的数量大于第四码的信息比特数量k 4。通信设备根据二进制矢量P 5得到第一码的二进制矢量P 4的具体实施方式为：从P 5指示的信息比特中确定集合S 4，该集合S 4中包括的信息比特为修改为冻结比特时，能够使第二编码过程中第二内码的至少一个信息比特变为冻结比特，第一内码为第二编码过程中的外码，第二内码为第一编码过程中的外码；从集合S 4中确定第二信息比特；将P 5中的第二信息比特修改为冻结比特，得到二进制矢量P 6；根据二进制矢量P 6得到第一码的二进制矢量P 4。
例如，第四码为(16，6)码，P 5＝[0000011001110111]。即P 5中信息比特的数量为8，第四码的信息比特数量k 4为6，P 5中信息比特的数量大于k 4。通信设备从P 5＝[0000011001110111]指示的信息比特中确定集合S 4。P 5指示的信息比特包括[u 6，u 7，u 10，u 11，u 12，u 14，u 15，u 16]。为了便于说明如何确定集合S 4，下文辅以对应的篱笆图进行说明。图5所示的篱笆图表示的编码过程为第二编码过程。图4所示的篱笆图的第一外码为图5所示的篱笆图的第二内码。图4所示的篱笆图的第一内码为图5所示的篱笆图的第二外码。
从P 5指示的信息比特中确定集合S 4的原理与从P 1指示的信息比特中确定集合S 3的原理类似。如图5所示，如果将u 14修改为冻结比特，可使第二编码过程中的第二内码的信息比特x 14变为冻结比特。如果将u 15修改为冻结比特，可使第二编码过程中的第二内码的信息比特x 15变为冻结比特。如果将u 16修改为冻结比特，可使第二编码过程中的第二内码的信息比特x 16变为冻结比特。因此，通信设备可确定S 4＝[u 14，u 15，u 16]。
通信设备确定集合S 4之后，可从集合S 4中选择一个第二信息比特。并将P 5中该第二信息比特修改为冻结比特，得到P 6，再根据P 6确定P 4。例如，第二信息比特为u 14，那么，P 6＝[0000011001110011]。通信设备根据P 6确定P 4。
其中，如果集合S 4中具有多个信息比特，第二信息比特可以为集合S 4中的任意一个信 息比特。例如，如果S 4＝[u 14，u 15，u 16]，则第二信息比特可以为u 14，u 15或u 16。
或者，如果集合S 4中具有多个信息比特，第二信息比特可以为相较于集合S 4中的其他信息比特，该第二信息比特修改为冻结比特时，第二内码变为冻结比特的信息比特的可靠度排序最低。例如，如果S 4＝[u 14，u 15，u 16]，u 14修改为冻结比特时，第二内码的信息比特x 14变为冻结比特。u 15修改为冻结比特时，第二内码的信息比特x 15变为冻结比特。u 16修改为冻结比特时，第二内码的信息比特x 16变为冻结比特。x 14的可靠度小于x 15的可靠度，x 15的可靠度小于x 16的可靠度。因此，通信设备确定u 14为第二信息比特。如果集合S 4中只有一个信息比特，则该信息比特为第二信息比特。
由于第四码的信息比特数量为6，因此，还需从P 6＝[0000011001110011]中选择一个信息比特修改为冻结比特。通信设备可根据确定集合S 3相同的原理，从P 6指示的信息比特中确定集合S 5；例如，S 5＝[u 6，u 7，u 12，u 16]。通信设备从S 5中获取第三信息比特。例如，第三信息比特为u 6，通信设备将所述P 6中的u 6修改为冻结比特，得到二进制矢量P 4，P 4＝[0000001001110011]。通信设备将第四码的各个比特填充值之后，就得到u 16。然后通信设备对u 16进行编码，得到c 16，c 16＝u 16F 16。
303、通信设备输出编码后的比特序列。
本申请实施例中，通信设备对根据第一码的二进制矢量P 1对该待编码的信息比特序列进行编码，获取编码后的比特序列之后，输出编码后的比特序列。通信设备输出该编码后的比特序列之后，可以发送该编码后的比特序列。
通过实施图3所描述的方法，通信设备接收待编码的信息比特序列之后，可根据第一码的二进制矢量P 1对该待编码的信息比特序列进行编码，获取编码后的比特序列，并输出编码后的比特序列。可见，图3所描述的方法，提供了一种新的编码方式，通过这种编码方式进行编码，在译码过程中可以进行并行译码，有利于减小译码时延。
如图8所示，图8是本申请实施例提供的另一种编码方法的流程示意图。如图8所示，该编码方法包括如下步骤801～805。步骤801可参见步骤301的描述，在此不赘述。步骤802～步骤804为通信设备根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码，获取编码后的比特序列的一种具体实现方式。步骤805为步骤303的一种具体实现方式。其中：
801、通信设备获取待编码的信息比特序列。
802、通信设备根据第一码的二进制矢量P 1确定第七码的二进制矢量P 7。
关于第一码的二进制矢量P 1的描述和第一码的二进制矢量P 1的确定方式可参见上述图3所对应的实施例中相应的描述，在此不赘述。
二进制矢量P 7指示第七码的信息比特、冻结比特和免发送比特。第七码的码长为n 7，第七码的信息比特数量为k 7，第七码的免发送比特数量为n 1-n 7，k 7等于待编码的信息比特 序列的长度，n 7为大于k 7的整数，
Figure PCTCN2020082846-appb-000025
k 1大于或等于k 7。可选的，k 1＝k 7+n 1-n 7。
例如，第七码为(13，6)码，第一码可以为(16，9)码或者(16，6)码。第七码为(50，2)码，第一码可以为(64，16)码或者(64，2)码。
在二进制矢量P 7中可通过预设值指示免发送比特。例如，以预设值为2为例。p 7,z＝1时，表示第七码的编码前的比特中第z位为信息比特。p 7,z＝0时，表示第七码的编码前的比特中第z位为冻结比特。p 7,z＝2时，表示第七码的编码后的比特中第z位为免发送比特。或者，预设值可以为3、4或5等其他数值。
下面对k 1＝k 7+n 1-n 7时，通信设备根据第一码的二进制矢量P 1确定第七码的二进制矢量P 7的具体实施方式进行介绍：
通信设备按照第一预设规则依次将P 1中指示信息比特的元素修改为指示免发送比特的元素，直到P 1中指示免发送比特的元素的数量等于n 1-n 7，得到二进制向量P 7，该免发送比特的值独立于第七码的信息比特的值。基于该实施方式确定的P 7，可以使编码后得到的第二比特序列不缺失信息比特对应的内容，有利于保证信息的完整性。可选的，在该实施方式中，免发送比特也可称为缩短(shorten)比特。
可选的，通信设备具体基于第一二进制序列和第二二进制序列，按照第一预设规则依次将P 1中指示信息比特的元素修改为指示免发送比特的元素，直到P 1中指示免发送比特的元素的数量等于n 1-n 7，得到二进制向量P 7。其中，第一二进制序列中包括从大到小顺序排列或从小到大顺序排列的P 1中的元素的二进制序号。第二二进制序列中也包括P 1中的元素的二进制序号。第一二进制序列和第二二进制序列相交织。
举例来说，通信设备接收待编码的信息比特序列之后，可以先确定第七码的信息比特数量。其中，第七码的信息比特数量等于待编码的信息比特序列的长度。通信设备确定第七码的信息比特数量之后，根据第七码的码长和信息比特数量确定第一码的码长n 1和信息比特数量k 1。其中，第七码的码长可以是预先设定好的。例如，以第七码的码长为n 7为13，第七码的信息比特数量k 7等于6为例。由于，
Figure PCTCN2020082846-appb-000026
k 1＝k 7+n 1-n 7。通信设备确定第一码的码长n 1为16，信息比特数量k 1为9。之后，通信设备根据第一码的码长n 1和信息比特数量k 1确定第二码和第三码的码长和信息比特数量。通信设备确定第二码和第三码的码长和信息比特数量之后，确定第二码的P 2和第三码的P 3，再根据P 2和P 3确定P 1。
例如，P 2＝P 3＝[0111]。
Figure PCTCN2020082846-appb-000027
如图9所示，图9的左侧框表示第一二进制序列，第一二进制序列包括P 1中的元素的二进制序号，左侧框中二进制序列号按照从上到下序列号依次增大的顺序排列。0000表示P 1中的第1个元素的序号0，0001表示P 1中的第2个元素的序号1，…，以此类推，1111表示P 1中的第16个元素的序号15。 图9的右侧框表示第二二进制序列，图9的右侧框中的二进制序号与左侧框中的二进制序号相交织。
如图9所示，通信设备可以按照从下到上的顺序从第一二进制序列和第二二进制序列中确定用于指示免发送比特的元素，直到P 1中用于指示免发送比特的元素的数量等于3。以元素值为2用于指示免发送比特为例。通信设备第一次从第一二进制序列中确定1111对应的元素用于指示免发送比特。因此，通信装置将P 1中第16个元素的值修改为2。通信设备第二次从第二二进制序列中确定1011对应的元素用于指示免发送比特。因此，通信装置将P 1中第12个元素的值修改为2。通信设备第三次从第一二进制序列中确定1110对应的元素用于指示免发送比特。因此，通信装置将P 1中第15个元素的值修改为2。最终P 7＝[0000011101120122]。
其中，该免发送比特的值独立于第七码的信息比特的值。辅以对应的篱笆图进行说明。图10所示的篱笆图的第一外码为图11所示的篱笆图的第二内码。图10所示的篱笆图的第一内码为图11所示的篱笆图的第二外码。通信设备可通过图10或图11所示的篱笆图的编码过程进行编码。如图10和图11所示，u 6，u 7，u 8，u 10，u 11，u 14为信息比特，u 1，u 2，u 3，u 4，u 5，u 9，u 13为冻结比特，c 12，c 15，c 16为免发送比特，u 12，u 15，u 16为免发送比特对应的编码前的比特。从图10和图11中可以看出，免发送比特c 16的值基于u 16的值确定。免发送比特c 12的值基于u 12和u 16的值确定。免发送比特c 15的值基于u 15和u 16的值确定。免发送比特c 16、c 16和c 16与信息比特的值没有关系。因此，即使将c 16、c 16和c 16去除，第二比特序列中也不会缺失信息比特对应的内容，有利于保证信息的完整性。
当然，如果第一二进制序列中包括从大到小排列的P 1中的元素的二进制序号，则通信设备可以按照从上到下的顺序从第一二进制序列和第二二进制序列中确定用于指示免发送比特的元素，具体实现原理与通信设备按照从下到上的顺序从第一二进制序列和第二二进制序列中确定用于指示免发送比特的元素的原理相同，在此不赘述。
下面对k 1＝k 7时，通信设备根据第一码的二进制矢量P 1确定第七码的二进制矢量P 7的具体实施方式进行介绍：
通信设备按照第二预设规则依次将P 1中指示冻结比特的元素修改为指示免发送比特的元素，直到P 1中指示免发送比特的元素的数量等于n 1-n 7，得到二进制向量P 7。基于该实施方式，能够合理地确定的免发送比特。可选的，在该实施方式中，免发送比特也可称为打孔(puncture)比特。
可选的，通信设备具体基于第一二进制序列和第二二进制序列，按照第二预设规则依次将P 1中指示冻结比特的元素修改为指示免发送比特的元素，直到P 1中指示免发送比特的元素的数量等于n 1-n 7，得到二进制向量P 7。其中，第一二进制序列中包括从大到下排列或从小到大顺序排列的P 1中的元素的二进制序号。第二二进制序列中也包括P 1中的元素的二进制序号。第一二进制序列和第二二进制序列相交织。
举例来说，以第七码的码长为n 7为13，第七码的信息比特数量k 7等于6为例。通信设备基于上述示例中相同的原理确定
Figure PCTCN2020082846-appb-000028
通信设备确定第一 二进制序列和第二二进制序列。关于第一二进制序列和第二二进制序列的描述可参见上述描述。
如图9所示，通信设备按照从上到下的顺序从第一二进制序列和第二二进制序列中确定用于指示免发送比特的元素，直到P 1中用于指示免发送比特的元素的数量为3。以元素值为2用于指示免发送比特为例。通信设备第一次从第一二进制序列中确定0000对应的元素用于指示免发送比特。因此，通信装置将P 1中第1个元素的值修改为2。通信设备第二次从第二二进制序列中确定0100对应的元素用于指示免发送比特。因此，通信装置将P 1中第5个元素的值修改为2。通信设备第三次从第一二进制序列中确定0001对应的元素用于指示免发送比特。因此，通信装置将P 1中第2个元素的值修改为2。最终P 7＝[2200201001110011]。
当然，如果第一二进制序列中包括从大到小排列的P 1中的元素的二进制序号，则通信设备可以按照从下到上的顺序从第一二进制序列和第二二进制序列中确定用于指示免发送比特的元素，具体实现原理与通信设备按照从下到上的顺序从第一二进制序列和第二二进制序列中确定用于指示免发送比特的元素的原理相同，在此不赘述。
803、通信设备根据第七码的二进制矢量P 7对待编码的信息比特序列进行编码，得到长度为n 1的编码后的第一比特序列。
804、通信设备将第一比特序列中的免发送比特去除，得到长度为n 7的第二比特序列。
805、通信设备输出第二比特序列。
作为一种可选的实施方式，免发送比特对应的编码前的比特的值为收发端预先约定的值。
举例来说，以第七码的二进制矢量P 7＝[0000011101120122]为例。如图10或图11所示，u 6，u 7，u 8，u 10，u 11，u 14为信息比特，u 1，u 2，u 3，u 4，u 5，u 9，u 13为冻结比特，u 12，u 15，u 16为免发送比特对应的编码前的比特。通信设备在u 6，u 7，u 8，u 10，u 11，u 14填充接收的待编码的信息比特序列中的信息，在冻结比特u 1，u 2，u 3，u 4，u 5，u 9，u 12，u 13，u 15，u 16填充收发端预先约定的固定值，如0。通信设备在u 12，u 15，u 16填充收发端预先约定的值。通信设备在免发送比特填充的值可以与在冻结比特填充的固定值相同或不相同。通信设备对u 1～u 16进行编码之后，得到第一比特序列c 1～c 16。通信设备将免发送比特c 16、c 15和c 12去除，剩余的比特c 1～c 11、c 13和c 14组成第二比特序列。通信设备输出第二比特序列。
基于图8所描述的方法，通信设备能够构造出任意码长的码。
本申请实施例还提供了另一种编码方法，下面继续对另一种编码方法进行介绍：
在通信设备接收待编码的信息比特序列之后，通信设备根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码，获取编码后的比特序列。通信设备获取编码后的比特序列之后，输出编码后的比特序列。其中，P 1指示第一码的信息比特和冻结比特，P 1根据目标序列和第一码的信息比特数量k 1确定，第一码的信息比特数量k 1等于待编码的信息比特 序列的长度，第一码的码长为n 1，该目标序列为从存储的长度为M的序列中提取的小于或等于n 1的顺序号组成的序列，长度为M的序列中包括M个比特中的每个比特对应的顺序号，M大于或等于n 1。
例如，M为16。通信设备可以存储长度为16的序列。该序列＝[10 14 12 16 13 7 6 9 11 5 2 4 15 8 3 1]。其中，该序列表示比特u 1对应的顺序号为10。比特u 2对应的顺序号为14。比特u 3对应的顺序号为12。比特u 4对应的顺序号为16。比特u 5对应的顺序号为13。比特u 6对应的顺序号为7。比特u 7对应的顺序号为6。比特u 8对应的顺序号为9。比特u 9对应的顺序号为11。比特u 10比特对应的顺序号为5。比特u 11对应的顺序号为2。比特u 12对应的顺序号为4。比特u 13对应的顺序号为15。比特u 14对应的顺序号为8。比特u 15对应的顺序号为3。比特u 16对应的顺序号为1。
假设通信设备接收的待编码的信息比特序列的长度为15。通信设备接收待编码的信息比特序列之后，可确定第一码的信息比特数量为15。第一码的码长可以是预先设定好的，例如为16。即第一码为(16，15)码。通信设备确定第一码之后，根据第一码的码长从存储的长度为16的序列中获取目标序列。目标序列为从存储的长度为M的序列中提取的小于或等于n 1的顺序号组成的序列。由于M和n 1均等于16。因此，目标序列＝[10 14 12 16 13 7 6 9 11 5 2 4 15 8 3 1]。通信设备将目标序列中顺序号小于或等于15的比特确定为信息比特，将目标序列中顺序号大于15的比特确定为冻结比特。因此，通信设备确定的P 1＝[1110111111111111]。
再如，如果通信设备接收的待编码的信息比特序列的长度为9。通信设备接收待编码的信息比特序列之后，可确定第一码的信息比特数量为9。第一码的码长可以是预先设定好的，例如为16。即第一码为(16，9)码。通信设备确定第一码之后，根据第一码的码长从存储的长度为16的序列中获取目标序列。目标序列为从存储的长度为M的序列中提取的小于或等于n 1的顺序号组成的序列。由于M和n 1均等于16。因此，目标序列＝[10 14 12 16 13 7 6 9 11 5 2 4 15 8 3 1]。通信设备将目标序列中顺序号小于或等于9的比特确定为信息比特，将目标序列中顺序号大于9的比特确定为冻结比特。因此，通信设备确定的P1＝[0000011101110111]。
作为一种可选的实施方式，通信设备预先还可以生成长度为M的序列。通信设备生成长度为M的序列的具体实施方式为：从第二码的二进制矢量P 2指示的信息比特中确定集合S 1，集合S 1中包括的信息比特为修改为冻结比特时，能够使第一编码过程中第一内码的至少一个信息比特变为冻结比特；从集合S 1中确定第一信息比特；将P 2中的第一信息比特修改为冻结比特，得到第三码的二进制矢量P 3，第二码的码长为M，第二码的信息比特数量为K，第三码的码长为M，第三码的信息比特数量为K-1；确定第一信息比特对应的顺序号为K；将K从M到1进行遍历，确定长度为M的序列中每个比特对应的顺序号。
可选的，集合S 1中包括多个信息比特，第一信息比特相较于集合S 1中的其他信息比特，第一信息比特修改为冻结比特时，第一内码变为冻结比特的信息比特的可靠度排序最低。或者，第一信息比特也可以是集合S 1中的任意一个信息比特。
其中，这里的第二码和第三码不同于上述图3所描述的实施例中的第二码和第三码。这里的第二码的码长为M，第二码的信息比特数量为K，第三码的码长为M，第三码的信 息比特数量为K-1。
例如，需要生成一个长度为16的序列。首先令K＝16。通信设备根据第二码(16，16)的二进制矢量P 2＝[1111111111111111]，确定第三码(16，15)的P 3。这里可根据与上述方法实施例中确定集合S 3相同的原理从第二码的P 2指示的信息比特中确定集合S 1。再从集合S 1中获取第一信息比特。通信设备将P 2中第一信息比特修改为冻结比特，得到第三码的P 3。例如，第一信息比特为u 4，那么P 3＝[1110111111111111]。通信设备确定长度为16的序列中u 4对应的顺序号为16。
再令K＝15。通信设备根据第二码(16，15)的二进制矢量P 2＝[1110111111111111]，确定第三码(16，14)的P 3。例如，第一信息比特为u 13，那么P 3＝[1110111111110111]。通信设备确定长度为16的序列中u 13对应的顺序号为15。依次类推，直到确定出所有比特对应的顺序号。再将所有比特对应的顺序号组成长度为16的序列，并在通信设备中存储该序列。例如，最终得到的长度为16的序列＝[10 14 12 16 13 7 6 9 11 5 2 4 15 8 3 1]。
本申请实施例中，还给出了M为4096时，根据上述方式得到的长度为4096的序列。该序列包括的顺序号可如下表1所示，该序列可预先存储。
表1：M＝4096的序列
Figure PCTCN2020082846-appb-000029
Figure PCTCN2020082846-appb-000030
Figure PCTCN2020082846-appb-000031
Figure PCTCN2020082846-appb-000032
Figure PCTCN2020082846-appb-000033
Figure PCTCN2020082846-appb-000034
Figure PCTCN2020082846-appb-000035
Figure PCTCN2020082846-appb-000036
Figure PCTCN2020082846-appb-000037
Figure PCTCN2020082846-appb-000038
Figure PCTCN2020082846-appb-000039
Figure PCTCN2020082846-appb-000040
Figure PCTCN2020082846-appb-000041
Figure PCTCN2020082846-appb-000042
Figure PCTCN2020082846-appb-000043
Figure PCTCN2020082846-appb-000044
2的偶数次方长度的序列既可通过本申请实施例提供的上述序列构造方法来构造，也可通过嵌套特性从更长的序列中得到(比如长度为1024的序列可以从上述长度为4096的序列中顺序读取小于或等于1024的序号得到)。通过上述序列构造方法构造的2的偶数次方长度的序列，与通过嵌套特性从更长的序列中得到的2的偶数次方长度的序列可能相同或不相同。例如，如下表2所示，本申请实施例还提供了一种通过上述序列构造方法构造的M＝1024的序列，该序列可预先存储。需要说明的是，可以采用NR、PW序列等方式构造M＝1024的序列。
表2：M＝1024的序列
Figure PCTCN2020082846-appb-000045
Figure PCTCN2020082846-appb-000046
Figure PCTCN2020082846-appb-000047
Figure PCTCN2020082846-appb-000048
Figure PCTCN2020082846-appb-000049
序列的存储方式具有嵌套特性，有助于降低所需的存储单元。具体来说，嵌套特性使得可以利用M长度的序列构造出任意小于M长的母码长度序列。可选的，2的奇数次方的序列可通过嵌套特性从2的偶数次方的较长的序列中读出。例如，当构造长度为8(2的3次方)的序列时，可从长度为M＝16(2的4次方)或更长的偶数次方的序列(例如M＝64，256，1024或4096等等)中顺序取出小于或等于8的顺序号构成长度为8的序列，比如从上述M＝4096的序列中顺序选取即可得到序列[7 6 5 2 4 8 3 1]。按照这种方法，可以从4096长度的母码序列读出2048长的序列，可以从1024长的序列中读出512长的序列。在本实施例中，以从上述4096长的序列中读出2048长度为例进行说明，其顺序号如下表3所示。
表3：长度为2048的序列
Figure PCTCN2020082846-appb-000050
Figure PCTCN2020082846-appb-000051
Figure PCTCN2020082846-appb-000052
Figure PCTCN2020082846-appb-000053
Figure PCTCN2020082846-appb-000054
Figure PCTCN2020082846-appb-000055
Figure PCTCN2020082846-appb-000056
Figure PCTCN2020082846-appb-000057
本发明实施例可以根据上述方法示例对设备进行功能模块的划分，例如，可以对应各个功能划分各个功能模块，也可以将两个或两个以上的功能集成在一个模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。需要说明的是，本发明实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。
请参见图6，图6示出了本申请实施例的一种通信设备的结构示意图。图6所示的通信设备可以用于执行上述图3所描述的方法实施例中通信设备的部分或全部功能。图6所示的通信设备可以包括处理模块601和通信模块602。其中：
通信模块602，用于获取待编码的信息比特序列；处理模块601，用于根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码，获取编码后的比特序列；其中，P 1根据第二码的二进制矢量P 2和第三码的二进制矢量P 3确定，P 1指示第一码的信息比特和冻结比特，P 2指示第二码的信息比特和冻结比特，P 3指示第三码的信息比特和冻结比特，第一码的码长为n 1，第一码的信息比特数量为k 1，第二码的码长为n 2，第二码的信息比特数量为k 2，第三码的码长为n 3，第三码的信息比特数量为k 3，n 1＝n 2*n 3，k 1＝k 2*k 3；处理模块601，还用于输出编码后的比特序列。
Figure PCTCN2020082846-appb-000058
可选的，P 2等于P 3。
可选的，k 1＝k 4，k 4为待编码的信息比特序列的长度。
可选的，k 4<k 1，
Figure PCTCN2020082846-appb-000059
其中，k 4为待编码的信息比特序列的长度。
可选的，处理模块601根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码的方式具体为：根据P 1确定第四码对应的二进制矢量P 4，P 4指示第四码的信息比特和冻结比特，第四码的码长为n 4，第四码的信息比特数量为k 4，n 4＝n 1；根据P 4对待编码的信息比特序列进行编码。
可选的，集合S 2为集合S 1的子集，集合S 1为P 1指示的信息比特组成的信息比特集合，S 2为P 4指示的信息比特组成的信息比特集合。
可选的，处理模块601根据P 1确定第四码对应的二进制矢量P 4的方式具体为：从集合S 1中确定集合S 3，集合S 3中包括的信息比特修改为冻结比特时，能够使第一编码过程中第一内码的至少一个信息比特变为冻结比特；从集合S 3中确定第一信息比特；将P 1中的第一信息比特修改为冻结比特，得到二进制矢量P 5；根据二进制矢量P 5得到第一码的二进制矢量P 4。
可选的，集合S 3中包括多个信息比特，第一信息比特相较于集合S 3中的其他信息比特，第一信息比特修改为冻结比特时，第一内码变为冻结比特的信息比特的可靠度排序最低。
可选的，处理模块601根据二进制矢量P 5得到第一码的二进制矢量P 4的方式具体为：从P 5指示的信息比特中确定集合S 4，集合S 4中包括的信息比特为修改为冻结比特时，能够使第二编码过程中第二内码的至少一个信息比特变为冻结比特，第一内码为第二编码过程中的外码，第二内码为第一编码过程中的外码；从集合S 4中确定第二信息比特；将P 5中的第二信息比特修改为冻结比特，得到二进制矢量P 6；根据二进制矢量P 6得到第一码的二进制矢量P 4。
可选的，集合S 4中包括多个信息比特，第二信息比特相较于集合S 4中的其他信息比特，第二信息比特修改为冻结比特时，第二内码变为冻结比特的信息比特的可靠度排序最低。
可选的，n 1、n 2和n 3为2的整数次方。
请参见图6，图6示出了本申请实施例的一种通信设备的结构示意图。图6所示的通信设备可以用于执行上述方法实施例中通信设备的部分或全部功能。图6所示的通信设备 可以包括处理模块601和通信模块602。其中：
通信模块602，用于获取待编码的信息比特序列；处理模块601，用于根据第一码的二进制矢量P 1对待编码的信息比特序列进行编码，获取编码后的比特序列；其中，P 1指示第一码的信息比特和冻结比特，P 1根据目标序列和第一码的信息比特数量k 1确定，第一码的信息比特数量k 1等于待编码的信息比特序列的长度，第一码的码长为n 1，目标序列为从存储的长度为M的序列中提取的小于或等于n 1的顺序号组成的序列，长度为M的序列中包括M个比特中的每个比特对应的顺序号，M大于或等于n 1；处理模块601，还用于输出编码后的比特序列。
可选的，处理模块601，还用于从第二码的二进制矢量P 2指示的信息比特中确定集合S 1，集合S 1中包括的信息比特为修改为冻结比特时，能够使第一编码过程中第一内码的至少一个信息比特变为冻结比特；处理模块601，还用于从集合S 1中确定第一信息比特；处理模块601，还用于将P 2中的第一信息比特修改为冻结比特，得到第三码的二进制矢量P 3，第二码的码长为M，第二码的信息比特数量为K，第三码的码长为M，第三码的信息比特数量为K-1；处理模块601，还用于确定第一信息比特对应的顺序号为K，以及将K从M到1进行遍历，确定长度为M的序列中每个比特对应的顺序号。
可选的，集合S 1中包括多个信息比特，第一信息比特相较于集合S 1中的其他信息比特，第一信息比特修改为冻结比特时，第一内码变为冻结比特的信息比特的可靠度排序最低。
请参见图7，图7是本申请实施例公开的一种通信设备的结构示意图。如图7所示，该通信设备包括处理器701、存储器702和通信接口703。其中，处理器701、存储器702和通信接口703相连。
其中，处理器701可以是中央处理器(central processing unit，CPU)，通用处理器，协处理器，数字信号处理器(digital signal processor，DSP)，专用集成电路(application-specific integrated circuit，ASIC)，现场可编程门阵列(field programmable gate array，FPGA)或者其他可编程逻辑器件、晶体管逻辑器件、硬件部件或者其任意组合。该处理器701也可以是实现计算功能的组合，例如包含一个或多个微处理器组合，DSP和微处理器的组合等等。
其中，通信接口703用于实现与其他通信设备或同一通信设备中的其他通信组件之间的通信。
其中，处理器701调用存储器702中存储的程序代码，可执行上述方法实施例中通信设备所执行的步骤。存储器702还用于存储执行上述方法过程中的缓存数据。可选的，存储器702还用于存储表1中的序列或类似序列。存储器702与处理器701相互耦合，可选的，还可以集成在一起。
本发明实施例还提供一种计算机可读存储介质，该计算机可读存储介质中存储有指令，当其在处理器上运行时，上述方法实施例的方法流程得以实现。
本发明实施例还提供一种计算机程序产品，当所述计算机程序产品在处理器上运行时，上述方法实施例的方法流程得以实现。
本申请实施例还提供了一种芯片系统，该芯片系统包括处理器，用于支持通信设备以实现上述实施例中所涉及的功能，例如生成或处理上述方法中所涉及的数据和/或信息。
在一种可能的设计中，所述芯片系统还可以包括存储器，该存储器，用于保存必要的程序指令和数据。该芯片系统，可以由芯片构成，也可以包含芯片和其他分立器件。
基于同一发明构思，本申请实施例中提供的通信设备解决问题的原理与本申请方法实施例中接入网设备或第一节点解决问题的原理相似，因此各设备的实施可以参见方法的实施，为简洁描述，在这里不再赘述。
在上述实施例中，对各个实施例的描述都各有侧重，某个实施例中没有详述的部分，可以参见其他实施例的相关描述。
最后应说明的是：以上各实施例仅用以说明本申请的技术方案，而非对其限制；尽管参照前述各实施例对本申请进行了详细的说明，本领域的普通技术人员应当理解：其依然可以对前述各实施例所记载的技术方案进行修改，或者对其中部分或者全部技术特征进行等同替换；而这些修改或者替换，并不使相应技术方案的本质脱离本申请各实施例技术方案的范围。

Claims (41)

  1. 一种编码方法，其特征在于，所述方法包括：
    获取待编码的信息比特序列；
    根据第一码的二进制矢量P 1对所述待编码的信息比特序列进行编码，获取编码后的比特序列；其中，所述P 1根据第二码的二进制矢量P 2和第三码的二进制矢量P 3确定，所述P 1指示所述第一码的信息比特和冻结比特，所述P 2指示所述第二码的信息比特和冻结比特，所述P 3指示所述第三码的信息比特和冻结比特，所述第一码的码长为n 1，所述第一码的信息比特数量为k 1，所述第二码的码长为n 2，所述第二码的信息比特数量为k 2，所述第三码的码长为n 3，所述第三码的信息比特数量为k 3，n 1＝n 2*n 3，k 1＝k 2*k 3；
    输出所述编码后的比特序列。
  2. 根据权利要求1所述的方法，其特征在于，
    Figure PCTCN2020082846-appb-100001
  3. 根据权利要求1或2所述的方法，其特征在于，n 2＝n 3，k 2＝k 3。
  4. 根据权利要求3所述的方法，其特征在于，所述P 2等于所述P 3。
  5. 根据权利要求1～4中任意一项所述的方法，其特征在于，k 1＝k 4，所述k 4为所述待编码的信息比特序列的长度。
  6. 根据权利要求1～4中任意一项所述的方法，其特征在于，
    Figure PCTCN2020082846-appb-100002
    其中，所述k 4为所述待编码的信息比特序列的长度。
  7. 根据权利要求6所述的方法，其特征在于，所述根据第一码的二进制矢量P 1对所述待编码的信息比特序列进行编码，包括：
    根据所述P 1确定第四码对应的二进制矢量P 4，所述P 4指示所述第四码的信息比特和冻结比特，所述第四码的码长为n 4，所述第四码的信息比特数量为k 4，n 4＝n 1；
    根据所述P 4对所述待编码的信息比特序列进行编码。
  8. 根据权利要求7所述的方法，其特征在于，集合S 2为集合S 1的子集，所述集合S 1为所述P 1指示的信息比特组成的信息比特集合，所述S 2为所述P 4指示的信息比特组成的信息比特集合。
  9. 根据权利要求8所述的方法，其特征在于，所述根据所述P 1确定所述第四码对应的二进制矢量P 4，包括：
    从所述集合S 1中确定集合S 3，所述集合S 3中包括的信息比特修改为冻结比特时，能 够使第一编码过程中第一内码的至少一个信息比特变为冻结比特；
    从所述集合S 3中确定第一信息比特；
    将所述P 1中的第一信息比特修改为冻结比特，得到二进制矢量P 5；
    根据所述二进制矢量P 5得到所述第一码的二进制矢量P 4。
  10. 根据权利要求9所述的方法，其特征在于，所述集合S 3中包括多个信息比特，所述第一信息比特相较于所述集合S 3中的其他信息比特，所述第一信息比特修改为冻结比特时，第一内码变为冻结比特的信息比特的可靠度排序最低。
  11. 根据权利要求9或10所述的方法，其特征在于，所述根据所述二进制矢量P 5得到所述第一码的二进制矢量P 4，包括：
    从所述P 5指示的信息比特中确定集合S 4，所述集合S 4中包括的信息比特为修改为冻结比特时，能够使第二编码过程中第二内码的至少一个信息比特变为冻结比特，所述第一内码为第二编码过程中的外码，所述第二内码为第一编码过程中的外码；
    从所述集合S 4中确定第二信息比特；
    将所述P 5中的第二信息比特修改为冻结比特，得到二进制矢量P 6；
    根据所述二进制矢量P 6得到所述第一码的二进制矢量P 4。
  12. 根据权利要求11所述的方法，其特征在于，所述集合S 4中包括多个信息比特，所述第二信息比特相较于所述集合S 4中的其他信息比特，所述第二信息比特修改为冻结比特时，第二内码变为冻结比特的信息比特的可靠度排序最低。
  13. 根据权利要求1～12中任意一项所述的方法，其特征在于，所述n 1、所述n 2和所述n 3为2的整数次方。
  14. 根据权利要求1～5中任意一项所述的方法，其特征在于，所述根据第一码的二进制矢量P 1对所述待编码的信息比特序列进行编码，获取编码后的比特序列，包括：
    根据第一码的二进制矢量P 1确定第七码的二进制矢量P 7，所述二进制矢量P 7指示所述第七码的信息比特、冻结比特和免发送比特，所述第七码的码长为n 7，所述第七码的信息比特数量为k 7，所述第七码的免发送比特数量为n 1-n 7，所述k 7等于所述待编码的信息比特序列的长度，所述n 7为大于所述k 7的整数，
    Figure PCTCN2020082846-appb-100003
    所述k 1大于或等于k 7；
    根据所述第七码的二进制矢量P 7对所述待编码的信息比特序列进行编码，得到长度为n 1的编码后的第一比特序列；
    将所述第一比特序列中的所述免发送比特去除，得到长度为n 7的第二比特序列；
    所述输出所述编码后的比特序列，包括：
    输出所述第二比特序列。
  15. 根据权利要求14所述的方法，其特征在于，所述k 7＝k 1+n 1-n 7，所述根据第一码的二进制矢量P 1确定第七码的二进制矢量P 7，包括：
    按照第一预设规则依次将P 1中指示信息比特的元素修改为指示免发送比特的元素，直到所述P 1中指示免发送比特的元素的数量等于n 1-n 7，得到二进制向量P 7，所述免发送比特的值独立于所述第七码的信息比特的值。
  16. 一种编码方法，其特征在于，该方法包括：
    获取待编码的信息比特序列；
    根据第一码的二进制矢量P 1对所述待编码的信息比特序列进行编码，获取编码后的比特序列；其中，所述P 1指示所述第一码的信息比特和冻结比特，所述P 1根据目标序列和所述第一码的信息比特数量k 1确定，所述第一码的信息比特数量k 1等于待编码的信息比特序列的长度，所述第一码的码长为n 1，所述目标序列为从存储的长度为M的序列中提取的小于或等于n 1的顺序号组成的序列，所述长度为M的序列中包括所述M个比特中的每个比特对应的顺序号，所述M大于或等于所述n 1；
    输出编码后的比特序列。
  17. 根据权利要求16所述的方法，其特征在于，所述方法还包括：
    从第二码的二进制矢量P 2指示的信息比特中确定集合S 1，所述集合S 1中包括的信息比特为修改为冻结比特时，能够使第一编码过程中第一内码的至少一个信息比特变为冻结比特；从所述集合S 1中确定第一信息比特；
    将所述P 2中的所述第一信息比特修改为冻结比特，得到第三码的二进制矢量P 3，所述第二码的码长为M，所述第二码的信息比特数量为K，所述第三码的码长为M，所述第三码的信息比特数量为K-1；
    确定所述第一信息比特对应的顺序号为K；
    将所述K从所述M到1进行遍历，确定长度为所述M的序列中每个比特对应的顺序号。
  18. 根据权利要求17所述的方法，其特征在于，所述集合S 1中包括多个信息比特，所述第一信息比特相较于集合S 1中的其他信息比特，所述第一信息比特修改为冻结比特时，所述第一内码变为冻结比特的信息比特的可靠度排序最低。
  19. 根据权利要求16～18中任意一项所述的方法，其特征在于，所述M为4096时，所述长度为M的序列如表1所示，和/或，所述M为1024时，所述长度为M的序列如表2所示，和/或，所述M为2048时，所述长度为M的序列如表3所示。
  20. 一种通信设备，其特征在于，所述通信设备包括：
    通信模块，用于获取待编码的信息比特序列；
    处理模块，用于根据第一码的二进制矢量P 1对所述待编码的信息比特序列进行编码， 获取编码后的比特序列；其中，所述P 1根据第二码的二进制矢量P 2和第三码的二进制矢量P 3确定，所述P 1指示所述第一码的信息比特和冻结比特，所述P 2指示所述第二码的信息比特和冻结比特，所述P 3指示所述第三码的信息比特和冻结比特，所述第一码的码长为n 1，所述第一码的信息比特数量为k 1，所述第二码的码长为n 2，所述第二码的信息比特数量为k 2，所述第三码的码长为n 3，所述第三码的信息比特数量为k 3，n 1＝n 2*n 3，k 1＝k 2*k 3；
    所述处理模块，还用于输出所述编码后的比特序列。
  21. 根据权利要求20所述的通信设备，其特征在于，
    Figure PCTCN2020082846-appb-100004
  22. 根据权利要求20或21所述的通信设备，其特征在于，n 2＝n 3，k 2＝k 3。
  23. 根据权利要求22所述的通信设备，其特征在于，所述P 2等于所述P 3。
  24. 根据权利要求20～23中任意一项所述的通信设备，其特征在于，k 1＝k 4，所述k 4为所述待编码的信息比特序列的长度。
  25. 根据权利要求20～23中任意一项所述的通信设备，其特征在于，
    Figure PCTCN2020082846-appb-100005
    其中，所述k 4为所述待编码的信息比特序列的长度。
  26. 根据权利要求25所述的通信设备，其特征在于，所述处理模块根据第一码的二进制矢量P 1对所述待编码的信息比特序列进行编码的方式具体为：
    根据所述P 1确定第四码对应的二进制矢量P 4，所述P 4指示所述第四码的信息比特和冻结比特，所述第四码的码长为n 4，所述第四码的信息比特数量为k 4，n 4＝n 1；
    根据所述P 4对所述待编码的信息比特序列进行编码。
  27. 根据权利要求26所述的通信设备，其特征在于，集合S 2为集合S 1的子集，所述集合S 1为所述P 1指示的信息比特组成的信息比特集合，所述S 2为所述P 4指示的信息比特组成的信息比特集合。
  28. 根据权利要求27所述的通信设备，其特征在于，所述处理模块根据所述P 1确定所述第四码对应的二进制矢量P 4的方式具体为：
    从所述集合S 1中确定集合S 3，所述集合S 3中包括的信息比特修改为冻结比特时，能够使第一编码过程中第一内码的至少一个信息比特变为冻结比特；
    从所述集合S 3中确定第一信息比特；
    将所述P 1中的第一信息比特修改为冻结比特，得到二进制矢量P 5；
    根据所述二进制矢量P 5得到所述第一码的二进制矢量P 4。
  29. 根据权利要求28所述的通信设备，其特征在于，所述集合S 3中包括多个信息比特，所述第一信息比特相较于所述集合S 3中的其他信息比特，所述第一信息比特修改为冻结比特时，第一内码变为冻结比特的信息比特的可靠度排序最低。
  30. 根据权利要求28或29所述的通信设备，其特征在于，所述处理模块根据所述二进制矢量P 5得到所述第一码的二进制矢量P 4的方式具体为：
    从所述P 5指示的信息比特中确定集合S 4，所述集合S 4中包括的信息比特为修改为冻结比特时，能够使第二编码过程中第二内码的至少一个信息比特变为冻结比特，所述第一内码为第二编码过程中的外码，所述第二内码为第一编码过程中的外码；
    从所述集合S 4中确定第二信息比特；
    将所述P 5中的第二信息比特修改为冻结比特，得到二进制矢量P 6；
    根据所述二进制矢量P 6得到所述第一码的二进制矢量P 4。
  31. 根据权利要求30所述的通信设备，其特征在于，所述集合S 4中包括多个信息比特，所述第二信息比特相较于所述集合S 4中的其他信息比特，所述第二信息比特修改为冻结比特时，第二内码变为冻结比特的信息比特的可靠度排序最低。
  32. 根据权利要求20～31中任意一项所述的通信设备，其特征在于，所述n 1、所述n 2和所述n 3为2的整数次方。
  33. 根据权利要求20～24中任意一项所述的通信设备，其特征在于，
    所述处理模块根据第一码的二进制矢量P 1对所述待编码的信息比特序列进行编码，获取编码后的比特序列的方式具体为：
    根据第一码的二进制矢量P 1确定第七码的二进制矢量P 7，所述二进制矢量P 7指示所述第七码的信息比特、冻结比特和免发送比特，所述第七码的码长为n 7，所述第七码的信息比特数量为k 7，所述第七码的免发送比特数量为n 1-n 7，所述k 7等于所述待编码的信息比特序列的长度，所述n 7为大于所述k 7的整数，
    Figure PCTCN2020082846-appb-100006
    所述k 1大于或等于k 7；
    根据所述第七码的二进制矢量P 7对所述待编码的信息比特序列进行编码，得到长度为n 1的编码后的第一比特序列；
    将所述第一比特序列中的所述免发送比特去除，得到长度为n 7的第二比特序列；
    所述处理模块输出所述编码后的比特序列的方式具体为：
    输出所述第二比特序列。
  34. 根据权利要求33所述的通信设备，其特征在于，所述k 7＝k 1+n 1-n 7，所述处理模块根据第一码的二进制矢量P 1确定第七码的二进制矢量P 7的方式具体为：
    按照第一预设规则依次将P 1中指示信息比特的元素修改为指示免发送比特的元素，直到所述P 1中指示免发送比特的元素的数量等于n 1-n 7，得到二进制向量P 7，所述免发送比特 的值独立于所述第七码的信息比特的值。
  35. 一种通信设备，其特征在于，所述通信设备包括：
    通信模块，用于获取待编码的信息比特序列；
    处理模块，用于根据第一码的二进制矢量P 1对所述待编码的信息比特序列进行编码，获取编码后的比特序列；其中，所述P 1指示所述第一码的信息比特和冻结比特，所述P 1根据目标序列和所述第一码的信息比特数量k 1确定，所述第一码的信息比特数量k 1等于待编码的信息比特序列的长度，所述第一码的码长为n 1，所述目标序列为从存储的长度为M的序列中提取的小于或等于n 1的顺序号组成的序列，所述长度为M的序列中包括所述M个比特中的每个比特对应的顺序号，所述M大于或等于所述n 1；
    所述处理模块，还用于输出编码后的比特序列。
  36. 根据权利要求35所述的通信设备，其特征在于，
    所述处理模块，还用于从第二码的二进制矢量P 2指示的信息比特中确定集合S 1，所述集合S 1中包括的信息比特为修改为冻结比特时，能够使第一编码过程中第一内码的至少一个信息比特变为冻结比特；从所述集合S 1中确定第一信息比特；
    所述处理模块，还用于将所述P 2中的所述第一信息比特修改为冻结比特，得到第三码的二进制矢量P 3，所述第二码的码长为M，所述第二码的信息比特数量为K，所述第三码的码长为M，所述第三码的信息比特数量为K-1；
    所述处理模块，还用于确定所述第一信息比特对应的顺序号为K；
    所述处理模块，还用于将所述K从所述M到1进行遍历，确定长度为所述M的序列中每个比特对应的顺序号。
  37. 根据权利要求36所述的通信设备，其特征在于，所述集合S 1中包括多个信息比特，所述第一信息比特相较于集合S 1中的其他信息比特，所述第一信息比特修改为冻结比特时，所述第一内码变为冻结比特的信息比特的可靠度排序最低。
  38. 根据权利要求35～37中任意一项所述的通信设备，其特征在于，所述M为4096时，所述长度为M的序列如表1所示，和/或，所述M为1024时，所述长度为M的序列如表2所示，和/或，所述M为2048时，所述长度为M的序列如表3所示。
  39. 一种计算机可读存储介质，其特征在于，计算机可读存储介质中存储有指令，当其在计算机上运行时，使得上述权利要求1～15中任意一项所述的方法被执行或上述权利要求16～19中任意一项所述的方法被执行。
  40. 一种芯片系统，其特征在于，所述芯片系统包括处理器和接口电路，所述接口电路与所述处理器耦合，
    所述处理器用于执行计算机程序或指令，以实现上述权利要求1～15中任意一项所述的 方法或实现上述权利要求16～19中任意一项所述的方法；
    所述接口电路用于与所述芯片系统之外的其它模块进行通信。
  41. 一种通信设备，其特征在于，所述通信设备包括：
    存储器，所述存储器包括计算机可读指令；
    与所述存储器相连的处理器，所述处理器用于执行所述计算机可读指令，从而使得权利要求1-15中任一项所述的方法或权利要求16-19中任一项所述的方法被执行。
PCT/CN2020/082846 2019-04-29 2020-04-01 一种编码方法及通信设备 WO2020220920A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP20799365.0A EP3952159A4 (en) 2019-04-29 2020-04-01 ENCODING METHOD AND COMMUNICATION DEVICE
BR112021021861A BR112021021861A2 (pt) 2019-04-29 2020-04-01 Método de codificação e dispositivo de comunicações
KR1020217038824A KR20220005540A (ko) 2019-04-29 2020-04-01 인코딩 방법 및 통신 디바이스
US17/511,905 US11764812B2 (en) 2019-04-29 2021-10-27 Encoding method and communications device

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN201910357715 2019-04-29
CN201910357715.5 2019-04-29
CN202010075805.8A CN111865487B (zh) 2019-04-29 2020-01-22 一种编码方法及通信设备
CN202010075805.8 2020-01-22

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/511,905 Continuation US11764812B2 (en) 2019-04-29 2021-10-27 Encoding method and communications device

Publications (1)

Publication Number Publication Date
WO2020220920A1 true WO2020220920A1 (zh) 2020-11-05

Family

ID=72984836

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/082846 WO2020220920A1 (zh) 2019-04-29 2020-04-01 一种编码方法及通信设备

Country Status (6)

Country Link
US (1) US11764812B2 (zh)
EP (1) EP3952159A4 (zh)
KR (1) KR20220005540A (zh)
CN (1) CN111865487B (zh)
BR (1) BR112021021861A2 (zh)
WO (1) WO2020220920A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107800510A (zh) * 2016-09-05 2018-03-13 华为技术有限公司 极化Polar码编码的方法及装置
CN108347301A (zh) * 2017-01-25 2018-07-31 华为技术有限公司 数据的传输方法和装置
WO2018232562A1 (en) * 2017-06-19 2018-12-27 Qualcomm Incorporated POLAR CODE PARITY BITS FOR EARLY STOP
CN109155634A (zh) * 2016-05-12 2019-01-04 华为技术有限公司 实施极化码的设备和方法

Family Cites Families (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106899311B (zh) 2012-09-24 2023-11-03 华为技术有限公司 混合极性码的生成方法和生成装置
CN104124979B (zh) * 2013-04-27 2018-04-17 华为技术有限公司 极性码的译码方法和译码装置
US9007241B2 (en) * 2013-09-16 2015-04-14 Seagate Technology Llc Reduced polar codes
GB2521828A (en) 2013-12-23 2015-07-08 Sony Corp Data encoding and decoding
US10461779B2 (en) * 2015-08-12 2019-10-29 Telefonaktiebolaget Lm Ericsson (Publ) Rate-compatible polar codes
CN108365850B (zh) * 2017-01-26 2022-02-11 华为技术有限公司 编码方法、编码装置和通信装置
CN108574494B (zh) * 2017-03-13 2020-08-25 华为技术有限公司 编译码方法及装置
US10651973B2 (en) * 2017-03-22 2020-05-12 Huawei Technologies Co., Ltd. Method and apparatus for error-correction encoding using a polar code
CN109412608B (zh) * 2017-03-24 2019-11-05 华为技术有限公司 Polar编码方法和编码装置、译码方法和译码装置
CN109150397B (zh) * 2017-03-24 2019-08-27 华为技术有限公司 一种构造极化码序列的方法及装置
CN108631916B (zh) * 2017-03-24 2020-03-31 华为技术有限公司 极化Polar码的速率匹配方法和装置、通信装置
CN108933643B (zh) * 2017-05-24 2021-06-15 华为技术有限公司 编译码方法及装置
CN109039544B (zh) * 2017-06-27 2019-11-19 华为技术有限公司 一种编码方法、无线设备和芯片
US10833705B2 (en) * 2017-08-02 2020-11-10 Qualcomm Incorporated Information bit distribution design for polar codes
CN109547034B (zh) * 2017-09-22 2021-10-01 华为技术有限公司 译码方法及设备、译码器
CN109600194A (zh) * 2017-09-30 2019-04-09 华为技术有限公司 Ploar编码方法和编码装置、译码方法和译码装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109155634A (zh) * 2016-05-12 2019-01-04 华为技术有限公司 实施极化码的设备和方法
CN107800510A (zh) * 2016-09-05 2018-03-13 华为技术有限公司 极化Polar码编码的方法及装置
CN108347301A (zh) * 2017-01-25 2018-07-31 华为技术有限公司 数据的传输方法和装置
WO2018232562A1 (en) * 2017-06-19 2018-12-27 Qualcomm Incorporated POLAR CODE PARITY BITS FOR EARLY STOP

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
HUAWEI ET AL.: "Details of the Polar Code Design", 3GPP TSG RAN WG1 MEETING #87 R1-1611254, 3 November 2016 (2016-11-03), XP051189033 *

Also Published As

Publication number Publication date
CN111865487A (zh) 2020-10-30
EP3952159A1 (en) 2022-02-09
US20220052711A1 (en) 2022-02-17
CN111865487B (zh) 2022-07-29
KR20220005540A (ko) 2022-01-13
EP3952159A4 (en) 2022-08-24
US11764812B2 (en) 2023-09-19
BR112021021861A2 (pt) 2022-01-18

Similar Documents

Publication Publication Date Title
US10581463B2 (en) Communication method using polar code, and wireless device
WO2019158031A1 (zh) 编码的方法、译码的方法、编码设备和译码设备
US10924210B2 (en) Method, apparatus, and device for determining polar code encoding and decoding
CN107800510B (zh) 极化Polar码编码的方法及装置
US20190260503A1 (en) Channel coding method and apparatus in communication system
CN109391343B (zh) 一种Polar码编码方法及装置
US11502704B2 (en) Polar coding method and apparatus
WO2020048537A1 (zh) 级联编码的方法和装置
WO2021254119A1 (zh) 信道编译码方法和通信装置
US11190213B2 (en) Coding method, wireless device, and chip
WO2020220920A1 (zh) 一种编码方法及通信设备
WO2021254291A1 (zh) 一种Polar码速率匹配方法及装置
CN108390739A (zh) 数据处理的方法和装置
RU2796655C1 (ru) Способ кодирования и устройство связи
WO2022007621A1 (zh) 一种Polar码编解码方法及装置
WO2024031285A1 (zh) 一种数据处理方法、装置及设备
WO2023221725A1 (zh) 数据处理方法及电子设备、计算机可读存储介质

Legal Events

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

Ref document number: 20799365

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112021021861

Country of ref document: BR

ENP Entry into the national phase

Ref document number: 2020799365

Country of ref document: EP

Effective date: 20211105

ENP Entry into the national phase

Ref document number: 20217038824

Country of ref document: KR

Kind code of ref document: A

ENP Entry into the national phase

Ref document number: 112021021861

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20211029