Flexible nested reliability sequence extraction method, system and apparatus

Abstract

Embodiments of the present application provide flexible nested reliability sequence extraction methods, systems and apparatus. In the method, a plurality of reliability ordering sequences are determined, and a plurality of information bits are encoded based on the plurality of reliability ordering sequences. The plurality of information bits are encoded into a plurality of codewords. The plurality of codewords correspond to the plurality of reliability ordering sequences, which means that one codeword can correspond to at least one reliability ordering sequence. The flexible nested reliability sequence extraction method and apparatus can be applied to a communication system to support scenarios where multiple codes with at least one retransmission or multiple redundancy versions are needed.

Description

[0001] Cross-reference to related applications

[0002] This application relates to and claims priority to U.S. Provisional Patent Application No. 63 / 598,579, filed November 14, 2023, entitled “Flexible Nested Reliability Sequence Extraction,” the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application relates to coding, and more particularly to a method, system, and apparatus for extracting flexible nested reliable sequences. Background Technology

[0004] In the field of communication systems, channel coding is commonly used to improve signal transmission reliability and ensure communication quality. Existing coding methods have been proven to achieve theoretical channel capacity with relatively low encoding and decoding complexity.

[0005] With the rapid evolution of wireless communication systems, some new wireless communication systems (such as the sixth-generation (6G) system) are designed to support new scenarios such as immersive communication, massive communication, and ultra-reliable low-latency communication.

[0006] However, existing encoding schemes cannot support the following new scenarios: new scenarios that require retransmission, especially scenarios that will generate multiple redundant versions of the code accordingly, or new scenarios that require multiple transmissions at the same time. Summary of the Invention

[0007] The following examples relate to embodiments described throughout this invention.

[0008] One or more embodiments relate to a method. The method includes: determining a plurality of reliability ordering sequences; encoding a plurality of information bits based on the plurality of reliability ordering sequences to obtain a plurality of codewords, wherein the plurality of codewords correspond to the plurality of reliability ordering sequences.

[0009] In some embodiments, multiple reliability sorting sequences refer to multiple second (shorter) sequences. In some embodiments, an element within one reliability sorting sequence can be associated with an element within another reliability sorting sequence, meaning that one reliability sorting sequence can be obtained based on another. For example, the value of an element within one reliability sorting sequence can be obtained based on the value of an element within another reliability sorting sequence. In the future, communication systems may need to support several scenarios requiring at least one retransmission or multiple redundant versions of the code during transmission. Therefore, after determining multiple reliability sorting sequences, multiple codes can be encoded and decoded to help the communication system support scenarios requiring retransmission, multiple simultaneous transmissions, or multiple redundant versions of the code. The above method can also reduce decoding complexity in high-throughput communication scenarios and improve the performance of multiple transmissions.

[0010] In some implementations of the method, the values ​​of the elements within the plurality of reliability sorting sequences are greater than zero.

[0011] In some embodiments, the values ​​of elements within the multiple reliability ranking sequences can be greater than zero, and the elements within the multiple reliability ranking sequences can be ordered according to reliability. In some embodiments, the values ​​of elements within the multiple reliability ranking sequences can also be not less than zero. The range of values ​​for elements within the multiple reliability ranking sequences is very flexible. In this embodiment of the invention, no specific limitation is made on the range of values ​​for elements within the multiple reliability ranking sequences.

[0012] In some implementations of the method, determining the plurality of reliability ranking sequences includes: determining the plurality of reliability ranking sequences by selecting a plurality of elements from a reference reliability sequence.

[0013] In some embodiments, multiple reliability ranking sequences can be obtained by extracting some elements from a reference reliability sequence, which can be very flexible and convenient when determining multiple reliability ranking sequences.

[0014] In some implementations of the method, the length of the reference reliability sequence is less than or equal to the maximum mother code length.

[0015] In some embodiments, the length of the reference reliability sequence refers to the number of elements within the reference reliability sequence, or the total number of elements within the reference reliability sequence. The length of the reference reliability sequence may be limited by the maximum mother code length, and can be any value less than the maximum mother code length. Therefore, determining the length of the reference reliability sequence by choosing a value less than or equal to the maximum mother code length is very flexible.

[0016] In some implementations of the method, the elements in the reference reliability sequence and the elements in each of the plurality of reliability sorting sequences are arranged in order of reliability from low to high.

[0017] In some embodiments, the elements in the reference reliability sequence and the elements in each of the plurality of reliability sorting sequences may also be arranged in descending order of reliability. In some embodiments, the order of the elements in the reference reliability sequence and the elements in each of the plurality of reliability sorting sequences may be different. In this embodiment of the invention, the order of the elements in the reference reliability sequence and the elements in each of the plurality of reliability sorting sequences is not specifically limited.

[0018] In some implementations of the method, the values ​​of elements in the first numerical sequence of the plurality of reliability sorting sequences are not less than a first integer and not greater than a second integer, and both the first integer and the second integer are not less than zero and not greater than the length of the reference reliability sequence.

[0019] In some embodiments, the first number sequence refers to the second (shorter) sequence. The method for obtaining the values ​​of elements within the first number sequence from multiple reliability ordering sequences can be very flexible to obtain different elements within the first number sequence, which can be applied to different scenarios during transmission.

[0020] In some implementations of the method, the first integer and the second integer are associated with at least one of the following:

[0021] The length of the first digital sequence and the length of the reference reliability sequence.

[0022] In some implementations of the method, the first integer is equal to the length of the first number sequence, and the second integer is equal to twice the length of the first number sequence.

[0023] In some embodiments, the value of an element can be any value within the range of [0, the length of the reference reliability sequence]. This allows for flexible extraction of elements from multiple reliability ordering sequences, making it applicable to many scenarios requiring multiple retransmissions or multiple redundant versions of the code, thus helping communication systems support these scenarios.

[0024] In some implementations of the method, the first integer is equal to the difference between the length of the reference reliability sequence and the length of the first number sequence, and the second integer is equal to the length of the reference reliability sequence.

[0025] In some embodiments, the method of flexibly extracting elements within multiple reliability sorting sequences can be applied to many scenarios that require multiple retransmissions or multiple redundant versions of codes, which helps communication systems support these scenarios.

[0026] In some implementations of the method, the first integer is equal to half the length of the reference reliability sequence, and the second integer is equal to the length of the reference reliability sequence.

[0027] In some embodiments, a method for flexibly extracting elements from multiple reliability sorting sequences can help communication systems support different scenarios.

[0028] In some implementations of the method, the remainder of the value of an element in the second number sequence of the plurality of reliability sorting sequences divided by a third integer is a fourth integer.

[0029] In some embodiments, the second numerical sequence refers to a second (shorter) sequence. The values ​​of the elements in the second numerical sequence can be moduloed with an integer, with the remainder also being an integer. Then, the modulo operation is used to extract the reference reliability sequence, resulting in flexible elements within multiple reliability ranking sequences.

[0030] In some implementations of the method, the third integer and the fourth integer are both related to at least one of the following: the length of the second number sequence and the length of the reference reliability sequence.

[0031] In some implementations of the method, the third integer is equal to 2. m m is a positive integer, and the fourth integer is zero.

[0032] In one embodiment, the method for extracting elements from the second number sequence can be: selecting even elements from the reference reliability sequence. This flexible extraction of elements from the second number sequence can be applied to different scenarios.

[0033] In some implementations of the method, the third integer is equal to 2. n n is a positive integer, and the fourth integer is 2. p Subtract 1, where p is a positive integer.

[0034] In one embodiment, the method for extracting elements from the second number sequence can be: selecting odd elements from a reference reliability sequence. This flexible extraction of elements from the second number sequence can be applied to different scenarios.

[0035] In some implementations of the method, the value of an element in the third sequence of the plurality of reliability sorting sequences is equal to the difference between the value of an element in the fourth sequence of the plurality of reliability sorting sequences and a fifth integer.

[0036] In some embodiments, the third and fourth sequences refer to the second (shorter) sequence. In some embodiments, an element within one of the multiple reliability ranking sequences can be obtained by performing arithmetic operations on elements within another of the multiple reliability ranking sequences. Thus, another sequence of the multiple reliability ranking sequences can be obtained from one of the multiple reliability ranking sequences.

[0037] In some implementations of the method, the fifth integer is associated with at least one of the following: the length of the third sequence, the length of the fourth sequence, and the length of the reference reliability sequence.

[0038] In some implementations of the method, the value of an element in the fifth sequence of the plurality of reliability sorting sequences is equal to the quotient obtained by dividing the value of an element in the sixth sequence of the plurality of reliability sorting sequences by a sixth integer.

[0039] The fifth and sixth sequences refer to the second (shorter) sequence. In some embodiments, it is flexible to obtain another sequence from a plurality of reliability ranking sequences based on one of the sequences, which can facilitate the acquisition of multiple reliability ranking sequences.

[0040] In some implementations of the method, the sixth integer is associated with at least one of the following: the length of the fifth sequence and the length of the reference reliability sequence.

[0041] In some implementations of the method, the sixth integer is equal to 2. q q is a positive integer.

[0042] In some implementations of the method, the value of an element in the seventh sequence of the plurality of reliability sorting sequences is not less than a seventh integer and not greater than an eighth integer. The values ​​of the seventh integer and the eighth integer are both not less than zero and not greater than the length of the reference reliability sequence. The first integer is different from the seventh integer, and the second integer is different from the eighth integer.

[0043] In some embodiments, the seventh sequence refers to the second (shorter) sequence. The value range of elements within one of the multiple reliability ranking sequences may differ from the value range of elements within another of the multiple reliability ranking sequences. In this embodiment of the invention, the value range of elements within the multiple reliability ranking sequences is not specifically limited. This flexible approach can be applied to different scenarios.

[0044] In some implementations of the method, the seventh integer and the eighth integer are related to at least one of the following: the length of the seventh sequence and the length of the reference reliability sequence.

[0045] In some implementations of the method, encoding multiple information bits based on the multiple reliability sorting sequences to obtain multiple codewords includes: determining a set of information bits within each of the multiple reliability sorting sequences according to the multiple information bits and the multiple reliability sorting sequences; and encoding the multiple information bits based on the set of information bits within each of the multiple reliability sorting sequences to obtain multiple codewords.

[0046] In some embodiments, after determining multiple reliability ordering sequences, multiple sets of information bits corresponding to each of the multiple reliability ordering sequences can be obtained. Therefore, multiple information bits can be encoded, which is suitable for different scenarios requiring different transmissions or different redundant versions of the code.

[0047] In some implementations of the method, the method further includes: determining the parity check bit set within each of the plurality of reliability sorting sequences based on the minimum Hamming weight.

[0048] In some embodiments, a parity bit set can be used during the encoding process, which can improve encoding performance.

[0049] One or more embodiments relate to a method. The method includes: acquiring a plurality of codewords, wherein the plurality of codewords correspond to a plurality of reliability ordering sequences; and decoding the plurality of codewords to obtain a plurality of sequences, wherein the plurality of sequences correspond to a plurality of information bits.

[0050] In some embodiments, multiple codewords corresponding to multiple reliability sorting sequences can be decoded, which can be applied to scenarios with different transmissions or different redundant versions of codes, and can improve the performance of multiple transmissions.

