WO2021195821A1

WO2021195821A1 - Communication configurations for low density parity check (ldpc) coding

Info

Publication number: WO2021195821A1
Application number: PCT/CN2020/081979
Authority: WO
Inventors: Changlong Xu; Jing Sun; Xiaoxia Zhang; Yisheng Xue; Chih-Hao Liu
Original assignee: Qualcomm Incorporated
Priority date: 2020-03-30
Filing date: 2020-03-30
Publication date: 2021-10-07

Abstract

Aspects relate to mechanisms for using a low density parity check (LDPC) base graph. In some examples, a device (e.g., a base station) may ensure that only a particular LDPC base graph is selected for LDPC coding used for communication with another device. For example, to support devices with low data requirements and/or low cost devices such as wearable devices and/or Internet of Things (IoT) devices, LDPC coding for data transmitted to and/or from such devices may be restricted to use LDPC base graph 2 (BG2). Other mechanisms are also provided to enable the use of a smaller buffer at a device.

Description

COMMUNICATION CONFIGURATIONS FOR LOW DENSITY PARITY CHECK (LDPC) CODING

TECHNICAL FIELD

The technology discussed below relates generally to wireless communication, and more particularly but not exclusively, to selecting communication configurations for LDPC coding.

INTRODUCTION

Block codes, or error correcting codes are frequently used to provide reliable transmission of digital messages over noisy channels. In a typical block code, an information message or sequence is split up into blocks, and an encoder at the transmitting device then mathematically adds redundancy to the information message. Exploitation of this redundancy in the encoded information message is the key to reliability of the message, enabling correction for any bit errors that may occur due to noise. That is, a decoder at the receiving device can take advantage of the redundancy to reliably recover the information message even though bit errors may occur, in part, due to the addition of noise to the channel.

Many examples of such error correcting block codes are known to those of ordinary skill in the art, including Hamming codes, Bose-Chaudhuri-Hocquenghem (BCH) codes, turbo codes, and low-density parity check (LDPC) codes, among others. Many existing wireless communication networks utilize such block codes, such as 3GPP LTE networks, which utilize turbo codes; and IEEE 802.11n Wi-Fi networks, which utilize LDPC codes.

For networks, such as fifth generation (5G) New Radio networks, LDPC codes may continue to be implemented to support a wide range of information block lengths and a wide range of coding rates. In order to achieve desired communication performance, additional enhancements of LDPC codes are desired.

BRIEF SUMMARY OF SOME EXAMPLES

The following presents a summary of one or more aspects of the present disclosure, in order to provide a basic understanding of such aspects. This summary is not an extensive overview of all contemplated features of the disclosure, and is intended neither to identify key or critical elements of all aspects of the disclosure nor to delineate the scope of any or all aspects of the disclosure. Its sole purpose is to present some concepts of one or more aspects of the disclosure in a form as a prelude to the more detailed description that is presented later.

The disclosure relates in some aspects to selecting a low density parity check (LDPC) base graph (e.g., in a wireless communication network) for LDPC coding. In some examples, a device (e.g., a base station) may ensure that only a particular LDPC base graph is selected for LDPC coding used for communication with another device. For example, to support devices with low data requirements and/or low cost devices such as wearable devices and/or Internet of Things (IoT) devices, LDPC coding for data transmitted to and/or from such devices may be restricted to use LDPC base graph 2 (BG2) . In some examples, this may enable these devices to consume less power and/or be made at a lower cost. For example, a device that does not need to support LDPC base graph 1 (BG1) may use a smaller buffer, thereby decreasing the power consumption and/or the cost of the device.

The disclosure relates in some aspects to different mechanisms for ensuring that a particular LDPC base graph is selected for LDPC coding (e.g., encoding and/or decoding) . In some examples, a device selects at least one communication parameter (e.g., coding rate and/or payload size) to ensure that an LDPC base graph selection process selects the desired LDPC base graph. In some examples, a device selects a particular code block segmentation algorithm that uses the desired LDPC base graph.

The disclosure relates in some aspects to mechanisms for enabling a device to use a smaller buffer. In some examples, a higher minimum coding rate is specified to reduce buffer size. In some examples, a lower maximum number of hybrid automatic repeat request (HARQ) processes is specified to reduce buffer size. In some examples, a transport block size is restricted to be less than or equal to a code clock size to reduce buffer size.

In some examples, communication by a base station may include identifying a data block size limit associated with a first wireless communication device and, after identifying the data block size limit associated with the first wireless communication device, selecting at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation. Here, the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device. In addition, the communication may include communicating with the first wireless communication device using the at least one communication parameter.

In some examples, communication by a base station may include identifying a data block size limit associated with a first wireless communication device and, after identifying the data block size limit associated with the first wireless communication device, selecting a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph. Here, the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device. In addition, the communication may include communicating with the first wireless communication device using the code block segmentation algorithm.

In some examples, communication by a base station may include identifying a data block size limit associated with a first wireless communication device and, after identifying the data block size limit associated with the first wireless communication device, selecting a first coding rate that is greater than or equal to a first minimum coding rate value. Here, the first minimum coding rate value may be greater than a second minimum coding rate value used by the base station for communication with a second wireless communication device. In addition, the communication may include communicating with the first wireless communication device using the first coding rate.

In some examples, communication by a base station may include identifying a data block size limit associated with a first wireless communication device and, after identifying the data block size limit associated with the first wireless communication device, selecting a first number of hybrid automatic repeat request (HARQ) processes that is less than or equal to a first maximum number of HARQ processes. Here, the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for communication with a second wireless communication device. In addition, the communication may include communicating with the first wireless communication device using the first number of HARQ processes.

In some examples, communication by a base station may include identifying a data block size limit associated with a first wireless communication device and, after identifying the data block size limit associated with the first wireless communication device, selecting a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first low density parity check (LDPC) base graph. Here, the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device. In addition, the communication may include communicating with the first wireless communication device using the transport block size.

These and other aspects of the disclosure will become more fully understood upon a review of the detailed description, which follows. Other aspects, features, and embodiments of the present disclosure will become apparent to those of ordinary skill in the art, upon reviewing the following description of specific, example embodiments of the present disclosure in conjunction with the accompanying figures. While features of the present disclosure may be discussed relative to certain embodiments and figures below, all embodiments of the present disclosure can include one or more of the advantageous features discussed herein. In other words, while one or more embodiments may be discussed as having certain advantageous features, one or more of such features may also be used in accordance with the various embodiments of the disclosure discussed herein. In similar fashion, while example embodiments may be discussed below as device, system, or method embodiments it should be understood that such example embodiments can be implemented in various devices, systems, and methods.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic illustration of a wireless communication system according to some aspects.

FIG. 2 is a conceptual illustration of an example of a radio access network according to some aspects.

FIG. 3 is a schematic illustration of wireless communication utilizing block codes according to some aspects.

FIG. 4 illustrates an example of a low density parity check (LDPC) matrix according to some aspects.

FIG. 5 illustrates an example of a LDPC base graph according to some aspects.

FIG. 6 illustrates an example of target uses for two LDPC base graphs according to some aspects.

FIG. 7 illustrates an example of selection of a single LDPC base graph according to some aspects.

FIG. 8 illustrates an example of a segmentation restriction based on a single LDPC base graph according to some aspects.

FIG. 9 is a diagram illustrating an example of a hardware implementation for a wireless communication device employing a processing system according to some aspects.

FIG. 10 is a flow chart of an example method of wireless communication based on a single LDPC case graph according to some aspects.

FIG. 11 is a flow chart of another example method of wireless communication based on a single LDPC case graph according to some aspects.

FIG. 12 is a flow chart of an example method of wireless communication based on a minimum coding rate according to some aspects.

FIG. 13 is a flow chart of another example method of wireless communication based on a maximum number of HARQ processes according to some aspects.

FIG. 14 is a flow chart of another example method of wireless communication based on a limited block size according to some aspects.

DETAILED DESCRIPTION

The detailed description set forth below in connection with the appended drawings is intended as a description of various configurations and is not intended to represent the only configurations in which the concepts described herein may be practiced. The detailed description includes specific details for the purpose of providing a thorough understanding of various concepts. However, it will be apparent to those skilled in the art that these concepts may be practiced without these specific details. In some instances, well known structures and components are shown in block diagram form in order to avoid obscuring such concepts.

Various aspects of the disclosure relate to mechanisms for code block segmentation in a wireless communication network. In some examples, the wireless communication network may be a sidelink network. In some examples, a wireless communication device may reserve resources on a carrier for transmission of a transport block. The reserved resources may span two or more consecutive or non-consecutive slots. The wireless communication device may select code block parameters for segmenting the transport block into a plurality of encoded code blocks such that each encoded code bock is fully contained within a single slot. In some examples, the code block parameters may include a number of encoded code blocks and a respective size of each of the encoded code blocks. Based on the code block parameters, the wireless communication device may segment the transport block into code blocks and encode the code blocks to produce the plurality of encoded code blocks.

In some examples, the code block parameters may be selected based on the transport block size (TBS) of the transport block and resource parameters associated with the resources reserved for communication of the transport block. For example, the resource parameters may indicate the number of slots included in the reserved resources, along with the number of available symbols or available resource elements (REs) within each slot. In an example, the code block parameters may be selected based the number of bits of the transport block that may be included in each slot. For example, the number of bits of the transport block to include in each slot may be calculated based on the coding rate, modulation order and number of resource elements available within the slot. In this example, the size and number of encoded code blocks in each slot may be the same or different. As another example, the number of bits of the transport block to include in each slot may be calculated based on the TBS and the number of slots. In this example, the size and number of encoded code blocks in each slot are the same. In either of the above examples, the respective sizes of the encoded code blocks within the same slot are the same.

In some examples, the receiving wireless communication device may generate and transmit acknowledgement information (e.g., acknowledgement or negative acknowledgement) for each encoded code block or for each slot. In examples in which the acknowledgement information is generated for each encoded code block, the transmitting wireless communication device may retransmit those encoded code blocks for which a negative acknowledgement is received. In examples in which the acknowledgement information is generated for each slot, the transmitting wireless communication device may retransmit all of the encoded code blocks within each slot for which a negative acknowledgement is received.

While aspects and embodiments are described in this application by illustration to some examples, those skilled in the art will understand that additional implementations and use cases may come about in many different arrangements and scenarios. Innovations described herein may be implemented across many differing platform types, devices, systems, shapes, sizes, packaging arrangements. For example, embodiments and/or uses may come about via integrated chip embodiments and other non-module-component based devices (e.g., end-user devices, vehicles, communication devices, computing devices, industrial equipment, retail/purchasing devices, medical devices, AI-enabled devices, etc. ) . While some examples may or may not be specifically directed to use cases or applications, a wide assortment of applicability of described innovations may occur. Implementations may range a spectrum from chip-level or modular components to non-modular, non-chip-level implementations and further to aggregate, distributed, or OEM devices or systems incorporating one or more aspects of the described innovations. In some practical settings, devices incorporating described aspects and features may also necessarily include additional components and features for implementation and practice of claimed and described embodiments. For example, transmission and reception of wireless signals necessarily includes a number of components for analog and digital purposes (e.g., hardware components including antenna, RF-chains, power amplifiers, modulators, buffer, processor (s) , interleaver, adders/summers, etc. ) . It is intended that innovations described herein may be practiced in a wide variety of devices, chip-level components, systems, distributed arrangements, end-user devices, etc. of varying sizes, shapes and constitution.

