A method, apparatus, storage medium, and program product for communication.
By constructing polarized coding sequences based on cross-operations in wireless communication, the performance differences in encoding and decoding between devices with different capabilities are resolved, encoding and decoding performance is improved, and the decoding requirements of different devices are met.
Patent Information
- Application Number
- CN202510638213.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-05-16
- Publication Date
- 2026-11-17
AI Technical Summary
In wireless communication scenarios, low-capability and high-capability devices have different encoding and decoding capabilities. How can we provide encoding and decoding solutions suitable for terminals with different capabilities to improve encoding and decoding performance?
By performing an interleaving operation on the sequence to be encoded based on the numerical relationship between the number of information bits carried by the first and second time-frequency resources, a third sequence to be encoded is constructed for polar coding, which supports the construction of long sequences from short sequences of different lengths to improve encoding and decoding performance.
It avoids the rate matching performance loss caused by puncturing long sequences, improves the encoding and decoding performance of short sequences, and has good error correction capabilities, meeting the decoding needs of devices with different capabilities.
Smart Images

Figure CN123122741A_ABST
Abstract
Description
Technical Field
[0001] This disclosure generally relates to the field of communications, and more specifically to a method, apparatus, computer-readable storage medium, and computer program product for communication. Background Technology
[0002] In wireless communication scenarios, some low-capability devices can only receive data within a specific time-frequency resource, while some high-capability devices can simultaneously receive data within that specific time-frequency resource, as well as other data besides the data within that specific time-frequency resource. Different types of devices have different encoding and decoding capabilities (e.g., the number of information bits supported for encoding and decoding, code length, etc.). How to provide encoding and decoding schemes suitable for terminals with different capabilities is an urgent problem to be solved. Summary of the Invention
[0003] Embodiments of this disclosure provide a method, apparatus, computer-readable storage medium, and computer program product for communication, which can meet the encoding and decoding requirements of devices with different capabilities and improve encoding and decoding performance based on short sequences.
[0004] Firstly, a method is provided, in which the executing entity can be a communication device, such as an encoding device. The communication device can be a communication equipment or a component for the communication equipment (e.g., a chip, a chip system, or a circuit, such as a circuit or chip responsible for communication functions in a terminal device (e.g., a modem chip, also known as a baseband chip, or a system-on-chip (SoC) chip containing a modem core, or a system-in-package (SIP) chip)). The component for the communication equipment can be within the communication equipment or can be independent of the communication equipment. The following description uses a communication device as an example. In this method, the communication device determines a first sequence to be encoded based on a first number of information bits carried by a first time-frequency resource. The communication device determines a second sequence to be encoded based on a second number of information bits carried by a second time-frequency resource. Based on the numerical relationship between the first and second numbers, the communication device performs a first crossover operation on the first and second sequences to be encoded to obtain a third sequence to be encoded. The communication device performs polar coding based on the third sequence to be encoded to obtain an encoded bit sequence. The communication device then outputs the encoded bit sequence. In this way, the rate matching performance loss caused by obtaining a short sequence by punching holes in a long sequence can be avoided, the encoding performance based on short sequences (such as the first sequence to be encoded and the second sequence to be encoded) can be improved, and the decoding performance based on short sequences can be improved, while also having good error correction capabilities.
[0005] In some implementations, the communication device performing the first crossover operation includes: based on the determination that the lengths of the first and second sequences to be encoded are different, the communication device extends the shorter of the two sequences to the length of the longer sequence; then, the communication device performs a second crossover operation on the extended sequence of the shorter sequence and the longer sequence. In this way, a long sequence to be encoded can be constructed for polar coding based on short sequences of different lengths (e.g., the first and second sequences to be encoded) according to different information bit lengths, thereby helping to improve the encoding and decoding performance based on short sequences.
[0006] In some implementations, the expansion involves padding the shorter sequence with zeros to obtain the expanded sequence. This approach allows for the construction of a longer sequence to be encoded for polar coding from short sequences of varying lengths, thereby improving the encoding and decoding performance based on short sequences.
[0007] In some implementations, the communication device pads shorter sequences with zeros, including padding the beginning of the shorter sequence. This makes the constructed longer sequence to be encoded more consistent with the information bit distribution (bits located towards the end of the sequence are more likely to be reliable), which helps improve the encoding and decoding performance based on short sequences.
[0008] In some implementations, the length of the longer sequence is twice the length of the shorter sequence. R The length of the first sequence is equal to the length of the longer sequence, and the extension includes the communication device copying the shorter sequence and performing a third crossover operation based on the shorter sequence and the copied sequence to obtain a first sequence, wherein the length of the first sequence is equal to the length of the longer sequence, and then the communication device transfers J*2 bits of information bits from the first sequence. R-1 The information bits are replaced with zero values to obtain the extended sequence, where J equals the number of information bits in the shorter sequence. This method makes the constructed longer sequence to be encoded more consistent with the information bit distribution, helping to improve the encoding and decoding performance based on the short sequence.
[0009] In some implementations, the communication device will use J*2 R-1 Replacing information bits with zero values involves replacing all information bits in the first sequence except those at the J positions with the largest corresponding indices with zero values. This places information bits in positions with higher reliability, making the constructed long sequence to be encoded more consistent with the information bit distribution, thus improving the encoding and decoding performance based on short sequences.
[0010] In some implementations, the first crossover operation includes the communication device performing a second crossover operation on the first and second sequences to be encoded, based on the determination that the lengths of the first and second sequences to be encoded are the same. In this way, it is possible to construct a long sequence to be encoded from two short sequences to be encoded for polar coding, based on different information bit lengths, thereby helping to improve the encoding and decoding performance based on short sequences.
[0011] In some implementations, performing the second crossover operation includes the communication device performing the second crossover operation with a crossover interval of 2 bits based on determining that the ratio of the first number to the second number is greater than or equal to a first proportion. Alternatively, performing the second crossover operation includes the communication device performing the second crossover operation with a crossover interval of 2L bits based on determining that the ratio of the first number to the second number is less than a first proportion, where L is greater than 1. In this way, the distribution of information bits on the encoding side (the side before the channel encoder, i.e., the u side) can be taken into account through the crossover operation, resulting in better encoding and decoding performance.
[0012] In some implementations, the first ratio is one-half. This approach can achieve better compilation and decoding performance.
[0013] In some implementations, when the ratio of the first number to the second number is equal to the first ratio, the crossover interval is 2. L1 When the ratio of the first number of bits to the second number of bits is the second ratio, the crossover interval is 2. L2 Bits, where the first ratio is less than the second ratio, and L1 is greater than L2. In this way, the larger the ratio of the first number to the second number, the smaller the cross interval is used, thus achieving better encoding and decoding performance.
[0014] In some implementations, the first time-frequency resource is a time-frequency resource within a first receiving bandwidth of a terminal device with a first capability and outside a second receiving bandwidth of a terminal device with a second capability, where the first receiving bandwidth includes the second receiving bandwidth. Alternatively, the second time-frequency resource is a time-frequency resource within a second receiving bandwidth of a terminal device with a second capability. In this way, for terminal devices with different capabilities, the sequence to be encoded can be constructed based on the number of information bits carried by different time-frequency resources, thereby achieving better encoding and decoding performance.
[0015] In some implementations, the output encoded bit sequence includes: the communication device mapping the encoded bit sequence to a first time-frequency resource and a second time-frequency resource based on a first mapping method, wherein the first mapping method is associated with a first interleaving operation. In this way, the encoded bit sequence can be output to decoding end devices with different capabilities through different time-frequency resources, thus meeting the decoding requirements of different decoding end devices.
[0016] Secondly, a method is provided, in which the executing entity can be a communication device. This communication device can be, for example, a decoding device. The communication device can be a communication equipment or a component for a communication equipment (e.g., a chip, a chip system, or a circuit, such as a circuit or chip responsible for communication functions in a terminal device (e.g., a modem chip, also known as a baseband chip, or a system-on-chip (SoC) chip containing a modem core, or a system-in-package (SIP) chip)). The component for the communication equipment can be within the communication equipment or can be independent of the communication equipment. The following description uses an example where the executing entity is a communication device (e.g., a decoding device). In this method, the communication device receives information to be decoded on a first time-frequency resource and a second time-frequency resource. The communication device decodes the information to be decoded based on a set of information bit positions, obtaining a decoded bit sequence. The set of information bit positions includes the information bit positions in a third sequence to be encoded. This third sequence is obtained through a first crossover operation between the first and second sequences, based on the numerical relationship between a first number and a second number of information bits. The first sequence to be encoded is determined based on a first number of information bits carried by a first time-frequency resource, and the second sequence to be encoded is determined based on a second number of information bits carried by a second time-frequency resource. This method improves the decoding performance based on short sequences.
[0017] For some specific implementations of the second aspect, please refer to the above introduction on some implementations of the first aspect.
[0018] Thirdly, a method is provided, the execution subject of which can be a communication device or a chip within the communication device. The following description uses a communication device (e.g., a decoding device) as an example. In this method, the communication device receives information to be decoded on a first time-frequency resource and a second time-frequency resource. The communication device receives first information to be decoded on the first time-frequency resource. The communication device receives second information to be decoded on the second time-frequency resource. The communication device concatenates the first and second information to be decoded to obtain third information to be decoded. Further, the communication device decodes the third information to be decoded according to a set of information bit positions to obtain a decoded bit sequence, wherein the set of information bit positions includes the information bit positions in a third constructed sequence. The third constructed sequence is a sequence obtained by performing a fourth crossover operation on the first and second constructed sequences based on the numerical relationship between a first number and a second number. The first constructed sequence is determined based on a first number of information bits carried by the first time-frequency resource, and the second constructed sequence is determined based on a second number of information bits carried by the second time-frequency resource. In this way, the decoding performance based on short sequences can be improved.
[0019] In some implementations, the communication device performs a fourth crossover operation, which involves extending the shorter of the first and second constructed sequences to the length of the longer sequence, based on the determination that the lengths of the first and second constructed sequences are different. The communication device then performs a fifth crossover operation on the extended shorter sequence and the longer sequence. In this way, decoding can be performed on the information bit positions within a long constructed sequence constructed from short constructed sequences of different lengths, improving the decoding performance based on short sequences.
[0020] In some implementations, the extension involves the communication device padding the shorter sequence with zeros to obtain the extended sequence. In this way, polarization decoding can be performed on the information bit positions in the long constructed sequences constructed from short constructed sequences of different lengths, thereby improving the decoding performance based on short sequences.
[0021] In some implementations, the communication device pads shorter sequences with zeros, including leading zeros. This makes the constructed longer sequences more consistent with the information bit distribution, improving decoding performance based on shorter sequences.
[0022] In some implementations, the length of the longer sequence is twice the length of the shorter sequence. R The length of the first sequence is equal to the length of the longer sequence, and the extension includes the communication device copying the shorter sequence and performing a sixth crossover operation based on the shorter sequence and the copied sequence to obtain a first sequence, wherein the length of the first sequence is equal to the length of the longer sequence, and then the communication device transfers J*2 bits of information bits from the first sequence. R-1 The information bits are replaced with zero values to obtain the extended sequence, where J equals the number of information bits in the shorter sequence. This method makes the longer constructed sequence more consistent with the information bit distribution, improving the decoding performance based on the shorter sequence.
[0023] In some implementations, J*2 R-1 Replacing information bits with zero values involves the communication device replacing all information bits in the first sequence except for the J bits at the largest corresponding indices with zero values. This method makes the constructed long sequence more consistent with the information bit distribution, helping to improve the encoding and decoding performance based on short sequences.
[0024] In some implementations, the communication device performing the fourth crossover operation includes performing a fifth crossover operation on the first and second constructed sequences based on the determination that the lengths of the first and second constructed sequences are the same. In this way, polar coding can be performed on the information bit positions in a long constructed sequence constructed from two short constructed sequences, improving the decoding performance based on short sequences.
[0025] In some implementations, the communication device performing the fifth crossover operation includes the communication device performing the fifth crossover operation with a crossover interval of 2 bits based on determining that the ratio of the first number to the second number is greater than or equal to a first proportion. Alternatively, performing the fifth crossover operation includes the communication device performing the fifth crossover operation with a crossover interval of 2 bits based on determining that the ratio of the first number to the second number is less than a first proportion. L The bits undergo a fifth interleaving operation, where L is greater than 1. This method yields better encoding and decoding performance.
[0026] In some implementations, the first ratio is one-half. This approach can achieve better compilation and decoding performance.
[0027] In some implementations, when the ratio of the first number to the second number is equal to the first ratio, the crossover interval is 2. L1 When the ratio of the first number of bits to the second number of bits is the second ratio, the crossover interval is 2. L2 The bits are arranged such that the first ratio is less than the second ratio, and L1 is greater than L2. In this way, the larger the ratio of the first number to the second number, the smaller the cross interval is used, thus achieving better decoding performance.
[0028] In some implementations, the first time-frequency resource is a time-frequency resource within a first receiving bandwidth of a terminal device with a first capability and outside a second receiving bandwidth of a terminal device with a second capability, where the first receiving bandwidth includes the second receiving bandwidth. Alternatively or additionally, the second time-frequency resource is a time-frequency resource within a second receiving bandwidth of a terminal device with a second capability. In this manner, for terminal devices with different capabilities, polarization decoding can be performed based on the positions of information bits in a constructed sequence corresponding to the number of information bits in different time-frequency resources, resulting in better decoding performance.
[0029] In a fourth aspect, a communication device is provided, which has the function of implementing the behaviors described in the method examples of the first, second, or third aspects above. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the described functions. The descriptions of the communication devices of the first, second, or third aspects above also apply to the communication device of the fourth aspect; that is, the communication device of the fourth aspect can refer to the communication device itself, or to components used in the communication device (e.g., processors, chips, or chip systems), or to logic modules or software capable of implementing all or part of the functions of the communication device. In one possible design, the communication device includes a unit that performs the methods of the first, second, or third aspects, or implementations thereof. The beneficial effects of the communication device provided in the fourth aspect can be found in the descriptions of the first, second, or third aspects, and will not be repeated here.
[0030] Fifthly, an apparatus is provided. The apparatus includes a processor configured to cause the apparatus to perform any method according to the first, second, or third aspects and their implementations by executing a computer program (or computer-executable instructions) stored in a memory, and / or by means of logic circuitry.
[0031] In some implementations, the device also includes a memory for storing computer programs (or computer-executable instructions).
[0032] In some implementations, the processor and memory are integrated together.
[0033] In other implementations, the aforementioned memory is located outside the communication device.
[0034] In some implementations, the device also includes a communication interface for communicating with other devices, such as transmitting or receiving data and / or signals. Exemplarily, the communication interface may be a transceiver, circuit, bus, module, input / output interface, or other types of communication interface.
[0035] Sixthly, a computer-readable storage medium is provided. The computer-readable storage medium stores a computer program or instructions, which, when executed by an electronic device, cause the electronic device to perform the methods performed by the apparatus in the above aspects.
[0036] In a seventh aspect, a computer program or computer program product is provided. The computer program or computer program product includes computer instructions that, when executed by an electronic device, cause the electronic device to perform the methods performed by the apparatus in the above aspects.
[0037] Eighthly, embodiments of this disclosure provide a chip system including a processor for implementing the functions of the apparatus in the methods of the above aspects. In one possible design, the chip system further includes a memory for storing computer programs or instructions and / or data. The chip system may be composed of chips or may include chips and other discrete devices.
[0038] Ninthly, embodiments of this disclosure also provide a communication system. The communication system includes at least one of the following: a communication device for performing the first aspect, a communication device for performing the second aspect, or a communication device for performing the third aspect. Attached Figure Description
[0039] Figure 1 A schematic diagram of a communication system according to some embodiments of the present disclosure is shown.
[0040] Figure 2A A schematic diagram of the communication flow of some embodiments of this disclosure is shown.
[0041] Figure 2B A schematic diagram of the communication flow of some other embodiments of this disclosure is shown.
[0042] Figure 3 , Figure 5 , Figure 7 , Figure 9 , Figure 13 A schematic diagram showing the positions of two construction sequences in a reliability sequence according to some embodiments of this disclosure is provided.
[0043] Figure 4 , Figure 6 , Figure 8 , Figures 10 to 12 , Figures 14 to 19 The diagram illustrates a performance comparison of constructing polar codes using long sequences in some embodiments of this disclosure and long sequences in some schemes.
[0044] Figure 20 A flowchart illustrating the implementation at the encoding end in some embodiments of this disclosure is shown.
[0045] Figure 21 A flowchart illustrating the implementation at the decoding end in some embodiments of this disclosure is shown.
[0046] Figure 22 Flowcharts illustrating implementations at the decoding end in some other embodiments of this disclosure are shown.
[0047] Figure 23 This is a block diagram of a device that can be used to implement some embodiments of this application.
[0048] Figure 24 This is a schematic diagram of the structure of an apparatus according to some embodiments of this application.
[0049] Figure 25 This is a schematic diagram of the structure of an apparatus according to some other embodiments of this application.
[0050] Figure 26 This is a schematic diagram of the structure of an apparatus according to some other embodiments of this application. Detailed Implementation
[0051] Embodiments of this disclosure will now be described in more detail with reference to the accompanying drawings. While some embodiments of this disclosure are shown in the drawings, it should be understood that embodiments of this disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of this disclosure. It should be understood that the accompanying drawings and embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of protection of this disclosure.
[0052] In the description of embodiments of this disclosure, the term "comprising" and similar terms should be understood as open-ended inclusion, i.e., "including but not limited to". The term "based on" should be understood as "at least partially based on". The term "one embodiment" or "the embodiment" should be understood as "at least one embodiment". The terms "first", "second", etc., may refer to different or the same objects. Other explicit and implicit definitions may also be included below.
[0053] Embodiments of this disclosure may be implemented according to any suitable communication protocol, including but not limited to cellular communication protocols such as 3rd Generation (3G), 4th Generation (4G), 5th Generation (5G) and future communication protocols, wireless local area network communication protocols such as Institute of Electrical and Electronics Engineers (IEEE) 802.11, and / or any other protocol currently known or to be developed in the future.
[0054] In the future, various types of devices will exist, and the number of information bits that different device types can decode depends on the device's capabilities and receiving bandwidth. Based on capabilities, devices can be categorized into low-capacity and high-capacity devices. For example, some low-capacity devices can only receive data within specific time-frequency resources (e.g., core data), while some high-capacity devices can simultaneously receive core data and other additional data. The problem that needs to be solved is how to design the polar code construction sequence based on different device capabilities and the required number of information bits to be decoded, so that the transmitter can use a short sequence to simultaneously meet the decoding needs of devices with different capabilities.
[0055] Figure 1 A schematic diagram of a communication system according to some embodiments of this disclosure is shown. For example... Figure 1As shown, the communication method provided in this disclosure can be applied to communication system 100, wireless communication systems such as 5G, satellite communication, and Internet of Things (IoT) devices, or future communication systems. In communication system 100, terminal devices 101 and 102 and network device 103 are shown. Examples of terminal devices 101 and 102 can be UEs, mobile stations (MS), etc. Examples of network device 103 can be base stations (BS), etc. Wireless communication systems (such as communication system 100) are typically composed of cells, each cell containing a base station, which provides communication services to multiple mobile stations. The base station includes a baseband unit (BBU) and a remote radio unit (RRU). The BBU and RRU can be placed in different locations; for example, the RRU can be placed remotely in a high-traffic area, while the BBU is placed in a central equipment room. The BBU and RRU can also be placed in the same equipment room. The BBU and RRU can also be different components under the same rack. In some examples, terminal devices 101 and 102 can be terminal devices with the same or different capabilities, such as the low-capability device and the high-capability device mentioned above.
[0056] It should be noted that the wireless communication systems mentioned in the embodiments of this disclosure include, but are not limited to: narrow band Internet of Things (NB-IoT) systems, long term evolution (LTE) systems, and the three major application scenarios of 5G mobile communication systems or future communication systems: enhanced mobile broadband (eMBB), ultra-reliable and low latency communications (URLLC), and enhanced machine-type communication (eMTC).
[0057] It should be understood that the above wireless communication systems are applicable to both high-frequency scenarios, such as millimeter waves, and low-frequency scenarios. Application scenarios for wireless communication systems include, but are not limited to, fifth-generation systems (5G), new radio (NR) communication systems, and future communication systems such as evolved public land mobile networks (PLMN) systems.
[0058] In the embodiments of this disclosure, the terms "terminal" or "terminal device" refer to any terminal device capable of wired or wireless communication with network devices or with each other. A terminal device may sometimes be referred to as a user equipment (UE). A terminal device can be any type of mobile terminal, fixed terminal, or portable terminal. A terminal device can be various wireless communication devices with wireless communication capabilities. For example, a terminal device (such as...) Figure 1 The terminal devices 101 and 102 shown can be user equipment (UE), terminals, access terminals, terminal units, terminal stations, mobile stations (MS), remote stations, remote terminals, mobile terminals, wireless communication equipment, terminal agents, or other terminal equipment. Terminal equipment can also be communication chips with communication modules, vehicles with communication functions, or in-vehicle equipment (such as in-vehicle communication devices or in-vehicle communication chips). This terminal equipment can have wireless transceiver capabilities, enabling it to communicate (e.g., wirelessly) with one or more network devices in one or more communication systems and receive network services provided by these network devices, including but not limited to… Figure 1 The network device 103 shown.
[0059] The terminal device can be a cellular phone, cordless phone, session initiation protocol (SIP) phone, wireless local loop (WLL) station, personal digital assistant (PDA) device, handheld device with wireless communication capabilities, computing device or other processing device connected to a wireless modem, vehicle-mounted device, wearable device, terminal device in future 5G networks or terminal device in future evolved PLMN networks, etc.
[0060] Specifically, the terminal device can be a mobile phone, tablet, computer with wireless transceiver capabilities, virtual reality (VR) terminal, augmented reality (AR) terminal, wireless terminal in industrial control, mobile internet device (MID), wearable device (such as smartwatch, smart bracelet, pedometer, smart glasses, etc.), vehicle-mounted device (such as car, bicycle, electric vehicle, airplane, ship, train, high-speed rail, etc.), satellite terminal, vehicle device (such as vehicle assembly, vehicle module, vehicle chip, on-board unit (OBU) or telematics box (T-BOX), etc.), wireless terminal in self-driving, wireless terminal in remote medical care, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc.
[0061] In addition, terminal devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; terminal devices can also be deployed on water (such as ships); terminal devices can also be deployed in the air (such as airplanes, balloons, and satellites). Network devices can be access network devices (or access points). Access network devices refer to devices that provide network access functions, such as radio access network (RAN) base stations, etc. Specifically, network devices can include base stations (BS), or base stations and radio resource management equipment used to control base stations, etc. Network devices can also include relay stations (relay equipment), access points, and base stations in 5G networks or NR base stations, and base stations in future PLMN networks, etc. Network devices can be wearable devices or vehicle-mounted devices. Network devices can also be communication chips with communication modules.
[0062] In the embodiments of this disclosure, the terms "network node" or "network device" refer to an entity or node that can be used to communicate with a terminal device, such as an access network device. An access network device can be a means deployed in a radio access network to provide wireless communication functionality for a mobile terminal, such as a radio access network (RAN) device. Access network devices can include various types of base stations. Base stations are used to provide wireless access services to terminal devices. For example, network equipment (such as network equipment 103) includes, but is not limited to: base stations (gnodeB, gNB) in 5G, evolved node B (eNB) in long term evolution (LTE) systems, radio network controllers (RNC), radio controllers (BSC) in cloud radio access networks (CRAN) systems, base station controllers (BSC), home base stations (e.g., home evolved nodeB, or home node B, HNB), base band units (BBU), transmitting and receiving points (TRP), transmitting points (TP), mobile switching centers, and can also be evolved NBs (eNB or eNodeB) in LTE, base station equipment in future 5G networks or access network equipment in future evolved PLMN networks, and can also be wearable devices or vehicle-mounted devices.
[0063] In some deployments, network devices may include centralized units (CUs) and distributed units (DUs). Network devices may also include active antenna units (AAUs). The CU implements some of the network device's functions, and the DU implements others. For example, the CU is responsible for handling non-real-time protocols and services, implementing radio resource control (RRC) and packet data convergence protocol (PDCP) layer functions. The DU is responsible for handling physical layer protocols and real-time services, implementing radio link control (RLC), media access control (MAC), and physical (PHY) layer functions. The AAU implements some physical layer processing functions, radio frequency processing, and active antenna-related functions. Since RRC layer information ultimately becomes PHY layer information, or is derived from PHY layer information, in this architecture, higher-layer signaling, such as RRC layer signaling, can also be considered as being sent by the DU, or by the DU+AAU. It is understood that network devices can be one or more of the following: CU nodes, DU nodes, and AAU nodes. Furthermore, a CU can be classified as a network device in the radio access network (RAN) or a network device in the core network (CN); this application does not limit this classification. Examples of network devices include, but are not limited to, NodeB (or NB), evolved NodeB (eNodeB or eNB), next-generation NodeB (gNB), Transmitter Receiver Point (TRP), Remote Radio Unit (RRU), Radio Head (RH), Remote Radio Head (RRH), IAB nodes, low-power nodes such as femtonodes, piconodes, reconfigurable intelligent surfaces (RIS), and network control repeaters.
[0064] In addition, network devices can connect to core network (CN) devices, which provide core network services to access network devices and terminal devices. Core network devices can correspond to different devices in different systems. For example, in 4G, core network devices can correspond to a mobility management entity (MME) and / or a serving gateway (S-GW). In 5G, core network devices can correspond to access and mobility management functions (AMF), session management functions (SMF), or user plane functions (UPF).
[0065] The coding and modulation scheme of this disclosure can be used in dedicated network equipment or general-purpose equipment, in base station equipment, and in various terminal devices. This disclosure can be implemented using application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or software (program code in memory).
[0066] Polar codes are the first channel coding method that can be rigorously proven to "achieve" channel capacity. At different code lengths, especially for finite codes, Polar codes outperform Turbo codes and LDPC codes. Furthermore, Polar codes have lower computational complexity in encoding and decoding. These advantages have led to the widespread application of Polar codes in 5G. A Polar code is a linear block code with a generator matrix of G. N The encoding process is as follows in It is a binary row vector with a length of N (i.e., code length); G N It is an N×N matrix, and here n = log2(N); Defined as the Kronecker product of n matrices F2. During Polar code encoding, A portion of the bits are used to carry information and are called information bits; the set of indices of these bits is denoted as A. The other portion of the bits are set to fixed values agreed upon by the transmitting and receiving ends; these are called fixed bits, and the set of their indices is the complement of A, A0. c express.
[0067] The selection process for information bits and frozen bits in Polar codes is based on a reliability sequence. The specific steps include obtaining the reliability sequence, subset selection, and the partitioning of information bits and frozen bits. First, there is a Polar sequence arranged in ascending order of reliability, where each element represents the reliability of a bit. The subset selection process involves choosing all elements from the Polar sequence whose values are less than a certain threshold, forming a new subset, which is also arranged in ascending order of reliability. In the partitioning of information bits and frozen bits, bits with higher reliability are selected as information bits; these bits will be used to carry the actual information. Bits with lower reliability are selected as frozen bits; these bits are usually fixed to known values (usually 0) to improve the reliability of the encoding.
[0068] The specific process described above includes defining the set, setting parameters, selecting the process, and placing the check bits. For example, defining the set allows us to define A as the set of bits with high reliability in the Polar sequence, and defining A... c This represents the set of other bits in the Polar sequence, i.e., the set of bits with lower reliability. Parameter settings include, for example, setting |A| to represent the number of information bits, such as |A| = K, and setting |A... c | indicates the number of frozen bits, such as |A c | = NK, where K represents the message length and N represents the total length after encoding. The selection process, for example, selects the first K bits with the highest reliability from the Polar sequence as information bits; these bits will be used to carry the actual information. The remaining NK bits are used as freeze bits, usually fixed at 0. Optionally, the parity bits are placed, for example, on bits with low reliability to further improve the reliability of the encoding. For example, for a Polar code of length N = 8 with a reliability sequence of [1 2 3 5 4 6 7 8] (reliability sorted from low to high), if K = 4 information bits need to be encoded, the four positions with the highest reliability are selected as information bits, i.e., positions 4, 6, 7, and 8 are used to place information bits, and the remaining positions can be used to place freeze bits or parity bits. The corresponding construction sequence is: information bit positions infoBitsPos = [0 0 0 1 0 1 1 1], where the position of 1 is the information position, and the position corresponding to 0 is the freeze position. To enhance the error correction capability of Polar codes, parity check bits can be placed at relatively reliable frozen positions. For example, a parity check (PC) bit can be placed at the 5th position, with the corresponding construction sequence being infoBitsPos = [0 0 0 1 2 1 1 1]. Through the above process, the information bits and frozen bits of the Polar code are rationally selected and allocated to ensure that the encoded data has high reliability and transmission efficiency.
[0069] In some schemes, constructing two codes with different mother code lengths (e.g., Polar codes) requires reading two different length sequences from a reliability sequence and adapting them to the encoding of different length codes. This makes it impossible to reuse the same construction sequence and simultaneously achieve optimal rate matching and better error correction capabilities. To address this, this disclosure proposes a scheme that can simultaneously satisfy the decoding of codes of different lengths using a single sequence. For devices with limited capabilities, this scheme meets the requirement of low decoding complexity; for devices with high capabilities, it maximizes the gain from longer codes. Both types of devices are constructed (e.g., selecting information positions) and decoded based on the same sequence, thus meeting the self-decoding requirements of different device types.
[0070] Figure 2A A schematic diagram of the communication flow of some embodiments of this disclosure is shown. For example... Figure 2A As shown, in process 210, communication between different communication devices is involved. For ease of explanation, the communication device performing the encoding operation is referred to as the first device. The first device can be a network device or a chip, module, or assembly within a network device. This example illustrates that the first device is a network device (e.g., network device 103). Examples of network devices include base stations. The communication device performing the decoding operation is referred to as the second device. The second device can be a terminal device or a chip, module, or assembly within a terminal device. This example illustrates that the second device is a terminal device (e.g., terminal device 101). In this example, terminal device 101 can be an example of a high-capability device. Examples of terminal device 101 include UEs. In some examples, a high-capability device is also referred to as a terminal device with first capabilities, or a high-capability terminal device. A low-capability device is also referred to as a terminal device with second capabilities, a low-capability terminal device, a weak-capability terminal, a low-end device, or a terminal device in power-saving mode. It should be noted that some embodiments of this disclosure may not limit the types of the first and second devices. For example, in some other examples, both the first device and the second device can be terminal-side devices. In some examples, the first device can be a terminal-side device, while the second device can be a network-side device.
[0071] In process 210, at 211, network device 103 determines a first sequence to be encoded based on a first number of information bits carried by a first time-frequency resource. At 213, network device 103 determines a second sequence to be encoded based on a second number of information bits carried by a second time-frequency resource.
[0072] In some examples, the first sequence to be encoded is obtained based on a first constructed sequence (e.g., infoBitsPos1, or the infoBitsPos1 sequence). In some examples, the second sequence to be encoded is obtained based on a second constructed sequence (e.g., infoBitsPos2, or the infoBitsPos2 sequence). The meaning of the constructed sequences is explained above. In some examples, the first and second constructed sequences can be referred to as short constructed sequences. Exemplarily, the first and second sequences to be encoded can also be determined based on a first set of information bits (e.g., a set of information bits carried by a first time-frequency resource) and a second set of information bits (a set of information bits carried by a second time-frequency resource). Exemplarily, information bits can be mapped to a first set of information bit positions (i.e., the information bit positions corresponding to the first set of information bits) to obtain the first sequence to be encoded. The remaining positions can be predefined bit values; alternatively, the remaining positions can be predefined bit values and parity bits (e.g., parity bits), the value of which is determined based on the values of one or more information bits.
[0073] Based on the above example, the sequence to be encoded (e.g., the first sequence to be encoded, the second sequence to be encoded) may include information bits, wherein the information bits may include the payload bits themselves, or may include the payload bits and check bits (e.g., cyclic redundancy check (CRC) bits). Accordingly, the number of information bits in the sequence to be encoded may be the number of payload bits, or the sum of the number of payload bits and the number of check bits (if check bits are included).
[0074] In some examples, the first time-frequency resource is a time-frequency resource within the receiving bandwidth (first receiving bandwidth) of the terminal device with a first capability and outside the receiving bandwidth (second receiving bandwidth) of the terminal device with a second capability, the first receiving bandwidth including the second receiving bandwidth. The second time-frequency resource is a time-frequency resource within the second receiving bandwidth of the terminal device with the second capability. In some examples, the first time-frequency resource may be referred to as an out-of-band time-frequency resource, and the second time-frequency resource may be referred to as an in-band time-frequency resource.
[0075] In some examples, the first number is denoted as K1, and the second number as K2. A weakly capable device can carry K2 information bits, while a strongly capable device can carry K1 more information bits than a weakly capable device. In other words, a strongly capable device can decode (K1+K2) information bits, that is, the information bits carried by in-band and out-of-band time-frequency resources. A weakly capable device can only decode K2 information bits, that is, the information bits carried by in-band time-frequency resources.
[0076] In some examples, the encoding and decoding can be polar coding and polar decoding, respectively, or they can be other encodings and decodings besides polar coding and polar decoding.
[0077] At 215, network device 103 performs a crossover operation (hereinafter referred to as the first crossover operation) on the first sequence to be encoded and the second sequence to be encoded based on the numerical relationship between the first number and the second number, to obtain the third sequence to be encoded.
[0078] In other examples, instead of performing the first crossover operation on the first and second sequences to be encoded, a crossover operation can be performed on the first and second constructed sequences to obtain a third constructed sequence. The principle of the crossover operation performed on these two constructed sequences is similar to the first crossover operation described above, and the specific implementation details will not be repeated. In such examples, the third sequence to be encoded can be obtained from the third constructed sequence, which is also called the long constructed sequence. In some examples, the above numerical relationship can be a ratio between the first and second numbers, such as K1:K2 or K2:K1. In other examples, the above numerical relationship can be a difference between the first and second numbers, such as the relationship between K2-K1 and K1. Taking K2 = 2K1 as an example, the ratio can be expressed as K1:K2 being one-half, or K2:K1 being 2. The difference can be expressed as K2-K1 = K1.
[0079] At 217, network device 103 performs polar coding based on the third sequence to be encoded to obtain the encoded bit sequence.
[0080] At 219, network device 103 outputs the encoded bit sequence. In some examples, the network device 103 may send the encoded bit sequence to a decoding end (e.g., terminal device 101 or 102) via a channel. In other examples, network device 103 may perform other operations such as rate matching and modulation before performing the above output operation, which is not limited in this embodiment.
[0081] Rate matching refers to either removing some bits from the encoded bit sequence without transmitting them, or repeatedly transmitting some bits. Rate matching methods are further explained in three categories: Punching: This involves directly punching holes in certain bit positions of the encoded bit sequence without transmitting them, thus generating bit sequences of arbitrary length. On the decoding side, since the corresponding "punched" positions contain no information, the log-likelihood ratio (LLR) of the corresponding bit is set to 0. Shortening: This makes certain bit positions in the encoded bit sequence fixed values, thus also eliminating the need for transmission. On the decoding side, since the corresponding "shortened" positions are essentially known at the receiver (usually 0), the LLR of the corresponding bit is set to infinity. Repetition: This involves repeatedly transmitting some bits of the encoded bit sequence to obtain a longer bit sequence.
[0082] At 221, terminal device 101 receives information to be decoded on the first time-frequency resource and the second time-frequency resource. Terminal device 101 can be an example of a high-capability terminal device, and the information to be decoded is, for example, a bit sequence to be decoded. The bit sequence to be decoded corresponds to a third sequence to be encoded, and is the sequence received at the decoding end after the third sequence to be encoded and modulated at the encoding end and transmitted to the channel. For a high-capability terminal device, it can receive the information to be decoded from both the first time-frequency resource and the second time-frequency resource.
[0083] This example primarily uses a powerful terminal device as an example. For a weakly capable terminal device, the decoding operation can employ schemes based on short sequences (short bit sequences) corresponding to the weakly capable terminal device. As mentioned above, the receiving bandwidth of the weakly capable terminal is the second receiving bandwidth, and it receives the information to be decoded on the second time-frequency resource. After receiving the information to be decoded, the weakly capable terminal can decode the information according to the second information bit position set (i.e., the information bit positions corresponding to the second information bit set) or the second constructed sequence to obtain a bit sequence.
[0084] In step 223, terminal device 101 decodes the information to be decoded according to the information bit position set to obtain a decoded bit sequence. The information bit position set includes the information bit positions in the third sequence to be encoded. As described above, the third sequence to be encoded is a sequence obtained by a first crossover operation between the first and second sequences to be encoded, based on the numerical relationship between the first and second numbers. The first sequence to be encoded is determined based on the first number of information bits carried by the first time-frequency resource, and the second sequence to be encoded is determined based on the second number of information bits carried by the second time-frequency resource.
[0085] In some examples, the process of network device 103 performing the first crossover operation includes network device 103 expanding the shorter of the first and second sequences to be encoded to the length of the longer sequence based on the determination that the lengths of the first and second sequences to be encoded are different, and then performing a crossover operation (referred to as the second crossover operation) on the expanded sequence of the shorter sequence and the longer sequence.
[0086] In some examples, the above-described expansion operation may be that network device 103 pads the shorter sequence with zeros to obtain the expanded sequence.
[0087] In some examples, the padding of the shorter sequence by network device 103 includes padding the shorter sequence with zeros.
[0088] In some examples, the length of the longer sequence is twice the length of the shorter sequence. R The length of the first sequence is equal to the length of the longer sequence, and R is greater than or equal to 1. In such an example, the expansion operation may include network device 103 copying the shorter sequence and performing a third crossover operation based on the shorter sequence and the copied sequence to obtain a first sequence, wherein the length of the first sequence is equal to the length of the longer sequence, and then network device 103 transferring J*2 bits from the information bits in the first sequence. R-1 The information bits are replaced with zero values to obtain the expanded sequence, where J equals the number of information bits in the shorter sequence. In some examples, J*2 R-1 During the process of replacing information bits with zero values, network device 103 can replace all information bits in the first sequence except for the information bits at the J positions with the largest corresponding indices with zero values.
[0089] In some examples, the process of network device 103 performing the first crossover operation includes network device 103 performing a second crossover operation on the first and second sequences to be encoded based on the determination that the lengths of the first and second sequences to be encoded are the same.
[0090] In some examples, during the second crossover operation performed by network device 103, network device 103 may perform the second crossover operation with a crossover interval of 2 bits based on determining that the ratio of the first number to the second number is greater than or equal to a first ratio. A crossover interval of 2 bits means that the first sequence to be encoded and the second sequence to be encoded are alternated by one bit, that is, one bit of the second sequence to be encoded is placed between two bits of the first sequence to be encoded.
[0091] In other examples, during the second cross-connection operation performed by network device 103, network device 103 may, based on the determination that the ratio of the first number to the second number is less than a first proportion, determine the cross-connection interval as 2. LThe bits undergo a second crossover operation, where L is greater than 1. The crossover interval is 2. L The second crossover operation on bits indicates that the first sequence to be encoded and the second sequence to be encoded are crossed by 2. L The bits are alternated using 2 bits. Taking L=7 as an example, the crossover interval is 128. Performing the second crossover operation with a crossover interval of 128 bits means that the first and second sequences to be encoded are alternated in 64-bit intervals. That is, each 64-bit interval is considered a whole, and one 64-bit interval of the second sequence is placed between the two groups of 64 bits of the first sequence. In this example, the first bit of the first group and the first bit of the second group contain 128-1=127 bits.
[0092] In some examples, the first ratio described above is one-half. In other examples, the first ratio described above may also be any other suitable ratio other than one-half.
[0093] In some examples, when the ratio of the first number to the second number is the first ratio, the crossover interval is 2. L1 When the ratio of the first number of bits to the second number of bits is the second ratio, the crossover interval is 2. L2 Bits, where the first ratio is less than the second ratio, and L1 is greater than L2.
[0094] In some examples, network device 103 outputs an encoded bit sequence. Based on a first mapping method, the encoded bit sequence can be mapped to a first time-frequency resource and a second time-frequency resource, where the first mapping method is associated with a first crossover operation. For example, the first mapping method maps the encoded bit sequence to the corresponding time-frequency resource according to the information bit indicated in the third sequence to be encoded obtained through the first crossover operation. This allows the receiving end to decode the information bit corresponding to the first bit to be encoded based on the information on the first time-frequency resource. The information bit corresponding to the third encoded bit can be decoded based on the information from the first and second time-frequency resources. In some examples, the mapping operation can be performed after rate matching and modulation of the encoded codeword. For example, the symbol sequence obtained after modulating the codeword can be mapped to the corresponding time-frequency resource (first time-frequency resource and second time-frequency resource). In other examples, the order of the rate matching, modulation, and mapping operations on the codeword can be interchanged, and this disclosure does not limit this.
[0095] In the encoding-side example described in process 210 above, network device 103 performs an interleaving operation on two short sequences to be encoded to obtain a long sequence to be encoded (e.g., a third sequence to be encoded). Polar coding is then performed on the third sequence to obtain an encoded bit sequence, which is then mapped onto a first time-frequency resource and a second time-frequency resource for transmission. Alternatively, in other examples different from the encoding-side example described in process 210, the above interleaving operation may not be performed on the encoding side. Instead, the first and second sequences to be encoded are encoded separately to obtain two corresponding encoded bit sequences, such as a first encoded bit sequence and a second encoded bit sequence. Network device 103 can map the sequence obtained by XORing the first and second encoded bit sequences onto the first time-frequency resource for transmission, and map the second encoded bit sequence onto the second time-frequency resource for transmission. Thus, a high-capability terminal can receive the corresponding information to be decoded from both the first and second time-frequency resources, while a low-capability terminal can receive the corresponding information to be decoded from the second time-frequency resource.
[0096] Figure 2B Schematic diagrams of communication flows from other embodiments of this disclosure are shown. Similar to flow 210, flow 220 is described using network device 103 and terminal device 101 as an example. Figure 2B In the illustrated process 220, steps 231, 233, 239, 243, and 245 correspond to steps 211, 213, 217, 221, and 223 in process 210, respectively. For details, please refer to the corresponding descriptions in process 210. In the example shown in process 220, the lengths of the first and second sequences to be encoded are different. For example, the length of the first sequence to be encoded (which can be denoted as N1) is less than the length of the second sequence to be encoded (which can be denoted as N2). After obtaining the first and second sequences to be encoded, at step 235, the network device 103 can extend the length of the first sequence to be encoded to the length of the second sequence to be encoded. At step 237, the network device 103 performs a crossover operation (i.e., an example of the second crossover operation described above) between the extended sequence of the first sequence to be encoded and the second sequence to be encoded, thereby obtaining the third sequence to be encoded.
[0097] At 241, network device 103 maps the encoded bit sequence to a first time-frequency resource and a second time-frequency resource based on a first mapping method to output the encoded bit sequence. The first mapping method, for example, maps the encoded bit sequence to the corresponding time-frequency resource according to the time-frequency resource corresponding to the information bit indicated in the third sequence to be encoded obtained through the first cross-operation.
[0098] In the above process 210 or 220, the first crossover operation is performed at the encoding end, such as the network device side. Afterwards, the encoding end transmits the encoded bit sequence through the channel, and the decoding end receives the information to be decoded corresponding to the encoded bit sequence. The decoding end can receive the information to be decoded from different time-frequency resources, such as the first information to be decoded and the second information to be decoded. The first information to be decoded and the second information to be decoded are, for example, sequences received at the receiving end (i.e., the decoding end) after the encoded bit sequence has undergone modulation, mapping to the first and second time-frequency resources, and channel transmission, and can be referred to as the first sequence to be decoded and the second sequence to be decoded, respectively. Crossover operation of two sequences (such as the first crossover operation and the second crossover operation mentioned above) refers to arranging a certain number of bits from two sequences together at intervals to form a new sequence, wherein a set of bits (greater than or equal to 1) from one of the two sequences is adjacent to a set of bits (greater than or equal to 1) from the other sequence in the new sequence. The sum of the number of bits in the two adjacent sets of bits (from the two sequences respectively) in the new sequence can be called the crossover interval. For example, if two sequences are arranged with a 1-bit interval, then one bit from the other sequence is inserted between any two adjacent bits of one sequence. This results in a new sequence where each pair of adjacent bits contains one bit, and the two pairs of bits come from the two sequences respectively. In this example, the cross-interval is 2. Another example is an arrangement with a 128-bit interval. Then, a consecutive 64 bits from one sequence are inserted between any two consecutive 64 bits of the other sequence. In the resulting new sequence, a pair of 64 bits from one sequence is adjacent to a pair of 64 bits from the other sequence. In this example, the cross-interval is 128.
[0099] As mentioned above, in some examples, the sequence to be encoded is obtained from a construct sequence. For example, the first sequence to be encoded is obtained from the first construct sequence, and the second sequence to be encoded is obtained from the second construct sequence. Performing a first crossover operation on the first and second sequences to be encoded yields the third sequence to be encoded. The following examples illustrate how the third sequence to be encoded is specifically generated.
[0100] In the following examples, the first number of information bits K1 is an example of the first number of information bits carried by the first time-frequency resource. The second number of information bits K2 is an example of the second number of information bits carried by the second time-frequency resource. The length of the encoded master code is denoted as Nm, and the value of Nm can be 512, or other powers of 2 such as 128, 256, 1024, etc. The following examples use an encoded master code length of Nm = 512. The interleaving in the following examples is also called bit interleaving. The constructed sequence infoBitsPos1 is an example of the first constructed sequence. The constructed sequence infoBitsPos2 is an example of the second constructed sequence. The lengths of the first constructed sequence and the first sequence to be encoded are denoted as N1, and the lengths of the second constructed sequence and the second sequence to be encoded are denoted as N2. The following explanation uses N1 = N2 as an example. It should be noted that in some other examples, N1 can be greater than or less than N2. In some of the following examples, N1 = N2 = Nm = 512 is used as an example.
[0101] Additionally, it should be noted that E=432 shown in the attached figures of some examples below represents the number of encoded bits corresponding to the respective time-frequency resource, which is the number of bits after puncturing. Figure 3 For example, E=432 in 301 indicates that the number of encoded bits for the first time-frequency resource is 432 (i.e., if N1=512, E=432 is obtained by punching 80 bits). E=432 in 302 indicates that the number of encoded bits for the second time-frequency resource is 432 (i.e., if N2=512, E=432 is obtained by punching 80 bits). Figure 5 , Figure 7 , Figure 9 , Figure 13 The meaning of E=432 is similar and will not be explained in detail below. The total number of encoded bits corresponding to the first and second time-frequency resources is equal to the rate matching length. The information position indicator is used to indicate whether a position in the corresponding constructed sequence is used to place information bits. The value of the information position indicator is 0 or 1. If a position in the constructed sequence is used to place information bits, the bit value at that position is 1; otherwise, it is 0. Index is the bit index, which takes values from 0 to 1023 or from 1 to 1024. The total length of the corresponding bits is 1024, which is the length of the third sequence to be encoded (equal to the length of the third constructed sequence in some examples). Figure 3For example, gray and white bars are alternated, where gray bars indicate the presence of bits in the corresponding sequence to be encoded at that position, and white bars indicate the absence of bits in the corresponding sequence at that position. The positions of the gray bars in sequence 302 (corresponding to the second sequence to be encoded) correspond to the positions of the white bars in sequence 301 (corresponding to the first sequence to be encoded). Based on this correspondence, the gray bars in sequence 302 are used to fill the positions of the white bars in sequence 301 (i.e., the corresponding white bars in sequence 301 are replaced with gray bars from sequence 302), thus combining the two sequences to be encoded into a single long sequence, which is the third sequence to be encoded.
[0102] The constructed sequence (e.g., first constructed sequence, second constructed sequence, etc.) is an indicator sequence of information bits generated based on the reliability sequence. For example, taking the first number of information bits K1 as an example, the K1 positions with the highest reliability in the reliability sequence (e.g., 4, 6, 7, 8, ...) can be used to place these K1 information bits, and the other positions can be used to place frozen bits. In this case, the positions used to place the information bits in the constructed sequence are set to 1, for example, the positions 4, 6, 7, 8, ... are set to 1. In some examples, these K1 positions can be the K1 positions with high reliability selected after removing the rate matching positions. Based on the constructed sequence, the sequence to be encoded is obtained. After encoding the sequence to be encoded, the encoded bit sequence (or encoded bit sequence, or codeword sequence) is obtained. The bit sequence to be encoded is the sequence of length N3 before encoding, obtained by inserting N3-K frozen positions into K information bits according to the indication of the constructed sequence (containing K 1s to indicate the positions of the K information bits). Taking K=4 as an example, that is, the number of information bits is 4, the 4 information bits are [0,1,1,0], the number of encoding bits is 8, and the construction sequence with a length of 8 bits is [0 0 0 1 0 1 1 1]. The information bits are placed at the positions of 1 in the construction sequence, that is, [0,1,1,0] are placed at the positions of 1 in the construction sequence, so the sequence to be encoded is [0 0 0 0 0 1 10]. Then the sequence of bits to be encoded is encoded to obtain the codeword sequence [0,1,1,0,0,1,1,0].
[0103] In some examples, the encoder obtains the number of first information bits K1 and the number of second information bits K2, as well as the length of the encoded master code Nm, for example, K2 = 48, Nm = 512. The value of K1 is related to K2. For example, K1 can be valued as follows: K1 = 8:8:K2, which means that K1 is determined from 8 bits (i.e., in 1-byte granularity) to K2 (=48), with an interval of 8. As shown in Table 1, the value of K1 ranges from 8 to 48, and the interval between adjacent K1 values is 8. Alternatively, instead of the above 1-byte granularity method, it can be in 1-bit granularity (or in other bit value granularity), for example, K1 can be {8,9,10,…,K2}.
[0104] Table 1
[0105] K1 K2 L 8 48 7 16 48 5 24 48 1 32 48 1 40 48 1 48 48 1
[0106] As shown in Table 1, the first column represents the number of first information bits K1, the second column represents the number of second information bits K2, and the third column represents the parameter L that determines the crossover method. The larger L is, the larger the crossover interval between the two sequences to be encoded (i.e., the first sequence to be encoded and the second sequence to be encoded), that is, the larger the interval between the elements in two adjacent sequences to be encoded in the longer sequence to be encoded (i.e., the third sequence to be encoded). For example, L = 7 means that the two sequences to be encoded (i.e., the first sequence to be encoded and the second sequence to be encoded) are crossed with an interval of 2. 7 =128 crossover, meaning the crossover interval is 128. For example, L=1 means crossing two sequences to be encoded (i.e., the first sequence to be encoded and the second sequence to be encoded) with an interval of 2. 1 =2 crosses.
[0107] In Example 1, as shown in the first row of Table 1, K1 = 8, K2 = 48, and the length of the first sequence to be encoded corresponding to 301 is N1 (N1 = Nm = 512). This first sequence contains K1 information bits and can be obtained from the first constructed sequence, i.e., the infoBitsPos1 sequence. The length of the second sequence to be encoded corresponding to 302 is N2 (N2 = Nm = 512), and this second sequence contains K2 information bits and can be obtained from the second constructed sequence, i.e., the infoBitsPos2 sequence. For example... Figure 3 As shown, based on the ratio of K1 to K2, two short sequences to be encoded (the first sequence to be encoded and the second sequence to be encoded) can be concatenated into a long sequence to be encoded (the third sequence to be encoded). Figure 4A comparative diagram is shown, illustrating the performance of constructing Polar codes using long sequences in some embodiments of this disclosure (corresponding to 401) and the performance of constructing Polar codes using long sequences in some schemes (corresponding to 402, the best achievable target performance). The horizontal axis represents the signal-to-noise ratio EsN0 in dB, and the vertical axis represents the block error rate (BLER); a lower curve indicates better performance. For Figure 4 The ratio of K1 to K2 is, for example, K1:K2 = 1:6. The decoding performance is close to that based on the decoding performance of using a real long code, so that a powerful terminal can obtain better decoding performance. At the same time, the long code sequence to be encoded in this embodiment is obtained from the short code sequence to be encoded. For a weak terminal, the second code sequence to be encoded can be used directly without punching holes in the long sequence, which has better rate matching performance. Figure 4 The N=864 shown represents the number of encoded bits corresponding to the first and second time-frequency resources, which is the number of bits after the encoded bit sequence has been punctured. Figure 6 , Figure 8 , Figures 10-12 , Figures 14-19 The meaning of N=864 is similar and will not be explained in detail below.
[0108] In Example 2, as shown in the second row of Table 1, for example, K1 = 16, K2 = 48. The best performance corresponds to L = 5, which means that the two 512-bit sequences to be encoded (i.e., the length of the first sequence to be encoded N1 and the length of the second sequence to be encoded N2 are both equal to Nm, for example, 512) are separated by an interval of 2. 5 =32 crossover, meaning the crossover interval is 32. For example... Figure 5 As shown in Figure 501, the first sequence to be encoded, with a length of N1 (N1 = Nm = 512), contains K1 information bits. The second sequence to be encoded, with a length of N2 (N2 = Nm = 512), contains K2 information bits. Thus, when K1:K2 = 1:3, a cross-interval of 32 between the two short sequences to be encoded (the first sequence to be encoded and the second sequence to be encoded) can achieve good performance. Figure 6 This diagram illustrates a comparison of the performance of constructing Polar codes using long sequences in some embodiments of this disclosure (corresponding to 601) with the performance of constructing Polar codes using long sequences in some schemes (corresponding to 602, the best achievable target performance). The horizontal axis represents the signal-to-noise ratio EsN0 in dB, and the vertical axis represents BLER; a lower curve indicates better performance. Figure 6 As shown, when K1:K2 = 1:3, the ratio is less than 1 / 2, and the decoding performance is close to that of using a true long code.
[0109] In Example 3, as shown in the third row of Table 1, K1 = 24, K2 = 48, and the best performance corresponds to L = 1, which means that two sequences to be encoded with a length of 512 (i.e., the lengths of the first sequence to be encoded, N1, and the second sequence to be encoded, N2, are both equal to Nm, for example, 512) are encoded through an interval of 2. 1 =2 crossings, meaning the crossing interval is 2. For example... Figure 7 As shown in Figure 701, the first sequence to be encoded, with a length of N1 (N1 = Nm = 512), contains K1 information bits, and the second sequence to be encoded, with a length of N2 (N2 = Nm = 512), contains K2 information bits. L = 1 represents the two sequences to be encoded, each with a length of Nm (512 bits), being spaced 2 bits apart. 1 =2 crossing, that is, odd-even interval crossing, such as Figure 7 As shown, the two sequences to be encoded, corresponding to 701 and 702, are interleaved according to odd and even numbers to obtain a long sequence to be encoded of length 2Nm. Figure 8 This diagram illustrates a comparison of the performance of constructing Polar codes using long sequences in some embodiments of this disclosure (corresponding to 801) with the performance of constructing Polar codes using long sequences in some schemes (corresponding to 802, the best achievable target performance). The horizontal axis represents the signal-to-noise ratio EsN0 in dB, and the vertical axis represents BLER; a lower curve indicates better performance. Example 3 demonstrates that when K1:K2 = 1:2, using an even-odd interval for the crossover of the two short sequences to be encoded achieves good performance.
[0110] In Example 4, in some examples, K1 equals one of 32, 40, or 48, K2 = 48, and Nm = 512. It can be observed that when K1:K2 > 1:2, using an insertion method with an odd-even interleaving interval of 2 yields better performance. That is, in examples where K1 equals 32, 40, or 48, the best performance corresponds to L = 1, meaning that the first sequence to be encoded and the second sequence to be encoded are interleaved with an interval of 2. 1 =2 crossover. Taking the fourth row of Table 1 as an example, such as Figure 9 As shown in Figure 901, the first sequence to be encoded, with a length of N1 (N1 = Nm = 512), contains K1 information bits. The second sequence to be encoded, with a length of N2 (N2 = Nm = 512), contains K2 information bits. These two 512-bit sequences can be interleaved using parity to obtain a 1024-bit long sequence to be encoded (i.e., the third sequence to be encoded). When K1 equals 32, 40, or 48, and K2 = 48, using parity intervals for the interleaving of the first and second sequences to be encoded can achieve better performance. Figure 10 , 11As shown in Figures 1 and 12, the performance of constructing Polar codes using long sequences in some embodiments of this disclosure corresponds to 1001, 1101, or 1201, respectively. The performance of constructing Polar codes using long sequences in some schemes corresponds to 1002, 1102, or 1202 (the best achievable target performance). The horizontal axis represents the signal-to-noise ratio (SNR) EsN0 in dB, and the vertical axis represents BLER. A lower curve indicates better performance; that is, in the example where K2 = 48, the decoding performance is better in the example where K1 = 32 compared to the decoding performance in the examples where K1 = 40 or 48. Through these examples, it is possible to generate long sequences to be encoded using an odd-even interval crossover method when K1:K2 > 1:2.
[0111] The examples above use K2=48 as an example. The performance comparison diagram above illustrates the construction of Polar codes using long sequences in some embodiments of this disclosure and long sequences in some other schemes, with K2=48 and K1 taking different values. Figure 4 , Figure 6 , Figure 8 , Figures 10-12 As shown in Table 2. In other examples, K2 = 56, and K1 can be determined based on K2 = 56 in the same way as determined above.
[0112] Table 2
[0113] K1 K2 L 8 56 8 16 56 6 or 7 24 56 1 or 3 32 56 1 40 56 1 48 56 1 56 56 1
[0114] In the example where K2 = 56 bits, for different ratios of K1:K2, when K1:K2 > 1:2, the optimal way to interleave the two short sequences to be encoded (i.e., the first sequence to be encoded and the second sequence to be encoded) is odd-even interleaving. For example, when K1 = 56 and K2 = 56, the best performance is L = 1, which means interleaving the two sequences to be encoded with a length of Nm (e.g., 512) with an interval of 2. 1 =2 crosses. For example... Figure 13 As shown, the first sequence to be encoded, with a length of Nm, corresponding to 1301, contains K1 information bits, and the second sequence to be encoded, with a length of Nm, corresponding to 1302, contains K2 information bits. A performance comparison diagram of constructing Polar codes using long sequences in some embodiments of this disclosure and long sequences in some schemes is shown below, with K2 = 56 and K1 taking different values. Figures 14-19 As shown. In some embodiments of this disclosure, the performance of constructing Polar codes using long sequences corresponds to 1401, 1501, 1601, 1701, 1801, and 1901, respectively. In other schemes, the performance of constructing Polar codes using long sequences corresponds to 1402, 1502, 1602, 1702, 1802, and 1902, respectively. Figures 14-19where the horizontal axis represents the signal-to-noise ratio EsN0 in dB, and the vertical axis represents BLER. The lower the curve, the better the performance. As K2 increases, when K1:K2 is greater than or equal to 1:2, the interleaving in the odd-even interval manner still provides better performance. It can be seen from the above respective graphs that as K1:K2 increases, the decoding performance at the decoding end is closer to the decoding performance of a real long code (which is not obtained by interleaving two short sequences). In other words, when K1 is less than K2, the closer the value of K1 is to the value of K2, the better the decoding performance at the decoding end.
[0115] In some of the foregoing examples, the description is given by taking an example in which the length N1 of the first to-be-encoded sequence is equal to the length N2 of the second to-be-encoded sequence. In some other examples, N1 may not be equal to N2. In such examples, the shorter one of N1 and N2 that are not equal can be extended to the length of the longer one, so as to obtain two short to-be-encoded sequences of equal length, and then the operation of obtaining one long to-be-encoded sequence by interleaving based on the two equal-length short to-be-encoded sequences as described above is performed. The following description is given by taking N1<N2 as an example, and the case where N1>N2 may also be implemented by referring to a similar manner as follows.
[0116] In the example where N1<N2, the length of the first to-be-encoded sequence is extended by padding N2-N1 zeros at the front, so that the extended sequence length of the first to-be-encoded sequence is equal to N2. Then, according to the ratio of K1 and K2, the extended sequence of the first to-be-encoded sequence and the second to-be-encoded sequence are interleaved in the interleaving manner indicated by L, to obtain the final long to-be-encoded sequence. In such an example, referring to Table 2, under different K1:K2 ratios, when K1:K2>1:2, the optimal manner for interleaving the two to-be-encoded sequences (one of which is obtained by the above operation of extending the length) is odd-even interleaving. In this way, the solution of the embodiments of the present application is also applicable when the two short to-be-encoded sequences have unequal lengths.
[0117] In other examples where N1 is not equal to N2, instead of padding with zeros to extend the shorter sequence to be encoded as described above, the N1-length sequence to be encoded can be copied to extend its length to N2. For example, with N1 = 256 bits and N2 = 512 bits, the N1-length sequence to be encoded is copied twice, and then a 2N1 (= N2)-length sequence to be encoded is obtained through parity-even cross-multiplication. Finally, the information identifiers at the K1 positions with the largest indices are retained, resulting in the extended sequence to be encoded. In this way, two short sequences to be encoded of unequal length (the first sequence to be encoded and the second sequence to be encoded) are used to obtain two short sequences to be encoded of equal length (e.g., the extended sequence of the first sequence to be encoded and the second sequence to be encoded), and then cross-multiplication is performed as described above to obtain a long sequence to be encoded (i.e., the third sequence to be encoded). The information identifier in the sequence to be encoded represents the bit with a value of 1 in the corresponding constructed sequence, which is used to indicate whether an information bit is placed at that position. The index of the information identifier is used to indicate the position of the information identifier in the sequence to be encoded.
[0118] Based on the foregoing examples, the embodiments of the present application may obtain one long to-be-encoded sequence from two short to-be-encoded sequences in multiple manners. In some examples, the interleaving manner for the first to-be-encoded sequence and the second to-be-encoded sequence is determined according to the number K1 of information bits carried by the first to-be-encoded sequence and the number K2 of information bits carried by the second to-be-encoded sequence. For example, in an example where the length of the first to-be-encoded sequence is N1, the length of the second to-be-encoded sequence is N2, and N1=N2=Nm, how to generate the long to-be-encoded sequence is determined according to the ratio of K1:K2 in the following first manner or second manner. In the first manner, when K1≥K2 / 2, the first to-be-encoded sequence and the second to-be-encoded sequence are mapped in an odd-even interval manner. In the second manner, when K1<K2 / 2, the interval M between the first to-be-encoded sequence and the second to-be-encoded sequence satisfies M>Nm / 2, and M takes a value of a power of 2. In an example where the length of the first to-be-encoded sequence is N1, the length of the second to-be-encoded sequence is N2, and N1<N2, how to generate the long to-be-encoded sequence is determined according to the ratio of K1:K2 in the following manner. The length of the to-be-encoded sequence of length N1 needs to be extended to N2 first. One extension manner is to extend the first to-be-encoded sequence of length N1 to N2, for example, pad N2-N1 zeros in front of the first to-be-encoded sequence of length N1, to obtain two to-be-encoded sequences of length N2 (one of the to-be-encoded sequences of length N2 is obtained by zero-padding the first to-be-encoded sequence of length N1, and the other is the second to-be-encoded sequence), and then interleave the two to-be-encoded sequences of length N2 according to the following rule, to obtain one long to-be-encoded sequence (that is, the third to-be-encoded sequence) with a length of 2N2. The interleaving rule is, for example, when K1≥K2 / 2, map the extended sequence (with a length of N2) of the first to-be-encoded sequence and the second to-be-encoded sequence in an odd-even interval manner. When K1<K2 / 2, the interval M between the extended sequence of the first to-be-encoded sequence and the second to-be-encoded sequence satisfies M>N / 2. Another extension manner is to copy the first to-be-encoded sequence of length N1 into two copies (for example, N1 is equal to one half of N2), then obtain a to-be-encoded sequence of length 2N1 (=N2) through odd-even interleaving, and finally retain the information identifiers at the K1 positions with the largest indexes, to obtain the final to-be-encoded sequence.
[0119] In some examples, the foregoing K1 may include L3 CRC bits, K2 may include L4 CRC bits, K1 is less than or equal to K2, and L3 is less than or equal to L4.
[0120] Some examples, based on the number of information bits carried by different time-frequency resources or the number of information bits required for decoding by terminal devices with different capabilities, such as K1 and K2, generate long sequences to be encoded (referred to as long sequences) based on short sequences to be encoded (referred to as short sequences). This is applicable to various situations where the two short sequences that generate the long sequence have the same or different lengths. The closer the ratio of information bit counts K1 and K2, the closer the distance between the elements in the two short sequences in the long sequence. The greater the difference in the ratio of information bit counts K1 and K2, the farther the distance between the elements in the two short sequences in the long sequence. A codeword bit concatenation method is proposed, which concatenates an Nm-length codeword encoded by a first sequence to be encoded and an Nm-length codeword encoded by a second sequence to be encoded according to the Polar coding structure to obtain a codeword twice the length of Nm. This solves the problem of how to construct a long Polar code from short sequences based on different information bit lengths, while simultaneously meeting the needs of low-capability devices using short sequences for decoding and the needs of high-capability devices using long sequences for decoding to obtain better decoding performance. Longer code lengths require longer sequences to construct Polar codes, resulting in greater channel coding gain and better decoding performance. For low-cost (low-capacity) devices, shorter sequences lead to shorter Polar code lengths, thus achieving lower decoding complexity. The implementation method of this application improves decoding performance based on short sequences and enhances sequence error correction performance.
[0121] Figure 20 Flowcharts illustrating implementation at the encoding end in some embodiments of this disclosure are shown. The encoding end performing process 2000 is, for example, a network device (e.g., network device 103), or a chip, module, or assembly within the network device, specifically a base station or a chip, module, or assembly within a base station. In some examples, the chip, module, or assembly may be located within the network device or other devices. The following description uses a network device as an example. In block 2010, the network device determines a first sequence to be encoded based on a first number of information bits carried by a first time-frequency resource. In block 2020, the network device determines a second sequence to be encoded based on a second number of information bits carried by a second time-frequency resource. In block 2030, the network device performs a first crossover operation on the first and second sequences to be encoded based on the numerical relationship between the first and second numbers to obtain a third sequence to be encoded. In block 2040, the network device performs polar coding based on the third sequence to be encoded to obtain an encoded bit sequence. In block 2050, the network device outputs the encoded bit sequence. In some embodiments, process 2000 may also include elements combined with embodiments of this disclosure. Figures 2A to 19Other operations described are performed at the encoding end or network device. In the embodiments of this disclosure, the execution order of determining the first sequence to be encoded and determining the second sequence to be encoded is not limited to the order or step numbers shown in the block diagram, and similar situations in other examples are not described one by one herein.
[0122] Figure 21 Flowcharts illustrating implementation at the decoding end in some embodiments of this disclosure are shown. The decoding end executing process 2100 may be a terminal device (e.g., terminal device 101, an example of a powerful terminal device), or a chip, module, or assembly within the terminal device. Specifically, it may be a terminal device or a chip, module, or assembly within a terminal device. In some examples, the chip, module, or assembly may be located within the terminal device or other devices. The following description uses a terminal device as an example. In block 2110, the terminal device receives information to be decoded on a first time-frequency resource and a second time-frequency resource. In block 2120, the terminal device decodes the information to be decoded according to a set of information bit positions to obtain a decoded bit sequence. The set of information bit positions includes information bit positions in a third sequence to be encoded. The third sequence to be encoded is a sequence obtained by a first cross-operation on the first and second sequences to be encoded, based on the numerical relationship between a first number and a second number. The first sequence to be encoded is determined based on a first number of information bits carried by the first time-frequency resource, and the second sequence to be encoded is determined based on a second number of information bits carried by the second time-frequency resource. In some embodiments, process 2100 may also include elements combined with embodiments of this disclosure. Figures 2A to 19 Other operations described that are performed at the decoding end or terminal device.
[0123] Figure 22Flowcharts illustrating implementations at the decoding end in some other embodiments of this disclosure are shown. The decoding end executing process 2200 may be a terminal device (e.g., terminal device 101, an example of a powerful terminal device), or a chip, module, or assembly within the terminal device. Specifically, it may be a terminal device or a chip, module, or assembly within a terminal device. In some examples, the chip, module, or assembly may be located within the terminal device or other devices. The following description uses a terminal device as an example. In block 2210, the terminal device receives first information to be decoded on a first time-frequency resource. In block 2220, the terminal device receives second information to be decoded on a second time-frequency resource. In block 2230, the terminal device concatenates the first and second information to be decoded to obtain third information to be decoded. In block 2240, the terminal device decodes the third information to be decoded according to the information bit position set to obtain a decoded bit sequence. The information bit position set includes the information bit positions in the third constructed sequence. The third constructed sequence is a sequence obtained by performing a fourth crossover operation on the first and second constructed sequences based on the numerical relationship between a first number and a second number. The first constructed sequence is determined based on the first number of information bits carried by the first time-frequency resource, and the second constructed sequence is determined based on the second number of information bits carried by the second time-frequency resource. In one example, the numerical relationship can be a proportional relationship or a difference relationship, as described in the above embodiments. The information to be decoded can be a sequence to be decoded; for example, the first information to be decoded can be a first sequence to be decoded, and the second information to be decoded can be a second sequence to be decoded. In some embodiments, the fourth crossover operation performed at the decoding end in process 2200 can be combined with the embodiments of this disclosure. Figures 2A to 19 The first crossover operation described is implemented at the encoding end. The difference between the two is that the first crossover operation targets bits in the sequence to be encoded, while the fourth crossover operation targets bits in the constructed sequence.
[0124] In some examples, the encoding process 2000 described above can be combined with the decoding process 2100 described above to form a complete encoding / decoding process. In other examples, the encoding process 2000 described above can be combined with the decoding process 2200 described above to form a complete encoding / decoding process. In still other examples, the decoding process 2100 or 2200 described above can be combined with an encoding process different from process 2000 described above to form a complete encoding / decoding process. An encoding process different from process 2000 may, for example, omit the aforementioned cross-operation on the encoding side and instead encode the first and second sequences to be encoded separately. See the description of the encoding side implementation in "Other Examples Different from the Encoding Side Example Described in Process 210" above for details.
[0125] Figure 23 This is a block diagram that can be used to implement device 2300 according to some embodiments of this application. In some embodiments, device 2300 may be a component of a communication network infrastructure, such as a base station (e.g., a NodeB, an evolved NodeB (eNodeB or eNB), a next-generation NodeB (sometimes called a next-generation NodeB, gNodeB or gNB), a home subscriber server (HSS), a gateway (GW), such as a packet gateway (PGW) or a serving gateway (SGW), or various other nodes or functions within a core network (CN) or public land mobility network (PLMN). In other embodiments, device 2300 may be a device connected to the network infrastructure via a wireless interface, such as a mobile phone, a smartphone, or other such device that can be classified as user equipment (UE). In some embodiments, device 2300 may be a machine-type communications (MTC) device (also known as a machine-to-machine (M2M) device), or another such device that, although not providing direct service to a user, can be classified as a UE. In some embodiments, device 2300 may be a roadside unit. The device 2300 can be classified as a mobile unit (RSU), vehicle UE (V-UE), pedestrian UE (P-UE), or infrastructure UE (I-UE). In some scenarios, the device 2300 may also be referred to as a mobile device, a term intended to reflect a device connected to a mobile network, regardless of whether the device itself is designed for or capable of being mobile. A particular device may utilize all or only a subset of the components shown, and the level of integration may vary depending on the device. Furthermore, the device 2300 may contain multiple instances of components, such as multiple processors, memory, transmitters, receivers, etc.
[0126] Device 2300 typically includes a processor 2302, such as a central processing unit (CPU), and may further include a dedicated processor, such as a graphics processing unit (GPU) or other such processor, memory 2304, a network interface 2306, and a bus 2308 for connecting the components of device 2300. Optionally, device 2300 may also include components such as a mass storage device 2310, a video adapter 2312, and an I / O interface 2316 (shown in dashed lines).
[0127] Memory 2304 may include any type of non-transitory system memory readable by processor 2302, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous DRAM (SDRAM), read-only memory (ROM), or combinations thereof. In one embodiment, memory 2304 may include more than one type of memory, such as ROM used at startup and DRAM used for program and data storage during program execution. Bus 2308 may be one or more of a plurality of bus architectures of any type, including a memory bus or memory controller, a peripheral bus, or a video bus.
[0128] Device 2300 may also include one or more network interfaces 2306, which may include at least one of wired network interfaces and wireless network interfaces. For example... Figure 23 As shown, network interface 2306 may include a wired network interface for connecting to network 2322, and may also include a wireless access network interface 2320 for connecting to other devices via a wireless link. When device 2300 is a network infrastructure element, the wireless access network interface 2320 may be omitted for nodes or functions that are elements of a PLMN rather than elements at the wireless edge. When device 2300 is infrastructure at the wireless edge of the network, it may include both wired and wireless network interfaces. When device 2300 is a wirelessly connected device, such as a user equipment, the wireless access network interface 2320 may be present and may be supplemented by other wireless interfaces such as a WiFi network interface. Network interface 2306 allows device 2300 to communicate with remote entities such as those connected to network 2322.
[0129] Mass storage 2310 may include any type of non-transitory storage device configured to store data, programs, and other information and make the data, programs, and other information accessible via bus 2308. Mass storage 2310 may include, for example, one or more of a solid-state drive, hard disk drive, disk drive, or optical disk drive. In some embodiments, mass storage 2310 may be located remotely from device 2300 and may be accessed using a network interface such as interface 2306. In the illustrated embodiment, mass storage 2310 differs from the memory 2304 that includes it, and mass storage 2310 typically performs storage tasks compatible with higher latency but typically provides low or no fluctuation. In some embodiments, mass storage 2310 may be integrated with heterogeneous memory 2304.
[0130] Optional video adapter 2312 and I / O interface 2316 (shown in dashed lines) provide interfaces for coupling device 2300 to external input and output devices. Examples of input and output devices include a display 2314 coupled to video adapter 2312 and an I / O device 2318, such as a touchscreen, coupled to I / O interface 2316. Other devices may be coupled to device 2300 and may utilize additional or fewer interfaces. For example, a serial interface such as Universal Serial Bus (USB) (not shown) may be used to provide interfaces for external devices. Those skilled in the art will understand that in embodiments where device 2300 is part of a data center, I / O interface 2316 and video adapter 2312 may be virtualized and provided via network interface 2306.
[0131] Figure 24 This is a schematic diagram of the structure of a device 2400 according to some embodiments of this application. For example... Figure 24 As shown, the device 2400 includes a first determining unit 2401, a second determining unit 2402, a cross-connect unit 2404, an encoding unit 2406, and an output unit 2408. The device 2400 can be applied to applications such as... Figure 1 The communication system shown can implement the methods provided in the preceding embodiments, such as the method shown in flowchart 2000. Optionally, the physical manifestation of device 2400 can be a communication device, such as the first device or network device 103. Alternatively, device 2400 can be other devices capable of implementing the functions of a communication device, such as a processor or chip inside the communication device. Specifically, device 2400 can be a programmable chip, such as an FPGA, a complex programmable logic device (CPLD), an ASIC, or a SOC.
[0132] In some embodiments, the first determining unit 2401 can be configured to determine a first sequence to be encoded based on a first number of information bits carried by a first time-frequency resource. The second determining unit 2402 can be configured to determine a second sequence to be encoded based on a second number of information bits carried by a second time-frequency resource. The crossover unit 2404 can be configured to perform a first crossover operation on the first sequence to be encoded and the second sequence to be encoded based on the numerical relationship between the first number and the second number, to obtain a third sequence to be encoded. The encoding unit 2406 can be configured to perform polar coding based on the third sequence to be encoded, to obtain an encoded bit sequence. The output unit 2408 can be configured to output the encoded bit sequence.
[0133] In some embodiments, the apparatus 2400 may include various other units or modules that can be configured to perform the various operations or functions described with respect to the foregoing method embodiments. Specific details can be obtained by referring to the detailed description of the foregoing method embodiments, and will not be repeated here.
[0134] Figure 25 This is a schematic diagram of the structure of the device 2500 according to other embodiments of this application. For example... Figure 25 As shown, the device 2500 includes a receiving unit 2502 and a decoding unit 2504. The device 2500 can be applied to applications such as... Figure 1 The communication system shown can implement the methods provided in the preceding embodiments, such as the method shown in process 2100. Optionally, the physical manifestation of device 2500 can be a communication device (e.g., a decoding device), such as terminal device 101, which can be a UE, etc., and can be an example of a powerful terminal device. Alternatively, device 2500 can be other devices capable of implementing the functions of a communication device, such as a processor or chip inside a communication device. Specifically, device 2500 can be a programmable chip, such as an FPGA, CPLD, ASIC, or SOC, etc.
[0135] In some embodiments, the receiving unit 2502 may be configured to receive information to be decoded on a first time-frequency resource and a second time-frequency resource. The decoding unit 2504 may be configured to decode the information to be decoded according to an information bit position set to obtain a decoded bit sequence. The information bit position set includes the information bit positions in a third sequence to be encoded. The third sequence to be encoded is a sequence obtained by a first crossover operation between the first sequence to be encoded and the second sequence to be encoded, based on the numerical relationship between a first number and a second number. The first sequence to be encoded is determined based on a first number of information bits carried by the first time-frequency resource, and the second sequence to be encoded is determined based on a second number of information bits carried by the second time-frequency resource.
[0136] In some other embodiments, the apparatus 2500 may include various other units or modules that can be configured to perform the various operations or functions described with respect to the foregoing method embodiments. Specific details can be obtained by referring to the detailed description of the foregoing method embodiments, and will not be repeated here.
[0137] Figure 26 This is a schematic diagram of the structure of device 2600 according to other embodiments of this application. For example... Figure 26 As shown, the device 2600 includes a receiving unit 2602, a splicing unit 2604, and a decoding unit 2606. The device 2600 can be applied to applications such as... Figure 1 The communication system shown can implement the methods provided in the preceding embodiments, such as the method shown in process 2200. Optionally, the physical manifestation of device 2600 can be a communication device (e.g., a decoding device), such as terminal device 101, which can be a UE, etc., and can be an example of a powerful terminal device. Alternatively, device 2600 can be other devices capable of implementing the functions of a communication device, such as a processor or chip inside a communication device. Specifically, device 2600 can be a programmable chip, such as an FPGA, CPLD, ASIC, or SOC, etc.
[0138] In some embodiments, the receiving unit 2602 can be configured to receive first information to be decoded on a first time-frequency resource and second information to be decoded on a second time-frequency resource. The splicing unit 2604 can be configured to splice the first information to be decoded and the second information to be decoded to obtain a third information to be decoded. The decoding unit 2606 can be configured to decode the third information to be decoded according to an information bit position set to obtain a decoded bit sequence, wherein the information bit position set includes the information bit positions in the third sequence to be encoded, and the third sequence to be encoded is a sequence obtained by performing a first crossover operation on the first sequence to be encoded and the second sequence to be encoded based on the numerical relationship between a first number and a second number, wherein the first sequence to be encoded is determined based on a first number of information bits carried by the first time-frequency resource, and the second sequence to be encoded is determined based on a second number of information bits carried by the second time-frequency resource.
[0139] In some other embodiments, the apparatus 2600 may include various other units or modules that can be configured to perform the various operations or functions described with respect to the foregoing method embodiments. Specific details can be obtained by referring to the detailed description of the foregoing method embodiments, and will not be repeated here.
[0140] It should be noted that the module division in the above embodiments of this application is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods. Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, exist as separate physical units, or be integrated into one unit by two or more units. The integrated units described above can be implemented in hardware or as software functional units.
[0141] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, or all or part of it, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) or processor to execute all or part of the steps of the methods of the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, random access memory (RAM), magnetic disks, or optical disks.
[0142] Based on the above embodiments, this application also provides a computer program that, when run on a computer, causes the computer to execute any of the methods provided in the above embodiments.
[0143] Based on the above embodiments, this application also provides a computer-readable storage medium storing a computer program. When executed by a computer, the computer program causes the computer to perform any of the methods provided in the above embodiments. The storage medium can be any available medium that can be accessed by a computer. By way of example, but not limited to, a computer-readable medium may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code having the form of instructions or data structures and that can be accessed by a computer.
[0144] Based on the above embodiments, this application also provides a chip for reading a computer program stored in a memory and implementing any of the methods provided in the above embodiments.
[0145] Based on the above embodiments, this application provides a chip system including a processor for supporting a computer device in implementing the functions involved in the communication devices in the above embodiments. In one possible design, the chip system further includes a memory for storing necessary programs and data of the computer device. This chip system may be composed of chips or may include chips and other discrete components.
[0146] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
[0147] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.
[0148] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.
[0149] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable apparatus for implementation in a process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.
Claims
1. A method comprising: The first sequence to be encoded is determined based on a first number of information bits carried by the first time-frequency resource; The second sequence to be encoded is determined based on the second number of information bits carried by the second time-frequency resource; Based on the numerical relationship between the first number and the second number, a first crossover operation is performed on the first sequence to be encoded and the second sequence to be encoded to obtain a third sequence to be encoded. Polar coding is performed based on the third sequence to be encoded to obtain the encoded bit sequence; and Output the encoded bit sequence.
2. A method comprising: Receive the information to be decoded on the first and second time-frequency resources; as well as The information to be decoded is decoded according to the information bit position set to obtain a decoded bit sequence. The information bit position set includes the information bit positions in the third sequence to be encoded. The third sequence to be encoded is a sequence obtained by a first crossover operation between the first sequence to be encoded and the second sequence to be encoded based on the numerical relationship between the first number and the second number. The first sequence to be encoded is determined based on the first number of information bits carried by the first time-frequency resource, and the second sequence to be encoded is determined based on the second number of information bits carried by the second time-frequency resource.
3. The method according to claim 1 or 2, wherein performing the first crossover operation comprises: Based on the determination that the lengths of the first sequence to be encoded and the second sequence to be encoded are different, the length of the shorter sequence of the first sequence to be encoded and the second sequence to be encoded is extended to the length of the longer sequence of the two; as well as A second crossover operation is performed on the expanded sequence of the shorter sequence and the longer sequence.
4. The method of claim 3, wherein the extension includes: The shorter sequence is padded with zeros to obtain the extended sequence.
5. The method of claim 4, wherein padding the shorter sequence with zeros includes padding the shorter sequence with zeros at the beginning.
6. The method of claim 3, wherein the length of the longer sequence is twice the length of the shorter sequence. R A multiple, where R is an integer greater than or equal to 1, and the expansion includes: Copy the shorter sequence; A third crossover operation is performed based on the shorter sequence and the copied sequence to obtain a first sequence, wherein the length of the first sequence is equal to the length of the longer sequence. J*2 in the information bits of the first sequence R-1 The information bits are replaced with zero values to obtain the extended sequence, where J is equal to the number of information bits in the shorter sequence.
7. The method according to claim 6, wherein the J*2 R-1 The information bits are replaced with zero values, including: Replace all information bits in the first sequence except for the information bits at the J positions with the largest corresponding indices with zero values.
8. The method according to claim 1 or 2, wherein the first crossover operation comprises: Based on the determination that the first sequence to be encoded and the second sequence to be encoded have the same length, a second crossover operation is performed on the first sequence to be encoded and the second sequence to be encoded.
9. The method according to any one of claims 3-8, wherein performing the second crossover operation comprises: Based on the determination that the ratio of the first number to the second number is greater than or equal to the first ratio, the second crossover operation is performed with a crossover interval of 2 bits; or Based on the determination that the ratio of the first number to the second number is less than the first proportion, and according to a crossover interval of 2... L The bit performs the second crossover operation, where L is greater than 1.
10. The method of claim 9, wherein the first ratio is one-half.
11. The method of claim 9, wherein when the ratio of the first number to the second number is a first ratio, the cross interval is 2. L1 When the ratio of the first number to the second number of bits is the second ratio, the cross interval is 2. L2 Bits, wherein the first ratio is less than the second ratio, and L1 is greater than L2.
12. The method according to any one of claims 1 to 11, wherein at least one of the following: The first time-frequency resource is a time-frequency resource within the first receiving bandwidth of the terminal device with the first capability and outside the second receiving bandwidth of the terminal device with the second capability, wherein the first receiving bandwidth includes the second receiving bandwidth; or The second time-frequency resource is the time-frequency resource within the second receiving bandwidth of the terminal device with the second capability.
13. The method according to any one of claims 1, 3 to 12, wherein outputting the encoded bit sequence comprises: Based on the first mapping method, the encoded bit sequence is mapped to the first time-frequency resource and the second time-frequency resource, and the first mapping method is associated with the first crossover operation.
14. A communication device, comprising: Units or modules used to perform the method according to any one of claims 1 to 13.
15. A communication device, comprising: A processor is configured to cause the communication device to perform the method according to any one of claims 1 to 13 by executing a computer program stored in memory and / or by logic circuitry.
16. The communication device according to claim 15, characterized in that, It also includes the memory.
17. A computer-readable storage medium storing instructions that, when executed by a device, cause the device to perform the method according to any one of claims 1 to 13.
18. A computer program product comprising instructions that, when executed by a device, cause the device to perform the method according to any one of claims 1 to 13.
