Polar code based automorphism for soft-combining of multiple permuted codewords

Abstract

Certain aspects of the present disclosure provide techniques for soft combining of transmissions for polar coding. An example method performed at a network node generally includes obtaining a plurality of codeword permutations corresponding to different payloads, where the different payloads include a same first payload portion and second payload portions that differ in a deterministic manner, and each codeword permutation corresponds to one of the second payload portions; processing the plurality of codeword permutations to obtain the second payload portions; obtaining the first payload portion after obtaining the second payload portions; and soft combining the first payload portion.

Description

Cross-references to related applications

[0001] This application claims priority to U.S. Patent Application No. 18 / 606,274, filed March 15, 2024, which is incorporated herein by reference. Technical Field

[0002] Various aspects of this disclosure relate to wireless communication, and more specifically, to techniques for implementing soft combining of transmissions using polar coding.

[0003] Related technical descriptions Wireless communication systems are widely deployed to provide a variety of telecommunications services, such as telephone, video, data, messaging, broadcasting, or other similar services. These wireless communication systems may employ multiple access technologies that enable communication with several users by sharing available wireless communication system resources.

[0004] Despite significant technological advancements in wireless communication systems over the years, challenges remain. For example, complex and dynamic environments can still attenuate or block signals between wireless transmitters and receivers. Therefore, there is a continuous expectation for improving the technical performance of wireless communication systems, including, for example: improving communication speed and data carrying capacity; improving the efficiency of shared communication media; reducing the power used by transmitters and receivers during communication; improving the reliability of wireless communication; avoiding redundant transmission and / or reception and related processing; improving the coverage area of ​​wireless communication; increasing the number and types of devices that can access the wireless communication system; increasing the ability of different types of devices to communicate with each other; and increasing the number and types of available wireless communication media. Therefore, there is a need for further improvements to wireless communication systems to overcome the aforementioned technical challenges and other obstacles. Summary of the Invention

[0005] One aspect provides a method for wireless communication at a first wireless node. The method includes encoding different payloads using polar codes to generate a plurality of codeword permutations, wherein each of the different payloads includes a first payload portion that is identical for the different payloads and a second payload portion that differs deterministically among the different payloads, and each codeword permutation corresponds to a second payload portion within the second payload portion; and sequentially outputting the plurality of codeword permutations.

[0006] On the other hand, a method for performing wireless communication at a first wireless node is provided. The method includes obtaining a plurality of codeword permutations corresponding to different payloads, wherein the different payloads include the same first payload portion and second payload portions with different deterministic methods, and each codeword permutation corresponds to a second payload portion within the second payload portion; processing the plurality of codeword permutations to obtain the second payload portion; obtaining the first payload portion after obtaining the second payload portion; and performing soft combining on the first payload portion.

[0007] Other aspects provide: an apparatus capable of operating, being configured, or otherwise adapted to perform one or more of the foregoing methods and / or those methods described elsewhere herein; a non-transitory computer-readable medium comprising instructions that, when executed by one or more processors of the apparatus (e.g., directly, indirectly, after preprocessing, or without preprocessing), cause the apparatus to perform the foregoing methods and those methods described elsewhere herein; a computer program product embodied on a computer-readable storage medium comprising: code for performing the foregoing methods and those methods described elsewhere herein; and / or an apparatus comprising components for performing the foregoing methods and those methods described elsewhere herein. By way of example, an apparatus may include a processing system, a device having a processing system, or a processing system cooperating via one or more networks.

[0008] For illustrative purposes, the following description and figures illustrate certain features. Attached Figure Description

[0009] The accompanying drawings depict certain features of the various aspects described herein and should not be considered as limiting the scope of this disclosure.

[0010] Figure 1 An example wireless communication network is depicted.

[0011] Figure 2 An example decomposed base station architecture is described.

[0012] Figure 3 Various aspects of the example base station and example user equipment are described.

[0013] Figure 4A , Figure 4B , Figure 4C and Figure 4D Various example aspects of data structures used in wireless communication networks are described.

[0014] Figure 5 This is a block diagram illustrating the process related to polarization coding.

[0015] Figure 6 An example of polarization decoding is depicted.

[0016] Figure 7 An example of a received sample for the Physical Broadcast Channel (PBCH) is depicted.

[0017] Figure 8 A call flowchart for polarization decoding with soft merging, according to various aspects of this disclosure, is depicted.

[0018] Figure 9A , Figure 9B and Figure 9C Example permutation matrices are depicted according to various aspects of this disclosure.

[0019] Figure 10 Examples of information bit position constraints according to various aspects of this disclosure are depicted.

[0020] Figure 11 An example of codeword permutations generated sequentially according to various aspects of this disclosure is described.

[0021] Figure 12A An example physical broadcast channel (PBCH) structure according to various aspects of this disclosure is described, and Figure 12B An example decoding processing chain according to various aspects of this disclosure is described.

[0022] Figure 13 A method for wireless communication is described.

[0023] Figure 14 A method for wireless communication is described.

[0024] Figure 15 Various aspects of the example communication device are described. Detailed Implementation

[0025] Various aspects of this disclosure relate to wireless communication, and more specifically, to techniques for implementing soft combining of transmissions using polar coding.

[0026] Polar codes represent a relatively recent breakthrough in decoding theory, potentially aiding in the optimization of wireless channel transmission. For example, polar decoding has been shown to asymptotically (for code sizes N approaching infinity) achieve channel capacity (called Shannon capacity) for finite-bandwidth continuous-time channels subjected to Gaussian noise. Polar codes possess many desirable properties, such as deterministic construction (e.g., based on the Fast Hadamard Transform), very low and predictable error floor, and decoding based on simple successive elimination (SC). Their use in error correction in next-generation wireless systems, such as New Radio (NR), is currently under consideration.

[0027] Polar decoding allows the generation of codewords (e.g., by an encoder) by encoding multiple input bits consisting of K information bits and NK "frozen" bits, which contain no information and are "frozen" to known values ​​such as zero, using a generator matrix. For example, given multiple input bits u = (u0, u...) 1, ..., u N-1 The resulting codeword vector is x=(x0, x1, ..., x...). N-1 This can be achieved by using a generator matrix. G The input bits are encoded to generate the codeword. The resulting codeword can then be transmitted by the base station via a wireless medium and received by the UE.

[0028] Polar codes essentially transform a wireless channel into N parallel "virtual" channels for N information bits and frozen bits. If C is the channel capacity, then for sufficiently large values ​​of N, there are almost N*C very reliable channels and almost N(1 – C) very unreliable channels. The basic polar decoding scheme then involves freezing the input bits in u corresponding to the unreliable channels (i.e., setting them to known values, such as zero), while placing only the information bits in u corresponding to the reliable channels.

[0029] Soft combining is a feature that allows a receiver to combine multiple instances of received signals. This combining can help improve signal quality and increase the chance of successful decoding, even if some received instances are corrupted during transmission. Soft combining relies on the payload being identical in successive transmissions. Because portions of the payload change in successive transmissions, certain types of transmissions may not be ideal candidates for soft combining. For example, the Physical Broadcast Channel (PBCH) in NR has a payload with specific portions that change between transmissions. While polarization decoding can be used for PBCH transmissions (e.g., using fixed parameters, N=512, K=56, including a 24-bit checksum), the System Frame Number (SFN) included in the payload content (currently a 10-bit value) increments by 1 (modulo 1024) consecutively.

[0030] Unfortunately, the varying nature of the SFN portion of the PBCH payload poses a challenge to soft combining over several consecutive transmissions, as the UE may not know the starting value (of the SFN) in the received PBCH sample sequence. As a result, the UE may need to guess the starting point (of the SFN in the received sample) and perform several decoding attempts, which is inefficient and can lead to increased power consumption.

[0031] However, aspects of this disclosure provide a decoding scheme that facilitates the soft combining of multiple payloads, even when the payloads differ in the number of bits. For example, when the channel code is fixed and the payloads differ in a relatively small number of bits (e.g., SFN / counter bits), the decoding scheme proposed herein can help achieve the soft combining of multiple PBCH payloads. A periodically incrementing counter bit (before the flip) is an example of payload bits that can differ in a deterministic manner.

[0032] Specific aspects of the subject matter described in this disclosure can be implemented to achieve one or more of the following potential advantages. In some examples, the decoding scheme proposed herein can allow soft combining of PBCH transmissions delivered using polarization decoding. As a result, the decoding scheme proposed herein can help increase the chance of successful decoding while limiting blind decoding and the corresponding increase in processing overhead and power consumption.

[0033] An introduction to wireless communication networks The techniques and methods described herein can be used in a variety of wireless communication networks. While aspects may be described herein using terms commonly associated with 3G, 4G, and / or 5G wireless technologies, aspects of this disclosure are equally applicable to other communication systems and standards not explicitly mentioned herein.

[0034] Figure 1 An example of a wireless communication network 100 in which the aspects described herein can be implemented is depicted.

[0035] Generally, wireless communication network 100 includes various network entities (optionally, network elements or network nodes). Network entities are typically communication devices and / or communication functions performed by communication devices (e.g., user equipment (UE), base station (BS), components of the BS, servers, etc.). For example, various functions of the network and various devices associated with and interacting with the network can be considered network entities. Furthermore, wireless communication network 100 includes terrestrial aspects, such as terrestrial network entities (e.g., BS 102), and non-terrestrial aspects, such as satellite 140 and aircraft 145, which may include onboard network entities (e.g., one or more BSs) capable of communicating with other network elements (e.g., terrestrial BSs) and user equipment.

[0036] In the depicted example, wireless communication network 100 includes BS 102, UE 104 and one or more core networks (such as Evolved Packet Core (EPC) 160 and 5G Core (5GC) network 190) that interoperate to provide communication services over various communication links, including wired and wireless links.