The various concepts presented throughout this disclosure may be implemented across a broad variety of telecommunication systems, network architectures, and communication standards. Referring now to FIG. 1, as an illustrative example without limitation, various aspects of the present disclosure are illustrated with reference to a wireless communication system 100. The wireless communication system 100 includes three interacting domains: a core network 102, a radio access network (RAN) 104, and a user equipment (UE) 106. By virtue of the wireless communication system 100, the UE 106 may be enabled to carry out data communication with an external data network 110, such as (but not limited to) the Internet.

The RAN 104 may implement any suitable radio access technology (RAT) or RATs to provide radio access to the UE 106. As one example, the RAN 104 may operate according to 3rd Generation Partnership Project (3GPP) New Radio (NR) specifications, often referred to as 5G. As another example, the RAN 104 may operate under a hybrid of 5G NR and Evolved Universal Terrestrial Radio Access Network (eUTRAN) standards, often referred to as LTE. The 3GPP refers to this hybrid RAN as a next-generation RAN, or NG-RAN. In another example, the RAN 104 may operate according to both the LTE and 5G NR standards. Of course, many other examples may be utilized within the scope of the present disclosure.

As illustrated, the RAN 104 includes a plurality of base stations 108. Broadly, a base station is a network element in a radio access network responsible for radio transmission and reception in one or more cells to or from a UE. In different technologies, standards, or contexts, a base station may variously be referred to by those skilled in the art as a base transceiver station (BTS) , a radio base station, a radio transceiver, a transceiver function, a basic service set (BSS) , an extended service set (ESS) , an access point (AP) , a Node B (NB) , an eNode B (eNB) , a gNode B (gNB) , or some other suitable terminology. In examples where the RAN 104 operates according to both the LTE and 5G NR standards, one of the base stations 108 may be an LTE base station, while another base station may be a 5G NR base station.

The radio access network 104 is further illustrated supporting wireless communication for multiple mobile apparatuses. A mobile apparatus may be referred to as user equipment (UE) 106 in 3GPP standards, but may also be referred to by those skilled in the art as a mobile station (MS) , a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a mobile device, a wireless device, a wireless communications device, a remote device, a mobile subscriber station, an access terminal (AT) , a mobile terminal, a wireless terminal, a remote terminal, a handset, a terminal, a user agent, a mobile client, a client, or some other suitable terminology. A UE 106 may be an apparatus that provides a user with access to network services. In examples where the RAN 104 operates according to both the LTE and 5G NR standards, the UE 106 may be an Evolved-Universal Terrestrial Radio Access Network –New Radio dual connectivity (EN-DC) UE that is capable of simultaneously connecting to an LTE base station and a NR base station to receive data packets from both the LTE base station and the NR base station.

Within the present document, a “mobile” apparatus need not necessarily have a capability to move, and may be stationary. The term mobile apparatus or mobile device broadly refers to a diverse array of devices and technologies. UEs may include a number of hardware structural components sized, shaped, and arranged to help in communication; such components can include antennas, antenna arrays, RF chains, amplifiers, one or more processors, etc. electrically coupled to each other. For example, some non-limiting examples of a mobile apparatus include a mobile, a cellular (cell) phone, a smart phone, a session initiation protocol (SIP) phone, a laptop, a personal computer (PC) , a notebook, a netbook, a smartbook, a tablet, a personal digital assistant (PDA) , and a broad array of embedded systems, e.g., corresponding to an “Internet of Things” (IoT) . A mobile apparatus may additionally be an automotive or other transportation vehicle, a remote sensor or actuator, a robot or robotics device, a satellite radio, a global positioning system (GPS) device, an object tracking device, a drone, a multi-copter, a quad-copter, a remote control device, a consumer and/or wearable device, such as eyewear, a wearable camera, a virtual reality device, a smart watch, a health or fitness tracker, a digital audio player (e.g., MP3 player) , a camera, a game console, etc. A mobile apparatus may additionally be a digital home or smart home device such as a home audio, video, and/or multimedia device, an appliance, a vending machine, intelligent lighting, a home security system, a smart meter, etc. A mobile apparatus may additionally be a smart energy device, a security device, a solar panel or solar array, a municipal infrastructure device controlling electric power (e.g., a smart grid) , lighting, water, etc. ; an industrial automation and enterprise device; a logistics controller; agricultural equipment; military defense equipment, vehicles, aircraft, ships, and weaponry, etc. Still further, a mobile apparatus may provide for connected medicine or telemedicine support, i. e., health care at a distance. Telehealth devices may include telehealth monitoring devices and telehealth administration devices, whose communication may be given preferential treatment or prioritized access over other types of information, e.g., in terms of prioritized access for transport of critical service data, and/or relevant QoS for transport of critical service data.

Wireless communication between a RAN 104 and a UE 106 may be described as utilizing an air interface. Transmissions over the air interface from a base station (e.g., base station 108) to one or more UEs (e.g., UE 106) may be referred to as downlink (DL) transmission. In accordance with certain aspects of the present disclosure, the term downlink may refer to a point-to-multipoint transmission originating at a scheduling entity (described further below; e.g., base station 108) . Another way to describe this scheme may be to use the term broadcast channel multiplexing. Transmissions from a UE (e.g., UE 106) to a base station (e.g., base station 108) may be referred to as uplink (UL) transmissions. In accordance with further aspects of the present disclosure, the term uplink may refer to a point-to-point transmission originating at a scheduled entity (described further below; e.g., UE 106) .

In some examples, access to the air interface may be scheduled, wherein a scheduling entity (e.g., a base station 108) allocates resources for communication among some or all devices and equipment within its service area or cell. Within the present disclosure, as discussed further below, the scheduling entity may be responsible for scheduling, assigning, reconfiguring, and releasing resources for one or more scheduled entities. That is, for scheduled communication, UEs 106, which may be scheduled entities, may utilize resources allocated by the scheduling entity 108.

Base stations 108 are not the only entities that may function as scheduling entities. That is, in some examples, a UE may function as a scheduling entity, scheduling resources for one or more scheduled entities (e.g., one or more other UEs) .

As illustrated in FIG. 1, a scheduling entity 108 may broadcast downlink traffic 112 to one or more scheduled entities 106. Broadly, the scheduling entity 108 is a node or device responsible for scheduling traffic in a wireless communication network, including the downlink traffic 112 and, in some examples, uplink traffic 116 from one or more scheduled entities 106 to the scheduling entity 108. On the other hand, the scheduled entity 106 is a node or device that receives downlink control information 114, including but not limited to scheduling information (e.g., a grant) , synchronization or timing information, or other control information from another entity in the wireless communication network such as the scheduling entity 108.

In addition, the uplink and/or downlink control information and/or traffic information may be time-divided into frames, subframes, slots, and/or symbols. As used herein, a symbol may refer to a unit of time that, in an orthogonal frequency division multiplexed (OFDM) waveform, carries one resource element (RE) per sub-carrier. A slot may carry 7 or 14 OFDM symbols. A subframe may refer to a duration of 1ms. Multiple subframes or slots may be grouped together to form a single frame or radio frame. Of course, these definitions are not required, and any suitable scheme for organizing waveforms may be utilized, and various time divisions of the waveform may have any suitable duration.

In general, base stations 108 may include a backhaul interface for communication with a backhaul portion 120 of the wireless communication system. The backhaul 120 may provide a link between a base station 108 and the core network 102. Further, in some examples, a backhaul network may provide interconnection between the respective base stations 108. Various types of backhaul interfaces may be employed, such as a direct physical connection, a virtual network, or the like using any suitable transport network.

The core network 102 may be a part of the wireless communication system 100, and may be independent of the radio access technology used in the RAN 104. In some examples, the core network 102 may be configured according to 5G standards (e.g., 5GC) . In other examples, the core network 102 may be configured according to a 4G evolved packet core (EPC) , or any other suitable standard or configuration.

Referring now to FIG. 2, by way of example and without limitation, a schematic illustration of a RAN 200 is provided. In some examples, the RAN 200 may be the same as the RAN 104 described above and illustrated in FIG. 1. The geographic area covered by the RAN 200 may be divided into cellular regions (cells) that can be uniquely identified by a user equipment (UE) based on an identification broadcasted from one access point or base station. FIG. 2 illustrates

macrocells

202, 204, and 206, and a small cell 208, each of which may include one or more sectors (not shown) . A sector is a sub-area of a cell. All sectors within one cell are served by the same base station. A radio link within a sector can be identified by a single logical identification belonging to that sector. In a cell that is divided into sectors, the multiple sectors within a cell can be formed by groups of antennas with each antenna responsible for communication with UEs in a portion of the cell.

In FIG. 2, two base stations 210 and 212 are shown in

cells

202 and 204; and a third base station 214 is shown controlling a remote radio head (RRH) 216 in cell 206. That is, a base station can have an integrated antenna or can be connected to an antenna or RRH by feeder cables. In the illustrated example, the

cells

202, 204, and 126 may be referred to as macrocells, as the

base stations

210, 212, and 214 support cells having a large size. Further, a base station 218 is shown in the small cell 208 (e.g., a microcell, picocell, femtocell, home base station, home Node B, home eNode B, etc. ) which may overlap with one or more macrocells. In this example, the cell 208 may be referred to as a small cell, as the base station 218 supports a cell having a relatively small size. Cell sizing can be done according to system design as well as component constraints.

It is to be understood that the radio access network 200 may include any number of wireless base stations and cells. Further, a relay node may be deployed to extend the size or coverage area of a given cell. The

base stations

210, 212, 214, 218 provide wireless access points to a core network for any number of mobile apparatuses. In some examples, the

base stations

210, 212, 214, and/or 218 may be the same as the base station/scheduling entity 108 described above and illustrated in FIG. 1.

Within the RAN 200, the cells may include UEs that may be in communication with one or more sectors of each cell. Further, each

base station

210, 212, 214, and 218 may be configured to provide an access point to a core network 102 (see FIG. 1) for all the UEs in the respective cells. For example,

UEs

222 and 224 may be in communication with base station 210;

UEs

226 and 228 may be in communication with base station 212;

UEs

230 and 232 may be in communication with base station 214 by way of RRH 216; and UE 234 may be in communication with base station 218. In some examples, the

UEs

222, 224, 226, 228, 230, 232, 234, 238, 240, and/or 242 may be the same as the UE/scheduled entity 106 described above and illustrated in FIG. 1.