[0051] In some implementations of the method, the values ​​of the elements within the plurality of reliability sorting sequences are greater than non-zero integers.

[0052] In some implementations of the method, the plurality of reliability ordering sequences are determined by selecting a plurality of elements from a reference reliability sequence.

[0053] In some implementations of the method, the length of the reference reliability sequence is less than or equal to the maximum mother code length.

[0054] In some implementations of the method, the elements in the reference reliability sequence and the elements in each of the plurality of reliability sorting sequences are arranged in order of reliability from low to high.

[0055] In some implementations of the method, the values ​​of elements in the first numerical sequence of the plurality of reliability sorting sequences are not less than a first integer and not greater than a second integer, and both the first integer and the second integer are not less than zero and not greater than the length of the reference reliability sequence.

[0056] In some implementations of the method, the first integer and the second integer are related to at least one of the following: the length of the first number sequence and the length of the reference reliability sequence.

[0057] In some implementations of the method, the first integer is equal to the length of the first number sequence, and the second integer is equal to twice the length of the first number sequence.

[0058] In some implementations of the method, the first integer is equal to the difference between the length of the reference reliability sequence and the length of the first number sequence, and the second integer is equal to the length of the reference reliability sequence.

[0059] In some implementations of the method, the first integer is equal to half the length of the reference reliability sequence, and the second integer is equal to the length of the reference reliability sequence.

[0060] In some implementations of the method, the remainder of the value of an element in the second number sequence of the plurality of reliability sorting sequences divided by a third integer is a fourth integer.

[0061] In some implementations of the method, the third integer and the fourth integer are both related to at least one of the following: the length of the second number sequence and the length of the reference reliability sequence.

[0062] In some implementations of the method, the third integer is a power of 2, and the fourth integer is zero.

[0063] In some implementations of the method, the third integer is a second power of 2, and the fourth integer is a third power of 2 minus 1.

[0064] In some implementations of the method, the value of an element in the third sequence of the plurality of reliability sorting sequences is equal to the difference between the value of an element in the fourth sequence of the plurality of reliability sorting sequences and a fifth integer.

[0065] In some implementations of the method, the fifth integer is associated with at least one of the following: the length of the third sequence, the length of the fourth sequence, and the length of the reference reliability sequence.

[0066] In some implementations of the method, the value of an element in the fifth sequence of the plurality of reliability sorting sequences is equal to the quotient obtained by dividing the element in the sixth sequence of the plurality of reliability sorting sequences by a sixth integer.

[0067] In some implementations of the method, the sixth integer is associated with at least one of the following: the length of the fifth sequence, the length of the sixth sequence, and the length of the reference reliability sequence.

[0068] In some implementations of the method, the value of an element in the sixth sequence of the plurality of reliability sorting sequences is not less than a seventh integer and not greater than an eighth integer. The values ​​of the seventh integer and the eighth integer are both not less than zero and not greater than the length of the reference reliability sequence. The first integer is different from the seventh integer, and the second integer is different from the eighth integer.

[0069] In some implementations of the method, the seventh integer and the eighth integer are related to at least one of the following: the length of the sixth sequence and the length of the reference reliability sequence.

[0070] One or more embodiments may include an apparatus that includes functions or units for causing the apparatus to perform the method of the present invention.

[0071] One or more embodiments may include an apparatus including a processor for causing the apparatus to perform the method of the present invention.

[0072] One or more embodiments may include an apparatus comprising at least one processor that executes instructions stored in a memory to implement the method of the present invention. The apparatus may be a user equipment, a base station, a communication module in the user equipment or the base station, or a chip / chipset system in the user equipment or the base station.

[0073] One or more embodiments may include a computer program that includes instructions that, when executed by a processor, cause the processor to implement the method of the present invention.

[0074] One or more embodiments may include a non-transitory computer-readable medium storing a program that, when executed by a processor, causes the processor to implement the method of the present invention.

[0075] This invention covers these and other aspects or embodiments. Attached Figure Description

[0076] To provide a more comprehensive understanding of the embodiments of the present invention and their advantages, the following description is provided in conjunction with the accompanying drawings by way of example.

[0077] Figure 1 This is a simplified diagram of a communication system.

[0078] Figure 2 yes Figure 1 A block diagram of an exemplary communication system.

[0079] Figure 3 Examples of exemplary electronic devices and base stations are shown.

[0080] Figure 4 The unit or module in the device is shown.

[0081] Figure 5 This is a lattice diagram of an example polar code.

[0082] Figure 6 It is a table of sub-block interleaver patterns.

[0083] Figure 7 This is a schematic diagram illustrating the use of circular buffers for punching and shortening.

[0084] Figure 8 This is a schematic diagram illustrating an example of an encoding process involving four transmissions.

[0085] Figure 9 This is a schematic diagram illustrating an example of the encoding process for the initial transmission.

[0086] Figure 10 This is a schematic diagram illustrating an example of the encoding process during the first retransmission.

[0087] Figure 11 This is a block diagram of an example polarization transformation matrix for three transmissions.

[0088] Figure 12 This is a flowchart illustrating an example of an encoding method.

[0089] Figure 13 This is a flowchart illustrating an example of a decoding method.

[0090] Figure 14 This is a block diagram illustrating an example of the polar code construction and encoding process. Detailed Implementation

[0091] For illustrative purposes, specific exemplary embodiments are explained in detail below with reference to the accompanying drawings.

[0092] The embodiments described herein illustrate information sufficient to practice the claimed subject matter and explain methods for practicing such subject matter. Those skilled in the art will understand the concepts of the claimed subject matter after reading the following description with reference to the accompanying drawings, and will recognize that the application of these concepts is not specifically mentioned herein. In some embodiments, these concepts and applications are within the scope of the invention and the appended claims.

[0093] Specific examples (such as “methods”) having or providing certain features may be referenced above and / or elsewhere in this document. It should be understood that these are merely exemplary, and such features are not necessarily provided in all examples or embodiments, but may be provided in other examples or embodiments.

[0094] Although the embodiments of the flexible nested reliability sequence extraction method in this invention are illustrated using polar codes as an example, these methods can also be applied to other codes. For example, the flexible nested reliability sequence extraction method in this invention can be applied to low-density parity check (LDPC) codes, turbo codes, Reedmuller (RM) codes, convolutional codes, product codes, etc. In some embodiments of this invention, the code type is not specifically limited.

[0095] For example, flexible nested reliability sequence extraction methods for polar codes can reduce decoding complexity in high-throughput communication scenarios and improve the performance of multiple transmissions (such as incremental-redundancy hybrid automatic repeat request, IR-HARQ).

[0096] A flexible nested reliability sequence extraction method for LDPC codes can reduce the cache size required by terminals with limited cache size and low device capabilities.

[0097] In the flexible nested reliability sequence extraction method for Turbo codes, a flexible extraction method for nested reliability sequences can be determined for different communication scenarios (such as Internet of Things (IoT) devices that require shorter code lengths).

[0098] The flexible nested reliability sequence extraction method for convolutional codes can provide flexible reliability sequences (in the form of constraint length), which can achieve a good trade-off between decoding complexity and performance.

[0099] The flexible nested reliability sequence extraction method for RM codes provides a flexible nested reliability sequence, which can further improve the coding gain of very short codes (with short block lengths).

[0100] In the flexible nested reliability sequence extraction method for product codes, the flexible extraction method of nested reliability sequences can achieve a flexible trade-off between encoding and decoding parallelism and coding gain.

[0101] The background of the mother code length determination method provided in some embodiments of the present invention is described below.

[0102] In wireless communication, channel quality constantly changes due to fast and slow fading effects. Accordingly, channel coding design must always adapt to the channel state. Modulation and coding scheme (MCS) adaptation is an effective method to combat changes in channel state, allowing for real-time adjustments to the modulation order, code length, and code rate. Therefore, this requires the channel coding scheme to flexibly adjust the code length and code rate in a fine-grained manner, while achieving good error correction performance in all possible configurations. This fine-grained flexibility of channel codes is one of the most challenging problems faced by engineers in this field.

[0103] At the same time, the complexity of the encoding and decoding algorithms needs to be sufficiently low. At the hardware level, complexity can be assessed by measuring chip area and energy efficiency. While chip area and energy efficiency are related to algorithm complexity, they are more closely linked to hardware cost and battery life. Therefore, when designing encoding schemes, it is necessary to reduce implementation complexity.

[0104] Future communication systems (such as 6G systems) are designed to support several challenging scenarios, including immersive communication, massive data acquisition, and ultra-reliable low-latency communication. Key performance indicators (KPIs) related to channel coding include coding gain, reliability, throughput, latency, and their trade-offs. For example, 6G can achieve throughput targets of over 1 Tbps, while energy efficiency targets can be reduced to 1 pJ / bit. Simultaneously, coding schemes supporting flexible rate matching and IR-HARQ schemes also offer advantages. Therefore, designing a code set capable of meeting all these KPIs and capabilities is both an urgent and challenging goal.

[0105] refer to Figure 1 , Figure 1This is a non-limiting illustrative example, providing a simplified schematic diagram of a communication system. Communication system 100 includes a radio access network 120. Radio access network 120 can be a next-generation (such as sixth-generation, 6G, or higher) radio access network, or a traditional (such as 5G, 4G, 3G, or 2G) radio access network. 5G refers to the fifth generation, 4G to the fourth generation, 3G to the third generation, and 2G to the second generation. Traditional wireless technologies can also include second-generation (2G). One or more electronic devices (EDs) 110a, 110b, 110c, 110d, 110e, 110f, 110g, 110h, 110i, 110j (generally referred to as 110) can be interconnected with each other or connected to one or more network nodes (170a, 170b, generally referred to as 170) in radio access network 120. The core network 130 may be part of the communication system and may depend on or be independent of the wireless access technology used in the communication system 100. Furthermore, the communication system 100 includes a public switched telephone network (PSTN) 140, the Internet 150, and other networks 160.

[0106] Figure 2 An exemplary communication system 100 is illustrated. Generally, the communication system 100 enables multiple wireless or wired units to transmit data and other content. The purpose of the communication system 100 may be to provide content such as voice, data, video, and / or text via broadcast, multicast, unicast, etc. The communication system 100 can operate by sharing resources (such as carrier spectrum bandwidth) among its constituent units. The communication system 100 may include terrestrial communication systems and / or non-terrestrial communication systems. The communication system 100 can provide a wide variety of communication services and applications, such as earth monitoring, remote sensing, passive sensing and positioning, navigation and tracking, automated delivery, and mobility. The communication system 100 can provide high availability and robustness through the joint operation of terrestrial and non-terrestrial communication systems. For example, integrating a non-terrestrial communication system or its components into a terrestrial communication system can form a multi-layered heterogeneous network. Compared to traditional communication networks, heterogeneous networks can achieve better overall performance through efficient multi-link joint operation between terrestrial and non-terrestrial networks, more flexible function sharing, and faster physical layer link switching.

[0107] Terrestrial communication systems and non-terrestrial communication systems can be subsystems of a communication system. Figure 2In the example shown, communication system 100 includes electronic devices (EDs) 110a, 110b, 110c, and 110d (generally referred to as ED110), radio access networks (RANs) 120a and 120b, a non-terrestrial communication network 120c, a core network 130, a PSTN 140, the Internet 150, and other networks 160. RANs 120a and 120b include corresponding base stations (BSs) 170a and 170b, which are generally referred to as terrestrial transmit and receive points (T-TRPs) 170a and 170b. The non-terrestrial communication network 120c includes access nodes 172, which are generally referred to as non-terrestrial transmit and receive points (NT-TRPs) 172.

