WO2024119379A1 - 一种信息比特的确定方法及装置 - Google Patents

一种信息比特的确定方法及装置 Download PDF

Info

Publication number
WO2024119379A1
WO2024119379A1 PCT/CN2022/137015 CN2022137015W WO2024119379A1 WO 2024119379 A1 WO2024119379 A1 WO 2024119379A1 CN 2022137015 W CN2022137015 W CN 2022137015W WO 2024119379 A1 WO2024119379 A1 WO 2024119379A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
length
bits
sent
value
Prior art date
Application number
PCT/CN2022/137015
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 PCT/CN2022/137015 priority Critical patent/WO2024119379A1/zh
Publication of WO2024119379A1 publication Critical patent/WO2024119379A1/zh

Links

Images

Classifications

    • 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

Definitions

  • the present application relates to the field of mobile communication technology, and in particular to a method and device for determining information bits.
  • the code length of the actual communication is different from the code length after Polar code encoding (i.e., the mother code length)
  • the punctured code length matching method first determine the code length matching by puncturing based on the code length of the actual communication and the code length after Polar code encoding, and then determine the puncturing position. After determining the punctured bit position, determine the information bit and the frozen bit for coding construction.
  • the present application provides a method and device for determining information bits, which are used to improve the communication performance when performing Polar code rate matching by puncturing.
  • the present application provides a method for determining an information bit, which can be implemented by a transmitting end.
  • the transmitting end may be a terminal device, a network device, a component in a network device, or a component in a terminal device.
  • the components in the present application may, for example, include at least one of a chip, a chip system, a processor, a transceiver, a processing unit, or a transceiver unit.
  • the method can be implemented by the following steps: the transmitting end determines a first sequence according to the mother code length of the polarization code and the length of the bit to be sent, the mother code length is a positive integer power of 2, and the first sequence is used to adjust the reliability ranking of the bits in the polarization code; the transmitting end can also determine the position of the information bit in the polarization code according to the reliability ranking and the first sequence.
  • the transmitting end can determine the position of the information bit according to the reliability sorting and the first sequence. Since the position of the information bit is not determined only according to the reliability sorting, but the reliability sorting is adjusted through the first sequence to determine the position of the information bit, bad pixels can be avoided and communication performance can be improved.
  • the present application provides a method for determining an information bit, which can be implemented by a receiving end.
  • the receiving end may be a terminal device, a network device, a component in a network device, or a component in a terminal device.
  • the components in the present application may include, for example, at least one of a chip, a chip system, a processor, a transceiver, a processing unit, or a transceiver unit.
  • the method can be implemented by the following steps: the receiving end receives first information, the first information includes the mother code length of the polarization code and the length of the bit to be sent, and the mother code length is a positive integer power of 2; the receiving end can also determine a first sequence according to the mother code length of the polarization code and the length of the bit to be sent, and the first sequence is used to adjust the reliability ranking of the bits in the polarization code; the receiving end can also determine the position of the information bit in the polarization code according to the reliability ranking and the first sequence, and decode the data encoded by the polarization code according to the position of the information bit.
  • the transmitting end or the receiving end may also obtain a first position value of the bit in the polar code, select an offset value from a first sequence according to the first position value, and determine a second position value of the bit in the polar code according to the offset value and the first position value, where the second position value is a position index of the information bit in the polar code.
  • the transmitting end or the receiving end may select an offset value from the first sequence according to the first position value of the polarization code, accurately determine the second position value according to the offset value and the first position value, and index the second position at the position determined as the information bit, thereby improving the accuracy of determining the position of the information bit.
  • the transmitting end or the receiving end may further select an invalid value from the first sequence according to the first position value, and determine, according to the invalid value, not to solve a position index of the information bit in the polar code according to the first position value.
  • determining the position of the information bit according to the first position value corresponding to the invalid value can be ignored, thereby improving the accuracy of determining the information bit.
  • the transmitting end or the receiving end may also determine the sequence number of the sub-block to which the first position value belongs according to the first position value and the sub-block length, and determine the offset value from multiple elements in the first sequence according to the sequence number.
  • the transmitting end or the receiving end can determine the sub-block sequence number according to the sub-block length and the first position value, and read the offset value according to the sub-block sequence number, thereby improving the accuracy of determining the offset value.
  • the second position value is determined according to the offset value, the first position value and the sub-block length.
  • the accuracy of determining the second position value can be improved.
  • the transmitting end or the receiving end may further determine a pre-frozen position of a bit of the polar code according to the mother code length and the length of the bit to be sent, and the pre-frozen position is not used as the position of the information bit.
  • the pre-freeze position can be reasonably determined, further improving the accuracy of determining the second position value.
  • N represents the mother code length of the Polar code
  • floor() represents rounding down.
  • the accuracy in determining the pre-freezing position can be further improved.
  • the first sequence is ⁇ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ 1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA, 1, 1, NA, 0, 0, 0, 0, 0, 0, 0, 0 ⁇ , N is the mother code length, and E is the length of the bits to be sent;
  • the first sequence is ⁇ NA,NA,2,NA,-1,0,0,0,0,0,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA, 3, NA, 2, NA, 1, NA, 0, 0, 0, 0, 0, 0, 0 ⁇ , N is the mother code length, and E is the length of the bits to be sent;
  • the first sequence is ⁇ NA,NA,NA,3,1,NA,1,NA,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA,NA,NA,NA,2,NA,1,NA,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA,NA,NA,4,NA,NA,NA,NA,NA,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent.
  • the accuracy of the first sequence can be improved, and the accuracy of determining the information bit position can be further improved.
  • a communication device which can implement the method respectively executed by a receiving end or a transmitting end in any possible implementation manner of the first aspect or the second aspect.
  • the device may include a module that performs the methods/operations/steps/actions described in the first aspect or the second aspect and any possible implementation above.
  • the module may be a hardware circuit, or software, or a combination of a hardware circuit and software.
  • the device includes a processing unit (sometimes also referred to as a processing module) and a communication unit (sometimes also referred to as a communication module, a transceiver module, or a transceiver unit).
  • the communication unit can implement a sending function and a receiving function. When the communication unit implements the sending function, it may be referred to as a sending unit (sometimes also referred to as a sending module).
  • the communication unit When the communication unit implements the receiving function, it may be referred to as a receiving unit (sometimes also referred to as a receiving module).
  • the sending unit and the receiving unit may be the same functional module, which can implement the sending function and the receiving function; or, the sending unit and the receiving unit may be different functional modules, and the transceiver unit is a general term for these functional modules.
  • the device includes: a processor coupled to a memory, configured to execute instructions in the memory to implement the method described in the first aspect or the second aspect and any possible implementation.
  • the device also includes other components, such as an antenna, an input/output module, a transceiver, a communication interface, etc. These components may be hardware, software, or a combination of software and hardware.
  • a computer-readable storage medium is provided, wherein the computer-readable storage medium is used to store a computer program or instruction, which, when executed, enables the method of any possible implementation manner in the first aspect or the second aspect to be implemented.
  • a computer program product comprising instructions, which, when executed on a computer, enables the method of any possible implementation manner in the first aspect or the second aspect to be implemented.
  • a chip system which includes a logic circuit (or understood as, the chip system includes a processor, the processor may include a logic circuit, etc.), and may also include an input and output interface.
  • the input and output interface can be used to receive messages or to send messages.
  • the input and output interfaces may be the same interface, that is, the same interface can realize both the sending function and the receiving function; or, the input and output interface includes an input interface and an output interface, the input interface is used to realize the receiving function, that is, for receiving messages; the output interface is used to realize the sending function, that is, for sending messages.
  • the logic circuit can be used to perform operations other than the sending and receiving functions in the above-mentioned first aspect or the second aspect and any possible implementation thereof; the logic circuit can also be used to transmit messages to the input and output interface, or to receive messages from other communication devices from the input and output interface.
  • the chip system can be used to implement the method of any possible implementation in the above-mentioned first aspect or the second aspect.
  • the chip system can be composed of chips, or it can include chips and other discrete devices.
  • the chip system may further include a memory, which may be used to store instructions, and the logic circuit may call the instructions stored in the memory to implement corresponding functions.
  • a communication system may include a transmitting end and a receiving end.
  • the transmitting end may be used to execute the method in the first aspect and any possible implementation thereof.
  • the receiving end may be used to execute the method in the second aspect and any possible implementation thereof.
  • FIG1 is a schematic diagram of the architecture of a wireless communication system provided in an embodiment of the present application.
  • FIG2 is a schematic diagram of information bits and fixed bits
  • FIG3A is a schematic diagram of a method for determining information bits provided in an embodiment of the present application.
  • FIG3B is a schematic diagram showing a transmission performance comparison based on NAT punching, NR rate matching and the solution of the present application provided in an embodiment of the present application;
  • FIG3C is a schematic diagram showing a transmission performance comparison between a sub-block interleaving-based transmission method and a transmission performance comparison method according to an embodiment of the present application;
  • FIG4 is a schematic diagram of a transmission process based on Polar code
  • FIG5 is a schematic diagram of a flow chart of a method for determining the position of an information bit provided in an embodiment of the present application
  • FIG6 is a schematic diagram of a method for adjusting a reliability sequence Q based on a first sequence provided in an embodiment of the present application
  • FIG7 is a schematic diagram of a principle of adjusting a reliability sequence Q based on a first sequence provided in an embodiment of the present application;
  • FIG8 is a schematic diagram of another principle of adjusting the reliability sequence Q based on the first sequence provided in an embodiment of the present application.
  • FIG9 is a flow chart of a communication method provided in an embodiment of the present application.
  • FIG10 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application.
  • FIG11 is a schematic diagram of the structure of another communication device provided in an embodiment of the present application.
  • FIG. 12 is a schematic diagram of the structure of another communication device provided in an embodiment of the present application.
  • the method for determining information bits provided in the embodiments of the present application can be applied to the fourth generation (4G) communication system, such as the long term evolution (LTE) communication system, and can also be applied to the fifth generation (5G) communication system, such as the 5G new radio (NR) communication system, or to various future communication systems, such as the sixth generation (6G) communication system.
  • the method provided in the embodiments of the present application can also be applied to a Bluetooth system, a WiFi system, a LoRa system or a vehicle networking system.
  • the method provided in the embodiments of the present application can also be applied to a satellite communication system, wherein the satellite communication system can be integrated with the above-mentioned communication system.
  • the application scenario used in the present application is described by taking the communication system architecture shown in Figure 1 as an example.
  • the communication system 100 includes a network device 101 and a terminal device 102.
  • the apparatus provided in the embodiment of the present application can be applied to the network device 101, or to the terminal device 102.
  • Figure 1 only shows a possible communication system architecture that can be applied to the embodiment of the present application, and in other possible scenarios, the communication system architecture may also include other devices.
  • the network device 101 is a node in a radio access network (RAN), which can also be called a base station, or a RAN node (or device).
  • RAN radio access network
  • some examples of access network devices 101 are: gNB/NR-NB, transmission reception point (TRP), evolved Node B (eNB), radio network controller (RNC), Node B (NB), base station controller (BSC), base transceiver station (BTS), home base station (e.g., home evolved NodeB, or home Node B, HNB), base band unit (BBU), or wireless fidelity (Wifi) access point (AP), satellite equipment, or network equipment in a 5G communication system, or network equipment in a possible future communication system.
  • the network device 101 may also be other devices having network device functions.
  • the network device 101 may also be a device that functions as a network device in device-to-device (D2D) communication, Internet of Vehicles communication, and machine communication.
  • the network device 101 may also be a network device in
  • the gNB may include a centralized unit (CU) and a DU.
  • the gNB may also include a radio unit (RU).
  • the CU implements some functions of the gNB
  • the DU implements some functions of the gNB, for example, the CU implements the functions of the radio resource control (RRC) and packet data convergence protocol (PDCP) layers
  • the DU implements the functions of the radio link control (RLC), media access control (MAC) and physical (PHY) layers.
  • RRC radio resource control
  • PDCP packet data convergence protocol
  • RLC radio link control
  • MAC media access control
  • PHY physical
  • the network device can be a CU node, a DU node, or a device including a CU node and a DU node.
  • the CU may be classified as a network device in the access network RAN, or the CU may be classified as a network device in the core network CN, and no limitation is made here.
  • the terminal device 102 which can also be called user equipment (UE), mobile station (MS), mobile terminal (MT), etc., is a device that provides voice or data connectivity to users, and can also be an IoT device.
  • the terminal device includes a handheld device with wireless connection function, a vehicle-mounted device, etc.
  • terminal devices can be: mobile phones, tablet computers, laptops, PDAs, mobile internet devices (MID), wearable devices (such as smart watches, smart bracelets, pedometers, etc.), vehicle-mounted devices (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), virtual reality (VR) devices, augmented reality (AR) devices, wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electric meters, etc.), intelligent robots, workshop equipment, wireless terminals in unmanned driving, wireless terminals in remote surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, or wireless terminals in smart homes, flight equipment (such as intelligent robots, hot air balloons, drones, airplanes), etc.
  • MID mobile internet devices
  • wearable devices such as smart watches, smart bracelets, pedometers, etc.
  • vehicle-mounted devices such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.
  • VR
  • the terminal device can also be other devices with terminal functions, for example, the terminal device can also be a device that serves as a terminal function in D2D communication.
  • terminal devices with wireless transceiver functions and chips that can be set in the aforementioned terminal devices are collectively referred to as terminal devices.
  • At least one refers to one or more
  • plural refers to two or more.
  • And/or describes the association relationship of associated objects, indicating that three relationships may exist.
  • a and/or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural.
  • the character “/” generally indicates that the previous and next associated objects are in an “or” relationship.
  • At least one of the following” or similar expressions refers to any combination of these items, including any combination of single or plural items.
  • At least one of a, b, or c can represent: a, b, c, a-b, a-c, b-c, or a-b-c, where a, b, c can be single or multiple.
  • ordinal numbers such as “first” and “second” mentioned in the embodiments of the present application are used to distinguish multiple objects, and are not used to limit the size, content, order, timing, priority or importance of multiple objects.
  • first sequence and the second sequence are only used to distinguish different sequences, and do not indicate the difference in length, priority or importance of the two sequences.
  • Polar coding is a channel coding scheme that can be strictly proven to reach the channel capacity. It has the characteristics of high performance, low complexity, and flexible matching. It has been identified by the 3rd Generation Partnership Project (3GPP) as the control channel coding scheme for the 5G control channel enhanced mobile broadband (eMBB) scenario.
  • 3GPP 3rd Generation Partnership Project
  • eMBB enhanced mobile broadband
  • the bit sequence to be encoded is divided into two categories: fixed bits (frozen) and information bits (data) according to their respective reliability.
  • the reliability can be calculated by the mean of the log likelihood ratio (LLR) distribution of the position.
  • LLR log likelihood ratio
  • the bits with higher reliability are set as information bits (data)
  • the bits with lower reliability are set as fixed bits (frozen).
  • the value of the fixed bit is usually set to 0, which is known to both the sender and the receiver in actual transmission.
  • the encoding code length corresponding to Figure 2 is 8 bits (bits), which illustrates that ⁇ u 0 ,u 1 ,u 2 ,u 4 ⁇ are the positions of fixed bits, and ⁇ u 3 ,u 5 ,u 6 ,u 7 ⁇ are the positions of information bits.
  • Each circle in each row represents an exclusive-or operation (or modulo-two addition) between the bit in the row where the circle is located and the row where the circle reaches, and the bit on the right side of the circle is the sum result.
  • Polar code construction refers to the process of obtaining a Polar code based on a given code length N and information bit length K.
  • the length matching method such as puncture, retransmission or truncation
  • the Q sequence is used to characterize the reliability of the subchannel.
  • the value in the Q sequence represents the sequence number of the subchannel, and its position in the sequence represents the reliability of the corresponding subchannel.
  • [0 1 2 4 3 5 6 7] means that the subchannel corresponding to the bit at position 7 in the sequence is the most reliable subchannel, the subchannel corresponding to the bit at position 6 is the second most reliable channel, and so on.
  • Natural order (NAT) puncturing It can also be called sequential puncturing, which means that the first N-E positions of the Polar code with code length E in the natural order are puncturing positions, where N is the mother code length of the Polar code (or the code length before rate matching).
  • Natural order sorting means that the Polar code position values are sorted from small to large.
  • the bits can be pre-frozen (pre-freezing) according to the number of puncturing (N-E) and the natural order is increased, so that the frozen positions are not used as information bits. Based on natural order puncturing, information bits can be selected from the punctured sequence in descending order of reliability.
  • puncturing affects the capacity of the subchannel
  • puncturing affects the reliability of the subchannel corresponding to the bit position in the Polar code. If the information bits are still determined according to the Q sequence determined before puncturing after puncturing, performance failure may occur, resulting in a decrease in communication performance.
  • the horizontal axis E of FIG3B represents the number of information bits
  • the vertical axis represents the symbol signal-to-noise ratio (EsN0) when the block error rate (BLER) reaches 10 ⁇ -2.
  • the solid line in FIG3B represents the SNR performance when punching in the 5G rate matching mode
  • the dotted line represents the signal-to-noise ratio (SNR) performance after NAT punching. It can be seen that after NAT punching, the dotted line shown in FIG3B will have bad points at some positions between the information bit length of 2200 and 2600. After punching, the performance of some bit positions is much lower than that of the unpunched performance. It can be understood that in FIG3B and FIG3C, R represents the code rate.
  • the length of the Polar code mother code is divided into 32 (or other numbers) sub-blocks, and after the sub-blocks are interleaved in the order of Table 1, the first N-E length bits after the sub-block interleaving are punctured, and the corresponding uninterleaved positions are determined as pre-frozen positions.
  • the bits at the pre-frozen positions are not used as information bits.
  • Q[i] is read from the last position of the Q sequence forward. If Q[i] is less than N and the bit position is not a frozen bit, it is selected as an information bit, and the same method is used to select K positions as information bits.
  • the indexes of the corresponding first five P(i) are 0, 1, 2, 4 and 3, respectively, so the punctured positions are the 0-2 sub-blocks, the fourth sub-block, and the first 22 bits of the third sub-block.
  • the bit position indexes of the puncturing after sub-block interleaving are 0 to 9, 16 and 17, and the position indexes of the selected information bits can be 15, 22, 23, 27, 28, 29, 30 and 31.
  • the sub-block interleaving scheme will bring additional processing complexity.
  • the sub-block interleaving scheme still has bad points at some bit positions.
  • the 577th bit will be selected as the information bit, but according to calculations, it is found that the capacity of the sub-channel corresponding to the 577th bit is almost equal to 0, so the 577th bit is selected as the information bit, resulting in the appearance of bad points.
  • the existence of bad points can also be seen from the simulation diagram of Figure 3C.
  • the embodiment of the present application provides a communication method and device for improving communication performance when puncturing in natural order without the need for sub-block interleaving.
  • the method and the device are based on the same concept. Since the method and the device solve the problem in a similar principle, the implementation of the device and the method can refer to each other, and the repeated parts will not be repeated.
  • FIG4 schematically shows a schematic diagram of interaction between a transmitter and a receiver, wherein the source of the transmitter is sent on the channel after undergoing source coding, channel coding, rate matching and modulation in sequence. After receiving the signal, the receiver obtains the destination after demodulation, rate matching, channel decoding and source decoding in sequence.
  • the method provided in the embodiment of the present application can be used in the channel coding and rate matching process.
  • FIG. 5 is a flow chart of a communication method provided by the present application.
  • the method is introduced with a communication device as the execution subject, wherein the communication device can be used as a sending end and/or a receiving end.
  • the method includes:
  • the communication device determines a first sequence according to a mother code length N of the Polar code and a length E of bits to be sent.
  • the mother code length is an integer power of 2.
  • the length E of the bits to be sent is also the code length of the actual communication.
  • the first sequence is used to adjust the reliability order of the bits in the Polar code.
  • the reliability order of the bits in the Polar code may be the order of the bits in the Polar code in the reliability sequence Q. For example, as shown in FIG6, taking the Polar code length as 32 as an example, the order of bit 31 in the Polar code in the sequence Q is 31, that is, the subchannel corresponding to bit 31 is the most reliable subchannel.
  • the first sequence can be used to adjust the order of bits in the Polar code in the reliability sequence, or in other words, the first sequence can be used to determine a new reliability order Q'.
  • the number of elements included in the first sequence is the same as the number of sub-blocks into which the Polar code is divided. For example, assuming that the number of sub-blocks included in the Polar code is 16, the first sequence may include 16 elements, each element corresponding to a sub-block. Alternatively, the number of elements included in the first sequence may be greater than the number of sub-blocks.
  • the elements in the first sequence may be 0, NA, a positive integer, or a negative integer.
  • 0 and a value whose absolute value is less than the number of sub-blocks may be referred to as an offset value
  • NA and a value whose absolute value is greater than or equal to the number of sub-blocks may be referred to as an invalid value.
  • the purpose of the offset value and the invalid value will be introduced in combination with the method of determining the information bit in S102, which will not be expanded here.
  • the communication device determines the first sequence according to the mother code length N of the polarization code and the length E of the bits to be sent, for example, by determining, according to a relationship between a value of N and a value of E, a first sequence corresponding to the value range relationship.
  • the relationship between the values of N and E and the corresponding relationship between the first sequences can be shown in Table 2.
  • the communication device can query Table 2 according to the relationship between the values of N and E to determine the corresponding first sequence.
  • the communication device may also determine the first sequence according to the number of punctures and the mother code length.
  • the number of punctures may be determined according to the mother code length N and the length E of the bits to be sent, for example, the number of punctures is (N-E).
  • the communication device determines the position of the information bit in the Polar code according to the reliability ranking and the first sequence.
  • the communication device may select an offset value from a first sequence according to a first position value of a bit in the polar code according to the first position value, and then determine a second position value of the bit in the polar code according to the offset value and the first position value, where the second position value is a position index of the information bit in the polar code.
  • the communication device may select Q[i] as the first position value in the order of the elements in the reliability sequence Q from large to small, and then determine the offset value from the first sequence according to the first position value.
  • Q[i] is the i-th element in the reliability sequence Q, and its value is the position index of the i-th highest reliability bit of the subcarrier in the Polar code in the Polar code.
  • the communication device may determine the offset value from multiple elements of the first sequence according to the sequence number of the sub-block to which the first position value Q[i] belongs.
  • the sequence number of the sub-block to which the first position value belongs is n, and the sequence number of the sub-block can be expressed as in, represents a round-down operation, and N/M represents the sub-block length.
  • N/M can be taken as a positive number, that is, N can be divided by M.
  • the communication device may determine the second position value according to the offset value, the sub-block length and the first position value, that is, the position index of the information bit in the polar code may be determined according to the offset value, the sub-block length and the first position value.
  • the offset value is an integer whose absolute value is less than M, then optionally, the communication device may use the bit (Q[i]+p*(N/M)) in the Polar code as the second position value, that is, the bit (Q[i]+p*(N/M)) in the Polar code as the information bit.
  • the second position value is a positive integer greater than or equal to 0 and less than N.
  • one of the prerequisites for the second position value to be used as the information bit is that the second position value does not belong to the pre-frozen position, and the number of determined information bits is less than K.
  • the communication device may also determine the pre-frozen position of the bit in the polarization code, and the bit in the pre-frozen position is not used as the position of the information bit.
  • the position of the information bit according to the first sequence shown in Table 2 or Table 3 it is also necessary to determine that the information bit does not belong to the pre-frozen position. For example, the position of the information bit does not belong to the P position indexes with the smallest position index in the polarization code.
  • the number of pre-freeze positions may be determined according to the mother code length and the length of the bits to be sent.
  • the number P of pre-freeze positions may satisfy:
  • floor() means rounding down.
  • the number of pre-frozen positions P 1056-E, where E is the number of information bits.
  • the first (1024-E) positions of the 1024-length Polar code are puncturing positions, so in addition to the puncturing positions, an additional 32 bits need to be frozen.
  • the communication device may determine the position index of the information bit not to be solved according to the first position value according to the invalid value.
  • the method of selecting the invalid value is the same as the method of selecting the offset value.
  • the communication device may determine the sequence number n of the sub-block of the first position value according to the first position value and the sub-block length, and read the nth element from the first sequence according to the sequence number n of the sub-block, wherein the nth element is an invalid value.
  • the sub-block length may also be replaced by the ratio of the mother code length to the number of sub-blocks.
  • the invalid value indicates that the information bit is ignored according to the current first position value Q[i], or it indicates that the second position value cannot be determined according to the current first position value Q[i].
  • the communication device may select the position index of the next bit in the Polar code as the newly selected first position value, and determine the position of the information bit according to the newly selected first position value.
  • the position index of the next bit may be the next bit position value with a lower reliability ranking determined according to the sequence Q.
  • the first sequence is ⁇ NA,NA,NA,NA,2,NA,1,NA,0,0,0,0,0,0,0 ⁇
  • the adjusted sequence Q' is shown in Figure 6. If the value of the nth element in the first sequence is an invalid value, the value of the i-th element in the sequence Q' is an invalid value.
  • Q[i] represents the first position value
  • p represents the offset value
  • N/M represents the sub-block length
  • N represents the mother code length
  • M is the number of sub-blocks.
  • the i-th element Q'[i] in Q'[i] represents the position index of the information bit corresponding to the i-th element Q[i] in the sequence Q, that is, the second position value.
  • the number of bits corresponding to NA in the Q’ sequence is less than or equal to the sum of the number of punctures and the number of non-punctured pre-frozen positions.
  • the index position in the Q’ sequence after marking the NA can be regarded as a shorter sequence.
  • the Q” sequence is a sequence composed of elements after the Q’ sequence removes NA.
  • the order of position values in the Q” sequence corresponds to the reliability order adjusted according to the first sequence, for example, in Figure 6, the descending order corresponding to the reliability from right to left; and the position index not included in the Q” sequence is the position index belonging to the pre-frozen position in the Polar code, where in Figure 6, bits 0 to 11 in the Polar code are puncture positions (pre-frozen positions include puncture positions).
  • the pre-frozen bits are bits 0 to 11, that is, there is no need to freeze additional bits outside the puncture positions.
  • the communication device when executing S102, may determine the information bit according to the first information bit and the first sequence, or may determine the information bit according to the first information bit and the sequence shown in the sequence Q', or may determine the information bit according to the first information bit and the N-long sequence corresponding to the first sequence (for example, referred to as the second sequence), where N is the length of the Polar code mother code.
  • the first information bit and the first sequence or may determine the information bit according to the first information bit and the sequence shown in the sequence Q', or may determine the information bit according to the first information bit and the N-long sequence corresponding to the first sequence (for example, referred to as the second sequence), where N is the length of the Polar code mother code.
  • the N elements in the N-long sequence corresponding to the first sequence correspond one-to-one to the N bits in the sequence Q, where the i-th element P'[i] in the N-long sequence is the value of the first sequence corresponding to the i-th element Q[i] in the sequence Q (that is, the value of the n-th element in the first sequence).
  • the first sequence is represented by P
  • the n-th element is represented by P[n]
  • the N-long sequence corresponding to the first sequence is represented by P'
  • the i-th element is represented by P'[i]
  • P'[i] P[n]
  • the description in the previous text is used.
  • i 0, 1, ..., N-1
  • n 0, 1, ..., M-1.
  • the communication device can also determine the information bit according to the sequence Q".
  • the mother code length N is divided into 16 sub-blocks.
  • the LLR mean value of each sub-channel on the codeword side is L.
  • the LLR mean value of each sub-channel in sub-block x has become A
  • the LLR mean value of each sub-channel in sub-block y has become B
  • the LLR mean value of each sub-channel in sub-block z has become C.
  • the LLR mean value of each bit in sub-block y after full polarization becomes Bi
  • the LLR mean value of each bit in sub-block z after full polarization becomes Ci.
  • the order of sub-blocks x, y, z in the reliability sequence Q will be determined.
  • the LLR mean B' of sub-block y after the log 2 (16) layer is very different from the B value during construction, but is relatively close to the value of A.
  • the LLR mean C' of sub-block x after the log 2 (16) layer is still similar to the original C. Because it is known that B' is close to A, and it is known that the Q sequence contains the ordering relationship of Ai and Ci on the channel side after the density evolution of A and the density evolution of C, the position of x in the Q sequence is used to represent the new y.
  • the adjusted values of the positions x.0, x.1, x.2 and x.127 (indicated by square shadows) in the sequence Q' are the values of the positions y0, y1, y2 and y.127 (indicated by oblique shadows from the lower left to the upper right) of the sequence Q in FIG7.
  • the communication device can determine the position of the information bit according to the reliability sorting and the first sequence. Since the position of the information bit is not determined only according to the reliability sorting, but the reliability sorting is adjusted through the first sequence to determine the position of the information bit, bad pixels can be avoided and communication performance can be improved.
  • the dotted part represents the symbol signal-to-noise ratio performance under different information lengths when NAT punching is used and the position of the information bit is determined based on the method provided in the present application. It can be seen that the method provided in the present application can avoid the occurrence of bad pixels when NAT punching is used, thereby improving communication performance.
  • points with a capacity of 0 will not be selected as information bits, which can avoid the occurrence of bad pixels when 5G sub-block interleaving punching is used, thereby improving communication performance.
  • the bits of this part of N*7/16 ⁇ Q[i] ⁇ N*8/16 are replaced by the bits of this part of N*6/1 ⁇ Q[i] ⁇ N*7/16. After the bits of this part of N*6/16 ⁇ Q[i] ⁇ N*7/16 are occupied, they are replaced by the bits of this part of N*4/16 ⁇ Q[i] ⁇ N*5/16.
  • the replacement process can be represented by the first sequence.
  • each sub-block is 256 long.
  • the embodiment of the present application also provides a method implemented by a transmitting end and a receiving end.
  • the method may include the following steps:
  • S201 The transmitting end determines the position of the information bit in the Polar code.
  • the manner in which the transmitting end determines the position of the information bit can be referred to the process shown in FIG. 5 , which will not be described in detail here.
  • S202 The transmitting end sets the value of the frozen bit position to 0, and maps the to-be-sent bit to the position of the information bit.
  • S203 The transmitting end modulates the Polar code and sends it through the channel.
  • S204 The receiving end demodulates the received signal.
  • S205 The receiving end performs rate matching according to the puncturing position.
  • the receiving end obtains information mapped by the information bits according to the positions of the information bits in the Polar code, that is, obtains the information transmitted by the sending end.
  • the receiving end may determine the position of the information bit with reference to the process shown in FIG. 5 , which will not be described in detail here.
  • the embodiments of the present application also provide a communication device.
  • the communication device may include hardware structures and/or software modules corresponding to the execution of each function.
  • Figures 10 to 12 are schematic diagrams of the structure of possible communication devices provided by embodiments of the present application.
  • the communication device can be used to implement the corresponding functions of the above method embodiments, and thus can also achieve the beneficial effects possessed by the above method embodiments.
  • the communication device can be a network device or terminal device as shown in Figure 1.
  • the description of the above embodiments please refer to the description of the above embodiments.
  • the communication device 1000 includes a processing unit 1010 and a communication unit 1020, wherein the communication unit 1020 may also be a transceiver unit or an input/output interface, etc.
  • the communication device 1000 may be used to implement the functions of the transmitting end or the receiving end in the method embodiments shown in Fig. 5 and/or Fig. 9 above.
  • the communication unit 1020 may be used to obtain the information bit.
  • the processing unit 1010 may be used to determine a first sequence according to a mother code length of the polarization code and a length of a bit to be sent, wherein the mother code length is a positive integer power of 2, and the first sequence is used to adjust the reliability ranking of the bits in the polarization code, and determine the position of the information bit in the polarization code according to the reliability ranking and the first sequence.
  • the communication unit 1020 may be used to send or receive information mapped to the information bit position.
  • the processing unit 1010 may be specifically configured to obtain a first position value of a bit in the polar code, select an offset value from a first sequence according to the first position value, and determine a second position value of the bit in the polar code according to the offset value and the first position value, where the second position value is a position index of an information bit in the polar code.
  • the processing unit 1010 is further configured to select an invalid value from the first sequence according to the first position value, and determine, according to the invalid value, not to solve a position index of an information bit in the polar code according to the first position value.
  • the processing unit 1010 may be specifically configured to determine a sequence number of a sub-block to which the first position value belongs according to the first position value and the sub-block length, and determine the offset value from a plurality of elements in the first sequence according to the sequence number.
  • the second position value is determined according to the offset value, the first position value and the sub-block length.
  • the processing unit 1010 may be further configured to determine a pre-frozen position of a bit of the polar code according to the mother code length and the length of the bit to be sent, where the pre-frozen position is not used as the position of the information bit.
  • the number P of the pre-frozen positions satisfies:
  • N represents the mother code length of the Polar code
  • floor() represents rounding down.
  • the first sequence is ⁇ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ 1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA, 1, 1, NA, 0, 0, 0, 0, 0, 0, 0, 0 ⁇ , N is the mother code length, and E is the length of the bits to be sent;
  • the first sequence is ⁇ NA,NA,2,NA,-1,0,0,0,0,0,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA, 3, NA, 2, NA, 1, NA, 0, 0, 0, 0, 0, 0, 0 ⁇ , N is the mother code length, and E is the length of the bits to be sent;
  • the first sequence is ⁇ NA,NA,NA,3,1,NA,1,NA,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA,NA,NA,NA,2,NA,1,NA,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA,NA,NA,4,NA,NA,NA,NA,NA,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent.
  • the communication unit 1020 may be used to receive first information, where the first information includes a mother code length of a polarization code and a length of bits to be sent, where the mother code length is a positive integer power of 2; and the processing unit 1010 may be used to determine a first sequence according to the mother code length of the polarization code and the length of bits to be sent, where the first sequence is used to adjust a reliability ranking of bits in the polarization code, determine a position of an information bit in the polarization code according to the reliability ranking and the first sequence, and decode data encoded by the polarization code according to the position of the information bit.
  • the first information includes a mother code length of a polarization code and a length of bits to be sent, where the mother code length is a positive integer power of 2
  • the processing unit 1010 may be used to determine a first sequence according to the mother code length of the polarization code and the length of bits to be sent, where the first sequence is used to adjust a reliability ranking of bits in the polarization code
  • the communication unit 1020 may be further configured to receive data encoded by the polarization code from a transmitting end through an air interface.
  • the processing unit 1010 may be specifically configured to obtain a first position value of a bit in the polar code, select an offset value from a first sequence according to the first position value, and determine a second position value of the bit in the polar code according to the offset value and the first position value, where the second position value is a position index of an information bit in the polar code.
  • the processing unit 1010 is further configured to select an invalid value from the first sequence according to the first position value, and determine, according to the invalid value, not to solve a position index of an information bit in the polar code according to the first position value.
  • the processing unit 1010 may be specifically configured to determine a sequence number of a sub-block to which the first position value belongs according to the first position value and the sub-block length, and determine the offset value from a plurality of elements in the first sequence according to the sequence number.
  • the second position value is determined according to the offset value, the first position value and the sub-block length.
  • the processing unit 1010 may be further configured to determine a pre-frozen position of a bit of the polar code according to the mother code length and the length of the bit to be sent, where the pre-frozen position is not used as the position of the information bit.
  • the number P of the pre-frozen positions satisfies:
  • N represents the mother code length of the Polar code
  • floor() represents rounding down.
  • the first sequence is ⁇ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ 1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA, 1, 1, NA, 0, 0, 0, 0, 0, 0, 0, 0 ⁇ , N is the mother code length, and E is the length of the bits to be sent;
  • the first sequence is ⁇ NA,NA,2,NA,-1,0,0,0,0,0,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA, 3, NA, 2, NA, 1, NA, 0, 0, 0, 0, 0, 0, 0 ⁇ , N is the mother code length, and E is the length of the bits to be sent;
  • the first sequence is ⁇ NA,NA,NA,3,1,NA,1,NA,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA,NA,NA,NA,2,NA,1,NA,0,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent
  • the first sequence is ⁇ NA,NA,NA,4,NA,NA,NA,NA,NA,0,0,0,0,0,0,0 ⁇
  • N is the mother code length
  • E is the length of the bits to be sent.
  • each functional module in each embodiment of the present application may be integrated into one processor, or may exist physically separately, or two or more modules may be integrated into one module.
  • the above-mentioned integrated modules may be implemented in the form of hardware or in the form of software functional modules.
  • a communication device 1100 provided in an embodiment of the present application is used to implement the communication method provided in the present application.
  • the communication device 1100 may be a communication device that applies the communication method, or a component in a communication device, or a device that can be used in combination with a communication device.
  • the communication device 1100 may be a transmitting end or a receiving end.
  • the communication device 1100 may be a chip system or a chip. In the embodiment of the present application, the chip system may be composed of a chip, or may include a chip and other discrete devices.
  • the communication device 1100 includes at least one processor 1120 for implementing the communication method provided in the embodiment of the present application.
  • the communication device 1100 may also include an output interface 1110, which may also be referred to as an input-output interface.
  • the output interface 1110 may be used to communicate with other devices through a transmission medium, and its functions may include sending and/or receiving.
  • the communication device 1100 is a chip, it is transmitted to other chips or devices through the output interface 1110.
  • the processor 1120 may be used to implement the method shown in the above method embodiment.
  • the processor 1120 may be used to execute actions executed by the processing unit 1010
  • the output interface 1110 may be used to execute actions executed by the communication unit 1020 , which will not be described in detail.
  • the communication device 1100 may further include at least one memory 1130 for storing program instructions and/or data.
  • the memory 1130 is coupled to the processor 1120.
  • the coupling in the embodiment of the present application is an indirect coupling or communication connection between devices, units or modules, which may be electrical, mechanical or other forms, and is used for information exchange between devices, units or modules.
  • the processor 1120 may operate in conjunction with the memory 1130.
  • the processor 1120 may execute program instructions stored in the memory 1130. At least one of the at least one memory may be integrated with the processor.
  • the memory 1130 may be a non-volatile memory, such as a hard disk drive (HDD) or a solid-state drive (SSD), etc., or a volatile memory (volatile memory), such as a random-access memory (RAM).
  • the memory is any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.
  • the memory in the embodiment of the present application may also be a circuit or any other device that can realize a storage function, for storing program instructions and/or data.
  • the processor 1120 may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or execute the methods, steps, and logic block diagrams disclosed in the embodiment of the present application.
  • the general-purpose processor may be a microprocessor or any conventional processor, etc.
  • the steps of the method disclosed in the embodiment of the present application may be directly embodied as being executed by a hardware processor, or may be executed by a combination of hardware and software modules in the processor.
  • a communication device 1200 provided in an embodiment of the present application is used to implement the communication method provided in the present application.
  • the communication device 1200 may be a communication device that applies the communication method shown in the embodiment of the present application, or it may be a component in a communication device, or it may be a device that can be used in combination with a communication device.
  • the communication device 1200 may be a transmitting end or a receiving end.
  • the communication device 1200 may be a chip system or a chip.
  • the chip system may be composed of a chip, or it may include a chip and other discrete devices.
  • Part or all of the communication method for applying the Huygens equivalent surface provided in the above embodiment may be implemented by hardware or by software.
  • the communication device 1200 may include: an input interface circuit 1201, a logic circuit 1202, and an output interface circuit 1203.
  • the input interface circuit 1201 can be used to execute the above-mentioned receiving action performed by the communication unit 1020
  • the output interface circuit 1203 can be used to execute the above-mentioned sending action performed by the communication unit 1020
  • the logic circuit 1202 can be used to execute the above-mentioned action performed by the processing unit 1010, which will not be repeated.
  • the communication device 1200 may be a chip or an integrated circuit in a specific implementation.
  • Part or all of the operations and functions performed by the communication device described in the above method embodiments of the present application can be completed using a chip or an integrated circuit.
  • An embodiment of the present application provides a computer-readable storage medium storing a computer program, wherein the computer program includes instructions for executing the above method embodiment.
  • An embodiment of the present application provides a computer program product including instructions, which, when executed on a computer, enables the computer to execute the above method embodiment.
  • the embodiment of the present application provides a communication system.
  • the communication system may include a first communication device for implementing the method shown in Figure 5 and/or Figure 9. Please refer to the relevant description in the above method embodiment for details, which will not be repeated here.
  • the communication system may include the structure shown in Figure 1.
  • the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.
  • a computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device that implements the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.
  • These computer program instructions may also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.