In some examples, an unmanned aerial vehicle (UAV) 220, which may be a drone or quadcopter, can be a mobile network node and may be configured to function as a UE. For example, the UAV 220 may operate within cell 202 by communicating with base station 210.

In a further aspect of the RAN 200, sidelink signals may be used between UEs without necessarily relying on scheduling or control information from a base station. For example, two or more UEs (e.g., UEs 226 and 228) may communicate with each other using peer to peer (P2P) or sidelink signals 227 without relaying that communication through a base station (e.g., base station 212) . In a further example, UE 238 is illustrated communicating with

UEs

240 and 242. Here, the UE 238 may function as a scheduling entity or a primary sidelink device, and

UEs

240 and 242 may function as a scheduled entity or a non-primary (e.g., secondary) sidelink device. In still another example, a UE may function as a scheduling entity in a device-to-device (D2D) , peer-to-peer (P2P) , or vehicle-to-vehicle (V2V) network, and/or in a mesh network. In a mesh network example,

UEs

240 and 242 may optionally communicate directly with one another in addition to communicating with the UE 238 (e.g., a scheduling entity) . Thus, in a wireless communication system with scheduled access to time–frequency resources and having a cellular configuration, a P2P configuration, or a mesh configuration, a scheduling entity and one or more scheduled entities may communicate utilizing the scheduled resources. In some examples, the sidelink signals 227 include sidelink traffic and sidelink control.

In the radio access network 200, the ability for a UE to communicate while moving, independent of its location, is referred to as mobility. The various physical channels between the UE and the radio access network are generally set up, maintained, and released under the control of an access and mobility management function (AMF, not illustrated, part of the core network 102 in FIG. 1) , which may include a security context management function (SCMF) that manages the security context for both the control plane and the user plane functionality, and a security anchor function (SEAF) that performs authentication.

In various implementations, the air interface in the radio access network 200 may utilize licensed spectrum, unlicensed spectrum, or shared spectrum. Licensed spectrum provides for exclusive use of a portion of the spectrum, generally by virtue of a mobile network operator purchasing a license from a government regulatory body. Unlicensed spectrum provides for shared use of a portion of the spectrum without need for a government-granted license. While compliance with some technical rules is generally still required to access unlicensed spectrum, generally, any operator or device may gain access. Shared spectrum may fall between licensed and unlicensed spectrum, wherein technical rules or limitations may be required to access the spectrum, but the spectrum may still be shared by multiple operators and/or multiple RATs. For example, the holder of a license for a portion of licensed spectrum may provide licensed shared access (LSA) to share that spectrum with other parties, e.g., with suitable licensee-determined conditions to gain access.

In order for transmissions over the radio access network 200 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 encoded 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.

In early 5G NR specifications, user data traffic 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 coding 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.

However, those of ordinary skill in the art will understand that aspects of the present disclosure may be implemented utilizing any suitable channel code. Various implementations of scheduling entities 108 and scheduled entities 106 may include suitable hardware and capabilities (e.g., an encoder, a decoder, and/or a CODEC) to utilize one or more of these channel codes for wireless communication.

However, even with the best error correcting codes, if the communication channel experiences a very large amount of noise, or experiences a deep fade or other issue, the bit error rate may exceed what can be compensated. Accordingly, many wireless communication networks utilize a hybrid automatic repeat request (HARQ) scheme to further improve data reliability. In a HARQ algorithm, the transmitting device (e.g., a base station or UE) may retransmit code blocks (e.g., encoded using convolutional or block codes) if the first transmission is not decoded correctly at the receiving device. To facilitate this process, a transmitted encoded code block may include a cyclic redundancy check (CRC) portion, a checksum, or any other suitable mechanism known to those of ordinary skill in the art to determine whether the encoded code block is decoded properly at the receiving device. If the received encoded code block is properly decoded, then the receiving device may transmit an acknowledgment (ACK) , informing the transmitting device that a retransmission is not needed. However, if the received encoded code block is not properly decoded, then the receiving device may transmit a negative acknowledgment (NACK) requesting a retransmission. In general, a limited number of retransmissions will be made before the transmission attempt is terminated. Many existing networks limit their HARQ algorithms to four retransmissions. However, any suitable retransmission limit may be utilized in a network within the scope of the present disclosure.

The air interface in the radio access network 200 may utilize one or more multiplexing and multiple access algorithms to enable simultaneous communication of the various devices. For example, 5G NR specifications provide multiple access for UL transmissions from

UEs

222 and 224 to base station 210, and for multiplexing for DL transmissions from base station 210 to one or

more UEs

222 and 224, utilizing orthogonal frequency division multiplexing (OFDM) with a cyclic prefix (CP) . In addition, for UL transmissions, 5G NR specifications provide support for discrete Fourier transform-spread-OFDM (DFT-s-OFDM) with a CP (also referred to as single-carrier FDMA (SC-FDMA) ) . However, within the scope of the present disclosure, multiplexing and multiple access are not limited to the above schemes, and may be provided utilizing time division multiple access (TDMA) , code division multiple access (CDMA) , frequency division multiple access (FDMA) , sparse code multiple access (SCMA) , resource spread multiple access (RSMA) , or other suitable multiple access schemes. Further, multiplexing DL transmissions from the base station 210 to UEs 222 and 224 may be provided utilizing time division multiplexing (TDM) , code division multiplexing (CDM) , frequency division multiplexing (FDM) , orthogonal frequency division multiplexing (OFDM) , sparse code multiplexing (SCM) , or other suitable multiplexing schemes.

The air interface in the radio access network 200 may further utilize one or more duplexing algorithms. Duplex refers to a point-to-point communication link where both endpoints can communicate with one another in both directions. Full duplex means both endpoints can simultaneously communicate with one another. Half duplex means only one endpoint can send information to the other at a time. In a wireless link, a full duplex channel generally relies on physical isolation of a transmitter and receiver, and suitable interference cancellation technologies. Full duplex emulation is frequently implemented for wireless links by utilizing frequency division duplex (FDD) or time division duplex (TDD) . In FDD, transmissions in different directions operate at different carrier frequencies. In TDD, transmissions in different directions on a given channel are separated from one another using time division multiplexing. That is, at some times the channel is dedicated for transmissions in one direction, while at other times the channel is dedicated for transmissions in the other direction, where the direction may change very rapidly, e.g., several times per slot.

FIG. 3 is a schematic illustration of a wireless communication system 300 where a first wireless communication device 302 communicates with a second wireless communication device 304. Each

wireless communication device

302 and 304 may be a user equipment (UE) , a base station, or any other suitable apparatus or means for wireless communication. In the illustrated example, a source 322 within the first wireless communication device 302 transmits a digital message over a communication channel 306 (e.g., a wireless channel) to a sink 344 in the second wireless communication device 304. To provide for reliable communication of the digital message, it is usually beneficial to take into account the noise 308 that affects the communication channel 306.

Block codes, or error correcting codes are frequently used to provide reliable transmission of digital messages over such channels. In a typical block code, an information message or sequence is split up into blocks, each block having a length of K bits. An encoder 324 at the first (transmitting) wireless communication device 302 then mathematically adds redundancy to the information message, resulting in codewords having a length of N, where N > K. Here, the coding rate R is the ratio between the message length and the block length: i.e., R = K /N. Exploitation of this redundancy in the encoded information message is one key to reliability of the message, possibly enabling correction for bit errors that may occur due to the noise 308 or other signal propagation affects. That is, a decoder 342 at the second (receiving) wireless communication device 304 can take advantage of the redundancy to possibly recover the information message even though bit errors may occur, in part, due to the addition of noise to the channel, etc.

LDPC codes are linear forward error correcting codes, where each codeword of length N contains K information bits and C parity check bits (N=K+C) . The symbols in an LDPC codeword satisfy C parity check equations of the form:

where c _a, c _b, c _c, …, c _z are the code bits in the parity check equation and

refers to modulo 2 addition (e.g., an exclusive or operation) .

LDPC codes may be defined by a sparse parity-check matrix H. A parity-check matrix is a C-row by N-column binary matrix. The rows represent the parity check equations and the columns represent the bits in the codeword. There is a “one” in the i-th row and j-th column if the j-th code bit is contained in the i-th parity check equation. The parity-check matrix is sparse in that the matrix has a low density of ones. This sparsity renders low complexity decoding and leads to a simple implementation.

An example of a parity-check matrix H 400 is shown in FIG. 4. In the example shown in FIG. 4, the length (N) of the codeword is twelve and the number of parity check bits (C) is nine. Therefore, the parity-check matrix H is a 12x9 matrix, with nine parity check equations and twelve bits. Each parity check equation is formed from the code bits c ₁–c ₁₂ corresponding to the nonzero locations in each row. For example, the first parity check equation corresponding to the first row may be represented as

Thus, the first parity check equation includes the code bits c ₃, c ₆, c ₇, and c ₈ in the codeword. Similar equations may be constructed for each of the other rows based on the nonzero elements in each row. The matrix H shown in FIG. 4 represents a regular LDPC code in that every code bit is contained in the same number of equations and each equation contains the same number of code bits. For example, in FIG. 4, each code bit c ₁–c ₁₂ is contained in three equations and each equation contains four code bits. In other examples, the LDPC code may be irregular, which includes a variable number of ones in the rows and columns.

Decoding of LDPC codes may best be understood by a graphical description. FIG. 5 illustrates an example of an LDPC graph 500 corresponding to the parity-check matrix H shown in FIG. 4. The graph 500 has two types of nodes: variable nodes (VN1–VN12) 502 and check nodes (CN1–CN9) 504. Each variable node represents a code bit and each check node represents a parity check equation. A line is drawn between a variable node and a check node if the code bit associated with the variable node is contained within the parity check equation associated with the check node. Each line may be referred to herein as an edge 506. Thus if a j-th variable node 502 is connected to an i-th check node 504 by an edge 506, i. e., the two nodes are neighbors, then there is a “1” in the i-th column and in the j-th row of the parity-check matrix H. That is, the intersection of an-i-th row and a j-th column contains a “1” where an edge 506 joins the corresponding

nodes

502 and 504 and a “0” where there is no edge. As such, each edge 506 corresponds to a non-zero element in the parity-check matrix.

The degree of a node refers to the number of edges connected to that node. This feature is illustrated in the H matrix shown in FIG. 5 where the number of edges incident to a variable node 502 is equal to the number of 1’s in the corresponding column and is called the variable node degree d (v) . Similarly, the number of edges connected with a check node 504 is equal to the number of ones in a corresponding row and is called the check node degree d (c) . Since the graph shown in FIG. 5 corresponds to the parity-check matrix shown in FIG. 4, each variable node 502 has three edges 506 connecting it to check nodes 504 and each check node 504 has four edges 506 connecting it to variable nodes 502. A regular graph or code is one for which all variable nodes have the same degree, j, and all check nodes have the same degree, k. In this case, we say that the code is a (j, k) regular code. On the other hand, an irregular code has check nodes and/or variable nodes of differing degrees. For example, some variable nodes may be of degree 4, others of degree 3 and still others of degree 2.