[0108] Alternatively or additionally, any ED 110 can be used to connect, access, or communicate with any T-TRP 170a, 170b, and NT-TRP 172, the Internet 150, the core network 130, the PSTN 140, other networks 160, or any combination thereof. In some examples, ED 110a can perform uplink and / or downlink transmissions with T-TRP 170a via terrestrial air interface 190a. In some examples, ED 110a, 110b, 110c, and 110d can also communicate directly with each other via one or more sidelink air interfaces 190b. In some examples, ED 110d can perform uplink and / or downlink transmissions with NT-TRP 172 via non-terrestrial air interface 190c.

[0109] Air interfaces 190a and 190b can employ similar communication technologies, such as any suitable wireless access technology. For example, communication system 100 can implement one or more channel access methods in air interfaces 190a and 190b, such as code division multiple access (CDMA), space division multiple access (SDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), or single-carrier FDMA (SC-FDMA) (also known as discrete Fourier transform spread OFDMA (DFT-s-OFDMA)). Air interfaces 190a and 190b can utilize other high-dimensional signal spaces, which may include combinations of orthogonal and / or non-orthogonal dimensions.

[0110] The non-terrestrial air interface 190c enables communication between the ED 110d and one or more NT-TRP 172s via a wireless link or simply via a link. In some examples, the link is a dedicated connection for unicast transmission, a connection for broadcast transmission, or a connection between a group of ED 110s and one or more NT-TRP 172s for multicast transmission.

[0111] RANs 120a and 120b communicate with core network 130 to provide various services, such as voice, data, and other services, to EDs 110a, 110b, and 110c. RANs 120a and 120b, and / or core network 130, can communicate directly or indirectly with one or more other RANs (not shown), which may or may not be directly served by core network 130, and may or may not use the same radio access technology as RANs 120a and / or RAN 120b. Core network 130 can also serve as a gateway access between (i) RANs 120a and 120b, and / or EDs 110a, 110b, and 110c, and (ii) other networks (such as PSTN 140, Internet 150, and other networks 160). Additionally, some or all of EDs in EDs 110a, 110b, and 110c may include functionality for communicating with different wireless networks via different radio links using different radio technologies and / or protocols. ED 110a, 110b, and 110c can communicate with a service provider or exchange (not shown) and the Internet 150 via a wired communication channel, rather than via wireless communication (or via wired communication in addition to wireless communication). PSTN 140 may include a circuit-switched telephone network for providing plain old telephone service (POTS). The Internet 150 may include a computer network and / or subnet (internal network) and include protocols such as Internet Protocol (IP), Transmission Control Protocol (TCP), and User Datagram Protocol (UDP). ED 110a, 110b, and 110c can be multimode devices capable of operating under various wireless access technologies and may include multiple transceivers required to support such technologies.

[0112] Figure 3Another example of an ED 110 and base stations 170a, 170b, and / or 170c is shown. The ED 110 is used to connect people, things, machines, etc. The ED 110 can be widely used in various scenarios, such as cellular communication, device-to-device (D2D), vehicle-to-everything (V2X), peer-to-peer (P2P), machine-to-machine (M2M), machine-type communications (MTC), Internet of Things (IoT), virtual reality (VR), augmented reality (AR), mixed reality (MR), metaverse, digital twin, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, smart cities, drones, robots, remote sensing, passive sensing, positioning, navigation and tracking, autonomous delivery and mobility, and more.

[0113] Each ED 110 represents any suitable end-user equipment for wireless operation and may include (or be referred to as) the following devices: user equipment / device (UE), wireless transmit / receive unit (WTRU), mobile station, fixed or mobile subscriber unit, cellular phone, station (STA), machine-type communication (MTC) device, personal digital assistant (PDA), smartphone, laptop, computer, tablet, wireless sensor, consumer electronics, smartbook, vehicle, automobile, truck, bus, train, or IoT device, wearable device (such as watch, glasses, head-mounted device, etc.), industrial equipment, or devices that include or incorporate the above-mentioned devices (such as communication modules, modems, or chips), etc. Next-generation ED 110 may be referred to using other terms. Base stations 170a and 170b are T-TRPs, referred to below as T-TRP 170. Similarly, Figure 3As shown, NT-TRP is referred to as NT-TRP 172 below. Each ED 110 connected to T-TRP 170 and / or NT-TRP 172 can be dynamically or semi-statically started (i.e., established, activated, or enabled), shut down (i.e., released, deactivated, or disabled), and / or configured in response to one or more of connectivity availability and connectivity necessity.

[0114] ED 110 includes a transmitter 201 and a receiver 203 coupled to one or more antennas 204. Only one antenna 204 is shown in the figure to avoid clutter. One, some, or all of the antennas 204 may also be panels. The transmitter 201 and receiver 203 may be integrated, for example, integrated as a transceiver. The transceiver is used to modulate data or other content for transmission through at least one antenna 204 or a network interface controller (NIC). The transceiver may also be used to demodulate data or other content received through at least one antenna 204. Each transceiver includes any suitable structure for generating signals for wireless or wired transmission and / or for processing signals received wirelessly or wiredly. Each antenna 204 includes any suitable structure for transmitting and / or receiving wireless or wired signals.

[0115] ED 110 includes at least one memory 208. Memory 208 stores instructions and data used, generated, or collected by ED 110. For example, memory 208 may store software instructions or modules for implementing some or all of the functions and / or embodiments described herein, and executed by one or more processing units (such as processor 210). Each memory 208 includes any suitable one or more volatile and / or non-volatile storage and retrieval devices. Any suitable type of memory can be used, such as random-access memory (RAM), read-only memory (ROM), hard disk, optical disk, subscriber identity module (SIM) card, memory stick, secure digital (SD) card, and processor cache, etc.

[0116] ED 110 may also include one or more input / output devices (not shown) or interfaces (such as those connected to...). Figure 1(Wired interface of Internet 150). Input / output devices or interfaces support interaction with users or other devices in the network. Each input / output device or interface includes any suitable structure for providing or receiving information from the user and / or for network interface communication. Suitable structures include speakers, microphones, keypads, keyboards, displays, touchscreens, etc.

[0117] ED 110 includes a processor 210 for performing the following operations: operations related to preparing to transmit uplink transmissions to NT-TRP 172 and / or T-TRP 170; operations related to processing downlink transmissions received from NT-TRP 172 and / or T-TRP 170; and operations related to processing lateral link transmissions transmitted to and from other ED 110s. The processing operations related to preparing to transmit uplink transmissions may include operations such as encoding, modulation, transmit beamforming, and generating symbols for transmission. The processing operations related to processing downlink transmissions may include operations such as receive beamforming, demodulation, and decoding of received symbols. According to a specific embodiment, the downlink transmissions may be received by receiver 203 via receive beamforming, and processor 210 may extract signaling from the downlink transmissions (e.g., by detecting and / or decoding signaling). An example of signaling may be a reference signal transmitted by NT-TRP 172 and / or T-TRP 170. In some embodiments, processor 210 performs transmit beamforming and / or receive beamforming based on beam direction indications (such as beam angle information (BAI)) received from T-TRP 170. In some embodiments, processor 210 may perform operations related to network access (such as initial access) and / or downlink synchronization, such as operations related to detecting synchronization sequences, decoding, and acquiring system information. In some embodiments, processor 210 may perform channel estimation, for example, using reference signals received from NT-TRP 172 and / or T-TRP 170.

[0118] Although not shown in the figures, processor 210 may be part of transmitter 201 and / or receiver 203. Although not shown in the figures, memory 208 may be part of processor 210.

[0119] The processing components in processor 210, transmitter 201, and receiver 203 can be implemented by the same or different processors, which execute instructions stored in memory (such as memory 208). Alternatively, some or all of the processing components in processor 210, transmitter 201, and receiver 203 can be implemented separately using hardware accelerators such as a programmable field-programmable gate array (FPGA), application-specific integrated circuit (ASIC), graphics processing unit (GPU), or artificial intelligence (AI) accelerator.

[0120] In some embodiments, ED 110 may be replaced by a device within ED 110 (e.g., a communication module, modem, chip, or chipset within ED 110). This device includes at least one processor and an interface or at least one pin. In this scenario, transmitter 201 and receiver 203 may be replaced by an interface or at least one pin, wherein the interface or at least one pin is used to connect the device (e.g., a chip) and other devices (e.g., a chip, memory, or bus). Therefore, sending information to T-TRP 170 or NT-TRP 172 can be referred to as sending information to an interface or at least one pin, and receiving information from T-TRP 170 or NT-TRP 172 can be referred to as receiving information from an interface or at least one pin. This information may include control signaling and / or data.

[0121] In some implementations, T-TRP 170 can be referred to by other names, such as base station, base transceiver station (BTS), wireless base station, network node, network device, network-side device, transmit / receive node, NodeB, evolved NodeB (eNodeB or eNB), home eNodeB, next-generation NodeB (gNB), transmission point (TP), site controller, access point (AP), wireless router, relay station, ground node, ground network device, ground base station, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), location node, etc. T-TRP 170 can be a macro BS, pico BS, relay node, or donor node, or a combination thereof. T-TRP 170 can refer to the aforementioned equipment or to a device within the aforementioned equipment.

[0122] In some embodiments, the various parts of T-TRP 170 may be distributed. For example, some modules in T-TRP 170 may be located remotely from the device housing the antenna 256 of T-TRP 170 and may be coupled to the device housing the antenna 256 via a communication link (not shown) sometimes referred to as a fronthaul (such as a common public radio interface (CPRI)). Therefore, in some embodiments, the term "T-TRP 170" may also refer to network-side modules that perform processing operations such as determining the location of ED 110, resource allocation (scheduling), message generation, and encoding / decoding, which are not necessarily part of the device housing the antenna 256 of T-TRP 170. These modules may also be coupled to other T-TRPs. In some embodiments, T-TRP 170 may actually be multiple T-TRPs that operate together to serve ED 110, for example, through cooperative multicast.

[0123] T-TRP 170 includes at least one transmitter 252 and at least one receiver 254 coupled to one or more antennas 256. Only one antenna 256 is shown in the figure to avoid clutter. One, some, or all of the antennas 256 may also be panels. The transmitter 252 and receiver 254 may be integrated as a transceiver. T-TRP 170 also includes a processor 260 for performing operations related to: preparing downlink transmissions to ED 110, processing uplink transmissions received from ED 110, preparing backlink transmissions to NT-TRP 172, and processing transmissions received from NT-TRP 172 via backlink. Processing operations related to preparing downlink or backlink transmissions may include operations such as encoding, modulation, precoding (e.g., multiple-input multiple-output (MIMO) precoding), transmit beamforming, and generating symbols for transmission. Processing operations related to processing received transmissions in the uplink or backlink may include operations such as receive beamforming, demodulating received symbols, and decoding received symbols. Processor 260 can also perform operations related to network access (such as initial access) and / or downlink synchronization, such as generating the contents of a synchronization signal block (SSB), generating system information, and so on. In some embodiments, processor 260 also generates beam direction indications, such as BAIs, that can be scheduled for transmission by scheduler 253. Processor 260 performs other network-side processing operations described herein, such as determining the location of ED 110, determining the location for deploying NT-TRP 172, and so on.

