Code blocks aligned to OFDM symbols for enhanced data aided channel estimation
By aligning code blocks with OFDM symbols in wireless communication systems, the challenges of split code blocks in data aided channel estimation are addressed, leading to improved channel estimation accuracy and system performance.
Patent Information
- Application Number
- PCT/US2024/056255
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-12-13
- Filing Date
- 2024-11-15
- Publication Date
- 2025-06-19
AI Technical Summary
Current wireless communication systems face challenges in data aided channel estimation due to the lack of alignment between code blocks (CBs) and orthogonal frequency division multiplexed (OFDM) symbols, leading to split CBs across multiple OFDM symbols, which complicates error-free demodulation and decoding.
The proposed solution involves aligning code blocks with OFDM symbols, ensuring that each code block is constrained to a single OFDM symbol, thereby allowing for per-symbol LDPC decoding and confirming the error-free status of demodulated data used as pilots for channel estimation.
This alignment enhances data aided channel estimation by ensuring error-free demodulated data is used for pilots, improving channel estimation accuracy, overall system performance, and reducing latency.
Smart Images

Figure US2024056255_19062025_PF_FP_ABST
Abstract
Description
CODE BLOCKS ALIGNED TO OFDM SYMBOLS FOR ENHANCED DATA AIDED CHANNEL ESTIMATIONCROSS-REFERENCE TO RELATED APPLICATION(S)
[0001] This application claims priority to Israel Patent Application No. 309339, filed December 13, 2023, which is hereby incorporated by reference herein.Field of the Disclosure
[0002] Aspects of the present disclosure relate to wireless communications, and more particularly, to techniques for enhanced data aided channel estimation.Description of Related Art
[0003] Wireless communications systems are widely deployed to provide various telecommunication services such as telephony, video, data, messaging, broadcasts, or other similar types of services. These wireless communications systems may employ multiple-access technologies capable of supporting communications with multiple users by sharing available wireless communications system resources with those users.
[0004] Although wireless communications systems have made great technological advancements over many years, challenges still exist. For example, complex and dynamic environments can still attenuate or block signals between wireless transmitters and wireless receivers. Accordingly, there is a continuous desire to improve the technical performance of wireless communications systems, including, for example: improving speed and data carrying capacity of communications, improving efficiency of the use of shared communications mediums, reducing power used by transmitters and receivers while performing communications, improving reliability of wireless communications, avoiding redundant transmissions and / or receptions and related processing, improving the coverage area of wireless communications, increasing the number and types of devices that can access wireless communications systems, increasing the ability for different types of devices to intercommunicate, increasing the number and type of wireless communications mediums available for use, and the like. Consequently, there exists a need for further improvements in wireless communications systems to overcome the aforementioned technical challenges and others.SUMMARY
[0005] One aspect provides a method for wireless communications by a user equipment (UE). The method includes transmitting, to a network entity, signaling indicating a user equipment (UE) supports data aided channel estimation; receiving, after transmitting the signaling, a plurality of code blocks (CBs) from the network in one or more orthogonal frequency division multiplexed (OFDM) symbols; and decoding the CBs using an iterative process performed on each OFDM symbol, wherein the iterative process involves data aided channel estimation and each iteration of the process involves demodulation and decoding.
[0006] Another aspect provides a method for wireless communications by a network entity. The method includes receiving signaling indicating a user equipment (UE) supports data aided channel estimation; and transmitting, after receiving the signaling, a plurality of code blocks (CBs) to the UE in one or more orthogonal frequency division multiplexed (OFDM) symbols subject to at least a first constraint that each CB is constrained to single orthogonal frequency division multiplexed (OFDM) symbol.
[0007] Other aspects provide: an apparatus operable, configured, or otherwise adapted to perform any one or more of the aforementioned methods and / or those described elsewhere herein; a non-transitory, computer-readable media comprising instructions that, when executed (e.g., directly, indirectly, after pre-processing, without pre-processing) by one or more processors of an apparatus, cause the apparatus to perform the aforementioned methods as well as those described elsewhere herein; a computer program product embodied on a computer-readable storage medium comprising code for performing the aforementioned methods as well as those described elsewhere herein; and / or an apparatus comprising means for performing the aforementioned methods as well as those described elsewhere herein. By way of example, an apparatus may comprise a processing system, a device with a processing system, or processing systems cooperating over one or more networks.
[0008] The following description and the appended figures set forth certain features for purposes of illustration.BRIEF DESCRIPTION OF DRAWINGS
[0009] The appended figures depict certain features of the various aspects described herein and are not to be considered limiting of the scope of this disclosure.
[0010] FIG. 1 depicts an example wireless communications network.
[0011] FIG. 2 depicts an example disaggregated base station architecture.
[0012] FIG. 3 depicts aspects of an example base station and an example user equipment.
[0013] FIGS. 4A, 4B, 4C, and 4D depict various example aspects of data structures for a wireless communications network.
[0014] FIG. 5 depicts an example LDPC encoding transmit chain.
[0015] FIG. 6 depicts an example of code blocks (CBs) misaligned with OFDM symbols.
[0016] FIGs. 7 and 8 depict examples of data assisted channel estimation.
[0017] FIG. 9 depicts a call flow diagram for enhanced data assisted channel estimation, in accordance with aspects of the present disclosure.
[0018] FIG. 10 depicts an example of code blocks (CBs) misaligned with OFDM symbols.
[0019] FIG. 11 depicts an example of enhanced data assisted channel estimation, in accordance with aspects of the present disclosure.
[0020] FIG. 12 depicts a method for wireless communications.
[0021] FIG. 13 depicts a method for wireless communications.
[0022] FIG. 14 depicts aspects of an example communications device.DETAILED DESCRIPTION
[0023] Aspects of the present disclosure relate to wireless communications, and more particularly, to techniques for enhanced data aided channel estimation.
[0024] In certain wireless systems, such as 5G new radio (NR), various physical-layer channel coding schemes using polar and low-density parity-check (LDPC) codes have been introduced for various types of communications, to achieve improved throughput, latency, and reliability. In many systems, LDPC coding is used for user data, while polar coding is used for control information.
[0025] Low-Density Parity-Check (LDPC) codes are a class of error-correcting codes widely used in digital communication systems. LDPC codes are characterized by a sparse parity-check matrix, meaning that only a small fraction of its entries are non-zero. This sparsity contributes to efficient encoding and decoding processes. In LDPC encoding, information bits are mapped to codewords through matrix multiplication. The sparse nature of the parity-check matrix allows for a high degree of parallelism in the encoding process, making it computationally efficient.
[0026] The LDPC encoding process involves multiplying the information bits by the parity-check matrix to generate the codeword. Each row of the matrix represents a paritycheck equation, and the resulting codeword satisfies all these equations. This process introduces redundancy into the data, enabling the detection and correction of errors during transmission. LDPC codes are known for their excellent error-correction performance.
[0027] The most common signal configuration that is used at the 5G specifications, is the orthogonal frequency division multiplexed (OFDM) configuration. With the OFDM configuration each symbol is mapped(allocated) at a specific allocation, across the frequency domain (FD) and time domain (TD). The most basic component is referred to as a resource element (RE), spanning one symbol in the time domain and subcarrier in the frequency domain. When LDPC encoding is used, each group of symbols (which are allocated per RE) is generated by an LDPC encoder and a constellation mapper (as illustrated in FIG. 5). Such a group is referred to as a code block (CB).
[0028] Despite the advantages of LDPC codes, there are certain issues that may limit their use in certain enhanced processing techniques, such as data aided channel estimation (CHEST). In data aided CHEST, demodulated data is used as pilots to improved CHEST. In current systems, there is no restriction of an alignment between the OFDM symbols and the CB. As will be described in greater detail below with reference to FIG. 6, this may result in CBs being split between two different OFDM symbols. The impact on data aided CHEST is that multiple OFDM symbols may need to be processed before an LDPC decoder can confirm (via an error check) that there are no errors in demodulated data used as pilots to aid in channel estimation.
[0029] Aspects of the present disclosure may enhance data aided CHEST by enforcing a restriction that align CBs with OFDM symbols. The restriction may prevent CBs from being split across multiple OFDM symbols. As a result, LDPC decoding maybe performed on a per-symbol basis, allowing an LDPC decoder to confirm demodulated data used for pilots is error-free. As a result, the techniques presented herein may improve channel estimation, improve overall performance, and reduce latency.Introduction to Wireless Communications Networks
[0030] The techniques and methods described herein may be used for various wireless communications networks. While aspects may be described herein using terminology commonly associated with 3G, 4G, and / or 5G wireless technologies, aspects of the present disclosure may likewise be applicable to other communications systems and standards not explicitly mentioned herein.
[0031] FIG. 1 depicts an example of a wireless communications network 100, in which aspects described herein may be implemented.
[0032] Generally, wireless communications network 100 includes various network entities (alternatively, network elements or network nodes). A network entity is generally a communications device and / or a communications function performed by a communications device (e.g., a user equipment (UE), a base station (BS), a component of a BS, a server, etc.). For example, various functions of a network as well as various devices associated with and interacting with a network may be considered network entities. Further, wireless communications network 100 includes terrestrial aspects, such as ground-based network entities (e.g., BSs 102), and non-terrestrial aspects, such as satellite 140 and aircraft 145, which may include network entities on-board (e.g., one or more BSs) capable of communicating with other network elements (e.g., terrestrial BSs) and user equipments.
[0033] In the depicted example, wireless communications network 100 includes BSs 102, UEs 104, and one or more core networks, such as an Evolved Packet Core (EPC) 160 and 5G Core (5GC) network 190, which interoperate to provide communications services over various communications links, including wired and wireless links.
[0034] FIG. 1 depicts various example UEs 104, which may more generally include: a cellular phone, smart phone, session initiation protocol (SIP) phone, laptop, personal digital assistant (PDA), satellite radio, global positioning system, multimedia device, video device, digital audio player, camera, game console, tablet, smart device, wearable device, vehicle, electric meter, gas pump, large or small kitchen appliance, healthcare device, implant, sensor / actuator, display, internet of things (loT) devices, always on(AON) devices, edge processing devices, or other similar devices. UEs 104 may also be referred to more generally as a mobile device, a wireless device, a wireless communications device, a station, a mobile station, a subscriber station, a mobile subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a remote device, an access terminal, a mobile terminal, a wireless terminal, a remote terminal, a handset, and others.
[0035] BSs 102 wirelessly communicate with (e.g., transmit signals to or receive signals from) UEs 104 via communications links 120. The communications links 120 between BSs 102 and UEs 104 may include uplink (UL) (also referred to as reverse link) transmissions from a UE 104 to a BS 102 and / or downlink (DL) (also referred to as forward link) transmissions from a BS 102 to a UE 104. The communications links 120 may use multiple-input and multiple-output (MIMO) antenna technology, including spatial multiplexing, beamforming, and / or transmit diversity in various aspects.
[0036] BSs 102 may generally include: a NodeB, enhanced NodeB (eNB), next generation enhanced NodeB (ng-eNB), next generation NodeB (gNB or gNodeB), access point, base transceiver station, radio base station, radio transceiver, transceiver function, transmission reception point, and / or others. Each of BSs 102 may provide communications coverage for a respective geographic coverage area 110, which may sometimes be referred to as a cell, and which may overlap in some cases (e.g., small cell 102’ may have a coverage area 110’ that overlaps the coverage area 110 of a macro cell). A BS may, for example, provide communications coverage for a macro cell (covering relatively large geographic area), a pico cell (covering relatively smaller geographic area, such as a sports stadium), a femto cell (relatively smaller geographic area (e.g., a home)), and / or other types of cells.
[0037] While BSs 102 are depicted in various aspects as unitary communications devices, BSs 102 may be implemented in various configurations. For example, one or more components of a base station may be disaggregated, including a central unit (CU), one or more distributed units (DUs), one or more radio units (RUs), a Near-Real Time (Near-RT) RAN Intelligent Controller (RIC), or a Non-Real Time (Non-RT) RIC, to name a few examples. In another example, various aspects of a base station may be virtualized. More generally, a base station (e.g., BS 102) may include components that are located at a single physical location or components located at various physical locations. In examples in which a base station includes components that are located atvarious physical locations, the various components may each perform functions such that, collectively, the various components achieve functionality that is similar to a base station that is located at a single physical location. In some aspects, a base station including components that are located at various physical locations may be referred to as a disaggregated radio access network architecture, such as an Open RAN (O-RAN) or Virtualized RAN (VRAN) architecture. FIG. 2 depicts and describes an example disaggregated base station architecture.
[0038] Different BSs 102 within wireless communications network 100 may also be configured to support different radio access technologies, such as 3G, 4G, and / or 5G. For example, BSs 102 configured for 4G LTE (collectively referred to as Evolved Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (E- UTRAN)) may interface with the EPC 160 through first backhaul links 132 (e.g., an SI interface). BSs 102 configured for 5G (e.g., 5G NR or Next Generation RAN (NG-RAN)) may interface with 5GC 190 through second backhaul links 184. BSs 102 may communicate directly or indirectly (e.g., through the EPC 160 or 5GC 190) with each other over third backhaul links 134 (e.g., X2 interface), which may be wired or wireless.
[0039] Wireless communications network 100 may subdivide the electromagnetic spectrum into various classes, bands, channels, or other features. In some aspects, the subdivision is provided based on wavelength and frequency, where frequency may also be referred to as a carrier, a subcarrier, a frequency channel, a tone, or a subband. For example, 3GPP currently defines Frequency Range 1 (FR1) as including 410 MHz - 7125 MHz, which is often referred to (interchangeably) as “Sub-6 GHz”. Similarly, 3GPP currently defines Frequency Range 2 (FR2) as including 24,250 MHz - 71,000 MHz, which is sometimes referred to (interchangeably) as a “millimeter wave” (“mmW” or “mmWave”). In some cases, FR2 may be further defined in terms of sub-ranges, such as a first sub-range FR2-1 including 24,250 MHz - 52,600 MHz and a second sub-range FR2-2 including 52,600 MHz - 71,000 MHz. A base station configured to communicate using mmWave / near mmWave radio frequency bands (e.g., a mmWave base station such as BS 180) may utilize beamforming (e.g., 182) with a UE (e.g., 104) to improve path loss and range.
[0040] The communications links 120 between BSs 102 and, for example, UEs 104, may be through one or more carriers, which may have different bandwidths (e.g., 5, 10, 15, 20, 100, 400, and / or other MHz), and which may be aggregated in various aspects.Carriers may or may not be adjacent to each other. Allocation of carriers may be asymmetric with respect to DL and UL (e.g., more or fewer carriers may be allocated for DL than for UL).
[0041] Communications using higher frequency bands may have higher path loss and a shorter range compared to lower frequency communications. Accordingly, certain base stations (e.g., 180 in FIG. 1) may utilize beamforming 182 with a UE 104 to improve path loss and range. For example, BS 180 and the UE 104 may each include a plurality of antennas, such as antenna elements, antenna panels, and / or antenna arrays to facilitate the beamforming. In some cases, BS 180 may transmit a beamformed signal to UE 104 in one or more transmit directions 182’. UE 104 may receive the beamformed signal from the BS 180 in one or more receive directions 182”. UE 104 may also transmit a beamformed signal to the BS 180 in one or more transmit directions 182”. BS 180 may also receive the beamformed signal from UE 104 in one or more receive directions 182’. BS 180 and UE 104 may then perform beam training to determine the best receive and transmit directions for each of BS 180 and UE 104. Notably, the transmit and receive directions for BS 180 may or may not be the same. Similarly, the transmit and receive directions for UE 104 may or may not be the same.
[0042] Wireless communications network 100 further includes a Wi-Fi AP 150 in communication with Wi-Fi stations (STAs) 152 via communications links 154 in, for example, a 2.4 GHz and / or 5 GHz unlicensed frequency spectrum.
[0043] Certain UEs 104 may communicate with each other using device-to-device (D2D) communications link 158. D2D communications link 158 may use one or more sidelink channels, such as a physical sidelink broadcast channel (PSBCH), a physical sidelink discovery channel (PSDCH), a physical sidelink shared channel (PSSCH), a physical sidelink control channel (PSCCH), and / or a physical sidelink feedback channel (PSFCH).
[0044] EPC 160 may include various functional components, including: a Mobility Management Entity (MME) 162, other MMEs 164, a Serving Gateway 166, a Multimedia Broadcast Multicast Service (MBMS) Gateway 168, a Broadcast Multicast Service Center (BM-SC) 170, and / or a Packet Data Network (PDN) Gateway 172, such as in the depicted example. MME 162 may be in communication with a Home Subscriber Server(HSS) 174. MME 162 is the control node that processes the signaling between the UEs 104 and the EPC 160. Generally, MME 162 provides bearer and connection management.
[0045] Generally, user Internet protocol (IP) packets are transferred through Serving Gateway 166, which itself is connected to PDN Gateway 172. PDN Gateway 172 provides UE IP address allocation as well as other functions. PDN Gateway 172 and the BM-SC 170 are connected to IP Services 176, which may include, for example, the Internet, an intranet, an IP Multimedia Subsystem (IMS), a Packet Switched (PS) streaming service, and / or other IP services.
[0046] BM-SC 170 may provide functions for MBMS user service provisioning and delivery. BM-SC 170 may serve as an entry point for content provider MBMS transmission, may be used to authorize and initiate MBMS Bearer Services within a public land mobile network (PLMN), and / or may be used to schedule MBMS transmissions. MBMS Gateway 168 may be used to distribute MBMS traffic to the BSs 102 belonging to a Multicast Broadcast Single Frequency Network (MBSFN) area broadcasting a particular service, and / or may be responsible for session management (start / stop) and for collecting eMBMS related charging information.
[0047] 5GC 190 may include various functional components, including: an Access and Mobility Management Function (AMF) 192, other AMFs 193, a Session Management Function (SMF) 194, and a User Plane Function (UPF) 195. AMF 192 may be in communication with Unified Data Management (UDM) 196.
[0048] AMF 192 is a control node that processes signaling between UEs 104 and 5GC 190. AMF 192 provides, for example, quality of service (QoS) flow and session management.
[0049] Internet protocol (IP) packets are transferred through UPF 195, which is connected to the IP Services 197, and which provides UE IP address allocation as well as other functions for 5GC 190. IP Services 197 may include, for example, the Internet, an intranet, an IMS, a PS streaming service, and / or other IP services.
[0050] In various aspects, a network entity or network node can be implemented as an aggregated base station, as a disaggregated base station, a component of a base station, an integrated access and backhaul (IAB) node, a relay node, a sidelink node, to name a few examples.
[0051] FIG. 2 depicts an example disaggregated base station 200 architecture. The disaggregated base station 200 architecture may include one or more central units (CUs) 210 that can communicate directly with a core network 220 via a backhaul link, or indirectly with the core network 220 through one or more disaggregated base station units (such as a Near-Real Time (Near-RT) RAN Intelligent Controller (RIC) 225 via an E2 link, or a Non-Real Time (Non-RT) RIC 215 associated with a Service Management and Orchestration (SMO) Framework 205, or both). A CU 210 may communicate with one or more distributed units (DUs) 230 via respective midhaul links, such as an Fl interface. The DUs 230 may communicate with one or more radio units (RUs) 240 via respective fronthaul links. The RUs 240 may communicate with respective UEs 104 via one or more radio frequency (RF) access links. In some implementations, the UE 104 may be simultaneously served by multiple RUs 240.
[0052] Each of the units, e.g., the CUs 210, the DUs 230, the RUs 240, as well as the Near-RT RICs 225, the Non-RT RICs 215 and the SMO Framework 205, may include one or more interfaces or be coupled to one or more interfaces configured to receive or transmit signals, data, or information (collectively, signals) via a wired or wireless transmission medium. Each of the units, or an associated processor or controller providing instructions to the communications interfaces of the units, can be configured to communicate with one or more of the other units via the transmission medium. For example, the units can include a wired interface configured to receive or transmit signals over a wired transmission medium to one or more of the other units. Additionally or alternatively, the units can include a wireless interface, which may include a receiver, a transmitter or transceiver (such as a radio frequency (RF) transceiver), configured to receive or transmit signals, or both, over a wireless transmission medium to one or more of the other units.
[0053] In some aspects, the CU 210 may host one or more higher layer control functions. Such control functions can include radio resource control (RRC), packet data convergence protocol (PDCP), service data adaptation protocol (SDAP), or the like. Each control function can be implemented with an interface configured to communicate signals with other control functions hosted by the CU 210. The CU 210 may be configured to handle user plane functionality (e.g., Central Unit - User Plane (CU-UP)), control plane functionality (e.g., Central Unit - Control Plane (CU-CP)), or a combination thereof. In some implementations, the CU 210 can be logically split into one or more CU-UP unitsand one or more CU-CP units. The CU-UP unit can communicate bidirectionally with the CU-CP unit via an interface, such as the El interface when implemented in an O-RAN configuration. The CU 210 can be implemented to communicate with the DU 230, as necessary, for network control and signaling.
[0054] The 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. In some aspects, the DU 230 may host one or more of a radio link control (RLC) layer, a medium access control (MAC) layer, and one or more high physical (PHY) layers (such as modules for forward error correction (FEC) encoding and decoding, scrambling, modulation and demodulation, or the like) depending, at least in part, on a functional split, such as those defined by the 3rdGeneration Partnership Project (3GPP). In some aspects, the DU 230 may further host one or more low PHY layers. Each layer (or module) can be implemented with an interface configured to communicate signals with other layers (and modules) hosted by the DU 230, or with the control functions hosted by the CU 210.
[0055] Lower-layer functionality can be implemented by one or more RUs 240. In some deployments, an RU 240, controlled by a DU 230, may correspond to a logical node that hosts RF processing functions, or low-PHY layer functions (such as performing fast Fourier transform (FFT), inverse FFT (iFFT), digital beamforming, physical random access channel (PRACH) extraction and filtering, or the like), or both, based at least in part on the functional split, such as a lower layer functional split. In such an architecture, the RU(s) 240 can be implemented to handle over the air (OTA) communications with one or more UEs 104. In some implementations, real-time and non-real-time aspects of control and user plane communications with the RU(s) 240 can be controlled by the corresponding DU 230. In some scenarios, this configuration can enable the DU(s) 230 and the CU 210 to be implemented in a cloud-based RAN architecture, such as a vRAN architecture.
[0056] The SMO Framework 205 may be configured to support RAN deployment and provisioning of non-virtualized and virtualized network elements. For non-virtualized network elements, the SMO Framework 205 may be configured to support the deployment of dedicated physical resources for RAN coverage requirements which may be managed via an operations and maintenance interface (such as an 01 interface). For virtualized network elements, the SMO Framework 205 may be configured to interact with a cloud computing platform (such as an open cloud (O-Cloud) 290) to performnetwork element life cycle management (such as to instantiate virtualized network elements) via a cloud computing platform interface (such as an 02 interface). Such virtualized network elements can include, but are not limited to, CUs 210, DUs 230, RUs 240 and Near-RT RICs 225. In some implementations, the SMO Framework 205 can communicate with a hardware aspect of a 4G RAN, such as an open eNB (O-eNB) 211, via an 01 interface. Additionally, in some implementations, the SMO Framework 205 can communicate directly with one or more RUs 240 via an 01 interface. The SMO Framework 205 also may include a Non-RT RIC 215 configured to support functionality of the SMO Framework 205.
[0057] The Non-RT RIC 215 may be configured to include a logical function that enables non-real-time control and optimization of RAN elements and resources, Artificial Intelligence / Machine Learning (AI / ML) workflows including model training and updates, or policy -based guidance of applications / features in the Near-RT RIC 225. The Non-RT RIC 215 may be coupled to or communicate with (such as via an Al interface) the Near-RT RIC 225. The Near-RT RIC 225 may be configured to include a logical function that enables near-real-time control and optimization of RAN elements and resources via data collection and actions over an interface (such as via an E2 interface) connecting one or more CUs 210, one or more DUs 230, or both, as well as an O-eNB, with the Near-RT RIC 225.
[0058] In some implementations, to generate AI / ML models to be deployed in the Near-RT RIC 225, the Non-RT RIC 215 may receive parameters or external enrichment information from external servers. Such information may be utilized by the Near-RT RIC 225 and may be received at the SMO Framework 205 or the Non-RT RIC 215 from nonnetwork data sources or from network functions. In some examples, the Non-RT RIC 215 or the Near-RT RIC 225 may be configured to tune RAN behavior or performance. For example, the Non-RT RIC 215 may monitor long-term trends and patterns for performance and employ AI / ML models to perform corrective actions through the SMO Framework 205 (such as reconfiguration via 01) or via creation of RAN management policies (such as Al policies).
[0059] FIG. 3 depicts aspects of an example BS 102 and a UE 104.
[0060] Generally, BS 102 includes various processors (e.g., 320, 330, 338, and 340), antennas 334a-t (collectively 334), transceivers 332a-t (collectively 332), which includemodulators and demodulators, and other aspects, which enable wireless transmission of data (e.g., data source 312) and wireless reception of data (e.g., data sink 339). For example, BS 102 may send and receive data between BS 102 and UE 104. BS 102 includes controller / processor 340, which may be configured to implement various functions described herein related to wireless communications.
[0061] Generally, UE 104 includes various processors (e.g., 358, 364, 366, and 380), antennas 352a-r (collectively 352), transceivers 354a-r (collectively 354), which include modulators and demodulators, and other aspects, which enable wireless transmission of data (e.g., retrieved from data source 362) and wireless reception of data (e.g., provided to data sink 360). UE 104 includes controller / processor 380, which may be configured to implement various functions described herein related to wireless communications.
[0062] In regards to an example downlink transmission, BS 102 includes a transmit processor 320 that may receive data from a data source 312 and control information from a controller / processor 340. The control information may be for the physical broadcast channel (PBCH), physical control format indicator channel (PCFICH), physical HARQ indicator channel (PHICH), physical downlink control channel (PDCCH), group common PDCCH (GC PDCCH), and / or others. The data may be for the physical downlink shared channel (PDSCH), in some examples.
[0063] Transmit processor 320 may process (e.g., encode and symbol map) the data and control information to obtain data symbols and control symbols, respectively. Transmit processor 320 may also generate reference symbols, such as for the primary synchronization signal (PSS), secondary synchronization signal (SSS), PBCH demodulation reference signal (DMRS), and channel state information reference signal (CSI-RS).
[0064] Transmit (TX) multiple-input multiple-output (MIMO) processor 330 may perform spatial processing (e.g., precoding) on the data symbols, the control symbols, and / or the reference symbols, if applicable, and may provide output symbol streams to the modulators (MODs) in transceivers 332a-332t. Each modulator in transceivers 332a- 332t may process a respective output symbol stream to obtain an output sample stream. Each modulator may further process (e.g., convert to analog, amplify, filter, and upconvert) the output sample stream to obtain a downlink signal. Downlink signals fromthe modulators in transceivers 332a-332t may be transmitted via the antennas 334a-334t, respectively.
[0065] In order to receive the downlink transmission, UE 104 includes antennas 352a- 352r that may receive the downlink signals from the BS 102 and may provide received signals to the demodulators (DEMODs) in transceivers 354a-354r, respectively. Each demodulator in transceivers 354a-354r may condition (e.g., filter, amplify, downconvert, and digitize) a respective received signal to obtain input samples. Each demodulator may further process the input samples to obtain received symbols.
[0066] MIMO detector 356 may obtain received symbols from all the demodulators in transceivers 354a-354r, perform MIMO detection on the received symbols if applicable, and provide detected symbols. Receive processor 358 may process (e.g., demodulate, deinterleave, and decode) the detected symbols, provide decoded data for the UE 104 to a data sink 360, and provide decoded control information to a controller / processor 380.
[0067] In regards to an example uplink transmission, UE 104 further includes a transmit processor 364 that may receive and process data (e.g., for the PUSCH) from a data source 362 and control information (e.g., for the physical uplink control channel (PUCCH)) from the controller / processor 380. Transmit processor 364 may also generate reference symbols for a reference signal (e.g., for the sounding reference signal (SRS)). The symbols from the transmit processor 364 may be precoded by a TX MIMO processor 366 if applicable, further processed by the modulators in transceivers 354a-354r (e.g., for SC-FDM), and transmitted to BS 102.
[0068] At BS 102, the uplink signals from UE 104 may be received by antennas 334a- t, processed by the demodulators in transceivers 332a-332t, detected by a MIMO detector 336 if applicable, and further processed by a receive processor 338 to obtain decoded data and control information sent by UE 104. Receive processor 338 may provide the decoded data to a data sink 339 and the decoded control information to the controller / processor 340.
[0069] Memories 342 and 382 may store data and program codes for BS 102 and UE 104, respectively.
[0070] Scheduler 344 may schedule UEs for data transmission on the downlink and / or uplink.
[0071] In various aspects, BS 102 may be described as transmitting and receiving various types of data associated with the methods described herein. In these contexts, “transmitting” may refer to various mechanisms of outputting data, such as outputting data from data source 312, scheduler 344, memory 342, transmit processor 320, controller / processor 340, TX MIMO processor 330, transceivers 332a-t, antenna 334a-t, and / or other aspects described herein. Similarly, “receiving” may refer to various mechanisms of obtaining data, such as obtaining data from antennas 334a-t, transceivers 332a-t, RX MIMO detector 336, controller / processor 340, receive processor 338, scheduler 344, memory 342, and / or other aspects described herein.
[0072] In various aspects, UE 104 may likewise be described as transmitting and receiving various types of data associated with the methods described herein. In these contexts, “transmitting” may refer to various mechanisms of outputting data, such as outputting data from data source 362, memory 382, transmit processor 364, controller / processor 380, TX MIMO processor 366, transceivers 354a-t, antenna 352a-t, and / or other aspects described herein. Similarly, “receiving” may refer to various mechanisms of obtaining data, such as obtaining data from antennas 352a-t, transceivers 354a-t, RX MIMO detector 356, controller / processor 380, receive processor 358, memory 382, and / or other aspects described herein.
[0073] In some aspects, one or more processors may be configured to perform various operations, such as those associated with the methods described herein, and transmit (output) to or receive (obtain) data from another interface that is configured to transmit or receive, respectively, the data.
[0074] FIGS. 4A, 4B, 4C, and 4D depict aspects of data structures for a wireless communications network, such as wireless communications network 100 of FIG. 1.
[0075] In particular, FIG. 4A is a diagram 400 illustrating an example of a first subframe within a 5G (e.g., 5GNR) frame structure, FIG. 4B is a diagram 430 illustrating an example of DL channels within a 5G subframe, FIG. 4C is a diagram 450 illustrating an example of a second subframe within a 5G frame structure, and FIG. 4D is a diagram 480 illustrating an example of UL channels within a 5G subframe.
[0076] Wireless communications systems may utilize orthogonal frequency division multiplexing (OFDM) with a cyclic prefix (CP) on the uplink and downlink. Such systems may also support half-duplex operation using time division duplexing (TDD). OFDM andsingle-carrier frequency division multiplexing (SC-FDM) partition the system bandwidth (e.g., as depicted in FIGS. 4B and 4D) into multiple orthogonal subcarriers. Each subcarrier may be modulated with data. Modulation symbols may be sent in the frequency domain with OFDM and / or in the time domain with SC-FDM.
[0077] A wireless communications frame structure may be frequency division duplex (FDD), in which, for a particular set of subcarriers, subframes within the set of subcarriers are dedicated for either DL or UL. Wireless communications frame structures may also be time division duplex (TDD), in which, for a particular set of subcarriers, subframes within the set of subcarriers are dedicated for both DL and UL.
[0078] In FIG. 4A and 4C, the wireless communications frame structure is TDD where D is DL, U is UL, and X is flexible for use between DL / UL. UEs may be configured with a slot format through a received slot format indicator (SFI) (dynamically through DL control information (DCI), or semi-statically / statically through radio resource control (RRC) signaling). In the depicted examples, a 10 ms frame is divided into 10 equally sized 1 ms subframes. Each subframe may include one or more time slots. In some examples, each slot may include 7 or 14 symbols, depending on the slot format. Subframes may also include mini-slots, which generally have fewer symbols than an entire slot. Other wireless communications technologies may have a different frame structure and / or different channels.
[0079] In certain aspects, the number of slots within a subframe is based on a slot configuration and a numerology. For example, for slot configuration 0, different numerol ogies (p) 0 to 6 allow for 1, 2, 4, 8, 16, 32, and 64 slots, respectively, per subframe. For slot configuration 1, different numerologies 0 to 2 allow for 2, 4, and 8 slots, respectively, per subframe. Accordingly, for slot configuration 0 and numerology p, there are 14 symbols / slot and 2p slots / subframe. The subcarrier spacing and symbol length / duration are a function of the numerology. The subcarrier spacing may be equal to 2^ X 15 kHz, where p is the numerology 0 to 6. As such, the numerology p = 0 has a subcarrier spacing of 15 kHz and the numerology p = 6 has a subcarrier spacing of 960 kHz. The symbol length / duration is inversely related to the subcarrier spacing. FIGS. 4A, 4B, 4C, and 4D provide an example of slot configuration 0 with 14 symbols per slot and numerology p = 2 with 4 slots per subframe. The slot duration is 0.25 ms, the subcarrier spacing is 60 kHz, and the symbol duration is approximately 16.67 ps.
[0080] As depicted in FIGS. 4A, 4B, 4C, and 4D, a resource grid may be used to represent the frame structure. Each time slot includes a resource block (RB) (also referred to as physical RBs (PRBs)) that extends, for example, 12 consecutive subcarriers. The resource grid is divided into multiple resource elements (REs). The number of bits carried by each RE depends on the modulation scheme.
[0081] As illustrated in FIG. 4A, some of the REs carry reference (pilot) signals (RS) for a UE (e.g., UE 104 of FIGS. 1 and 3). The RS may include demodulation RS (DMRS) and / or channel state information reference signals (CSI-RS) for channel estimation at the UE. The RS may also include beam measurement RS (BRS), beam refinement RS (BRRS), and / or phase tracking RS (PT-RS).
[0082] FIG. 4B illustrates an example of various DL channels within a subframe of a frame. The physical downlink control channel (PDCCH) carries DCI within one or more control channel elements (CCEs), each CCE including, for example, nine RE groups (REGs), each REG including, for example, four consecutive REs in an OFDM symbol.
[0083] A primary synchronization signal (PSS) may be within symbol 2 of particular subframes of a frame. The PSS is used by a UE (e.g., 104 of FIGS. 1 and 3) to determine subframe / symbol timing and a physical layer identity.
[0084] A secondary synchronization signal (SSS) may be within symbol 4 of particular subframes of a frame. The SSS is used by a UE to determine a physical layer cell identity group number and radio frame timing.
[0085] Based on the physical layer identity and the physical layer cell identity group number, the UE can determine a physical cell identifier (PCI). Based on the PCI, the UE can determine the locations of the aforementioned DMRS. The physical broadcast channel (PBCH), which carries a master information block (MIB), may be logically grouped with the PSS and SSS to form a synchronization signal (SS) / PBCH block. The MIB provides a number of RBs in the system bandwidth and a system frame number (SFN). The physical downlink shared channel (PDSCH) carries user data, broadcast system information not transmitted through the PBCH such as system information blocks (SIBs), and / or paging messages.
[0086] As illustrated in FIG. 4C, some of the REs carry DMRS (indicated as R for one particular configuration, but other DMRS configurations are possible) for channel estimation at the base station. The UE may transmit DMRS for the PUCCH and DMRSfor the PUSCH. The PUSCH DMRS may be transmitted, for example, in the first one or two symbols of the PUSCH. The PUCCH DMRS may be transmitted in different configurations depending on whether short or long PUCCHs are transmitted and depending on the particular PUCCH format used. UE 104 may transmit sounding reference signals (SRS). The SRS may be transmitted, for example, in the last symbol of a subframe. The SRS may have a comb structure, and a UE may transmit SRS on one of the combs. The SRS may be used by a base station for channel quality estimation to enable frequency-dependent scheduling on the UL.
[0087] FIG. 4D illustrates an example of various UL channels within a subframe of a frame. The PUCCH may be located as indicated in one configuration. The PUCCH carries uplink control information (UCI), such as scheduling requests, a channel quality indicator (CQI), a precoding matrix indicator (PMI), a rank indicator (RI), and HARQ ACK / NACK feedback. The PUSCH carries data, and may additionally be used to carry a buffer status report (BSR), a power headroom report (PHR), and / or UCI.Overview of Low Density Parity Codes
[0088] In order for transmissions over the air interface to obtain a low block error rate (BLER) while still achieving very high data rates, channel coding may be used. That is, wireless communication may generally utilize a suitable error correcting block code. In a typical block code, an information message or sequence is split up into code blocks (CBs), and an encoder (e.g., a CODEC) at the transmitting device then mathematically adds redundancy to the information message. Exploitation of this redundancy in the encoded information message can improve the reliability of the message, enabling correction for any bit errors that may occur due to the noise.
[0089] Data coding may be implemented in multiple manners. In early 5G NR specifications, user data is coded using quasi-cyclic low-density parity check (LDPC) with two different base graphs: one base graph is used for large code blocks and / or high code rates, while the other base graph is used otherwise. Control information and the physical broadcast channel (PBCH) are coded using Polar coding, based on nested sequences. For these channels, puncturing, shortening, and repetition are used for rate matching.
[0090] FIG. 5 depicts an example LDPC encoding transmit chain 500. As illustrated, an LDPC encoder 502 may encode a code block bit sequence. A rate matching block 504may perform bit selection based on a target rate, followed by an interleaving block 506. Rate matching may be performed to adapt the code block size to the modulation and coding scheme (MCS) chosen for transmission. This step may involve puncturing or repeating bits to match the desired code rate. Pilot symbols, which are known reference symbols, may be inserted into the OFDM symbol to aid in channel estimation and equalization. Data symbols and pilot symbols are then interleaved to improve performance in the presence of frequency-selective fading. Finally, a mapping block 508 maps the encoded bits to a constellation, generating modulation symbols.
[0091] LDPC codes can be represented by bipartite graphs (often referred to as “Tanner graphs”). In a bipartite graph, a set of variable nodes corresponds to bits of a code word (e.g., information bits or systematic bits), and a set of check nodes correspond to a set of parity-check constraints that define the code. Edges in the graph connect variable nodes to check nodes. Thus, the nodes of the graph are separated into two distinctive sets and with edges connecting nodes of two different types, variable and check.
[0092] Graphs as used in LDPC coding may be characterized in a variety of manners. A lifted code is created by copying a bipartite base graph (G) (or a protograph), a number of times, Z. The number of times is referred to herein as the lifting, lifting size, or lifting size value. A variable node and a check node are considered “neighbors” if they are connected by an “edge” (i.e., the line connecting the variable node and the check node) in the graph. In addition, for each edge (e) of the bipartite base graph (G), a permutation (generally an integer value associated with the edge permutation that is represented by k and referred to as the lifting value) is applied to the Z copies of edge (e) to interconnect the Z copies of G. A bit sequence having a one-to-one association with the variable node sequence is a valid code word if and only if, for each check node, the bits associated with all neighboring variable nodes sum to 0 modulo 2 (i.e., they include an even number of l’s). The resulting LDPC code may be quasi -cyclic (QC) if the permutations (liftings values) used are cyclic.
[0093] A received LDPC code word can be decoded to produce a reconstructed version of the original code word. In the absence of errors, or in the case of correctable errors, decoding can be used to recover the original data unit that was encoded. Redundant bits may be used by decoders to detect and correct bit errors. LDPC decoder(s) generally operate by iteratively performing local calculations and passing those results byexchanging messages within the bipartite graph along the edges, and updating these messages by performing computations at the nodes based on the incoming messages. These steps may be repeated several times. For example, each variable node in the graph may initially be provided with a “soft bit” (e.g., representing the received bit of the code word) that indicates an estimate of the associated bit’s value as determined by observations from the communications channel. Using these soft bits the LDPC decoders may update messages by iteratively reading them, or some portion thereof, from memory and writing an updated message, or some portion thereof, back to, memory. The update operations are typically based on the parity check constraints of the corresponding LDPC code. In implementations for lifted LDPC codes, messages on like edges are often processed in parallel.
[0094] LDPC codes designed for high speed applications often use quasi-cyclic constructions with large lifting factors and relatively small base graphs to support high parallelism in encoding and decoding operations. LDPC codes with higher code rates (e.g., the ratio of the message length to the codeword length) tend to have relatively fewer parity checks. If the number of base parity checks is smaller than the degree of a variable node (e.g., the number of edges connected to a variable node), then, in the base graph, that variable node is connected to at least one of the base parity checks by two or more edges (e.g., the variable node may have a “double edge”). If the number of base parity checks is smaller than the degree of a variable node (e.g., the number of edges connected to a variable node), then, in the base graph, that variable node is connected to at least one of the base parity checks by two or more edges. Having a base variable node and a base check node connected by two or more edges is generally undesirable for parallel hardware implementation purposes. For example, such double edges may result in multiple concurrent read and write operations to the same memory locations, which in turn may create data coherency problems. A double edge in a base LDPC code may trigger parallel reading of the same soft bit value memory' location twice during a single parallel parity check update. Thus, additional circuitry' is typically needed to combine the soft bit values that are written back to memory, so as to properly incorporate both updates. Eliminating double edges in the LDPC code helps to avoid this extra complexity.
[0095] Puncturing is the act of removing bits from a codeword to yield a shorter codeword. Thus, punctured variable nodes correspond to codeword bits that are not actually transmitted. Puncturing a variable node in an LDPC code creates a shortenedcode (e.g. due to the removal of a bit), while also effectively removing a check node. Specifically, for a matrix representation of an LDPC code, including bits to be punctured, where the variable node to be punctured has a degree of one (such a representation may be possible through row combining provided the code is proper), puncturing the variable node removes the associated bit from the code and effectively removes its single neighboring check node from the graph. As a result, the number of check nodes in the graph is reduced by one.Aspects Related to Code Block Aligned to OFDM Symbols for Enhanced Data Aided Channel Estimation
[0096] Aspects of the present disclosure relate to wireless communications, and more particularly, to techniques for enhanced data aided channel estimation.
[0097] As noted above, in conventional systems LDPC encoded CBs may be split between multiple OFDM symbols, which may impact data aided CHEST. This is illustrated by an example allocation 600, in which 8 CBs (CB1-CB8) are mapped across 5 OFDM symbols (1-5). As illustrated, only CB1 and CB6 are contained within a single OFDM, while all other CBs are split between two OFDM symbols.
[0098] One impact of this splitting is that data aided CHEST algorithm may need to process multiple OFDM symbols before decoding a CB. As a result, there may be no way to ensure that demodulated data used as pilots during the CHEST algorithm is error free.
[0099] This impact may be explained by considering the example data aided CHEST algorithm processing flow 700 shown in FIG. 7 and the corresponding diagram 800 of FIG. 8 that shows how the data aided CHEST algorithm may be used to process an OFDM slot that includes known DMRS pilots (labeled P), a control OFDM symbol (labeled C), and data OFDM symbols (labeled D).
[0100] As illustrated in FIG. 7, a loop of a typical data aided CHEST algorithm includes estimating the channel plus noise and the RF impairments on the DMRS symbols, as shown at 702. As indicated at 704, this estimation may be used to interpolate CHEST between DMRS symbols. This is also shown at 802 in FIG. 8, where CHEST interpolation is performed for two data symbols (D) between pilots (P).
[0101] As indicated at 706 of FIG. 7, the RF impairments may be removed from the observed data symbols, and demodulation is performed with respect to the CHEST, at 708. The demodulated data may then be used as pilots using slicer 712 (and as indicatedat 804 of FIG. 8). The estimated channel and the estimated impairments may be applied on the “new” pilots, at 714 of FIG. 7. At 716, an improved CHEST and impairment estimation may be performed with respect to the “new” pilots. Operation of blocks 706- 716) may be repeated for one or more other iterations of data aided CHEST.
[0102] After a final iteration of data aided CHEST for a current OFDM symbol, as determined at 722 (and at 806 of FIG. 8), CHEST may be performed for the next OFDM symbol. These operations may be repeated until the last OFDM symbol of the slot is processed, as determined at 710. At this point, LDPC decoding may be performed, at 730 (and shown at 808 in FIG. 8), and error checking (vie cyclic redundancy check -CRC) may be performed. As shown at 810, the CHEST may again be extrapolated to the next OFDM symbol-and the process may continue.
[0103] As noted above, without decoding, there is no guarantee that demodulated data used as the “new” pilots are error free. Without this guarantee, there is a risk of accumulated propagation error to the CHEST and the impairments estimation and removal.
[0104] Aspects of the present disclosure, however, may enhance data aided CHEST by enforcing a restriction that align CBs with OFDM symbols. The restriction may prevent CBs from being split across multiple OFDM symbols. As a result, LDPC decoding may be performed on a per-symbol basis, allowing an LDPC decoder to confirm demodulated data used for pilots is error-free. As will be described in greater detail below, this restriction may help guarantee that the “new” pilots values are error free by effectively adding an LDPC decoder operation in each iteration of the data aided CHEST algorithm.
[0105] The enhanced algorithm proposed herein may be understood with reference to the call flow diagram 900 of FIG. 9. In some aspects, the UE shown in FIG. 9 may be an example of the UE 104 depicted and described with respect to FIG. 1 and 3. In some aspects, the network entity shown in FIG. 9 may be an example of the BS 102 (e.g., a gNB) depicted and described with respect to FIG. 1 and 3 or a disaggregated base station depicted and described with respect to FIG. 2.
[0106] As illustrated at 902, the UE may provide the gNB (network entity) with an indication of its capability to perform data aided CHEST (using aligned CBs). To providethis indication, the UE may use any suitable type of uplink signaling. For example, the indication could be provided in a MAC-CE or via RRC signaling.
[0107] As illustrated, the gNB may reply indicating whether it is going to transmit in an aligned CB mode. To provide this indication, the gNB may use any suitable type of downlink signaling. For example, the indication could be provided via a DCI, MAC-CE, or RRC signaling.
[0108] As indicated at 904, the gNB may generate LDPC encoded CBs aligned to OFDM Symbols.
[0109] For example, the example allocation 1000 of FIG. 10 shows how 10 CBs (CB1-CB10) are mapped across 5 OFDM symbols (1-5), with none of the CBs split between two OFDM symbols (in contrast to the example allocation 600 of FIG. 6). In some cases, the number of resources per code block may be the same for all the transmitted code blocks in a slot, so CB alignment may be achieved via a restriction that the number of CBs is an integer multiplication of the number of PDSCH symbols. In the example of FIG. 10, the number of CBs (10) is two times the number of PDSCH symbols (5). The number of information bits and the number of resources per code block may change, such that the same coding rate is applied. The effect of such a restriction on overall performance in terms of throughput may be relatively small (e.g., negligible), particularly in the case of large bandwidth allocation.
[0110] Referring again to FIG. 9, as indicated at 906, the UE may utilize the CB alignment to include the LDPC block inside the data aided CHEST loop.[OHl] For example, FIG. 11 illustrates an example of how the LDPC decoder block 1130 may be inside the data aided CHEST loop, rather than only decoding after the typical data aided demodulation process is over (as shown in FIG. 7). As indicated, other functions in the data aided CHEST loop may remain the same as described with reference to FIG. 7
[0112] Placing the LDPC decoder block 1130 in the loop, as illustrated, may help guarantee that the demodulated data is error-free before being used as “new” pilots. Including the LDPC decoder block 1130 in the loop provides joint demodulation and decoding per iteration.
[0113] As noted above, restricting CBs to be OFDM aligned may enable this data aided CHEST to be performed on a per-symbol basis, as no CB is allowed to span multipleOFDM symbols. In other words, if a CB is split between two (or more) OFDM symbols, then the LDPC decoder could not be activated in the same cycle of the PDSCH data.
[0114] As noted above, the LDPC decoder block will indicate whether a CB is error free, via a cyclic redundancy check (CRC) status (e.g., CRC-OK or CRC-ERROR). Thus, the LDPC block may indicate whether there is an error in the re-modulation process or not. Thus, the data aided loop can decide to continue the loop or stop it, according to the LDPC indication.
[0115] An LDPC code, as an error correction code, may also help correct the soft- slicer errors as part of its operation. Thus, including the LDPC block inside the data aided CHEST loop may help improve other operations in the loop: including CHEST, the RF impairment estimation and removal, and the noise estimation.
[0116] Even for the case in which the LDPC decoder fails to pass the CRC (CRC error), the soft outputs log likelihood ratios (LLRs) may be of higher quality with respect to the inputs LLRs. In other words, the overall mutual information between the output LLR and the transmitted information may be higher than the input LLR and the transmitted information. Hence, even when a CRC error is detected, the loop can still use the LDPC decoder output and yield improved performance.
[0117] Another potential advantage of this joint demodulation and decoding per iteration proposed herein is that it may enable a UE to report acknowledgment feedback (ACK / NACK) per OFDM symbol, which may help avoid unnecessarily retransmitting certain data. This per-symbol ACK / NACK feedback may allow for a reduction in overall latency, because the UE can send the ACK / NACK indication feedback already after each OFDM symbol, rather than incur the latency of having to wait for a whole slot to be processed.
[0118] In operation, a gNB may allocate the UE with the proper bandwidth (via frequency domain resource allocation (FDRA), according to scheduler objectives, in a conventional manner. The gNB may select a modulation and coding scheme (MCS) to maximize the channel spectral efficiency. Aspects of the present disclosure may allow a gNB to keep the same FDRA and MCS determination, but with a potential change to the amount of code blocks (and the payload each code blocks carries), which may have a relatively minor impact on spectral efficiency, especially for large allocations. The techniques proposed herein (for joint demodulation and decoding per data aided CHESTiteration) may lead to significant performance improvement (greater throughput relative to SNR).
[0119] According to certain aspects, the techniques proposed herein may be applied in CB groups (CBG) configurations. This may be achieved, for example, by restricting CBGs to OFDM boundaries. In other words, a restriction may be that a CBG is not allowed to be split into two different OFDM symbols.Example Operations
[0120] FIG. 12 shows an example of a method 1200 of wireless communications by a user equipment (UE), such as a UE 104 of FIGS. 1 and 3.
[0121] Method 1200 begins at step 1205 with transmitting, to a network entity, signaling indicating a user equipment (UE) supports data aided channel estimation. In some cases, the operations of this step refer to, or may be performed by, circuitry for transmitting and / or code for transmitting as described with reference to FIG. 14.
[0122] Method 1200 then proceeds to step 1210 with receiving, after transmitting the signaling, a plurality of code blocks (CBs) from the network in one or more orthogonal frequency division multiplexed (OFDM) symbols. In some cases, the operations of this step refer to, or may be performed by, circuitry for receiving and / or code for receiving as described with reference to FIG. 14.
[0123] Method 1200 then proceeds to step 1215 with decoding the CBs using an iterative process performed on each OFDM symbol, wherein the iterative process involves data aided channel estimation and each iteration of the process involves demodulation and decoding. In some cases, the operations of this step refer to, or may be performed by, circuitry for decoding and / or code for decoding as described with reference to FIG. 14
[0124] In some aspects, the signaling comprises at least one of a medium access control (MAC) control element (CE) or uplink control information (UCI).
[0125] In some aspects, the method 1200 further includes receiving, after transmitting the signaling, an indication that the network entity will send CBs to the UE subject to at least a first constraint that each CB is constrained to single orthogonal frequency division multiplexed (OFDM) symbol. In some cases, the operations of this step refer to, or maybe performed by, circuitry for receiving and / or code for receiving as described with reference to FIG. 14.
[0126] In some aspects, the plurality of CBs comprise at least one CB group (CBG); and the plurality of CBs are transmitted to the UE subject to at least a second constraint that each CBG is constrained to single OFDM symbol.
[0127] In some aspects, the indication is received via at least one of a medium access control (MAC) control element (CE) or downlink control information (DCI).
[0128] In some aspects, the decoding involves a low density parity check (LDPC) decoder.
[0129] In some aspects, the method 1200 further includes transmitting per-symbol acknowledgment feedback indicating whether one or more CBs in a corresponding OFDM symbol were successfully received. In some cases, the operations of this step refer to, or may be performed by, circuitry for transmitting and / or code for transmitting as described with reference to FIG. 14.
[0130] In some aspects, the data aided channel estimation involves using demodulated data from one OFDM symbol as pilots for channel estimation to aid in processing a subsequent OFDM symbol.
[0131] In one aspect, method 1200, or any aspect related to it, may be performed by an apparatus, such as communications device 1400 of FIG. 14, which includes various components operable, configured, or adapted to perform the method 1200. Communications device 1400 is described below in further detail.
[0132] Note that FIG. 12 is just one example of a method, and other methods including fewer, additional, or alternative steps are possible consistent with this disclosure.
[0133] FIG. 13 shows an example of a method 1300 of wireless communications by a network entity, such as a BS 102 of FIGS. 1 and 3, or a disaggregated base station as discussed with respect to FIG. 2.
[0134] Method 1300 begins at step 1305 with receiving signaling indicating a user equipment (UE) supports data aided channel estimation. In some cases, the operations ofthis step refer to, or may be performed by, circuitry for receiving and / or code for receiving as described with reference to FIG. 14.
[0135] Method 1300 then proceeds to step 1310 with transmitting, after receiving the signaling, a plurality of code blocks (CBs) to the UE in one or more orthogonal frequency division multiplexed (OFDM) symbols subject to at least a first constraint that each CB is constrained to single orthogonal frequency division multiplexed (OFDM) symbol. In some cases, the operations of this step refer to, or may be performed by, circuitry for transmitting and / or code for transmitting as described with reference to FIG. 14.
[0136] In some aspects, the signaling comprises at least one of a medium access control (MAC) control element (CE) or uplink control information (UCI).
[0137] In some aspects, the method 1300 further includes transmitting, after receiving the signaling, an indication that the network entity will send CBs to the UE subject to at least the first constraint. In some cases, the operations of this step refer to, or may be performed by, circuitry for transmitting and / or code for transmitting as described with reference to FIG. 14.
[0138] In some aspects, the indication is transmitted via at least one of a medium access control (MAC) control element (CE) or downlink control information (DCI).
[0139] In some aspects, the method 1300 further includes generating the plurality of CBs using a low density parity check (LDPC) encoder. In some cases, the operations of this step refer to, or may be performed by, circuitry for generating and / or code for generating as described with reference to FIG. 14.
[0140] In some aspects, the plurality of CBs comprise at least one CB group (CBG); and the plurality of CBs are transmitted to the UE subject to at least a second constraint that each CBG is constrained to single OFDM symbol.
[0141] In some aspects, the at least the first constraint is satisfied via a restriction that a number of CBs to be transmitted in a number of physical downlink shared channel (PDSCH) symbols be an integer multiple of the number of PDSCH symbols.
[0142] In some aspects, the method 1300 further includes receiving per-symbol acknowledgment feedback indicating whether one or more CBs in a corresponding OFDM symbol were successfully received. In some cases, the operations of this step referto, or may be performed by, circuitry for receiving and / or code for receiving as described with reference to FIG. 14.
[0143] In one aspect, method 1300, or any aspect related to it, may be performed by an apparatus, such as communications device 1400 of FIG. 14, which includes various components operable, configured, or adapted to perform the method 1300. Communications device 1400 is described below in further detail.
[0144] Note that FIG. 13 is just one example of a method, and other methods including fewer, additional, or alternative steps are possible consistent with this disclosure.Example Communications Device(s)
[0145] FIG. 14 depicts aspects of an example communications device 1400. In some aspects, communications device 1400 is a user equipment, such as UE 104 described above with respect to FIGS. 1 and 3. In some aspects, communications device 1400 is a network entity, such as BS 102 of FIGS. 1 and 3, or a disaggregated base station as discussed with respect to FIG. 2.
[0146] The communications device 1400 includes a processing system 1405 coupled to the transceiver 1465 (e.g., a transmitter and / or a receiver). In some aspects (e.g., when communications device 1400 is a network entity), processing system 1405 may be coupled to a network interface 1475 that is configured to obtain and send signals for the communications device 1400 via communication link(s), such as a backhaul link, midhaul link, and / or fronthaul link as described herein, such as with respect to FIG. 2. The transceiver 1465 is configured to transmit and receive signals for the communications device 1400 via the antenna 1470, such as the various signals as described herein. The processing system 1405 may be configured to perform processing functions for the communications device 1400, including processing signals received and / or to be transmitted by the communications device 1400.
[0147] The processing system 1405 includes one or more processors 1410. In various aspects, the one or more processors 1410 may be representative of one or more of receive processor 358, transmit processor 364, TX MIMO processor 366, and / or controller / processor 380, as described with respect to FIG. 3. In various aspects, one or more processors 1410 may be representative of one or more of receive processor 338,transmit processor 320, TX MIMO processor 330, and / or controller / processor 340, as described with respect to FIG. 3. The one or more processors 1410 are coupled to a computer-readable medium / memory 1435 via a bus 1460. In certain aspects, the computer-readable medium / memory 1435 is configured to store instructions (e.g., computer-executable code) that when executed by the one or more processors 1410, cause the one or more processors 1410 to perform the method 1200 described with respect to FIG. 12, or any aspect related to it; and the method 1300 described with respect to FIG. 13, or any aspect related to it. Note that reference to a processor performing a function of communications device 1400 may include one or more processors 1410 performing that function of communications device 1400.
[0148] In the depicted example, computer-readable medium / memory 1435 stores code (e.g., executable instructions), such as code for transmitting 1440, code for receiving 1445, code for decoding 1450, and code for generating 1455. Processing of the code for transmitting 1440, code for receiving 1445, code for decoding 1450, and code for generating 1455 may cause the communications device 1400 to perform the method 1200 described with respect to FIG. 12, or any aspect related to it; and the method 1300 described with respect to FIG. 13, or any aspect related to it.
[0149] The one or more processors 1410 include circuitry configured to implement (e.g., execute) the code stored in the computer-readable medium / memory 1435, including circuitry for transmitting 1415, circuitry for receiving 1420, circuitry for decoding 1425, and circuitry for generating 1430. Processing with circuitry for transmitting 1415, circuitry for receiving 1420, circuitry for decoding 1425, and circuitry for generating 1430 may cause the communications device 1400 to perform the method 1200 described with respect to FIG. 12, or any aspect related to it; and the method 1300 described with respect to FIG. 13, or any aspect related to it.
[0150] Various components of the communications device 1400 may provide means for performing the method 1200 described with respect to FIG. 12, or any aspect related to it; and the method 1300 described with respect to FIG. 13, or any aspect related to it. For example, means for transmitting, sending or outputting for transmission may include transceivers 354 and / or antenna(s) 352 of the UE 104 illustrated in FIG. 3, transceivers 332 and / or antenna(s) 334 of the BS 102 illustrated in FIG. 3, and / or the transceiver 1465 and the antenna 1470 of the communications device 1400 in FIG. 14. Means for receivingor obtaining may include transceivers 354 and / or antenna(s) 352 of the UE 104 illustrated in FIG. 3, transceivers 332 and / or antenna(s) 334 of the BS 102 illustrated in FIG. 3, and / or the transceiver 1465 and the antenna 1470 of the communications device 1400 in FIG. 14Example Clauses
[0151] Implementation examples are described in the following numbered clauses:
[0152] Clause 1 : A method for wireless communications by a user equipment (UE), comprising: transmitting, to a network entity, signaling indicating a user equipment (UE) supports data aided channel estimation; receiving, after transmitting the signaling, a plurality of code blocks (CBs) from the network in one or more orthogonal frequency division multiplexed (OFDM) symbols; and decoding the CBs using an iterative process performed on each OFDM symbol, wherein the iterative process involves data aided channel estimation and each iteration of the process involves demodulation and decoding.
[0153] Clause 2: The method of Clause 1, wherein the signaling comprises at least one of a medium access control (MAC) control element (CE) or uplink control information (UCI).
[0154] Clause 3 : The method of any one of Clauses 1-2, further comprising receiving, after transmitting the signaling, an indication that the network entity will send CBs to the UE subject to at least a first constraint that each CB is constrained to single orthogonal frequency division multiplexed (OFDM) symbol.
[0155] Clause 4: The method of Clause 3, wherein: the plurality of CBs comprise at least one CB group (CBG); and the plurality of CBs are transmitted to the UE subject to at least a second constraint that each CBG is constrained to single OFDM symbol.
[0156] Clause 5: The method of Clause 3, wherein the indication is received via at least one of a medium access control (MAC) control element (CE) or downlink control information (DCI).
[0157] Clause 6: The method of any one of Clauses 1-5, wherein the decoding involves a low density parity check (LDPC) decoder.
[0158] Clause 7: The method of any one of Clauses 1-6, further comprising transmitting per-symbol acknowledgment feedback indicating whether one or more CBs in a corresponding OFDM symbol were successfully received.
[0159] Clause 8: The method of any one of Clauses 1-7, wherein the data aided channel estimation involves using demodulated data from one OFDM symbol as pilots for channel estimation to aid in processing a subsequent OFDM symbol.
[0160] Clause 9: A method for wireless communications by a network entity, comprising: receiving signaling indicating a user equipment (UE) supports data aided channel estimation; and transmitting, after receiving the signaling, a plurality of code blocks (CBs) to the UE in one or more orthogonal frequency division multiplexed (OFDM) symbols subject to at least a first constraint that each CB is constrained to single orthogonal frequency division multiplexed (OFDM) symbol.
[0161] Clause 10: The method of Clause 9, wherein the signaling comprises at least one of a medium access control (MAC) control element (CE) or uplink control information (UCI).
[0162] Clause 11 : The method of any one of Clauses 9-10, further comprising transmitting, after receiving the signaling, an indication that the network entity will send CBs to the UE subject to at least the first constraint.
[0163] Clause 12: The method of Clause 11, wherein the indication is transmitted via at least one of a medium access control (MAC) control element (CE) or downlink control information (DCI).
[0164] Clause 13: The method of any one of Clauses 9-12, further comprising generating the plurality of CBs using a low density parity check (LDPC) encoder.
[0165] Clause 14: The method of any one of Clauses 9-13, wherein: the plurality of CBs comprise at least one CB group (CBG); and the plurality of CBs are transmitted to the UE subject to at least a second constraint that each CBG is constrained to single OFDM symbol.
[0166] Clause 15: The method of any one of Clauses 9-14, wherein the at least the first constraint is satisfied via a restriction that a number of CBs to be transmitted in a number of physical downlink shared channel (PDSCH) symbols be an integer multiple of the number of PDSCH symbols.
[0167] Clause 16: The method of any one of Clauses 9-15, further comprising receiving per-symbol acknowledgment feedback indicating whether one or more CBs in a corresponding OFDM symbol were successfully received.
[0168] Clause 17: An apparatus, comprising: at least one memory comprising executable instructions; and at least one processor configured to execute the executable instructions and cause the apparatus to perform a method in accordance with any one of Clauses 1-16.
[0169] Clause 18: An apparatus, comprising means for performing a method in accordance with any one of Clauses 1-16.
[0170] Clause 19: A non-transitory computer-readable medium comprising executable instructions that, when executed by at least one processor of an apparatus, cause the apparatus to perform a method in accordance with any one of Clauses 1-16.
[0171] Clause 20: A computer program product embodied on a computer-readable storage medium comprising code for performing a method in accordance with any one of Clauses 1-16.Additional Considerations
[0172] The preceding description is provided to enable any person skilled in the art to practice the various aspects described herein. The examples discussed herein are not limiting of the scope, applicability, or aspects set forth in the claims. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other aspects. For example, changes may be made in the function and arrangement of elements discussed without departing from the scope of the disclosure. Various examples may omit, substitute, or add various procedures or components as appropriate. For instance, the methods described may be performed in an order different from that described, and various actions may be added, omitted, or combined. Also, features described with respect to some examples may be combined in some other examples. For example, an apparatus may be implemented or a method may be practiced using any number of the aspects set forth herein. In addition, the scope of the disclosure is intended to cover such an apparatus or method that is practiced using other structure, functionality, or structure and functionality in addition to, or other than, the various aspects of the disclosure set forth herein. It should be understoodthat any aspect of the disclosure disclosed herein may be embodied by one or more elements of a claim.
[0173] The various illustrative logical blocks, modules and circuits described in connection with the present disclosure may be implemented or performed with a general purpose processor, a graphics processing unit (GPU), a neural processing unit (NPU), a digital signal processor (DSP), an ASIC, a field programmable gate array (FPGA) or other programmable logic device (PLD), discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any commercially available processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, a system on a chip (SoC), or any other such configuration.
[0174] As used herein, “a processor,” “at least one processor” or “one or more processors” generally refers to a single processor configured to perform one or multiple operations or multiple processors configured to collectively perform one or more operations. In the case of multiple processors, performance of the one or more operations could be divided amongst different processors, though one processor may perform multiple operations, and multiple processors could collectively perform a single operation. Similarly, “a memory,” “at least one memory” or “one or more memories” generally refers to a single memory configured to store data and / or instructions, multiple memories configured to collectively store data and / or instructions.
[0175] Means for transmitting, means for receiving, means for decoding, and means for generating may comprise one or more processors, such as one or more of the processors described above with reference to FIG. 14.
[0176] 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 (e.g., 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).
[0177] As used herein, the term “determining” encompasses a wide variety of actions. For example, “determining” may include calculating, computing, processing, deriving, investigating, looking up (e.g., looking up in a table, a database or another data structure), ascertaining and the like. Also, “determining” may include receiving (e.g., receiving information), accessing (e.g., accessing data in a memory) and the like. Also, “determining” may include resolving, selecting, choosing, establishing and the like.
[0178] The methods disclosed herein comprise one or more actions for achieving the methods. The method actions may be interchanged with one another without departing from the scope of the claims. In other words, unless a specific order of actions is specified, the order and / or use of specific actions may be modified without departing from the scope of the claims. Further, the various operations of methods described above may be performed by any suitable means capable of performing the corresponding functions. The means may include various hardware and / or software component(s) and / or module(s), including, but not limited to a circuit, an application specific integrated circuit (ASIC), or processor. 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, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.
[0179] The following claims are not intended to be limited to the aspects shown herein, but are to be accorded the full scope consistent with the language of the claims. Within a claim, reference to an element in the singular is not intended to mean “one and only one” unless specifically so stated, but rather “one or more.” Unless specifically stated otherwise, the term “some” refers to one or more. No claim element is to be construed under the provisions of 35 U.S.C. §112(f) unless the element is expressly recited using the phrase “means for”. All structural and functional equivalents to the elements of the various aspects described throughout this disclosure that are known or later come to be known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the claims. Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the claims.
Claims
WHAT IS CLAIMED IS:
1. An apparatus for wireless communication at a user equipment (UE), comprising: at least one memory comprising computer-executable instructions; and one or more processors configured to execute the computer-executable instructions and cause the UE to: transmit, to a network entity, signaling indicating the UE supports data aided channel estimation; receive, after transmitting the signaling, a plurality of code blocks (CBs) from the network entity in one or more orthogonal frequency division multiplexed (OFDM) symbols; and decode the plurality of CBs using an iterative process performed on each OFDM symbol, wherein the iterative process involves data aided channel estimation and each iteration of the process involves demodulation and decoding.
2. The apparatus of claim 1, wherein the signaling comprises at least one of a medium access control (MAC) control element (CE) or uplink control information (UCI).
3. The apparatus of claim 1, wherein the one or more processors are further configured to execute the computer-executable instructions and cause the UE to receive, after transmitting the signaling, an indication that the network entity will send CBs to the UE subject to at least a first constraint that each CB is constrained to single orthogonal frequency division multiplexed (OFDM) symbol.
4. The apparatus of claim 3, wherein: the plurality of CBs comprise at least one CB group (CBG); and the plurality of CBs are transmitted to the UE subject to at least a second constraint that each CBG is constrained to single OFDM symbol.
5. The apparatus of claim 3, wherein the indication is received via at least one of a medium access control (MAC) control element (CE) or downlink control information (DCI).
6. The apparatus of claim 1, wherein the decoding involves a low density parity check (LDPC) decoder.
7. The apparatus of claim 1, wherein the one or more processors are further configured to execute the computer-executable instructions and cause the UE to transmit per-symbol acknowledgment feedback indicating whether one or more CBs in a corresponding OFDM symbol were successfully received.
8. The apparatus of claim 1, wherein the data aided channel estimation involves using demodulated data from one OFDM symbol as pilots for channel estimation to aid in processing a subsequent OFDM symbol.
9. An apparatus for wireless communication at a network entity, comprising: at least one memory comprising computer-executable instructions; and one or more processors configured to execute the computer-executable instructions and cause the network entity to: receive signaling indicating a user equipment (UE) supports data aided channel estimation; and transmit, after receiving the signaling, a plurality of code blocks (CBs) to the UE in one or more orthogonal frequency division multiplexed (OFDM) symbols subject to at least a first constraint that each CB is constrained to single orthogonal frequency division multiplexed (OFDM) symbol.
10. The apparatus of claim 9, wherein the signaling comprises at least one of a medium access control (MAC) control element (CE) or uplink control information (UCI).
11. The apparatus of claim 9, wherein the one or more processors are further configured to execute the computer-executable instructions and cause the network entity to transmit, after receiving the signaling, an indication that the network entity will send CBs to the UE subject to at least the first constraint.
12. The apparatus of claim 11, wherein the indication is transmitted via at least one of a medium access control (MAC) control element (CE) or downlink control information (DCI).
13. The apparatus of claim 9, wherein the one or more processors are further configured to execute the computer-executable instructions and cause the network entity to generate the plurality of CBs using a low density parity check (LDPC) encoder.
14. The apparatus of claim 9, wherein: the plurality of CBs comprise at least one CB group (CBG); and the plurality of CBs are transmitted to the UE subject to at least a second constraint that each CBG is constrained to single OFDM symbol.
15. The apparatus of claim 9, wherein the at least the first constraint is satisfied via a restriction that a number of CBs to be transmitted in a number of physical downlink shared channel (PDSCH) symbols be an integer multiple of a number of PDSCH symbols.
16. The apparatus of claim 9, wherein the one or more processors are further configured to execute the computer-executable instructions and cause the network entity to receive per-symbol acknowledgment feedback indicating whether one or more CBs in a corresponding OFDM symbol were successfully received.
17. A method for wireless communications by a user equipment (UE), comprising: transmitting, to a network entity, signaling indicating a user equipment (UE) supports data aided channel estimation; receiving, after transmitting the signaling, a plurality of code blocks (CBs) from the network in one or more orthogonal frequency division multiplexed (OFDM) symbols; and decoding the plurality of CBs using an iterative process performed on each OFDM symbol, wherein the iterative process involves data aided channel estimation and each iteration of the process involves demodulation and decoding.
18. The method of claim 17, wherein the signaling comprises at least one of a medium access control (MAC) control element (CE) or uplink control information (UCI).
19. The method of claim 17, further comprising receiving, after transmitting the signaling, an indication that the network entity will send CBs to the UE subject to at least a first constraint that each CB is constrained to single orthogonal frequency division multiplexed (OFDM) symbol.
20. The method of claim 19, wherein: the plurality of CBs comprise at least one CB group (CBG); and the plurality of CBs are transmitted to the UE subject to at least a second constraint that each CBG is constrained to single OFDM symbol.
Citation Information
Patent Citations
Constraint-based code block interleaver for data aided receivers
US20210266101A1
Cited By
Phase compensation method, electronic device, storage medium and program product
CN121509168A
Phase compensation method, electronic device, storage medium, and program product
CN121509168B