A bit sequence associated one-to-one with the bit node sequence is a codeword of the code if and only if, for each check node 504, the bits neighboring the check node 504 (via their association with variable nodes 502) sum to zero modulo two, i. e., they comprise an even number of ones. In some cases, some of these bits might be punctured or known. Puncturing refers to the act of removing bits from a codeword to yield, in effect, a shorter codeword of a desired granularity. In the case of LDPC graphs, this means that some of the bit nodes 502 in the graph correspond to bits that are not actually transmitted. Puncturing a variable node 502 in an LDPC code creates a shortened code (e.g. due to the removal of a bit) , while also effectively removing a check node 504. Specifically, for a matrix representation of an LDPC code, including bits to be punctured, where the variable node 502 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 502 removes the associated bit from the code and effectively removes its single neighboring check node 504 from the graph. As a result, the number of check nodes 504 in the graph is reduced by one.

The LDPC decoder and decoding algorithm used to decode LDPC codewords operate by exchanging messages within the graph 500 along the edges 506 and updating these messages by performing computations at the

nodes

502 and 504 based on the incoming messages. Each variable node 502 in the graph 500 is initially provided with a soft bit that indicates an estimate of the probability that the bit is a one, as determined by observations from, e.g., the communications channel (e.g., the channel estimate) . The variable node 502 broadcasts this soft bit (initial estimate) to the check nodes 504 on the edges 506 connected to that variable node 502. Each check node 504, in turn, generates first new estimates for the bits involved in that parity check equation and sends back these first new estimates on the edges 506 back to the variable nodes 502. The first new estimates are calculated based upon all of the initial estimates furnished to the parity node.

For example, consider the first check node CN1 corresponding to the equation

This check node may receive initial estimates e ₃, e ₆, e ₇, and e ₈ from the variable nodes VN3, VN6, VN7, and VN8 corresponding to the code bits c ₃, c ₆, c ₇, and c ₈. The first new estimate for the variable node VN3 corresponding to code bit c ₃ may then be calculated as:

e′ ₃=e ₆(1-e ₇)(1-e ₈)+e ₇(1-e ₆)(1-e ₈)+e ₈(1-e ₆)(1-e ₇)+e ₆e ₇e ₈.

Similar calculations may be made for the new estimates for the remaining variable nodes.

As a result, each variable node 502 is provided different first new estimates by each of the check nodes 504 connected to it. Each variable node 502 may then determine a respective second new estimate for each of the check nodes 504 connected to it based on the original channel estimate together with a combination of the first new estimates received from each check node (except the check node to which the additional new estimate is sent) . Thus, in determining the second new estimate sent from the variable node 502 to a check node 504, the variable node 502 ignores the first new estimate received from that check node 504. For example, variable node VN3 will ignore the first new estimate sent from check node CN1 when determining the second new estimate for check node CN1. The second new estimate for a particular check node may then be calculated, for example, as a normalized product of the first new estimates received from the other check nodes 504, taking into consideration the original channel estimate. This process repeats with check nodes 504 passing edge messages (estimates) to variable nodes 502 and variable nodes 502 passing edge messages (estimates) to check nodes 504 until a final estimate is computed at each variable node 502 by computing the normalized product of all of the estimates. A hard decision on each bit may then be made by comparing the final estimate with a threshold (e.g., 0.5) .

In some examples, the graph 500 shown in FIG. 5 may be considered a base graph. As used herein, the term “base graph” refers to an LDPC graph having dimensions less than that necessary to produce the minimum codeword length utilized in a wireless communication network (e.g., the wireless communication system 100 shown in FIG. 1) . To produce an LDPC graph corresponding to a desired information block length K and coding rate R, each of the elements in the LDPC parity-check matrix representing the LDPC graph may be lifted (e.g., replaced with another matrix) by a lift size Z (e.g., K _b*Z=K) . For example, if the base graph is represented by a 3x3 matrix and a lift size Z of three is applied to the base graph, the resulting lifted parity-check matrix is a 9x9 matrix to support a codeword having nine code bits (e.g., where each column in the matrix is associated with a set of three of the code bits) . In effect, lifting is a technique for generating a relatively large LDPC code from multiple copies of a smaller base code. The largest lift size Z _max represents the largest degree of parallelism that may be achieved per edge in the base graph, corresponding to the largest information block length K _max

In some examples, construction of the lifted parity-check matrix may involve replacing each of the elements of the base parity-check matrix with a square submatrix of size Z x Z (the lift size) , where each submatrix is either a cyclic-permutation of the identity matrix or a null submatrix. For example, for a submatrix size of 3 x 3, corresponding to a lift size of three, the submatrix P ₀ may be the identity matrix and other submatrices P _i may be obtained by cyclically-shifting the columns to the right by i elements.

Each element in the base parity-check matrix may then contain an identity of the lifted submatrix (e.g., P _i or *, where *indicates a null matrix) . If an element includes a lifted submatrix identity, then the set of bits associated with the column containing the element are cyclically shifted (rotated) by an amount corresponding to the submatrix identity. Using the above example of a lift size of three, there are three bits associated with each column, and if a particular element in a column contains P ₂, the bits associated with that column would be shifted to the right by two bit positions. For example, the code bits [0 1 0] would be shifted to [1 0 0] . In some examples, the base parity-check matrix may support a maximum of twenty-two information bits (also referred to herein as systematic bits) with a maximum lift size of three-hundred eighty-four.

In some examples, different LDPC base graphs may be used for different transmissions. For example, in some situations, a device may need to transmit data at a very high throughput and/or with very high payloads. In this case, the device may use a first LDPC base graph that is designed for such transmissions for the LDPC encoding. In other cases, however, the device might transmit data at a lower throughput and/or with lower payloads. In this case, the device may use a second LDPC base graph that is designed for such transmissions for the LDPC encoding. For example, the second LDPC base graph may enable more efficient encoding that the first LDPC base graph at lower throughputs and/or lower payloads.

FIG. 6 illustrates examples of performance targets 600 for two LDPC base graphs that may be used in 3GPP-based devices. A first LDPC base graph (referred to as base graph 1 (BG1) ) is targeted toward relatively high payloads with relatively high coding rate values as represented by the area 602 of FIG. 6. A second LDPC base graph (referred to as base graph 2 (BG2) ) is targeted toward relatively lower payloads and relatively lower coding rate values as represented by the area 604 of FIG. 6.

In an LDPC encoding example for NR, LDPC coding may be used for the data channel. Here, BG2 for the LDPC coding may have a size of 42 x 52 with 10 systematic bits. BG2 may be used for the LDPC coding when the coding rate (R) <= 0.25. BG2 may also be used for the LDPC coding when 1/4 < R <= 2/3 and 308 < Payload <= 3840. BG2 may also be used for the LDPC coding when Payload <= 308. Segmentation may occur when the payload size > 3840. BG1 for the LDPC coding may have a size of 46 x 68 with 22 systematic bits. Also, 16 CRC bits may be used when the payload <= 3824. In addition, 24 CRC bits may be used when the payload > 3824.

In some examples, different types of communication constraints (e.g., that limit maximum throughput) may be specified for different types of communication devices. For example, for LTE category 1 (Cat 1) devices, the DL limits that follow may be specified. A transmit time interval (TTI) TB size limit may be 10260 bits. The rank may be limited to rank 1 only (e.g., multiple-input multiple-output (MIMO) communication is not allowed) . The soft buffer soft bit size may be limited to 250368 bits. In addition, for the UL, the TTI TB size limit may be approximately 5000 bits.

A device that supports a particular communication category may include capabilities to support the full range of capabilities defined by that category. For example, an LTE Cat 1 device may include sufficient processing capability and buffers to support the higher transport blocks sizes and transmission rates.

In some examples, however, it may be desirable for a device to have relatively low power consumption (e.g., to increase battery life) and/or a lower cost. Non-limiting examples of such devices include wearable devices and/or Internet of Things (IoT) devices. In some implementations, these devices may have relatively low data requirements (e.g., low throughput requirements and/or small block size requirements) . Thus, these devices may have slower processing times and lower capabilities.

To reduce the cost and/or increase the battery life of such devices, the disclosure relates in some aspects to designing such a device with a smaller TB size (e.g., an, hence, a smaller soft buffer size) and/or a simplified LDPC code. For example, a device may support less than the full LTE Cat 1 capabilities.

In some examples, the disclosure relates to restricting the LDPC encoding and/or decoding at such a device to only use BG2. By eliminating the need to support BG1, the device may use smaller buffers and will only need to support the encoding for BG2. For example, if a device (e.g., an IoT device) mainly uses smaller packets, the LDPC coding at the device may be limited to BG2 only. Thus, BG1 does not need to be supported by the LDPC encoder/decoder of the device. For example, in implementations where the decoder 342 of FIG. 3 only supports BG2, the decoder 342 may employ smaller buffers and have a simplified LDPC code as compared to a device that also supports BG1 (e.g., a full-capability UE) .

A device that communicates with a BG2-only device may adapt its LDPC coding to only use BG2 as well. For example, when the device 302 schedules and/or communicates with a device that does not support BG1, the encoder 324 may restrict its LDPC encoding and/or decoding to only use BG2.

In some examples, selection of only BG2 is achieved by limiting the coding rate and/or payload size so that an LDPC base graph selection processes always selects BG2. For example, in an NR scenario, a coding rate ≤ 0.25 may be selected in some examples to cause the LDPC base graph selection process to select BG2. As another example, a coding rate ≤ 0.67 may be selected in some examples (e.g., when the payload size is ≤ 3824) to cause the LDPC base graph selection process to select BG2. Thus, as shown FIG. 7, only the payload size and coding rates combinations 702 may be supported by a BG2-only device in some examples. Similarly, the payload size and coding rates combinations 702 would be used by another device that schedules and/or communicates with the BG2-only device in some examples.

In some examples, selection of only BG2 is achieved by using a CB segmentation algorithm that only uses BG2. For example, a CB segmentation algorithm may be designed to only select the maximum code block size (e.g., 3840) that is based on BG2 for communication with certain devices. Thus, in this case, all coding rates may be supported by BG2. Thus, as shown FIG. 8, only up to a certain payload size may be supported by a BG2-only device as indicated by the area 802. In some examples, a CB segmentation algorithm may be modified to just use BG2.

Similarly, another device that schedules and/or communicates with the BG2- only device may use such a CB segmentation algorithm for that scheduling and/or communication. In some examples, the CB segmentation algorithm may be designed to use both base graphs for communication with other devices and only BG2 for communication with a BG2-only device. As another example, multiple CB segmentation algorithms may be used where one of these CB segmentation algorithms only selects the code block size (e.g., 3840) that is based on BG2. This CB segmentation algorithm could thus be selected for communication with BG2-only devices.

The disclosure relates in some aspects to mechanisms for reducing the soft buffer size for a device. Here, by incorporating a smaller buffer in a device, the device may have lower power consumption and/or may be constructed at a lower cost. Several examples of these mechanisms follow.