[0124] In some embodiments, processor 260 may generate signaling to configure one or more parameters of ED 110 and / or one or more parameters of NT-TRP 172, etc. Any signaling generated by processor 260 is transmitted by transmitter 252. It should be noted that the term "signaling" as used herein can also be referred to as control signaling. Signaling can be transmitted in physical layer control channels such as the physical downlink control channel (PDCCH), in which case the signaling can be called dynamic signaling. Signaling transmitted in the downlink physical layer control channel can be called downlink control information (DCI). Signaling transmitted in the uplink physical layer control channel can be called uplink control information (UCI). Signaling transmitted in the sidelink physical layer control channel can be called sidelink control information (SCI). Signaling can be included in higher-layer (e.g., above the physical layer) data packets transmitted over physical layer data channels such as the Physical Downlink Shared Channel (PDSCH). In this case, the signaling can be referred to as higher-layer signaling, static signaling, or semi-static signaling. Higher-layer signaling can also refer to radio resource control (RRC) protocol signaling or media access control-control element (MAC-CE) signaling.

[0125] Scheduler 253 may be coupled to processor 260. Scheduler 253 may be included within T-TRP 170 or may operate separately from T-TRP 170. Scheduler 253 may schedule uplink, downlink, lateral link, and / or backlink transmissions, including issuing scheduling grants and / or configuring schedule-free (e.g., “configuration grants”) resources. T-TRP 170 also includes memory 258 for storing information and data. Memory 258 stores instructions and data used, generated, or collected by T-TRP 170. For example, memory 258 may store software instructions or modules for implementing some or all of the functions and / or embodiments described herein and executed by processor 260.

[0126] Although not shown in the figures, processor 260 may be part of transmitter 252 and / or receiver 254. Furthermore, although not shown in the figures, processor 260 may implement scheduler 253. Although not shown in the figures, memory 258 may be part of processor 260.

[0127] The processing components in processor 260, scheduler 253, transmitter 252, and receiver 254 can be implemented by the same or different processors, which execute instructions stored in memory (such as memory 258). Alternatively, some or all of the processing components in processor 260, scheduler 253, transmitter 252, and receiver 254 can be implemented using dedicated circuitry such as a programmable FPGA, hardware accelerator (such as a GPU or AI accelerator), or ASIC.

[0128] In some embodiments, T-TRP 170 may be replaced by a device within the T-TRP (e.g., a communication module, modem, chip, or chipset within the T-TRP). This device includes at least one processor and an interface or at least one pin. In this scenario, transmitter 252 and receiver 254 may be replaced by an interface or at least one pin, wherein the interface or at least one pin is used to connect the device (e.g., a chip) and other devices (e.g., a chip, memory, or bus). Therefore, sending information to ED 110 may be referred to as sending information to an interface or at least one pin, and receiving information from ED 110 may be referred to as receiving information from an interface or at least one pin. This information may include control signaling and / or data.

[0129] Although the NT-TRP 172 is exemplified only as a drone, it can be implemented in any suitable non-terrestrial form, such as satellites and high-altitude platforms, including international mobile communication base stations and unmanned aerial vehicles. Furthermore, in some implementations, the NT-TRP 172 may be referred to by other names, such as a non-terrestrial node, a non-terrestrial network device, or a non-terrestrial base station. The NT-TRP 172 includes a transmitter 272 and a receiver 274 coupled to one or more antennas 280. Only one antenna 280 is shown in the figure to avoid clutter. One, some, or all of the antennas may also be panels. The transmitter 272 and receiver 274 may be integrated as a transceiver. The NT-TRP 172 also includes a processor 276 for performing operations related to: preparing downlink transmissions to ED 110, processing uplink transmissions received from ED 110, preparing return transmissions to T-TRP 170, and processing transmissions received from T-TRP 170 via return. Processing operations related to preparing downlink or backhaul transmissions may include operations such as encoding, modulation, precoding (e.g., MIMO precoding), transmit beamforming, and generating symbols for transmission. Processing operations related to processing receive transmissions in the uplink or backhaul may include operations such as receive beamforming, demodulating received symbols, and decoding received symbols. In some embodiments, processor 276 performs transmit beamforming and / or receive beamforming based on beam direction information (e.g., BAI) received from T-TRP 170. In some embodiments, processor 276 may generate signaling to configure one or more parameters of ED 110, etc. In some embodiments, NT-TRP 172 implements physical layer processing but does not implement higher-layer functions, such as those in the medium access control (MAC) layer or radio link control (RLC) layer. Since this is only an example, NT-TRP 172 typically implements higher-layer functions in addition to physical layer processing.

[0130] The NT-TRP 172 also includes a memory 278 for storing information and data. Although not shown in the figures, a processor 276 may be part of the transmitter 272 and / or the receiver 274. Although not shown in the figures, the memory 278 may be part of the processor 276.

[0131] The processing components in processor 276, transmitter 272, and receiver 274 can be implemented by the same or different processors, which execute instructions stored in memory (such as memory 278). Alternatively, some or all of the processing components in processor 276, transmitter 272, and receiver 274 can be implemented using dedicated circuitry such as a programmable FPGA, hardware accelerator (such as a GPU or AI accelerator), or ASIC. In some embodiments, NT-TRP 172 can actually be multiple NT-TRPs operating together to serve ED110, for example, through cooperative multicast.

[0132] T-TRP 170, NT-TRP 172 and / or ED 110 may include other components, but for clarity these components are omitted.

[0133] One or more steps of the exemplary methods provided in this document can be derived from... Figure 4 The corresponding unit or module provided will be executed. Figure 4 The diagram illustrates units or modules within a device (such as ED 110, T-TRP 170, or NT-TRP 172). For example, signals may be transmitted or output by a transmitting unit or transmitting module. Signals may be received or input by a receiving unit or receiving module. Signals may be processed by a processing unit or processing module. Other steps may be performed by an AI module or a machine learning (ML) module. The corresponding units or modules may be implemented using hardware, one or more components or devices executing software, or a combination thereof. For example, one or more of these units or modules may be circuits, such as integrated circuits. Examples of integrated circuits include programmable FPGAs, GPUs, or ASICs.

[0134] For example, one or more of these units or modules may exist in a logical form, such as a circuit, a portion of an integrated circuit, or a logical function executed by software instructions executed by a processor. It should be understood that if these modules are implemented using software executed by a processor, etc., then these modules may be retrieved by the processor, wholly or partially, individually or collectively, for processing, or in one or more instances, and these modules themselves may include instructions for further deployment and instantiation.

[0135] Although not shown in the diagram, the transmitting module and receiving module can be part of or combined into a transceiver module. The transceiver module can also be called an interface module or simply an interface, used for input and output operations.

[0136] Further details regarding ED 110, T-TRP 170, and NT-TRP 172 are known to those skilled in the art. Therefore, these details are omitted herein.

[0137] In a communication system, the channel coding module encodes K source bits into N coded bits to provide error correction capabilities against harsh channel conditions such as noise and interference. The code rate is R = K / N. In practical applications, the code rate R is selected based on the channel quality.

[0138] Polar codes are capacity-capable codes, representing a significant breakthrough in coding theory. As the code length approaches infinity, the synthesized channel tends towards a noise-free or purely noisy state. The synthesized channel (also called a subchannel) is constructed from or associated with polar codes. Noise-free subchannels are used to transmit information, and their proportion has been shown to reach the channel capacity defined by Shannon. This channel polarization phenomenon occurs in successive cancellation (SC) decoding or SC-based decoding, which has relatively low complexity.

[0139] Rate matching is performed after channel coding, achieved by puncturing / shortening or repeating some coded bits. The purpose of this operation is to obtain a sequence of coded bits of the desired length for transmission over limited channel resources.

[0140] Channel interleaving occurs after channel coding and rate matching, and is achieved by permuting the coded bits. Its purpose is to provide stable or better performance in higher-order modulation or fading channels.

[0141] HARQ is a mechanism for achieving reliable wireless transmission. It combines forward error correction (FEC) and automatic repeat request (ARQ). In HARQ, the initial transmission is an FEC codeword, which includes methods to support error detection at the receiver (such as cyclic redundancy check (CRC) bits). If a decoding error is detected, the receiver sends a negative acknowledgment (NACK) signal to the transmitter, informing them of the error and requesting a retransmission. The retransmission bits can be selected directly from the initial transmission bits, or they can be incrementally generated coded bits, which together with the initial transmission bits form a longer codeword. The former is called Chase-combining HARQ (CC-HARQ), and the latter is called IR-HARQ. Generally, IR-HARQ outperforms CC-HARQ due to the additional coding gain from incremental redundancy.

[0142] Polar codes belong to linear block codes. For a polar code with length N, its generating matrix is , and its encoding process is , where is a binary information vector, is a binary code vector. The binary matrix , where is a polarization kernel matrix, , represents the Kronecker product.

[0143] Generally, K information bits need to be encoded into N coded bits. In some embodiments of the present invention, the K information bits refer to K source bits. Correspondingly, the inequality K < N is given to obtain a code rate R = K / N < 1. This means that only of them are used to carry information bits, and the remaining bits are usually called frozen bits. The information bit set or information set can be denoted as I, and the frozen bit set or frozen set can be denoted as F respectively. In some cases, there is also an additional parity check bit set or PC bit set, denoted as P. The frozen bits are known before decoding (usually all zero, but may also be other known values or sequences), so they do not carry any payload information. The PC bits are parity check bits generated according to a subset of the information bits. Therefore, once the relevant information bits are decoded, the PC bits become known. The decoding objective of the polar code is to recover all the information bits.

[0144] The transmitted code length M is not necessarily always a power of 2, that is, M < N. In practical applications, the transmitted coded bits are reduced from N to M by puncturing and shortening. For convenience, in the following of the present invention, N is called the mother code length and M is called the code length. Specifically, the punctured bits are the untransmitted bits unknown to the decoder, and the shortened bits are the untransmitted bits known to the decoder, and the shortened bits are usually all zero.

[0145] Figure 5 shows an example of a polar code with N = 8 and K = 4. Figure 5 Each "butterfly" in represents one polarization, that is . In this example, the information set is .

[0146] Successive cancellation (SC) is the basic decoding algorithm for polar codes, where all the frozen bits and information bits are decoded in order (i.e., bit by bit). Usually, the bits in front are always decoded first.

[0147] The successive cancellation list (SCL) is an enhanced decoding algorithm for polar codes that performs multiple (L) SCL decoding instances. Each instance is called a "decoding path". During the decoding of each binary bit, the "0" and "1" branches are expanded on each path, generating 2L paths. Then, all 2L paths are compared, and the L most likely paths are retained, while the L least likely paths are discarded or pruned. These path expansion and pruning operations are performed during the decoding of each information bit until all information bits are decoded. Finally, the most likely path is selected as the decoded output.

[0148] The CRC-aided successive cancellation list (CA-SCL) works in a similar way to SCL, except that the final step selects the most likely path that passes the CRC check as the decoding output.