[0037] Figure 1Various example UE 104s are described, which may more generally include: cellular phones, smartphones, Session Initiation Protocol (SIP) phones, laptops, personal digital assistants (PDAs), satellite radios, global positioning systems, multimedia devices, video devices, digital audio players, cameras, game consoles, tablet computers, smart devices, wearable devices, vehicles, electricity meters, air pumps, large or small kitchen appliances, healthcare devices, implants, sensors / actuators, displays, Internet of Things (IoT) devices, always-on (AON) devices, edge processing devices, or other similar devices. UE 104 may also be more generally referred to as mobile devices, wireless devices, wireless communication devices, stations, mobile stations, subscriber stations, mobile subscriber stations, mobile units, subscriber units, wireless units, remote units, remote devices, access terminals, mobile terminals, wireless terminals, remote terminals, mobile phones, and others.

[0038] BS 102 communicates wirelessly with UE 104 via communication link 120 (e.g., sending or receiving signals to or from UE 104). Communication link 120 between BS 102 and UE 104 may include uplink (UL) transmission (also referred to as reverse link) from UE 104 to BS 102 and / or downlink (DL) transmission (also referred to as forward link) transmission from BS 102 to UE 104. In various aspects, communication link 120 may utilize multiple-input multiple-output (MIMO) antenna technologies, including spatial multiplexing, beamforming, and / or transmit diversity.

[0039] BS 102 may typically include: NodeB, enhanced NodeB (eNB), next-generation enhanced NodeB (ng-eNB), next-generation NodeB (gNB or gNodeB), access point, transceiver base station, radio base station, radio transceiver, transceiver functionality, transmit / receive point, and / or others. Each BS in BS 102 may provide communication coverage for a corresponding geographic coverage area 110, which may sometimes be referred to as a cell, and in some cases may overlap (e.g., a small cell 102' may have a coverage area 110' that overlaps with the coverage area 110 of a macro cell). For example, BS may provide communication coverage for macro cells (covering a relatively large geographic area), pico cells (covering a relatively small geographic area, such as a stadium), femtocells (covering a relatively small geographic area (e.g., a home)), and / or other types of cells.

[0040] Although BS 102 is described as a single communication device in various aspects, it can be implemented in a variety of configurations. For example, to give a few examples, one or more components of the base station can be decomposed, including a central unit (CU), one or more distributed units (DU), one or more radio units (RU), a near real-time (near RT) RAN intelligent controller (RIC), or a non-real-time (non-RT) RIC. In another example, various aspects of the base station can be virtualized. More generally, a base station (e.g., BS 102) can include components located at a single physical location or components located at various physical locations. In examples where the base station includes components located at various physical locations, the various components can each perform functions, such that the various components collectively achieve functionality similar to a base station located at a single physical location. In some aspects, a base station including components located at various physical locations can be referred to as a decomposed radio access network architecture (such as an open RAN (O-RAN) or virtualized RAN (VRAN) architecture). Figure 2 An example decomposed base station architecture is depicted and described.

[0041] Different BSs 102 within the wireless communication network 100 can also be configured to support different radio access technologies (such as 3G, 4G, and / or 5G). For example, a BS 102 configured for 4G LTE (collectively referred to as Evolved Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (E-UTRAN)) can interface with EPC 160 via a first backhaul link 132 (e.g., S1 interface). A BS 102 configured for 5G (e.g., 5G NR or Next Generation RAN (NG-RAN)) can interface with 5GC 190 via a second backhaul link 184. BSs 102 can communicate directly or indirectly (e.g., via EPC 160 or 5GC 190) on a third backhaul link 134 (e.g., X2 interface), which can be wired or wireless.

[0042] Wireless communication network 100 can subdivide the electromagnetic spectrum into various categories, bands, channels, or other characteristics. In some aspects, subdivision is provided based on wavelength and frequency, where frequency may also be referred to as carrier, subcarrier, channel, tone, or subband. For example, 3GPP currently defines frequency range 1 (FR1) as including 410MHz to 7125MHz, which is often (interchangeably) referred to as “sub-6GHz”. Similarly, 3GPP currently defines frequency range 2 (FR2) as including 24,250MHz to 71,000MHz, which is sometimes (interchangeably) referred to as “millimeter wave” (“mmW” or “mmWave”). In some cases, FR2 can be further defined according to subranges (such as a first subrange FR2-1 including 24,250MHz to 52,600MHz and a second subrange FR2-2 including 52,600MHz to 71,000MHz). Base stations configured to communicate using mmWave / near mmWave radio bands (e.g., mmWave base stations such as BS 180) can utilize beamforming (e.g., 182) with UEs (e.g., 104) to improve path loss and range.

[0043] The communication link 120 between BS 102 and, for example, UE 104 can be via one or more carriers, which may have different bandwidths (e.g., 5MHz, 10MHz, 15MHz, 20MHz, 100MHz, 400MHz and / or other MHz) and may be aggregated in various ways. The carriers may be adjacent to each other or may not be adjacent to each other. The allocation of carriers may be asymmetric relative to DL and UL (e.g., more or fewer carriers may be allocated to DL compared to UL).

