Interleaver design
A memory-free interleaver design for convolutional codes addresses memory constraints and error issues in wireless communication systems by encoding multiple times and outputting one bit stream, enhancing transmission efficiency and reducing errors.
Patent Information
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2024-09-26
- Publication Date
- 2026-04-02
AI Technical Summary
Wireless communication systems face challenges with memory-intensive interleavers used in convolutional codes, particularly in devices with limited memory resources, leading to inefficiencies and errors in data transmission.
A memory-free interleaver design that encodes information bits multiple times, outputting one encoded bit stream at a time, reducing memory requirements and mitigating continuous 2-bit errors.
The solution conserves memory and improves data transmission performance by minimizing memory usage and reducing errors, particularly in devices with limited resources.
Smart Images

Figure CN2024121287_02042026_PF_FP_ABST
Abstract
Description
INTERLEAVER DESIGN
[0001] FIELD OF THE DISCLOSURE
[0002] Aspects of the present disclosure generally relate to wireless communication and specifically relate to techniques, apparatuses, and methods associated with an interleaver design.BACKGROUND
[0003] Wireless communication systems are widely deployed to provide various services, which may involve carrying or supporting voice, text, other messaging, video, data, and / or other traffic. Typical wireless communication systems may employ multiple-access radio access technologies (RATs) capable of supporting communication among multiple wireless communication devices including user devices or other devices by sharing the available system resources (for example, time domain resources, frequency domain resources, spatial domain resources, and / or device transmit power, among other examples) . Such multiple-access RATs are supported by technological advancements that have been adopted in various telecommunication standards, which define common protocols that enable different wireless communication devices to communicate on a local, municipal, national, regional, or global level.
[0004] An example telecommunication standard is New Radio (NR) . NR, which may also be referred to as 5G, is part of a continuous mobile broadband evolution promulgated by the Third Generation Partnership Project (3GPP) . NR (and other RATs beyond NR) may be designed to better support enhanced mobile broadband (eMBB) access, Internet of things (IoT) networks or reduced capability device deployments, and ultra-reliable low latency communication (URLLC) applications. To support these verticals, NR systems may be designed to implement a modularized functional infrastructure, a disaggregated and service-based network architecture, network function virtualization, network slicing, multi-access edge computing, millimeter wave (mmWave) technologies including massive multiple-input multiple-output (MIMO) , licensed and unlicensed spectrum access, non-terrestrial network (NTN) deployments, sidelink and other device-to-device direct communication technologies (for example, cellular vehicle-to-everything (CV2X) communication) , multiple-subscriber implementations, high-precision positioning, and / or radio frequency (RF) sensing, among other examples. As the demand for connectivity continues to increase, further improvements in NR may be implemented, and other RATs, such as 6G and beyond, may be introduced to enable new applications and facilitate new use cases.SUMMARY
[0005] Some aspects described herein relate to a method of wireless communication performed by a transmitter device. The method may include for each iteration of N iterations, encoding a set of bits using a convolution encoder to obtain a respective encoded bit stream, where the convolutional encoder is expressed using N polynomials, and one polynomial is output for each iteration. The method may include transmitting encoded bit streams selected from the respective encoded bit streams.
[0006] Some aspects described herein relate to a method of wireless communication performed by a receiver device. The method may include receiving encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits. The method may include de-interleaving the encoded bit streams. The method may include decoding the encoded bit streams.
[0007] Some aspects described herein relate to an apparatus for wireless communication at a transmitter device. The apparatus may include one or more memories and one or more processors coupled to the one or more memories. The one or more processors may be individually or collectively configured to, for each iteration of N iterations, encode a set of bits using a convolution encoder to obtain a respective encoded bit stream, where the convolutional encoder is expressed using N polynomials, and one polynomial is output for each iteration. The one or more processors may be individually or collectively configured to transmit encoded bit streams selected from the respective encoded bit streams.
[0008] Some aspects described herein relate to an apparatus for wireless communication at a receiver device. The apparatus may include one or more memories and one or more processors coupled to the one or more memories. The one or more processors may be individually or collectively configured to receive encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits. The one or more processors may be individually or collectively configured to de-interleave the encoded bit streams. The one or more processors may be individually or collectively configured to decode the encoded bit streams.
[0009] Some aspects described herein relate to a non-transitory computer-readable medium that stores a set of instructions for wireless communication by a transmitter device. The set of instructions, when executed by one or more processors of the transmitter device, may cause the transmitter device to, for each iteration of N iterations, encode a set of bits using a convolution encoder to obtain a respective encoded bit stream, where the convolutional encoder is expressed using N polynomials, and one polynomial is output for each iteration. The set of instructions, when executed by one or more processors of the transmitter device, may cause the transmitter device to transmit encoded bit streams selected from the respective encoded bit streams.
[0010] Some aspects described herein relate to a non-transitory computer-readable medium that stores a set of instructions for wireless communication by a receiver device. The set of instructions, when executed by one or more processors of the receiver device, may cause the receiver device to receive encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits. The set of instructions, when executed by one or more processors of the receiver device, may cause the receiver device to de-interleave the encoded bit streams. The set of instructions, when executed by one or more processors of the receiver device, may cause the receiver device to decode the encoded bit streams.
[0011] Some aspects described herein relate to an apparatus for wireless communication. The apparatus may include means for, for each iteration of N iterations, encoding a set of bits using a convolution encoder to obtain a respective encoded bit stream, where the convolutional encoder is expressed using N polynomials, and one polynomial is output for each iteration. The apparatus may include means for transmitting encoded bit streams selected from the respective encoded bit streams.
[0012] Some aspects described herein relate to an apparatus for wireless communication. The apparatus may include means for receiving encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits. The apparatus may include means for de-interleaving the encoded bit streams. The apparatus may include means for decoding the encoded bit streams.
[0013] Aspects of the present disclosure may generally be implemented by or as a method, apparatus, system, computer program product, non-transitory computer-readable medium, user equipment, base station, network node, network entity, wireless communication device, and / or processing system as substantially described with reference to, and as illustrated by, this specification and accompanying drawings.
[0014] The foregoing paragraphs of this section have broadly summarized some aspects of the present disclosure. These and additional aspects and associated advantages will be described hereinafter. The disclosed aspects may be used as a basis for modifying or designing other aspects for carrying out the same or similar purposes of the present disclosure. Such equivalent aspects do not depart from the scope of the appended claims. Characteristics of the aspects disclosed herein, both their organization and method of operation, together with associated advantages, will be better understood from the following description when considered in connection with the accompanying drawings.BRIEF DESCRIPTION OF THE DRAWINGS
[0015] The appended drawings illustrate some aspects of the present disclosure but are not limiting of the scope of the present disclosure because the description may enable other aspects. Each of the drawings is provided for purposes of illustration and description, and not as a definition of the limits of the claims. The same or similar reference numbers in different drawings may identify the same or similar elements.
[0016] Fig. 1 is a diagram illustrating an example of a wireless communication network, in accordance with the present disclosure.
[0017] Fig. 2 is a diagram illustrating an example disaggregated network node architecture, in accordance with the present disclosure.
[0018] Fig. 3 is a diagram illustrating an aspect of energy harvesting, in accordance with the present disclosure.
[0019] Fig. 4 is a diagram illustrating an aspect of backscatter communication, in accordance with the present disclosure.
[0020] Fig. 5 is a diagram illustrating an example of a coding chain, in accordance with the present disclosure.
[0021] Fig. 6 is a diagram illustrating an example of rate matching block components, in accordance with the present disclosure.
[0022] Fig. 7 is a diagram illustrating an example of a convolutional code (CC) encoder and an interleaver, in accordance with the present disclosure.
[0023] Fig. 8 is a diagram illustrating an example of an interleaver design, in accordance with the present disclosure.
[0024] Fig. 9 is a diagram illustrating an example of an interleaver for memory conservation, in accordance with the present disclosure.
[0025] Fig. 10 is a diagram illustrating an example of using an interleaver design, in accordance with the present disclosure.
[0026] Fig. 11 is a diagram illustrating an example of an interleaver design, in accordance with the present disclosure.
[0027] Fig. 12 is a diagram illustrating an example of an interleaver design, in accordance with the present disclosure.
[0028] Fig. 13 is a diagram illustrating an example of inter-column permutation patterns, in accordance with the present disclosure.
[0029] Fig. 14 is a diagram illustrating an example process performed, for example, at a transmitter device or an apparatus of a transmitter device, in accordance with the present disclosure.
[0030] Fig. 15 is a diagram illustrating an example process performed, for example, at a receiver device or an apparatus of a receiver device, in accordance with the present disclosure.
[0031] Fig. 16 is a diagram of an example apparatus for wireless communication, in accordance with the present disclosure.
[0032] Fig. 17 is a diagram of an example apparatus for wireless communication, in accordance with the present disclosure.DETAILED DESCRIPTION
[0033] Various aspects of the present disclosure are described hereinafter with reference to the accompanying drawings. However, aspects of the present disclosure may be embodied in many different forms. The present disclosure is not to be construed as limited to any specific aspect illustrated by or described with reference to an accompanying drawing or otherwise presented in this disclosure. Rather, these aspects are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art. One skilled in the art may appreciate that the scope of the disclosure is intended to cover any aspect of the disclosure disclosed herein, whether implemented independently of or in combination with any other aspect of the disclosure. For example, an apparatus may be implemented or a method may be practiced using various combinations or quantities of the aspects set forth herein. In addition, the scope of the disclosure is intended to cover an apparatus having, or a method that is practiced using, other structures and / or functionalities in addition to or other than the structures and / or functionalities with which various aspects of the disclosure set forth herein may be practiced. Any aspect of the disclosure disclosed herein may be embodied by one or more elements of a claim.
[0034] Several aspects of telecommunication systems will now be presented with reference to various methods, operations, apparatuses, and techniques. These methods, operations, apparatuses, and techniques will be described in the following detailed description and illustrated in the accompanying drawings by various blocks, modules, components, circuits, steps, processes, or algorithms (collectively referred to as “elements” ) . These elements may be implemented using hardware, software, or a combination of hardware and software. Whether such elements are implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system.
[0035] Convolutional codes (CCs) are error-correcting codes used to encode data before transmission. Unlike block codes, where the data is split into fixed-size blocks, convolutional codes process data streams through a sequence of shifts and taps, producing encoded bits that depend on the current input bit as well as previous input bits. A coding chain of a CC may produce a CC encoder output stream of and for k = 0, …, D –1, where D is the number of bits. Each output stream is denoted by In general, the output stream is a serial sequence of three polynomials (e.g., ) , and CC uses parallel output streams for easy rate-matching. Example 500 shows a rate matching block 502 where streams are interleaved using sub-block interleavers (three output streams for coding rate of 1 / 3) , followed by the collection of bits that may include the generation of a circular buffer. A circular buffer is an array of a fixed size that maintains pointers that wrap around to the beginning when the end of the array is reached (in a circular effect) .
[0036] An interleaver requires a memory buffer to store the output bits of the CC encoder before interleaving them. This storage has a memory cost. For a rate of 1 / 6 CC encoder and a rectangular interleaver, where the CC encoder is 1-in 6-out, and the input bit length is D, the memory cost is D × 6 bits in the memory buffer. The CC encoder may require substantial memory for large code blocks, as the interleaver size (the product of rows and columns) matches the coded block size. Additionally, circular buffers demand significant memory. An A-IoT device memory and other small-memory devices may not support the required size for CC encoding.
[0037] Various aspects relate generally to bit encoding. Some aspects more specifically relate to a memory-free interleaver that achieves interleaving without memory costs. An interleaver with an input bit length of D and a CC rate of 1 / N (e.g., 1 / 6) may encode a set of information bits N times (6 times) , and each time only outputs one of N polynomials. That is, the interleaver encodes the information bits six times (N = 6 iterations) . During the k-th encoding (each iteration) , the interleaver encodes all of the information bits but only outputs the codewords from polynomial Gk-1 (instead of all 6 polynomials or all 6 bit streams) .
[0038] Particular aspects of the subject matter described in this disclosure can be implemented to realize one or more of the following potential advantages. By outputting one encoded bit stream for transmission at a time, rather than 6 bit streams, the transmitter conserves memory by not storing the other 5 bit streams.
[0039] For device-to-reader (D2R) transmission, line coding and a forward error correction (FEC) scheme may be concatenated. However, continuous 2-bit errors may occur when using the concatenated FEC and line coding for D2R transmission. A line coding decoder may generate the continuous 2-bit errors, which may reduce the performance of FEC.
[0040] In some aspects, an interleaver design may include a (simple) one-row inter-leaver, to mitigate the 2-bit errors and conserve signaling resources. The interleaver may use a small size (e.g., L) inter-column permutation pattern for the interleaver. This pattern may be applied to every L input bits, such that the interleaver size is equal to L. The difference over an interleaver with sub-block interleavers may be that the row size is fixed at one. A reason for using one row is that the interleaver may separate adjacent bits without requiring a large separation distance.
[0041] As described above, wireless communication systems may be deployed to provide various services, which may involve carrying or supporting voice, text, other messaging, video, data, and / or other traffic. Some wireless communications systems may employ multiple-access radio access technologies (RATs) . The multiple-access RATs may be capable of supporting communication with multiple wireless communication devices by sharing the available system resources (for example, time domain resources, frequency domain resources, spatial domain resources, and / or device transmit power, among other examples) . Examples of such multiple-access RATs include code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, frequency division multiple access (FDMA) systems, orthogonal frequency division multiple access (OFDMA) systems, single-carrier frequency division multiple access (SC-FDMA) systems, and time division synchronous code division multiple access (TD-SCDMA) systems.
[0042] Multiple-access RATs are supported by technological advancements that have been adopted in various telecommunication standards, which define common protocols that enable wireless communication devices to communicate on a local, municipal, enterprise, national, regional, or global level. For example, 5G New Radio (NR) is part of a continuous mobile broadband evolution promulgated by the Third Generation Partnership Project (3GPP) . 5G NR may support enhanced mobile broadband (eMBB) access, Internet of Things (IoT) networks or reduced capability (RedCap) device deployments, ultra-reliable low-latency communication (URLLC) applications, and / or massive machine-type communication (mMTC) , among other examples.
[0043] To support these and other target verticals, a wireless communication system may be designed to implement a modularized functional infrastructure, a disaggregated and service-based network architecture, network function virtualization, network slicing, multi-access edge computing, millimeter wave (mmWave) technologies including massive multiple-input multiple-output (MIMO) , beamforming, IoT device or RedCap device connectivity and management, industrial connectivity, licensed and unlicensed spectrum access, sidelink and other device-to-device direct communication (for example, cellular vehicle-to-everything (CV2X) communication) , frequency spectrum expansion, overlapping spectrum use, small cell deployments, non-terrestrial network (NTN) deployments, device aggregation, advanced duplex communication (for example, sub-band full-duplex (SBFD) ) , multiple-subscriber implementations, high-precision positioning, radio frequency (RF) sensing, network energy savings (NES) , low-power signaling and radios, and / or artificial intelligence or machine learning (AI / ML) , among other examples.
[0044] The foregoing and other technological improvements may support use cases, such as wireless fronthauls, wireless midhauls, wireless backhauls, wireless data centers, extended reality (XR) and metaverse applications, meta services for supporting vehicle connectivity, holographic and mixed reality communication, autonomous and collaborative robots, vehicle platooning and cooperative maneuvering, sensing networks, gesture monitoring, human-brain interfacing, digital twin applications, asset management, and universal coverage applications using non-terrestrial and / or aerial platforms, among other examples.
[0045] As the demand for connectivity continues to increase, further improvements in NR may be implemented, and other RATs, such as 6G and beyond, may be introduced to enable new applications and facilitate new use cases. The methods, operations, apparatuses, and techniques described herein may enable one or more of the foregoing technologies or new technologies and / or support one or more of the foregoing use cases or new use cases.
[0046] Fig. 1 is a diagram illustrating an example of a wireless communication network 100, in accordance with the present disclosure. The wireless communication network 100 may be or may include elements of a 5G (or NR) network or a 6G network, among other examples. The wireless communication network 100 may include multiple network nodes 110. For example, in Fig. 1, the wireless communication network 100 includes a network node (NN) 110a and a network node 110b. The network nodes 110 may support communications with multiple user equipment (UEs) 120. For example, in Fig. 1, the network nodes 110 support communication with a UE 120a, a UE 120b, and a UE 120c. In some examples, a UE 120 may also communicate with other UEs 120 and a network node 110 may communicate with a core network and with other network nodes 110.
[0047] The network nodes 110 and the UEs 120 of the wireless communication network 100 may communicate using the electromagnetic spectrum, which may be subdivided by frequency or wavelength into various classes, bands, carriers, and / or channels. For example, devices of the wireless communication network 100 may communicate using one or more operating bands. In some aspects, multiple wireless communication networks 100 may be deployed in a given geographic area. Each wireless communication network 100 may support a particular RAT (which may also be referred to as an air interface) and may operate on one or more carrier frequencies in one or more frequency bands or ranges. In some examples, when multiple RATs are deployed in a given geographic area, each RAT in the geographic area may operate on different frequencies to avoid interference with other RATs. Additionally or alternatively, in some examples, the wireless communication network 100 may implement dynamic spectrum sharing (DSS) , in which multiple RATs are implemented with dynamic bandwidth allocation (for example, based on user demand) in a single frequency band. In some examples, the wireless communication network 100 may support communication over unlicensed spectrum, where access to an unlicensed channel is subject to a channel access mechanism. For example, in a shared or unlicensed frequency band, a transmitting device may perform a channel access procedure, such as a listen-before-talk (LBT) procedure, to contend against other devices for channel access before transmitting on a shared or unlicensed channel.
[0048] Various operating bands have been defined as frequency range designations FR1 (410 MHz through 7.125 GHz) , FR2 (24.25 GHz through 52.6 GHz) , FR3 (7.125 GHz through 24.25 GHz) , FR4a or FR4-1 (52.6 GHz through 71 GHz) , FR4 (52.6 GHz through 114.25 GHz) , and FR5 (114.25 GHz through 300 GHz) . Although a portion of FR1 is greater than 6 GHz, FR1 is often referred to (interchangeably) as a “sub-6 GHz” band in some documents and articles. Similarly, FR2 is often referred to (interchangeably) as a “millimeter wave” band in some documents and articles, despite being different than the extremely high frequency (EHF) band (30 GHz through 300 GHz) , which is identified by the International Telecommunications Union (ITU) as a “millimeter wave” band. The frequencies between FR1 and FR2 are often referred to as mid-band frequencies, which include FR3. Frequency bands falling within FR3 may inherit FR1 characteristics or FR2 characteristics, and thus may effectively extend features of FR1 or FR2 into the mid-band frequencies. Thus, “sub-6 GHz, ” if used herein, may broadly refer to frequencies that are less than 6 GHz, that are within FR1, and / or that are included in mid-band frequencies. Similarly, the term “millimeter wave, ” if used herein, may broadly refer to mid-band frequencies or to frequencies that are within FR2, FR4, FR4-a or FR4-1, FR5, and / or the EHF band. Higher frequency bands may extend 5G NR operation, 6G operation, and / or other RATs beyond 52.6 GHz.
[0049] A network node 110 and / or a UE 120 may include one or more devices, components, or systems that enable communication with other devices, components, or systems of the wireless communication network 100. For example, a UE 120 and a network node 110 may each include one or more chips, system-on-chips (SoCs) , chipsets, packages, or devices that individually or collectively constitute or comprise a processing system, such as a processing system 140 of the UE 120 or a processing system 145 of the network node 110. A processing system (for example, the processing system 140 and / or the processing system 145) includes processor (or “processing” ) circuitry in the form of one or multiple processors, microprocessors, processing units (such as central processing units (CPUs) , graphics processing units (GPUs) , neural processing units (NPUs) (also referred to as neural network processors or deep learning processors (DLPs) ) , and / or digital signal processors (DSPs) ) , processing blocks, application-specific integrated circuits (ASICs) , programmable logic devices (PLDs) , or other discrete gate or transistor logic or circuitry (any one or more of which may be generally referred to herein individually as a “processor” or collectively as “the processor” or “the processor circuitry” ) . Such processors may be individually or collectively configurable or configured to perform various functions or operations described herein. A group of processors collectively configurable or configured to perform a set of functions may include a first processor configurable or configured to perform a first function of the set and a second processor configurable or configured to perform a second function of the set. In some other examples, each of a group of processors may be configurable or configured to perform a same set of functions.
[0050] The processing system 140 and the processing system 145 may each include memory circuitry in the form of one or multiple memory devices, memory blocks, memory elements, or other discrete gate or transistor logic or circuitry, each of which may include or implement tangible storage media such as random-access memory (RAM) or read-only memory (ROM) , or combinations thereof (any one or more of which may be generally referred to herein individually as a “memory” or collectively as “the memory” or “the memory circuitry” ) . One or more of the memories may be coupled (for example, operatively coupled, communicatively coupled, electronically coupled, or electrically coupled) with one or more of the processors and may individually or collectively store processor-executable code or instructions (such as software) that, when executed by one or more of the processors, may configure one or more of the processors to perform various functions or operations described herein. Additionally or alternatively, in some examples, one or more of the processors may be configured to perform various functions or operations described herein without requiring configuration by software. “Software” shall be construed broadly to mean instructions, instruction sets, code, code segments, program code, programs, subprograms, software modules, applications, software applications, software packages, routines, subroutines, objects, executables, threads of execution, procedures, or functions, among other examples, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.
[0051] The processing system 140 and the processing system 145 may each include or be coupled with one or more modems (such as a cellular (for example, a 5G or 6G compliant) modem) . In some examples, one or more processors of the processing system 140 and / or the processing system 145 include or implement one or more of the modems. The processing system 140 and the processing system 145 may also include or be coupled with multiple radios (collectively “the radio” ) , multiple RF chains, or multiple transceivers, each of which may in turn be coupled with one or more of multiple antennas. In some examples, one or more processors of the processing system 140 and / or the processing system 145 include or implement one or more of the radios, RF chains, or transceivers. An RF chain may include one or more filters, mixers, oscillators, amplifiers, analog-to-digital converters (ADCs) , and / or other devices that convert between an analog signal (such as for transmission or reception via an air interface) and a digital signal (such as for processing by the processing system 140 of the UE 120 or by the processing system 145 of the network node 110) .
[0052] A network node 110 and a UE 120 may each include one or multiple antennas or antenna arrays. Typical network nodes 110 and UEs 120 may include multiple antennas, which may be organized or structured into one or more antenna panels, one or more antenna groups, one or more sets of antenna elements, or one or more antenna arrays, among other examples. As used herein, the term “antenna” can refer to one or more antennas, one or more antenna panels, one or more antenna groups, one or more sets of antenna elements, or one or more antenna arrays. The term “antenna panel” can refer to a group of antennas (such as antenna elements) arranged in an array or panel, which may facilitate beamforming by manipulating parameters associated with the group of antennas. The term “antenna module” may refer to circuitry including one or more antennas as well as one or more other components (such as filters, amplifiers, or processors) associated with integrating the antenna module into a wireless communication device such as the network node 110 and the UE 120.
[0053] A network node 110 may be, may include, or may also be referred to as an NR network node, a 5G network node, a 6G network node, a Node B, a gNB, an access point (AP) , a transmission reception point (TRP) , a network entity, a network element, a network equipment, and / or another type of device, component, or system included in a radio access network (RAN) . In various deployments, a network node 110 may be implemented as a single physical node (for example, a single physical structure) or may be implemented as two or more physical nodes (for example, two or more distinct physical structures) . For example, a network node 110 may be a device or system that implements a part of a radio protocol stack, a device or system that implements a full radio protocol stack (such as a full gNB protocol stack) , or a collection of devices or systems that collectively implement the full radio protocol stack. For example, and as shown, a network node 110 may be an aggregated network node having an aggregated architecture, meaning that the network node 110 may implement a full radio protocol stack that is physically and logically integrated within a single physical structure in the wireless communication network 100. For example, an aggregated network node 110 may consist of a single standalone base station or a single TRP that operates with a full radio protocol stack to enable or facilitate communication between a UE 120 and a core network of the wireless communication network 100.
[0054] Alternatively, and as also shown, a network node 110 may be a disaggregated network node (sometimes referred to as a disaggregated base station) , having a disaggregated architecture, meaning that the network node 110 may operate with a radio protocol stack that is physically distributed and / or logically distributed among two or more nodes in the same geographic location or in different geographic locations. An example disaggregated network node architecture is described in more detail below with reference to Fig. 2. In some deployments, disaggregated network nodes 110 may be used in an integrated access and backhaul (IAB) network, in an open radio access network (O-RAN) (such as a network configuration in compliance with the O-RAN Alliance) , or in a virtualized radio access network (vRAN) , also known as a cloud radio access network (C-RAN) , to facilitate scaling by separating network functionality into multiple units or modules that can be individually deployed.
[0055] The network nodes 110 of the wireless communication network 100 may include one or more central units (CUs) , one or more distributed units (DUs) , and one or more radio units (RUs) . A CU may host one or more higher layers, such as a radio resource control (RRC) layer, a packet data convergence protocol (PDCP) layer, and a service data adaptation protocol (SDAP) layer, among other examples. A DU may host one or more of a radio link control (RLC) layer, a medium access control (MAC) layer, and / or one or more higher physical (PHY) layers depending, at least in part, on a functional split, such as a functional split defined by the 3GPP. In some examples, a DU also may host a lower PHY layer that is configured to perform functions, such as a fast Fourier transform (FFT) , an inverse FFT (IFFT) , beamforming, and / or physical random access channel (PRACH) extraction and filtering, among other examples. An RU may perform RF processing functions or lower PHY layer functions, such as an FFT, an IFFT, beamforming, or PRACH extraction and filtering, among other examples, according to a functional split, such as a lower layer split (LLS) . In such an architecture, each RU can be operated to handle over the air (OTA) communication with one or more UEs 120. In some examples, a single network node 110 may include a combination of one or more CUs, one or more DUs, and / or one or more RUs. In some examples, a CU, a DU, and / or an RU may be implemented as a virtual unit, such as a virtual central unit (VCU) , a virtual distributed unit (VDU) , or a virtual radio unit (VRU) , among other examples, which may be implemented as a virtual network function, such as in a cloud deployment.
[0056] Some network nodes 110 (for example, a base station, an RU, or a TRP) may provide communication coverage for a particular geographic area. The term “cell” can refer to a coverage area of a network node 110 or to a network node 110 itself, depending on the context in which the term is used. A network node 110 may support one or more cells (for example, each cell may support communication within an angular (for example, 60 degree) range around the network node) . In some examples, a network node 110 may provide communication coverage for a macro cell, a pico cell, a femto cell, or another type of cell. A macro cell may cover a relatively large geographic area (for example, several kilometers in radius) and may allow unrestricted access by UEs 120 with associated service subscriptions. A pico cell may cover a relatively small geographic area and may also allow unrestricted access by UEs 120 with associated service subscriptions. A femto cell may cover a relatively small geographic area (for example, a home) and may allow restricted access by UEs 120 having association with the femto cell (for example, UEs 120 in a closed subscriber group (CSG) ) . In some examples, a cell may not necessarily be stationary. For example, the geographic area of the cell may move according to the location of an associated mobile network node 110 (for example, a train, a satellite, an unmanned aerial vehicle, or an NTN network node) .
[0057] The wireless communication network 100 may be a heterogeneous network that includes network nodes 110 of different types, such as macro network nodes, pico network nodes, femto network nodes, relay network nodes, aggregated network nodes, and / or disaggregated network nodes, among other examples. Various different types of network nodes 110 may generally transmit at different power levels, serve different coverage areas (for example, a cell 130a and a cell 130b) , and / or have different impacts on interference in the wireless communication network 100 than other types of network nodes 110.
[0058] The UEs 120 may be physically dispersed throughout the coverage area of the wireless communication network 100, and each UE 120 may be stationary or mobile. A UE 120 may be, may include, or may also be referred to as an access terminal, a mobile station, or a subscriber unit. A UE 120 may be, include, or be coupled with a cellular phone (for example, a smart phone) , a personal digital assistant (PDA) , a wireless modem, a wireless communication device, a handheld device, a laptop computer, a cordless phone, a wireless local loop (WLL) station, a tablet, a camera, a netbook, a smartbook, an ultrabook, a medical device, a biometric device, a wearable device (for example, a smart watch, smart clothing, smart glasses, a smart wristband, or smart jewelry) , a gaming device, an entertainment device (for example, a music device, a video device, or a satellite radio) , an XR device, a vehicular component or sensor, a smart meter or sensor, industrial manufacturing equipment, a Global Navigation Satellite System (GNSS) device (such as a Global Positioning System device or another type of positioning device) , a UE function of a network node, and / or any other suitable device or function that may communicate via a wireless medium.
[0059] Some UEs 120 may be classified according to different categories in association with different complexities and / or different capabilities. UEs 120 in a first category may facilitate massive IoT in the wireless communication network 100, and may offer low complexity and / or cost relative to UEs 120 in a second category. UEs 120 in a second category may include mission-critical IoT devices, legacy UEs, baseline UEs, high-tier UEs, advanced UEs, full-capability UEs, and / or premium UEs that are capable of URLLC, eMBB, and / or precise positioning in the wireless communication network 100, among other examples. A third category of UEs 120 may have mid-tier complexity and / or capability (for example, a capability between that of the UEs 120 of the first category and that of the UEs 120 of the second capability) . A UE 120 of the third category may be referred to as a reduced capability UE ( “RedCap UE” ) , a mid-tier UE, an NR-Light UE, and / or an NR-Lite UE, among other examples. RedCap UEs may bridge a gap between the capability and complexity of NB-IoT devices and / or eMTC UEs, and mission-critical IoT devices and / or premium UEs. RedCap UEs may include, for example, wearable devices, IoT devices, industrial sensors, or cameras that are associated with a limited bandwidth, power capacity, and / or transmission range, among other examples. RedCap UEs may support healthcare environments, building automation, electrical distribution, process automation, transport and logistics, or smart city deployments, among other examples.
[0060] In some examples, a network node 110 may be, may include, or may operate as an RU, a TRP, or a base station that communicates with one or more UEs 120 via a radio access link (which may be referred to as a “Uu” link) . The radio access link may include a downlink and an uplink. “Downlink” (or “DL” ) refers to a communication direction from a network node 110 to a UE 120, and “uplink” (or “UL” ) refers to a communication direction from a UE 120 to a network node 110. Downlink and uplink resources may include time domain resources (for example, frames, subframes, slots, and symbols) , frequency domain resources (for example, frequency bands, component carriers (CCs) , subcarriers, resource blocks, and resource elements) , and spatial domain resources (for example, particular transmit directions or beams) .
[0061] Frequency domain resources may be subdivided into bandwidth parts (BWPs) . A BWP may be a block of frequency domain resources (for example, a continuous set of resource blocks (RBs) within a full component carrier bandwidth) that may be configured at a UE-specific level. A UE 120 may be configured with both an uplink BWP and a downlink BWP (which may be the same or different) . Each BWP may be associated with its own numerology (indicating a sub-carrier spacing (SCS) and cyclic prefix (CP) ) . A BWP may be dynamically configured or activated (for example, by a network node 110 transmitting a downlink control information (DCI) configuration to the one or more UEs 120) and / or reconfigured (for example, in real-time or near-real-time) according to changing network conditions in the wireless communication network 100 and / or specific requirements of one or more UEs 120. An active BWP defines the operating bandwidth of the UE 120 within the operating bandwidth of the serving cell. The use of BWPs enables more efficient use of the available frequency domain resources in the wireless communication network 100 because fewer frequency domain resources may be allocated to a BWP for a UE 120 (which may reduce the quantity of frequency domain resources that a UE 120 is required to monitor and reduce UE power consumption by enabling the UE to monitor fewer frequency domain resources) , leaving more frequency domain resources to be spread across multiple UEs 120. Thus, BWPs may also assist in the implementation of lower-capability (for example, RedCap) UEs 120 by facilitating the configuration of smaller bandwidths for communication by such UEs 120 and / or by facilitating reduced UE power consumption.
[0062] As used herein, a downlink signal may be or include a reference signal, control information, or data. For example, downlink reference signals include a primary synchronization signal (PSS) , a secondary SS (SSS) , an SS block (SSB) (for example, that includes a PSS, an SSS, and a physical broadcast channel (PBCH) ) , a demodulation reference signal (DMRS) , a phase tracking reference signal (PTRS) , a tracking reference signal (TRS) , and a channel state information (CSI) reference signal (CSI-RS) , among other examples. A downlink signal carrying control information or data may be transmitted via a downlink channel. Downlink channels may include one or more control channels for transmitting control information and one or more data channels for transmitting data. Downlink reference signals may be transmitted in addition to, or multiplexed with, downlink control channel communications and / or downlink data channel communications. A downlink control channel may be specifically used to transmit DCI from a network node 110 to a UE 120. DCI generally contains the information the UE 120 needs to identify RBs in a subsequent subframe and how to decode them, including a modulation and coding scheme (MCS) or redundancy version parameters. Different DCI formats carry different information, such as scheduling information in the form of downlink or uplink grants, slot formal indicators (SFIs) , preemption indicators (PIs) , transmit power control (TPC) commands, hybrid automatic repeat request (HARQ) information, new data indicators (NDIs) , among other examples. A downlink data channel may be used to transmit downlink data (for example, user data associated with a UE 120) from a network node 110 to a UE 120. Downlink control channels may include physical downlink control channels (PDCCHs) , and downlink data channels may include physical downlink shared channels (PDSCHs) . Control information or data communications may be transmitted on a PDCCH and PDSCH, respectively. For example, a PDCCH can carry DCI, while a PDSCH can carry a MAC control element (MAC-CE) , an RRC message, or user data, among other examples. Each PDSCH may carry one or more transport blocks (TBs) of data.
[0063] As used herein, an uplink signal may include a reference signal, control information, or data. For example, uplink reference signals include a sounding reference signal (SRS) , a PTRS, and a DMRS, among other examples. An uplink signal carrying control information or data may be transmitted via an uplink channel. An uplink channel may include one or more control channels for transmitting control information and one or more data channels for transmitting data. Uplink reference signals may be transmitted in addition to, or multiplexed with, uplink control channel communications and / or uplink data channel communications. An uplink control channel may be specifically used to transmit uplink control information (UCI) from a UE 120 to a network node 110. An uplink data channel may be used to transmit uplink data (for example, user data associated with a UE 120) from a UE 120 to a network node 110. Uplink control channels may include physical uplink control channels (PUCCHs) , and uplink data channels may include physical uplink shared channels (PUSCHs) . Control information or data communications may be transmitted on a PUCCH and PUSCH, respectively. For example, a PUCCH can carry UCI, while a PUSCH can carry a MAC-CE, an RRC message, or user data, among other examples. UCI can include a scheduling request (SR) , HARQ feedback information (for example, a HARQ acknowledgement (ACK) indication or a HARQ negative acknowledgement (NACK) indication) , uplink power control information (for example, an uplink TPC parameter) , and / or CSI, among other examples. CSI can include a channel quality indicator (CQI) (indicative of downlink channel conditions to facilitate selection of transmission parameters, such as an MCS, by a network node 110) , a precoding matrix indicator (PMI) , a CSI-RS resource indicator (CRI) (for example, indicative of a beam used to transmit a CSI-RS) , an SS / PBCH resource block indicator (SSBRI) (for example, indicative of a beam used to transmit an SSB) , a layer indicator (LI) , a rank indicator (RI) , and / or measurement information (for example, a layer 1 (L1) -reference signal received power (RSRP) parameter, a received signal strength indicator (RSSI) parameter, a reference signal received quality (RSRQ) parameter, among other examples) which can be used for beam management, among other examples. Each PUSCH may carry one or more TBs of data.
[0064] The information (for example, data, control information, or reference signal information) transmitted by a network node 110 to a UE 120, or vice versa, may be represented as a sequence of binary bits that are mapped (for example, modulated) to an analog signal waveform (for example, a discrete Fourier transform (DFT) -spread-orthogonal frequency division multiplexing (OFDM) (DFT-s-OFDM) waveform or a CP-OFDM waveform) that is transmitted by the network node 110 or UE 120 over a wireless communication channel. In some examples, the network node 110 or the UE 120 (for example, using the processing system 145 or the processing system 140, respectively) may select an MCS (for example, an order of quadrature amplitude modulation (QAM) , such as 64-QAM, 128-QAM, or 256-QAM, among other examples) for a downlink signal or an uplink signal. For example, the network node 110 may select an MCS for a downlink signal in accordance with UCI received from the UE 120. The network node 110 may transmit, to the UE 120, an indication of the selected MCS for the downlink signal, such as via DCI that schedules the downlink signal. As another example, the network node 110 may transmit, and the UE 120 may receive, an indication of an MCS to be applied for the one or more uplink signals, such as via DCI scheduling transmission of the one or more uplink signals.
[0065] The network node 110 or the UE 120 (such as by using the processing system 145 or the processing system 140, respectively, and / or one or more coupled modems) may perform signal processing on the information (such as filtering, amplification, modulation, digital-to-analog conversion, an IFFT operation, multiplexing, interleaving, mapping, and / or encoding, among other examples) to generate a processed signal in accordance with the selected MCS. In some examples, the network node 110 or the UE 120 (for example, using the processing system 145 or the processing system 140, respectively, and / or one or more coupled encoders or modems) may perform a channel coding operation or a forward error correction (FEC) operation to control errors in transmitted information. For example, the network node 110 or the UE 120 may perform an encoding operation to generate encoded information (such as by selectively introducing redundancy into the information, typically using an error correction code (ECC) , such as a polar code or a low-density parity-check (LDPC) code) . The network node 110 or the UE 120 (for example, using the processing system 145 and / or one or more modems) may further perform spatial processing (for example, precoding) on the encoded information to generate one or more processed or precoded signals for downlink or uplink transmission, respectively. In some examples, the network node 110 or the UE 120 may perform codebook- based precoding or non-codebook-based precoding. Codebook-based precoding may involve selecting a precoder (for example, a precoding matrix) using a codebook. For example, the network node 110 may provide precoding information indicating which precoder, defined by the codebook, is to be used by the UE 120. Non-codebook-based precoding may involve selecting or deriving a precoder based on, or otherwise associated with, one or more downlink or uplink signal measurements. The network node 110 or the UE 120 may transmit the processed downlink or uplink signals, respectively, via one or more antennas.
[0066] The network node 110 or the UE 120 may receive uplink signals or downlink signals, respectively, via one or more antennas. The network node 110 or the UE 120 (for example, using the processing system 145 or the processing system 140, respectively, and / or one or more coupled modems) may perform signal processing (for example, in accordance with the MCS) on the received uplink or downlink signals, respectively (such as filtering, amplification, demodulation, analog-to-digital conversion, an FFT operation, demultiplexing, deinterleaving, de-mapping, equalization, interference cancellation, and / or decoding, among other examples) , to map the received signal (s) to a sequence of binary bits (for example, received information) that estimates the information transmitted by the network node 110 or the UE 120 via the downlink or uplink signals. The network node 110 or the UE 120 (for example, using the processing system 145 or the processing system 140, respectively, and / or a coupled decoder or one or more modems) may decode the received information (such as by using an ECC, a decoding operation, and / or an FEC operation) to detect errors and / or correct bit errors in the received information to generate decoded information. The decoded information may estimate the information transmitted via the downlink or uplink signals.
[0067] In some examples, a UE 120 and a network node 110 may perform MIMO communication. “MIMO” generally refers to transmitting or receiving multiple signals (such as multiple layers or multiple data streams) simultaneously over the same time and frequency resources. MIMO techniques generally exploit multipath propagation. A network node 110 and / or UE 120 may communicate using massive MIMO, multi-user MIMO, or single-user MIMO, which may involve rapid switching between beams or cells. For example, the amplitudes and / or phases of signals transmitted via antenna elements and / or sub-elements may be modulated and shifted relative to each other (such as by manipulating a phase shift, a phase offset, and / or an amplitude) to generate one or more beams, which is referred to as beamforming. For example, the network node 110b may generate one or more beams 160a, and the UE 120b may generate one or more beams 160b. The term “beam” may refer to a directional transmission of a wireless signal toward a receiving device or otherwise in a desired direction, a directional reception of a wireless signal from a transmitting device or otherwise in a desired direction, a direction associated with a directional transmission or directional reception, a set of directional resources associated with a signal transmission or signal reception (for example, an angle of arrival, a horizontal direction, and / or a vertical direction) , a set of parameters that indicate one or more aspects of a directional signal, a direction associated with the signal, and / or a set of directional resources associated with the signal, among other examples.
[0068] MIMO may be implemented using various spatial processing or spatial multiplexing operations. In some examples, MIMO may include a massive MIMO technique which may be associated with an increased (for example, “massive” ) quantity of antennas at the network node 110 and / or at the UE 120, such as in a network implementing mmWave technology. Massive MIMO may improve communication reliability by enabling a network node 110 and / or a UE 120 to communicate the same data across different propagation (or spatial) paths. In some examples, MIMO may support simultaneous transmission to multiple receivers, referred to as multi-user MIMO (MU-MIMO) . Some RATs may employ MIMO techniques, such as multi-TRP (mTRP) operation (including redundant transmission or reception on multiple TRPs) , reciprocity in the time domain or the frequency domain, single-frequency-network (SFN) transmission, or non-coherent joint transmission (NCJT) .
[0069] To support MIMO techniques, the network node 110 and the UE 120 may perform one or more beam management operations, such as an initial beam acquisition operation, one or more beam refinement operations, and / or a beam recovery operation. For example, an initial beam acquisition operation may involve the network node 110 transmitting signals (for example, SSBs, CSI-RSs, or other signals) via respective beams (for example, of the beams 160a of the network node 110) and the UE 120 receiving and measuring the signal (s) via respective beams of multiple beams (for example, from the beams 160b of the UE 120) to identify a best beam (or beam pair) for communication between the UE 120 and the network node 110. For example, the UE 120 may transmit an indication (for example, in a message associated with a random access channel (RACH) operation) of a (best) identified beam of the network node 110 (for example, by indicating an SSBRI or other identifier associated with the beam) . A beam refinement operation may involve a first device (for example, the UE 120 or the network node 110) transmitting signal (s) via a subset of beams (for example, identified based on, or otherwise associated with, measurements reported as part of one or more other beam management operations) . A second device (for example, the network node 110 or the UE 120) may receive the signal (s) via a single beam (for example, to identify the best beam for communication from the subset of beams) . The beam (s) may be identified via one or more spatial parameters, such as a transmission configuration indicator (TCI) state and / or a quasi co-location (QCL) parameter, among other examples. The network node 110 and the UE 120 may increase reliability and / or achieve efficiencies in throughput, signal strength, and / or other signal properties for massive MIMO operations by performing the beam management operations.
[0070] Some aspects and techniques as described herein may be implemented, at least in part, using an artificial intelligence (AI) program (for example, referred to herein as an “AI / ML model” ) , such as a program that includes a machine learning (ML) model and / or an artificial neural network (ANN) model. The AI / ML model may be deployed at one or more devices 165 (for example, a network node 110 and / or UEs 120) . For example, the one or more devices 165 may include a UE 120 (for example, the processing system 140) , a network node 110 (for example, the processing system 145) , one or more servers, and / or one or more components of a cloud computing network, among other examples. In some examples, the AI / ML model (or an instance of the AI / ML model) may be deployed at multiple devices (for example, a first portion of the AI / ML model may be deployed at a UE 120 and a second portion of the AI / ML model may be deployed at a network node 110) . In other examples, a first AI / ML model may be deployed at a UE 120 and a second AI / ML model may be deployed at a network node 110. The AI / ML model (s) may be configured to enhance various aspects of the wireless communication network 100. For example, the AI / ML model (s) may be trained to identify patterns or relationships in data corresponding to the wireless communication network 100, a device, and / or an air interface, among other examples. The AI / ML model (s) may support operational decisions relating to one or more aspects associated with wireless communications devices, networks, or services.
[0071] In some aspects, a transmitter device (e.g., a UE 120, an A-IoT device, a passive UE, a semi-passive UE) may include a communication manager 150. As described in more detail elsewhere herein, the communication manager 150 may for each iteration of N iterations, encoding a set of bits using a convolution encoder to obtain a respective encoded bit stream, where the convolutional encoder is expressed using N polynomials, and one polynomial is output for each iteration; and transmitting encoded bit streams selected from the respective encoded bit streams. Additionally, or alternatively, the communication manager 150 may perform one or more other operations described herein.
[0072] In some aspects, a reader device (e.g., a network node 110, a UE 120) may include a communication manager 150 or 155. As described in more detail elsewhere herein, the communication manager 150 or 155 may receive encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits; de-interleave the encoded bit streams; and decode the encoded bit streams. Additionally, or alternatively, the communication manager 150 or 155 may perform one or more other operations described herein.
[0073] Fig. 2 is a diagram illustrating an example disaggregated network node architecture 200, in accordance with the present disclosure. One or more components of the example disaggregated network node architecture 200 may be, may include, or may be included in one or more network nodes (such one or more network nodes 110) . The disaggregated network node architecture 200 may include a CU 210 that can communicate directly with a core network 220 via a backhaul link, or that can communicate indirectly with the core network 220 via one or more disaggregated control units, such as a non-real-time (Non-RT) RAN intelligent controller (RIC) 250 associated with a Service Management and Orchestration (SMO) Framework 260 and / or a near-real-time (Near-RT) RIC 270 (for example, via an E2 link) . The CU 210 may communicate with one or more DUs 230 via respective midhaul links, such as via F1 interfaces. Each of the DUs 230 may communicate with one or more RUs 240 via respective fronthaul links. Each of the RUs 240 may communicate with one or more UEs 120 via respective RF access links. In some deployments, a UE 120 may be simultaneously served by multiple RUs 240.
[0074] Each of the components of the disaggregated network node architecture 200, including the CUs 210, the DUs 230, the RUs 240, the Near-RT RICs 270, the Non-RT RICs 250, and the SMO Framework 260, may include one or more interfaces or may be coupled with one or more interfaces for receiving or transmitting signals, such as data or information, via a wired or wireless transmission medium.
[0075] In some aspects, the CU 210 may be logically split into one or more CU user plane (CU-UP) units and one or more CU control plane (CU-CP) units. A CU-UP unit may communicate bidirectionally with a CU-CP unit via an interface, such as the E1 interface when implemented in an O-RAN configuration. The CU 210 may be deployed to communicate with one or more DUs 230, as necessary, for network control and signaling. Each DU 230 may correspond to a logical unit that includes one or more base station functions to control the operation of one or more RUs 240. For example, a DU 230 may host various layers, such as an RLC layer, a MAC layer, or one or more PHY layers, such as one or more high PHY layers or one or more low PHY layers. Each layer (which also may be referred to as a module) may be implemented with an interface for communicating signals with other layers (and modules) hosted by the DU 230, or for communicating signals with the control functions hosted by the CU 210. Each RU 240 may implement lower layer functionality. In some aspects, real-time and non-real-time aspects of control and user plane communication with the RU (s) 240 may be controlled by the corresponding DU 230.
[0076] The SMO Framework 260 may support RAN deployment and provisioning of non-virtualized and virtualized network elements. For non-virtualized network elements, the SMO Framework 260 may support the deployment of dedicated physical resources for RAN coverage requirements, which may be managed via an operations and maintenance interface, such as an O1 interface. For virtualized network elements, the SMO Framework 260 may interact with a cloud computing platform (such as an open cloud (O-Cloud) platform 290) to perform network element life cycle management (such as to instantiate virtualized network elements) via a cloud computing platform interface, such as an O2 interface. A virtualized network element may include, but is not limited to, a CU 210, a DU 230, an RU 240, a non-RT RIC 250, and / or a Near-RT RIC 270. In some aspects, the SMO Framework 260 may communicate with a hardware aspect of a 4G RAN, a 5G NR RAN, and / or a 6G RAN, such as an open eNB (O-eNB) 280, via an O1 interface. Additionally or alternatively, the SMO Framework 260 may communicate directly with each of one or more RUs 240 via a respective O1 interface. In some deployments, this configuration can enable each DU 230 and the CU 210 to be implemented in a cloud-based RAN architecture, such as a vRAN architecture.
[0077] The Non-RT RIC 250 may include or may implement a logical function that enables non-real-time control and optimization of RAN elements and resources, AI / ML workflows including model training and updates, and / or policy-based guidance of applications and / or features in the Near-RT RIC 270. The Non-RT RIC 250 may be coupled to or may communicate with (such as via an A1 interface) the Near-RT RIC 270. The Near-RT RIC 270 may include or may implement a logical function that enables near-real-time control and optimization of RAN elements and resources via data collection and actions via an interface (such as via an E2 interface) connecting one or more CUs 210, one or more DUs 230, and / or an O-eNB 280 with the Near-RT RIC 270.
[0078] In some aspects, to generate AI / ML models to be deployed in the Near-RT RIC 270, the Non-RT RIC 250 may receive parameters or external enrichment information from external servers. Such information may be utilized by the Near-RT RIC 270 and may be received at the SMO Framework 260 or the Non-RT RIC 250 from non-network data sources or from network functions. In some examples, the Non-RT RIC 250 or the Near-RT RIC 270 may tune RAN behavior or performance. For example, the Non-RT RIC 250 may monitor long-term trends and patterns for performance and may employ AI / ML models to perform corrective actions via the SMO Framework 260 (such as reconfiguration via an O1 interface) or via creation of RAN management policies (such as A1 interface policies) .
[0079] The network node 110, the processing system 145 of the network node 110, the UE 120, the processing system 140 of the UE 120, the CU 210, the DU 230, the RU 240, or any other component (s) of Fig. 1 and / or Fig. 2 may implement one or more techniques or perform one or more operations associated with interleaver designs, as described in more detail elsewhere herein. For example, the processing system 145 of the network node 110, the processing system 140 of the UE 120, the CU 210, the DU 230, or the RU 240 may perform or direct operations of, for example, process 1400 of Fig. 14, process 1500 of Fig. 15, or other processes as described herein (alone or in conjunction with one or more other processors) . In some aspects, the transmitter device described herein is the UE 120, is included in the UE 120, or includes one or more components of the UE 120 shown in Figure 1. In some aspects, the reader device described herein is the UE 120 or the network node 110, is included in the UE 120 or the network node 110, or includes one or more components of the UE 120 or the network node 110 shown in Figure 1. Memory of the network node 110 may store data and program code (or instructions) for the network node 110, the CU 210, the DU 230, or the RU 240. In some examples, the memory of the network node 110 may store data relating to a UE 120, such as RRC state information or a UE context. Memory of a UE 120 may store data and program code (or instructions) for the UE 120, such as context information. In some examples, the memory of the UE 120 or the memory of the network node 110 may include a non-transitory computer-readable medium storing a set of instructions for wireless communication. For example, the set of instructions, when executed by one or more processors (for example, of the processing system 145 or the processing system 140) of the network node 110, the UE 120, the CU 210, the DU 230, or the RU 240, may cause the one or more processors to perform process 1400 of Fig. 14, process 1500 of Fig. 15, or other processes as described herein. In some examples, executing instructions may include running the instructions, converting the instructions, compiling the instructions, and / or interpreting the instructions, among other examples.
[0080] In some aspects, a transmitter device (e.g., a UE 120, an ambient IoT device, a passive UE, a semi-passive UE) includes for each iteration of N iterations, encoding a set of bits using a convolution encoder to obtain a respective encoded bit stream, wherein the convolutional encoder is expressed using N polynomials, and wherein one polynomial is output for each iteration; and / or transmitting encoded bit streams selected from the respective encoded bit streams. In some aspects, the means for the transmitter device to perform operations described herein may include, for example, one or more of communication manager 150, processing system 140, a radio, one or more RF chains, one or more transceivers, one or more antennas, one or more modems, a reception component (for example, reception component 1602 depicted and described in connection with Fig. 16) and / or a transmission component (for example, transmission component 1604 depicted and described in connection with Fig. 16) , among other examples.
[0081] In some aspects, a receiver device (e.g., a network node 110, a UE 120) includes means for receiving encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits; means for de-interleaving the encoded bit streams; and / or means for decoding the encoded bit streams. In some aspects, the means for the receiver device to perform operations described herein may include, for example, one or more of communication manager 155, processing system 145, a radio, one or more RF chains, one or more transceivers, one or more antennas, one or more modems, a reception component (for example, reception component 1702 depicted and described in connection with Fig. 17) , and / or a transmission component (for example, transmission component 1704 depicted and described in connection with Fig. 17) , among other examples. In some aspects, the means for the receiver device to perform operations described herein may include, for example, one or more of communication manager 150, processing system 140, a radio, one or more RF chains, one or more transceivers, one or more antennas, one or more modems, a reception component (for example, reception component 1602 depicted and described in connection with Fig. 16) , and / or a transmission component (for example, transmission component 1604 depicted and described in connection with Fig. 16) , among other examples.
[0082] Fig. 3 is a diagram illustrating an aspect 300 of energy harvesting, in accordance with the present disclosure.
[0083] Energy harvesting includes a device obtaining energy from a source other than an on-device battery. This may include obtaining energy from a source outside of the device. Devices that use energy harvesting may have a small energy storage device or battery (e.g., smart watch, RedCap devices, eRedCap devices, IoT devices) or no energy storage device or battery (e.g., zero-power devices, IoT devices, wearables, or financial devices) . Such devices may be categorized based on energy storage capacities. Some devices may have no energy storage (storage capacity 1) . Some devices may store up to E1 Joules (storage capacity 2) . Some devices may store up to E2 Joules (storage capacity 3) .
[0084] Energy harvesting may include converting RF energy transferred from another device. The harvesting of RF energy may not fully charge a battery but may be used for some tasks like data decoding, operating some filters, data reception, data encoding, data reception, and / or data transmission. The energy may be accumulated over time. Energy harvesting may also be a part of self-sustainable networks, where a node in the network can interact in the network through the energy harvested in the network through transmissions.
[0085] As shown in Fig. 3, an RF receiver (e.g., a UE 120) may receive signals (e.g., radio signals carried on radio waves) from an RF transmitter (e.g., a network node 110 or UE 120) and convert electromagnetic energy of the signals (e.g., using a rectenna comprising a dipole antenna with an RF diode) into direct current electricity for use by the RF receiver. The RF receiver may be a low-power device or a zero-power device. The RF transmitter may be referred to as a “charging device. ”
[0086] As shown by reference number 305, in some aspects, the RF receiver may use a separated receiver architecture, where a first set of antennas is configured to harvest energy (e.g., using energy harvester 306) , and a second set of antennas is configured to receive data (e.g., using information receiver 308) . In this scenario, each set of antennas may be separately configured to receive signals at certain times, frequencies, and / or via one or more particular beams, such that all signals received by the first set of antennas are harvested for energy, and all signals received by the second set of antennas are processed to receive information.
[0087] As shown by reference number 310, in some aspects, the RF receiver may use a time-switching architecture (e.g., with time switcher 312) to harvest energy. The time switching architecture may use one or more antennas to receive signals, and whether the signals are harvested for energy or processed to receive information depends on the time at which the signals are received. In some aspects, one or more first time slots may be time slots during which received signals are sent to one or more energy harvesting components, such as energy harvester 306, to harvest energy, and one or more second time slots may be time slots during which received signals are processed and decoded by one or more information receivers 308 to receive information. In some aspects, the time slots may be pre-configured (e.g., by the RF receiver, the RF transmitter, or another device) .
[0088] As shown by reference number 315, in some aspects, the RF receiver may use a power splitting architecture (e.g., with power splitter 316) to harvest energy. The power splitting architecture may use one or more antennas to receive signals, and the signals are handled by one or both of the energy harvesting and / or information receiving components according to an energy harvesting rate. In some aspects, the RF receiver may be configured to use a first portion of received signals for energy harvesting and the remaining received signals for information receiving. The energy harvesting mode for a device may be semi-statistically configured by RRC messaging. In some aspects, the energy harvesting rate may be pre-configured (e.g., by the RF receiver, the RF transmitter, or another device) . Communications with a network entity may be required, even in the energy harvesting mode, but with a reduced radio capability to reduce power consumption.
[0089] The RF receiver may receive signals for energy harvesting on certain resources (e.g., time, frequency, and / or spatial resources) and at a certain power level that results in a particular charging rate. Energy harvested by the RF receiver may be used and / or stored for later use. In some aspects, the RF receiver may be powered directly by the harvested energy. In some aspects, the RF receiver may use an energy storage device, such as a battery, capacitor, and / or supercapacitor, to gather and store harvested energy for immediate and / or later use.
[0090] The energy harvesting device may have a low-power or wake-up radio that is configured to detect a low-power wake up signal (WUS) but not perform other communications. The energy harvesting device may have a main radio that is configured to perform communications and that consumes more power than the low-power radio or wake-up radio. The energy harvesting device may have limited RF capabilities (less than enhanced UE) or full RF capabilities (comparable to enhanced UE) .
[0091] Energy harvesting devices, more generally, may rely equally or differently on different energy harvesting techniques such as solar power, vibration, thermal energy, or RF energy harvesting. Energy harvesting can be predictable or unpredictable due to the energy being intermittently available. Current communications use fixed activity cycles for transmission and reception, such as an on duration of an active discontinuous reception (DRX) cycle. The active DRX cycle may include a part of the DRX cycle when a DRX on-duration timer (for a time that the UE is monitoring for PDCCH communications) or a DRX inactivity timer (time UE is active after successfully decoding a PDCCH communication) is running. A timer may run once it is started, until it is stopped or until it expires; otherwise, it is not running. A timer may start if it is not running or restarted if it is running. A timer may be started or restarted from its initial value.
[0092] As indicated above, Fig. 3 is provided as an aspect. Other aspects may differ from what is described with regard to Fig. 3.
[0093] Fig. 4 is a diagram illustrating an aspect 400 of backscatter communication, in accordance with the present disclosure.
[0094] Energy harvesting (EH) devices may include A-IoT devices (e.g., RF identifier (ID) or RFID tags) that rely on passive communication technologies, such as backscatter communication. An A-IoT may also be referred to as an “A-IoT, ” “passive UE, ” “ambient backscatter device, ” or “backscatter device. ” An A-IoT device may include a passive device, a semi-passive device, or an active device. For transmission, an A-IoT device may include both backscatter communication and active transmission. Backscatter communication involves using an RF signal to write or transmit data without a battery or a power source. However, a semi-passive UE may involve backscatter communication while using energy storage. A transmitter / reader 402 may be an RF source that transmits (on a reader to device (R2D) link) a continuous wave (CW) signal (radio wave denoted as x (n) ) that may be received by multiple devices, such as a reader 404. For R2D, the only physical channel may be a physical reader-to-device channel (PRDCH) , which carries any higher-layer payload and L1 R2D control information. A wireless device, such as passive UE 406 (e.g., a tag, an A-IoT device, a passive UE, a UE 120 without an energy source, a backscattering device) or a semi-passive UE (e.g., some battery power) , may harvest energy (e.g., tens or hundreds of microwatts of electricity) from the signal. The passive UE 406 or the semi-passive UE may use passive reflection and modulation of the signal to transmit (on a device to reader (D2R) link) a backscatter signal using the harvested energy. That is, the passive UE 406 or the semi-passive UE may modulate the signal to encode data and then reflect a fraction of the wave to the reader 404 or to the transmitter / reader 402. The backscatter signal may be encoded with information bits (e.g., identifying information, sensor information) of the passive UE 406 or semi-passive UE. The reader 404 may receive the backscatter signal and read the information bits. For D2R, the physical channel may be a physical device-to-reader channel (PDRCH) , which carries any higher-layer payload and L1 R2D control information. In some scenarios, the passive UE 406 or the passive UE may use information commands (e.g., write, transmit) or bits (e.g., data, configuration, indications) modulated in a received data or control signal to write commands or bits to the passive UE 406 itself.
[0095] In aspect 400, D1 is for the transmitter / reader 402, D2 is for the reader 404, and T is for the passive UE 406 for transmitted signal h. As shown by reference number 408, a CW signal may be represented by hD1D2 (n) . One modulation method for backscattering includes amplitude shift keying (ASK) , which switches on the reflection when transmitting information bit “1” and switches off the reflection when transmitting information bit “0” . Reference number 410 shows information bits by a backscattering device, represented as σfhD1T (n) hTD2 (n) s (n) . If the information bits of a backscattering device are s (n) ∈ {0, 1} , the received signal at the reader 404 may be y (n) = (hD1D2 (n) +σfhD1T (n) hTD2 (n) s (n) ) x (n) +noise, as shown by reference number 412. When s (n) =0, reflection is switched off at the passive UE 406 such that the reader 404 only receives a direct link signal (y (n) =hD1D2 (n) x (n) +noise) . When s (n) =1, reflection is switched on at the passive UE 406 such that the reader 404 receives the superposition of both the direct link signal and the backscatter, which is represented as y (n) =(hD1D2 (n) +σfhD1T (n) hTD2 (n) s (n) ) x (n) +noise, where σf denotes the reflection coefficient. The modulated wave from the passive UE 406 may involve ASK, phase shift keying (PSK) , or frequency-shift keying (FSK) .
[0096] To receive the transmitted information bits by the passive UE 406, the reader 404 may first decode x (n) based on the known hD1D2 (n) , by treating the backscatter link signal as interference. The reader 404 may then detect the existence of the term σfhD1T(n) hTD2 (n) s (n) x (n) by subtracting hD1D2 (n) x (n) from y (n) .
[0097] There is a tradeoff between harvested energy at the passive UE 406 and a received signal-to-noise ratio (SNR) at a reader (e.g., the reader 404) . The harvested energy at the passive UE 406 is a function of a first channel (forwarding link (FL) ) between the transmitter / reader 402 and the passive UE 406, and the SNR at the reader 404 is a function of both the first channel and a second channel (backscattering link (BL) ) between the passive UE 406 and the reader 404. Due to the difference between the first channel and the second channel and the energy harvester nonlinearity, the optimal transmit waveform design for SNR and the optimal transmit waveform design for energy maximization are different.
[0098] A topology may be monostatic, where the RF source and the reader are the same device. A topology may be bistatic, where the RF source and the reader are different devices, such as shown in aspect 400. While an RFID tag may have a simple structure and an envelope detector for a carrier wave from a reader, an A-IoT device may involve a topology that includes a network entity (e.g., gNB, a UE, and a tag (UE as relay) ) or a topology that includes a UE and a tag. The A-IoT tag can be more powerful and may harvest and store energy.
[0099] A read command in an RFID may allow a transmitting device (e.g., reader, interrogator) to read part or all of a tag’s reserved memory, electronic product code (EPC) memory, tag ID (TID) memory, or user memory. The reserved memory may include the kill password and and / or access passwords. The EPC memory may include memory addresses or a code (such as an EPC, and hereafter referred to as an EPC) that identifies the object belonging to the tag and if the tag implements Extended Protocol Control (XPC) . The TID memory may include identifying information for an interrogator to uniquely identify the custom commands and / or optional features that a tag supports. The user memory may allow user-specific data storage.
[0100] A-IoT devices may be categorized according to A-IoT device types. In some aspects, an A-IoT device of type A may have no energy storage and no independent signal generation (i.e., backscattering transmission) . An A-IoT device of type A may have no passive filtering capability, and thus a transmitting device may not transmit a signal to difference devices at the same time but with different frequencies. An A-IoT device of type B may have energy storage but no independent signal generation (i.e., backscattering transmission) . An A-IoT device of type A or an A-IoT device of type B may have no energy to maintain a clock (e.g., preconfiguring the monitoring occasion for a downlink signal may not work) . The use of stored energy may include amplification for reflected signals. An A-IoT device of type C may have energy storage and independent signal generation (i.e., active RF component for transmission) . An A-IoT device of type B or type C may have energy to maintain the clock, but the clock stability may be loose.
[0101] In some aspects, A-IoT devices or A-IoT device types may be placed into groups. Groups (grouping 1) may include a group for indoor devices, a group for outdoor devices, and a group for both indoor / outdoor devices. Other groups (grouping B) may include a group of inventory devices, a group of sensors, a group of positioning devices, or a group of command devices. Grouping A and grouping B may be separate or together (e.g., group first by A, and second by B) .
[0102] Indoor use cases for sensors may include for smart homes, smart laundry, smart agriculture, smart farms, and smart stables. Outdoor use cases for sensors may include smart grids, forest fire monitoring, dairy farming, smart manholes, and smart bridge health monitoring. Commands for the devices may include commands for an online modification of medical instrument status, device activation and deactivation, elderly health care, permanent device deactivation, electronic shelf labels, or smart agriculture controllers.
[0103] In some aspects, an A-IoT device (e.g., Device 1) may be configured for ~1 micro watts (μW) peak power consumption, energy storage, an initial sampling frequency offset (SFO) up to 10X parts per million (ppm) , but neither downlink nor uplink amplification in the A-IoT device. The SFO corresponds to a mismatch between the oscillator of the transmitter and the oscillator of the receiver. The device’s uplink transmission may be backscattered on a carrier wave and provided externally. In some aspects, an A-IoT device may be configured for less than or equal to a few hundred μW peak power consumption, energy storage, an initial SFO up to 10X ppm, and both downlink and / or uplink amplification in the device. The device’s uplink transmission may be backscattered on a carrier wave provided externally (e.g., Device 2a) , or generated internally by the device (e.g., Device 2b) . The device may have a range of 10-40 meters indoors.
[0104] For R2D, the only physical channel is a PRDCH. However, different information may be carried on the PRDCH. For example, only R2D data or only R2D control information may be carried on the PRDCH, and at a different time, the content of the control or data may vary. An A-IoT device is not aware of the length of information and what information is carried in the PRDCH. For D2R, the PDRCH carries L1 D2R control information, even though the D2R is scheduled by the R2D. The exact length of information transmitted on the D2R may vary for different scenarios. For example, the length of error codes may vary for different scenarios. However, the reader is not aware of the transport block size (TBS) of the information transmitted from the A-IoT device. If the A-IoT device and the reader are not aware of the length of the information, the A-IoT device may consume more energy than necessary.
[0105] As indicated above, Fig. 4 is provided as an aspect. Other aspects may differ from what is described with regard to Fig. 4.
[0106] Fig. 5 is a diagram illustrating an example 500 of a coding chain, in accordance with the present disclosure.
[0107] A Viterbi decoder is an algorithm used for decoding convolutional codes in digital communications. Convolutional codes are error-correcting codes used to encode data before transmission. Unlike block codes, where the data is split into fixed-size blocks, convolutional codes process data streams through a sequence of shifts and taps, producing encoded bits that depend on the current input bit as well as previous input bits. Convolutional encoding involves shifting a sequence of input bits through a series of memory elements (shift registers) and applying a set of polynomial functions (generators) to produce the encoded output. A convolutional encoder can be represented by a state diagram where each state corresponds to a possible configuration of the encoder’s memory. Transitions between states are based on input bits.
[0108] A Viterbi algorithm is used to decode a received sequence and determine the most likely transmitted sequence of bits. The Viterbi algorithm may use a trellis diagram to systematically track the most likely sequence of states over time. Each stage in the trellis represents a time step, and each path through the trellis represents a possible sequence of states. By systematically evaluating possible sequences and retaining the most likely ones, the Viterbi decoder corrects errors and enhances the reliability of digital communication systems, ensuring that the decoded data closely matches the transmitted data.
[0109] There are two types of convolutional codes. A first type involves zero padding. Zero padding encoding appends L –1 zeros to a block of data to ensure the feed-forward encoder starts from and ends in the all-zero state for each block (e.g., begins and ends with “00” ) . L is the constraint length. The shift registers of the encoder may be initialized and cleared. A binary sequence of length D followed by L –1 zeros may be input into the encoder. A decoder (e.g., Viterbi “continuous” mode) may treat each traceback path independently and result in an output decoding delay of TracebackDepth × K zero bits for a rate K / i convolutional code. K is the number of input symbols, and N is the number of output symbols.
[0110] A second type of convolutional code involves tail biting. Tail-biting encoding ensures that the starting state of the encoder is the same as its ending state (and that this state value does not necessarily have to be the all-zero state) . The encoder is initialized by inputting the last L -1 information bits into the encoder and then input a binary sequence of length D. The decoder (e.g., Viterbi “truncated” mode) may treat each frame independently. The traceback path starts at the state with the best metric and ends in the all-zeros state. There is no output delay for this mode.
[0111] Example 500 shows a coding chain of a CC with a CC encoder output stream of and for k = 0, …, D –1, where D is the number of bits. Each output stream is denoted by In general, the output stream is a serial sequence of three polynomials (e.g., ) , and CC uses parallel output streams for easy rate-matching. Example 500 shows a rate matching block 502 where streams are interleaved using sub-block interleavers (three output streams for coding rate of 1 / 3) , followed by the collection of bits that may include the generation of a circular buffer. A circular buffer is an array of a fixed size that maintains pointers that wrap around to the beginning when the end of the array is reached (in a circular effect) .
[0112] As indicated above, Fig. 5 is provided as an example. Other examples may differ from what is described with regard to Fig. 5.
[0113] Fig. 6 is a diagram illustrating an example 600 of rate matching block components, in accordance with the present disclosure.
[0114] One of the components of the rate matching block 502 is a sub-block interleaver. The bits may be input into a sub-block interleaver, and the output bit sequence may be derived with a few operations. In a first operation, a column size of 32 is assigned to the sub-block interleaver and the row size may be calculated according to: In a second operation, the bits may be written into the interleaver row-by-row, then an inter-column permutation is performed. In a third operation, the output of the sub-block interleaver is a bit sequence read out column-by-column. Example 600 shows an inter-column permutation for 32 columns, or an order of the columns output by the sub-block interleaver.
[0115] Another component of the rate matching block 502 may be a circular buffer 602 that is used for bit selection. The circular buffer may be of length Kw = 3K∏-1 and generated as follows: for k = 0, …, K∏-1; for k = 0, …, K∏-1; and for k = 0, …, KΠ-1.
[0116] As indicated above, Fig. 6 is provided as an example. Other examples may differ from what is described with regard to Fig. 6.
[0117] Fig. 7 is a diagram illustrating an example 700 of a CC encoder and an interleaver, in accordance with the present disclosure.
[0118] Example 700 shows a CC encoder concatenated with an interleaver (e.g., rectangular interleaver) to enhance CC performance. The interleaver requires a memory buffer to store the output bits of the CC encoder before interleaving them. To illustrate the memory cost, example 700 shows a rate of 1 / 6 CC encoder and an rectangular interleaver, where the CC encoder is 1-in 6-out, and the input bit length is D. In a first operation, the output codewords are generated from CC encoder. When a bit ck is input, the output order is from polynomial G0 to polynomial G5, so the output bits form to The output codewords = In a second operation, the output bits are input into the rectangular interleaver (size D × 6) , written row-by-row, and read out column-by-column. The output bits from the interleaver are The memory cost is D × 6 in the memory buffer.
[0119] FEC improves the reliability of data transmission over potentially unreliable communication channels by adding redundant data (error-correcting codes) to the original information before transmission. This allows the receiver to detect and correct errors without needing a retransmission. CC encoding is a FEC scheme that may be used for A-IoT D2R transmission. The interleaver enhances the performance of FEC. However, the CC encoder may require substantial memory for large code blocks, as the interleaver size (the product of rows and columns) matches the coded block size. Additionally, circular buffers demand significant memory. An A-IoT device memory and other small-memory devices may not support the required size for CC encoding.
[0120] As indicated above, Fig. 7 is provided as an example. Other examples may differ from what is described with regard to Fig. 7.
[0121] Fig. 8 is a diagram illustrating an example 800 of an interleaver design, in accordance with the present disclosure.
[0122] A CC encoder concatenated with an interleaver of a transmitter may require a memory buffer. According to various aspects described herein, a memory-free interleaver may achieve interleaving without memory costs. Example 800 shows an interleaver with an input bit length of D and a CC rate of 1 / N (e.g., 1 / 6) , where a set of information bits is encoded N times (6 times) , and each time only outputs one of N polynomials.
[0123] The interleaver encodes the information bits six times (N = 6 iterations) . During the k-th encoding (each iteration) , the interleaver encodes all of the information bits but only outputs the codewords from polynomial Gk-1 (instead of all 6 polynomials or all 6 bit streams) . As shown in example 800, in the first encoding (first iteration 802) , the interleaver outputs the codewords from (encoded bit stream 804) , and in sixth encoding (N-th iteration 806) , the interleaver outputs the codewords from polynomial (encoded bit stream 808) . The output bits are By outputting one encoded bit stream for transmission at a time, rather than 6 bit streams, the transmitter conserves memory by not storing the other 5 bit streams.
[0124] As indicated above, Fig. 8 is provided as an example. Other examples may differ from what is described with regard to Fig. 8.
[0125] Fig. 9 is a diagram illustrating an example 900 of an interleaver for memory conservation, in accordance with the present disclosure.
[0126] Example 900 shows an interleaver 902 that is initialized with a length D for the set of information bits. At 902, the indicator is initialized i=0 to represent the first encoding process. During a first iteration i, a sequence of the information bits is input (at 906) into a CC encoder 904, and the codewords di are output (at 908) from polynomial Gi.
[0127] As indicated above, Fig. 9 is provided as an example. Other examples may differ from what is described with regard to Fig. 9.
[0128] Fig. 10 is a diagram illustrating an example 1000 of using an interleaver design, in accordance with the present disclosure. A reader 1010 (e.g., network node 110, UE 120) may communicate with a transmitter 1020 (e.g., a UE 120, an A-IoT device, a passive device, a semi-passive device, an active device) . As shown by reference number 1025, the reader 1010 (or another transmitter) may transmit a CW signal to the transmitter 1020, which backscatters a response. The response may include encoded bit streams.
[0129] The transmitter 1020 may use a CC encoder that is initialized to an all-zero state, assuming a constraint length L that constrains or limits the amount of information bits that are encoded at a time. For tail biting convolution coding, the last L –1 information bits are used to initialize the begin state of the CC encoder. For zero padding, no initialization is needed.
[0130] As shown by reference number 1030, for each iteration (of N iterations) , the transmitter 1020 (e.g., an interleaver of transmitter 1020) may encode a set of bits (information bits) to obtain a respective encoded bit stream. For tail biting, the output codeword for the encoded bit stream is D bits. For zero-padding, the output codeword is D + L –1 bits. L –1 zeros may be appended to the end of the information bits to ensure that the ending state of the CC encoder is an all-zero state, The transmitter 1020 may use a CC encoder to encode and output the encoded bit stream. N may be selected based at least in part on an encoding rate, such as where 1 / N represents the mother code rate of the CC encoder.
[0131] In some aspects, as shown by reference number 1035, the transmitter 1020 may select the encoded bit streams that are to be transmitted. Rate matching may ensure that the sender's data rate aligns with the receiver's capabilities, preventing data loss or buffer overflow. The data rate may be adjusted and the number of encoded bit streams may correspondingly increase or decrease. Selecting the encoded bit streams may include selecting the encoded bit streams based at least in part on a selection value. As shown by reference number 1040, the transmitter 1020 may transmit the selected encoded bit streams.
[0132] The reader 1010 may receive the selected encoded bit streams. As shown by reference number 1045, the reader 1010 may de-interleave the encoded bit streams. This may include de-interleaving the encoded bit streams via a de-interleaver that has a size that is based at least in part on a number N of iterations for encoding the encoded bit streams and a size D of the set of bits. For tail biting, an N × D (selection value) de-interleaver (N rows, D columns, written in row-by-row, read out column-by-column) may de-interleave the received codeword, and then use the related CC decoder. As shown by reference number 1050, the reader 1010 may decode the encoded bit streams. The decoder may include a Viterbi decoder. For zero-padding, the reader 1010 may use a N × (D + L –1) (selection value) de-interleaver (N rows, D + L –1 columns) to de-interleave the received codeword. While the interleaver may not store as many bit streams, the de-interleaver may still store multiple bit streams and may be written in row-by-row and read out column-by-column.
[0133] As indicated above, Fig. 10 is provided as an example. Other examples may differ from what is described with regard to Fig. 10.
[0134] Fig. 11 is a diagram illustrating an example 1100 of an interleaver design, in accordance with the present disclosure.
[0135] In some aspects, the interleaver may be a memory-free interleaver, based at least in part on the coding chain from the CC. The CC coding chain (rate-1 / N CC) may be modified to remove the sub-block interleavers. An A-IoT device CC may not require same signal-to-noise ratio (SNR) coverage as in other scenarios. The virtual circular buffer may also be removed, as it is mostly used for Turbo code bit selection. For some CCs (e.g., a Long Term Evolution (LTE) CC) , the virtual circular buffer may be considered equivalent to a rectangular interleaver. Therefore, the circular buffer can be eliminated. What remains is the bit selection and pruning block 1102. The removal of the components is shown in example 1100. The bit selection and pruning block 1102 may use new bit selection rules to select the codewords from each polynomial output. The rate matching output bit sequence may be ek. That is, encoded bit streams may be selected without a sub-block interleaver and without a circular buffer.
[0136] In some aspects, a new bit selection rule may include, during the k-th encoding, outputting the codewords (from polynomial Gk-1) . In some aspects, a new bit selection rule may include skipping one (or more) encoding processes to punctuate this bit stream for rate matching purposes.
[0137] As indicated above, Fig. 11 is provided as an example. Other examples may differ from what is described with regard to Fig. 11.
[0138] Fig. 12 is a diagram illustrating an example 1200 of an interleaver design, in accordance with the present disclosure.
[0139] For D2R transmission, the line coding and FEC scheme may be concatenated. Example 1200 shows an FEC encoder concatenated with a line coding encoder via an inter-column interleaver. For bits received on the channel, a line coding decoder may be concatenated with an FEC decoder via an inter-column de-interleaver. However, continuous 2-bit errors may occur when using the concatenated FEC and line coding (e.g., FM0 or Miller code) for D2R transmission. The line coding decoder may generate the continuous 2-bit errors, which may reduce the performance of FEC.
[0140] In some aspects, an interleaver design may include a (simple) one-row inter-leaver, shown in example 1200, to mitigate the 2-bit errors. The interleaver may use a small size (e.g., L) inter-column permutation pattern for the interleaver. This pattern may be applied to every L input bits, such that the interleaver size is equal to L. The difference over an interleaver with sub-block interleavers may be that the row size is fixed at one, and the memory is a size buffer. A reason for using one row is that the interleaver may separate adjacent bits without requiring a large separation distance.
[0141] As indicated above, Fig. 12 is provided as an example. Other examples may differ from what is described with regard to Fig. 12.
[0142] Fig. 13 is a diagram illustrating an example 1300 of inter-column permutation patterns, in accordance with the present disclosure.
[0143] Example 1300 shows a table of inter-column permutation patterns for different alternatives. The inter-column permutation pattern separates adjacent bits by a number of bits that is equal to at least half of a column size of the interleaver, so as to maximize the index distance between adjacent bits. For example, for 16 columns (8 is half the size) , the columns may be separated by an index distance of 8 bits (2 and 10) , (6 and 14) , (0 and 8) , and so forth. In some aspects, an inter-column permutation pattern may place even-indexed bits before odd- indexed bits. For example, (2 and 10) , (6 and 14) , (0 and 8) , and (12 and 4) precede (3 and 11) , (7 and 15) , (1 and 9) , and (13 and 5) .
[0144] As indicated above, Fig. 13 is provided as an example. Other examples may differ from what is described with regard to Fig. 13.
[0145] Fig. 14 is a diagram illustrating an example process 1400 performed, for example, at a transmitter device or an apparatus of a transmitter device, in accordance with the present disclosure. Example process 1400 is an example where the apparatus or the transmitter device (e.g., transmitter 1020) performs operations associated with an interleaver design.
[0146] As shown in Fig. 14, in some aspects, process 1400 may include for each iteration of N iterations, encoding a set of bits using a convolution encoder to obtain a respective encoded bit stream, where the convolutional encoder is expressed using N polynomials, and one polynomial is output for each iteration (block 1410) . For example, the transmitter device (e.g., using communication manager 1606, depicted in Fig. 16) may for each iteration of N iterations, encoding a set of bits using a convolution encoder to obtain a respective encoded bit stream, where the convolutional encoder is expressed using N polynomials, and one polynomial is output for each iteration, as described above.
[0147] As further shown in Fig. 14, in some aspects, process 1400 may include transmitting encoded bit streams selected from the respective encoded bit streams (block 1420) . For example, the transmitter device (e.g., using communication manager 1606, depicted in Fig. 16) may transmit encoded bit streams selected from the respective encoded bit streams, as described above.
[0148] Process 1400 may include additional aspects, such as any single aspect or any combination of aspects described below and / or in connection with one or more other processes described elsewhere herein.
[0149] In a first aspect, N is based at least in part on an encoding rate.
[0150] In a second aspect, alone or in combination with the first aspect, process 1400 includes selecting the encoded bit streams from the respective encoded bit streams based at least in part on a selection value.
[0151] In a third aspect, alone or in combination with one or more of the first and second aspects, the encoded bit streams are selected without a sub-block interleaver and without a circular buffer.
[0152] In a fourth aspect, alone or in combination with one or more of the first through third aspects, process 1400 includes interleaving the respective encoded bit streams via an interleaver that is one row and has an inter-column permutation pattern that is applied to every constraint length L input bits.
[0153] In a fifth aspect, alone or in combination with one or more of the first through fourth aspects, the inter-column permutation pattern separates adjacent bits by a number of bits that is equal to at least half of a column size of the interleaver.
[0154] In a sixth aspect, alone or in combination with one or more of the first through fifth aspects, the inter-column permutation pattern places even-indexed bits before odd-indexed bits.
[0155] Although Fig. 14 shows example blocks of process 1400, in some aspects, process 1400 may include additional blocks, fewer blocks, different blocks, or differently arranged blocks than those depicted in Fig. 14. Additionally, or alternatively, two or more of the blocks of process 1400 may be performed in parallel.
[0156] Fig. 15 is a diagram illustrating an example process 1500 performed, for example, at a receiver device or an apparatus of a receiver device, in accordance with the present disclosure. Example process 1500 is an example where the apparatus or the receiver device (e.g., reader 1010) performs operations associated with an interleaver design.
[0157] As shown in Fig. 15, in some aspects, process 1500 may include receiving encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits (block 1510) . For example, the receiver device (e.g., using reception component 1602 or 1702 and / or communication manager 1606 or 1706, depicted in Fig. 16 or 17) may receive encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits, as described above.
[0158] As further shown in Fig. 15, in some aspects, process 1500 may include de -interleaving the encoded bit streams (block 1520) . For example, the receiver device (e.g., using communication manager 1606 or 1706, depicted in Fig. 16 or 17) may de -interleaving the encoded bit streams, as described above.
[0159] As further shown in Fig. 15, in some aspects, process 1500 may include decoding the encoded bit streams (block 1530) . For example, the receiver device (e.g., using communication manager 1606 or 1706, depicted in Fig. 16 or 17) may decode the encoded bit streams, as described above.
[0160] Process 1500 may include additional aspects, such as any single aspect or any combination of aspects described below and / or in connection with one or more other processes described elsewhere herein.
[0161] In a first aspect, de-interleaving the encoded bit streams includes de-interleaving the encoded bit streams via a de-interleaver that has a size that is based at least in part on a number N of iterations for encoding the encoded bit streams and a size D of the set of bits, and the de-interleaver is written in row-by-row and read out column-by-column.
[0162] In a second aspect, alone or in combination with the first aspect, de-interleaving the encoded bit streams includes de-interleaving the encoded bit streams further based at least in part on a constraint length L –1.
[0163] In a third aspect, alone or in combination with one or more of the first and second aspects, the de-interleaver is one row and applies an inter-column permutation pattern to every constraint length L input bits.
[0164] In a fourth aspect, alone or in combination with one or more of the first through third aspects, the inter-column permutation pattern separates adjacent bits by a number of bits that is equal to at least half of an interleaver column size.
[0165] In a fifth aspect, alone or in combination with one or more of the first through fourth aspects, the inter-column permutation pattern places even-indexed bits before odd-indexed bits.
[0166] In a sixth aspect, alone or in combination with one or more of the first through fifth aspects, decoding the encoded bit streams includes decoding the encoded bit streams via a Viterbi decoder.
[0167] Although Fig. 15 shows example blocks of process 1500, in some aspects, process 1500 may include additional blocks, fewer blocks, different blocks, or differently arranged blocks than those depicted in Fig. 15. Additionally, or alternatively, two or more of the blocks of process 1500 may be performed in parallel.
[0168] Fig. 16 is a diagram of an example apparatus 1600 for wireless communication, in accordance with the present disclosure. The apparatus 1600 may be a transmitter device (e.g., UE 120, A-IoT device, passive device, semi-passive device) , or a transmitter device may include the apparatus 1600. The apparatus 1600 may be a reader device (e.g., UE 120) , or a receiver device may include the apparatus 1600. In some aspects, the apparatus 1600 includes a reception component 1602, a transmission component 1604, and / or a communication manager 1606, which may be in communication with one another (for example, via one or more buses and / or one or more other components) . In some aspects, the communication manager 1606 is the communication manager 150 described in connection with Fig. 1. As shown, the apparatus 1600 may communicate with another apparatus 1608, such as a UE or a network node (such as a CU, a DU, an RU, or a base station) , using the reception component 1602 and the transmission component 1604. The communication manager 1606 may be included in, or implemented via, a processing system (for example, the processing system 140 described in connection with Fig. 1) of the transmitter device.
[0169] In some aspects, the apparatus 1600 may be configured to perform one or more operations described herein in connection with Figs. 1-13. Additionally, or alternatively, the apparatus 1600 may be configured to perform one or more processes described herein, such as process 1400 of Fig. 14, process 1500 of Fig. 15, or a combination thereof. In some aspects, the apparatus 1600 and / or one or more components shown in Fig. 16 may include one or more components of the transmitter device described in connection with Fig. 1. Additionally, or alternatively, one or more components shown in Fig. 16 may be implemented within one or more components described in connection with Fig. 1. Additionally, or alternatively, one or more components of the set of components may be implemented at least in part as software stored in one or more memories. For example, a component (or a portion of a component) may be implemented as instructions or code stored in a non-transitory computer-readable medium and executable by one or more controllers or one or more processors to perform the functions or operations of the component.
[0170] The reception component 1602 may receive communications, such as reference signals, control information, data communications, or a combination thereof, from the apparatus 1608. The reception component 1602 may provide received communications to one or more other components of the apparatus 1600. In some aspects, the reception component 1602 may perform signal processing on the received communications, and may provide the processed signals to the one or more other components of the apparatus 1600. In some aspects, the reception component 1602 may include one or more components of the transmitter device described above in connection with Fig. 1, such as a radio, one or more RF chains, one or more transceivers, or one or more modems, each of which may in turn be coupled with one or more antennas of the transmitter device.
[0171] The transmission component 1604 may transmit communications, such as reference signals, control information, data communications, or a combination thereof, to the apparatus 1608. In some aspects, one or more other components of the apparatus 1600 may generate communications and may provide the generated communications to the transmission component 1604 for transmission to the apparatus 1608. In some aspects, the transmission component 1604 may perform signal processing on the generated communications, and may transmit the processed signals to the apparatus 1608. In some aspects, the transmission component 1604 may include one or more components of the transmitter device described above in connection with Fig. 1, such as a radio, one or more RF chains, one or more transceivers, or one or more modems, each of which may in turn be coupled with one or more antennas of the transmitter device described in connection with Fig. 1. In some aspects, the transmission component 1604 may be co-located with the reception component 1602.
[0172] The communication manager 1606 may support operations of the reception component 1602 and / or the transmission component 1604. For example, the communication manager 1606 may receive information associated with configuring reception of communications by the reception component 1602 and / or transmission of communications by the transmission component 1604. Additionally, or alternatively, the communication manager 1606 may generate and / or provide control information to the reception component 1602 and / or the transmission component 1604 to control reception and / or transmission of communications.
[0173] In some aspects associated with a transmitter device, the communication manager 1606 may for each iteration of N iterations, encode a set of bits using a convolution encoder to obtain a respective encoded bit stream, where the convolutional encoder is expressed using N polynomials, and one polynomial is output for each iteration. The communication manager 1606 may transmit encoded bit streams selected from the respective encoded bit streams.
[0174] The communication manager 1606 may select the encoded bit streams from the respective encoded bit streams based at least in part on a selection value. The communication manager 1606 may interleave the respective encoded bit streams via an interleaver that is one row and has an inter-column permutation pattern that is applied to every constraint length L input bits.
[0175] In some aspects associated with a reader device, the reception component 1602 may receive encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits. The communication manager 1606 may de-interleave the encoded bit streams. The communication manager 1606 may decode the encoded bit streams.
[0176] The number and arrangement of components shown in Fig. 16 are provided as an example. In practice, there may be additional components, fewer components, different components, or differently arranged components than those shown in Fig. 16. Furthermore, two or more components shown in Fig. 16 may be implemented within a single component, or a single component shown in Fig. 16 may be implemented as multiple, distributed components. Additionally, or alternatively, a set of (one or more) components shown in Fig. 16 may perform one or more functions described as being performed by another set of components shown in Fig. 16.
[0177] Fig. 17 is a diagram of an example apparatus 1700 for wireless communication, in accordance with the present disclosure. The apparatus 1700 may be a receiver device (e.g., network node 110) , or a receiver device may include the apparatus 1700. In some aspects, the apparatus 1700 includes a reception component 1702, a transmission component 1704, and / or a communication manager 1706, which may be in communication with one another (for example, via one or more buses and / or one or more other components) . In some aspects, the communication manager 1706 is the communication manager 150 or 155 described in connection with Fig. 1. As shown, the apparatus 1700 may communicate with another apparatus 1708, such as a UE or a network node (such as a CU, a DU, an RU, or a base station) , using the reception component 1702 and the transmission component 1704. The communication manager 1706 may be included in, or implemented via, a processing system (for example, the processing system 145 described in connection with Fig. 1) of the receiver device.
[0178] In some aspects, the apparatus 1700 may be configured to perform one or more operations described herein in connection with Figs. 1-13. Additionally, or alternatively, the apparatus 1700 may be configured to perform one or more processes described herein, such as process 1500 of Fig. 15. In some aspects, the apparatus 1700 and / or one or more components shown in Fig. 17 may include one or more components of the receiver device described in connection with Fig. 1. Additionally, or alternatively, one or more components shown in Fig. 17 may be implemented within one or more components described in connection with Fig. 1. Additionally, or alternatively, one or more components of the set of components may be implemented at least in part as software stored in one or more memories. For example, a component (or a portion of a component) may be implemented as instructions or code stored in a non-transitory computer-readable medium and executable by one or more controllers or one or more processors to perform the functions or operations of the component.
[0179] The reception component 1702 may receive communications, such as reference signals, control information, data communications, or a combination thereof, from the apparatus 1708. The reception component 1702 may provide received communications to one or more other components of the apparatus 1700. In some aspects, the reception component 1702 may perform signal processing on the received communications, and may provide the processed signals to the one or more other components of the apparatus 1700. In some aspects, the reception component 1702 may include one or more components of the receiver device described above in connection with Fig. 1, such as a radio, one or more RF chains, one or more transceivers, or one or more modems, each of which may in turn be coupled with one or more antennas of the receiver device.
[0180] The transmission component 1704 may transmit communications, such as reference signals, control information, data communications, or a combination thereof, to the apparatus 1708. In some aspects, one or more other components of the apparatus 1700 may generate communications and may provide the generated communications to the transmission component 1704 for transmission to the apparatus 1708. In some aspects, the transmission component 1704 may perform signal processing on the generated communications, and may transmit the processed signals to the apparatus 1708. In some aspects, the transmission component 1704 may include one or more components of the receiver device described above in connection with Fig. 1, such as a radio, one or more RF chains, one or more transceivers, or one or more modems, each of which may in turn be coupled with one or more antennas of the receiver device described in connection with Fig. 1. In some aspects, the transmission component 1704 may be co-located with the reception component 1702.
[0181] The communication manager 1706 may support operations of the reception component 1702 and / or the transmission component 1704. For example, the communication manager 1706 may receive information associated with configuring reception of communications by the reception component 1702 and / or transmission of communications by the transmission component 1704. Additionally, or alternatively, the communication manager 1706 may generate and / or provide control information to the reception component 1702 and / or the transmission component 1704 to control reception and / or transmission of communications.
[0182] The reception component 1702 may receive encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits. The communication manager 1706 may de-interleave the encoded bit streams. The communication manager 1706 may decode the encoded bit streams.
[0183] The number and arrangement of components shown in Fig. 17 are provided as an example. In practice, there may be additional components, fewer components, different components, or differently arranged components than those shown in Fig. 17. Furthermore, two or more components shown in Fig. 17 may be implemented within a single component, or a single component shown in Fig. 17 may be implemented as multiple, distributed components. Additionally, or alternatively, a set of (one or more) components shown in Fig. 17 may perform one or more functions described as being performed by another set of components shown in Fig. 17.
[0184] The following provides an overview of some Aspects of the present disclosure:
[0185] Aspect 1: A method of wireless communication performed by a transmitter device, comprising: for each iteration of N iterations, encoding a set of bits using a convolution encoder to obtain a respective encoded bit stream, wherein the convolutional encoder is expressed using N polynomials, and wherein one polynomial is output for each iteration; and transmitting encoded bit streams selected from the respective encoded bit streams.
[0186] Aspect 2: The method of Aspect 1, wherein N is based at least in part on an encoding rate.
[0187] Aspect 3: The method of any of Aspects 1-2, further comprising selecting the encoded bit streams from the respective encoded bit streams based at least in part on a selection value.
[0188] Aspect 4: The method of any of Aspects 1-3, wherein the encoded bit streams are selected without a sub-block interleaver and without a circular buffer.
[0189] Aspect 5: The method of any of Aspects 1-4, further comprising interleaving the respective encoded bit streams via an interleaver that is one row and has an inter-column permutation pattern that is applied to every constraint length L input bits.
[0190] Aspect 6: The method of Aspect 5, wherein the inter-column permutation pattern separates adjacent bits by a number of bits that is equal to at least half of a column size of the interleaver.
[0191] Aspect 7: The method of Aspect 5 wherein the inter-column permutation pattern places even-indexed bits before odd-indexed bits.
[0192] Aspect 8: A method of wireless communication performed by a receiver device, comprising: receiving encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits; de-interleaving the encoded bit streams; and decoding the encoded bit streams.
[0193] Aspect 9: The method of Aspect 8, wherein de-interleaving the encoded bit streams includes de-interleaving the encoded bit streams via a de-interleaver that has a size that is based at least in part on a number N of iterations for encoding the encoded bit streams and a size D of the set of bits, and wherein the de-interleaver is written in row-by-row and read out column-by-column.
[0194] Aspect 10: The method of Aspect 9, wherein de-interleaving the encoded bit streams includes de-interleaving the encoded bit streams further based at least in part on a constraint length L minus one.
[0195] Aspect 11: The method of Aspect 9, wherein the de-interleaver is one row and applies an inter-column permutation pattern to every constraint length L input bits.
[0196] Aspect 12: The method of Aspect 11, wherein the inter-column permutation pattern separates adjacent bits by a number of bits that is equal to at least half of an interleaver column size.
[0197] Aspect 13: The method of Aspect 11, wherein the inter-column permutation pattern places even-indexed bits before odd-indexed bits.
[0198] Aspect 14: The method of any of Aspects 8-13, wherein decoding the encoded bit streams includes decoding the encoded bit streams via a Viterbi decoder.
[0199] Aspect 15: An apparatus for wireless communication at a device, the apparatus comprising one or more processors; one or more memories coupled with the one or more processors; and instructions stored in the one or more memories and executable by the one or more processors to cause the apparatus to perform the method of one or more of Aspects 1-14.
[0200] Aspect 16: An apparatus for wireless communication at a device, the apparatus comprising one or more memories and one or more processors coupled to the one or more memories, the one or more processors configured to cause the device to perform the method of one or more of Aspects 1-14.
[0201] Aspect 17: An apparatus for wireless communication, the apparatus comprising at least one means for performing the method of one or more of Aspects 1-14.
[0202] Aspect 18: A non-transitory computer-readable medium storing code for wireless communication, the code comprising instructions executable by one or more processors to perform the method of one or more of Aspects 1-14.
[0203] Aspect 19: A non-transitory computer-readable medium storing a set of instructions for wireless communication, the set of instructions comprising one or more instructions that, when executed by one or more processors of a device, cause the device to perform the method of one or more of Aspects 1-14.
[0204] Aspect 20: A device for wireless communication, the device comprising a processing system that includes one or more processors and one or more memories coupled with the one or more processors, the processing system configured to cause the device to perform the method of one or more of Aspects 1-14.
[0205] Aspect 21: An apparatus for wireless communication at a device, the apparatus comprising one or more memories and one or more processors coupled to the one or more memories, the one or more processors individually or collectively configured to cause the device to perform the method of one or more of Aspects 1-14.
[0206] The foregoing disclosure provides illustration and description but is not intended to be exhaustive or to limit the aspects to the precise forms disclosed. Modifications and variations may be made in light of the above disclosure or may be acquired from practice of the aspects. No element, act, or instruction described herein should be construed as critical or essential unless explicitly described as such.
[0207] It will be apparent that systems or methods described herein may be implemented in different forms of hardware or a combination of hardware and software. The actual specialized control hardware or software used to implement these systems or methods is not limiting of the aspects. Thus, the operation and behavior of the systems or methods are described herein without reference to specific software code, because those skilled in the art will understand that software and hardware can be designed to implement the systems or methods based, at least in part, on the description herein. A component being configured to perform a function means that the component has a capability to perform the function, and does not require the function to be actually performed by the component, unless noted otherwise.
[0208] As used herein, the articles “a” and “an” are intended to refer to one or more items and may be used interchangeably with “one or more” or “at least one. ” Further, as used herein, the article “the” is intended to include one or more items referenced in connection with the article “the” and may be used interchangeably with “the one or more. ” Furthermore, as used herein, the terms “set” and “group” are intended to include one or more items and may be used interchangeably with “one or more. ” Where only one item is intended, the phrase “only one” or “asingle one” or similar language is used. Also, as used herein, the terms “has, ” “have, ” “having, ” “comprise, ” “comprising, ” “include” and “including, ” and derivatives thereof or similar terms are intended to be open-ended terms that do not limit an element that they modify (for example, an element “having” A may also have B) . Also, as used herein, the term “or” is intended to be inclusive when used in a series and may be used interchangeably with “and / or, ” unless explicitly stated otherwise (for example, if used in combination with “either” or “only one of” ) . As used herein, a phrase referring to “at least one of” a list of items refers to any combination of those items, including single members. As an example, “at least one of: a, b, or c” is intended to cover a, b, c, a + b, a + c, b + c, and a + b + c, as well as any combination with multiples of the same element (for example, a + a, a + a + a, a + a + b, a + a + c, a + b + b, a + c + c, b + b, b + b + b, b + b + c, c + c, and c + c + c, or any other ordering of a, b, and c) .
[0209] As used herein, the term “determine” or “determining” encompasses a wide variety of actions and, therefore, “determining” can include calculating, computing, processing, deriving, estimating, investigating, looking up (such as via looking up in a table, a database, or another data structure) , searching, inferring, ascertaining, and / or measuring, among other possibilities. Also, “determining” can include receiving (such as receiving information) , accessing (such as accessing data stored in memory) or transmitting (such as transmitting information) , among other possibilities. Additionally, “determining” can include resolving, selecting, obtaining, choosing, establishing, and / or other such similar actions.
[0210] As used herein, the phrase “based on” is intended to mean “based at least in part on” or “based on or otherwise in association with” unless explicitly stated otherwise. As used herein, “satisfying a threshold” may, depending on the context, refer to a value being greater than the threshold, greater than or equal to the threshold, less than the threshold, less than or equal to the threshold, equal to the threshold, or not equal to the threshold, among other examples.
[0211] Even though particular combinations of features are recited in the claims or disclosed in the specification, these combinations are not intended to limit the scope of all aspects described herein. Many of these features may be combined in ways not specifically recited in the claims or disclosed in the specification. The disclosure of various aspects includes each dependent claim in combination with every other claim in the claim set.
Claims
1.An apparatus for wireless communication at a transmitter device, comprising:one or more memories; andone or more processors coupled to the one or more memories, the one or more processors individually or collectively configured to cause the transmitter device to:for each iteration of N iterations, encode a set of bits using a convolution encoder to obtain a respective encoded bit stream, wherein the convolutional encoder is expressed using N polynomials, and wherein one polynomial is output for each iteration; andtransmit encoded bit streams selected from the respective encoded bit streams.2.The apparatus of claim 1, wherein N is based at least in part on an encoding rate.3.The apparatus of claim 1, wherein the one or more processors are individually or collectively configured to cause the transmitter device to select the encoded bit streams from the respective encoded bit streams based at least in part on a selection value.4.The apparatus of claim 1, wherein the encoded bit streams are selected without a sub-block interleaver and without a circular buffer.5.The apparatus of claim 1, wherein the one or more processors are individually or collectively configured to cause the transmitter device to interleave the respective encoded bit streams via an interleaver that is one row and has an inter-column permutation pattern that is applied to every constraint length L input bits.6.The apparatus of claim 5, wherein the inter-column permutation pattern separates adjacent bits by a number of bits that is equal to at least half of a column size of the interleaver.7.The apparatus of claim 5, wherein the inter-column permutation pattern places even-indexed bits before odd-indexed bits.8.An apparatus for wireless communication at a receiver device, comprising:one or more memories; andone or more processors coupled to the one or more memories, the one or more processors individually or collectively configured to cause the receiver device to:receive encoded bit streams that correspond to respective output bit streams that are each convolutionally encoded from a set of bits;de-interleave the encoded bit streams; anddecode the encoded bit streams.9.The apparatus of claim 8, wherein to de-interleave the encoded bit streams, the one or more processors are individually or collectively configured to cause the receiver device to de-interleave the encoded bit streams via a de-interleaver that has a size that is based at least in part on a number N of iterations for encoding the encoded bit streams and a size D of the set of bits, and wherein the de-interleaver is written in row-by-row and read out column-by-column.10.The apparatus of claim 9, wherein to de-interleave the encoded bit streams, the one or more processors are individually or collectively configured to cause the receiver device to de-interleave the encoded bit streams further based at least in part on a constraint length L minus one.11.The apparatus of claim 8, wherein the de-interleaver is one row and applies an inter-column permutation pattern to every constraint length L input bits.12.The apparatus of claim 11, wherein the inter-column permutation pattern separates adjacent bits by a number of bits that is equal to at least half of an interleaver column size.13.The apparatus of claim 11, wherein the inter-column permutation pattern places even-indexed bits before odd-indexed bits.14.The apparatus of claim 8, wherein to decode the encoded bit streams, the one or more processors are individually or collectively configured to cause the receiver device to decode the encoded bit streams via a Viterbi decoder.15.A method of wireless communication performed by a transmitter device, comprising:for each iteration of N iterations, encoding a set of bits using a convolution encoder to obtain a respective encoded bit stream, wherein the convolutional encoder is expressed using N polynomials, and wherein one polynomial is output for each iteration; andtransmitting encoded bit streams selected from the respective encoded bit streams.16.The method of claim 15, further comprising selecting the encoded bit streams from the respective encoded bit streams based at least in part on a selection value.17.The method of claim 15, wherein the encoded bit streams are selected without a sub-block interleaver and without a circular buffer.18.The method of claim 15, further comprising interleaving the respective encoded bit streams via an interleaver that is one row and has an inter-column permutation pattern that is applied to every constraint length L input bits.19.The method of claim 18, wherein the inter-column permutation pattern separates adjacent bits by a number of bits that is equal to at least half of a column size of the interleaver.20.The method of claim 18, wherein the inter-column permutation pattern places even-indexed bits before odd-indexed bits.
Citation Information
Patent Citations
Tail-biting convolutional codes with very short information blocks
CN108028667A
Convolutional coding method for multi-band communications
US20050166120A1
Channel coding and rate matching for LTE control channels
US20080301536A1
Tail-biting convolutional decoding
US20110280345A1
Rate-matching scheme for control channels using polar codes
US20200083987A1