[0149] The parity-check successive cancellation list (PC-SCL) works in much the same way as the SCL, except that when decoding parity-check (PC) bits, the parity check value of the preceding related bit is used as the bit decision result. Besides frozen bits and information bits, PC bits can also be considered a type of bit.

[0150] Rate-compatible polar coding is an ideal technique for wireless applications. In one example of rate-matching polar codes, a balance between performance and complexity is achieved by combining puncturing, shortening, and repetition, using a fixed reliability sequence. Specifically, both puncturing and shortening employ sub-block-level interleaving and cross-linking. The puncturing and shortening patterns exhibit symmetry.

[0151] Let the length of the master code be N and the length of the transmission code be M. The specific rate matching scheme adopted is as follows: when M>N, repetition is used; when K / M≤7 / 16, puncturing is used; when K / M>7 / 16, shortening is used.

[0152] Before punching and shortening, sub-block level interleaving must be performed first. The interleaver divides the master code of length N into 32 sub-blocks of size N / 32 and interleaves these sub-blocks. Figure 6 An exemplary interleaver scheme is shown, which is taken from the 3GPP standard specification.

[0153] Since puncturing starts from the first coded bit of the codeword and shortening starts from the last coded bit, the rate matching module can be efficiently implemented by a cyclic buffer. A codeword can also refer to a coded bit or an encoded bit. All mother code bits are put into the cyclic buffer. Puncturing is achieved by selecting bits in a clockwise order, and shortening is achieved by selecting bits in a counterclockwise order.

[0154] Figure 7 Fig. is a schematic diagram of puncturing and shortening using a cyclic buffer. At Figure 7 602 in, the coded bits of the codeword are shown in a vertical column, and the punctured bits and the shortened bits are also shown. At 604, Figure 7 a cyclic buffer represented by a circle is shown, as well as the way of reading the coded bits without puncturing or shortening. The following two circles respectively show the cyclic buffers represented by dotted lines, indicating that puncturing starts from the starting position of the buffer at 606, and shortening starts from the end position of the buffer at 608.

[0155] Another example of polar code rate matching adopts the incremental freeze HARQ method, which supports the transmission of multiple short codewords. As the number of short codes transmitted increases, the total code length increases correspondingly, and the total code rate decreases accordingly.

[0156] In the first transmission, an (M1, K) polar code is constructed, encoded and transmitted. M1 is the code length of the first transmission, and K is the number of information bits of the first transmission. The first code rate is R1 = K / M1. Usually, the code rate is determined such that R1 < C1, where C1 is the channel capacity of the first transmission. However, when channel fading occurs or channel estimation is inaccurate, there may be an inequality R1 > C1, resulting in decoding failure and requiring a second transmission.

[0157] In the second transmission, K2 of the most unreliable information bits are selected from the K information bits of the first transmission. In practical applications, K2 is selected according to the estimated channel capacity of the second transmission. Then an (M2, K2) polar code is constructed, encoded and transmitted. M2 is the code length of the second transmission, and K2 is the number of information bits of the second transmission. However, if R2 > C2, decoding will fail again and a third transmission is required. The construction of the third transmission and the fourth transmission follows the same pattern.

[0158] At the receiving end, the decoder should always decode the last received codeword, as it has the lowest code rate and therefore the highest probability of successful decoding. After the last transmission is correctly decoded, the corresponding information bits from all previous transmissions become known and can be used as frozen bits for decoding. This process is repeated as more codewords are decoded until all K information bits from the first transmission have been decoded. The term "incremental freezing" refers to the operation of freezing additional information bits from previous transmissions once subsequent codewords are decoded. Figure 8 An example of an encoding process involving four transmissions is shown, where M1=M2=M3=M4=16, K1=12, K2=6, K3=4, and K4=3. M3 is the code length of the third transmission, M4 is the code length of the fourth transmission, K3 is the number of information bits in the third transmission, and K4 is the number of information bits in the fourth transmission.

[0159] Parity-check (PC) polar codes can be used to increase the minimum code distance of the original polar code. The value of the PC bit is determined by its preceding information bits, specifically by a binary linear combination of a subset of the preceding information bits. In a PC polar code scheme supporting IR-HARQ, the PC bit is used to combine multiple retransmissions into a longer polar code, thereby gaining additional coding gain.

[0160] The PC function currently used for IR-HARQ is also a special case, where some information bits are copied from the initially transmitted code block to the retransmitted code block. The one-to-one parity check between these two shorter code blocks effectively combines them into a longer code block.

[0161] For example, the initial transmission is a (M1=8, K=5) polar code, where {u0, u1, u2, u3, u4} is the information set, and {u5, u6, u7} is the freeze set. The encoding process is as follows: Figure 9 As shown. In this example, the bit indices are arranged from highest to lowest reliability.

[0162] In the first retransmission, four additional coded bits are sent. These four bits are coupled with the eight bits from the initial transmission to form a (M2=12, K=5) polar code. This coupling is achieved by copying the value of u4 to u8 during encoding, thus generating the PC function u4+u8=0, or equivalently represented as the PC function u8=u4. As mentioned above, the largest index in this PC function corresponds to the PC bit (u8 in this case). During decoding, u4 is decoded as an information bit, while u8 is decoded as a PC bit according to u8=u4. The information set is {u0, u1, u2, u3, u8}, the PC set is {u4}, and the information set is {u5, u6, u7, u9, u8}. 10 , u11} represents the frozen set, and the encoding process is as follows: Figure 10 As shown.

[0163] In the second retransmission, the remaining 4 bits c are sent. 12 c 13 c 14 c 15 This forms a (M3=16, K=5) polar code. However, it does not generate new PC bits.

[0164] From the perspective of the polarization transformation matrix, the three transmissions with actual code lengths M1=8, M2=12, and M3=16 are as follows: Figure 11 As shown.

[0165] To facilitate hardware-friendly implementation of polarization encoders and decoders, nested reliability sequences define the reliability comparison relationship between any pair of polarization subchannels. This standardized or defined method for determining subchannel reliability is extremely convenient, unlike other methods that require online or real-time calculation of the reliability or error probability of all polarization subchannels.

[0166] An example of a nested sequence of length 1024 includes all 1024 sub-channel indices (or bit indices) and associated reliability definitions, which can be used to determine the relative reliability of all polar codes with a parent code length no greater than 1024. For polar codes with a parent code length of 1024, the bit indices within the long sequence are ordered from lowest to highest reliability. For shorter polar codes, the reliability order of the bit indices within the long sequence remains unchanged; therefore, shorter reliability sequences can be extracted from a sequence of length 1024 simply by selecting bit indices with values ​​smaller than their parent code length.

[0167] In a specific example, the polarization sequence The lookup table provides the information, where... Indicates the bit index before polarization coding. , and . Maximum mother code length. Polarization sequence. Arranged from lowest to highest reliability, it can be represented as follows: ,in, Represents bit index Reliability.

[0168] For the encoding Any code block of bits uses the same polarization sequence. N is a positive integer less than Nmax. This polarization sequence It is a polarization sequence A subset of, all its elements The values ​​are all less than And arranged in order of reliability from low to high, represented as .

[0169] In some embodiments, the lookup table can store any type of reliability ranking sequence, such as a 1024-bit reliability sequence in 5G NR, or a reliability sequence derived based on polarization weights. The reliability ranking sequences in the lookup table can be arranged from low to high reliability, or from high to low reliability. In some embodiments of the present invention, the type, number, and order of the reliability ranking sequences are not specifically limited.

[0170] The following is a simple example of extracting a sequence of length 8 from a sequence of length 16:

[0171] If the sequence of length 16 is [0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12, 7, 11, 13, 14, 15], then the sequence of length 8 is a subsequence of the above sequence of length 16, and all its elements have values ​​less than 8. The sequence of length 8 can be [0, 1, 2, 4, 3, 5, 6, 7].

[0172] However, the above-mentioned example of a polar code nested sequence extraction scheme has some drawbacks.

[0173] The first drawback is that the nested sequence extraction method described above follows fixed rules and cannot be flexibly configured to improve performance in different scenarios. Therefore, adaptive sequence extraction schemes for polar codes may have advantages. Specifically, adaptive schemes based on multiple parameters such as code rate, code length, business type, or application scenario may help extract the optimal subsequence from longer sequences.

[0174] The second drawback is that the nested sequence extraction method described above cannot generate multiple different subsequences of the same length, making it unsuitable for supporting new features such as multiple redundant versions of code construction and IR-HARQ. Therefore, a multi-sequence extraction scheme for polar codes may be advantageous. Specifically, generating multiple sequences for multiple transmission opportunities can include methods for generating multiple sequences from a single longer sequence. This method can include assigning each of the multiple sequences to different transmissions (e.g., redundant versions) in an appropriate order.

[0175] The third drawback is that the aforementioned nested sequence extension method can only construct polar codes based on a single sequence. A method is needed to construct a family of polar codes using multiple sequences. Furthermore, a method is needed to construct different polar codes for various scenarios or multiple segments of a longer polar code, and to use these multiple sequences to construct the polar codes. To support scenarios requiring at least one retransmission or multiple redundant versions of the code sent in a single transmission, corresponding polar codes need to be designed for different scenarios with different transmission opportunities or different redundancy versions. Therefore, multiple reliability ordering sequences need to be determined before the code construction and encoding process. Then, after obtaining multiple polar codes based on these reliability ordering sequences, the communication system using these multiple polar codes can be applied to scenarios requiring multiple transmissions or using redundant versions of the polar codes.

[0176] As described above, in scenarios requiring multiple transmissions or the use of redundant versions of the code, it is reasonable to perform encoding and decoding processes on multiple polar codes.

[0177] Figure 13 This is a non-restrictive illustrative example that provides a simplified flowchart of the coding method.

[0178] exist Figure 12 The encoding method includes steps s1210 and s1220. The entity executing the encoding method can be a device or a means within a device, which may include a polar code encoder. In some embodiments, the means may be a communication module, modem, or chip within the device.

[0179] S1210, determine multiple reliability ranking sequences.

[0180] In some embodiments of the present invention, the following scenarios are considered during the encoding process: at least one retransmission is required, or multiple redundant versions of the code are needed, or multiple redundant versions of the code are sent in a single transmission. Therefore, multiple reliability ordering sequences need to be determined to help the communication system support the above scenarios.

[0181] In some embodiments, different code constructions and polar coding can be performed based on each of a plurality of reliability ordering sequences. Different transmission opportunities or different redundancy versions correspond to each of the plurality of reliability ordering sequences. Therefore, determining a plurality of reliability ordering sequences enables the communication system to support scenarios requiring multiple transmissions and redundancy versions.

[0182] The implementation steps of the method for obtaining multiple reliability ranking sequences will be described in detail in the following embodiments.

[0183] S1220: Encode multiple information bits based on multiple reliability sorting sequences to obtain multiple codewords, wherein the multiple codewords correspond to multiple reliability sorting sequences.

[0184] In some embodiments, multiple sets of information bits can be obtained based on multiple reliability sorting sequences. During the encoding process, the multiple sets of information bits can be encoded into multiple new sequences, which correspond to multiple codewords.

[0185] refer to Figure 13 , Figure 13 This is a non-restrictive illustrative example that provides a simplified flowchart of the decoding method. For example... Figure 13 As shown, the decoding method includes the following steps s1310 and s1320. The entity executing the decoding method can be a device or a device within a device, which may include a polar code decoder. In some embodiments, the device may be a communication module, modem, or chip within the device.