Landscapes

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

Abstract

本申请提供一种信息比特的确定方法及装置、用以提高通过打孔的方式进行极化码速率匹配时的通信性能。该方法包括：根据极化码的母码长度和待发送比特的长度确定第一序列(S101)，母码长度为2的正整数次幂，第一序列用于调整极化码中的比特的可靠度排序；根据可靠度排序和第一序列，确定极化码中的信息比特的位置(S102)。

Description

一种信息比特的确定方法及装置 技术领域
本申请涉及移动通信技术领域，尤其涉及一种信息比特的确定方法及装置。
背景技术
在基于极化(Polar)码编码进行通信过程中，若实际通信的码长与Polar码编码后的码长(即母码长度)不同，则需要对Polar码编码后的比特序列通过打孔、重传等方式实现码长匹配过程，然后根据码长匹配的结果进行编码构造。具体的，以打孔的码长匹配方式为例，首先根据实际通信的码长与Polar码编码后的码长确定采用打孔的方式进行码长匹配，然后确定打孔的位置。在确定打孔的比特位置后确定信息位和冻结位进行编码构造。
然而，当通过打孔实现码长匹配时，会对Polar码中信息比特的选取产生影响，导致性能坏点，造成通信性能下降。
发明内容
本申请提供一种信息比特的确定方法及装置，用以提高通过打孔的方式进行Polar码速率匹配时的通信性能。
第一方面，本申请提供一种信息比特的确定方法，该方法可由发送端实施。其中，发送端可以是终端设备、网络设备、网络设备中的组件或终端设备中的组件。本申请中的组件例如可包括芯片、芯片***、处理器、收发器、处理单元或收发单元中的至少一种。以执行主体是发送端为例，该方法可以通过以下步骤实现：发送端根据极化码的母码长度和待发送比特的长度确定第一序列，所述母码长度为2的正整数次幂，所述第一序列用于调整所述极化码中的比特的可靠度排序；发送端还可根据所述可靠度排序和所述第一序列，确定所述极化码中的信息比特的位置。
基于该方法，发送端可以根据可靠度排序和第一序列确定中的信息比特的位置，由于不仅仅是根据可靠度排序确定中的信息比特的位置，而是通过第一序列对可靠度排序进行调整以确定信息比特的位置，可以避免出现坏点，提高通信性能。
第二方面，本申请提供一种信息比特的确定方法，该方法可由接收端实施。其中，接收端可以是终端设备、网络设备、网络设备中的组件或终端设备中的组件。本申请中的组件例如可包括芯片、芯片***、处理器、收发器、处理单元或收发单元中的至少一种。以执行主体是接收端为例，该方法可以通过以下步骤实现：接收端接收第一信息，所述第一信息包括极化码的母码长度和待发送比特的长度，所述母码长度为2的正整数次幂；接收端还可根据极化码的母码长度和待发送比特的长度确定第一序列，所述第一序列用于调整所述极化码中的比特的可靠度排序；接收端还可根据所述可靠度排序和所述第一序列，确定所述极化码中的信息比特的位置，并根据所述信息比特的位置译码由所述极化码编码的数据。
在第一方面及第二方面的一种可能的实现方式中，发送端或接收端还可获得所述极化码中比特的第一位置值，并根据所述第一位置值从第一序列中选择偏移值，以及根据所述 偏移值和所述第一位置值确定所述极化码中比特的第二位置值，所述第二位置值为所述极化码中的信息比特的位置索引。
基于该实现方式，发送端或接收端可根据极化码的第一位置值从第一序列中选择偏移值，并根据偏移值和第一位置值准确确定第二位置值，并将第二位置在确定为信息比特的位置索引，提高确定信息比特的位置的准确性。
在第一方面及第二方面的一种可能的实现方式中，发送端或接收端还可根据所述第一位置值从所述第一序列中选择无效值，并根据所述无效值确定不根据所述第一位置值求解所述极化码中的信息比特的位置索引。
基于该实现方式，可忽略根据对应于无效值的第一位置值确定信息比特的位置，提高信息比特确定的准确性。
在一种可能的实现方式中，发送端或接收端还可根据所述第一位置值和子块长度确定所述第一位置值所属的子块的序号，并根据所述序号从所述第一序列中的多个元素中确定所述偏移值。
基于该实现方式，发送端或接收端可根据子块长度和第一位置值确定子块序号，并根据子块序号读取偏移值，提高偏移值确定的准确性。
在一种可能的实现方式中，所述第二位置值根据所述偏移值、所述第一位置值和所述子块长度确定。
基于该实现方式，可提高第二位置值确定的准确性。
在一种可能的实现方式中，发送端或接收端还可根据所述母码长度和所述待发送比特的长度确定极化码的比特的预冻结位置，所述预冻结位置不作为所述信息比特的位置。
基于该实现方式，可合理确定预冻结位置，进一步提高第二位置值确定的准确性。
在一种可能的实现方式中，如果所述待发送比特的码长E不能被N/32整除，所述预冻结位置的数量P满足：
P＝N-floor(E/(N/32))*(N/32)，或者，
如果E能被N/32整除，则预冻结位置的数量P满足：
P＝N-E+(N/32)，
其中，N表示所述Polar码的母码长度，floor()表示向下取整。
基于该实现方式，可进一步提高确定预冻结位置时的准确性。
在一种可能的实现方式中，当15.5*N/16<E≤N时，所述第一序列为{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当14.5*N/16<E≤15.5*N/16时，所述第一序列为{1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当13.5*N/16<E≤14.5*N/16时，所述第一序列为{NA,1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当12.5*N/16<E≤13.5*N/16时，所述第一序列为{NA,NA,2,NA,-1,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当11.5*N/16<E≤12.5*N/16时，所述第一序列为{NA,3,NA,2,NA,1,NA,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当10.5*N/16<E≤11.5*N/16时，所述第一序列为{NA,NA,NA,3,1,NA,1,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当9.5*N/16<E≤10.5*N/16时，所述第一序列为{NA,NA,NA,NA,2,NA,1,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当8*N/16<E≤9.5*N/16时，所述第一序列为{NA,NA,NA,4,NA,NA,NA,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度。
基于该实现方式，可提高第一序列的准确性，进一步提高信息比特位置的确定准确性。
第三方面，提供一种通信装置。该装置可以实现上述第一方面或第二方面其任意可能的实现方式中由接收端或发送端分别执行的方法。
一种可选的实现方式中，该装置可以包括执行以上第一方面或第二方面及任意可能的实现方式中所描述的方法/操作/步骤/动作所一一对应的模块，该模块可以是硬件电路，也可是软件，也可以是硬件电路结合软件实现。一种可选的实现方式中，该装置包括处理单元(有时也称为处理模块)和通信单元(有时也称为通信模块、收发模块或收发单元)。通信单元能够实现发送功能和接收功能，在通信单元实现发送功能时，可称为发送单元(有时也称为发送模块)，在通信单元实现接收功能时，可称为接收单元(有时也称为接收模块)。发送单元和接收单元可以是同一个功能模块，该功能模块能实现发送功能和接收功能；或者，发送单元和接收单元可以是不同的功能模块，收发单元是对这些功能模块的统称。
再例如，该装置包括：处理器，与存储器耦合，用于执行存储器中的指令，以实现上述第一方面或第二方面及任意可能的实现方式中所描述的方法。可选的，该装置还包括其他部件，例如，天线，输入输出模块，收发器，通信接口等等。这些部件可以是硬件，软件，或者软件和硬件的结合。
第四方面，提供一种计算机可读存储介质，所述计算机可读存储介质用于存储计算机程序或指令，当其被运行时，使得第一方面或第二方面中任意可能的实现方式的方法被实现。
第五方面，提供一种包含指令的计算机程序产品，当其在计算机上运行时，使得第一方面或第二方面中任意可能的实现方式的方法被实现。
第六方面，提供一种芯片***，该芯片***包括逻辑电路(或理解为，该芯片***包括处理器，处理器可包括逻辑电路等)，还可以包括输入输出接口。该输入输出接口可以用于接收消息，也可以用于发送消息。输入输出接口可以是相同的接口，即，同一个接口既能够实现发送功能也能够实现接收功能；或者，输入输出接口包括输入接口以及输出接口，输入接口用于实现接收功能，即，用于接收消息；输出接口用于实现发送功能，即，用于发送消息。逻辑电路可用于执行上述第一方面或第二方面及其任意可能的实现方式中除收发功能之外的操作；逻辑电路还可用于向输入输出接口传输消息，或者从输入输出接口接收来自其他通信装置的消息。该芯片***可用于实现上述第一方面或第二方面中任意可能的实现方式的方法。该芯片***可以由芯片构成，也可以包含芯片和其他分立器件。
可选的，该芯片***还可以包括存储器，存储器可用于存储指令，逻辑电路可调用存储器所存储的指令来实现相应功能。
第七方面，提供一种通信***，该通信***可以包括发送端以及接收端。其中，发送 端可用于执行第一方面及其任意可能的实现方式中的方法。接收端可用于执行第二方面及其任意可能的实现方式中的方法。
以上第二方面至第七方面所带来的技术效果可参见上述第一方面的描述，此处不再赘述。
附图说明
图1为本申请实施例提供的一种无线通信***的架构示意图；
图2为一种信息比特和固定比特的示意图；
图3A为本申请实施例提供的一种信息比特确定方式的示意图；
图3B为本申请实施例提供的一种基于NAT打孔、NR速率匹配和本申请方案的传输性能对比示意图；
图3C为本申请实施例提供的一种基于子块交织和本申请方案的传输性能对比示意图；
图4为一种基于Polar码的传输流程示意图；
图5为本申请实施例提供的一种信息比特的位置确定方法的流程示意图；
图6为本申请实施例提供的一种基于第一序列对可靠度序列Q的调整方法示意图；
图7为本申请实施例提供的一种基于第一序列对可靠度序列Q进行调整的原理示意图；
图8为本申请实施例提供的另一种基于第一序列对可靠度序列Q进行调整的原理示意图；
图9为本申请实施例提供的一种通信方法的流程示意图；
图10为本申请实施例提供的一种通信装置的结构示意图；
图11为本申请实施例提供的另一种通信装置的结构示意图；
图12为本申请实施例提供的另一种通信装置的结构示意图。
具体实施方式
本申请实施例提供的信息比特的确定方法可以应用于***(4th generation，4G)通信***，例如长期演进(long term evolution，LTE)通信***，也可以应用于第五代(5th generation，5G)通信***，例如5G新空口(new radio，NR)通信***，或应用于未来的各种通信***，例如第六代(6th generation，6G)通信***。本申请实施例提供的方法还可以应用于蓝牙***、WiFi***、LoRa***或车联网***中。本申请实施例提供的方法还可以应用于卫星通信***其中，所述卫星通信***可以与上述通信***相融合。
为了便于理解本申请实施例，以图1所示的通信***架构为例对本申请使用的应用场景进行说明。参阅图1所示，通信***100包括网络设备101和终端设备102。本申请实施例提供的装置可以应用到网络设备101，或者应用到终端设备102。可以理解的是，图1仅示出了本申请实施例可以应用的一种可能的通信***架构，在其他可能的场景中，所述通信***架构中也可以包括其他设备。
网络设备101为无线接入网(radio access network，RAN)中的节点，又可以称为基站，还可以称为RAN节点(或设备)。目前，一些接入网设备101的举例为：gNB/NR-NB、传输接收点(transmission reception point，TRP)、演进型节点B(evolved Node B，eNB)、无线网络控制器(radio network controller，RNC)、节点B(Node B，NB)、基站控制器(base  station controller，BSC)、基站收发台(base transceiver station,BTS)、家庭基站(例如，home evolved NodeB，或home Node B，HNB)、基带单元(base band unit，BBU)，或无线保真(wireless fidelity，Wifi)接入点(access point，AP)，卫星设备，或5G通信***中的网络设备，或者未来可能的通信***中的网络设备。网络设备101还可以是其他具有网络设备功能的设备，例如，网络设备101还可以是设备到设备(device to device，D2D)通信、车联网通信、机器通信中担任网络设备功能的设备。网络设备101还可以是未来可能的通信***中的网络设备。
在一些部署中，gNB可以包括集中式单元(centralized unit，CU)和DU。gNB还可以包括射频单元(radio unit，RU)。CU实现gNB的部分功能，DU实现gNB的部分功能，比如，CU实现无线资源控制(radio resource control，RRC)，分组数据汇聚层协议(packet data convergence protocol，PDCP)层的功能，DU实现无线链路控制(radio link control，RLC)、媒体接入控制(media access control，MAC)和物理(physical，PHY)层的功能。由于RRC层的信息最终会变成PHY层的信息，或者，由PHY层的信息转变而来，因而，在这种架构下，高层信令，如RRC层信令或PHCP层信令，也可以认为是由DU发送的，或者，由DU+RU发送的。可以理解的是，网络设备可以为CU节点、或DU节点、或包括CU节点和DU节点的设备。此外，CU可以划分为接入网RAN中的网络设备，也可以将CU划分为核心网CN中的网络设备，在此不做限制。
终端设备102，又可以称之为用户设备(user equipment，UE)、移动台(mobile station，MS)、移动终端(mobile terminal，MT)等，是一种向用户提供语音或数据连通性的设备，也可以是物联网设备。例如，终端设备包括具有无线连接功能的手持式设备、车载设备等。目前，终端设备可以是：手机、平板电脑、笔记本电脑、掌上电脑、移动互联网设备(mobile internet device，MID)、可穿戴设备(例如智能手表、智能手环、计步器等)，车载设备(例如，汽车、自行车、电动车、飞机、船舶、火车、高铁等)、虚拟现实(virtual reality，VR)设备、增强现实(augmented reality，AR)设备、工业控制中的无线终端、智能家居设备(例如，冰箱、电视、空调、电表等)、智能机器人、车间设备、无人驾驶中的无线终端、远程手术中的无线终端、智能电网(smart grid)中的无线终端、运输安全中的无线终端、智慧城市中的无线终端，或智慧家庭中的无线终端、飞行设备(例如，智能机器人、热气球、无人机、飞机)等。终端设备还可以是其他具有终端功能的设备，例如，终端设备还可以是D2D通信中担任终端功能的设备。本申请中将具有无线收发功能的终端设备及可设置于前述终端设备的芯片统称为终端设备。
本申请实施例中“至少一个”是指一个或者多个，“多个”是指两个或两个以上。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B的情况，其中A，B可以是单数或者复数。字符“/”一般表示前后关联对象是一种“或”的关系。“以下至少一项(个)”或其类似表达，是指的这些项中的任意组合，包括单项(个)或复数项(个)的任意组合。例如，a,b,或c中的至少一项(个)，可以表示：a,b,c,a-b,a-c,b-c,或a-b-c，其中a,b,c可以是单个，也可以是多个。
以及，除非有相反的说明，本申请实施例提及“第一”、“第二”等序数词是用于对多个对象进行区分，不用于限定多个对象的大小、内容、顺序、时序、优先级或者重要程度等。例如，第一序列和第二序列，只是为了区分不同的序列，而并不是表示这两个序列的长度、优先级或者重要程度等的不同。
为了更好的理解本申请实施例提供的方案，以下先对本申请实施例涉及到的一些术语、概念或流程进行介绍。
1)极化(polar)码编码：polar码编码是一种能够被严格证明达到信道容量的信道编码方案，具有高性能，较低复杂度，匹配方式灵活等特点。目前已经被第三代合作计划(3rd generation partnership project，3GPP)确定成为5G控制信道增强移动宽带(enhanced mobile broadband，eMBB)场景控制信道编码方案。
参见图2，示意一种典型的长度为8的polar码编码过程。待编码比特序列根据其各自的可靠度分为固定比特(frozen)和信息比特(data)两类。可选的，可靠度可通过该位置对数似然比(log likelihood ratio，LLR)分布均值计算得到。一般地，可靠度较高的比特设置为信息比特(data)，可靠度较低的比特设置为固定比特(frozen)，固定比特的值通常设置为0，在实际传输中发送端和接收端均已知。图2对应的编码码长为8比特(bits)，示意出了{u 0,u 1,u 2,u 4}为固定比特的位置，{u 3,u 5,u 6,u 7}为信息比特的位置。每一行中的每一个圆圈表示圆圈所在行的比特与圆圈所达行之间的一次异或运算(或称，模二加)，圆圈右侧的比特即为求和结果。
2)Polar码构造：Polar码构造是指基于给定码长N与信息比特长度K，得到Polar码的过程。目前构造Polar码时，首先需要先确定长度匹配方式如打孔(puncture)、重传或截断(shorten)等，再根据长度匹配方式去除预冻结位置，再基于Q序列获取Polar码的信息位。Q序列用于表征子信道的可靠度。Q序列中的值表示子信道的序号，其在序列中的位置表示对应子信道的可靠度。例如，对于长度为8的Q序列，[0 1 2 4 3 5 6 7]，即表示序列中位置为7的比特对应的子信道是最可靠的一个子信道，位置为6的比特对应的子信道是第二可靠的信道，以此类推。结合该举例对Polar码构造过程进行说明。假设构造N＝6、K＝4长的Polar码，首先基于码率确定长度匹配方式为shorten，再进一步确定出shorten位置是6与7，因此将6与7子信道预冻结，即6与7不能选择信息位。因此在构造Polar码之前，先将Q序列中的6与7去掉，即得到[0 1 2 4 3 5]，再从后往前选出4个位置，即2、4、3、5作为信息位，剩余位置作为冻结位。
3)自然序(nature，NAT)打孔：也可称为顺序打孔，是指码长E在按自然序排序的Polar码最前面的N-E个位置为打孔位置，其中，N为Polar码的母码长度(或称为速率匹配前的码长)。自然序排序是指Polar码位置值按照由小到大的方式排序。可选的方式中，为了避免性能崩溃，还可根据打孔数量(N-E)，按照增加按自然序排序预冻结(pre-freezing)比特位，使得被冻结的位置不被作为信息比特。基于自然序打孔，可从打孔后的序列中按照由高到低的可靠度排序选取信息比特。
以Polar码的母码长度为N、实际通信的码长为E，且含有K个信息比特(即信息长度为K)为例，基于自然序打孔的确定信息比特的方式例如，将Polar码的前N-E个位置都标记为冻结位(其中包括打孔位置)，将计数器(count，CNT)清零。然后从Q序列的最后一个位置往前依次读数，每次读数记为Q[i]，i＝0、1、……、N-1，如果Q[i]的值小于N，且大于或等于(N-E)，则Q[i]对应的位置标记为信息位，然后计数器加1，如果计数器的值等于K，则退出信息位构造过程，否则继续读取Q序列，直到选出K个信息比特。图3A示出了K＝8、E＝20且N＝32时Q[i]的示例。
然而，由于打孔会对子信道的容量产生影响，因此打孔后对Polar码中比特位置对应的子信道的可靠度产生影响，如果打孔后仍然按照打孔前确定的Q序列确定信息比特，则 可能导致性能坏点，造成通信性能下降。
例如图3B所示，图3B的横坐标E表示信息比特的数量，纵坐标是达到误码块率(block error rate，BLER)为10^-2时的符号信噪比(EsN0)。其中，图3B中实线表示5G速率匹配的方式打孔时的SNR性能，点线表示采用NAT打孔后的信噪比(signal noise rat，SNR)性能，可见采用NAT打孔后，图3B所示的点线在信息比特长度为2200至2600之间会部分位置有坏点，打孔后，部分比特位置的性能与未打孔的性能相比下降较多。可以理解，图3B和图3C中，R表示码率。
因此在5G标准中将Polar码母码长度分成32(或其他数量)个子块(sub block)，并按照表1顺序做子块交织后，对子块交织后的最前面的N-E长度的比特做打孔，将对应的未交织位置确定为预冻结位置。其中，预冻结位置的比特不作为信息比特。此后，参照自然序序列Q，从Q序列的最后一个位置往前依次读取Q[i]，如果Q[i]小于N，且该比特位置不是冻结bit，则选择为信息bit，并用同样的方法，选择K个位置为信息bit。
表1
i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i)
0 0 4 3 8 8 12 10 16 12 20 14 24 24 28 27
1 1 5 5 9 16 13 18 17 20 21 22 25 25 29 29
2 2 6 6 10 9 14 11 18 13 22 15 26 26 30 30
3 4 7 7 11 17 15 19 19 21 23 23 27 28 31 31
例如母码长N＝1024，子块长度为32，假设E＝N-150，也就是打孔150个比特，也就是打孔4.6875个子块，也就是4个完整子块和第五个子块的22个比特。如表1所示，子块交织后，按照i由小到大的顺序，对应的前五个P(i)的索引分别是0、1、2、4和3，所以被打孔的位置就是0-2子块、第四子块，和第三子块的前22个比特。
以图3A为例，子块交织后打孔的比特位置索引为0至9以及16和17，选取的信息比特的位置索引可以是15、22、23、27、28、29、30和31。
然而，子块交织的方案会带来额外的处理复杂度。此外，如图3C实线部分所示，子块交织的方案在一些比特位置仍然存在坏点，如按照子块交织的方案，在码长为641且信息长度K＝274时，第577比特会被选择为信息比特，但是根据计算发现577比特对应的子信道的容量是几乎等于0的，因此第577被选择为信息比特导致出现坏点，另外从图3C仿真图中也可看出存在坏点。
基于此，本申请实施例提供一种通信方法及装置，用于在自然序打孔时提高通信性能，切不需要进行子块交织。其中，方法和装置是基于同一构思的，由于方法及装置解决问题的原理相似，因此装置与方法的实施可以相互参见，重复之处不再赘述。
图4示意性的示出一种发送端和接收端之间的交互示意图，发送端的信源依次经过信源编码、信道编码、速率匹配和调制后在信道上发出。接收端收到信号后依次经过解调及解速率匹配、信道解码和信源解码后获得信宿。本申请实施例提供的方法可以用于在信道编码和速率匹配过程。
参见图5，为本申请提供的一种通信方法的流程示意图。该示意图中以通信装置为执行主体对该方法进行介绍，其中，通信装置可作为发送端和/或接收端。该方法包括：
S101：通信装置根据Polar码的母码长度N和待发送比特的长度E确定第一序列。
其中，母码长度为2的整数次幂。待发送比特的长度E也就是实际通信的码长。
在S101中，第一序列用于调整所述Polar码中的比特的可靠度排序。其中，Polar码中的比特的可靠度排序可以是Polar码中的比特在可靠度序列Q中的排序。例如图6所示，以Polar码长度是32为例，Polar码中的比特31在序列Q中的排序为31，即比特31对应的子信道是最可靠的一个子信道。
本申请实施例中，第一序列可用于调整Polar码中的比特在可靠度序列中的排序，或者说，第一序列可用于确定新的可靠度排序Q’。其中，第一序列包括的元素数量与Polar码分成的子块数量相同。例如，假设Polar码包括的子块数量为16，则第一序列可包括16个元素，每个元素对应于一个子块。或者，第一序列包括的元素数量也可大于子块数量。其中，第一序列中的元素可取0、NA、正整数或负整数。可选的，第一序列中，0和绝对值小于子块数量的值可称为偏移值，NA和绝对值大于或等于子块数量的值可称为无效值。下文中，将在S102中结合确定信息比特的方式介绍偏移值和无效值的用途，这里暂不展开。
可选的，S101中通信装置根据极化码的母码长度N和待发送比特的长度E确定第一序列的方式例如，根据N的取值和E的取值之间的关系，确定与该取值范围关系相对应的第一序列。
示例性的，以子块数量为16为例，N的取值和E的取值之间的关系以及第一序列之间的对应关系可参照表2所示。通信装置可根据N的取值和E的取值之间的关系查询表2，确定对应的第一序列。
表2
Figure PCTCN2022137015-appb-000001
可选的，S101中，通信装置也可根据打孔数量和母码长度确定第一序列。其中，打孔数量可以是根据母码长度N和待发送比特的长度E确定的，例如，打孔数量为(N-E)。
仍以子块数量为16为例，打孔数量以及N的取值之间的关系以及第一序列之间的对应关系可参照表3所示。
表3
Figure PCTCN2022137015-appb-000002
Figure PCTCN2022137015-appb-000003
可以理解，表2和表3中的数值只是示例性的描述，不代表实际应用中对应关系只能以表2和表3所示为限。例如，根据实际应用需要，可对N的取值边界做调整，和/或，对第一序列重元素的取值做调整。此外，表2和表3中的符号“≤”可以替换为“＜”，“＜”可以替换为“≤”。可选的，表2和表3中，NA也可替换为绝对值大于或等于子块数量的值。
可见，对于相同的N和E，分别根据表2和表3所确定的第一序列是相同的。
S102：通信装置根据可靠度排序和第一序列，确定Polar码中的信息比特的位置。
S102中，通信装置可根据Polar码中的比特的第一位置值，根据所述第一位置值从第一序列中选择偏移值，再根据所述偏移值和所述第一位置值确定所述极化码中比特的第二位置值，所述第二位置值为所述极化码中的信息比特的位置索引。
举例来说，通信装置可按照可靠度序列Q中元素由大到小的顺序选取Q[i]作为第一位置值，再根据第一位置值从第一序列中确定偏移值。其中，Q[i]是可靠度序列Q中的第i个元素，其数值为Polar码中子载波的可靠度第i高的比特在Polar码中的位置索引。
其中，确定偏移值时，通信装置可根据第一位置值Q[i]所属的子块的序号，从第一序列的多个元素中确定偏移值。其中，第一位置值所属的子块的序号为n，子块的序号可表示为
Figure PCTCN2022137015-appb-000004
其中，
Figure PCTCN2022137015-appb-000005
表示下取整运算，N/M表示子块长度。可选的，可取N/M为正数，即N可以被M整除。示例性的，假设第一位置值所属的子块序号为n，则偏移值为第一序列中的第n个元素，n＝0、1、……、M-1，M为子块数量。
进一步的，通信装置可根据偏移值、子块长度和第一位置值确定第二位置值，也就是说，可根据偏移值、子块长度和第一位置值确定极化码中的信息比特的位置索引。示例性的，第二位置值表示为Q’[i]＝(Q[i]+p*(N/M))，其中，Q[i]表示第一位置值，p表示偏移值，N/M表示子块长度，N表示母码长度，M为子块数量。其中，如果偏移值为0，表示第二位置值与第一位置值Q[i]相同，则通信装置可将Q[i]作为信息比特，例如，Q[i]＝31，相应的偏移值为0，则Q’[i]＝Q[i]＝31作为信息比特的位置索引。如果偏移值为绝对值小于M的整数，则可选的，通信装置可将Polar码中的比特(Q[i]+p*(N/M))作为第二位置值，即将Polar码中的比特(Q[i]+p*(N/M))作为信息比特。其中，第二位置值为大于或等于0且小于N的正整数。例如，图6所示，以子块长度是2为例，当通信装置将序列Q中的Q[i]＝13作为第一位置值时，可确定n＝6，因此Q[i]＝14对应于第一序列中的第7个元素，也就是1，Q[i]+p*(N/M)＝13+1*2＝15，因此通信装置可将Polar码中的位置索引为15的 比特作为信息比特。
本申请中，第二位置值作为信息比特的前提之一是第二位置值不属于的预冻结位置，且已确定的信息比特的数量不足K。本申请中，通信装置还可确定极化码中的比特的预冻结位置，预冻结位置的比特不作为信息比特的位置。示例性的，根据表2或表3所示第一序列确定信息比特的位置时，还需要确定信息比特不属于预冻结位置。例如，信息比特的位置不属于极化码中的位置索引最小的P个位置索引。
可选的，预冻结位置的数量可根据母码长度和待发送比特的长度确定。示例性的，预冻结位置的数量P可满足：
P＝N-floor(E/(N/32))*(N/32)，E不能被32整除；
P＝N-E+(N/32)，E可以被32整除。
其中，floor()表示向下取整。
假设N＝1024且E能被32整除，则预冻结位置的数量P＝1056-E，E为信息比特数量。且根据自然序打孔方案，1024长的Polar码的前(1024-E)个位置为打孔位置，因此除打孔位置以外，还需要额外冻结32比特。
此外，如果通信装置根据第一位置值从第一序列中选择无效值，则通信装置可根据无效值确定不根据该第一位置值求解信息比特的位置索引。其中，选择无效值的方式与选择偏移值的方式同理，例如，通信装置可根据第一位置值和子块长度确定第一位置值的子块的序号n，并根据子块的序号n从第一序列中读取第n个元素，其中，该第n个元素为无效值。可选的，子块长度也可替换为母码长度和子块数量的比值。其中，无效值表示忽略根据当前的第一位置值Q[i]确定信息比特，或者，表示无法根据当前的第一位置值Q[i]确定第二位置值。可选的，当通信装置根据第一位置值从第一序列中选择无效值，通信装置可选取Polar码中的下一个比特的位置索引作为新选取的第一位置值，并根据新选取的第一位置值确定信息比特的位置。该下一个比特的位置索引可以是根据序列Q确定的可靠度排序较低的下一个比特位置值。例如，图6所示，以子块长度是2为例，当通信装置将序列Q中的Q[i]＝14作为第一位置值时，可确定n＝7，因此Q[i]＝14对应于第一序列中的第8个元素，也就是NA即无效值。因此通信装置可停止根据Q[i]＝14确定信息比特。通信装置可继续从序列Q中选择新的比特索引作为第一位置值，例如，按照可靠度排序，通信装置可将Q[i]＝13作为新选取的第一位置值。
以K＝8、E＝20且N＝32为例，第一序列为{NA,NA,NA,NA,2,NA,1,NA,0,0,0,0,0,0,0,0}，调整后的序列Q’例如图6所示。其中，如果第一序列中的第n个元素的取值为无效值，则在序列Q’中第i个元素的取值为无效值，其中，参见前文中的描述，
Figure PCTCN2022137015-appb-000006
Q[i]表示第一位置值，p表示偏移值，N/M表示子块长度，N表示母码长度，M为子块数量。可见，如果第一序列中的第n个元素的取值为偏移值(即非为无效值)，则Q’[i]＝(Q[i]+p*(N/M))。可见，当第n个元素的取值为偏移值(即非为无效值)时，Q’[i]中的第i个元素Q’[i]表示序列Q中的第i个元素Q[i]对应的信息比特的位置索引，也就是第二位置值。举例来说，当通信装置根据可靠度排序选取Q[i]作为第一位置值时，通信装置可根据序列Q’中的元素Q’[i]确定信息比特的位置索引，如Q[i]＝31时，n＝16，第一序列中第16个元素为偏移值0，因此Q’[i]＝31，此时Polar码中索引位置为31的比特可作为信息比特。
又如，Q[i]＝14时，n＝7，第一序列中第7元素为无效值NA，因此Q’[i]＝NA，此时无法根据Polar码中索引位置为14的比特确定对应的信息比特。可选的，根据图6中的序列 Q可知，Polar码中的比特索引为Q[i]＝13的比特的可靠度仅次于比特索引为Q[i]＝14的比特的可靠度，因此通信装置还可将Q[i]＝13作为下一个第一位置值，此时n＝6，第一序列中的第6个元素为偏移值1，因此Q’[i]＝15，此时Polar码中索引位置为15的比特可作为信息比特。
可以理解，Q’序列中的NA对应的比特数量小于或等于打孔数量以及非打孔的预冻结位置的数量的和。在一个具体的例子中，标记完NA后Q’序列中的索引位置可看做一个更短的序列。如图6所示，Q”序列为Q’序列去除NA后的元素组成的序列。Q”序列中的位置值排序对应于根据第一序列调整后的可靠性排序，例如图6中以从右到左对应于可靠度的降序排序；而未包括在Q”序列中的位置索引为Polar码中的属于预冻结位置的位置索引，其中图6中，Polar码中的比特0至11为打孔位置(预冻结位置包括打孔位置)。此外，由于该示例中由于Polar码长度较短，因此预冻结比特为比特0至11，即不需要在打孔位置以外额外冻结比特。
可选的，参见以上对于图6所示示例的描述，在执行S102时，通信装置可根据第一信息比特和第一序列确定信息比特，或者，也可以根据第一信息比特和序列Q’所示的序列确定信息比特，或者，也可以根据第一信息比特和第一序列对应的N长序列(例如可称为第二序列)确定信息比特，其中，N为Polar码母码长度。其中如图6所示，第一序列对应的N长序列中的N个元素一一对应于序列Q中的N个比特，其中，该N长序列中的第i个元素P’[i]是序列Q中的第i个元素Q[i]对应的第一序列的值(也就是第一序列中的第n个元素的值)。假设第一序列表示为P，第n个元素表示为P[n]，第一序列对应的N长序列表示为P’，其中第i个元素表示为P’[i]，则P’[i]＝P[n]，沿用前文中的描述，
Figure PCTCN2022137015-appb-000007
Figure PCTCN2022137015-appb-000008
i＝0、1、……、N-1，n＝0、1、……、M-1。
此外，通信装置也可以根据序列Q”确定信息比特。根据图6所示的Q”序列，当通信装置确定信息比特时，可按照从右到左排可靠性排序依次选择Polar码中的一个比特，判断该比特的可靠度排序是否属于可靠度排序最高的前K个比特，K为信息比特的总数。如果属于前K个比特，则可将该位置索引确定为信息比特的位置索引。例如，以K＝6为例，Q”序列中可靠度排序最高的K个位置索引为{31,30,29,27,23,28}，因此，Polar码中的信息比特的位置索引为{31,30,29,27,23,28}。而如果根据序列Q确定可靠度排序最高的K个位置索引作为信息比特，则会将位置索引为{31,30,29,27,23,15}的比特作为信息比特。
下面结合图7对本申请实施例提供的方法中对序列Q进行调整的原理进行介绍。
将母码长度N分成16个子块，其每个码字侧的子信道，信道接受的LLR均值为L,经过log 2(16)层的密度进化后，子块x的每个子信道LLR均值已经变成A，子块y的每个子信道LLR均值变成B，子块z的每个子信道LLR均值变成C。后续子块内部继续进行密度进化，因此子块x内每个比特在完全极化以后的子信道LLR均值变成A.i。其中，i＝0,1,2，…N/M-1。子块y内每个比特在完全极化以后的子信道LLR均值变成B.i，子块z内每个比特在完全极化以后的子信道LLR均值变成C.i。
经过对A.i,B,i,C.i内的所有值排序后，就会确定子块x，y，z在可靠度序列Q内的排序。当打孔很多以后，子块y的经过log 2(16)层的LLR均值B’已经和构造时的B值相差很远，但是和A的值相对接近。而子块x经过log 2(16)层的LLR均值C’和原来的C还是差不多。因为已知B’和A接近，又知道Q序列里有A经过密度进化以后和C经过 密度进化以后的信道侧A.i和C.i的排序关系，因此用Q序列中的x的位置来表示新的y。所以有调整序列O(即第一序列)，其中O[x]＝y-x。而在读出Q序列后，如果
Figure PCTCN2022137015-appb-000009
Figure PCTCN2022137015-appb-000010
则读出来的调整值为y-x，根据(Q[i]+(x-y)*(N/M))就得到y子块内的位置索引。根据序列O对图7所示序列Q进行调整后，可获得如图8所示的序列Q。其中，序列Q’中的x.0、x.1、x.2和x.127等位置(通过方形阴影表示)经过调整后的取值(即图8中序列Q)为图7中序列Q的y0、y1、y2和y.127等位置(通过从左下到右上方向的斜线阴影表示)的取值。
而对于子块x，如果其已经被打孔或者预冻结，则无需考虑他的被替代序列。如果未被打孔，则会有对应的w子块(图8中未示出)来取代x，有O[w]＝x-w。
基于图5所示流程，通信装置可根据可靠度排序和第一序列确定中的信息比特的位置，由于不仅仅是根据可靠度排序确定中的信息比特的位置，而是通过第一序列对可靠度排序进行调整以确定信息比特的位置，可以避免出现坏点，提高通信性能。例如图3B所示，虚线部分表示采用NAT打孔并且基于本申请提供方法所确定的信息比特的位置时，不同信息长度下的符号信噪比性能。可见，基于本申请提供的方法可避免采用NAT打孔时出现坏点，提高通信性能。另外，如图3C所示，相比于子块交织的方案，基于本申请提供的方法(图3C中虚线所示)，容量为0的点不会被选择为信息比特，可避免采用5G子块交织打孔时出现坏点，提高通信性能。
以N*9.5/16≤E<N*10.5/16为例，通信装置在确定信息比特时先将位置索引最小的(N-E)个比特，以及额外的一部分比特作为预冻结位置，因此预冻结位置尺寸(pre-freeze-size)可以表示为pre-freeze-size＝N-floor(E/(N/32))*(N/32)。
由于打孔操作，在确定信息比特时，将N*7/16≤Q[i]<N*8/16的这个部分的比特用N*6/1≤Q[i]<N*7/16的这个部分的比特取代。而N*6/16≤Q[i]<N*7/16的这段比特被占用后，由N*4/16≤Q[i]<N*5/16由这个部分的比特平移来代替。替换过程可通过第一序列表示。
一个具体例子的伪代码可表示为：
Figure PCTCN2022137015-appb-000011
仍以N*9.5/16≤E<N*10.5/16为例，通信装置在确定信息比特时先将位置索引最小的(N-E)个比特，以及额外的一部分比特floor(E/(N/32))*(N/32)作为预冻结位置，因此预冻结位置可以表示为pre-freeze-size＝N-floor(E/(N/32))*(N/32)。
假设N＝4096，且子块数量为16，则每个子块为256长。当N*9/16≤E<N*10/16时，根据表2或表3可确定第一序列为Seq-6＝{NA,NA,NA,NA,2,NA,1,NA,0,0,0,0,0,0,0,0}。
则伪代码为：
Figure PCTCN2022137015-appb-000012
如图9所示，本申请实施例还提供一种方法，由发送端和接收端实施。该方法可包括以下步骤：
S201：发送端确定Polar码中的信息比特的位置。
其中，发送端确定信息比特的位置的方式可参照图5所示流程，这里不再赘述。
S202：发送端将冻结比特的位置的值置为0，以及将待发送比特映射到信息比特的位置。
S203：发送端将Polar码调制后通过信道发送。
S204：接收端解调接收的信号。
S205：接收端根据打孔位置解速率匹配。
S206：接收端根据Polar码中的信息比特的位置，获取通过信息比特映射的信息，即获得发送端传输的信息。
其中，接收端可参照图5所示流程确定信息比特的位置，这里不再赘述。
可以理解的是，为了实现上述实施例中功能，本申请实施例还提供一种通信装置。该通信装置可包括执行各个功能相应的硬件结构和/或软件模块。本领域技术人员应该很容易意识到，结合本申请中所公开的实施例描述的各示例的单元及方法步骤，本申请能够以硬件或硬件和计算机软件相结合的形式来实现。某个功能究竟以硬件还是计算机软件驱动硬件的方式来执行，取决于技术方案的特定应用场景和设计约束条件。
图10至图12为本申请的实施例提供的可能的通信装置的结构示意图。该通信装置可以用于实现上述方法实施例相应的功能，因此也能实现上述方法实施例所具备的有益效果。在一种可能的实现中，该通信装置可以是如图1所示的网络设备或终端设备。相关细节和效果可以参见前述实施例的描述。
如图10所示，通信装置1000包括处理单元1010和通信单元1020，其中通信单元1020还可以为收发单元或输入输出接口等。通信装置1000可用于实现上述图5和/或图9所示方法实施例中发送端或接收端的功能。
可选的，在由发送端执行的方法时，通信单元1020可用于获取信息比特。处理单元1010，可用于根据极化码的母码长度和待发送比特的长度确定第一序列，所述母码长度为2的正整数次幂，所述第一序列用于调整所述极化码中的比特的可靠度排序，并根据所述可靠度排序和所述第一序列，确定所述极化码中的信息比特的位置。可选的，通信单元1020可用于发送或接收映射到该信息比特位置的信息。
可选的，所述处理单元1010可具体用于获得所述极化码中比特的第一位置值，根据所述第一位置值从第一序列中选择偏移值，并根据所述偏移值和所述第一位置值确定所述极化码中比特的第二位置值，所述第二位置值为所述极化码中的信息比特的位置索引。
可选的，所述处理单元1010还用于根据所述第一位置值从所述第一序列中选择无效值，并根据所述无效值确定不根据所述第一位置值求解所述极化码中的信息比特的位置索引。
可选的，所述处理单元1010可具体用于根据所述第一位置值和子块长度确定所述第一位置值所属的子块的序号，并根据所述序号从所述第一序列中的多个元素中确定所述偏移值。
可选的，所述第二位置值根据所述偏移值、所述第一位置值和所述子块长度确定。
可选的，所述处理单元1010还可用于根据所述母码长度和所述待发送比特的长度确定极化码的比特的预冻结位置，所述预冻结位置不作为所述信息比特的位置。
可选的，如果所述待发送比特的码长E不能被N/32整除，所述预冻结位置的数量P满足：
P＝N-floor(E/(N/32))*(N/32)，或者，
如果E能被N/32整除，则预冻结位置的数量P满足：
P＝N-E+(N/32)，
其中，N表示所述Polar码的母码长度，floor()表示向下取整。
可选的，当15.5*N/16<E≤N时，所述第一序列为{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当14.5*N/16<E≤15.5*N/16时，所述第一序列为{1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当13.5*N/16<E≤14.5*N/16时，所述第一序列为{NA,1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当12.5*N/16<E≤13.5*N/16时，所述第一序列为{NA,NA,2,NA,-1,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当11.5*N/16<E≤12.5*N/16时，所述第一序列为{NA,3,NA,2,NA,1,NA,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当10.5*N/16<E≤11.5*N/16时，所述第一序列为{NA,NA,NA,3,1,NA,1,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当9.5*N/16<E≤10.5*N/16时，所述第一序列为{NA,NA,NA,NA,2,NA,1,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当8*N/16<E≤9.5*N/16时，所述第一序列为{NA,NA,NA,4,NA,NA,NA,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度。
在实现由发送端执行的动作时，通信单元1020可用于接收第一信息，第一信息包括极化码的母码长度和待发送比特的长度，所述母码长度为2的正整数次幂；处理单元1010，可用于根据极化码的母码长度和待发送比特的长度确定第一序列，所述第一序列用于调整所述极化码中的比特的可靠度排序，根据所述可靠度排序和所述第一序列，确定所述极化 码中的信息比特的位置，以及根据所述信息比特的位置译码由所述极化码编码的数据。
可选的，通信单元1020还可用于通过空口接收来自于发送端的由所述极化码编码的数据。
可选的，所述处理单元1010可具体用于获得所述极化码中比特的第一位置值，根据所述第一位置值从第一序列中选择偏移值，并根据所述偏移值和所述第一位置值确定所述极化码中比特的第二位置值，所述第二位置值为所述极化码中的信息比特的位置索引。
可选的，所述处理单元1010还用于根据所述第一位置值从所述第一序列中选择无效值，并根据所述无效值确定不根据所述第一位置值求解所述极化码中的信息比特的位置索引。
可选的，所述处理单元1010可具体用于根据所述第一位置值和子块长度确定所述第一位置值所属的子块的序号，并根据所述序号从所述第一序列中的多个元素中确定所述偏移值。
可选的，所述第二位置值根据所述偏移值、所述第一位置值和所述子块长度确定。
可选的，所述处理单元1010还可用于根据所述母码长度和所述待发送比特的长度确定极化码的比特的预冻结位置，所述预冻结位置不作为所述信息比特的位置。
可选的，如果所述待发送比特的码长E不能被N/32整除，所述预冻结位置的数量P满足：
P＝P＝N-floor(E/(N/32))*(N/32)，或者，
如果E能被N/32整除，则预冻结位置的数量P满足：
P＝N-E+(N/32)，
其中，N表示所述Polar码的母码长度，floor()表示向下取整。
可选的，当15.5*N/16<E≤N时，所述第一序列为{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当14.5*N/16<E≤15.5*N/16时，所述第一序列为{1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当13.5*N/16<E≤14.5*N/16时，所述第一序列为{NA,1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当12.5*N/16<E≤13.5*N/16时，所述第一序列为{NA,NA,2,NA,-1,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当11.5*N/16<E≤12.5*N/16时，所述第一序列为{NA,3,NA,2,NA,1,NA,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当10.5*N/16<E≤11.5*N/16时，所述第一序列为{NA,NA,NA,3,1,NA,1,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当9.5*N/16<E≤10.5*N/16时，所述第一序列为{NA,NA,NA,NA,2,NA,1,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
当8*N/16<E≤9.5*N/16时，所述第一序列为{NA,NA,NA,4,NA,NA,NA,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度。
本申请实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可 以有另外的划分方式，另外，在本申请各个实施例中的各功能模块可以集成在一个处理器中，也可以是单独物理存在，也可以两个或两个以上模块集成在一个模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。
如图11所示为本申请实施例提供的通信装置1100，用于实现本申请提供的通信方法。该通信装置1100可以是应用该通信方法的通信装置，也可以是通信装置中的组件，或者是能够和通信装置匹配使用的装置。通信装置1100可以是发送端或接收端。其中，该通信装置1100可以为芯片***或芯片。本申请实施例中，芯片***可以由芯片构成，也可以包含芯片和其他分立器件。通信装置1100包括至少一个处理器1120，用于实现本申请实施例提供的通信方法。通信装置1100还可以包括输出接口1110，输出接口也可称为输入输出接口。在本申请实施例中，输出接口1110可用于通过传输介质和其它装置进行通信，其功能可包括发送和/或接收。例如，通信装置1100是芯片时，通过输出接口1110与其他芯片或器件进行传输。处理器1120可用于实现上述方法实施例所示的方法。
示例性的，处理器1120可用于执行由处理单元1010执行的动作，输出接口1110可用于执行由通信单元1020执行的动作，不再赘述。
可选的，通信装置1100还可以包括至少一个存储器1130，用于存储程序指令和/或数据。存储器1130和处理器1120耦合。本申请实施例中的耦合是装置、单元或模块之间的间接耦合或通信连接，可以是电性，机械或其它的形式，用于装置、单元或模块之间的信息交互。处理器1120可能和存储器1130协同操作。处理器1120可能执行存储器1130中存储的程序指令。该至少一个存储器中的至少一个可以与处理器集成在一起。
在本申请实施例中，存储器1130可以是非易失性存储器，比如硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)等，还可以是易失性存储器(volatile memory)，例如随机存取存储器(random-access memory，RAM)。存储器是能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。本申请实施例中的存储器还可以是电路或者其它任意能够实现存储功能的装置，用于存储程序指令和/或数据。
在本申请实施例中，处理器1120可以是通用处理器、数字信号处理器、专用集成电路、现场可编程门阵列或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件，可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件模块组合执行完成。
如图12所示为本申请实施例提供的通信装置1200，用于实现本申请提供的通信方法。该通信装置1200可以是应用本申请实施例所示通信方法的通信装置，也可以是通信装置中的组件，或者是能够和通信装置匹配使用的装置。通信装置1200可以是发送端或接收端。其中，该通信装置1200可以为芯片***或芯片。本申请实施例中，芯片***可以由芯片构成，也可以包含芯片和其他分立器件。上述实施例提供的应用惠更斯等效面的通信方法中的部分或全部可以通过硬件来实现也可以通过软件来实现，当通过硬件实现时，通信装置1200可包括：输入接口电路1201、逻辑电路1202和输出接口电路1203。
可选的，以该装置用于实现接收端的功能为例，输入接口电路1201可用于执行上述由通信单元1020执行的接收动作，输出接口电路1203可用于执行上述由通信单元1020执行的发送动作，逻辑电路1202可用于执行上述由处理单元1010执行的动作，不再赘述。
可选的，通信装置1200在具体实现时可以是芯片或者集成电路。
本申请上述方法实施例描述的通信装置所执行的操作和功能中的部分或全部，可以用芯片或集成电路来完成。
本申请实施例提供了一种计算机可读存储介质，存储有计算机程序，该计算机程序包括用于执行上述方法实施例的指令。
本申请实施例提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述方法实施例。
本申请实施例提供了一种通信***。具体的，该通信***可包括用于实现图5和/或图9所示方法的第一通信装置。具体请参考上述方法实施例中的相关描述，这里不再赘述。该通信***可包括图1所示结构。
本领域内的技术人员应明白，本申请的实施例可提供为方法、***、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请是参照根据本申请实施例的方法、设备(***)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。

Claims (21)

  1. 一种信息比特的确定方法，其特征在于，包括：
    根据极化码的母码长度和待发送比特的长度确定第一序列，所述母码长度为2的正整数次幂，所述第一序列用于调整所述极化码中的比特的可靠度排序；
    根据所述可靠度排序和所述第一序列，确定所述极化码中的信息比特的位置。
  2. 如权利要求1所述的方法，其特征在于，所述根据所述极化码中的比特的可靠度序列和所述第一序列，确定所述极化码中的信息比特的位置，包括：
    获得所述极化码中比特的第一位置值；
    根据所述第一位置值从第一序列中选择偏移值；
    根据所述偏移值和所述第一位置值确定所述极化码中比特的第二位置值，所述第二位置值为所述极化码中的信息比特的位置索引。
  3. 如权利要求2所述的方法，其特征在于，所述方法还包括：
    根据所述第一位置值从所述第一序列中选择无效值；
    根据所述无效值确定不根据所述第一位置值求解所述极化码中的信息比特的位置索引。
  4. 如权利要求2所述的方法，其特征在于，所述根据所述第一位置值从第一序列中确定偏移值，包括：
    根据所述第一位置值和子块长度确定所述第一位置值所属的子块的序号；
    根据所述序号从所述第一序列中的多个元素中确定所述偏移值。
  5. 如权利要求4所述的方法，其特征在于，所述第二位置值根据所述偏移值、所述第一位置值和所述子块长度确定。
  6. 如权利要求1-5中任一所述的方法，其特征在于，还包括：
    根据所述母码长度和所述待发送比特的长度确定极化码的比特的预冻结位置，所述预冻结位置不作为所述信息比特的位置。
  7. 如权利要求6所述的方法，其特征在于，如果所述待发送比特的码长E不能被N/32整除，所述预冻结位置的数量P满足：
    P＝N-floor(E/(N/32))*(N/32)，或者，
    如果E能被N/32整除，则预冻结位置的数量P满足：
    P＝N-E+(N/32)，
    其中，N表示所述Polar码的母码长度，floor()表示向下取整。
  8. 如权利要求1-7中任一所述的方法，其特征在于，
    当15.5*N/16<E≤N时，所述第一序列为{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当14.5*N/16<E≤15.5*N/16时，所述第一序列为{1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当13.5*N/16<E≤14.5*N/16时，所述第一序列为{NA,1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当12.5*N/16<E≤13.5*N/16时，所述第一序列为{NA,NA,2,NA,-1,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当11.5*N/16<E≤12.5*N/16时，所述第一序列为{NA,3,NA,2,NA,1,NA,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当10.5*N/16<E≤11.5*N/16时，所述第一序列为{NA,NA,NA,3,1,NA,1,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当9.5*N/16<E≤10.5*N/16时，所述第一序列为{NA,NA,NA,NA,2,NA,1,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当8*N/16<E≤9.5*N/16时，所述第一序列为{NA,NA,NA,4,NA,NA,NA,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度。
  9. 一种信息比特的确定方法，其特征在于，包括：
    接收第一信息，所述第一信息包括极化码的母码长度和待发送比特的长度，所述母码长度为2的正整数次幂；
    根据极化码的母码长度和待发送比特的长度确定第一序列，所述第一序列用于调整所述极化码中的比特的可靠度排序；
    根据所述可靠度排序和所述第一序列，确定所述极化码中的信息比特的位置；
    根据所述信息比特的位置译码由所述极化码编码的数据。
  10. 如权利要求9所述的方法，其特征在于，所述根据所述极化码中的比特的可靠度序列和所述第一序列，确定所述极化码中的信息比特的位置，包括：
    获得所述极化码中比特的第一位置值；
    根据所述第一位置值从第一序列中选择偏移值；
    根据所述偏移值和所述第一位置值确定所述极化码中比特的第二位置值，所述第二位置值为所述极化码中的信息比特的位置索引。
  11. 如权利要求10所述的方法，其特征在于，所述方法还包括：
    根据所述第一位置值从所述第一序列中选择无效值；
    根据所述无效值确定不根据所述第一位置值求解所述极化码中的信息比特的位置索引。
  12. 如权利要求10所述的方法，其特征在于，所述根据所述第一位置值从第一序列中确定偏移值，包括：
    根据所述第一位置值和子块长度确定所述第一位置值所属的子块的序号；
    根据所述序号从所述第一序列中的多个元素中确定所述偏移值。
  13. 如权利要求12所述的方法，其特征在于，所述第二位置值根据所述偏移值、所述第一位置值和所述子块长度确定。
  14. 如权利要求9-13中任一所述的方法，其特征在于，还包括：
    根据所述母码长度和所述待发送比特的长度确定极化码的比特的预冻结位置，所述预冻结位置不作为所述信息比特的位置。
  15. 如权利要求14所述的方法，其特征在于，如果所述待发送比特的码长E不能被N/32整除，所述预冻结位置的数量P满足：
    P＝N-floor(E/(N/32))*(N/32)，或者，
    如果E能被N/32整除，则预冻结位置的数量P满足：
    P＝N-E+(N/32)，
    其中，N表示所述Polar码的母码长度，floor()表示向下取整。
  16. 如权利要求9-15中任一所述的方法，其特征在于，
    当15.5*N/16<E≤N时，所述第一序列为{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当14.5*N/16<E≤15.5*N/16时，所述第一序列为{1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当13.5*N/16<E≤14.5*N/16时，所述第一序列为{NA,1,1,NA,0,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当12.5*N/16<E≤13.5*N/16时，所述第一序列为{NA,NA,2,NA,-1,0,0,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当11.5*N/16<E≤12.5*N/16时，所述第一序列为{NA,3,NA,2,NA,1,NA,0,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当10.5*N/16<E≤11.5*N/16时，所述第一序列为{NA,NA,NA,3,1,NA,1,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当9.5*N/16<E≤10.5*N/16时，所述第一序列为{NA,NA,NA,NA,2,NA,1,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度；
    当8*N/16<E≤9.5*N/16时，所述第一序列为{NA,NA,NA,4,NA,NA,NA,NA,0,0,0,0,0,0,0,0}，N为所述母码长度，E为所述待发送比特的长度。
  17. 一种通信装置，其特征在于，包括：处理器和存储器；所述存储器用于存储一个或多个计算机程序，所述一个或多个计算机程序包括计算机执行指令，当所述通信装置运行时，所述处理器执行所述存储器存储的所述一个或多个计算机程序，以使得所述通信装置执行如权利要求1-8中任一项所述的方法，或使得所述通信装置执行如权利要求9-16中任一项所述的方法。
  18. 一种芯片***，其特征在于，所述芯片***包括逻辑电路和输入输出接口，其中：
    所述输入输出接口用于与所述芯片***之外的其他通信装置进行通信，所述逻辑电路用于执行如权利要求1-8中任一项所述的方法；
    或者，所述输入输出接口用于与所述芯片***之外的其他通信装置进行通信，所述逻辑电路用于执行如权利要求9-16中任一项所述的方法。
  19. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质用于存储计算机程序，当所述计算机程序在计算机上运行时，使得所述计算机执行如权利要求1-8中任一项所述的方法，或使得所述计算机执行如权利要求9-16中任一项所述的方法。
  20. 一种计算机程序产品，其特征在于，所述计算机程序产品包括计算机程序，当所述计算机程序在计算机上运行时，使得所述计算机执行如权利要求1-8中任一项所述的方法，或使得所述计算机执行如权利要求9-16中任一项所述的方法。
  21. 一种通信***，其特征在于，包括发送端和接收端，其中，所述发送端用于执行如权利要求1-8中任一所述的方法，所述接收端用于执行如权利要求9-16中任一所述的方法。
PCT/CN2022/137015 2022-12-06 2022-12-06 一种信息比特的确定方法及装置 WO2024119379A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2022/137015 WO2024119379A1 (zh) 2022-12-06 2022-12-06 一种信息比特的确定方法及装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2022/137015 WO2024119379A1 (zh) 2022-12-06 2022-12-06 一种信息比特的确定方法及装置

Publications (1)

Publication Number Publication Date
WO2024119379A1 true WO2024119379A1 (zh) 2024-06-13

Family

ID=91378460

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/137015 WO2024119379A1 (zh) 2022-12-06 2022-12-06 一种信息比特的确定方法及装置

Country Status (1)

Country Link
WO (1) WO2024119379A1 (zh)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107819545A (zh) * 2016-09-12 2018-03-20 华为技术有限公司 极化码的重传方法及装置
CN109286468A (zh) * 2017-07-20 2019-01-29 中兴通讯股份有限公司 极化码比特位置选择方法、装置和计算机设备
CN110247730A (zh) * 2018-03-09 2019-09-17 华为技术有限公司 基于极化码的盲检测方法及设备
CN111200476A (zh) * 2018-11-16 2020-05-26 华为技术有限公司 Polar码编码方法及装置
CN114070330A (zh) * 2017-08-02 2022-02-18 华为技术有限公司 一种Polar码编码方法及装置
WO2022117061A1 (zh) * 2020-12-03 2022-06-09 华为技术有限公司 一种极化码辅助比特的确定方法和装置

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107819545A (zh) * 2016-09-12 2018-03-20 华为技术有限公司 极化码的重传方法及装置
CN109286468A (zh) * 2017-07-20 2019-01-29 中兴通讯股份有限公司 极化码比特位置选择方法、装置和计算机设备
CN114070330A (zh) * 2017-08-02 2022-02-18 华为技术有限公司 一种Polar码编码方法及装置
CN110247730A (zh) * 2018-03-09 2019-09-17 华为技术有限公司 基于极化码的盲检测方法及设备
CN111200476A (zh) * 2018-11-16 2020-05-26 华为技术有限公司 Polar码编码方法及装置
WO2022117061A1 (zh) * 2020-12-03 2022-06-09 华为技术有限公司 一种极化码辅助比特的确定方法和装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
NOKIA NETWORKS: "Corrections for alignment between charging specifications", 3GPP DRAFT; S5-144422 REL-12 CR 32271 CORRECTIONS FOR ALIGNMENT BETWEEN CHARGING SPECIFICATIONS, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. SA WG5, no. Sophia Antipolis; 20140818 - 20140822, 22 August 2014 (2014-08-22), Mobile Competence Centre ; 650, route des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France , XP050842152 *

Similar Documents

Publication Publication Date Title
JP7017627B2 (ja) 通信システムにおける冗長バージョン設計ソリューション
CN110166167B (zh) 编码的方法、译码的方法、编码设备和译码设备
WO2019179404A1 (zh) 通信方法、通信装置和***
WO2021103978A1 (zh) 一种极化码编码方法及装置
WO2022161201A1 (zh) 编码调制与解调解码方法及装置
WO2022218208A1 (zh) 一种调制方法、解调方法及通信装置
WO2021254422A1 (zh) Polar码编码方法、Polar码译码方法及其装置
CN111200476B (zh) Polar码编码方法及装置
WO2022268130A1 (zh) 一种网络编码方法及装置
WO2024119379A1 (zh) 一种信息比特的确定方法及装置
WO2023024987A1 (zh) 一种编码、译码方法及通信装置
WO2021249080A1 (zh) 编码方法及装置
TWI707566B (zh) 一種通道編碼方法及設備
CN115549849A (zh) 数据处理方法及装置
WO2019144787A1 (zh) 一种交织方法及交织设备
WO2024077486A1 (zh) 一种确定循环冗余校验比特的方法、通信方法及装置
WO2024113249A1 (zh) 一种数据处理方法及装置
WO2023030236A1 (zh) 一种数据传输方法、数据接收方法和通信装置
WO2023273975A1 (zh) 一种数据传输方法和通信装置
WO2024055934A1 (zh) 编码方法、译码方法、通信装置及计算机可读存储介质
WO2024016161A1 (zh) 一种数据传输方法及装置
WO2024031285A1 (zh) 一种数据处理方法、装置及设备
WO2022268064A1 (zh) 数据传输方法及相关装置
WO2024092415A1 (zh) 一种通信方法及装置
WO2022011715A1 (zh) 数据传输方法及装置