[0044] Compared to lower-frequency communication, communication using higher frequency bands may have higher path loss and shorter range. Therefore, some base stations (e.g., Figure 1The beamforming 182 of the BS 180 (180) with the UE 104 can be used to improve path loss and range. For example, the BS 180 and UE 104 may each include multiple antennas, such as antenna elements, antenna panels, and / or antenna arrays, to facilitate beamforming. In some cases, the BS 180 may transmit beamformed signals to the UE 104 in one or more transmit directions 182''. The UE 104 may receive beamformed signals from the BS 180 in one or more receive directions 182''. The UE 104 may also transmit beamformed signals to the BS 180 in one or more transmit directions 182''. The BS 180 may also receive beamformed signals from the UE 104 in one or more receive directions 182''. The BS 180 and UE 104 may then perform beamforming training to determine the optimal receive and transmit directions for each of the BS 180 and UE 104. It is worth noting that the transmit and receive directions of the BS 180 may be the same or different. Similarly, the sending and receiving directions of UE 104 can be the same or different.

[0045] The wireless communication network 100 also includes a Wi-Fi AP 150 that communicates with a Wi-Fi station (STA) 152 via a communication link 154 in, for example, unlicensed spectrum in 2.4 GHz and / or 5 GHz.

[0046] Some UEs 104 may use device-to-device (D2D) communication link 158 to communicate with each other. The D2D communication link 158 may use one or more sidelink channels, such as physical sidelink broadcast channel (PSBCH), physical sidelink discovery channel (PSDCH), physical sidelink shared channel (PSSCH), physical sidelink control channel (PSCCH), and / or physical sidelink feedback channel (PSFCH).

[0047] EPC 160 may include various functional components, including: Mobility Management Entity (MME) 162, other MMEs 164, Serving Gateway 166, Multimedia Broadcast Multicast Service (MBMS) Gateway 168, Broadcast Multicast Service Center (BM-SC) 170, and / or Packet Data Network (PDN) Gateway 172, as in the illustrated example. MME 162 may communicate with Home Subscriber Server (HSS) 174. MME 162 is the control node that handles signaling between UE 104 and EPC 160. Generally, MME 162 provides bearer and connectivity management.

[0048] Generally, user Internet Protocol (IP) packets are transmitted through Serving Gateway 166, which is itself connected to PDN Gateway 172. PDN Gateway 172 provides UE IP address allocation and other functions. PDN Gateway 172 and BM-SC 170 are connected to IP services 176, which may include, for example, the Internet, intranets, IP Multimedia Subsystem (IMS), packet-switched (PS) streaming services, and / or other IP services.

[0049] The BM-SC 170 provides functionality for MBMS user service dispatch and delivery. The BM-SC 170 can serve as an entry point for content provider MBMS transmissions, authorize and initiate MBMS bearer services within a Public Land Mobile Network (PLMN), and / or schedule MBMS transmissions. The MBMS Gateway 168 can distribute MBMS services to BS 102 within a Broadcast-Specific Service Single Frequency Network (MBSFN) area, and / or be responsible for session management (start / stop) and collecting eMBMS-related billing information.

[0050] 5GC 190 may include various functional components, including: Access and Mobility Management Function (AMF) 192, other AMFs 193, Session Management Function (SMF) 194, and User Plane Function (UPF) 195. AMF 192 may communicate with Unified Data Management (UDM) 196.

[0051] AMF 192 is the control node that handles signaling between UE 104 and 5GC 190. AMF 192 provides services such as Quality of Service (QoS) flow and session management.

[0052] Internet Protocol (IP) packets are transmitted via UPF 195, which connects to IP service 197 and provides UE IP address allocation and other functions for 5GC 190. IP service 197 may include, for example, the Internet, intranet, IMS, PS streaming service, and / or other IP services.

[0053] In various aspects, to give a few examples, network entities can be implemented as aggregated base stations, decomposed base stations, components of base stations, integrated access and backhaul (IAB) nodes, relay nodes, and sidelink nodes.

[0054] Figure 2An example decomposed base station 200 architecture is depicted. The decomposed base station 200 architecture may include one or more central units (CUs) 210, which may communicate directly with the core network 220 via a backhaul link, or indirectly with the core network 220 through one or more decomposed base station units, such as a near real-time (near-RT) RAN Intelligent Controller (RIC) 225 via an E2 link, or a non-real-time (non-RT) RIC 215 associated with a Service Management and Orchestration (SMO) framework 205, or both. CUs 210 may communicate with one or more distributed units (DUs) 230 via corresponding midhaul links (such as F1 interfaces). DUs 230 may communicate with one or more radio units (RUs) 240 via corresponding fronthaul links. RUs 240 may communicate with a corresponding UE 104 via one or more radio frequency (RF) access links. In some specific implementations, UE 104 may be served simultaneously by multiple RUs 240.

[0055] Each unit in a cell (e.g., CU 210, DU 230, RU 240, and near-RT RIC 225, non-RT RIC 215, and SMO frame 205) may include or be coupled to one or more interfaces configured to receive or transmit signals, data, or information (collectively, signals) via a wired or wireless transmission medium. Each of the cells, or an associated processor or controller that provides instructions to the cell's communication interface, may be configured to communicate with one or more other cells via the transmission medium. For example, these cells may include a wired interface configured to receive signals or transmit signals to one or more other cells via a wired transmission medium. Additionally or alternatively, a cell may include a wireless interface that may include a receiver, transmitter, or transceiver (such as a radio frequency (RF) transceiver) configured to receive signals on a wireless transmission medium or transmit signals to one or more other cells, or both.

[0056] In some aspects, CU 210 can host one or more higher-level control functions. Such control functions may include Radio Resource Control (RRC), Packet Data Convergence Protocol (PDCP), Serving Data Adaptation Protocol (SDAP), etc. Each control function can be implemented using an interface configured to communicate signaling with other control functions hosted by CU 210. CU 210 can be configured to handle user plane functions (e.g., Central Unit-User Plane (CU-UP)), control plane functions (e.g., Central Unit-Control Plane (CU-CP)), or combinations thereof. In some implementations, CU 210 can be logically divided into one or more CU-UP units and one or more CU-CP units. When implemented in an O-RAN configuration, CU-UP units can communicate bidirectionally with CU-CP units via an interface such as an E1 interface. CU 210 can be implemented to communicate with DU 230 for network control and signaling purposes, as needed.

[0057] DU 230 may correspond to a logic unit including one or more base station functions for controlling the operation of one or more RU 240s. In some aspects, DU 230 may at least partially host one or more of the Radio Link Control (RLC) layer, Media Access Control (MAC) layer, and one or more high physical (PHY) layers (such as modules for forward error correction (FEC) encoding and decoding, scrambling, modulation and demodulation, etc.) according to functional splits (such as those defined by the 3rd Generation Partnership Project (3GPP). In some aspects, DU 230 may also host one or more low PHY layers. Each layer (or module) may be implemented using an interface configured to communicate signals with other layers (and modules) hosted by DU 230 or with control functions hosted by CU 210.

[0058] Lower-layer functionality can be implemented by one or more RU 240s. In some deployments, an RU240 controlled by a DU 230 may correspond to a logical node that hosts RF processing functions or low-PHY layer functions (such as performing Fast Fourier Transform (FFT), Inverse FFT (iFFT), digital beamforming, Physical Random Access Channel (PRACH) extraction and filtering, or both, based at least in part on functional decomposition (such as lower-layer functional decomposition). In such architectures, the RU 240 may be implemented to handle over-the-air (OTA) communications with one or more UE 104s. In some specific implementations, the real-time and non-real-time aspects of control plane and user plane communications with the RU 240 may be controlled by the corresponding DU 230. In some scenarios, this configuration allows the DU 230 and CU 210 to be implemented in a cloud-based RAN architecture (such as a vRAN architecture).

[0059] SMO framework 205 can be configured to support RAN deployment and provisioning of both non-virtualized and virtualized network elements. For non-virtualized network elements, SMO framework 205 can be configured to support the deployment of dedicated physical resources for RAN coverage requirements, which can be managed via operation and maintenance interfaces such as the O1 interface. For virtualized network elements, SMO framework 205 can be configured to interact with a cloud computing platform such as Open Cloud (O-Cloud) 290 to perform network element lifecycle management (such as instantiating virtualized network elements) via a cloud computing platform interface such as the O2 interface. Such virtualized network elements may include, but are not limited to, CU 210, DU 230, RU 240, and near-RT RIC 225. In some implementations, SMO framework 205 can communicate with the hardware aspects of the 4G RAN (such as Open eNB (O-eNB) 211) via the O1 interface. Additionally, in some implementations, SMO framework 205 can communicate directly with one or more RU 240s via the O1 interface. SMO framework 205 may also include a non-RT RIC 215 configured to support the functionality of SMO framework 205.

[0060] The non-RT RIC 215 can be configured to include logical functions that enable non-real-time control and optimization of RAN elements and resources, including AI / ML workflows for model training and updates, or policy-based guidance for applications / features in the near-RT RIC 225. The non-RT RIC 215 can be coupled to or communicate with the near-RT RIC 225 (e.g., via an A1 interface). The near-RT RIC 225 can be configured to include logical functions that enable near real-time control and optimization of RAN elements and resources via data collection and actions through an interface (e.g., via an E2 interface) connecting one or more CU 210s, one or more DU 230s, or both, and O-eNBs to the near-RT RIC 225.

[0061] In some implementations, to generate AI / ML models to be deployed in the near-RT RIC 225, the non-RT RIC 215 may receive parameters or external enrichment information from an external server. This information can be utilized by the near-RT RIC 225 and may be received from non-network data sources or network functions at the SMO framework 205 or the non-RT RIC 215. In some examples, the non-RT RIC 215 or the near-RT RIC 225 may be configured to tune RAN behavior or performance. For example, the non-RT RIC 215 may monitor long-term trends and patterns in performance and employ AI / ML models to perform corrective actions via the SMO framework 205 (such as reconfiguration via O1) or by creating RAN management policies (such as A1 policies).

[0062] Figure 3 Various aspects of examples BS 102 and UE 104 are described.

[0063] Generally, BS 102 includes various processors (e.g., 320, 330, 338, and 340), antennas 334a to 334t (collectively referred to as 334), transceivers 332a to 332t (collectively referred to as 332) including modulators and demodulators, and other aspects that enable the wireless transmission of data (e.g., data source 312) and the wireless reception of data (e.g., data sink 339). For example, BS 102 can transmit and receive data between BS 102 and UE 104. BS 102 includes a controller / processor 340 that can be configured to implement the various wireless communication-related functions described herein.

[0064] Generally, UE 104 includes various processors (e.g., 358, 364, 366, and 380), antennas 352a to 352r (collectively referred to as 352), transceivers 354a to 354r (collectively referred to as 354) including modulators and demodulators, and other aspects that enable the wireless transmission of data (e.g., retrieval from data source 362) and the wireless reception of data (e.g., provision to data sink 360). UE 104 includes a controller / processor 380 that can be configured to implement the various wireless communication-related functions described herein.

[0065] Regarding example downlink transmission, BS 102 includes a transmission processor 320 that can receive data from data source 312 and control information from controller / processor 340. The control information may be for a Physical Broadcast Channel (PBCH), Physical Control Format Indicator Channel (PCFICH), Physical HARQ Indicator Channel (PHICH), Physical Downlink Control Channel (PDCCH), Group Shared PDCCH (GC PDCCH), and / or others. In some examples, this data may be for a Physical Downlink Shared Channel (PDSCH).

[0066] The transmitter processor 320 can process data and control information (e.g., encoding and symbol mapping) to obtain data symbols and control symbols, respectively. The transmitter processor 320 can also generate reference symbols (such as those for the primary synchronization signal (PSS), secondary synchronization signal (SSS), PBCH demodulation reference signal (DMRS), and channel state information reference signal (CSI-RS)).

[0067] The transmit (TX) multiple-input multiple-output (MIMO) processor 330 can perform spatial processing (e.g., pre-decoding) on ​​data symbols, control symbols, and / or reference symbols where applicable, and can provide the output symbol stream to the modulators (MODs) in transceivers 332a to 332t. Each modulator in transceivers 332a to 332t can process the corresponding output symbol stream to obtain an output sample stream. Each modulator can further process (e.g., convert to analog, amplify, filter, and up-convert) the output sample stream to obtain a downlink signal. The downlink signal from the modulators in transceivers 332a to 332t can be transmitted via antennas 334a to 334t, respectively.

[0068] To receive downlink transmissions, UE 104 includes antennas 352a to 352r that receive downlink signals from BS 102 and provide the received signals to demodulators (DEMODs) in transceivers 354a to 354r, respectively. Each demodulator in transceivers 354a to 354r can adjust (e.g., filter, amplify, down-convert, and digitize) the corresponding received signal to obtain an input sample. Each demodulator can further process the input sample to obtain the received symbols.

[0069] The MIMO detector 356 acquires received symbols from all demodulators in transceivers 354a-354r, performs MIMO detection on the received symbols where applicable, and provides the detected symbols. The receive processor 358 processes the detected symbols (e.g., demodulation, deinterleaving, and decoding), provides the decoded data of UE 104 to data sink 360, and provides the decoded control information to controller / processor 380.

[0070] Regarding example uplink transmission, UE 104 also includes a transmit processor 364 that receives and processes data from data source 362 (e.g., for PUSCH) and control information from controller / processor 380 (e.g., for Physical Uplink Control Channel (PUCCH)). Transmit processor 364 may also generate reference symbols for reference signals (e.g., for Sounding Reference Signal (SRS)). Symbols from transmit processor 364 may be pre-decoded by TX MIMO processor 366 where applicable, further processed by modulators in transceivers 354a to 354r (e.g., for SC-FDM), and transmitted to BS 102.

[0071] At BS 102, uplink signals from UE 104 can be received by antennas 334a to 334t, processed by demodulators in transceivers 332a to 332t, detected by MIMO detector 336 where applicable, and further processed by receiver processor 338 to obtain decoded data and control information transmitted by UE 104. Receiver processor 338 can provide the decoded data to data sink 339 and the decoded control information to controller / processor 340.

[0072] Memory 342 and memory 382 can store data and program code for BS 102 and UE 104, respectively.

[0073] Scheduler 344 can schedule UE to send data on the downlink and / or uplink.

[0074] In various respects, BS 102 can be described as transmitting and receiving various types of data associated with the methods described herein. In these contexts, “transmitting” can refer to various mechanisms that output data, such as from data source 312, scheduler 344, memory 342, transmit processor 320, controller / processor 340, TX MIMO processor 330, transceivers 332a to 332t, antennas 334a to 334t, and / or other aspects described herein. Similarly, “receiving” can refer to various mechanisms that acquire data, such as from antennas 334a to 334t, transceivers 332a to 332t, RX MIMO detector 336, controller / processor 340, receive processor 338, scheduler 344, memory 342, and / or other aspects described herein.

[0075] In various respects, UE 104 can also be described as transmitting and receiving various types of data associated with the methods described herein. In these contexts, “transmitting” can refer to various mechanisms that output data, such as from data source 362, memory 382, ​​transmit processor 364, controller / processor 380, TX MIMO processor 366, transceivers 354a to 354t, antennas 352a to 352t, and / or other aspects described herein. Similarly, “receiving” can refer to various mechanisms that acquire data, such as from antennas 352a to 352t, transceivers 354a to 354t, RX MIMO detector 356, controller / processor 380, receive processor 358, memory 382, ​​and / or other aspects described herein.

[0076] In some respects, one or more processors may be configured to perform various operations (such as those associated with the methods described herein) and respectively send (output) data to another interface configured to send data or receive (obtain) data from another interface configured to receive data.

[0077] Figure 4A , Figure 4B , Figure 4C and Figure 4D Describes the use of wireless communication networks (such as Figure 1 All aspects of the data structure of the wireless communication network 100.

[0078] Specifically, Figure 4A Figure 400 is an example of the first subframe within a 5G (e.g., 5G NR) frame structure. Figure 4B Figure 430 illustrates an example of a DL channel within a 5G subframe. Figure 4C Figure 450 illustrates an example of the second subframe within a 5G frame structure, and Figure 4D Figure 480 illustrates an example of a UL channel within a 5G subframe.

[0079] Wireless communication systems can utilize Orthogonal Frequency Division Multiplexing (OFDM) with a cyclic prefix (CP) on both the uplink and downlink. Such systems can also support half-duplex operation using Time Division Duplex (TDD). OFDM and Single-Carrier Frequency Division Multiplexing (SC-FDM) will (e.g., as...) Figure 4B and Figure 4D The system bandwidth (as depicted in the text) is divided into multiple orthogonal subcarriers. Each subcarrier can be modulated with data. Modulation symbols can be transmitted in the frequency domain using OFDM and / or in the time domain using SC-FDM.

[0080] Wireless communication frame structures can be frequency division duplex (FDD), where for a specific set of subcarriers, subframes within that set are dedicated to either deep (DL) or ultra-low (UL). Wireless communication frame structures can also be time division duplex (TDD), where for a specific set of subcarriers, subframes within that set are dedicated to both DL and UL.

[0081] exist Figure 4A and Figure 4C In this example, the wireless communication frame structure is TDD, where D stands for DL, U for UL, and X is flexibly used between DL and UL. The UE can configure the time slot format via the received Slot Format Indicator (SFI) (dynamically configured via DL Control Information (DCI) or semi-statically / statically configured via Radio Resource Control (RRC) signaling). In the depicted example, a 10ms frame is divided into 10 equal-sized 1ms subframes. Each subframe may include one or more time slots. In some examples, each time slot may include 7 or 14 symbols, depending on the time slot format. Subframes may also include micro-slots, which typically have fewer symbols than the entire time slot. Other wireless communication technologies may have different frame structures and / or different channels.

[0082] In some respects, the number of time slots within a subframe is based on the time slot configuration and parameter set. For example, for time slot configuration 0, different parameter sets (μ) 0 to 6 allow 1, 2, 4, 8, 16, 32, and 64 time slots per subframe, respectively. For time slot configuration 1, different parameter sets 0 to 2 allow 2, 4, and 8 time slots per subframe, respectively. Therefore, for time slot configuration 0 and parameter set μ, there are 14 symbols per time slot and 2µ time slots per subframe. The subcarrier spacing and symbol length / duration are functions of the parameter set. The subcarrier spacing can be equal to... kHz, where μ is the parameter set from 0 to 6. Therefore, the parameter set... It has a subcarrier spacing of 15 kHz and a parameter set It has a subcarrier spacing of 960 kHz. The symbol length / duration is negatively correlated with the subcarrier spacing. Figure 4A , Figure 4B , Figure 4C and Figure 4D It provides slot configuration 0 with 14 symbols per slot and parameter set with 4 slots per subframe. Example: The time slot duration is 0.25 ms, the subcarrier spacing is 60 kHz, and the symbol duration is approximately 16.67 μs.

[0083] like Figure 4A , Figure 4B , Figure 4C and Figure 4DAs depicted, the resource grid can be used to represent the frame structure. Each time slot includes a resource block (RB) (also known as a physical RB (PRB)) extending for, for example, 12 consecutive subcarriers. The resource grid is divided into multiple resource elements (REs). The number of bits carried by each RE depends on the modulation scheme.

[0084] like Figure 4A As illustrated in the example, some REs in the RE carry information for the UE (e.g., Figure 1 and Figure 3 The reference (pilot) signal (RS) for the UE (104) may include a demodulation RS (DMRS) and / or a channel state information reference signal (CSI-RS) for channel estimation at the UE. The RS may also include a beam measurement RS (BRS), a beam refinement RS (BRRS), and / or a phase tracking RS (PT-RS).

[0085] Figure 4B Examples of various DL channels within a subframe of a frame are illustrated. The Physical Downlink Control Channel (PDCCH) carries the DCI within one or more Control Channel Elements (CCEs), each CCE comprising, for example, nine RE groups (REGs), each REG comprising, for example, four consecutive REs in an OFDM symbol.

[0086] The Primary Synchronization Signal (PSS) can be located within symbol 2 of a specific subframe of the frame. The PSS is generated by the UE (e.g., Figure 1 and Figure 3 104) is used to determine subframe / symbol timing and physical layer identifier.

[0087] The Supplemental Synchronization Signal (SSS) can be located in symbol 4 of a specific subframe of a frame. The SSS is used by the UE to determine the physical layer cell identifier group number and radio frame timing.

[0088] Based on the Physical Layer Identifier and Physical Layer Cell Identifier Group Number, the UE can determine the Physical Cell Identifier (PCI). Based on the PCI, the UE can determine the location of the aforementioned DMRS. The Physical Broadcast Channel (PBCH), carrying the Master Information Block (MIB), can be logically grouped with the PSS and SSS to form a Synchronization Signal (SS) / PBCH block. The MIB provides the number of RBs and the System Frame Number (SFN) in the system bandwidth. The Physical Downlink Shared Channel (PDSCH) carries user data, broadcast system information (such as System Information Block (SIB)) not transmitted via the PBCH, and / or paging messages.

[0089] like Figure 4CAs illustrated, some REs in the REs carry DMRS for channel estimation at the base station (indicated as R for a particular configuration, but other DMRS configurations are possible). The UE can transmit DMRS for PUCCH and DMRS for PUSCH. PUSCH DMRS can be transmitted, for example, in the first or second symbol before the PUSCH. PUCCH DMRS can be transmitted in different configurations depending on whether a short or long PUCCH is being transmitted and depending on the specific PUCCH format used. UE104 can transmit a Sounding Reference Signal (SRS). SRS can be transmitted, for example, in the last symbol of a subframe. SRS can have a comb structure, and the UE can transmit SRS on one of the comb teeth. SRS can be used by the base station for channel quality estimation to enable frequency-dependent scheduling of the UL.

[0090] Figure 4D Examples of various UL channels within a subframe of a frame are illustrated. The PUCCH can be located as indicated in one configuration. The PUCCH carries uplink control information (UCI), such as scheduling requests, channel quality indicators (CQI), pre-decoding matrix indicators (PMI), rank indicators (RI), and HARQ ACK / NACK feedback. The PUSCH carries data and may additionally be used to carry buffer status reports (BSR), power clearance reports (PHR), and / or UCI.

[0091] Introduction to Polar Codes Polar codes represent a relatively recent breakthrough in decoding theory, having been shown to asymptotically achieve Shannon capacity (for code sizes approaching infinity, N). Polar codes possess many desirable properties, such as deterministic construction (e.g., based on the Fast Hadamard Transform), very low and predictable error floor, and decoding based on simple successive elimination (SC). They are currently considered candidates for error correction in next-generation wireless systems such as NR.

[0092] Polar codes are of length 10 ... N=2 n Linear block codes, where their generator matrices are obtained using matrix... Constructed from the nth power of Kronecker, denoted as For example, Equation 1 shows the generator matrix obtained for n=3.

[0093] (1) In some respects, codewords can be generated by encoding multiple input bits consisting of K information bits and NK “frozen” bits (e.g., by encoder 706) using a generator matrix. These “frozen” bits contain no information and are “frozen” to known values, such as zero. For example, given multiple input bits u=(u0, u... 1, ..., u N-1 The resulting codeword vector is x=(x0, x1, ..., x...). N-1 This can be achieved by using a generator matrix. G The input bits are encoded to generate the codeword. The resulting codeword is then rate-matched and transmitted by the base station via a wireless medium and received by the UE.

[0094] When the received vector is decoded, for example, by using a successive cancellation (SC) decoder (e.g., decoder 816), it is assumed that bit u0 i-1 If correctly decoded, then each estimated bit û i With a predetermined error probability, for a very large code size N, this error probability tends to be 0 or 0.5. Furthermore, the proportion of estimated bits with low error probabilities tends to the capacity of the underlying channel. Polar codes utilize this phenomenon, known as channel polarization, by using the most reliable K bits to transmit information while setting the remaining (NK) bits to predetermined values ​​(such as 0), also known as freezing, as will be explained below.

[0095] The polar code transforms the channel into N parallel "virtual" channels for N information bits and frozen bits. If C is the channel capacity, then for sufficiently large values ​​of N, there are almost N*C very reliable channels and almost N(1 – C) very unreliable channels. The basic polar decoding scheme then involves freezing the input bits in u corresponding to the unreliable channels (i.e., setting them to known values, such as zero), while placing only the information bits in u corresponding to the reliable channels. For short to medium N, this polarization may not be complete in the sense that there may be several channels that are neither completely unreliable nor completely reliable (i.e., marginally reliable channels). Depending on the transmission rate, the bits corresponding to these marginally reliable channels can be frozen or used for the information bits.

[0096] Figure 5 This is a block diagram 500 illustrating processes related to polarization coding and rate matching according to some aspects of this disclosure. As shown, the bit sequence input for a given code block used for channel decoding is... c 0 , c 1 , c 2,…, c K-1 This indicates that K is the number of bits to be encoded. After encoding, the bits are... d 0 , d 1 , d 2 ,…, d N-1 This indicates that N = 2 n N>K, and the polarization decoding rate R = K / N.

[0097] Figure 6 Examples of using Example figure 600 of polar coding, in which m = 3, corresponding to the code: .

[0098] Payload bits It is information (carrying an information payload) or frozen. As illustrated, in this example, the matrix Channel of One copy ( = 8) Polarization into sub-channel The sub-channels are almost noisy ( ) and almost no noise ( In this way, the set of information bits is: Corresponding to Maximum capacity .

[0099] Aspects related to soft merging of automorphisms based on polar codes Soft combining allows a receiver to combine multiple instances of received signals. This combining can help improve signal quality and increase the chance of successful decoding, even if some received instances are corrupted during transmission. Soft combining relies on the payload being transmitted consecutively being identical.

[0100] Because portions of the payload change during successive transmissions, certain types of transmissions may not be ideal candidates for soft merging. For example, as mentioned above, the Physical Broadcast Channel (PBCH) in NR has a payload with specific portions that change between transmissions. While polarization decoding can be used for PBCH transmissions (e.g., with fixed parameters N=512, K=56, including a 24-bit checksum), the System Frame Number (SFN) payload portion changes. For example, as... Figure 7 As illustrated in Figure 700, SFN (currently a 10-bit value) i) continuously increase by 1 (mod 1024, causing SFN to flip to 0 after increasing from 1023).

[0101] Unfortunately, this variable nature of the SFN portion of the PBCH payload poses a challenge to soft combining over several consecutive transmissions, because the UE may not know the starting value of the SFN in the received PBCH sample sequence. As a result, the UE may need to guess the starting point (of the SFN in the received sample) and perform several decoding attempts, which is inefficient and may lead to increased power consumption.

[0102] However, aspects of this disclosure provide a decoding scheme that facilitates the soft combining of multiple payloads, even when the payloads differ in the number of bits. For example, when the channel code is fixed and the payloads differ in a relatively small number of bits (e.g., SFN / counter bits), the decoding scheme proposed herein can help achieve the soft combining of multiple PBCH payloads.

[0103] Specific aspects of the subject matter described in this disclosure can be implemented to achieve one or more of the following potential advantages. In some examples, the decoding scheme proposed herein can allow soft combining of PBCH transmissions delivered using polarization decoding. As a result, the decoding scheme proposed herein can help increase the chance of successful decoding while limiting blind decoding and the corresponding increase in processing overhead and power consumption.

[0104] It should be understood that although the examples in this disclosure illustrate PBCH soft combining, the decoding scheme proposed herein can be used in a variety of communication scenarios to achieve soft combining of different types of transmissions (e.g., those with a relatively large common payload and a relatively small modified portion).

[0105] The decoding scheme proposed in this paper can utilize polar codes with a large set of automorphisms. In this context, automorphism generally refers to the isomorphism from an object to itself. Automorphisms typically preserve the symmetry of an object and provide a way to map an object to itself while retaining all its structure. The set of all automorphisms of an object forms a group called the automorphism set.

[0106] As will be described in more detail below, the location of information bits can be selected in a manner that satisfies the automorphism group constraint. PBCH (or other) payloads with different counter values ​​can be obtained by successively applying a specific function (permutation plus scrambling). On the decoding side (at a receiver such as a UE), a depermutation step can be added in the list decoder before performing checksum (e.g., cyclic redundancy check (CRC)) verification.

[0107] The automorphism-based soft merging proposed in this paper can be referenced. Figure 8 To understand this, we can refer to the call flowchart 800. In some aspects, Figure 8 The sender shown can be a network entity, such as regarding Figure 1 and Figure 3 The BS depicted and described or about Figure 2 The decomposed base station described and illustrated. Similarly, Figure 8 The receiver shown can be about Figure 1 and Figure 3 Examples of UE 104 depicted and described. However, in other respects, the transmitter and / or receiver may be a different type of wireless communication device.

[0108] As illustrated at 805, the transmitter can use polar codes to encode different payloads to generate multiple codeword permutations. Each of the different payloads may include a first payload portion that is the same for the different payloads and a second payload portion that differs deterministically among the different payloads, and each codeword permutation corresponds to a second payload portion within the second payload portion.

[0109] For example, different payloads can be different versions of the PBCH, where the first payload portion is a shared PBCH payload (unchanged between transmissions), and the second payload portion can be an SFN payload (incremented by 1). As illustrated, the transmitter can then sequentially output multiple codeword permutations.

[0110] As illustrated at 810, the receiver can process multiple codeword permutations to obtain a second payload portion. At 815, the receiver obtains a first payload portion after obtaining the second payload portion. At 820, the receiver performs soft merging of the first payload portion.

[0111] Continuing with the PBCH example, the receiver can process multiple codeword permutations to extract different counter (SFN) values, obtain the remaining (invariant) payload portions (e.g., by applying an inverse transform / depermutation), and perform soft combining on these portions.

[0112] For standard polar coding: For the permutation matrix : (because ), Therefore apply Linear transformation corresponding to the payload The transmitter typically transmits, for example, by... Applied to the Payload, generating the first Payload as Therefore, the receiver can... Applied to (in )right Soft combining is performed. According to the decoding scheme proposed in this paper, the counter (e.g., SFN) bits can be treated as frozen bits on the transmitter side and as information bits on the receiver side. In other words, the transmitter assumes these bits are zero for transmission purposes, and conversely, ensures that the selected codeword permutation corresponds to a different counter value, while the receiver is unaware of the counter value beforehand.

[0113] Typically, the goal of the decoding scheme proposed in this paper can be to find a large-order decoding scheme. of In some cases, affine permutation can be considered: in It is the binary representation of the codeword index. The decoding scheme proposed in this paper can be used with only the lower triangular... The typical (ordinary) polar codes differ from other polar codes, with a maximum period of 16, among which... This may be too small for some use cases.

[0114] The decoding scheme proposed in this paper can go beyond typical polar codes to obtain more permutations. For example, the proposed decoding scheme can utilize block lower triangular matrices. 900, such as Figure 9A exemplified, among which It can be a downward triangle ( ) or the opposite upper triangle ( (Anti-angle plus non-zero values ​​on the anti-angle). Restrictions imposed on the frozen bit positions can help achieve sequence changes from typical ordinary polar codes.

[0115] Figure 9B and Figure 9C Examples are given for two scenarios (A' and A'') of matrices 910 and 920 formed by matrices 912 and 914, respectively, at different positions. In the first scenario, matrix 912 (top-left to bottom-right) is used for A', while matrix 914 (top-right to bottom-left) is used for A''. In the second scenario, matrix 914 (top-right to bottom-left) is used for A', while matrix 912 (top-left to bottom-right) is used for A''.

[0116] exist Figure 9B In the first scenario shown, This can potentially lead to better permutation decoding performance. In this scenario, symmetry in the internal code can result in numerous permutations that lead to good decoding performance. The receiver can perform decoding iteratively by running a successive elimination / successive elimination list (SC / SCL) decoder sequentially over different "good" permutations.

[0117] exist Figure 9C In the second scenario shown, This may result in relatively good list decoding performance. In this scenario, the symmetry in the outer code may not be well-suited for permutation decoding (compared to the first scenario), but may result in a smaller SC / SCL performance loss compared to ordinary polar codes.

[0118] for Figure 9B and Figure 9C The two scenarios shown have the largest The order can be expressed as In this case, the order may not be a power of 2—the counter values ​​are redundant because some are invalid, which may lead to additional error control during the list decoding process.

[0119] You can refer to this. Figure 10 The example shown illustrates the constraints on the selection of information bit positions. This example assumes parameters... And matrices A 1000 and Px 1010 are: ; ;as well as .

[0120] Constraint 1020, arising from automorphism, can specify element pairs: ; This means either both are frozen or both are information. Therefore, the following NR reliability sequence 1030 (with underscores indicating information bits as shown at 1012) is: 0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12, 7, 11,13,14,15; Violation of constraints, because of bits Frozen but Bit This is the information indicated at position 1014. On the other hand, if it is a bit... Made into information bits (not bits) ), such as in sequence 1040: 0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12 , 7, 11, 13,14,15; Information bits 1022 satisfy the constraints listed above (because) and Both are frozen, as shown at 1024).

[0121] In some cases, the decoding scheme proposed in this paper can be designed to handle the all-zero payload case; otherwise, it would result in no new permutation codewords because of the application... Linear transformation corresponding to the payload In other words, if It is a linear operation, and when starting with an all-zero payload, a typical decoding scheme will not result in a new permutation.

[0122] To address this problem, in some cases, non-linear operations can be used on certain bits. For example, in some cases, the bit index can be selected. And (relatively simple) nonlinear operations, such as: , Transformation can be applied Previously at Bit ( This is applied in the codeword domain. In fact, this can be translated into scrambling in the codeword domain: , Among them, in the code word field ( It is the corresponding Arikan matrix (The line). In some cases, bits It can be part of the counter bits, so that no additional bits are needed. Similar to other counter bits, It can be treated as a frozen bit on the transmitter side and as an information bit on the receiver side.

[0123] You can refer to this. Figure 11 The example shown illustrates the application of this nonlinear operation. This example assumes... N The counter bits are and and payload bits It is zero. This example also assumes that it is zero. exchange and And bit index (This essentially flips the bit value before swapping the bits).

[0124] As illustrated in the figure, for the first effective payload, all A value of zero (0 0 0 0) causes an all-zero codeword to be sent: .

[0125] As illustrated at 1110, for the second payload, a nonlinear operation is applied ( ),get .exchange and Send the following code: .

[0126] As illustrated at 1120, for the third payload, the application... get In the exchange and Then, send the following code: .

[0127] As illustrated at 1130, for the fourth payload, the application... get In the exchange and Then, send the following code: .

[0128] In this way, due to non-linear operations, all counter values ​​(00, 01, 02, and 03) are successfully traversed.

[0129] Typically, operations in the codeword field Convert to: .

[0130] Operations in the codeword field yes Therefore, the overall composition yes: .

[0131] Various aspects of this disclosure also ensure that the decoding scheme proposed herein is compatible with checksums, such as Cyclic Redundancy Check (CRC) values. Figure 12A As illustrated, in the PBCH structure 1200, CRC 1206 is typically used to protect both payload bit 1202 and counter bit 1204.

[0132] As described in this article, for some SFN indexes Each counter value This usually corresponds to (different) codeword substitutions. One potential challenge is that, for The CRC may become invalid, and the list decoder may fail to find the correct path.

[0133] However, aspects of this disclosure can be understood through, as follows Figure 12BThe decoder stream shown in Example 1250 is modified (on the receiver side) to be CRC compatible. As shown at 1252, after processing the codeword permutation, the receiver may be able to extract the counter bits (e.g., the counter value associated with the codeword permutation). ).

[0134] After recovering the counter bits, the receiver knows the SFN index offset. Therefore, as shown at 1254, before checking the CRC (at 1256), the receiver can apply an inverse transform (solving the permutation matrix). This can be achieved essentially by mapping the decoded counter to the permutation index (corresponding to the permutation matrix applied on the transmitter side) and depermuting the codewords accordingly before performing CRC checks on the list entries.

[0135] Example Operation Figure 13 An example of a wireless communication method 1300 at a first wireless node is shown, in which the first wireless node acts as a transmitter (e.g., reference). Figure 8 (Discussion within the context of this example). In some examples, the first wireless node is user equipment, such as... Figure 1 and Figure 3 UE 104. In some examples, the first wireless node is a network entity, such as... Figure 1 and Figure 3 BS 102 or as relative to Figure 2 The decomposed base station under discussion.

[0136] Method 1300 begins at step 1305, encoding different payloads using polar codes to generate multiple codeword permutations, wherein each of the different payloads includes a first payload portion that is the same for all different payloads and a second payload portion that differs deterministically among the different payloads, and each codeword permutation corresponds to one of the second payload portions. In some cases, the operation of this step refers to, as referenced... Figure 15 The circuitry used for encoding and / or the code used for encoding, or the circuitry and / or the code that can be executed.

[0137] Method 1300 then proceeds to step 1310, where multiple codeword permutations are output sequentially. In some cases, this step involves operations as described in the reference. Figure 15 The circuitry and / or code described for the output, or the code that can be executed by the circuitry and / or the code.

[0138] In some respects, the different payloads correspond to Physical Broadcast Channel (PBCH) transmissions; and the second payload portion corresponds to the System Frame Number (SFN) value conveyed in the PBCH transmissions.

[0139] In some respects, the second payload portion corresponds to a counter value that changes deterministically across different payloads.

[0140] In some respects, the output includes a first codeword permutation corresponding to a first counter value, and a second codeword permutation corresponding to a second counter value; and the second codeword permutation is generated by applying a permutation matrix to the first codeword permutation.

[0141] In some respects, the permutation matrix is ​​associated with a matrix formed by a first matrix having the lower triangular (LT) property and a second matrix having the anti-triangular upper triangular (ADT) property.

[0142] In some respects, each codeword permutation includes one or more information bits and one or more frozen bits; and when the first codeword permutation and the second codeword permutation are generated, the counter bits are treated as frozen bits.

[0143] In some respects, multiple codeword permutations are generated using a permutation matrix; and the permutation matrix is ​​associated with one or more restrictions on one or more positions of one or more frozen bits, one or more information bits, or one or more frozen bits and one or more information bits.

[0144] In some respects, one or more restrictions include at least one pair of bit positions used for freezing bits or for information bits.

[0145] In some respects, generation involves performing nonlinear operations on at least one bit position before applying the permutation matrix.

[0146] In some respects, nonlinear operations involve at least one counter bit.

[0147] In one aspect, method 1300 or any aspect thereof may be made by means of a device (such as...) Figure 15 The communication device 1500 is used to perform the method 1300. The device includes various components that can be operated, configured, or adapted to perform the method 1300. The communication device 1500 is described in further detail below.

[0148] It should be noted that Figure 13 This is merely one example of a method, and other methods that include fewer, additional, or alternative steps may also be consistent with this disclosure.

[0149] Figure 14An example of a wireless communication method 1400 at a first wireless node is shown, in which the first wireless node acts as a receiver (see reference). Figure 8 (Discussion within the context of this example). In some examples, the first wireless node is user equipment, such as... Figure 1 and Figure 3 UE 104. In some examples, the first wireless node is a network entity, such as... Figure 1 and Figure 3 BS 102 or as relative to Figure 2 The decomposed base station under discussion.

[0150] Method 1400 begins at step 1405, obtaining multiple codeword permutations corresponding to different payloads, wherein the different payloads include the same first payload portion and second payload portions that differ in deterministic manner, and each codeword permutation corresponds to one of the second payload portions. In some cases, the operation of this step involves, as referenced... Figure 15 The circuitry and / or code described for obtaining the code can be executed by or be used by the circuitry and / or the code. In this case, the multiple codeword permutations obtained at step 1405 can correspond to... Figure 13 The method 1300 described in step 1310 (by the transmitter) sequentially outputs those multiple codeword substitutions.

[0151] Method 1400 then proceeds to step 1410, processing multiple codeword permutations to obtain the second payload portion. In some cases, this step involves operations as described in the reference. Figure 15 The circuitry described for processing and / or the code for processing, or the circuitry and / or the code that can be executed.

[0152] Method 1400 then proceeds to step 1415, obtaining the first payload portion after obtaining the second payload portion. In some cases, the operation of this step involves, as described in the reference... Figure 15 The circuit and / or code described for obtaining, or that can be executed by the circuit and / or the code.

[0153] Then, method 1400 proceeds to step 1420, where the first payload portion is soft-merged. In some cases, the operation of this step refers to the reference... Figure 15 The circuitry and / or code described for soft merging, or that can be executed by the circuitry and / or the code.

[0154] In some respects, the different payloads correspond to Physical Broadcast Channel (PBCH) transmissions; and the second payload portion corresponds to the System Frame Number (SFN) value conveyed in the PBCH transmissions.

[0155] In some respects, the second payload portion corresponds to a counter value that changes deterministically across different payloads.

[0156] In some respects, each codeword permutation includes one or more information bits and one or more freeze bits; and when multiple codeword permutations are processed, the counter bits are treated as information bits.

[0157] In some aspects, obtaining the first payload portion includes: identifying the inverse transform associated with one of the second payload portions; and applying the inverse transform.

[0158] In some respects, the inverse transformation is associated with a matrix formed by a first matrix having lower triangular (LT) properties and a second matrix having anti-triangular upper triangular (ADT) properties.

[0159] In some aspects, method 1400 also includes performing an error checking operation after applying the inverse transform. In some cases, this step refers to, as described in the reference... Figure 15 The circuitry described for execution and / or the code for execution, or the circuitry and / or the code that can be executed.

[0160] In some respects, identifying the inverse transform associated with one of the second payload portions involves mapping the decoded bits of the second payload to a permutation index.

[0161] In some respects, the application of inverse transforms leads to the depermutation of codeword permutations.

[0162] In some aspects, processing multiple codeword permutations to obtain a second payload involves nonlinear operations.

[0163] In some respects, the second payload portion corresponds to a counter value that changes deterministically in different payloads; and the nonlinear operation involves at least one counter value bit.

[0164] In one aspect, method 1400 or any aspect thereof may be made by means of a device (such as...) Figure 15 The communication device 1500 is used to perform the method 1400. The device includes various components that can be operated, configured, or adapted to perform the method 1400. The communication device 1500 is described in further detail below.

[0165] It should be noted that Figure 14 This is merely one example of a method, and other methods that include fewer, additional, or alternative steps may also be consistent with this disclosure.

[0166] Example communication device Figure 15Various aspects of the example communication device 1500 are described. In some aspects, the communication device 1500 is user equipment, such as those described above. Figure 1 and Figure 3 The UE 104 is described. In some respects, the communication device 1500 is a network entity, such as... Figure 1 and Figure 3 BS 102 or as about Figure 2 The decomposed base station under discussion.

[0167] Communication device 1500 includes a processing system 1505 coupled to transceiver 1585 (e.g., transmitter and / or receiver). In some aspects (e.g., when communication device 1500 is a network entity), processing system 1505 may be coupled to network interface 1595, which is configured to communicate via a communication link (such as, as described herein, regarding...). Figure 2 The described backhaul link, midhaul link, and / or fronthaul link acquire and transmit signals for communication device 1500. Transceiver 1585 is configured to transmit and receive signals for communication device 1500 via antenna 1590, such as the various signals described herein. Processing system 1505 may be configured to perform processing functions for communication device 1500, including processing signals received by communication device 1500 and / or to be transmitted by the communication device.

[0168] Processing system 1505 includes one or more processors 1510. In various aspects, the one or more processors 1510 may represent one or more of a receive processor 358, a transmit processor 364, a TX MIMO processor 366, and / or a controller / processor 380, as per [reference to...]. Figure 3 As described. In various respects, one or more processors 1510 may represent one or more of the following: receive processor 338, transmit processor 320, TX MIMO processor 330, and / or controller / processor 340, as per [reference to...]. Figure 3 As described. One or more processors 1510 are coupled to a computer-readable medium / memory 1545 via a bus 1580. In some aspects, the computer-readable medium / memory 1545 is configured to store instructions (e.g., computer-executable code) that, when executed by the one or more processors 1510, cause the one or more processors 1510 to perform actions regarding Figure 13 The described method 1300 or any aspect thereof; and relative to Figure 14 The method 1400 described herein or any aspect thereof. It should be noted that references to processors performing the functions of communication device 1500 may include one or more processors 1510 performing those functions of communication device 1500.

[0169] In the depicted example, computer-readable medium / memory 1545 stores code (e.g., executable instructions), such as code 1550 for encoding, code 1555 for output, code 1560 for acquisition, code 1565 for processing, code 1570 for soft merging, and code 1575 for execution. Processing the code 1550 for encoding, the code 1555 for output, the code 1560 for acquisition, the code 1565 for processing, the code 1570 for soft merging, and the code 1575 for execution enables the communication device 1500 to perform relative to... Figure 13 The method described in 1300 or any aspect thereof; and relative to Figure 14 The method described 1400 or any aspect thereof.

[0170] One or more processors 1510 include circuitry configured to implement (e.g., execute) code stored in a computer-readable medium / memory 1545, including circuitry 1515 for encoding, circuitry 1520 for output, circuitry 1525 for acquisition, circuitry 1530 for processing, circuitry 1535 for soft merging, and circuitry 1540 for execution. Processing performed using the circuitry 1515 for encoding, the circuitry 1520 for output, the circuitry 1525 for acquisition, the circuitry 1530 for processing, the circuitry 1535 for soft merging, and the circuitry 1540 for execution enables the communication device 1500 to perform operations relative to... Figure 13 The method described in 1300 or any aspect thereof; and relative to Figure 14 The method described 1400 or any aspect thereof.

[0171] The various components of the communication device 1500 can provide parts for performing the following: Figure 13 The described method 1300 or any aspect thereof; and relative to Figure 14 The described method 1400 or any aspect thereof. For example, components for sending, transmitting, or outputting for transmission may include... Figure 3 The transceiver 354 and / or antenna 352 of UE 104 illustrated herein Figure 3 The transceiver 332 and / or antenna 334 of BS 102 illustrated herein Figure 15 The communication device 1500 includes a transceiver 1585 and an antenna 1590. Components for receiving or acquiring data may include... Figure 3 The transceiver 354 and / or antenna 352 of UE 104 illustrated herein Figure 3 The transceiver 332 and / or antenna 334 of BS 102 illustrated herein Figure 15The transceiver 1585 and antenna 1590 of the communication equipment 1500.

[0172] Example Terms Specific implementation examples are described in the following numbered clauses: Clause 1: A method for wireless communication at a first wireless node, the method comprising: encoding different payloads using polar codes to generate a plurality of codeword permutations, wherein each of the different payloads includes a first payload portion that is identical for the different payloads and a second payload portion that is different in a deterministic manner among the different payloads, and each codeword permutation corresponds to a second payload portion in the second payload portion; and sequentially outputting the plurality of codeword permutations.

[0173] Clause 2: The method according to Clause 1, wherein: the different payloads correspond to Physical Broadcast Channel (PBCH) transmissions; and the second payload portion corresponds to the System Frame Number (SFN) value conveyed in the PBCH transmissions.

[0174] Clause 3: The method according to any one of Clauses 1 to 2, wherein the second payload portion corresponds to a counter value that changes in a deterministic manner in different payloads.

[0175] Clause 4: The method according to Clause 3, wherein: the output includes outputting a first codeword permutation corresponding to a first counter value, and subsequently outputting a second codeword permutation corresponding to a second counter value; and the second codeword permutation is generated by applying a permutation matrix to the first codeword permutation.

[0176] Clause 5: According to the method described in Clause 4, the permutation matrix is ​​associated with a matrix formed by a first matrix having the lower triangular (LT) property and a second matrix having the anti-triangular upper triangular (ADT) property.

[0177] Clause 6: The method according to Clause 4, wherein: each codeword permutation includes one or more information bits and one or more freeze bits; and when the first codeword permutation and the second codeword permutation are generated, the counter bit is regarded as a freeze bit.

[0178] Clause 7: The method according to Clause 6, wherein: the plurality of codeword permutations are generated using a permutation matrix; and the permutation matrix is ​​associated with one or more restrictions on one or more positions of the one or more frozen bits, the one or more information bits, or the one or more frozen bits and the one or more information bits.

[0179] Clause 8: The method according to Clause 7, wherein the one or more restrictions include at least one pair of bit positions for freezing bits or for the information bits.

[0180] Clause 9: The method according to Clause 4, wherein the generation includes performing a nonlinear operation on at least one bit position before applying the permutation matrix.

[0181] Clause 10: The method according to Clause 9, wherein the nonlinear operation involves at least one counter bit.

[0182] Clause 11: A method for wireless communication at a first wireless node, the method comprising: obtaining a plurality of codeword permutations corresponding to different payloads, wherein the different payloads include the same first payload portion and second payload portions that differ in deterministic manner, and each codeword permutation corresponds to a second payload portion in the second payload portion; processing the plurality of codeword permutations to obtain the second payload portion; obtaining the first payload portion after obtaining the second payload portion; and performing soft merging on the first payload portion.

[0183] Clause 12: The method according to Clause 11, wherein: the different payloads correspond to Physical Broadcast Channel (PBCH) transmissions; and the second payload portion corresponds to the System Frame Number (SFN) value conveyed in the PBCH transmissions.

[0184] Clause 13: The method according to any one of Clauses 11 to 12, wherein the second payload portion corresponds to a counter value that changes in a deterministic manner in different payloads.

[0185] Clause 14: The method according to Clause 13, wherein: each codeword permutation includes one or more information bits and one or more freeze bits; and when processing the plurality of codeword permutations, counter bits are treated as information bits.

[0186] Clause 15: The method according to Clause 13, wherein obtaining the first payload portion comprises: identifying an inverse transform associated with a second payload portion of the second payload portion; and applying the inverse transform.

[0187] Clause 16: The method according to Clause 15, wherein the inverse transformation is associated with a matrix formed by a first matrix having lower triangular (LT) properties and a second matrix having anti-triangular upper triangular (ADT) properties.

[0188] Clause 17: The method according to any one of Clauses 11 to 16, wherein the processing of the plurality of codeword permutations to obtain the second payload portion involves nonlinear operations.

[0189] Clause 18: The method according to Clause 17, wherein: the second payload portion corresponds to a counter value that changes deterministically in different payloads; and the nonlinear operation involves at least one counter value bit.

[0190] Clause 19: The method according to Clause 15 further includes performing an error checking operation after applying the inverse transform.

[0191] Clause 20: The method according to Clause 15, wherein the identifier of the inverse transform associated with one of the second payload portions includes mapping the decoded bits of the second payload to a permutation index.

[0192] Clause 21: The method according to Clause 15, wherein the application of the inverse transform results in the depermutation of the codeword permutation.

[0193] Clause 22: An apparatus comprising: at least one memory including executable instructions; and at least one processor configured to execute the executable instructions and cause the apparatus to perform a method according to any one of Clauses 1 to 21.

[0194] Clause 23: An apparatus comprising components for performing the method according to any one of Clauses 1 to 21.

[0195] Clause 24: A non-transitory computer-readable medium comprising executable instructions that, when executed by at least one processor of a device, cause the device to perform the method according to any one of Clauses 1 to 21.

[0196] Clause 25: A computer program product embodied on a computer-readable storage medium, the computer-readable storage medium including code for performing the method according to any one of Clauses 1 to 21.

[0197] Clause 26: A network node (e.g., a network entity such as a gNB) comprising: at least one transceiver; at least one memory including executable instructions; and at least one processor configured to execute the executable instructions and cause the wireless node to perform the method according to any one of Clauses 1 to 10, wherein the at least one transceiver is configured to transmit the codeword permutation.

[0198] Clause 27: A network node (e.g., a UE) comprising: at least one transceiver; at least one memory including executable instructions; and at least one processor configured to execute the executable instructions and cause the network node to perform a method according to any one of Clauses 11 to 21, wherein the at least one transceiver is configured to receive the codeword permutation.

[0199] Additional Notes The foregoing description is provided to enable any person skilled in the art to practice the various aspects described herein. The examples discussed herein do not limit the scope, applicability, or aspects set forth in the claims. Various modifications to these aspects will be apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects. For example, the function and arrangement of the elements discussed may be changed without departing from the scope of this disclosure. Various processes or components may be omitted, substituted, or added as appropriate in various examples. For example, the described methods may be performed in a different order than described, and various actions may be added, omitted, or combined. Furthermore, features described in some examples may be combined in some other examples. For example, any number of aspects set forth herein may be used to implement an apparatus or practice. Moreover, the scope of this disclosure is intended to cover such apparatuses or methods practiced using other structures, functionalities, or structures and functionalities that complement or replace the various aspects of this disclosure set forth herein. It should be understood that any aspect of the disclosure herein may be embodied by one or more elements of the claims.

[0200] The various exemplary logic blocks, modules, and circuits described in this disclosure can be implemented or executed using a general-purpose processor, graphics processing unit (GPU), neural processing unit (NPU), digital signal processor (DSP), ASIC, field-programmable gate array (FPGA) or other programmable logic device (PLD), discrete gate or transistor logic unit, discrete hardware component, or any combination thereof designed to perform the functions described herein. While the general-purpose processor may be a microprocessor, in alternative embodiments, the processor may be any commercially available processor, controller, microcontroller, or state machine. The processor may also be implemented as a combination of computing devices, such as a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors working in conjunction with a DSP core, a system-on-a-chip (SoC), or any other such configuration.

[0201] As used herein, the term wireless node may refer to a type of network node (e.g., a network entity or user equipment (UE)). In this context, a network entity may be a base station (e.g., a gNB) or a module of a disassembled base station (e.g., a CU, DU, and / or RU).

[0202] While this disclosure may describe certain operations as being performed by one type of wireless node, the same or similar operations may also be performed by another type of wireless node. For example, operations performed by a network entity may also (or alternatively) be performed by a UE. Similarly, operations performed by a UE may also (or alternatively) be performed by a network entity.

[0203] Furthermore, while this disclosure may describe certain types of communication between different types of wireless nodes (e.g., between a network entity and a UE), the same or similar types of communication may occur between the same type of wireless nodes (e.g., in a peer-to-peer scenario, between network entities or between UEs). Additionally, communication may occur in the opposite direction to what is described (e.g., a UE may send a request to a network entity, and the network entity may send a response; or a network entity may send a request to a UE, and the UE may send a response).

[0204] As used herein, "processor," "at least one processor," or "one or more processors" generally refers to a single processor configured to perform one or more operations, or multiple processors configured to collectively perform one or more operations. In the case of multiple processors, the execution of one or more operations may be divided among different processors, but one processor may perform multiple operations, and multiple processors may collectively perform a single operation. Similarly, "memory," "at least one memory," or "one or more memory" generally refers to a single memory configured to store data and / or instructions, or multiple memories configured to collectively store data and / or instructions.

[0205] The components for encoding, output, acquisition, processing, and soft merging may include one or more processors, as referenced above. Figure 15 One or more processors in the described processors.

[0206] As used in this article, the phrase “at least one of” in a list of items refers to any combination of these items, including a single member. For example, “at least one of a, b, or c” is intended to cover a, b, c, ab, ac, bc, and abc, as well as any combination with multiple identical elements (e.g., aa, aaa, aab, aac, abb, acc, bb, bbb, bbc, cc, and ccc, or any other ordering of a, b, and c).

[0207] As used herein, the term "determine" encompasses a wide variety of actions. For example, "determine" can include calculation, operation, processing, deduction, investigation, searching (e.g., searching in a table, database, or other data structure), and probing. Additionally, "determine" can include receiving (e.g., receiving information), accessing (e.g., accessing data in memory), and so on. Furthermore, "determine" can include parsing, selecting, picking, and building.

[0208] The methods disclosed herein include one or more actions for implementing the methods. These actions may be interchanged without departing from the scope of the claims. In other words, unless a specified order of actions is specified, the order and / or use of a particular action may be modified without departing from the scope of the claims. Furthermore, the various operations of the methods described above may be performed by any suitable component capable of performing the corresponding function. This component may include various hardware and / or software components and / or modules, including but not limited to circuits, application-specific integrated circuits (ASICs), or processors. Software should be broadly interpreted as instructions, instruction sets, code, code segments, program code, programs, subroutines, software modules, applications, software applications, software packages, routines, subroutines, objects, executables, threads of execution, procedures, or functions, whether referred to as software, firmware, middleware, microcode, hardware description languages, or other terms.

[0209] The following claims are not intended to be limited to the aspects shown herein, but should be given the full scope consistent with the language of the claims. Within the claims, unless specifically stated otherwise, reference to the singular form of an element is not intended to mean “one and only one,” but rather “one or more.” Unless otherwise specifically stated, the term “some” refers to one or more. No element of any claim shall be interpreted in accordance with 35 USC §112(f) unless that element is explicitly stated using the phrase “for a component of.” All structural and functional equivalents of the elements throughout the various aspects described herein that are known to a person of ordinary skill in the art, or will be known later, are expressly incorporated herein by reference and are intended to be covered by the claims. Furthermore, nothing disclosed herein is intended to be offered to the public, whether or not such disclosure is explicitly recited in the claims.

Claims

1. An apparatus for wireless communication, the apparatus comprising: At least one memory, the at least one memory including computer-executable instructions; and One or more processors, the one or more processors being configured to execute the computer-executable instructions and cause the device to: Different payloads are encoded using polar codes to generate multiple codeword permutations, wherein each of the different payloads includes a first payload portion that is the same for the different payloads and a second payload portion that is different in a deterministic manner among the different payloads, and each codeword permutation corresponds to a second payload portion in the second payload portion; as well as The multiple codeword substitutions are output sequentially.

2. The apparatus of claim 1, wherein the different payloads correspond to Physical Broadcast Channel (PBCH) transmissions; and the second payload portion corresponds to a System Frame Number (SFN) value transmitted in the PBCH transmissions.

3. The apparatus of claim 1, wherein the second payload portion corresponds to a counter value that changes deterministically in different payloads.

4. The apparatus according to claim 3, wherein: In order to sequentially output the plurality of codeword permutations, the one or more processors are further configured to output a first codeword permutation corresponding to a first counter value, and subsequently output a second codeword permutation corresponding to a second counter value; and The second codeword permutation is generated by applying the permutation matrix to the first codeword permutation.

5. The apparatus of claim 4, wherein the permutation matrix is ​​associated with a matrix formed by a first matrix having a lower triangular (LT) property and a second matrix having an anti-triangular upper triangular (ADT) property.

6. The apparatus according to claim 4, wherein: Each codeword permutation includes one or more information bits and one or more frozen bits; and When the first codeword permutation and the second codeword permutation are generated, the counter bit is treated as a frozen bit.

7. The apparatus according to claim 6, wherein: The multiple codeword permutations are generated using a permutation matrix; and The permutation matrix is ​​associated with one or more restrictions on one or more positions of the one or more frozen bits, the one or more information bits, or the one or more frozen bits and the one or more information bits.

8. The apparatus of claim 7, wherein the one or more restrictions include at least one pair of bit positions for freezing bits or for restricting the information bits.

9. The apparatus of claim 4, wherein, in order to generate the second codeword permutation, the one or more processors are further configured to perform a nonlinear operation on at least one bit position before applying the permutation matrix.

10. The apparatus of claim 9, wherein the nonlinear operation involves at least one counter bit.

11. The apparatus of claim 1, further comprising at least one transceiver configured to sequentially transmit the plurality of codeword permutations, wherein the apparatus is configured as a network entity.

12. An apparatus for wireless communication, the apparatus comprising: At least one memory, the at least one memory including computer-executable instructions; and One or more processors, the one or more processors being configured to execute the computer-executable instructions and cause the device to: A plurality of codeword permutations corresponding to different payloads are obtained, wherein the different payloads include the same first payload portion and second payload portions that differ in deterministic manner, and each codeword permutation corresponds to one of the second payload portions; Process the multiple codeword permutations to obtain the second payload portion; The first payload portion is obtained after the second payload portion is obtained; as well as The first payload portion is soft-merged.

13. The apparatus according to claim 12, wherein: The different payloads correspond to transmissions via the Physical Broadcast Channel (PBCH); and The second payload portion corresponds to the system frame number (SFN) value conveyed in the PBCH transmission.

14. The apparatus of claim 12, wherein the second payload portion corresponds to a counter value that changes deterministically in different payloads.

15. The apparatus according to claim 14, wherein: Each codeword permutation includes one or more information bits and one or more frozen bits; and When processing the multiple codeword permutations, the counter bits are treated as information bits.

16. The apparatus of claim 14, wherein, in order to obtain the first payload portion, the one or more processors are further configured to: Identify the inverse transformation associated with one of the second payload portions; and Apply the inverse transform.

17. The apparatus of claim 16, wherein the inverse transformation is associated with a matrix formed by a first matrix having lower triangular (LT) properties and a second matrix having anti-triangular upper triangular (ADT) properties.

18. The apparatus of claim 16, wherein the one or more processors are further configured to cause the apparatus to: An error checking operation is performed after the inverse transformation is applied.

19. The apparatus of claim 16, wherein, in order to identify the inverse transform associated with one of the second payload portions, the one or more processors are further configured to map the decoded bits of the second payload to a permutation index.

20. The apparatus of claim 16, wherein the application of the inverse transform results in the depermutation of the codeword permutation.

21. The apparatus of claim 12, wherein, in order to process the plurality of codeword permutations to obtain the second payload portion, the one or more processors are further configured to perform nonlinear operations.

22. The apparatus of claim 21, wherein: The second payload portion corresponds to the counter value that changes deterministically in different payloads; and The nonlinear operation involves at least one counter value bit.

23. The apparatus of claim 12, further comprising at least one transceiver configured to receive the plurality of codeword permutations, wherein the apparatus is configured as a user equipment (UE).

24. A method for wireless communication at a network node, the method comprising: A plurality of codeword permutations corresponding to different payloads are obtained, wherein the different payloads include the same first payload portion and second payload portions that differ in deterministic manner, and each codeword permutation corresponds to one of the second payload portions; Process the multiple codeword permutations to obtain the second payload portion; The first payload portion is obtained after the second payload portion is obtained; as well as The first payload portion is soft-merged.

Images