[0186] S1310, acquire multiple codewords, where the multiple codewords correspond to multiple reliability sorting sequences.

[0187] In some embodiments, before decoding, multiple codewords can be converted into multiple corresponding sequences by demodulation or other methods. In some embodiments of the present invention, the method of obtaining multiple corresponding sequences is not specifically limited.

[0188] In some embodiments, the number of multiple reliability sorting sequences is related to the number of redundant versions, the number of transmissions, and other coefficients corresponding to the scenario supported by the communication system. The number of multiple codewords is related to the number of multiple reliability sorting sequences. In some embodiments, a flexible decoding process can be performed based on multiple reliability sorting sequences, enabling the communication system to support scenarios requiring multiple transmissions or multiple redundant versions of codes.

[0189] S1320 decodes multiple codewords to obtain multiple sequences, where the multiple sequences correspond to multiple information bits.

[0190] In some embodiments, the SCL algorithm may be used during the decoding process. Then, after CRC processing, the device can output multiple sequences comprising multiple information bits. In some embodiments, other algorithms and techniques may be used during the decoding process. In some embodiments of the present invention, the algorithms and techniques used in the decoding process are not specifically limited.

[0191] The following are some examples of flexible nested reliability sequence extraction methods.

[0192] In some embodiments, the flexible nested reliability sequence extraction method may include one or more of the following operations:

[0193] In one aspect, a second (shorter) sequence Q2 of length N2 can be extracted from a first (longer) sequence Q1 of length N1 by selecting a subset of elements (or bit indices) within the first (longer) sequence that satisfy certain conditions, and then using a function to change the values ​​of the elements (bit indices) within that subset sequence. In some embodiments, the step of using a function to change the values ​​of the elements (bit indices) within the subset sequence can be omitted, indicating that the subset sequence can be the second (shorter) sequence.

[0194] In another aspect, a sequence of length {N} can be extracted from a first (longer) sequence Q1 of length N1 in the following way. 2,0 , N 2,1 , N 2,2 , N 2,3 ...} multiple second (shorter) sequences {Q 2,0 Q 2,1 Q 2,2 Q 2,3 …}: Select a subset of elements (or bit indices) within the first (longer) sequence that satisfy certain conditions, and then use multiple functions to change the values ​​of the elements (bit indices) within that subset of the sequence. Where N… 2,0 For the second (shorter) sequence Q 2,0 The length of N 2,1 For the second (shorter) sequence Q 2,1 The length of N 2,2 For the second (shorter) sequence Q 2,2 The length of N 2,3 For the second (shorter) sequence Q 2,3 The length of the subset sequence is determined by the number of sequences, and so on. In some embodiments, the subset sequence may be one of a plurality of second (shorter) sequences.

[0195] Then, the execution code is constructed based on multiple different second (shorter) sequences {Q}. 2,0 Q 2,1 Q 2,2 Q 2,3 …} (i.e., length {N} 2,0 , N 2,1 , N 2,2 , N 2,3 ...} multiple second (shorter) sequences {Q 2,0 Q 2,1 Q 2,2 Q 2,3 Each sequence in the ...}) generates an information bit set, a frozen bit set, a parity bit set, etc. Finally, polar coding is performed based on the above parameters.

[0196] Therefore, by flexibly nesting reliability sequence extraction methods, multiple sequences can be obtained more flexibly for different transmission times (e.g., IR-HARQ initial transmission and retransmission or different redundant versions).

[0197] refer to Figure 14 , Figure 14 This is a non-restrictive illustrative example that provides a block diagram of the process of constructing and encoding different polar codes using the methods described above.

[0198] like Figure 14 As shown, multiple second (shorter) sequences {Q} can be extracted from the first (longer) sequence Q1. 2,0 Q 2,1 Q 2,2 Polar coding can be performed at different code rates based on each of multiple second (shorter) sequences. For example, K 2,0 For the second (shorter) sequence Q 2,0 The corresponding number of information bits, K 2,1 For the second (shorter) sequence Q 2,1 The corresponding number of information bits, K 2,2 For the second (shorter) sequence Q 2,2 The corresponding number of information bits. Then, a rate matching process can be performed after polar coding. In some embodiments, different second (shorter) sequences can be used for different transmission timings or different application scenarios. These transmission timings or application scenarios can include scenarios requiring retransmission, especially scenarios that generate multiple redundant versions of the code accordingly, or scenarios requiring multiple simultaneous transmissions. Figure 14 In the middle, the second (shorter) sequence Q 2,0 This can be applied to scenario 1 or transmission 1, the second (shorter) sequence Q. 2,1 This can be applied to scenario 2 or transmission 2, the second (shorter) sequence Q. 2,2 This can be applied to scenario 3 or transmission 3. For example, scenario 1 can be a scenario requiring retransmission, such as one retransmission, and transmission 1 can include an initial transmission and a retransmission. Scenario 2 can be a scenario requiring multiple simultaneous transmissions, such as three simultaneous transmissions, and transmission 2 can include three simultaneous transmissions. Scenario 3 can be a scenario requiring multiple redundant versions of the code, such as two redundant versions of the code, and transmission 3 can include three versions of the code. In some embodiments, the scenarios or transmission timings corresponding to different second (shorter) sequences can be the same or different. In some embodiments of the present invention, the number of multiple second (shorter) sequences, the scenario type, and the number of transmissions corresponding to each of the multiple second (shorter) sequences are not specifically limited. The following are some embodiments of the sequence extraction and modification method involved in the present invention. Figure 12As described in s1210, in these methods, multiple reliability sorting sequences (or multiple second (shorter) sequences) can be obtained based on a first (longer) sequence.

[0199] In some embodiments, a second (shorter) sequence Q2 of length N2 can be extracted from a first (longer) sequence Q1 of length N1 by selecting a subset of elements (or bit indices) within the first (longer) sequence that satisfy certain conditions, and then using a value transformation function to change the value of the elements (bit indices) within the subset of the first (longer) sequence.

[0200] The first (longer) sequence is a reliability sorting sequence used to construct the first (longer) polar code, and the second (shorter) sequence is a reliability sorting sequence used to construct the second (shorter) polar code.

[0201] Certain conditions can be satisfied when selecting a subset of elements (bit indices) from a first (longer) sequence based on multiple inequalities.

[0202] For example, the condition can be ,in, and Let c1 and c2 be two inequalities, and c1 and c2 be two integers. A subset of the first (longer) sequence, For subset The i-th element in It is also an element within the first (longer) sequence Q1.

[0203] In some cases, c1 and c2 are two integers, and the values ​​of c1 and c2 can be variables that depend on N1 and / or N2.

[0204] For example, the condition can be .

[0205] For example, the condition can be .

[0206] For example, the condition can be .

[0207] In some embodiments of the present invention, the values ​​of c1 and c2 are not specifically limited.

[0208] Certain conditions can be satisfied when selecting a subset of elements (bit indices) from a first (longer) sequence based on multiple equations.

[0209] For example, the condition can be In this equation, mod(x, y) is the modulo operation, and m1 and r1 are two integers. Two or more equations can exist.

[0210] In some cases, m1 and r1 are two integers, and the values ​​of m1 and r1 are variables that depend on N1 and / or N2.

[0211] In some cases, m1 and r1 are two integers, where m1 is a power of 2 and r1 is 0 or a power of 2 minus 1.

[0212] In some cases, m1 and r1 are two integers, and the values ​​of m1 and r1 are two constant integers. For example, and This indicates that only even indexes are retrieved. Similarly, when When this condition is met, it means only odd indices are retrieved. More specifically, this condition can be: or .

[0213] For example, the condition can be or .

[0214] Certain conditions can be satisfied when selecting a subset of elements (bit indices) from the first (longer) sequence based on equality and inequality.

[0215] For example, the condition can be , where m1 and r1 are two integers.

[0216] For example, the condition can be .

[0217] After extraction, subset Relative sorting and The relative ordering remains consistent. That is, the second (shorter) sequence... The elements within are arranged from lowest to highest reliability, denoted as: ,in, Represents bit index Reliability or elements Reliability.

[0218] Value transformation functions used to change the value of an element (bit index) can be arithmetic operations.

[0219] For example, the arithmetic operation can be any one or any combination of + (addition), – (subtraction), × (multiplication), / (division), and % (modulo).

[0220] The value transformation function can be: subtracting an integer from each element (bit index) in the extracted sequence. Where o is an integer offset value, For elements within the second (shorter) sequence, It is the j-th element in a subset of the first (longer) sequence, where j is an integer.

[0221] In some embodiments, the value of o can be a variable that depends on N1 and / or N2.

[0222] The value transformation function could be: dividing each element (bit index) in the extracted sequence by an integer: , where d is the integer divisor.

[0223] In some embodiments, the value of d is a variable that depends on N1 and / or N2; it can also be a power of 2 constant (such as 2, 4, 8, 16, 32) or a power of 2 variable that depends on N1 and / or N2.

[0224] For example, the value transformation function can be .

[0225] For example, the value transformation function can be .

[0226] In the above example, the value of (N1, N2) can be (32768, 16384), (16384, 8192), (8192, 4096), (4096, 2048), (2048, 1024), (1024, 512), (512, 256), (256, 128), (128, 64), or (64, 32); the value of (N1, N2) can also be (32768, 8192), (16384, 4096), (8192, 2048), (4096, 1024), (2048, 512), (1024, 256), (512, 128), (256, 64), (128, 32), or (64, 32).

[0227] In some embodiments, the second (shorter) sequence may be a subset extracted from the first (longer) sequence. For example, in some cases, value transformation functions and the "change value" step may not be necessary.

[0228] Based on the above, the parameters used for sequence extraction and modification can be obtained in the following ways:

[0229] Fixed and predefined in standard text;

[0230] It can flexibly select from a set of parameters predefined in the standard text;

[0231] Flexible and can be specified in the RRC or DCI field.

[0232] Some embodiments of the above method can be represented as follows:

[0233] polarization sequence The lookup table provides the information, where... This represents the bit index before polar coding. and Polarization sequence Arranged from lowest to highest reliability ,in, Represents bit index Reliability.

[0234] Using the second polarization sequence The polarization sequence It is a polarization sequence A subset of, all its elements The values ​​are all greater than and less than And ranked from lowest to highest reliability. .

[0235] The following is a simpler example of extracting a sequence of length 8 from a sequence of length 16:

[0236] If a sequence of length 16 is [0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12, 7, 11, 13, 14, 15],

[0237] The sequence of length 8 is a subsequence of the sequence of length 16 above, and all its elements have values ​​greater than 7, becoming [8, 9, 10, 12, 11, 13, 14, 15].

[0238] Alternatively, the example of the value transformation function “y=x–8” can be used to obtain the second (shorter) sequence [0, 1, 2, 4, 3, 5, 6, 7].

[0239] The following are some embodiments of the multi-sequence extraction method involved in this invention.

[0240] In some embodiments, a sequence of length {N1} can be extracted from a first (longer) sequence Q1 of length N1 in the following manner. 2,0 , N 2,1 , N 2,2 , N 2,3 ...} multiple second (shorter) sequences {Q 2,0 Q 2,1 Q 2,2 Q 2,3 …}: Select a subset of elements (bit indices) that meet certain conditions within the first (longer) sequence, and then use a value transformation function to change the values ​​of the elements (bit indices) within the subset of the first (longer) sequence.