In some examples, the basic size of BG2 may be 42 x 52 with 10 systematic information entries. In addition, the nominal coding rate for BG2 may be from 0.17 to 0.83. In some aspects, the soft buffer size is related to the minimum supported coding rate. Lowering the coding rate may lead to a larger soft buffer size due to the larger number of coded bits.

The disclosure relates in some aspects to defining a minimum coding rate that is higher than the minimum coding rate used for BG2. For example, the minimum nominal rate may be set > 0.17 (e.g., 0.3) . In some aspects, this may lead to a reduced soft buffer size.

The soft buffer size also may be related to the number of HARQ processes used since separate soft buffers may be used for each HARQ process (e.g., up to 16 HARQ processes for some types of communication) . The disclosure relates in some aspects to limiting the number of HARQ process supported to a smaller number (e.g., 1, 2, 3, 4, etc. ) to reduce the soft buffer size. For example, the maximum number of HARQ processes may be set to 2 instead of 16.

The disclosure relates in some aspects to limiting the transport block (TB) size to one code block (CB) . For a LTE Cat 1 capability of 10216 bits per TTI, if this is interpreted as 10216 bits per 1 millisecond (ms) , given a 30KHz subcarrier spacing (SCS) , 5108 bits/slot can be supported. This is still within 1 CB for BG1. In some aspects, limiting the TB size may further simplify the implementation. In some examples, the TB size is limited to the maximum payload size for BG2 (e.g., 3840 with 24-bit CRC) . Therefore, the TB with whatever payload size can be transmitted over single CB.

FIG. 9 is a block diagram illustrating an example of a hardware implementation for a base station (BS) 900 employing a processing system 914. In accordance with various aspects of the disclosure, an element, or any portion of an element, or any combination of elements may be implemented with a processing system 914 that includes one or more processors 904. In some implementations, the BS 900 may correspond to one or more of the scheduling entity 108 (e.g., a gNB, a transmit receive point, a UE, etc. ) of FIG. 1, a

base station

210, 212, 214, or 218 of FIG. 2, or the wireless communication device 302 of FIG. 3.

The BS 900 may be implemented with a processing system 914 that includes one or more processors 904. Examples of processors 904 include microprocessors, microcontrollers, digital signal processors (DSPs) , field programmable gate arrays (FPGAs) , programmable logic devices (PLDs) , state machines, gated logic, discrete hardware circuits, and other suitable hardware configured to perform the various functionality described throughout this disclosure. In various examples, the BS 900 may be configured to perform any one or more of the functions described herein. That is, the processor 904, as utilized in the BS 900, may be used to implement any one or more of the processes and procedures described below.

In this example, the processing system 914 may be implemented with a bus architecture, represented generally by the bus 902. The bus 902 may include any number of interconnecting buses and bridges depending on the specific application of the processing system 914 and the overall design constraints. The bus 902 links together various circuits including one or more processors (represented generally by the processor 904) , a memory 905, and computer-readable media (represented generally by the computer-readable medium 906) . The bus 902 may also link various other circuits such as timing sources, peripherals, voltage regulators, and power management circuits, which are well known in the art, and therefore, will not be described any further.

A bus interface 908 provides an interface between the bus 902 and a transceiver 910. The transceiver 910 provides a means for communicating with various other apparatus over a transmission medium (e.g., air interface) . Depending upon the nature of the apparatus, a user interface 912 (e.g., keypad, display, touch screen, speaker, microphone, control knobs, etc. ) may also be provided. Of course, such a user interface 912 is optional, and may be omitted in some examples.

The processor 904 is responsible for managing the bus 902 and general processing, including the execution of software stored on the computer-readable medium 906. 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, functions, etc., whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. The software, when executed by the processor 904, causes the processing system 914 to perform the various functions described below for any particular apparatus. The computer-readable medium 906 and the memory 905 may also be used for storing data that is manipulated by the processor 904 when executing software.

The computer-readable medium 906 may be a non-transitory computer-readable medium. A non-transitory computer-readable medium includes, by way of example, a magnetic storage device (e.g., hard disk, floppy disk, magnetic strip) , an optical disk (e.g., a compact disc (CD) or a digital versatile disc (DVD) ) , a smart card, a flash memory device (e.g., a card, a stick, or a key drive) , a random access memory (RAM) , a read only memory (ROM) , a programmable ROM (PROM) , an erasable PROM (EPROM) , an electrically erasable PROM (EEPROM) , a register, a removable disk, and any other suitable medium for storing software and/or instructions that may be accessed and read by a computer. The computer-readable medium 906 may reside in the processing system 914, external to the processing system 914, or distributed across multiple entities including the processing system 914. The computer-readable medium 906 may be embodied in a computer program product. By way of example, a computer program product may include a computer-readable medium in packaging materials. In some examples, the computer-readable medium 906 may be part of the memory 905. In some examples, an article of manufacture for use by the BS 900 in a wireless communication network may include a computer-readable medium having stored therein instructions executable by one or more processors of the BS 900 to perform one or more of the operations described herein. Those skilled in the art will recognize how best to implement the described functionality presented throughout this disclosure depending on the particular application and the overall design constraints imposed on the overall system.

In some aspects of the disclosure, the processor 904 may include circuitry configured for various functions. For example, the processor 904 may include communication and processing circuitry 941. The communication and processing circuitry 941 may include one or more hardware components that provide the physical structure that performs various processes related to wireless communication (e.g., signal reception and/or signal transmission) as described herein. The communication and processing circuitry 941 may further include one or more hardware components that provide the physical structure that performs various processes related to signal processing (e.g., processing a received signal and/or processing a signal for transmission) as described herein. In some examples, the communication and processing circuitry 941 may include two or more transmit/receive chains, each configured to process signals in a different RAT (or RAN) type. The communication and processing circuitry 941 may further be configured to execute communication and processing software 951 included on the computer-readable medium 906 to implement one or more functions described herein.

In some implementations where the communication involves receiving information, the communication and processing circuitry 941 may obtain information from a component of the BS 900 (e.g., from the transceiver 910 that receives the information via radio frequency signaling or some other type of signaling suitable for the applicable communication medium) , process (e.g., decode) the information, and output the processed information. For example, the communication and processing circuitry 941 may output the information to another component of the processor 904, to the memory 905, or to the bus interface 908. In some examples, the communication and processing circuitry 941 may receive one or more of signals, messages, other information, or any combination thereof. In some examples, the communication and processing circuitry 941 may receive information via one or more channels. In some examples, the communication and processing circuitry 941 may include functionality for a means for receiving.

In some implementations where the communication involves sending (e.g., transmitting) information, the communication and processing circuitry 941 may obtain information (e.g., from another component of the processor 904, the memory 905, or the bus interface 908) , process (e.g., encode) the information, and output the processed information. For example, the communication and processing circuitry 941 may output the information to the transceiver 910 (e.g., that transmits the information via radio frequency signaling or some other type of signaling suitable for the applicable communication medium) . In some examples, the communication and processing circuitry 941 may send one or more of signals, messages, other information, or any combination thereof. In some examples, the communication and processing circuitry 941 may send information via one or more channels. In some examples, the communication and processing circuitry 941 may include functionality for a means for sending (e.g., means for transmitting) .

The processor 904 may include LDPC coding circuitry 942 configured to perform resource reservation-related operations as discussed herein. The LDPC coding circuitry 942 may select an LDPC base graph to utilize for LDPC coding. For example, the LDPC base graph may be selected from at least two base graphs. The LDPC coding circuitry 942 may further be configured to execute LDPC coding software 952 included on the computer-readable medium 906 to implement one or more functions described herein.

The processor 904 may include communication configuration circuitry 943 configured to perform communication configuration-related operations as discussed herein. The communication configuration circuitry 943 may include functionality for a means for identifying. In some examples, the communication configuration circuitry 943 may identify a data block size limit associated with a wireless communication device. The communication configuration circuitry 943 may include functionality for a means for selecting. In some examples, the communication configuration circuitry 943 may select at least one of: a communication parameter, a segmentation algorithm, a coding rate according to (e.g., greater than or equal to) a minimum coding rate, at least one HARQ process (e.g., a specific quantity of HARQ processes) according to (e.g., less than or equal to) a maximum number of HARQ processes, a transport block size limited by a code block size, or any combination thereof. The communication configuration circuitry 943 may further be configured to execute communication configuration software 953 included on the computer-readable medium 906 to implement one or more functions described herein.

In some examples, the communication configuration circuitry 943 may be configured to identify a data block size limit associated with a first wireless communication device (e.g., based on configuration information received from the device) and, after (e.g., as a result of) identifying the data block size limit associated with the first wireless communication device, select at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph (e.g., BG2) for an LDPC operation. The communication configuration circuitry 943 may also be configured to perform other operations related to selecting a communication parameter as discussed herein.

In some examples, the communication configuration circuitry 943 may be configured to identify a data block size limit associated with a first wireless communication device and, after (e.g., as a result of) identifying the data block size limit associated with the first wireless communication device, select a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph (e.g., that selects a maximum code block size based on BG2) . The communication configuration circuitry 943 may also be configured to perform other operations related to segmentation as discussed herein.

In some examples, the communication configuration circuitry 943 may be configured to identify a data block size limit associated with a first wireless communication device and, after (e.g., as a result of) identifying the data block size limit associated with the first wireless communication device, select a first coding rate that is greater than or equal to a first minimum coding rate value. The communication configuration circuitry 943 may also be configured to perform other operations related to selecting a coding rate as discussed herein.

In some examples, the communication configuration circuitry 943 may be configured to identify a data block size limit associated with a first wireless communication device and, after (e.g., as a result of) identifying the data block size limit associated with the first wireless communication device, select a first number of hybrid automatic repeat request (HARQ) processes (e.g., select the number of HARQ processes to be used for a communication) that is less than or equal to a first maximum number of HARQ processes. The communication configuration circuitry 943 may also be configured to perform other operations related to HARQ processes as discussed herein.

In some examples, the communication configuration circuitry 943 may be configured to identify a data block size limit associated with a first wireless communication device and, after (e.g., as a result of) identifying the data block size limit associated with the first wireless communication device, select a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first low density parity check (LDPC) base graph (e.g., BG2) . The communication configuration circuitry 943 may also be configured to perform other operations related to selecting a transport block size as discussed herein.

Of course, in the above examples, the circuitry included in the processor 904 is merely provided as an example, and other means for carrying out the described functions may be included within various aspects of the present disclosure, including but not limited to the instructions stored in the computer-readable medium 906, or any other suitable apparatus or means described in any one of the FIGs. 1, 2, or 4, and utilizing, for example, the processes and/or algorithms described herein in relation to FIGs. 10 –14. In some examples, the BS 900 or some other suitable device may perform any combination of the functions described in FIGs. 10 –14.