[0241] The first (longer) sequence is a reliability sorting sequence used to construct the first (longer) polar code, and the multiple shorter sequences are reliability sorting sequences used to construct several shorter polar codes.

[0242] The number of shorter sequences can be 2, 3, 4, 8, or 16. In some embodiments of the present invention, the number of shorter sequences is not specifically limited.

[0243] The method for obtaining each of multiple shorter sequences can be the same as the method introduced in sequence extraction and modification, but with different parameters.

[0244] For example, for the first shorter sequence among multiple shorter sequences, the extraction criteria can be: For the second shorter sequence among multiple shorter sequences, the extraction criteria can be: For the third shorter sequence among multiple shorter sequences, the extraction criteria can be: For the fourth shorter sequence among multiple shorter sequences, the extraction criteria can be: And so on. A subset of the sequence set described above can also be used.

[0245] In some embodiments, if two shorter sequences exist, then N1 and { , The value of} can satisfy For the first shorter sequence, the extraction criteria are as follows: For the second shorter sequence, the extraction condition is as follows: , where N 2,0 N is the length of the first shorter sequence. 2,2 The length of the second shorter sequence.

[0246] In some embodiments, if two shorter sequences exist, then N1 and { , The value of} can satisfy For the first shorter sequence, the extraction criteria are as follows: For the second shorter sequence, the extraction condition is as follows: , where N 2,0 N is the length of the first shorter sequence. 2,1 The length of the second shorter sequence.

[0247] In the example above, the extracted sequence Q 2,0 Q 2,1 It can be used to construct polar codes to support IR-HARQ. Specifically, the extracted sequence The polar code used to construct the initial transmission, including a bit index (based on codeword size) for the initial transmission; the extracted sequence The polar code is used to construct the retransmission and includes a bit index (based on codeword size) for retransmission.

[0248] In some embodiments, if four shorter sequences exist, then N1 and { , The value of} can satisfy For the first shorter sequence, the extraction criteria are as follows: For the second shorter sequence, the extraction condition is as follows: For the third, shorter sequence, the extraction criteria are as follows: For the fourth shorter sequence, the extraction criteria are as follows: , where N 2,0 N is the length of the first shorter sequence. 2,1 N is the length of the second shorter sequence. 2,2 N is the length of the third shorter sequence. 2,3 The length of the fourth shorter sequence.

[0249] In the example above, the extracted sequence Q 2,0 Q 2,1 Q 2,2 Q 2,3 Used to construct polar codes, which serve as four redundant versions in IR-HARQ. Specifically, the extracted sequence The polar code used to construct the first redundant version (rvid=0), including a bit index (based on codeword size) for the first redundant version; the extracted sequence The polar code used to construct the second redundant version (rvid=1), including the bit index (based on codeword size) for the second redundant version; the extracted sequence The polar code used to construct the third redundancy version (rvid=2), including the bit index (based on codeword size) for the third redundancy version; the extracted sequence The polar code used to construct the fourth redundancy version (rvid=3) includes a bit index (based on codeword size) for the fourth redundancy version.

[0250] The method for changing the values ​​within each short reliability sorting sequence can be the same as that introduced in the sequence extraction and modification method, but with different parameters.

[0251] In some embodiments, the short sequence may be a subset extracted from a first (longer) sequence. For example, in some cases, value transformation functions and the "change value" step may not be necessary.

[0252] Based on the above method, the generated short sequences can be used in different scenarios:

[0253] In some cases, a subset of one or more sequences can be used for ultra-high-speed or high-throughput communication;

[0254] In some cases, a subset of one or more sequences can be used for ultra-reliable low-latency communication;

[0255] In some cases, a subset of one or more sequences can be used for extremely low-power or passive or environmental communication;

[0256] In some cases, a subset of one or more sequences may be used for uplink shared information (data) or control information communication, while another subset of one or more sequences may be used for downlink shared information (data) or control information communication.

[0257] An example of the above multiple sequence extraction method can be represented as:

[0258] polarization sequence The table provides information on when... and hour, Indicates the bit index before polarization coding. Polarization sequence. Arranged from lowest to highest reliability ,in, Represents bit index Reliability.

[0259] For encoding as the initial transmission Each bit and extended for retransmission An arbitrary code block of bits is given below, and three polarization sequences are defined.

[0260] Using the first polarization sequence The polarization sequence It is a polarization sequence A subset of, all its elements The values ​​are all less than And ranked from lowest to highest reliability. .

[0261] Using the second polarization sequence The polarization sequence It is a polarization sequence A subset of, all its elements The values ​​are all less than And ranked from lowest to highest reliability. .

[0262] Using the third polarization sequence The polarization sequence It is a polarization sequence A subset of, all its elements The values ​​are all greater than and less than And ranked from lowest to highest reliability. .

[0263] Of the three polarization sequences mentioned above, the third polarization sequence is used to construct a polarization code that includes the coded bits of the initial transmission, while the second and first polarization codes are both used to construct an extended polarization code that includes the coded bits of the initial transmission and retransmission.

[0264] The following are some embodiments of the code construction and encoding methods based on multiple shorter sequences in this invention.

[0265] Based on multiple second (shorter) sequences {Q 2,0 Q 2,1 Q 2,2 Q 2,3 For each sequence in …}, code construction is performed to select the information bit set, frozen bit set, parity bit set, etc. Finally, polar coding is performed based on the above parameters.

[0266] The first (longer) sequence is a reliability sorting sequence used to construct the first (longer) polar code; multiple (shorter) sequences are reliability sorting sequences used to construct several (shorter) polar codes; multiple (longer) sequences are reliability sorting sequences used to construct several (longer) polar codes.

[0267] The number of multiple shorter sequences can be 2, 3, 4, 8, or 16.

[0268] Extracting multiple shorter sequences can employ the same method introduced in the above examples, but with different parameters.

[0269] The method for selecting the information bit set, frozen bit set, and parity check bit set based on multiple second (shorter) sequences can be described as follows.

[0270] Based on the first longer sequence or a specific rate allocation rule, determine the number of information bits to be selected from multiple second (shorter) sequences. For example, for {Q 2,0 Q 2,1 Q 2,2 Q 2,3 …} The number of information bits to be selected is {K} 2,0 , K 2,1 ,K 2,2 , K 2,3 …}, where K 2,0 For Q 2,0 The corresponding number of information bits, K 2,1 For Q 2,1 The corresponding number of information bits, K 2,2 For Q 2,2 The corresponding number of information bits, K2,3 For Q 2,3 The corresponding number of information bits. In some embodiments of the present invention, the number of multiple shorter sequences is not specifically limited.

[0271] In the above description, , where K is the total number of information bits in a code block or a group of code blocks.

[0272] Pre-freeze certain bit indices. For example, bit positions corresponding to rate-matching (puncturing, shortening) positions should be pre-frozen. Specifically, these bit positions are marked as a freeze set {F}. 2,0 , F 2,1 , F 2,2 , F 2,3 …}, where F 2,0 To Q 2,0 The corresponding frozen set, F 2,1 To Q 2,1 The corresponding frozen set, F 2,2 To Q 2,2 The corresponding frozen set, F 2,3 To Q 2,3 The corresponding frozen set.

[0273] From {Q 2,0 Q 2,1 Q 2,2, Q 2,3 …} select {K 2,0 , K 2,1 , K 2,2 , K 2,3 …} the most reliable non-frozen bit indexes to obtain the information set {I 2,0 , I 2,1 , I 2,2 I 2,3 …}, where I 2,0 To Q 2,0 The corresponding information set, I 2,1 To Q 2,1 The corresponding information set, I 2,2 To Q 2,2 The corresponding information set, I 2,3 To Q 2,3 The corresponding information set.

[0274] An alternative to steps i to iv above could be: selecting (K) for the set including the information bit index and the parity bit index. 2,i +P 2,i ( ) bit index, rather than selecting K only for the information set 2,i A bit index. Within this set, select P with the smallest Hamming weight and the highest reliability.2,i A set of bit indices (in the corresponding rows of the polarization generation matrix) is used to obtain the parity check set {P}. 2,0 , P 2,1 , P 2,2 , P 2,3 …}, where P 2,0 To Q 2,0 The corresponding parity check set, P 2,1 To Q 2,1 The corresponding parity check set, P 2,2 To Q 2,2 The corresponding parity check set, P 2,3 To Q 2,3 The corresponding parity check set. Select the remaining bits within the combined set as the information set {I}. 2,0 , I 2,1 , I 2,2 , I 2,3 …}

[0275] All remaining bits in the second (shorter) sequence are additionally selected into the freeze set {F}. 2,0 , F 2,1 , F 2,2 , F 2,3 …}Inside.

[0276] An alternative to step vi above could be to additionally select all remaining bits from the second (shorter) sequence into the parity check set {P}. 2,0 , P 2,1 , P 2,2 , P 2,3 …}Inside.

[0277] Encoding methods that obtain encoded bits based on multiple information bit sets, frozen bit sets, and parity check bit sets include:

[0278] Based on {K 2,0 , K 2,1 , K 2,2 , K 2,3 …} information bits, information bit set, frozen bit set, parity bit set, parity check encoding is performed, and then polar encoding is performed to generate the final encoded bits.

[0279] In the above text, parity coding and polar coding can be performed separately or independently for each shorter polar code (corresponding to a shorter sequence); or parity coding and polar coding can be jointly encoded to obtain a long polar code (corresponding to a single long sequence).

[0280] Some embodiments of the present invention can achieve the following beneficial effects, for example:

[0281] It can more flexibly acquire polar codes suitable for different transmission opportunities or different scenarios.

[0282] It can adapt to different channel conditions and application scenarios to achieve better error correction performance.

[0283] The standard description is concise and has low complexity.

[0284] The ability to generate different sequences of the same length from the same parent sequence can lead to different performance.

[0285] It can generate multiple sequences for different transmission times (such as IR-HARQ initial transmission and retransmission or different redundancy versions).

[0286] This invention includes various embodiments, not only method embodiments but also other embodiments, such as apparatus embodiments and embodiments involving non-transitory computer-readable storage media. Embodiments may be combined individually or in combination with the features disclosed herein.

[0287] While illustrative embodiments have been mentioned in this invention, they are not intended to constitute a limiting understanding. Those skilled in the art will clearly understand, by referring to this document, the various modifications and combinations of the illustrative embodiments and other embodiments of the invention.

[0288] Features disclosed herein in the context of any particular embodiment may be implemented additionally or alternatively in other embodiments. For example, method embodiments may be implemented additionally or alternatively in apparatus, system, and / or computer program product embodiments. Additionally, while embodiments are described primarily in the context of methods and apparatus, other implementations are contemplated as instructions stored in one or more non-transitory computer-readable media, etc. Such media may store programs or instructions to perform any of the various methods consistent with the present invention.

[0289] While various aspects of the invention have been described with reference to specific features and embodiments thereof, various modifications and combinations may be made to the invention without departing from its scope. The specification and drawings are therefore to be regarded only as illustrative of some embodiments of the invention as defined by the appended claims, and any and all modifications, variations, combinations, or equivalents covering the scope of the invention are contemplated. Thus, while embodiments and their potential advantages have been described in detail, various changes, substitutions, and alterations may be made herein without departing from the invention as defined by the appended claims. Furthermore, the scope of this application is not limited to the specific embodiments of the processes, machines, articles of manufacture, material components, modules, methods, and steps described in the specification. It will be readily understood by those skilled in the art from the disclosure of this invention that processes, machines, articles of manufacture, material components, components, methods, or steps that exist now or will be developed later, performing substantially the same function as the corresponding embodiments described herein or achieving substantially the same results as the corresponding embodiments described herein, may be used according to the invention. Therefore, the appended claims are intended to include such processes, machines, articles of manufacture, material components, components, methods, or steps within their scope.

[0290] Furthermore, any module, component, or device executing instructions illustrated herein may include or otherwise access one or more non-transitory computer-readable or processor-readable storage media to store information, such as computer-readable or processor-readable instructions, data structures, program modules, and / or other data. A non-exhaustive list of examples of non-transitory computer-readable or processor-readable storage media includes magnetic tape cassettes, magnetic tape, disk storage or other magnetic storage devices, compact disc read-only memory (CD-ROM), digital video disc or digital versatile disc (DVD), Blu-ray Disc™ and other optical storage devices, volatile and non-volatile, removable and non-removable media implemented in any method or technology, random-access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other storage technologies. Any such non-transitory computer-readable or processor-readable storage medium may be part of a device or may be accessed or connected to a device. Any application or module described herein may be implemented using computer or processor-readable and executable instructions that may be stored or otherwise preserved by such non-transitory computer-readable or processor-readable storage media.

[0291] The standard description is concise and has low complexity.

[0292] This invention includes various embodiments, not only method embodiments but also other embodiments, such as apparatus embodiments and embodiments involving non-transitory computer-readable storage media. Embodiments may be combined individually or in combination with the features disclosed herein.

[0293] While this invention pertains to illustrative embodiments, it is not intended to be limiting. With reference to this document, those skilled in the art will clearly understand various modifications and combinations of the illustrative embodiments and other embodiments of the invention.

[0294] Features disclosed herein in the context of any particular embodiment may be implemented additionally or alternatively in other embodiments. For example, method embodiments may be implemented additionally or alternatively in apparatus, system, and / or computer program product embodiments. Additionally, while embodiments are described primarily in the context of methods and apparatus, other implementations are contemplated as instructions stored in one or more non-transitory computer-readable media, etc. Such media may store programs or instructions to perform any of the various methods consistent with the present invention.

[0295] Abbreviations, abbreviations and acronyms

[0296]

[0297]

Claims

1. A method, characterized in that, include: Determine multiple reliability ranking sequences; Multiple information bits are encoded based on the multiple reliability sorting sequences to obtain multiple codewords, wherein the multiple codewords correspond to the multiple reliability sorting sequences.

2. The method according to claim 1, characterized in that, The values ​​of the elements in the plurality of reliability sorting sequences are greater than zero.

3. The method according to claim 1 or 2, characterized in that, Determining multiple reliability ranking sequences includes: The plurality of reliability ranking sequences are determined by selecting multiple elements from a reference reliability sequence.

4. The method according to claim 3, characterized in that, The length of the reference reliability sequence is less than or equal to the maximum mother code length.

5. The method according to claim 4, characterized in that, The elements in the reference reliability sequence and the elements in each of the plurality of reliability sorting sequences are arranged in order of reliability from low to high.

6. The method according to claim 4 or 5, characterized in that, The values ​​of elements in the first numerical sequence of the plurality of reliability sorting sequences are not less than a first integer and not greater than a second integer, wherein both the first integer and the second integer are not less than zero and not greater than the length of the reference reliability sequence.

7. The method according to claim 6, characterized in that, The first integer and the second integer are related to at least one of the following: The length of the first digital sequence and the length of the reference reliability sequence.

8. The method according to claim 6, characterized in that, The first integer is equal to the length of the first number sequence, and the second integer is equal to twice the length of the first number sequence.

9. The method according to claim 6, characterized in that, The first integer is equal to the difference between the length of the reference reliability sequence and the length of the first number sequence, and the second integer is equal to the length of the reference reliability sequence.

10. The method according to claim 6, characterized in that, The first integer is equal to half the length of the reference reliability sequence, and the second integer is equal to the length of the reference reliability sequence.

11. The method according to any one of claims 3 to 10, characterized in that, The remainder of the element in the second number sequence of the plurality of reliability sorting sequences divided by the third integer is the fourth integer.

12. The method according to claim 11, characterized in that, Both the third integer and the fourth integer are related to at least one of the following: The length of the second digital sequence and the length of the reference reliability sequence.

13. The method according to claim 11 or 12, characterized in that, The third integer equals 2 m m is a positive integer, and the fourth integer is zero.

14. The method according to claim 11 or 12, characterized in that, The third integer equals 2 n n is a positive integer, and the fourth integer is 2. p Subtract 1, where p is a positive integer.

15. The method according to any one of claims 3 to 14, characterized in that, The value of an element in the third sequence of the plurality of reliability sorting sequences is equal to the difference between the value of an element in the fourth sequence of the plurality of reliability sorting sequences and the fifth integer.

16. The method according to claim 15, characterized in that, The fifth integer is related to at least one of the following: The lengths of the third sequence, the fourth sequence, and the reference reliability sequence.

17. The method according to any one of claims 3 to 14, characterized in that, The value of an element in the fifth sequence of the plurality of reliability sorting sequences is equal to the quotient obtained by dividing the value of an element in the sixth sequence of the plurality of reliability sorting sequences by the sixth integer.

18. The method according to claim 17, characterized in that, The sixth integer is related to at least one of the following: the length of the fifth sequence and the length of the reference reliability sequence.

19. The method according to claim 17 or 18, characterized in that, The sixth integer equals 2 q q is a positive integer.

20. The method according to claim 6, characterized in that, The value of an element in the seventh sequence of the plurality of reliability sorting sequences is not less than the seventh integer and not greater than the eighth integer. The values ​​of the seventh integer and the eighth integer are both not less than zero and not greater than the length of the reference reliability sequence. The first integer is different from the seventh integer, and the second integer is different from the eighth integer.

21. The method according to claim 20, characterized in that, The seventh integer and the eighth integer are related to at least one of the following: The length of the seventh sequence and the length of the reference reliability sequence.

22. The method according to any one of claims 1 to 21, characterized in that, Encode multiple information bits based on the multiple reliability sorting sequences to obtain multiple codewords, including: Based on the plurality of information bits and the plurality of reliability sorting sequences, determine the set of information bits within each of the plurality of reliability sorting sequences; Based on the set of information bits in each of the plurality of reliability sorting sequences, the plurality of information bits are encoded to obtain a plurality of codewords.

23. The method according to claim 22, characterized in that, Also includes: Based on the minimum Hamming weight, determine the set of parity bits within each of the plurality of reliability sorting sequences.

24. A method, characterized in that, include: Obtain multiple codewords, wherein the multiple codewords correspond to multiple reliability sorting sequences; The multiple codewords are decoded to obtain multiple sequences, wherein the multiple sequences correspond to multiple information bits.

25. The method according to claim 24, characterized in that, The values ​​of the elements in the plurality of reliability sorting sequences are greater than non-zero integers.

26. The method according to claim 24 or 25, characterized in that, The plurality of reliability ordering sequences are determined by selecting a plurality of elements from a reference reliability sequence.

27. The method according to claim 26, characterized in that, The length of the reference reliability sequence is less than or equal to the maximum mother code length.

28. The method according to claim 27, characterized in that, The elements in the reference reliability sequence and the elements in each of the plurality of reliability sorting sequences are arranged in order of reliability from low to high.

29. The method according to claim 27 or 28, characterized in that, The values ​​of elements in the first numerical sequence of the plurality of reliability sorting sequences are not less than a first integer and not greater than a second integer, wherein both the first integer and the second integer are not less than zero and not greater than the length of the reference reliability sequence.

30. The method according to claim 29, characterized in that, The first integer and the second integer are related to at least one of the following: The length of the first digital sequence and the number of elements within the reference reliability sequence.

31. The method according to claim 29, characterized in that, The first integer is equal to the length of the first number sequence, and the second integer is equal to twice the length of the first number sequence.

32. The method according to claim 29, characterized in that, The first integer is equal to the difference between the length of the reference reliability sequence and the length of the first number sequence, and the second integer is equal to the length of the reference reliability sequence.

33. The method according to claim 29, characterized in that, The first integer is equal to half the length of the reference reliability sequence, and the second integer is equal to the length of the reference reliability sequence.

34. The method according to any one of claims 26 to 33, characterized in that, The remainder of the element in the second number sequence of the plurality of reliability sorting sequences divided by the third integer is the fourth integer.

35. The method according to claim 34, characterized in that, Both the third integer and the fourth integer are related to at least one of the following: The length of the second digital sequence and the length of the reference reliability sequence.

36. The method according to claim 34 or 35, characterized in that, The third integer is a power of 2, and the fourth integer is zero.

37. The method according to claim 34 or 35, characterized in that, The third integer is the second power of 2, and the fourth integer is the third power of 2 minus 1.

38. The method according to any one of claims 26 to 37, characterized in that, The value of an element in the third sequence of the plurality of reliability sorting sequences is equal to the difference between the value of an element in the fourth sequence of the plurality of reliability sorting sequences and the fifth integer.

39. The method according to claim 38, characterized in that, The fifth integer is associated with at least one of the following: the length of the third sequence, the length of the fourth sequence, and the length of the reference reliability sequence.

40. The method according to any one of claims 26 to 37, characterized in that, The value of an element in the fifth sequence of the plurality of reliability sorting sequences is equal to the quotient obtained by dividing the element in the sixth sequence of the plurality of reliability sorting sequences by the sixth integer.

41. The method according to claim 40, characterized in that, The sixth integer is associated with at least one of the following: the length of the fifth sequence, the length of the sixth sequence, and the number of elements within the reference reliability sequence.

42. The method according to claim 29, characterized in that, The value of an element in the sixth sequence of the plurality of reliability sorting sequences is not less than a seventh integer and not greater than an eighth integer. The values ​​of the seventh integer and the eighth integer are both not less than zero and not greater than the length of the reference reliability sequence. The first integer is different from the seventh integer, and the second integer is different from the eighth integer.

43. The method according to claim 42, characterized in that, The seventh integer and the eighth integer are related to at least one of the following: The length of the sixth sequence and the length of the reference reliability sequence.

44. An apparatus, characterized in that, The apparatus includes a processor, wherein the processor is configured to execute one or more instructions stored in a memory to enable the apparatus to implement the method according to any one of claims 1 to 23 or claims 24 to 43.

45. An apparatus, characterized in that, The apparatus includes a function or unit for performing the method according to any one of claims 1 to 23 or the method according to any one of claims 24 to 43.

46. ​​A computer-readable storage medium, characterized in that, It includes one or more instructions, wherein when the instructions are executed on a computer, the computer performs the method according to any one of claims 1 to 23 or the method according to any one of claims 24 to 43.

47. A computer program product, characterized in that, The invention includes a non-transitory computer-readable medium, wherein the non-transitory computer-readable medium stores a program for execution by a processor, the program including instructions for performing the method according to any one of claims 1 to 23 or claims 24 to 43.

Images