FIG. 10 is a flow chart 1000 of a method for wireless communication. As described below, some or all illustrated features may be omitted in a particular implementation within the scope of the present disclosure, and some illustrated features may not be required for implementation of all embodiments. In some examples, the method may be performed by the base station 900 as described above and illustrated in FIG. 9, by a processor or processing system, or by any suitable means for carrying out the described functions. For purposes of illustration, the method will be described as being performed by a base station.

At block 1002, the base station identifies a data block size limit associated with a first wireless communication device. For example, the communication configuration circuitry 943 of FIG. 9 together with the communication and processing circuitry 941 and transceiver 910, shown and described above in connection with FIG. 9, may determine that the first wireless communication device has a data block size limit. In some aspects, the first wireless communication device may be a wearable communication device or an Internet of Things (IoT) device.

At block 1004, the base station, after identifying the data block size limit associated with the first wireless communication device, selects at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device (e.g., a UE) . For example, the LDPC coding circuitry 942 of FIG. 9 together with the communication configuration circuitry 943 of FIG. 9 may select a coding rate and/or payload size to ensure that BG2 is used for LDPC coding. In some aspects, the first LDPC base graph may include a third generation partnership project (3GPP) LDPC base graph 2 and the second LDPC base graph may include a 3GPP LDPC base graph 1.

In some aspects, selecting the at least one communication parameter may include selecting a coding rate that the LDPC base graph selection process uses to select the first LDPC base graph. In some aspects, selecting the coding rate may include selecting a coding rate that is less than or equal to 0.25.

In some aspects, selecting the at least one communication parameter may include selecting a payload size that the LDPC base graph selection process uses to select the first LDPC base graph. In some aspects, selecting the payload size may include selecting a payload size that is less than or equal to 292 bits.

In some aspects, selecting the at least one communication parameter may include selecting a coding rate and a payload size that the LDPC base graph selection process uses to select the first LDPC base graph. In some aspects, selecting the coding rate and the payload size may include selecting a coding rate that is less than or equal to 0.67 and selecting a payload size that is less than or equal to 3824 bits.

At block 1006, the base station communicates with the first wireless communication device using the at least one communication parameter. For example, the LDPC coding circuitry 942 of FIG. 9 together with the communication and processing circuitry 941 and transceiver 910, shown and described above in connection with FIG. 9, may use the at least one communication parameter to transmit information to and/or receive information from the first wireless communication device. In some aspects, the communicating with the first wireless communication device may include using the at least one communication parameter to transmit data to the first wireless communication device. In some aspects, the communicating with the first wireless communication device may include scheduling a data transmission by the first wireless communication device according to the at least one communication parameter; and using the at least one communication parameter to receive the data transmission from the first wireless communication device.

In some aspects, the method may further include selecting a code block segmentation algorithm that only uses the first LDPC base graph.

In some aspects, the method may further include selecting a coding rate for the communicating with the first wireless communication device, wherein selecting the coding rate is based on a first minimum coding rate value, and wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.

In some aspects, the method may further include selecting at least one hybrid automatic repeat request (HARQ) process for the communicating with the first wireless communication device; wherein selecting the at least one HARQ process is based on a first maximum number of HARQ processes; and wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for the communication with the second wireless communication device.

In some aspects, the method may further include selecting a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with the first LDPC base graph.

FIG. 11 is a flow chart 1100 of another method for wireless communication. As described below, some or all illustrated features may be omitted in a particular implementation within the scope of the present disclosure, and some illustrated features may not be required for implementation of all embodiments. In some examples, the method may be performed by the base station 900 as described above and illustrated in FIG. 9, by a processor or processing system, or by any suitable means for carrying out the described functions. For purposes of illustration, the method will be described as being performed by a base station.

At block 1102, the base station identifies a data block size limit associated with a first wireless communication device. For example, the communication configuration circuitry 943 of FIG. 9 together with the communication and processing circuitry 941 and transceiver 910, shown and described above in connection with FIG. 9, may determine that the first wireless communication device has a data block size limit. In some aspects, the first wireless communication device may be a wearable communication device or an Internet of Things (IoT) device.

At block 1104, the base station, after identifying the data block size limit associated with the first wireless communication device, selects a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device. For example, the LDPC coding circuitry 942 of FIG. 9 together with the communication configuration circuitry 943 of FIG. 9 may select a code block segmentation algorithm to ensure that BG2 is used for LDPC coding. In some aspects, the first LDPC base graph may include a third generation partnership project (3GPP) LDPC base graph 2; and the second LDPC base graph may include a 3GPP LDPC base graph 1. In some aspects, the first LDPC base graph may support a coding rate that is less than or equal to 0.25.

At block 1106, the base station communicates with the first wireless communication device using the code block segmentation algorithm. For example, the LDPC coding circuitry 942 of FIG. 9 together with the communication and processing circuitry 941 and transceiver 910, shown and described above in connection with FIG. 9, may employ the code block segmentation algorithm to transmit information to and/or receive information from the first wireless communication device. In some aspects, the communicating with the first wireless communication device may include using the code block segmentation algorithm to generate segmented data; and transmitting the segmented data to the first wireless communication device. In some aspects, the communicating with the first wireless communication device may include scheduling a data transmission by the first wireless communication device according to a segmentation by the code block segmentation algorithm; and receiving the data transmission from the first wireless communication device.

In some aspects, the method may further include selecting at least one communication parameter so that the first LDPC base graph is used for an LDPC operation.

In some aspects, the method may further include selecting a coding rate for the communicating with the first wireless communication device; wherein selecting the coding rate is based on a first minimum coding rate value; and wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.

FIG. 12 is a flow chart 1200 of another method for wireless communication. As described below, some or all illustrated features may be omitted in a particular implementation within the scope of the present disclosure, and some illustrated features may not be required for implementation of all embodiments. In some examples, the method may be performed by the base station 900 as described above and illustrated in FIG. 9, by a processor or processing system, or by any suitable means for carrying out the described functions. For purposes of illustration, the method will be described as being performed by a base station.

At block 1202, the base station identifies a data block size limit associated with a first wireless communication device. For example, the communication configuration circuitry 943 of FIG. 9 together with the communication and processing circuitry 941 and transceiver 910, shown and described above in connection with FIG. 9, may determine that the first wireless communication device has a data block size limit. In some aspects, the first wireless communication device may be a wearable communication device or an Internet of Things (IoT) device.

At block 1204, the base station, after identifying the data block size limit associated with the first wireless communication device, selects a first coding rate that is greater than or equal to a first minimum coding rate value, wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for communication with a second wireless communication device. For example, the LDPC coding circuitry 942 of FIG. 9 together with the communication configuration circuitry 943 of FIG. 9 may apply a minimum coding rate restriction that reduces the amount of soft buffer space used. In some aspects the second minimum coding rate value may be 0.17.

At block 1206, the base station communicates with the first wireless communication device using the first coding rate. For example, the LDPC coding circuitry 942 of FIG. 9 together with the communication and processing circuitry 941 and transceiver 910, shown and described above in connection with FIG. 9, may use the first coding rate to transmit information to and/or receive information from the first wireless communication device. In some aspects, the communicating with the first wireless communication device may include coding data at the first coding rate to generate coded data; and transmitting the coded data to the first wireless communication device. In some aspects, the communicating with the first wireless communication device may include scheduling a data transmission by the first wireless communication device, wherein the data transmission is scheduled for coding at the first coding rate; and receiving the data transmission from the first wireless communication device.

In some aspects, the method may further include selecting at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for the communication with the second wireless communication device.

In some aspects, the method may further include selecting a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for the communication with the second wireless communication device

In some aspects, the method may further include selecting a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first LDPC base graph used by the base station for the communicating with the first wireless communication device.

FIG. 13 is a flow chart 1300 of another method for wireless communication. As described below, some or all illustrated features may be omitted in a particular implementation within the scope of the present disclosure, and some illustrated features may not be required for implementation of all embodiments. In some examples, the method may be performed by the BS 900, which may be a receiving wireless communication device (e.g., a receiving sidelink device) , as described above and illustrated in FIG. 9, by a processor or processing system, or by any suitable means for carrying out the described functions. For purposes of illustration, the method will be described as being performed by a base station.

At block 1302, the base station identifies a data block size limit associated with a first wireless communication device. For example, the communication configuration circuitry 943 of FIG. 9 together with the communication and processing circuitry 941 and transceiver 910, shown and described above in connection with FIG. 9, may determine that the first wireless communication device has a data block size limit. In some aspects, the first wireless communication device may be a wearable communication device or an Internet of Things (IoT) device.

At block 1304, the base station, after identifying the data block size limit associated with the first wireless communication device, selects a first number of hybrid automatic repeat request (HARQ) processes that is less than or equal to a first maximum number of HARQ processes, wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for communication with a second wireless communication device. For example, the LDPC coding circuitry 942 of FIG. 9 together with the communication configuration circuitry 943 of FIG. 9 may apply a maximum number of HARQ processes restriction that reduces the amount of soft buffer space used. In some aspects, the first maximum number of HARQ processes may be 1, 2, 3, or 4. In some aspects, the second maximum number of HARQ processes may be 16.

At block 1306, the base station communicates with the first wireless communication device using the first number of HARQ processes. For example, the LDPC coding circuitry 942 of FIG. 9 together with the communication and processing circuitry 941 and transceiver 910, shown and described above in connection with FIG. 9, may employ at most the first number of HARQ processes to transmit information to and/or receive information from the first wireless communication device. In some aspects, the communicating with the first wireless communication device may include transmitting data to the first wireless communication device; and using at most the first number of HARQ processes in conjunction with the transmitting of data to the first wireless communication device. In some aspects, the communicating with the first wireless communication device may include scheduling a data transmission by the first wireless communication device, wherein the data transmission is scheduled to use at most the first number of HARQ processes; and receiving the data transmission from the first wireless communication device.

FIG. 14 is a flow chart 1400 of another method for wireless communication. As described below, some or all illustrated features may be omitted in a particular implementation within the scope of the present disclosure, and some illustrated features may not be required for implementation of all embodiments. In some examples, the method may be performed by the base station 900 as described above and illustrated in FIG. 9, by a processor or processing system, or by any suitable means for carrying out the described functions. For purposes of illustration, the method will be described as being performed by a base station.

At block 1402, the base station identifies a data block size limit associated with a first wireless communication device. For example, the communication configuration circuitry 943 of FIG. 9 together with the communication and processing circuitry 941 and transceiver 910, shown and described above in connection with FIG. 9, may determine that the first wireless communication device has a data block size limit. In some aspects, the first wireless communication device may be a wearable communication device or an Internet of Things (IoT) device.

At block 1404, the base station, after identifying the data block size limit associated with the first wireless communication device, selects a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device. For example, the LDPC coding circuitry 942 of FIG. 9 together with the communication configuration circuitry 943 of FIG. 9 may restrict the size of a transport block to reduce the amount of soft buffer space used. In some aspects, the maximum payload size may be 3840 bits.

At block 1406, the base station communicates with the first wireless communication device using the transport block size. For example, the LDPC coding circuitry 942 of FIG. 9 together with the communication and processing circuitry 941 and transceiver 910, shown and described above in connection with FIG. 9, may transmit information formatted according to the transport block to and/or receive information formatted according to the transport block from the first wireless communication device. In some aspects, the communicating with the first wireless communication device may include providing data at the transport block size; and transmitting the data to the first wireless communication device. In some aspects, the communicating with the first wireless communication device may include scheduling a data transmission by the first wireless communication device, wherein the data transmission is scheduled based on the transport block size; and receiving the data transmission from the first wireless communication device.

Several aspects of wireless communication have been presented with reference to an example implementation. As those skilled in the art will readily appreciate, various aspects described throughout this disclosure may be extended to other telecommunication systems, network architectures and communication standards.

By way of example, various aspects may be implemented within other systems defined by 3GPP, such as Long-Term Evolution (LTE) , the Evolved Packet System (EPS) , the Universal Mobile Telecommunication System (UMTS) , and/or the Global System for Mobile (GSM) . Various aspects may also be extended to systems defined by the 3rd Generation Partnership Project 2 (3GPP2) , such as CDMA2000 and/or Evolution-Data Optimized (EV-DO) . Other examples may be implemented within systems employing IEEE 802.11 (Wi-Fi) , IEEE 802.16 (WiMAX) , IEEE 802.20, Ultra-Wideband (UWB) , Bluetooth, and/or other suitable systems. The actual telecommunication standard, network architecture, and/or communication standard employed will depend on the specific application and the overall design constraints imposed on the system.

Within the present disclosure, the word “exemplary” is used to mean “serving as an example, instance, or illustration. ” Any implementation or aspect described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects of the disclosure. Likewise, the term “aspects” does not require that all aspects of the disclosure include the discussed feature, advantage or mode of operation. The term “coupled” is used herein to refer to the direct or indirect coupling (e.g., communicative coupling) between two objects. For example, if object A physically touches object B, and object B touches object C, then objects A and C may still be considered coupled to one another-even if they do not directly physically touch each other. For instance, a first object may be coupled to a second object even though the first object is never directly physically in contact with the second object. The terms “circuit” and “circuitry” are used broadly, and intended to include both hardware implementations of electrical devices and conductors that, when connected and configured, enable the performance of the functions described in the present disclosure, without limitation as to the type of electronic circuits, as well as software implementations of information and instructions that, when executed by a processor, enable the performance of the functions described in the present disclosure.

One or more of the components, steps, features and/or functions illustrated in FIGs. 1 -14 may be rearranged and/or combined into a single component, step, feature or function or embodied in several components, steps, or functions. Additional elements, components, steps, and/or functions may also be added without departing from novel features disclosed herein. The apparatus, devices, and/or components illustrated in FIGs. 1, 2, or 4 may be configured to perform one or more of the methods, features, or steps described herein. The novel algorithms described herein may also be efficiently implemented in software and/or embedded in hardware.

It is to be understood that the specific order or hierarchy of steps in the methods disclosed is an illustration of example processes. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the methods may be rearranged. The accompanying method claims present elements of the various steps in a sample order, and are not meant to be limited to the specific order or hierarchy presented unless specifically recited therein.

The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects. Thus, the 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, wherein 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. 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 and b; a and c; b and c; and a, b and c. 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

A method of communication at a base station, the method comprising:

identifying a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, selecting at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

communicating with the first wireless communication device using the at least one communication parameter.
The method of claim 1, wherein:

the first LDPC base graph comprises a third generation partnership project (3GPP) LDPC base graph 2; and

the second LDPC base graph comprises a 3GPP LDPC base graph 1.
The method of claim 1, wherein selecting the at least one communication parameter comprises:

selecting a coding rate that the LDPC base graph selection process uses to select the first LDPC base graph.
The method of claim 3, wherein selecting the coding rate comprises:

selecting a coding rate that is less than or equal to 0.25.
The method of claim 1, wherein selecting the at least one communication parameter comprises:

selecting a payload size that the LDPC base graph selection process uses to select the first LDPC base graph.
The method of claim 5, wherein selecting the payload size comprises:

selecting a payload size that is less than or equal to 292 bits.
The method of claim 1, wherein selecting the at least one communication parameter comprises:

selecting a coding rate and a payload size that the LDPC base graph selection process uses to select the first LDPC base graph.
The method of claim 7, wherein selecting the coding rate and the payload size comprises:

selecting a coding rate that is less than or equal to 0.67; and

selecting a payload size that is less than or equal to 3824 bits.
The method of claim 1, further comprising:

selecting a code block segmentation algorithm that only uses the first LDPC base graph.
The method of claim 1, further comprising:

selecting a coding rate for the communicating with the first wireless communication device;

wherein selecting the coding rate is based on a first minimum coding rate value; and

wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.
The method of claim 1, further comprising:

selecting at least one hybrid automatic repeat request (HARQ) process for the communicating with the first wireless communication device;

wherein selecting the at least one HARQ process is based on a first maximum number of HARQ processes; and

wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for the communication with the second wireless communication device.
The method of claim 1, further comprising:

selecting a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with the first LDPC base graph.
The method of claim 1, wherein the communicating with the first wireless communication device comprises:

using the at least one communication parameter to transmit data to the first wireless communication device.
The method of claim 1, wherein the communicating with the first wireless communication device comprises:

scheduling a data transmission by the first wireless communication device according to the at least one communication parameter; and

using the at least one communication parameter to receive the data transmission from the first wireless communication device.
The method of claim 1, wherein the first wireless communication device is a wearable communication device or an Internet of Things (IoT) device.
A base station, comprising:

a transceiver;

a memory; and

a processor communicatively coupled to the transceiver and the memory, wherein the processor and the memory are configured to:

identify a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, select at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

communicate via the transceiver with the first wireless communication device using the at least one communication parameter.
The base station of claim 16, wherein:

the first LDPC base graph comprises a third generation partnership project (3GPP) LDPC base graph 2; and

the second LDPC base graph comprises a 3GPP LDPC base graph 1.
The base station of claim 16, wherein the processor and the memory are further configured to:

select a coding rate that the LDPC base graph selection process uses to select the first LDPC base graph.
The base station of claim 18, wherein the processor and the memory are further configured to:

select the coding rate to be less than or equal to 0.25.
The base station of claim 16, wherein the processor and the memory are further configured to:

select a payload size that the LDPC base graph selection process uses to select the first LDPC base graph.
The base station of claim 20, wherein the processor and the memory are further configured to:

select the payload size to be less than or equal to 292 bits.
The base station of claim 16, wherein the processor and the memory are further configured to:

select a coding rate and a payload size that the LDPC base graph selection process uses to select the first LDPC base graph.
The base station of claim 22, wherein the processor and the memory are further configured to:

select the coding rate to be less than or equal to 0.67; and

select the payload size to be less than or equal to 3824 bits.
The base station of claim 16, wherein the processor and the memory are further configured to:

select a code block segmentation algorithm that only uses the first LDPC base graph.
The base station of claim 16, wherein the processor and the memory are further configured to:

select a coding rate for the communicating with the first wireless communication device;

wherein selecting the coding rate is based on a first minimum coding rate value; and

wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.
The base station of claim 16, wherein the processor and the memory are further configured to:

select at least one hybrid automatic repeat request (HARQ) process for the communicating with the first wireless communication device;

wherein selecting the at least one HARQ process is based on a first maximum number of HARQ processes; and

wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for the communication with the second wireless communication device.
The base station of claim 16, wherein the processor and the memory are further configured to:

select a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with the first LDPC base graph.
The base station of claim 16, wherein the processor and the memory are further configured to:

use the at least one communication parameter to transmit data to the first wireless communication device.
A base station, comprising:

means for identifying a data block size limit associated with a first wireless communication device;

means for selecting at least one communication parameter, after identifying the data block size limit associated with the first wireless communication device, so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

communicating with the first wireless communication device using the at least one communication parameter.
An article of manufacture for use by a base station in a wireless communication network, the article comprising:

a computer-readable medium having stored therein instructions executable by one or more processors of the base station to:

identify a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, select at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

communicate with the first wireless communication device using the at least one communication parameter.
A method of communication at a base station, the method comprising:

identifying a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, selecting a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

communicating with the first wireless communication device using the code block segmentation algorithm.
The method of claim 31, wherein:

the first LDPC base graph comprises a third generation partnership project (3GPP) LDPC base graph 2; and

the second LDPC base graph comprises a 3GPP LDPC base graph 1.
The method of claim 31, wherein the first LDPC base graph supports a coding rate that is less than or equal to 0.25.
The method of claim 31, further comprising:

selecting at least one communication parameter so that the first LDPC base graph is used for an LDPC operation.
The method of claim 31, further comprising:

selecting a coding rate for the communicating with the first wireless communication device;

wherein selecting the coding rate is based on a first minimum coding rate value; and

wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.
The method of claim 31, further comprising:

selecting at least one hybrid automatic repeat request (HARQ) process for the communicating with the first wireless communication device;

wherein selecting the at least one HARQ process is based on a first maximum number of HARQ processes; and

wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for the communication with the second wireless communication device.
The method of claim 31, further comprising:

selecting a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with the first LDPC base graph.
The method of claim 31, wherein the communicating with the first wireless communication device comprises:

using the code block segmentation algorithm to generate segmented data; and

transmitting the segmented data to the first wireless communication device.
The method of claim 31, wherein the communicating with the first wireless communication device comprises:

scheduling a data transmission by the first wireless communication device according to a segmentation by the code block segmentation algorithm; and

receiving the data transmission from the first wireless communication device.
The method of claim 31, wherein the first wireless communication device is a wearable communication device or an Internet of Things (IoT) device.
A base station, comprising:

a transceiver;

a memory; and

a processor communicatively coupled to the transceiver and the memory, wherein the processor and the memory are configured to:

identify a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, select a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

communicate via the transceiver with the first wireless communication device using the code block segmentation algorithm.
The base station of claim 41, wherein:

the first LDPC base graph comprises a third generation partnership project (3GPP) LDPC base graph 2; and

the second LDPC base graph comprises a 3GPP LDPC base graph 1.
The base station of claim 41, wherein the first LDPC base graph supports a coding rate that is less than or equal to 0.25.
The base station of claim 41, wherein the processor and the memory are further configured to:

select at least one communication parameter so that the first LDPC base graph is used for an LDPC operation.
The base station of claim 41, wherein the processor and the memory are further configured to:

select a coding rate for the communicating with the first wireless communication device;

wherein selecting the coding rate is based on a first minimum coding rate value; and

wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.
The base station of claim 41, wherein the processor and the memory are further configured to:

select at least one hybrid automatic repeat request (HARQ) process for the communicating with the first wireless communication device;

wherein selecting the at least one HARQ process is based on a first maximum number of HARQ processes; and

wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for the communication with the second wireless communication device.
The base station of claim 41, wherein the processor and the memory are further configured to:

select a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with the first LDPC base graph.
The base station of claim 41, wherein the processor and the memory are further configured to:

use the code block segmentation algorithm to generate segmented data; and

transmit the segmented data to the first wireless communication device.
A base station, comprising:

means for identifying a data block size limit associated with a first wireless communication device;

means for selecting a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph after identifying the data block size limit associated with the first wireless communication device, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

means for communicating with the first wireless communication device using the code block segmentation algorithm.
An article of manufacture for use by a base station in a wireless communication network, the article comprising:

a computer-readable medium having stored therein instructions executable by one or more processors of the base station to:

identify a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, select a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

communicate with the first wireless communication device using the code block segmentation algorithm.
A method of communication at a base station, the method comprising:

identifying a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, selecting a first coding rate that is greater than or equal to a first minimum coding rate value, wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for communication with a second wireless communication device; and

communicating with the first wireless communication device using the first coding rate.
The method of claim 51, wherein the second minimum coding rate value is 0.17.
The method of claim 51, further comprising:

selecting at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for the communication with the second wireless communication device.
The method of claim 51, further comprising:

selecting a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for the communication with the second wireless communication device.
The method of claim 51, further comprising:

selecting at least one hybrid automatic repeat request (HARQ) process for the communicating with the first wireless communication device;

wherein selecting the at least one HARQ process is based on a first maximum number of HARQ processes; and

wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for the communication with the second wireless communication device.
The method of claim 51, further comprising:

selecting a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first LDPC base graph used by the base station for the communicating with the first wireless communication device.
The method of claim 51, wherein the communicating with the first wireless communication device comprises:

coding data at the first coding rate to generate coded data; and

transmitting the coded data to the first wireless communication device.
The method of claim 51, wherein the communicating with the first wireless communication device comprises:

scheduling a data transmission by the first wireless communication device, wherein the data transmission is scheduled for coding at the first coding rate; and

receiving the data transmission from the first wireless communication device.
The method of claim 51, wherein the first wireless communication device is a wearable communication device or an Internet of Things (IoT) device.
A base station, comprising:

a transceiver;

a memory; and

a processor communicatively coupled to the transceiver and the memory, wherein the processor and the memory are configured to:

identify a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, select a first coding rate that is greater than or equal to a first minimum coding rate value, wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for communication with a second wireless communication device; and

communicate via the transceiver with the first wireless communication device using the first coding rate.
The base station of claim 60, wherein the second minimum coding rate value is 0.17.
The base station of claim 60, wherein the processor and the memory are further configured to:

select at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for the communication with the second wireless communication device.
The base station of claim 60, wherein the processor and the memory are further configured to:

select a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for the communication with the second wireless communication device.
The base station of claim 60, wherein the processor and the memory are further configured to:

select at least one hybrid automatic repeat request (HARQ) process for the communicating with the first wireless communication device;

wherein selecting the at least one HARQ process is based on a first maximum number of HARQ processes; and

wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for the communication with the second wireless communication device.
The base station of claim 60, wherein the processor and the memory are further configured to:

select a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first LDPC base graph used by the base station for the communicating with the first wireless communication device.
The base station of claim 60, wherein the processor and the memory are further configured to:

code data at the first coding rate to generate coded data; and

transmit the coded data to the first wireless communication device.
The base station of claim 60, wherein the processor and the memory are further configured to:

schedule a data transmission by the first wireless communication device, wherein the data transmission is scheduled for coding at the first coding rate; and

receive the data transmission from the first wireless communication device.
The base station of claim 60, wherein the first wireless communication device is a wearable communication device or an Internet of Things (IoT) device.
A base station, comprising:

means for identifying a data block size limit associated with a first wireless communication device;

means for selecting a first coding rate that is greater than or equal to a first minimum coding rate value after identifying the data block size limit associated with the first wireless communication device, wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for communication with a second wireless communication device; and

means for communicating with the first wireless communication device using the first coding rate.
An article of manufacture for use by a base station in a wireless communication network, the article comprising:

a computer-readable medium having stored therein instructions executable by one or more processors of the base station to:

identify a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, select a first coding rate that is greater than or equal to a first minimum coding rate value, wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for communication with a second wireless communication device; and

communicate with the first wireless communication device using the first coding rate.
A method of communication at a base station, the method comprising:

identifying a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, selecting a first number of hybrid automatic repeat request (HARQ) processes that is less than or equal to a first maximum number of HARQ processes, wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for communication with a second wireless communication device; and

communicating with the first wireless communication device using the first number of HARQ processes.
The method of claim 71, wherein the first maximum number of HARQ processes is 1, 2, 3, or 4.
The method of claim 71, wherein the second maximum number of HARQ processes is 16.
The method of claim 71, further comprising:

selecting at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for the communication with the second wireless communication device.
The method of claim 71, further comprising:

selecting a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for the communication with the second wireless communication device.
The method of claim 71, further comprising:

selecting a coding rate for the communicating with the first wireless communication device;

wherein selecting the coding rate is based on a first minimum coding rate value; and

wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.
The method of claim 71, further comprising:

selecting a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first LDPC base graph used by the base station for the communicating with the first wireless communication device.
The method of claim 71, wherein the communicating with the first wireless communication device comprises:

transmitting data to the first wireless communication device; and

using at most the first number of HARQ processes in conjunction with the transmitting of data to the first wireless communication device.
The method of claim 71, wherein the communicating with the first wireless communication device comprises:

scheduling a data transmission by the first wireless communication device, wherein the data transmission is scheduled to use at most the first number of HARQ processes; and

receiving the data transmission from the first wireless communication device.
The method of claim 71, wherein the first wireless communication device is a wearable communication device or an Internet of Things (IoT) device.
A base station, comprising:

a transceiver;

a memory; and

a processor communicatively coupled to the transceiver and the memory, wherein the processor and the memory are configured to:

identify a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, select a first number of hybrid automatic repeat request (HARQ) processes that is less than or equal to a first maximum number of HARQ processes, wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for communication with a second wireless communication device; and

communicate via the transceiver with the first wireless communication device using the first number of HARQ processes.
The base station of claim 81, wherein the first maximum number of HARQ processes is 1, 2, 3, or 4.
The base station of claim 81, wherein the second maximum number of HARQ processes is 16.
The base station of claim 81, wherein the processor and the memory are further configured to:

select at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for the communication with the second wireless communication device.
The base station of claim 81, wherein the processor and the memory are further configured to:

select a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for the communication with the second wireless communication device.
The base station of claim 81, wherein the processor and the memory are further configured to:

select a coding rate for the communicating with the first wireless communication device;

wherein selecting the coding rate is based on a first minimum coding rate value; and

wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.
The base station of claim 81, wherein the processor and the memory are further configured to:

select a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first LDPC base graph used by the base station for the communicating with the first wireless communication device.
The base station of claim 81, wherein the processor and the memory are further configured to:

transmit data to the first wireless communication device; and

use at most the first number of HARQ processes in conjunction with the transmitting of data to the first wireless communication device.
A base station, comprising:

means for identifying a data block size limit associated with a first wireless communication device;

means for selecting a first number of hybrid automatic repeat request (HARQ) processes that is less than or equal to a first maximum number of HARQ processes after identifying the data block size limit associated with the first wireless communication device, wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for communication with a second wireless communication device; and

means for communicating with the first wireless communication device using the first number of HARQ processes.
An article of manufacture for use by a base station in a wireless communication network, the article comprising:

a computer-readable medium having stored therein instructions executable by one or more processors of the base station to:

identify a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, select a first number of hybrid automatic repeat request (HARQ) processes that is less than or equal to a first maximum number of HARQ processes, wherein the first maximum number of HARQ processes is less than a second maximum number of HARQ processes used by the base station for communication with a second wireless communication device; and

communicate with the first wireless communication device using the first number of HARQ processes.
A method of communication at a base station, the method comprising:

identifying a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, selecting a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

communicating with the first wireless communication device using the transport block size.
The method of claim 91, wherein the maximum payload size is 3840 bits.
The method of claim 91, further comprising:

selecting at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation.
The method of claim 91, further comprising:

selecting a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph.
The method of claim 91, further comprising:

selecting a coding rate for the communicating with the first wireless communication device;

wherein selecting the coding rate is based on a first minimum coding rate value; and

wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.
The method of claim 91, further comprising:

selecting a coding rate for the communicating with the first wireless communication device;

wherein selecting the coding rate is based on a first minimum coding rate value; and

wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.
The method of claim 91, wherein the communicating with the first wireless communication device comprises:

providing data at the transport block size; and

transmitting the data to the first wireless communication device.
The method of claim 91, wherein the communicating with the first wireless communication device comprises:

scheduling a data transmission by the first wireless communication device, wherein the data transmission is scheduled based on the transport block size; and

receiving the data transmission from the first wireless communication device.
A base station, comprising:

a transceiver;

a memory; and

a processor communicatively coupled to the transceiver and the memory, wherein the processor and the memory are configured to:

identify a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, select a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

communicate via the transceiver with the first wireless communication device using the transport block size.
The base station of claim 99, wherein the maximum payload size is 3840 bits.
The base station of claim 99, wherein the processor and the memory are further configured to:

select at least one communication parameter so that a low density parity check (LDPC) base graph selection process selects a first LDPC base graph for an LDPC operation.
The base station of claim 99, wherein the processor and the memory are further configured to:

select a code block segmentation algorithm that only uses a first low density parity check (LDPC) base graph.
The base station of claim 99, wherein the processor and the memory are further configured to:

select a coding rate for the communicating with the first wireless communication device;

wherein selecting the coding rate is based on a first minimum coding rate value; and

wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.
The base station of claim 99, wherein the processor and the memory are further configured to:

select a coding rate for the communicating with the first wireless communication device;

wherein selecting the coding rate is based on a first minimum coding rate value; and

wherein the first minimum coding rate value is greater than a second minimum coding rate value used by the base station for the communication with the second wireless communication device.
The base station of claim 99, wherein the processor and the memory are further configured to:

provide data at the transport block size; and

transmit the data to the first wireless communication device.
The base station of claim 99, wherein the processor and the memory are further configured to:

schedule a data transmission by the first wireless communication device, wherein the data transmission is scheduled based on the transport block size; and

receive the data transmission from the first wireless communication device.
A base station, comprising:

means for identifying a data block size limit associated with a first wireless communication device;

means for selecting a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first low density parity check (LDPC) base graph after identifying the data block size limit associated with the first wireless communication device, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

means for communicating with the first wireless communication device using the transport block size.
An article of manufacture for use by a base station in a wireless communication network, the article comprising:

a computer-readable medium having stored therein instructions executable by one or more processors of the base station to:

identify a data block size limit associated with a first wireless communication device;

after identifying the data block size limit associated with the first wireless communication device, select a transport block size for the communicating with the first wireless communication device that is less than or equal to a maximum payload size associated with a first low density parity check (LDPC) base graph, wherein the first LDPC base graph is associated with a lower coding rate and/or a lower data block size than a second LDPC base graph used by the base station for communication with a second wireless communication device; and

communicate with the first wireless communication device using the transport block size.