Wireless transmission / reception unit, and method implemented in a wireless transmission / reception unit

Abstract

It is a device and a method. The device includes a transceiver and a processor that fix transport block-level vrc bits (bt) to a bt, select a vpbd base graph (gb) based on a code rate (tc) and bt size of the bt that includes bt-level vrc bits, determine a number of code blocks (bcs) for use in segmenting the bt that includes bt-level vrc bits depending on the selected vpbd gb, determine a unique bc size for each of the bcs based on the number of bcs, segment the bt that includes bt-level vrc bits in the bcs based on the number of bcs and bc size, pad zeros in the last bc of the bcs in the segmented bt, fix bc-level vrc bits to each bc in the segmented bt, encode each bc in the segmented bt using the selected vpbd base graph, and transmit the encoded bcs.

Description

106 WIRELESS TRANSMISSION / RECEPTION UNIT, AND METHOD IMPLEMENTED IN A WIRELESS TRANSMISSION / RECEPTION UNIT CROSS-REFERENCE TO RELATED APPLICATIONS

[001] This application claims the benefit of U.S. Provisional Patent Application No. 62 / 454,623, which was filed February 3, 2017; U.S. Provisional Patent Application No. 62 / 475,126, which was filed March 22, 2017; U.S. Provisional Patent Application No. 62 / 500,897, which was filed May 3, 2017; U.S. Provisional Patent Application No. 62 / 519,671, which was filed June 14, 2017; U.S. Provisional Patent Application No. 62 / 543,033, which was filed August 9, 2017; US provisional patent application No. 62 / 556,079, which was filed on September 8, 2017; and US provisional patent application No. 62 / 565,716, which was filed on September 29, 2017; the contents of which are incorporated herein by reference. SUMMARY

[002] This is an apparatus and method. The apparatus includes a transceiver and a processor that fix transport block (BT) level VRC bits to a BT, select a VPBD base graph (GB) based on a code rate (TC) and BT size of the BT that includes BT level VRC bits, determine a number of code blocks (BCs) for use in BT segmentation that includes BT level VRC bits depending on the selected VPBD GB, determine a unique BC size for each of the BCs based on the number of BCs, segment the BT that includes BT level VRC bits in the BCs based on the number of BCs and BC size, pad zeros in a last BC of the BCs in the segmented BT, fix BC level VRC bits to each BC in the segmented BT, encode each BC in the segmented BT using the selected VPBD base graph, and transmit the encoded BCs. Petition 870190085317, dated 08 / 30 / 2019, p. 11 / 18 / 106 BRIEF DESCRIPTION OF THE DRAWINGS

[003] A more detailed understanding can be obtained from the following description, given by way of example in conjunction with the attached drawings, where similar reference numbers in the Figures indicate similar elements, and where: Figure 1A is a system diagram illustrating an exemplary communications system in which one or more disclosed modalities can be implemented; Figure 1B is a system diagram illustrating an exemplary wireless transmit / receive unit (WTU) that can be used in the communications system illustrated in Figure 1A according to one embodiment; Figure 1C is a system diagram illustrating an exemplary radio access network (RAN) and an exemplary core network (CN) that can be used in the communications system illustrated in Figure 1A according to one modality; Figure 1D is a system diagram illustrating an exemplary additional RAN and an exemplary additional CN that can be used in the communications system illustrated in Figure 1A according to one embodiment; Figure 2 is a flow diagram of an exemplary method for encoding and signaling long-term evolution (LTE) data channels; Figure 3 is a diagram of an exemplary protomatrix; Figure 4A is a flow diagram of an exemplary transport block (BT) processing method for a data channel using quasi-cyclic VPBD codes (VPBD-QC); Petition 870190085290, dated 08 / 30 / 2019, p. 8 / 150 / 106 Figure 4B is a flow diagram of another exemplifying method of BT processing for a data channel using VPBD-QC codes; Figure 5 is a diagram of an example of code block (BC) generation with equal partitioning of a BT that includes a BT-level cyclic redundancy check (CRC); Figure 6 is a diagram of another example of BC generation with equal partitioning of the BT that includes BT-level VRC; Figure 7 is a diagram of an example of BC generation with equal BT partitioning that includes BT-level VRC to adjust supported information block sizes; Figure 8 is a diagram of four coverage regions defined in terms of code rate (CR) and information bit size that may or may not be supported by a base-1 graph and a base-2 graph; Figure 9 is a graph that provides a performance comparison between the base-1 graph and the base-2 graph with TC 1 / 3, where the base-1 graph has fewer bits of payload than the base-2 graph; Figure 10 is a graph that provides a performance comparison between the base-1 graph and the base-2 graph with TC 2 / 3, where the base-1 graph has fewer bits of payload than the base-2 graph; Figure 11 is a graph that provides a performance comparison between the base-1 graph and the base-2 graph with TC 1 / 3, where the base-1 graph is selected with a 160-bit load and the base-2 graph is selected with two segmentations and zero bits of load; Figure 12 is a diagram of an exemplary double circular temporary storage for rate matching and request. Petition 870190085290, dated 08 / 30 / 2019, page 9 / 150 / 106 hybrid automatic repetition (SRAH); Figure 13 is a diagram of an example method for bit selection using multiple circular temporary stores; Figure 14 is a diagram of a structured VPBD base graph to support VPBD codes in a rate range (lowest rate, highest rate) for use with multiple circular temporary stores; Figure 15 is a diagram of an example baseline chart for use with a single circular temporary storage; Figure 16 is a diagram showing exemplary fixed starting locations with four redundancy versions (VRs) (N maxVR=4) for a scheme in which corresponding VR starting points are evenly distributed across temporary storage, a scheme in which VR starting points are evenly distributed across parity bits, and a scheme in which VR starting points are evenly distributed across parity bits P2; Figure 17 is a flow diagram of an exemplary VPBD coding procedure with interleaving; Figure 18A is a flow diagram of an example method for processing BT for a data channel using VPBD-QC codes with a code block group (GBC) level VRC; Figure 18B is a flow diagram of another example method of BT processing for a data channel using VPBD-QC codes with GBC-level VRC; Figure 19 is a diagram of an example of a two-level GBC; Figure 20 is a flow diagram of a method. Petition 870190085290, dated 08 / 30 / 2019, p. 10 / 150 / 106, exemplifies the selection of a protographic matrix (protomatrix) for a specific UTRSF in an eNB, where the eNB is equipped with UTRSF category information; Figure 21 is a flow diagram of another exemplifying method for selecting a protographic matrix for a specific UTRSF in an eNB, where the eNB is equipped with UTRSF capacity information; Figure 22 is a signal diagram of the exemplary signaling for a bit-based GBC indication and associated ACK / NACK feedback; Figure 23 is a signal diagram of the exemplary signaling for a real GBC number and feedback of ACK / NACK associated; Figures 24A, 24B, 24C and 24D are diagrams of an example of GBC-level ACK / NACK feedback and retransmission assisted by BT-level negative acknowledgment / acknowledgment (ACK / NACK); Figures 25A, 25B, 25C and 25D are diagrams of another example of GBC-level ACK / NACK feedback and retransmission assisted by BT-level ACK / NACK based on the example in Figures 24A, 24B, 24C and 24D; Figure 26 is a signal diagram of an exemplary message exchange for UTRSF capability with supported decoding algorithms; Figure 27 is a diagram of an exemplary symbol-level row-column interleaver; and Figure 28 is a diagram of an exemplary symbol-level row-column interleaver with retransmission scrambling. Petition 870190085290, dated 08 / 30 / 2019, page 11 / 150 / 106 DETAILED DESCRIPTION

[004] Figure 1A is a diagram illustrating an exemplary communications system 100 in which one or more disclosed modalities may be implemented. The communications system 100 may be a multiple access system that provides content, such as voice, data, video, messaging, broadcasting, etc., to multiple wireless users. The communications system 100 may enable multiple wireless users to access this content through the sharing of system resources, including wireless bandwidth.For example, communication systems 100 may employ one or more channel access methods, such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal frequency division multiple access (OFDMA), single-carrier frequency division multiple access (SC-FDMA), zero-tail unique-word discrete sine transform spread orthogonal frequency division multiplexing (ZT UW DTS-s OFDM), unique-word orthogonal frequency division multiplexing (UW-OFDM), feature block filtered OFDM, filter bank multicarrier (FBMC), and the like.

[005] As shown in Figure 1A, the communications system 100 may include wireless transmit / receive units (WRULDs) 102a, 102b, 102c, 102d, a radio access network (RAN) 104 / 113, a core network (CN) 106 / 115, a public switched telephone network (PSTN) 108, the Internet 110 and other networks 112, although consideration should be given to Petition 870190085290, dated 08 / 30 / 2019, page 12 / 150 / 106, states that the disclosed modalities encompass any number of UTRSFs, base stations, networks, and / or network elements. Each of the UTRSFs 102a, 102b, 102c, 102d can be any type of device configured to operate and / or communicate in a wireless environment. For example, UTRSFs 102a, 102b, 102c, 102d, any of which can be called a station and / or a STA, can be configured to transmit and / or receive wireless signals and can include a user equipment (UE), a mobile station, a fixed or mobile subscriber unit, a subscription-based unit, a pager, a mobile phone, a personal digital assistant (PDA), a smartphone, a laptop, a netbook, a personal computer, a wireless sensor, an access point or Mi-Fi device, an Internet of Things (IoT) device,A wristwatch or other device to be worn close to the body, a virtual reality headset (HMD head-mounted display), a carrier, a drone, a medical device and applications (e.g., remote surgery), an industrial device and applications (e.g., a robot and / or other wireless devices operating in an industrial and / or automated processing chain context), a consumer electronic device, a device operating on commercial and / or industrial wireless networks, and similar devices. Any of the UTRSFs 102a, 102b, 102c, and 102d may be referred to interchangeably as EU.

[006] Communication systems 100 may also include a base station 114a and / or a base station 114b. Each of the base stations 114a, 114b may be any type of device configured to wirelessly interface with at least one of the UTRSFs 102a, 102b, 102c, 102d to facilitate access to one or more communication networks, such as CN 106 / 115, the Internet 110 and / or other networks 112. By way of example, base stations 114a, 114b may be a base transceiver (BTS), a B node, an evolved B node (eNodeB), a source B node, Petition 870190085290, dated 08 / 30 / 2019, p. 13 / 150 / 106 an originating eNodeB, a gNB, a new radio (NR) NodeB, a site controller, an access point (AP), a wireless router, and similar devices. Although each of the 114a, 114b base stations is shown as a single element, it should be considered that the 114a, 114b base stations may include any number of interconnected base stations and / or network elements.

[007] Base station 114a may be part of RAN 104 / 113, which may also include other base stations and / or network elements (not shown), such as a base station controller (BSC), a radio network controller (RNC), relay nodes, etc. Base station 114a and / or base station 114b may be configured to transmit and / or receive wireless signals on one or more carrier frequencies, which may be called a cell (not shown). These frequencies may be in licensed spectrum, unlicensed spectrum, or a combination of licensed and unlicensed spectrum. A cell may provide coverage for a wireless service to a specific geographic area that may be relatively fixed or that may change over time. The cell may also be divided into cell sectors. For example, the cell associated with base station 114a may be divided into three sectors.Thus, in one embodiment, base station 114a may include three transceivers, that is, one for each sector of the cell. In another embodiment, base station 114a may employ multiple-input multiple-output (MIMO) technology and may use multiple transceivers for each sector of the cell. For example, beamforming may be used to transmit and / or receive signals in desired spatial directions.

[008] Base stations 114a, 114b can communicate with one or more of the UTRSFs 102a, 102b, 102c, 102d through an air interface 116, which can be any suitable wireless communication link. Petition 870190085290, dated 08 / 30 / 2019, p. 14 / 150 / 106 (e.g., radio frequency (RF), microwave, centimeter wave, micrometer wave, infrared (IR), ultraviolet (UV), visible light, etc.). The 116 air interface can be established through the use of any suitable radio access technology (RAT).

[009] More specifically, as indicated above, communications system 100 may be a multiple access system and may employ one or more channel access schemes, such as CDMA, TDMA, FDMA, OFDMA, SC-FDMA and the like. For example, base station 114a in RAN 104 / 113 and UTRSFs 102a, 102b, 102c may implement a radio technology such as the Universal Mobile Telecommunications System (UMTS), Universal Terrestrial Radio Access (UTRA) which may establish the air interface 115 / 116 / 117 by using Wideband CDMA (WCDMA). WCDMA may include communication protocols such as High-Speed ​​Packet Access (HSPA) and / or evolved HSPA (HSPA+).HSPA can include High-Speed ​​Downlink Packet Access (HSDPA) and / or High-Speed ​​Uplink Packet Access (HSUPA).

[0010] In one embodiment, base station 114a and UTRSFs 102a, 102b, 102c may implement a radio technology, such as evolved UMTS terrestrial radio access (E-UTRA), which may establish the air interface 116 by means of the use of Long Term Evolution (LTE) and / or LTE Advanced (LTE-A) and / or LTE Advanced Pro (LTE-A Pro).

[0011] In one embodiment, base station 114a and UTRSFs 102a, 102b, 102c can implement a radio technology, such as NR radio access, which can establish the 116 air interface using New Radio (NR) technology. Petition 870190085290, dated 08 / 30 / 2019, page 15 / 150 / 106

[0012] In one embodiment, base station 114a and UTRSFs 102a, 102b, 102c can implement multiple radio access technologies. For example, base station 114a and UTRSFs 102a, 102b, 102c can implement LTE radio access and NR radio access together, for example, using dual connectivity (DC) principles. In this way, the air interface used by UTRSFs 102a, 102b, 102c can be characterized by multiple types of radio access technologies and / or transmissions sent to / from multiple types of base stations (e.g., an eNB and a gNB).

[0013] In other embodiments, base station 114a and UTRSFs 102a, 102b, 102c may implement radio technologies such as IEEE 802.11 (i.e., Wireless Fidelity (WiFi)), IEEE 802.16 (i.e., Worldwide Interoperability for Microwave Access (WiMAX Worldwide Interoperability for Microwave Access)), CDMA2000, CDMA2000 1X, CDMA2000 EV-DO, Interim Standard 2000 (IS-2000), Interim Standard 95 (IS-95), Interim Standard 856 (IS-856), Global System for Mobile Communications (GSM), Enhanced Data Rates for GSM Evolution (EDGE), GSM EDGE (GERAN) and similar.

[0014] Base station 114b in Figure 1A can be a wireless router, a source node B, a source eNodeB, or a connection point, for example, and can use any suitable RAT (Radio Access Technology) to facilitate wireless connectivity in a localized area, such as a workplace, a residence, a carrier, a campus, an industrial facility, an air corridor (e.g., for use by drones), a highway, and the like. In one embodiment, base station 114b and UTRSFs 102c, 102d can implement a radio technology, such as IEEE 802.11, to establish an area network. Petition 870190085290, dated 08 / 30 / 2019, page 16 / 150 / 106 wireless local area network (WLAN). In one embodiment, base station 114b and UTRSFs 102c, 102d can implement a radio technology, such as IEEE 802.15, to establish a wireless personal area network (WPAN). In yet another embodiment, base station 114b and UTRSFs 102c, 102d can use a cellular-based RAT (e.g., WCDMA, CDMA2000, GSM, LTE, LTE-A, LTE-A Pro, NR, etc.) to establish a picocell or femtocell. As shown in Figure 1A, base station 114b can have a direct connection to Internet 110. Therefore, base station 114b may not be necessary to access Internet 110 via CN 106 / 115.

[0015] RAN 104 / 113 may be in communication with CN 106 / 115, which may be any type of network configured to provide voice, data, applications, and / or Voice over Internet Protocol (VoIP) services to one or more of the UTRSFs 102a, 102b, 102c, 102d. The data may have varying Quality of Service (QoS) requirements, such as different processing capacity requirements, latency requirements, error tolerance requirements, reliability requirements, data processing capacity requirements, mobility requirements, and the like. CN 106 / 115 may provide call control, billing services, location-based mobile services, prepaid calling, internet connectivity, video distribution, etc., and / or perform high-level security functions such as user authentication.Although not shown in Figure 1A, it should be considered that RAN 104 / 113 and / or CN 106 / 115 may be in direct or indirect communication with other RANs that employ the same RAT, such as RAN 104 / 113, or a different RAT. For example, in addition to being connected to RAN 104 / 113, which may use NR radio technology, CN 106 / 115 may also be in communication with another RAN (not shown) that employs a different technology. Petition 870190085290, dated 08 / 30 / 2019, p. 17 / 150 / 106 GSM, UMTS, CDMA 2000, WiMAX, E-UTRA or WiFi radio.

[0016] CN 106 / 115 can also serve as a communication gateway for UTRSFs 102a, 102b, 102c, 102d to access the PSTN (Public Switched Telephone Network) 108, the Internet 110, and / or other networks 112. The PSTN 108 may include circuit-switched telephone networks that provide conventional telephone service (POTS - Plain Old Telephone Service). The Internet 110 may include a global system of interconnected computer networks and devices that use common communication protocols, such as the Transmission Control Protocol (TCP), the User Datagram Protocol (UDP), and the Internet Protocol (IP) in the TCP / IP Internet protocol suite. 112 networks may include wired and / or wireless communication networks owned by, and / or operated by, other service providers.For example, 112 networks may include another CN connected to one or more RANs, which may employ the same RAT, such as RAN 104 / 113, or a different RAT.

[0017] Some or all of the UTRSFs 102a, 102b, 102c, 102d in communications system 100 may include multi-mode capabilities (for example, UTRSFs 102a, 102b, 102c, 102d may include multiple transceivers for communication with different wireless networks over different wireless links). For example, UTRSF 102c shown in Figure 1A may be configured to communicate with base station 114a, which may employ cellular-based radio technology, and with base station 114b, which may employ IEEE 802 radio technology.

[0018] Figure 1B is a system diagram illustrating an example of a UTRSF 102. As shown in Figure 1B, the UTRSF 102 may include a processor 118, a transceiver 120, a transmit / receive element 122, a speaker / microphone 124, and a keyboard. Petition 870190085290, dated 08 / 30 / 2019, p. 18 / 150 / 106 numeric 126, a monitor / touchpad 128, a non-removable memory 130, a removable memory 132, a power supply 134, a Global Positioning System (GPS) chipset 136 and / or other peripherals 138, among others. It will be recognized that UTRSF 102 may include any subcombination of the aforementioned elements while remaining consistent with an embodiment.

[0019] Processor 118 may be a general-purpose processor, a special-purpose processor, a conventional processor, a digital signal processor (PSD), a plurality of microprocessors, one or more microprocessors in association with a PSD core, a controller, a microcontroller, application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), any other type of integrated circuit (IC), a state machine, and the like. Processor 118 may perform signal encoding, data processing, power control, input / output processing, and / or any other functionality that enables UTRSF 102 to operate in a wireless environment. Processor 118 may be coupled to transceiver 120, which may be coupled to transmit / receive element 122.Although Figure 1B depicts processor 118 and transceiver 120 as separate components, it will be recognized that processor 118 and transceiver 120 can be integrated together in an electronic package or electronic circuit.

[0020] The transmit / receive element 122 can be configured to transmit signals to, or receive signals from, a base station (for example, base station 114a) via the air interface 116. For example, in one embodiment, the transmit / receive element 122 can be an antenna configured to transmit and / or receive RF signals. In another embodiment, the transmit / receive element 122 can be a transmitter / detector. Petition 870190085290, dated 08 / 30 / 2019, page 19 / 150 / 106 configured to transmit and / or receive IR, UV or visible light signals, for example. In yet another embodiment, the transmitting / receiving element 122 can be configured to transmit and / or receive both RF and light signals. It will be recognized that the transmitting / receiving element 122 can be configured to transmit and / or receive any combination of wireless signals.

[0021] Although the transmit / receive element 122 is represented in Figure 1B as a single element, the UTRSF 102 can include any number of transmit / receive elements 122. More specifically, the UTRSF 102 can employ MIMO technology. Thus, in one embodiment, the UTRSF 102 can include two or more transmit / receive elements 122 (e.g., multiple antennas) to transmit and receive wireless signals over the air interface 116.

[0022] Transceiver 120 can be configured to modulate signals intended to be transmitted by transmit / receive element 122, and to demodulate signals received by transmit / receive element 122. As indicated above, UTRSF 102 can have multimode capabilities. Thus, transceiver 120 can include multiple transceivers to enable UTRSF 102 to communicate via multiple RATs, such as NR and IEEE 802.11, for example.

[0023] The UTRSF 102 processor 118 can be coupled to the speaker / microphone 124, the numeric keypad 126 and / or the monitor / touchpad 128 (for example, a liquid crystal display (LCD) or an organic light-emitting diode (OLED) display), and can receive user input from them. The processor 118 can also output user data to the speaker / microphone 124, the keypad 126 and / or the monitor / touchpad 128. In addition, the processor 118 can access information from, and store data in, any type of Petition 870190085290, dated 08 / 30 / 2019, page 20 / 150 / 106 suitable memory, such as non-removable memory 130 and / or removable memory 132. Non-removable memory 130 may include random access memory (RAM), read-only memory (ROM), a hard disk, or any other type of memory storage device. Removable memory 132 may include a subscriber identity module (SIM) card, a memory card, a secure digital memory card (SD), and the like. In other embodiments, the processor 118 may access information from, and store data in, memory that is not physically located in UTRSF 102, such as in a server or a home computer (not shown).

[0024] Processor 118 can receive power from power source 134, and can be configured to distribute and / or control power to the other components in UTRSF 102. Power source 134 can be any device suitable for powering UTRSF 102. For example, power source 134 can include one or more dry cell batteries (e.g., nickel-cadmium (NiCd), nickel-zinc (NiZn), nickel-metal hydride (NiMH), lithium-ion (Li-ion), etc.), solar cells, fuel cells, and the like.

[0025] Processor 118 can also be coupled to GPS chipset 136, which can be configured to provide location information (e.g., longitude and latitude) regarding the current location of UTRSF 102. In addition to, or instead of, information from the GPS 136 electronic circuitry, UTRSF 102 can receive location information via the air interface 116 from a base station (e.g., base stations 114a, 114b) and / or determine its location based on the timing of signals received from two or more nearby base stations. It should be considered that UTRSF 102 can capture location information by any suitable location determination method and still remain compatible with a mode. Petition 870190085290, dated 08 / 30 / 2019, page 21 / 150 / 106

[0026] The processor 118 may also be coupled with other peripherals 138, which may include one or more software and / or hardware modules that provide additional wireless or wired features, functionality and / or connectivity. For example, peripherals 138 may include an accelerometer, an electronic compass, a satellite transceiver, a digital camera (for photographs and / or video), a Universal Serial Bus (USB) port, a vibration device, a television transceiver, a hands-free headset, a Bluetooth® module, a frequency modulated (FM) radio unit, a digital music player, a media player, a video game player module, an internet browser, a virtual reality and / or augmented reality (VR / AR) device, an activity tracker and the like.Peripherals 138 may include one or more sensors, the sensors may be one or more of the following: a gyroscope, an accelerometer, a hall effect sensor, a magnetometer, an orientation sensor, a proximity sensor, a temperature sensor, a time sensor; a geolocation sensor; an altimeter, a light sensor, a touch sensor, a magnetometer, a barometer, a gesture sensor, a biometric sensor and / or a humidity sensor.

[0027] The UTRSF 102 may include a full duplex radio for which the transmission and reception of some or all of the signals (e.g., associated with a given UL subframe (e.g., for transmission) and downlink (e.g., for reception) may be concurrent and / or simultaneous. The full duplex radio may include an interference management unit and 139 substantially reduce or eliminate self-interference through hardware (e.g., a shutter) or signal processing via a processor (e.g., a separate processor (not shown) or via processor 118). In one embodiment, the UTRSF 102 may include Petition 870190085290, dated 08 / 30 / 2019, p. 22 / 150 / 106 a half-duplex radio for which transmission and reception of some or all signals (e.g., associated with specific subframes for the UL (e.g., for transmission) or for the downlink (e.g., for reception)).

[0028] Figure 1C is a system diagram illustrating RAN 104 and CN 106 according to one mode. As noted above, RAN 104 can employ E-UTRA radio technology to communicate with UTRSFs 102a, 102b, 102c via air interface 116. RAN 104 can also be in communication with CN 106.

[0029] RAN 104 may include eNodeBs 160a, 160b, 160c, although it should be considered that RAN 104 may include any number of eNodeBs and still remain consistent with a mode. Each of the eNodeBs 160a, 160b, 160c may include one or more transceivers for communication with the UTRSFs 102a, 102b, 102c via the air interface 116. In a mode, the eNodeBs 160a, 160b, 160c may implement MIMO technology. Thus, eNodeB 160a, for example, may use multiple antennas to transmit and / or receive wireless signals from UTRSF 102a.

[0030] Each of the eNodeBs 160a, 160b, 160c can be associated with a specific cell (not shown) and can be configured to handle radio resource management decisions, automatic changeover decisions, user scheduling in the UL and / or DL, and similar tasks. As shown in Figure 1C, the eNodeBs 160a, 160b, 160c can communicate with each other via an X2 interface.

[0031] The CN 106 shown in Figure 1C may include a mobility management entity (MME) 162, a server communication port (SGW) 164, and a packet data network (PDN) (or PDG) communication port 166. Although each of the aforementioned elements is shown as part of CN 106, it should be considered that any of these elements may belong to Petition 870190085290, dated 08 / 30 / 2019, page 23 / 150 / 106 and / or be operated by an entity other than the CN operator.

[0032] MME 162 can be connected to each of the eNodeBs 162a, 162b, 162c in RAN 104 via an S1 interface, and can serve as a control node. For example, MME 162 can be responsible for authenticating users of UTRSFs 102a, 102b, 102c, for activating / deactivating the carrier, for selecting a specific server communication port during an initial connection of UTRSFs 102a, 102b, 102c and similar. MME 162 can provide a control plane function for switching between RAN 104 and other RANs (not shown) that employ other radio technologies, such as GSM or WCDMA.

[0033] The SGW 164 can be connected to each of the eNodeBs 160a, 160b, 160c in RAN 104 via the S1 interface. The SWH 164 can generally route and forward user data packets destined for / from the UTRSFs 102a, 102b, 102c. The SGW 164 can perform other functions, such as anchoring user planes during automatic changes between eNodeBs, initiating paging when DL data is available for the UTRSFs 102a, 102b, 102c, managing and storing the contexts of the UTRSFs 102a, 102b, 102c and similar.

[0034] SGW 164 can be connected to PGW 166, which can provide UTRSFs 102a, 102b, 102c with access to packet-switched networks, such as the Internet 110, to facilitate communications between UTRSFs 102a, 102b, 102c and IP-enabled devices.

[0035] CN 106 can facilitate communications with other networks. For example, CN 106 can provide UTRSFs 102a, 102b, 102c with access to circuit-switched networks, such as PSTN 108, to facilitate communications between UTRSFs 102a, 102b, 102c and traditional terrestrial communications devices. For example, CN 106 can include, or communicate with, an IP communication port (e.g., an IP multimedia subsystem (IMS) server). Petition 870190085290, dated 08 / 30 / 2019, p. 24 / 150 / 106, which serves as an interface between CN 106 and PSTN 108. Furthermore, CN 106 can provide UTRSFs 102a, 102b, and 102c with access to 112 networks, which may include other wired and / or wireless networks owned and / or operated by other service providers.

[0036] Although the UTRSF is described in Figures 1A to 1D as a wireless terminal, it is contemplated that, in certain representative embodiments, such a terminal may use (for example, temporarily or permanently) wired communication interfaces with the communication network.

[0037] In representative modalities, the other 112 network can be a WLAN.

[0038] A WLAN in Basic Services Set (BSS) mode can have one access point (AP) to the BSS and one or more stations (STAs) associated with the AP. The AP may have access to, or an interface with, a distribution system (DS) or other type of wired / wireless network that carries traffic into and / or out of the BSS. Traffic to STAs originating outside a BSS can arrive through the AP and be delivered to the STAs. Traffic from STAs to destinations outside the BSS can be sent to the AP for delivery to the respective destinations. Traffic between STAs within the BSS can be sent through the AP, for example, where the originating STA can send traffic to the AP and the AP can deliver the traffic to the destination STA. Traffic between STAs within a BSS can be considered and / or referred to as point-to-point traffic.Point-to-point traffic can be sent between (e.g., directly between) the source and destination STAs with a Direct Link System (DLS) configuration. In certain representative modes, the DLS may use an 802.11e DLS or an 802.11z Tunneled DLS (TDLS). A WLAN using an independent BSS (IBSS) mode may not have an AP, and the STAs (e.g., all STAs) within or using IBSS may communicate directly with each other. The IBSS communication mode. Petition 870190085290, dated 08 / 30 / 2019, p. 25 / 150 / 106, may be referred to in some instances in this document as an ad hoc communication.

[0039] When using the 802.11ac operating mode or a similar operating mode of 802.11ac infrastructure, the AP can transmit a signal on a fixed channel, such as a primary channel. The primary channel can have a fixed width (e.g., 20 MHz bandwidth) or a dynamically defined width through signaling. The primary channel can be the BSS's operating channel and can be used by STAs to establish a connection with the AP. In certain representative embodiments, carrier-sensing multiple access with collision avoidance (CSMA / CA) can be implemented, for example, in 802.11 systems. For CSMA / CA, STAs (e.g., each STA), including the AP, can detect the primary channel. If the primary channel is detected and / or determined / detected as being occupied by a particular STA, that specific STA can back off. An STA (e.g., only one station) can transmit at any given time on a given BSS.

[0040] High-capacity processing (HT) STAs can use a 40 MHz wide channel for communication, for example, by combining the primary 20 MHz channel with an adjacent or non-adjacent 20 MHz channel to form a 40 MHz wide channel.

[0041] Very high processing capacity (VHT) STAs can support channels of 20 MHz, 40 MHz, 80 MHz and / or 160 MHz width. 40 MHz and / or 80 MHz channels can be formed, for example, by combining contiguous 20 MHz channels. A 160 MHz channel can be formed, for example, by combining eight contiguous 20 MHz channels or by combining two non-contiguous 80 MHz channels, which can be called an 80+80 configuration. For the 80+80 configuration, the data, after channel encoding, can be passed through a segment analyzer that can split the data into two streams. The Petition 870190085290, dated 08 / 30 / 2019, page 26 / 150 / 106 Inverse Fast Fourier Transform (IFFT) processing and time-domain processing can be performed on each stream separately. The streams can be mapped to the two 80 MHz channels, and the data can be transmitted by a transmit STA. At the receiver of the receive STA, the operation described above for the 80+80 configuration can be reversed, and the combined data can be sent to the medium access control (MAC).

[0042] Sub-1 GHz operating modes are supported by 802.11af and 802.11ah. Channel operating bandwidths and carriers are reduced in 802.11af and 802.11ah compared to those used in 802.11n and 802.11ac. 802.11af supports bandwidths of 5 MHz, 10 MHz, and 20 MHz in the TV white space spectrum (TVWS), and 802.11ah supports bandwidths of 1 MHz, 2 MHz, 4 MHz, 8 MHz, and 16 MHz using spectrum other than TVWS. According to a representative embodiment, 802.11ah can support meter-type control / machine-type communications, such as MTC devices in a macro coverage area. MTC devices may have certain capabilities, for example, limited features that include support (e.g., support only for) and / or specific limited bandwidths. MTC devices may include a battery with a battery life above a threshold (e.g., to maintain a long battery life).

[0043] WLAN systems, which can support multiple channels and channel bandwidths, such as 802.11n, 802.11ac, 802.11af, and 802.11ah, include a channel that can be designated as the primary channel. The primary channel may have, for example, a bandwidth equal to the highest common operational bandwidth supported by all STAs in the BSS. The bandwidth of the primary channel can be defined and / or limited by an STA, among all STAs operating in a BSS, that supports the lowest bandwidth operating mode. In the 802.11ah example, the primary channel Petition 870190085290, dated 08 / 30 / 2019, p. 27 / 150 / 106, may be 1 MHz wide for STAs (e.g., MTC-type devices) that support (e.g., only support) a 1 MHz mode, even if the AP and other STAs in BSS mode support 2 MHz, 4 MHz, 8 MHz, 16 MHz, and / or other channel bandwidth operating modes. Carrier Sense and / or Network Allocation Vector (NAV) settings may depend on the primary channel state. If the primary channel is busy, for example, due to an STA (that only supports a 1 MHz operating mode) transmitting to the AP, all available frequency bands may be considered busy even if most frequency bands remain idle and may be available.

[0044] In the United States, the available frequency bands that can be used by 802.11ah are from 902 MHz to 928 MHz. In Korea, the available frequency bands are from 917.5 MHz to 923.5 MHz. In Japan, the available frequency bands are from 916.5 MHz to 927.5 MHz. For example, the total bandwidth available for 802.11ah is from 6 MHz to 26 MHz, depending on the country code.

[0045] Figure 1D is a system diagram illustrating RAN 113 and CN 115 according to a modality. As noted above, RAN 113 can employ NR radio technology to communicate with UTRSFs 102a, 102b, 102c via air interface 116. RAN 113 can also be in communication with CN 115.

[0046] RAN 113 may include gNBs 180a, 180b, 180c, although it should be considered that RAN 113 may include any number of gNBs and still remain consistent with a mode. gNBs 180a, 180b, 180c may include one or more transceivers for communication with UTRSFs 102a, 102b, 102c via the 116 air interface. In some modes, gNBs 180a, 180b, 180c may implement MIMO technology. For example, gNBs 180a, 102b may use beamforming to Petition 870190085290, dated 08 / 30 / 2019, p. 28 / 150 / 106 transmit signals to and / or receive signals from gNBs 180a, 180b, 180C. Thus, gNBs 180a, for example, can use multiple antennas to transmit wireless signals and / or receive wireless signals from UTRSF 102a. In one embodiment, gNBs 180a, 180b, and 180c can implement carrier aggregation technology. For example, gNB 180a can transmit carriers of multiple components to UTRSF 102a (not shown). A subset of these component carriers may be in the unlicensed spectrum while the remaining component carriers may be in the licensed spectrum. In one embodiment, gNBs 180a, 180b, and 180c can implement coordinated multipoint (CoMP) technology. For example, UTRSF 102a can receive coordinated transmissions from gNB 180a and gNB 180b (and / or gNB 180C).

[0047] UTRSFs 102a, 102b, 102c can communicate with gNBs 180a, 180b, 180c using transmissions associated with scalable numerology. For example, OFDM symbol spacing and / or OFDM subcarrier spacing can vary for different transmissions, different cells, and / or different portions of the wireless transmission spectrum. UTRSFs 102a, 102b, 102c can communicate with gNBs 180a, 180b, 180c using scalable time intervals (TTIs) of various lengths (e.g., containing a variable number of OFDM symbols and / or variable absolute time durations).

[0048] gNBs 180a, 180b, and 180c can be configured to communicate with UTRSFs 102a, 102b, and 102c in a standalone and / or non-standalone configuration. In the standalone configuration, UTRSFs 102a, 102b, and 102c can communicate with gNBs 180a, 180b, and 180c without also accessing other RANs (e.g., eNode-Bs 160a, 160b, and 160c). In the standalone configuration, UTRSFs 102a, 102b, and 102c can use one or more of gNBs 180a, 180b, and 180c as an anchor point. Petition 870190085290, dated 08 / 30 / 2019, page 29 / 150 / 106 regarding mobility. In a standalone configuration, UTRSFs 102a, 102b, and 102c can communicate with gNBs 180a, 180b, and 180c using signals in an unlicensed band. In a non-standalone configuration, UTRSFs 102a, 102b, and 102c can communicate with / connect to gNBs 180a, 180b, and 180c while also communicating with / connecting to other RANs such as eNode-Bs 160a, 160b, and 160C. For example, UTRSFs 102a, 102b, 102c can implement DC principles to communicate with one or more gNBs 180a, 180b, 180c and one or more eNode-Bs 160a, 160b, 160c in a substantially simultaneous manner. In a non-autonomous configuration, eNode-Bs 160a, 160b, 160c can serve as a mobility anchor for UTRSFs 102a, 102b, 102c, and gNBs 180a, 180b, 180c can provide additional coverage and / or processing capacity for maintaining UTRSFs 102a, 102b, 102c.

[0049] Each of the gNBs 180a, 180b, 180c can be associated with a particular cell (not shown) and can be configured to support radio resource management decisions, delivery decisions, user scheduling in UL and / or DL, network slicing support, dual links, number interconnection and E-UTRA, user plane data routing to user plane function (UPF) 184a, 184b, control plane information routing to access and mobility management (AMF) function 182a, 182b, and the like. As shown in Figure 1D, the gNBs 180a, 180b, 180c can communicate with each other via an Xn interface.

[0050] The CN 115 shown in Figure 1D may include at least one AMF 182a, 182b, at least one UPF 184a, 184b, at least one session management function (SMF) 183a, 183b, and possibly a data network (DN) 185a, 185b. Although each of the aforementioned elements is shown as part of CN 115, it should be considered that any of these elements may belong to and / or be operated by an entity. Petition 870190085290, dated 08 / 30 / 2019, page 30 / 150 / 106 different from the CN operator.

[0051] AMF 182a, 182b can be connected to each of the gNBs 180a, 180b, 180c in RAN 113 via an N2 interface, and can serve as a control node. For example, AMF 182a, 182b can be responsible for authenticating users of UTRSFs 102a, 102b, 102c, supporting network splitting (e.g., handling different PDU sessions with different requirements), selecting an SMF 183a, 183b, register area management, NAS signaling termination, mobility management, and the like. Network division can be used by AMF 182a, 182b to customize CN support for UTRSFs 102a, 102b, 102c based on the types of services used by UTRSFs 102a, 102b, 102c.For example, different network slices can be established for different use cases such as services that rely on ultra-reliable low-latency access (URLLC), services that rely on mass mobile broadband access (eMBB), services for machine-type communication (MTC) access, and / or similar services. AMF 162 can provide a control plane function to switch between RAN 113 and other RANs (not shown) that employ other radio technologies such as LTE, LTE-A, LTE-A Pro, and / or non-3GPP access technologies such as WiFi.

[0052] SMF 183a, 183b can be connected to AMF 182a, 182b on CN 115 via an N11 interface. SMF 183a, 183b can also be connected to UPF 184a, 184b on CN 115 via an N4 interface. SMF 183a, 183b can select and control UPF 184a, 184b and configure traffic routing through UPF 184a, 184b. SMF 183a and 183b can perform other functions such as managing and allocating EU IP addresses, managing PDU sessions, controlling policy and QoS enforcement, providing downlink data notifications, and similar tasks. A PDU session type can be IP-based, non-IP-based, Ethernet-based, and Petition 870190085290, dated 08 / 30 / 2019, p. 31 / 150 / 106 similar.

[0053] UPF 184a, 184b can be connected to one or more of gNBs 180a, 180b, 180c in RAN 113 via an N3 interface, which can provide UTRSFs 102a, 102b, 102c with access to packet-switched networks, such as the Internet 110, to facilitate communication between UTRSFs 102a, 102b, 102c and IP-enabled devices. UPF 184 and 184b can perform other functions such as packet routing and forwarding, application of user plane policies, support for multi-base PDU sessions, user plane QoS handling, temporary storage of downlink packets, provision of mobility tethering, and the like.

[0054] CN 115 can facilitate communications with other networks. For example, CN 115 can include, or communicate with, an IP communication port (e.g., an IP Multimedia Subsystem (IMS) server) that serves as an interface between CN 115 and PSTN 108. Additionally, CN 115 can provide access from UTRSFs 102a, 102b, and 102c to other 112 networks, which may include other wired and / or wireless networks owned and / or operated by other service providers. In one embodiment, UTRSFs 102a, 102b, 102c can be connected to a local data network (DN - data network) 185a, 185b via UPF 184a, 184b through interface N3 to UPF 184a, 184b and an interface N6 between UPF 184a, 184b and DN 185a, 185b.

[0055] In the views of Figures 1A to 1D and in the corresponding description of Figures 1A to 1D, one or more, or all, of the functions described in the present invention in relation to one or more of: UTRSF 102a-d, Base Station 114a-b, enode B 160a-c, MME 162, SGW 164, PGW 166, gNB 180a-c, AMF 182a-ab, UPF 184a-b, SMF 183a-b, DN 185a-b and / or any other devices described herein may be performed by one or more emulation devices (not shown). The emulation devices may be one or Petition 870190085290, dated 08 / 30 / 2019, page 32 / 150 / 106 more devices configured to emulate one or more, or all, of the functions described herein. For example, emulation devices may be used to test other devices and / or to simulate network and / or UTRSF functions.

[0056] Emulation devices may be designed to implement one or more tests of other devices in a laboratory environment and / or in an operator network environment. For example, one or more emulation devices may perform one or more, or all, of the functions while being fully or partially implemented / deployed as part of a wired and / or wireless communication network in order to test other devices within the communication network. One or more emulation devices may perform one or more, or all, of the functions while being temporarily implemented / deployed as part of a wired and / or wireless communication network.The emulation device can be directly coupled to another device for testing purposes and / or can perform tests using wireless communications over the air.

[0057] One or more emulation devices may perform one or more, including all, of the functions while not being implemented / deployed as part of a wired and / or wireless communication network. For example, emulation devices may be used in a test scenario in a test laboratory and / or in a wired and / or wireless communication network (e.g., test) to implement the testing of one or more components. One or more emulation devices may be test equipment. Direct RF coupling and / or wireless communications through RF circuits (e.g., which may include one or more antennas) may be used by emulation devices to transmit and / or receive data.

[0058] Several deployment scenarios and use cases have been defined in recent 3GPP standards discussions, including point of Petition 870190085290, dated 08 / 30 / 2019, page 33 / 150 28 / 106 indoor access, high-speed deployment scenarios, macro-urban, rural and dense urban areas, and enhanced mobile broadband (eMBB), massive machine-type communications (mMTC) and ultra-reliable and low-latency communications (URLLC) use cases. Different use cases may focus on different requirements, such as higher data rates, greater spectrum efficiency, lower power consumption and greater energy efficiency, lower latency and greater reliability.

[0059] Figure 2 is a flow diagram 200 of an exemplary method for LTE data channel coding and signaling. In LTE downlink data transmission, the eNB may have a transport block (BT) destined for a UTRSF. A 24-bit cyclic redundancy check (VRC) may be attached to the BT at the BT level (210). If the BT with the fixed 24-bit VRC is larger than the maximum code block size (e.g., 6,144 bits), then it will be segmented (220). The number of segments is equal to k.i44-24, where the TBT is the number of bits of the original BT without the fixed VRC. The BT with the fixed VRC may be separated almost equally between the C segments. If the number of segments is greater than 1, an additional 24-bit VRC may be attached to each code block (BC) at the BC level (230). The actual number of bits in each segment may depend on the block size supported in the internal turbo code interleaver parameters.

[0060] Each code block can be encoded by a turbo code with a fixed mother code rate of 1 / 3 (240). The systematic bits and two sets of parity bits can then be passed to the sub-block interleaver and saved in a certain order in a circular temporary storage (250). Rate matching and / or incremental redundancy hybrid repeat request (RI-SRAH) can be used to send the desired number of bits from storage. Petition 870190085290, dated 08 / 30 / 2019, page 34 / 150 29 / 106 temporary circular (260). Each redundancy version (VR) can correspond to a different starting point of the temporary circular storage.

[0061] The number of bits to be sent in each transmission may depend on the number of resource blocks (RBs) allocated for the transmission and the modulation order and coding rate (CR). The modulation order and coding rate may be determined by the DL channel condition, and the number of RBs allocated for the transmission may be obtained from a lookup table.

[0062] To facilitate successful decoding at the UTRSF, the eNB can transmit some encoding and modulation-related information to the UTRSF. This information can be provided in the downlink control information (ICED), which is sent along with the BC.

[0063] In a condition where a UTRSF receives ICEDs, the UTRSF will check the ICEDs (e.g., format 1 / 1A / 1B) for BR assignment, 5-bit Modulation and Coding Scheme (EMC) information, 3-bit SRAH process number, 1-bit new data indicators, and 2-bit VR. The BR assignment tells the UTRSF how many BRs are assigned to the UTRSF (Nbr) and where they are located. The 5-bit EMC information implies both the modulation order M and the TBT index Us.s. Based on e hss, the UTRSF can determine the BT size (TBT) based on the lookup table. Following the same procedure as eNB, the UTRSF will know the number of segmented code blocks Ce and the BC size (TBC) of each BC, 1 < i < C

[0064] UTRSF can determine the channel encoding rate using the following approximate formula: J JJ,Taxa cie coding = ------------J 7ffl' de Petition 870190085290, dated 08 / 30 / 2019, p. 35 / 150 30 / 106

[0065] In the formula, 710de is the total number of allocated resource elements and can be equal to 168 ASfl (for example, 168 ERs / BR (=12 subcarriers / PBR times 14 symbols / TTIs)). The modulation order M can imply the number of bits per ER, and 90% considers that 10% of the resource elements are allocated for control or reference signals.

[0066] VPBD codes are forward error correction codes that can be supported for 3GPP and Institute of Electrical and Electronics Engineers (IEEE) 802 applications. For 3GPP applications, for example, consider a quasi-cyclic VPBD (VPBD-QC) code (X^), where K is the information block length and N is the encoded block length. The parity check matrix H can be a hash matrix with size (Λ — JO x N). A VPBD-QC code can be unambiguously defined by its base matrix with size / x

[0067] Each component in the basis matrix can be a circumferential permutation matrix or a matrix of zeros only. A positive integer value of can represent a circumferential permutation matrix that is circularly shifted to the right of the identity matrix. An identity matrix can be denoted by = 0, while a negative value of can indicate a matrix of zeros only, and N = LZ.

[0068] A given VPBD-QC can be used for a fixed code rate. For rate matching / RI-SRAH support, a parity check matrix code extension can be used. In modals, a protographic matrix (or protomatrix) can be used. A Petition 870190085290, dated 08 / 30 / 2019, p. 36 / 150 A protomatrix with size / x £ can correspond to a coding rate of l. A submatrix of the upper left corner protomatrix with size can also be a value parity check matrix if L' ~J'=L ~J. This submatrix can correspond to a coding rate of tf, which is greater than l. To support RI-SRAH, where the coding rate decreases with retransmissions, a matrix extension from some smaller values ​​of J to some larger values ​​of J can be performed. In general, the minimum coding rate of a protomatrix can be given by ί,,ϊίπ~rQ ~ l while the maximum coding rate of a protomatrix can be given by fma.r—A.

[0069] Figure 3 is a diagram of an exemplary protomatrix 300. In the example illustrated in Figure 3, the protomatrix 300 includes four submatrices 310, 320, 330 and 340 that correspond to the code rates η, Γ2, rs and Γ4, respectively.

[0070] Regardless of which submatrix is ​​used, its supporting information block length is ' 2. The elevation measure Z can be selected so that & - / )'£ is greater than the actual information block length K, and the difference Z = K can be handled by padding with zeros.

[0071] For IEEE 802, in IEEE 802.11ac for example, three different VPBD codeword lengths are supported: 658 bits, 1296 bits, and 1944 bits. For packets smaller than 322 bytes, the codeword size to be used may need to be determined. For packets larger than 322 bytes, a codeword size of 1944 bits can always be used.

[0072] The initial coding step can serve to select the codeword length and determine the number of codewords based on the package size and EMC used. This can be Petition 870190085290, dated 08 / 30 / 2019, p. 37 / 150 / 106 followed by the calculation of the bit shrinkage amount and then the production of parity bits. If necessary, punching or replaying can then be done.

[0073] Discussions of the next-generation (NG) standard for 3GPP included the possible introduction of code block group (GBC) level VRC. The working hypothesis is that GBC-based transmission with single / multiple bit SRAH-ACK (SRAH-ACK) feedback is supported in 3GPP edition 15 with the following characteristics: only enabling GBC-based transmission or retransmission for the same BT of an SRAH process, a GBC can include all BCs of a BT regardless of the BT size, a GBC can include a BT, and GBC granularity can be configurable.

[0074] As mentioned above, in LTE systems, the coding scheme for the data channel is based on turbo coding with a fixed mothercode rate of 1 / 3. In 5G systems, however, a flexible VPBD coding system has been adopted for the eMBB data channel. For such systems, VPBD-QC codes will be used, and variable information block size will be supported through lift-and-shorten operations, and variable coding rate will be supported through code extension of a parity check matrix. The parity check matrix will be based on protomatrices that can be expanded from a high coding rate of 8 / 9 to a lower coding rate (e.g., as low as 1 / 5). Therefore, there may not be a fixed mothercode rate for VPBD codes in 5G systems as there is for LTE systems.

[0075] To facilitate encoding and decoding operations in both the transmitter and receiver for 5G systems, for example, the transmitter may need to determine the mothercode rate, and the mothercode rate may need to be synchronized between the transmitter and receiver. As Petition 870190085290, dated 08 / 30 / 2019, page 38 / 150 33 / 106 modalities described herein provide generic procedures and associated signaling support for VPBD encoding in systems such as the 5G systems described above.

[0076] Additionally, due to the narrowband nature of LTE, it is ensured that each OFDM symbol carries only one BC. Meanwhile, the allocation of wide bandwidth in new radio (NR) can lead to many BCs per OFDM symbol. As an example, for a mode using 4 MIMO layers, 256 QAM modulation, and 3,300 feature elements (ERs) or BRs, there can be a maximum of 12 BCs in each OFDM symbol considering the 8 / 9 code rate and 8,448 bits of BC information. In general, the number of BCs in each OFDM symbol per codeword can be approximately: M is the number of carrier snb signals in layers 8.448 / C1, where M is the modulation order for all layers and C is the code rate. This makes a BC very susceptible to burst errors or deep fades. If BCs are spread over very different frequency locations, BC performance will be greatly improved due to frequency diversity gain. Furthermore, it may be preferable that each BC within an SRAH feedback unit have approximately the same performance for scheduling convenience and reduction of SRAH feedback overhead. Therefore, the use of a symbol-level interleaver can force all BCs to have approximately the same performance. The embodiments described here provide a suitable symbol-level interleaver.

[0077] Figure 4A is a 400A flow diagram of an exemplary BT processing method for a data channel using VPBD-QC codes. For the purposes of the example illustrated in Figure 4A, it is assumed that a protomatrix-based VPBD-QC code is used for channel coding, the highest supported elevation measure of the code. Petition 870190085290, dated 08 / 30 / 2019, page 39 / 150 34 / 106 VPBD-QC is Zmax and every protomatrix has size J x L. Given these assumptions, the largest codeword size can be given by L. The set of supported elevation measures can be represented as z = = The supported information block sizes can consequently be represented as K = {zÃ<£.- / ).....Z|3| ·α- / )}

[0078] In the example illustrated in Figure 4A, a BT can have a transport block size (TBT) of A bits. A VRC that has Ci bits can be attached to the BT (410A). Ci can be the BT-level VRC length, which can be, for example, 24, 16, or another value smaller than 24.

[0079] Segmentation parameters for BT processing can be determined (420A). The parameters can include a number of BC segments, a length of each BC segment, one or more VPBD code elevation measures, and the VPBD code mother code rate.

[0080] Regarding the number of BC segments, the BT with TBT of A bits with Ci bits of VRC fixed and having a total size of (A + Cy) can be partitioned into multiple segments. The number of segments can be determined by: A 4- Ci 1E = where C2 is the VRC length of the BC level, which can be 24, 16 or another value.

[0081] Regarding the length of each code block segment and the number of padding bits, the padded bits can be zeros, a known sequence, or a subset of a known sequence, cyclically repeated from the information bits. There are a number of different ways to partition the BT. Examples are described below in relation to Figures 5, 6, and 7. Petition 870190085290, dated 08 / 30 / 2019, p. 40 / 150 / 106

[0082] With respect to one or more VPBD code elevation measures, since each supported information block size can correspond to a single elevation measure, the elevation measure of each segment can be determined by the supported information block size. For the modes described below with respect to Figures 5 and 6 with equal BT partitioning with VRC, segments of size K+ correspond to an elevation measure Z+, and segments of size K correspond to an elevation measure Z-. In modes, it is possible that Z+ = Z-. For the mode described below with respect to Figure 7 with equal BT partitioning with VRC to adjust supported information block sizes, the last segment can correspond to an elevation measure Z-, while the other segments can correspond to the maximum elevation measure Zmax. In modes, it is possible that Z- = Zmax.

[0083] Regarding the mother TC of the VPBD, Figure 2 above shows that a protomatrix can contain VPBD codes with multiple TCs depending on the size of the corresponding submatrix. Unlike LTE turbo codes where the mother code rate is fixed at 1 / 3, the code mode for VPBD codes can have multiple optional code rates between matrices from a protomatrix. Consequently, the mother code rate of the VPBD code must be determined.

[0084] The decision on which mothercode rate to use may depend on the Quality of Service (QoS) of the data, which may include both latency and reliability requirements. In principle, for high reliability requirements, a low mothercode rate can be used, while for low reliability requirements, a high mothercode rate can be used. For low latency requirements, a higher mothercode rate can be used; while for high latency requirements, a low mothercode rate can be used.

[0085] To facilitate signaling and complexity, the number of Petition 870190085290, dated 08 / 30 / 2019, page 41 / 150 / 106. Possible mother code rates can be limited to less than the number of rows in the protomatrix. Some typical code rates can be supported. For example, possible mother code rates could be {1 / 3, 2 / 5, 1 / 2, 2 / 3}. The mother code rates could then specify which protomatrix submatrix should be used for encoding. This could also specify the memory to be used to store the encoded blocks for retransmissions.

[0086] Once the segmentation parameters are determined, code block segmentation (430A) can be performed, for example, to pad zeros in the BT and then segment it accordingly. The different ways to pad zeros and segment the BT with the padded zeros are described in more detail below, for example with regard to Figures 5, 6 and 7.

[0087] BC-level VRC (440A) fixing can be performed, for example, by fixing C2 bits of VRC to each segmented code block. Unlike LTE turbo codes, the VPBD code has autoparity checking functionality at the end of each iteration. Therefore, the number of BC-level VRC bits for the VPBD code can be much smaller than for the turbo code (e.g., 24 bits). In modes, the value of C2 can be 16 bits, 8 bits, 4 bits, or even 0 bits.

[0088] BC (GBC) group-level VRC fixing (not shown) can optionally be performed, for example, by fixing C3 bits of VRC to each GBC. This is described in more detail below in relation to Figures 18A and 18B. The number of GBC VRC bits for the VPBD code can be less than 24 bits. In other words, the value of C3 can be 16 bits, 8 bits, 4 bits, or even 0 bits. The number of BCs in a GBC may depend on the total number of segmented BCs, the UTRSF capacity, and the latency requirement.

[0089] VPBD (450A) encoding can then be performed by Petition 870190085290, dated 08 / 30 / 2019, p. 42 / 150 / 106 example, encoding each segmented BC using, for example, the determined VPDB code parity check matrix. In modalities, the elevation measure for each segmented BT can be predetermined. An encoded block can be provided as a result of VPBD 450A encoding.

[0090] In general, due to its dispersed nature, interleaving for VPBD encoding may not be necessary. However, interleaving (460A) can be used to improve performance, for example, in the case of burst puncture / interference, as can be achieved with the use of multiplexing used in URLLC and eMBB. This can occur due to localized parity node / variable node connections in VPBDQC codes. Since interleaving (460A) may not be beneficial in all scenarios, it can be considered optional and can be enabled / disabled in some modes depending on the scenario. The encoded blocks, which may or may not be interleaved, can be saved in memory, as in circular temporary storage, for use in transmissions and retransmissions.

[0091] Rate matching (470A) can be performed, for example, for punching or partitioning, based on circular temporary storage, to adjust the desired code rates. Details of how this can be done using SRAH designs of a single circular temporary storage or multiple circular temporary storage are provided below. In embodiments, rate matching (470A) can be performed before interleaving (460A) without departing from the scope of the embodiments described herein.

[0092] Figure 4B is a flow diagram 400B of another example method of BT processing for a data channel using VPBD-QC codes. In the example illustrated in Figure 4B, the BT level VRC setting 410B, the parameter determination 420B, the Petition 870190085290, dated 08 / 30 / 2019, page 43 / 150 38 / 106 code block segmentation 430B, BC level VRC fixing 440B, VPBD encoding 450B, interleaving 460B and rate matching 470B can be performed in the same or similar manner as the corresponding procedures 410A, 420A, 430A, 440A, 450A, 460A and 470A described above with respect to Figure 4A. However, in the example illustrated in Figure 4B, the parameters can be determined (420B) at any time and provided for use during each relevant procedure. For example, the number of BCs, the length of each BC, and the number of padding bits can be provided for use during 430B code block segmentation, and the VPBD elevation measure and VPBD mother code rate can be provided for use during 450B VPBD encoding and 470B rate matching.

[0093] Figure 5 is a 500 diagram of an example of BC generation with equal partitioning of the BT that includes BT-level VRC. In the example illustrated in Figure 5, a BT with fixed BT-level VRC (510) is partitioned into segments or BCs 520A, 520B, and 520C. Each segment 520 can have size b, where s is an integer. Alternatively, each of the first B-1 segments 520 has size Ib, while the last segment (e.g., segment 520C in Figure 5) has . In an embodiment where the last segment 520C has a different size from the other segments 520A and 520B, the The last segment 520C can be filled with 530 so that all BCs (corresponding to a 520 segment plus a 540 BC VRC plus any 550 load bits) are the same size as Is. In other modes (not shown), the 530 padding could alternatively be added to a different segment, such as the first 520A segment, which in such a mode might have a different size from the remaining 520B and 520C segments. The 540A BC VRCs, Petition 870190085290, dated 08 / 30 / 2019, p. 44 / 150 39 / 106 540B and 540C can then be added to each BC.

[0094] The load bits 550A, 550B, and 550C can then be added. In modalities, K+ can be defined as the smallest K in rd + Ci _____£ _i_ / 7 s2. The set K can be the set of supported information block lengths, from a single base matrix or from the union of two base matrices. Thus, the number of load bits for each segment can be K+ Here, the limit operation, M, is used. However, it can be replaced by a rounding operation. The rounding operation can return the nearest integer, or the floor operation can return the largest integer less than the number x.

[0095] In the example illustrated in Figure 5, the BC 540 level VRC is added before the 550 load bits. In this example, the difference between the fill bits and the load bits is that the fill bits are sent over the air with the source bits, while the load bits are removed after VPBD encoding.

[0096] Figure 6 is a 600 diagram of another example of BC generation with equal partitioning of BT that includes BT-level VRCs. In the example illustrated in Figure 6, a BT with fixed BT-level VRC (610) is partitioned into segments or BCs 620A, 620B, and 620C. Each segment 620 can have size b, where b is an integer. Otherwise, each of the first B-1 segments 620 has size , while the last segment (for example, segment 620C in Figure 6) It is the right size C4 + - (B - 1) . In the example illustrated in Figure 6, the load bits 630 can be added to the last segment 620C.

[0097] In the example illustrated in Figure 6, the 640A fill, 640B and 640C is added to each BC before the BC level VRC 650A. 650B and 650C can be added. In this mode, K+ can be defined as Petition 870190085290, dated 08 / 30 / 2019, p. 45 / 150 40 / 106, the smallest K in the set K, which may be greater than or equal to I s2. K can be defined as the smallest K in the set K, which may be greater than or equal to C4 + q)-(Bi)·^ I tí + c2. The set K is the set of supported information block lengths, from a single basis matrix or from the union of two basis matrices. Therefore, the number of zero-padded bits in the first ~1 segments can be K+ c2, and the number of bits padded with zeros for the last segment can be K~ - O + q) + - 1) í^l - q I o Here, the limit operation, M, is used. However, it can be replaced by a rounding operation. The rounding operation can return the nearest integer, or the floor operation can return the largest integer less than the number x. Alternatively, if a single elevation measure is preferred, the information block size can be used as rnaxÜCÉJf. The number of zero-padded bits can be adjusted accordingly.

[0098] Figure 7 is a diagram 700 of an example of BC generation with equal BT partitioning that includes BT-level VRC to adjust supported information block sizes. In the example illustrated in Figure 7, the BT with BT VRC 710 is partitioned into segments or BCs 720A, 720B, and 720C. Load 740 can be added to the last segment 720C, as shown. BCs 730A, 730B, 730C, and 730D VRCs can be added to each BC. K+ can be defined as the smallest K in the K set, such that: K+> AT q + B C2lEquation (2) and K can be defined as the largest K in the set K such that K < K+. Then, the number of segments with length K can be equal to Petition 870190085290, of 08 / 30 / 2019, p. 46 / 150 / 106 ε κ+ - C4 + q + ε c2) κ+-κ~ Equation (3)

[0099] and the number of segments with length K+ can be equal The set K can be the set of supported information block lengths, from a single basis matrix or from the union of two basis matrices. The number of segments with length K+ can be equal to C+— B - C . In this mode, the number of bits padded with zeros can be equal to ( π le-K^-o+ci+e-Çim ,„+ / ·. „ „ „ % κ + b - [---—-JJ κ+- O 4- q + s c2)

[00101] In another embodiment, the BT can be partitioned first with the maximum supported information block size. Each of the first B - 1 segments can have size 2max U- / )- c2 while the last segment can have size Cj4 + Ci) — (B — 1) [2·„!αχ· (..L — f) — C?\.K can be defined as the smallest K in the set K, which can be greater than or equal to Cj4 + £^) — (B — 1) [Z„!a;r( / .— / ) — Then, the number of zero-padded bits for the last segment can be K~ - C4 4- Ci) 4- (fi - 1) (£- / )- C2],

[00102] For all segmentation modes described above, the segment order can be changed. In a condition where GBC-level VRC is applied, the formula for calculating the number of BCs per BT can be adjusted. For example, the deci size can be modified in equation (1) when taking into account the GBC-level VRC. Consider the example where a GBC is composed of X BCs.cz in equation (1) can be ÍVHCqSC adjusted for I x where is the GBC-level VRC size. Similar operations can be applied in determining BC segmentation sizes. For example, in the modality described above. Petition 870190085290, dated 08 / 30 / 2019, page 47 / 150 42 / 106 with respect to Figure 7, equation (2) can be modified to B K+> A +- G + B C2+- X VRCgbc and equation (3) can be modified to L -l Ua.·-

[00103] In modalities, the parameters determined in 420A and 420B in Figures 4A and 4B, respectively, can be determined, at least in part, based on a selected baseline graph (GB). Specific examples of segmentation and determination parameters based on the selected GB follow below. GB selection is described in detail below with respect to Figures 8 to 11.

[00104] For the purposes of the specific examples that follow, it is assumed that two GBs are defined as follows. GB η-1 may have base-matrix dimensions of 46x68 with systematic 2-column punching, Kbi = 22, Rmax,i = 22 / 25, Rmin i = 1 / 3 and KCb,maxi = 8.448. GB n-2 may have base-matrix dimensions of 42x52 with systematic 2-column punching, Kb2 <= 10, Rmax,2 = 2 / 3, Rmin,2 = 1 / 5 and Kcb,max2 = 2.560. In embodiments, the value KCb,max2 = 2.560 can be adjusted to 3.840. Therefore, in the specific examples that follow, the value of 2.560 can be replaced by 3.840.

[00105] In a specific example based on the example illustrated in Figure 5, the input bit sequence for code block segmentation can be denoted by bo, bi, b2, bs,..., bs-ι, where B>0. If B is greater than the maximum code block size KCb, segmentation of the input bit sequence can be performed and an additional VRC sequence of L = Lbc bits can be appended to each BC. A maximum BC size can be: Kcb = 8,448. Alternatively, KCb can be selected as KCb,max2 for a given code rate range. The chosen KCb may depend on the GB / matrix selection method. The load bits can be adjusted to <nulos>at the input to the encoder, and the total number of BCs C can be determined by: If Petition 870190085290, dated 08 / 30 / 2019, p. 48 / 150 43 / 106 L = 0 Number of code blocks: C = 1 Bf = B else L ~ ^CB Number of code blocks: c = —I1. Bf=B + C- L end if

[00106] The bit output of the BC segmentation for c ψ 0 can be denoted by cr2*cr3* — *crfA',--i·), where 0 < r < í? is the code block number and  is the number of bits for the BC number r. The number of bits in each BC (applicable only for c ψ°) can be determined by: AU = [B7C]; For the baseline graph of VPBD 1, Kb = 22. For the VPBD 2 baseline graph, Ses>640= 10; otherwise B > 560 = 9; otherwise if >1*32 =8; else = 6; to find the minimum value of Z in all sets of Petition 870190085290, dated 08 / 30 / 2019, p. 49 / 150 44 / 106 elevation measurements, denoted as ^mm, so that ^+, and denote K'=Kb' 41η; For í = BaB + (C K+- Br) Èf= 0;fim s = 0· para r = 0aC - 1 K = ^+; k = 0 while k < Kff— L k = k + 1 s = s + 1 end while if C > 1

[00107] The sequence Cf,i-rcr2'cr3' -> is used to calculate the parity bits of VRC. Pr&Prl>PrZ> - / PrfL-ll. while k < Kcrh=JVft+i.-K'A; k = k + 1 · end while end if while k < Kffc* =< NULL > k = k + l Petition 870190085290, dated 08 / 30 / 2019, page 50 / 150 45 / 106 end while end for

[00108] In a specific example based on the example illustrated in Figure 6, the input bit sequence for code block segmentation can be denoted by bo, bi, b2, bs,..., bs-i, where B>0. If B is greater than the maximum code block size KCb, segmentation of the input bit sequence can be performed and an additional VRC sequence of L = Lbc bits can be appended to each BC. A maximum BC size can be: Kcb = 8,448. Alternatively, KCb can be selected as KCb,max2 for a given code rate range. The chosen KCb may depend on the GB / matrix selection method. The load bits can be adjusted to <nulos>at the input to the encoder, and the total number of BCs C can be determined by: seβ— ^cb L = 0 Number of code blocks: c = 1 B1 = B else = Í>CB Number of code blocks:=[S / GGí—Ό1. Bf = B + CL end if

[00109] The bit output of BC segmentation, for ψ°, can be denoted by where 0 < r < (7 is the code block number, and is the number of bits for code block number r. The number of bits in each code block (applicable only for <7^0) can be determined by: K+= [£' / (?]; Petition 870190085290, dated 08 / 30 / 2019, p. 51 / 150 46 / 106 For the baseline graph of VPBD 1, = 22. For the VPBD 2 baseline graph, If B > 640 = 10; otherwise B >560 K* = 9; otherwise if >1*92 K* = θ; Otherwise = 6; To find the minimum value of Z in all sets of elevation measurements, denoted as ^min, such that ' ~minK+, and denote = Κϋ· · = 0· for r = 0aC - 1ser < C — 1 K = K+: if not K” = Bf-(C end k = 0· while k < K — Lcrk=^s; Petition 870190085290, of 08 / 30 / 2019, page 52 / 150 47 / 106 k = k + 1· = 5 + 1· end while if C > 1

[00110] The sequence Go,cr2'cr3' -> is used to calculate the parity bits of VRC PrQ>Pn>Prz> ->PríL-i\ while Ufc=PrÇk+h-K'*)-, k = k + lfim enquanto fim se enquanto k < K' crh=< NULL k = k + 1· fim enquanto fim para

[00111] As mentioned above, the determination of parameter 420A / 420B may depend on GB selection. For GB selection, multiple base protographic matrices may be defined to cover a different range of block sizes and / or code rates. The range of block sizes and / or code rates may partially overlap. For a given BC segment length (Nseg), there may be two or more elevation measurements that correspond to two or more available protographic matrices. In embodiments, protographic matrix selection may be based on one or more parameters, including, for example, codeword length, extra punch bit size, padding bit size, and / or shortening bit size. Petition 870190085290, dated 08 / 30 / 2019, page 53 / 150 48 / 106

[00112] A codeword length can correspond to a protographic array m Cra e{1., ...,Li}) with a corresponding elevation measure lm(fm), where M is the number of supported protographic arrays and Lm is the number of elevation measures corresponding to the m-th protographic array. The extra punch bit size can refer to the bits needed to be punched due to rate matching. An extra punch bit size PlinG can correspond to a protographic array m (me(L — with a corresponding elevation measure lmeíb -XnJ), where M is the number of supported protographic arrays and Lm is the number of elevation measures corresponding to the m-th protographic array. A Padi™ padding bit size can correspond to a protographic array m E (1, ..., Λί}) With a corresponding elevation measure lmm where Mé is the number of supported protographic matrices and Lmé is the number of elevation measures corresponding to the mth protographic matrix. A shortening bit size N_ShQrteringlmpOde corresponds to a protographic matrix m (m E {1.....M}) with a corresponding elevation measure lm(lm ε) where Mé is the number of supported protographic matrices and Lmé is the number of elevation measures corresponding to the mth protographic matrix.

[00113] Certain rules can be defined for protographic array selection. The rules can be combined or used independently to select a protographic array.

[00114] A protographic array selection rule may include comparing the codeword length of the M protographic arrays to find the mth protographic array that satisfies Petition 870190085290, dated 08 / 30 / 2019, p. 54 / 150 49 / 106 m = argTnín{\N”^ — Nsgs\) Thus, a protographic matrix that provides the effective codeword length closest to the supported segment length can be selected. Alternatively, the selection criteria can be modified to use the smaller that is greater than Nseg. In this way, the shortening for rate matching can be limited. Alternatively, the selection criteria can be modified to use the larger that is less than Nseg. In this way, the extra punch for rate matching can be limited.

[00115] Another protographic array selection rule may involve comparing the extra punch bit sizes of the M protographic arrays to find the mth protographic array that satisfies m = argrnín. In this way, a protographic array that requires the minimum extra punching can be selected.

[00116] Another protographic array selection rule may involve comparing the padding bit sizes of the M protographic arrays to find the protographic array m that satisfies m = argrnín (N_padlm). In this way, a protographic array that requires the minimum number of padding bits can be selected.

[00117] Yet another protographic array selection rule may involve comparing the shortening bit sizes of the protographic arrays M to find the protographic array m that satisfies 'm =NShorterÍTtg / '. In this way, a protographic array that requires the minimum number of shortening bits can be selected.

[00118] In one embodiment, a single protographic base array can be used for all block lengths. This embodiment is simpler to implement. However, you may lose some performance in a certain range. Consequently, in other embodiments, multiple base arrays can be applied based on, for example, UTRSF capabilities. Petition 870190085290, dated 08 / 30 / 2019, p. 55 / 150 50 / 106 or UTRSF category. Specifically, a single general base protographic matrix can be adopted by all UTRSFs, which can simplify the UTRSF design since a single protographic matrix can be stored in the UTRSF. For a more advanced UTRSF, such as one with high capacities or UTRSF categories that correspond to higher support data rates, a second or even third protographic matrix can be adopted. This can further improve channel coding performance in a certain region. In such modes, the UTRSF can send UTRSF capacity information to the base station (e.g., eNB) via a CRR message in the initial CRR connection setup procedure.

[00119] In modalities, the ability of a UTRSF to support multiple protographic matrices may be implied by the UTRSF category. For example, for UTRSF categories 1, 2, 3, 4, only a single protographic matrix may be used; for UTRSF categories 5, 6, 7, 8, two protographic matrices may be used; and for other UTRSF categories, three protographic matrices may be used. The UTRSF's ability to support multiple protographic matrices may also be explicitly included in the UTRSF's capacity information.

[00120] When a BT can be segmented into segments that have sizes that may not be identical, additional criteria for selecting the base protographic matrix may be applied. For example, it may be preferred that a single base protographic matrix be selected for all BCs in a BT. As an example, a detailed protographic matrix selection procedure is described below. In this example, two base protographic matrices are defined. Protographic matrix 1 may have a base matrix size / 1 x an elevation measure [Zi ... Σ^α;ϊ1] minimum supported code rate. Protographic matrix 2 may have a base matrix size / xL, an elevation measure. Petition 870190085290, dated 08 / 30 / 2019, p. 56 / 150 51 / 106 [Σι ... Z^iax2] minimum code rate supported R2. Although two base protographic matrices are defined for this example, the example can be easily extended to the case where more than two protographic matrices are available for use.

[00121] In this example, it can be assumed that matrix 1 has a larger base matrix and supports longer codewords with a higher encoding rate. In other words, in this example, K-max & R, where =G·J )' ^maxl and ^max =GJ ) ' ^maxi are the maximum information block size for each protographic matrix, respectively. For a given BT with size A, target encoding rate R, and BT-level VRC size Ci, the following procedures for selecting the base protographic matrix and BT segmentation can be used.

[00122] A first procedure is a code rate-based procedure. In this procedure, if the target coding rate is 1, the protographic matrix 1 with can be selected. The segmentation procedure can be the same as described above, g=Γ+1 but equation (1) can be modified to 4^-if. If the target coding rate is R R, the protographic matrix 2 with Kmax can be selected. The segmentation procedure can be the same as g = Γ Ί described above, but equation (1) can be modified to

[00123] A second procedure is a first code rate procedure. If the target coding rate has R, Kmax can be used for segmentation. The segmentation procedure can be the same as described above, but equation (1) can be modified to

[00124] After segmentation, segments can be produced that have at most two different segmentation sizes S ie S 2, in Petition 870190085290, dated 08 / 30 / 2019, p. 57 / 150 52 / 106 where S=max(SI, S2). K can be defined as the smallest K in the set K that is greater than or equal to S. In this example, K can be defined as the union of the information block size supported by both protographic matrices. The selection of the protographic matrix may depend on K in this case. Specifically, if the selected K corresponds to a protographic matrix, then that protographic matrix can be selected.

[00125] If two shift measures are allowed, k+ can be defined as K above, and the set & can be defined as the smallest K in the set K that is greater than or equal to min(S1, S2). If the target encoding rate has R < R, the protographic matrix 2 with Kmax can be selected. The segmentation procedure can be the same as g=Γ Ί described above, but equation (1) can be modified to

[00126] A third procedure is a code length-based procedure. In this procedure, it can be used for segmentation. The segmentation procedure can be the same as g = Γ Ί described above, but equation (1) can be modified to .

[00127] Using this procedure, after segmentation, segments can be provided that have at most two different segment sizes, Si and S2, where S=max(Sl, S2). K can be defined as the smallest K in the set K that is greater than or equal to S. In this procedure, K can be defined as the union of information block sizes supported by both protographic matrices. The selection of the protographic matrix may depend on K in this case. If the selected protographic matrix does not support the target rate, an additional repetition or punching scheme can be applied. If two displacement measures are allowed, then ^'+ can be defined as the K above, and K can be defined as the smallest K in the set K that is greater than or equal to min(Sl, S2).

[00128] Figure 8 is an 800 diagram of four coverage regions. Petition 870190085290, dated 08 / 30 / 2019, p. 58 / 150 / 106, defined in terms of code rate and bit size of information that may or may not be supported by a base-1 graph (GB no. 1) and base-2 graph (GB no. 2), as defined above. In the example illustrated in Figure 8, four regions are defined: region A (802) which has a code rate R>2 / 3, region B (804) which has a code rate R<1 / 3, region C (806) which has a code rate 1 / 3 <R<2 / 3 de código 1 / 3<R<2 / 3 e um TBT<2.560 e a região D (808) que tem uma taxa de código 1 / 3<R<2 / 3 e um TBT> 2.560. Although specific code rate values ​​and TBT limits are defined in Figure 8, the TC limit and / or the TBT limit may be replaced by other values ​​consistent with the embodiments described in the present invention. For example, the value of 2.560 may be replaced by the value 3.840 depending on Kcb,max2, the value 1 / 3 may be replaced by the value *A and so on.Additionally, the TBT value described here may, in some modalities, include the BT level VRC.

[00129] Since the decision on which GB is used will affect the BC segmentation process, given the coverage regions illustrated in Figure 8 and described in this document, the GB selection may depend on the code rate and the TBT. Alternatively, the GB selection may depend on the code rate and the TBC.

[00130] GB no. 1, as described above, is designed to support region A (802), while GB no. 2, as described above, does not support region A (802). If GB no. 2 has to be used in a region A (802), extra punching schemes will need to be provided. In terms of performance, a well-defined base matrix that supports the encoding rate would generally be better than punching a lower-rate base matrix. Consequently, GB no. 1 would be better used for region A (802). If the BT with fixed BT-level VRC bits is greater than Kcb=8.448, segmentation will be necessary. Consequently, when the encoding rate is greater than 2 / 3, GB no. 1 can be selected. Petition 870190085290, dated 08 / 30 / 2019, page 59 / 150 / 106

[00131] GB No. 2, as described above, is designed to support the range of encoding rates in the B (804) region, while GB No. 1 does not support such encoding rates. If GB No. 1 has to be used in the B (804) region, extra matrix extension or repetition schemes will need to be provided. In terms of performance, a well-defined base matrix that supports the encoding rate would generally be better than repeating a higher-rate base matrix. Consequently, GB No. 2 would be better used for the B (804) region. If the BT with fixed BT-level VRC bits is greater than Kcb=2.560, segmentation will be necessary. Consequently, when the encoding rate is less than 1 / 3, GB No. 2 can be selected.

[00132] In modalities, a lower rate limit, such as ^, can be used to define the upper limit of region B (804). This can occur due to a performance comparison between GB in 1 and GB in 2 after considering both segmentation loss and block error ratio (REB) performance.

[00133] Both GB no. 1 and GB no. 2 have coverage in the C(806) region, and no segmentation would be necessary. For the C(806) region, two GB selection procedures can be considered. In a first procedure, GB no. 2 can always be selected for the C(806) region, since GB no. 2 is designed for small block sizes and lower encoding rates. In a second procedure, a GB with smaller load bits can be chosen, and thus GB no. 1 can be selected in some cases. For the second procedure, the C(806) region supports all information bit lengths of GB no. 1 and GB no. 2, and the GB that has the closest information bit length that is greater than the TBT data can be selected.

[00134] A simulation is described below focusing on cases where the first procedure and the second procedure have different preferences. Petition 870190085290, dated 08 / 30 / 2019, page 60 / 150 / 106, regarding GB selection. In detail, the simulation evaluates the performance of GB no. 1 and GB no. 2 in cases where GB no. 1 has fewer bits of payload than GB no. 2. Thus, with the first procedure, GB no. 1 can be selected, and with the second procedure, GB no. 2 can be selected.

[00135] In the simulation, an additive white Gaussian noise (RGBA) channel and quadrature phase-shift keying (QFD) modulation are assumed, and it is assumed that the TBT includes the BT-level VRC bits. Two encoding rates, 1 / 3 and 2 / 3, are evaluated, which correspond to the lowest and highest encoding rates directly supported by GB no. 2. For each encoding rate, three different TBTs = [86, 390, 1936] were chosen. The number of required load bits is shown in Table 1 below. In all simulated TBTs, GB no. 1 has fewer load bits than GB no. 2. Table 1 BT size 86,390 1.936 GB in 1 2 6 0 GB in 2 4 26 144

[00136] When load bits are used, the number of encoded bits generated depends on the size of the load bits and is greater than TBT / rate. To make the comparison fair, the RGBA noise level needs to be adjusted according to the encoded bit size so that the signal-to-noise ratio per bit of information is the same for GB no. 1 and GB no. 2.

[00137] Figure 9 is a 900 graph that provides a performance comparison between GB no. 1 and GB no. 2 at a rate of 1 / 3, where GB no. 1 has fewer payload bits. Figure 10 is a 1000 graph that provides a performance comparison between GB no. 1 and GB no. 2 at a rate of 2 / 3, where GB no. 1 has fewer payload bits than GB no. 2. As shown in Figures 9 and 10, the REB performance of GB no. 2 is consistently better than the REB performance of GB no. 1, even when GB no. 1 has fewer payload bits. Consequently, for 1 / 3 <R<2 / 3 e TBT<2.560, GB no 2 tem melhor desempenho do que GB no 1, mesmo se Petition 870190085290, dated 08 / 30 / 2019, page 61 / 150 / 106 more load bits are requested for GB in 2. Consequently, in modalities, for 1 / 3 <R<2 / 3 e TBT<2.560, GB no 2 pode ser selecionado. Adicionalmente, em modalidades, o limiar de taxa usado na seleção de GB pode ser um valor diferente, como a substituição de 1 / 3<R<2 / 3 por 1 / 4<R<2 / 3, por exemplo. Em modalidades, um maior limite de TBT, como 3.840, pode ser usado.

[00138] Both GB no. 1 and GB no. 2 support the encoding rates of the D region (808). If the BT block length is within the range of (2560, 8448), GB no. 1 can directly support them if a Z elevation value is chosen and some load bits are used. GB no. 2 cannot directly support the encoding rates. However, it can support the encoding rates if segmentation is performed using Kcb=2560.

[00139] In general, VPBD codes perform better when a longer codeword is used. This is especially true in the fade channel where a longer codeword can provide better diversity gain to compensate for burst errors.

[00140] Below is a simulation for the D (808) region. In the simulation, an RGBA channel and CDFQ modulation is assumed, TBT=5.120 is chosen, and TBT is assumed to include the BT-level VRC bits.

[00141] Figure 11 is a 1100 graph that provides a performance comparison between GB no. 1 and GB no. 2 with a code rate of 1 / 3. When GB no. 1 is used, 160 bits of payload are utilized. When GB no. 2 is used, the BT is segmented into two BCs, each BC having K=2,560 with zero bits of payload. GB no. 1 outperforms GB no. 2 by approximately 0.2 dB at a REB=1%. In this simulation, the extra VRC bits for the second BC, when GB no. 2 is selected and segmentation is performed, are not considered. If the bits of Petition 870190085290, dated 08 / 30 / 2019, page 62 / 150 57 / 106 If extra VRC components are considered, the performance of GB η22 will be worse. Consequently, for l / 3 <R<2 / 3 e BT> 2.560, the GB η-1 performs better than the GB n22. Thus, for l / 3 <R<2 / 3 e BT> 2.560, GB η21 can be selected in some modes. In some modes, the rate threshold used can be replaced by another value. For example, l / 4 <R<2 / 3 pode ser usado em vez de l / 3<R<2 / 3. Em modalidades, pode-se usar um maior limite de TBT, como 3.840.

[00142] In the modalities described above in relation to Figure 8, the threshold rates of 1 / 3 and 2 / 3 are used. However, they can be modified to other rates depending on the definitions used for GB η21 and GB n22. Additionally, the TBT thresholds of 2,560 and 8,448 are used in the modalities described above in relation to Figure 8. However, they can be modified to other lengths depending on the definitions of GB η21 and GB n22.

[00143] In an exemplary GB selection procedure, GB η21 can be defined as having base matrix dimensions of 46x68, systematic 2-column drilling, Khi=22, and RITiax.i =22 / 25, Rmin i=l / 3 and Kcb,maxi=8.448. GB n22 can be defined as having base matrix dimensions of 42x52, systematic 2-column drilling, Kh<=l0, Rmax,2=2 / 3, Rmin 2=1 / 5 and Ktà,maxz=2-560.

[00144] The input bit sequence for code block segmentation is denoted by b2lb2l..., where B > 0. If β is greater than the maximum code block size, segmentation of the input bit sequence can be performed, and an additional VRC sequence of L = ^cb bits can be attached to each code block. The maximum code block size and GB selection procedure may depend on the desired encoding rate R and the BT size B: To be <l / 3 Kcb=2.560; Petition 870190085290, dated 08 / 30 / 2019, p. 63 / 150 / 106 GB no 2 is selected Otherwise, if the rate is greater than 2 / 3 Kcb=8.448; GB no 1 is selected If not If B > 2.560 Kcb=8.448 or 2.560; GB no 1 is selected If not No segmentation required. GB no 2 is selected (Alternative method, select a base graph with a lower number of load bits). end end

[00145] In the specific example described above, 1 / 3 and 2 / 3 are used as two rate thresholds. However, they can be modified to other rates depending on the definitions of GB in 1 and GB in 2. Similarly, 2,560 and 8,448 are used as two length thresholds in the specific example described above. However, they can also be modified to other lengths depending on the definitions of GB in 1 and GB in 2.

[00146] For VRC fixing, the BT-level VRC can have C1 bits and the BT-level VRC can have C2 bits. A BC group-level (GBC) VRC can be entered with C3 bits. C1, C2, and C3 can be predefined or predetermined. Alternatively, C1, C2, and C3 can be selected from a predefined or predetermined set S, which can include various integers. For example, S={0, 4, 8, 16, 24}. The selection of the VRC size can depend on one, or a combination, of the following types of Petition 870190085290, dated 08 / 30 / 2019, p. 64 / 150 / 106 Data QoS (e.g., eMBB, URLLC, etc.), UTRSF capability, and / or VRC level (e.g., C1, C2, or C3). Regarding data QoS, as an example, for URLLC, longer VRC codes can be selected. Regarding UTRSF capability, some UTRSFs may support a single VRC value or a subset of S values. The VRC value used can be chosen from the set of VRC values ​​that the UTRSF supports.

[00147] Rate matching (470A / 470B) for VPBD encoded transport channels can be defined by encoded block and can include punching or partitioning, interleaving of encoded bit streams, and bit collection and storage in circular temporary stores. Modalities using dual, multiple, and a single circular temporary store for rate matching are described below.

[00148] In one embodiment, a double circular temporary store can be used to obtain a more reliable SRAH retransmission with VPBD codes. When a double circular temporary store is used, each transmission, including retransmissions, can carry some bits of information.

[00149] Figure 12 is a 1200 diagram of an exemplary double circular temporary storage for rate matching and SRAH. In the example illustrated in Figure 12, after VPBD encoding during which information bits are encoded with VPBD mother code or the VPBD code with the lowest data rate, a set of information bits {s1, s2, ..., sK} 1210 and a set of parity check bits {p1, p2, ..., pM} 1220 can be obtained. Here, K is the length of the information bits 1210 and M is the length of the parity bits 1220. VPBD encoding procedures may allow for the punching of information bits. In such a scenario, the punched information may be Petition 870190085290, dated 08 / 30 / 2019, p. 65 / 150 / 106 included in the information bit set.

[00150] In modes, the encoded information bit set 1210 and the parity check bit set 1220 can optionally be passed to a subblock interleaver (not shown). In a mode, the subblock interleaver can depend on the VR value. For different VR values, or different retransmissions, the interleaver can be different. A set of interleavers can be defined by a set of VR values. The interleaver used can be predetermined or predefined.

[00151] The information bits 1210 can be inserted into a circular temporary storage 1230 (e.g., a circular temporary information storage), and the parity check bits 1220 can be inserted into a different circular temporary storage 1240 (e.g., a circular temporary parity storage). The selection of bits 1250 and 1260 can be used to extract consecutive bits from each respective temporary storage 1230 and 1240 to match the number of available resource elements (e.g., A bits in total). Several different methods can be used to extract the A bits. The following describes illustrative methods.

[00152] For VR=0 (the first transmission), K-nZ consecutive information bits can be extracted from the circular temporary information store 1230. For example, the bit {sNZ+1, ..., SK} can be extracted. In this example, Z is the elevation measure and nZ is the number of bits punched from the set of information bits 1210. A-(K ZN) consecutive parity bits can be extracted from the parity temporary store 1240. For example, the bit {p1, ..., PZ-K+nZ} can be extracted. For VR>0 (retransmissions), a subset of information bits from the circular temporary information store 1230 can be selected. The size of the subset can be predetermined or Petition 870190085290, dated 08 / 30 / 2019, p. 66 / 150 / 106 standard. For example, a fixed Rip ratio can be predefined, predetermined, or signaled. The Rip ratio can be a ratio between information bits and parity check bits carried in the retransmission, and round(Rip*A) can be the selected information bit size. Here, rounding is a function to obtain the nearest integer. Alternatively, ceil() or floor() can be used instead of round(). Here, ceil(x) is a function to obtain the smallest integer that is greater than x, and floor(x) is a function to obtain the largest integer that is less than x. The subset can start from a location that can be determined based on the number of VRs, the subset size, Rip, and / or A. Transmission to different VRs may or may not have overlapping bits.

[00153] A subset of parity check bits from the 1240 parity circular temporary store can be selected. The size of the subset can be predetermined or predefined. For example, if Rip is used, then A-round(Rip* A) bits can be selected. The subset can start from a location that can be determined based on the VR number, the subset size, Rip, and / or A. For example, the subset can start immediately after the selected subset from the last transmission.

[00154] An optional additional interleaver (not shown) can be included after selecting bits 1250 / 1260. In modes, the interleaver may depend on the VR value. For different VR values, or different retransmissions, the interleaver may be different. A set of interleavers can be defined by a set of VR values. The interleaver used can be predetermined or predefined.

[00155] If an additional interleaver is included, it can provide extra diversity for SRAH retransmission. For example, the interleaver can be designed to reorder the bit for constellation symbol mapping. For example, when 64 QAMs are used, Petition 870190085290, dated 08 / 30 / 2019, p. 67 / 150 62 / 106 [£O,£1, £2,£3, £4,£5] can be mapped to a 64 QAM constellation point in VRO. Then, the interleaved version (e.g., [£l,£0, £3,£2, £B, £4] or [bB, £4,£3,£2,£l,£0]) can be mapped to a symbol in VR1, and so on.

[00156] The selected information bits and parity check bits can be passed to the 1270 bit collection where a bit stream can be formed. For example, the bit stream might include information bits followed by parity check bits. A 1280 interleaver can be applied to the bit stream provided as a result of the 1270 bit collection. In some cases, the use of double circular temporary storage can be signaled, for example, by a device such as a UTRSF.

[00157] In embodiments, a SRAH scheme based on multiple circular temporary storage can be used. Each of the multiple temporary stores can correspond to a subset of the encoded bits. The temporary stores may or may not have overlapping bits. The partitioning of encoded bits into temporary stores may depend on the importance of the bits to the decoder. For example, in a system with 3 temporary stores, temporary store 1 may carry the most important bits, while temporary store 2 may carry a subset of bits that may be less important than that in temporary store 1, but more important than the bits carried in the remaining temporary stores. Temporary store 3 may carry the least important bits.

[00158] A set of ratios can be defined for each VR value. The set of ratios can determine the number of bits to be selected from the corresponding temporary storage in the corresponding VR version. For example, for a VR value equal to ak, the set of Petition 870190085290, dated 08 / 30 / 2019, p. 68 / 150 63 / 106 ratios could be — where B is the number of temporary storages used. The following restriction can be applied: 5-----F =1e C < < 1, b = 1.....B

[00159] In order to select and form a codeword of length A for VR, bits can be selected from temporary storage 1; bits can be selected from temporary storage 2, and so on. If it is not an integer, the nearest integer can be selected. Alternatively, the largest integer that is less than can be used, or the smallest larger integer that can be used. For the last temporary storage, ~ bits can be selected.

[00160] Ratio sets can be predefined in the standards. For example, with a given number of temporary stores, the ratio sets for each VR value can be specified. Alternatively, the ratio sets can be predetermined by the eNB or transmitter. In this way, the ratio sets can be explicitly signaled.

[00161] A set of starting positions can be defined for each VR value. The set of starting positions can determine the position in the corresponding temporary storage from which A bits can be selected in the corresponding VR. For example, for a VR value equal to ak, the set of starting positions can be íPfc.e], where B is the number of temporary storages used. The following restriction can be applied: Petition 870190085290, dated 08 / 30 / 2019, p. 69 / 150 64 / 106

[00162] l£SPkAí£ Bufferjize^b = 1,...,B, Buffer Jizebé o bésimo tamanho de Armazenamento tempo.

[00163] Figure 13 is a 1300 diagram of an exemplary bit selection method that uses multiple circular temporary stores. In the example illustrated in Figure 13, in order to select bits and form a codeword with length A for VR A Rfci bits can be circularly selected from position to position mod(SPfljJJ+A-RJCjJJ—l,Buffer_Sizeb') in the temporary store b.

[00164] The sets of starting positions can be predefined in the specifications. For example, with a given number of temporary stores, the sets of starting positions for each VR value can be specified. Alternatively, the sets of starting positions can be predetermined by the base station (e.g., eNB) or transmitter. In this way, the sets of starting positions can be explicitly signaled. Since the starting position can be a value restricted by the size of the temporary store, a normalized starting position can be used. For example, the normalized starting position can be defined as

[00165] The number of temporary storages (e.g., B in the example given above) can be predefined and / or predetermined and explicitly signaled. The size of the temporary storage (e.g., Buffer_Sizeby) can be predefined and / or predetermined and explicitly signaled.

[00166] Figure 14 is a 1400 diagram of a VPBD base graph structured to support VPBD codes in a rate range (lowest rate, highest rate) for use with multiple circular temporary stores. In modalities, a VPBD codeword. Petition 870190085290, dated 08 / 30 / 2019, page 70 / 150 65 / 106 can be generated using a structured VPBD base graph with the format illustrated in Figure 14. In the example illustrated in Figure 14, the higher rate VPBD codes can correspond to a subset of the graph, including [Ma, Mb], while the information bits can correspond to the Ma submatrix, and Pi parity bits can correspond to the Mb submatrix. In order to obtain lower rate codes, matrix extension can be used and extra P2 parity check bits can be generated. With these structured VPBD codes, the codeword corresponding to the lower data rate can have three parts: information bits, Pi parity bits, and P2 parity bits, which can have different priority for the decoder. In this way, three temporary stores can be defined to transport them.

[00167] In modes, the following information and / or parameters can be signaled: rate matching capability of multiple temporary stores, number of temporary stores B and their corresponding sizes Buffer number of VR k, the set of corresponding ratios [Rk,i, Rk,2, ···, Rk,s], the set of corresponding positions [SPk,i, SPk,2, ···, SPk,B], code word size Á and whether the additional interleaver is used.

[00168] In some modes, a single circular temporary storage can be used. In such modes, the bit sequence provided as a result of channel encoding can be sent to the single circular temporary storage. The size of the temporary storage can depend on the size of the base graph and the elevation measure.

[00169] Figure 15 is a 1500 diagram of an exemplary base chart for use with a single circular temporary storage. In the example illustrated in Figure 15, a base chart has a size of Mb x Nb, and the elevation measure is Z. The size of the temporary storage Petition 870190085290, dated 08 / 30 / 2019, page 71 / 150 66 / 106 Temporary storage can be SCF '2S6 all punched bits CStÃO included in temporary storage. In other embodiments, if the X? ' % punched bits are not included in temporary storage, the size of temporary storage can be '2~ Np'2, where Np is the number of punched columns in the base graph. For example, if the first two columns of the base graph are punched, then,= 2. In one example, the base graph may have a size of 46 x 6S, and the first 2 columns may be punched. If punched bits are not considered in temporary storage, then the size of temporary storage can be 66'2.

[00170] In a condition where the information bit size is not directly supported by the specified elevation values, zero-padded or load bits may be inserted to make the number of information bits an integer of a selected elevation measure Z. Load bits may enter circular temporary storage.

[00171] In some modes, the load bits can be removed before transmission. In such modes, the following assumptions can be made. K can be the number of information bits. K' can be the smallest supported information bit size that is supported by the selected base graph that is greater than K. Here, K' is an integer of the elevation measure Z. F = K' - K can be the total number of load bits. F' can be the number of load bits actually used. F' may not always be the same as F due to the VR version and encoding rate. For example, the smallest supported data rate determined by the base graph size may be 1 / 3. However, the base graph may be used to support a lower data rate transmission, such as rate 1 / 5. In one mode, the codeword generated by rate 1 / 3 can be inserted into a Petition 870190085290, dated 08 / 30 / 2019, page 72 / 150 67 / 106 circular temporary storage, and the number K / (encoding rate) of bits can be obtained from the circular temporary storage and transmitted. In this way, the portion of bits in the circular temporary storage can be repeated, which may include the load bits. R can be the desired encoding rate. The size of the circular temporary storage can be N. The bits encoded in [cr c

[00172] A detailed rate matching procedure using the single circular temporary storage may include calculating the codeword with load bits:=K' / R. Given a VR starting point S, the endpoint index (buffer) can be calculated. The selected bits can be obtained from the starting point S to the endpoint E. The actual number of load bits F can be counted. Typically, F can be zero or an integer. The number of load bits F can be removed.

[00173] In one embodiment, the load bits may not be removed before transmission. In this case, the load bits may be used to signal control information. For example, all load bits '0' may be used to signal control information A, while all load bits '1' may be used to signal control information B. In one embodiment, fixed starting locations for each VR may be pre-selected with a total number of supported VRs NmaxVR and temporary storage size Ntemporary storage·

[00174] Figure 16 is a 1600 diagram showing fixed starting locations with four VRs (NITiaxvR=4) for a scheme in which VR starting points are uniformly distributed throughout the temporary storage (a), a scheme in which VR starting points are uniformly distributed across the parity bits (b), and a scheme in which VR starting points are uniformly distributed across the P2 bits of Petition 870190085290, dated 08 / 30 / 2019, page 73 / 150 68 / 106 parity.

[00175] For the scheme in which VRs are uniformly distributed throughout the temporary storage (a), the fixed location of VR starting point can be selected so that the locations [s0,Si,..., are uniformly distributed temporary storage such that = lAWer to * k 1 long being that ic = 0,1, "1 is an index of VR. If the first NPZ bits If punched objects can be included in temporary storage, the equation , .... , Sk= PWer* k + NZ can be modified to or L W___TΓΠ Alternatively, the locations can be calculated based on the base graph and then converted to indices =1 in temporary storage. For example: kou

[00176] For example, for the base graph dimension dexsendo where the first 2 columns can be punched, the size of the temporary storage is 66Z. If the punched systematic bits do not enter the circular temporary storage, then the starting positions = [0, 162, 322, 482],

[00177] In the examples described above, and in the examples that follow, the floor() operation is used. However, in some modes, it can be replaced by the ceil() or round() operation. When floor(x) generates the largest integer that is less than or equal to x, ceil(x) generates the smallest integer that is greater than or equal to x, and round(x) generates the integer that is closest to x. Applying the limit and rounding operations instead of the floor operation, the starting positions = [0, 172, 332, 50Z]. Another possible selection could be = [0,162,332, 492], which is based on the formula kl iVlHírjWff -I Petition 870190085290, dated 08 / 30 / 2019, page 74 / 150 69 / 106

[00178] For a base graph dimension of 42 x 52, where the first 2 columns can be punched, the temporary storage size is 50Z. If the punched systematic bits do not enter the circular temporary storage, then the starting positions = [0,12Z,24Z, 36Z] , using floor operations, or the starting positions [^0,^1,^2,^3] — [0,13Z,25Z,38Z], using boundary and rounding operations. Another possible selection could be [^0^1^2^3]=[0, 12Z,25Z, 37Z]_

[00179] In modalities, the uniformly distributed VR starting points above can be combined with the design of a self-decoding VR different from VR0. For example, the starting point of VR3 can be moved forward towards the end of the temporary storage so that it is self-decoding. This can result in Sg] = [0, 17Z / 33Z, 56Z] q [ίθ, S^t-¾] = [0,13Z, 25Z, 43Z] for GB2.

[00180] For the scheme in which VRs are evenly distributed across the parity bits (b), the fixed VR starting location can be selected so that the first location is selected from the beginning of the codeword except for the punched location, and the remaining locations can be evenly distributed across the parity bits. If the punched systematic bits are not saved in temporary storage f 0 k = 0 . ,=» ft - O k>o circular,LJ , where k = 0,1, ...,NmaxVR~ 1 is the VR index and e = e is the information bit length. If the first NPZ punched bits can be included in temporary storage, the equation can be modified to: Petition 870190085290, dated 08 / 30 / 2019, page 75 / 150 70 / 106 buffer K^Z ^'mnTVfí 1 'Jr VpZ ' g 2 + I *üI- * (Ar - 1) + JVpZ or Ar = 0 k > 0

[00181] Alternatively, locations can be calculated based on the baseline graph and then converted to indices in temporary storage. For example: f 0k = 0 ç=\\ - Kb U2 +N------Ϊ · (fc - 1)Z k > 0ou'Lj';nnTVfl -*·-1 NpZk = 0 ç Jyy ~)K„Z+ —----4 » (i - DZ + AípZ k > 0 or VLAfflaaVfi— 1Jf JVpZk = 0Sfí =* (k _ 1)2+ N 2fc>0üLvra„wVH-iJ

[00182] In a variation of the scheme in which VRs are uniformly distributed across the parity bits, the fixed VR starting locations can be selected so that they are separated by Kb. The fixed VR starting location can be selected so that the locations ·' Avot„,.vh-i) are uniformly distributed across the temporary storage and separated by Kb, such that Sk= modlSç^S^... where Ar = 0,1, — , / Vma;íVfl— 1 is the index of VR e=eKbZ is the bit length of information. If the first Npbits punched can be included in temporary storage, the equation can be modified to 5 / - mod * k, + KpZ Sk= mod (κύZ * k, Naffer - Npz) + NpZ.

[00183] In another variation of the scheme where VRs are distributed uniformly across the parity bits, the fixed starting location of Petition 870190085290, dated 08 / 30 / 2019, page 76 / 150 71 / 106 VR can be selected so that the VR locations [%Sí] can be uniformly distributed throughout the temporary storage and separated by Kb-Np, such that where &=04, >NmaxVR ~ 1 is the VR index, = K&Z is the bit length of information, and Np corresponds to the punched blocks. If the first Np bits punched can be included in temporary storage, the equation can be modified to = 'm°d ((^ — Np)Z * + NpZou Sk= mod - NP)Z * - Νρζ) + / VpZ

[00184] For the scheme in which VRs are uniformly distributed across the P2 parity bits (c), the fixed VR starting location can be selected so that the first location is selected from the beginning of the codeword except for the punctured location, and the remaining locations can be uniformly distributed over the second part of the parity bits (i.e., the P2 parity bits as shown in Figure 16). The exemplary VR starting location VRo is shown in Figure 16, er 0 k = 0SkIVA + ?i)Z + * (fc - 1) k > 0ü 17lJ, where Ar = 0,1, ...Λη(αν8— 1 is the index of VR and e = ATÜ— Wfl,eKbZ qo is the bit length of information. If the first Npbits punched can be included in temporary storage, the equation can be modified to: í ApZ k = 0 --- *(k-í) + NpZ k>Q OR k=C * (fr - 1) + NpZ

[00185] Alternatively, locations can be calculated based on the baseline graph and then converted to indices in storage. Petition 870190085290, dated 08 / 30 / 2019, page 77 / 150 72 / 106 temporary. For example: s = Nb- Κϋ- Fi , ' <Ά +Pi)z+ ---5—r *c* -1)z' JTmrr.TrVfl— 1 Jk= 0 k> 0 or sk= (^+Λ)Σ + Νύ-Κύ-P±^maxVR ~ Jc > 0ou(^+P1)Z + NpZ l^-^-Fa-Λρ L 1 *(fc- l)Z + NpZ k = 0 k> o

[00186] In a variation of the scheme where VRs are distributed uniformly across the P2 parity bits, the fixed VR starting locations can be selected so that they are separated by Kb+Pi. The fixed VR starting location can be selected so that the locations {50,5i,..., 5^^-1} can be distributed uniformly across the temporary storage and separated by Kb, such that Sk— mod + P^Z* where = 0,1,—1 is the VR index and = —^ü, and is the information bit length. If the first Np bits punched can be included in the temporary storage, the equation can be modified to 5fr=mod [í + PjZ * k, + NpZQu Sk= mod 4- PjZ * - Apz) + JVpZ

[00187] In another variation of the scheme where VRs are distributed uniformly across the P2 parity bits, the fixed VR starting locations can be selected so that they are separated by Kb+Pi-Np. The fixed VR starting location can be selected so that the locations can be distributed uniformly across the temporary storage and separated by Kb, such that S„ = mod ((¾ + ^- N^Z· k. N^yem where k= o4, - 1 is the VR index.= _esão0 information bit length. Petition 870190085290, dated 08 / 30 / 2019, page 78 / 150 73 / 106 If the first Npbits punched can be included in temporary storage, the equation can be modified to = mod + Fj, —+k, or Sk= mod i^(jr6+ Pl — Np)2 * k, — NpZ^ + Np2

[00188] Once the circular temporary storage is formed, the bits in the temporary storage can be [^Oíi] for each transmission, the transmitter may be able to select one of the VR indices to transmit. For example, for the m-th transmission, the transmitter may select VRk. If the expected codeword length is N, then the transmitted bits may be

[00189] Different retransmission versions may have different performance. Performance may also depend on the code rate or codeword length. A smaller number of overlapping bits in each transmission may introduce better performance. If ^maxVR= 4, then a natural VR order is [VRo, VRi, VR2, VR3]. A non-natural VR order may, however, be used to achieve better SRAH performance. For example, in modes, the following VR order may be used: [VRo, VR2, VR3, VRi]. If autodecoding starting VR positions are considered, then the following VR order may also be applied: [VRo, VR2, VRi, VR3J.

[00190] Although the VPBD codes defined for the system may have multiple protographic matrices that may correspond to multiple parity check matrices, the multiple protographic matrices may be defined based on the information block length. For example, if the information block length is greater than a threshold (i.e., X), the VPBD protographic matrix 1 may be used; otherwise, the VPBD protographic matrix 2 may be used. In some embodiments, segmentation may introduce an uneven bit distribution. When the Petition 870190085290, dated 08 / 30 / 2019, page 79 / 150 / 106 segmentation is performed, it may be possible that one or more segmentations may be in the protographic matrix range 1, while the other segmentation (or other segmentations) may be in the protographic matrix range 2.

[00191] For example, the transmission block may have Y bits of information, which is greater than the maximum supported information bits. In this way, segmentation can be performed. Due to some irregular separation, one segment has Y1 bits and the other has Y2 bits. It is possible that Y1>X and Y2 <X, o que pode acionar 2 códigos de VPBD.

[00192] There are described embodiments that can solve this issue, for example by filling the smallest segment or segments so that the size of the filled segments is greater than the threshold X and, in this way, the same VPBD protographic matrix can be used. In another embodiment, the number of segments can be increased by 1 so that the length of each segment can belong to the region smaller than the threshold X.

[00193] As mentioned above, in modes, bit overlapping can be performed after rate matching and immediately before modulation. In a mode, a block interleaver can be used. To determine the size of the block interleaver, one or more of the following parameters can be considered: Z-height measures, modulation order or number of bits in a modulated symbol, number of data streams supported, and allocated BR sizes or smallest supported BR size.

[00194] Figure 17 is a 1700 flow diagram of an exemplary VPBD encoding procedure with interleaving. As described above, given a TBT and code rate, VPBD base graph selection and segmentation can be performed. VPBD encoding operations can then be performed. In the example illustrated in Figure 17, the transmitter can then insert payload bits (1710), perform encoding of Petition 870190085290, dated 08 / 30 / 2019, page 80 / 150 75 / 106 VPBD (1720), punch the first 2Z bits of information (1730), pass the output to a circular temporary storage (1740), perform rate matching (1740), remove charges (1750), perform interleaving (1706) and perform modulation (1770).

[00195] To perform rate matching (1740), the number of Neb bits to be transmitted can be calculated. NCb can be a function of modulation order, number of fill bits, and resource block allocation. For example, Nrb BRs can be allocated in transmission, where each BR can carry NsymperBR modulated symbols, and the modulation order can be M. It can be assumed that the number of fill bits is Ncarga· In this scenario,='NsymPerRB' + ^filler Ncb bits can be read out of the circular temporary storage.

[00196] To perform (1760) interleaving, a block interleaver can be used, where the number of rows can be determined by the modulation order. For example, for 64 QAM, the modulation order M=64 and the number of rows in the block interleaver can be set to m=log2 (M)=6. The block interleaver can be written in rows and read in columns.

[00197] Several modulation mapping orders can be defined, including natural order, reverse order, and circularly shifted order. For natural order, each column of bits read from the block interleaver can be sent directly to the modulation mapper. For reverse order, each column of bits read from the block interleaver can be reversed and then sent to the modulation mapper. For example, for 64 QAM modulation, the natural order of a bit column outside the block interleaver could be [m0, ml, m2, m3, m4, m5]. The reverse order could be [m5, m4, m3, m2, ml, m0], and the input to the modulator could be in reverse order. For circularly shifted order, each column of bits read from the block interleaver can be circularly shifted. For example, for 64 QAM modulation, the natural order of a Petition 870190085290, dated 08 / 30 / 2019, p. 81 / 150 / 106 The bit column outside the block interleaver can be [m0, ml, m2, m3, m4, m5]. The shifted circular order with Sdisplacement=2 can be [m2, m3, m4, m5, m0, m1], and the input to the modulator can be in the shifted circular order. The shifted circular order with Sdisplacement=4 can be [m4, m5, m0, m1, m2, m3], and the input to the modulator can be in the shifted circular order.

[00198] In modalities, an index of modulation mapping order (IOMM) can be assigned to each unique modulation mapping order discussed above. For example, as shown in Table 2 below, IOMM=0 can indicate the natural order. IOMM=1 can indicate the inverse order. IOMM=2 can indicate the shifted circular order with Sdisplacement=mod(2,log2(M)). IOMM=3 can indicate the shifted circular order with Sdisplacement=mod(4,log2(M)). IOMM=4 can indicate the shifted circular order with Sdisplacement=mod(6,log2(M)). IOMM=5 can indicate the shifted circular order with Sdisplacement=mod(8,log2(M)). The modulation orders mentioned above are provided as examples. However, a system can adopt the same set of modulation orders, a larger set of modulation orders, or a subset of modulation orders. Depending on the transmission scenario, an IOMM can be determined, signaled, and / or implied.

[00199] In one IOMM determination or pre-configuration mode, the same IOMM can be applied to the entire BC. IOMMs 0 and 1 (corresponding to natural order and reverse order) can be used. In some modes, the IOMM can be determined by VR and / or new data indicator (NID). In other modes, the IOMM can be pre-configured. For example, for VR0 with a new data transmission (i.e., NID is toggled), IOMM=0. For VR0 with retransmission (i.e., NID is not toggled), IOMM=1. For VR1, IOMM=1. For VR2, IOMM=0. For VR3, IOMM=1. Petition 870190085290, dated 08 / 30 / 2019, p. 82 / 150 / 106

[00200] In another embodiment, the same IOMM can be applied to the entire BC. IOMMs 0, 1 and 2 / 3 / 4 / 5 (corresponding to natural order, reverse order and shifted circular orders) can be used. In some embodiments, the IOMM can be determined by VR and / or NID. In other embodiments, the IOMM can be pre-configured. For example, for VR0 with new data transmission (i.e., NID is alternated), IOMM=0. For VR0 with retransmission (i.e., NID is not alternated), IOMM = 1. For VR1, IOMM=2 (i.e., Sdisplacement=mod(2, log2(m)). For VR2, IOMM=4 (i.e., Sdisplacement=mod(6, log2(m)). For VR3, IOMM=3 (i.e., Sdisplacement=mod(4, log2(m)). Table 2 IOMM=0 (natural) IOMM=1 (inverse) IOMM=2 (circular) IOMM=3 (circular) IOMM=4 (circular) 16 QAM 0,1,2,3 3,2,1,0 2,3,0,1 0,1,2,3 2,3,0,1 64 QAM 0,1,2,3,4,5 5,4,3,2,1,0 2,3,4,5,0,1 4,5,0,1,2,3 0,1,2,3,4,5 256 QAM 0,1,2,3,4,5,6,7 7,6,5,4,3,2,1,0 2,3,4,5,6,7,0. 6,7,0,1,2,3,4,5

[00201] In another embodiment, different IOMMs can be applied to a BC. For example, the BC can be partitioned into P parts, and each part can have an IOMM. In embodiments, the IOMM can be determined by VR and / or NID. In other embodiments, the IOMM can be pre-configured. For example, there can be P=4 partitions per BC. The partitioning can be performed uniformly, for example, as in Table 3 below. In embodiments, the IOMM assignments provided in these examples can be modified in a manner consistent with the embodiments described in the present invention. Table 3 Part 1 Part 2 Part 3 Part 4 VR0 IOMM=0 IOMM=2 IOMM=3 IOMM=4 VR1 IOMM=2 IOMM=3 IOMM=4 IOMM=0 VR2 IOMM=3 IOMM=4 IOMM=0 IOMM=2 VR3 IOMM=1 IOMM=2 IOMM=0 IOMM=3

[00202] The internal parity checking capability of a VPBD decoder can improve its false alarm performance. Therefore, in some modes, BC-level VRC may not be necessary. Petition 870190085290, dated 08 / 30 / 2019, p. 83 / 150 78 / 106 to achieve the necessary false alarm criteria. Instead, a group of blocks can share a common VRC to reduce overhead and thus increase the throughput of data transmissions.

[00203] Figure 18A is an 1800A flow diagram of an exemplary BT processing method for a data channel using VPBD-QC codes with GBC-level VRC. The 1800A flow diagram is identical to the 400B flow diagram in Figure 4B, except that BC-level VRC clamping (440B) is replaced by GBC generation and GBC-level VRC clamping (1810A). In embodiments, BC-level VRC (440B) can be viewed as a special case of GBC-level VRC 1810A with a group size equal to 1.

[00204] For GBC generation and GBC-level VRC fixing (1810A), the GBC can be formed by concatenating several BCs and fixing VRC bits to each GBC. Several parameters may need to be determined for GBC generation and GBC-level VRC fixing (1810A), including the number of GCs in a BT, the number of BCs in each GBC, and the VRC length for each GBC.

[00205] Figure 18B is an 1800B flow diagram of another exemplary BT processing method for a data channel using VPBD-QC codes with GBC-level VRC. In the example illustrated in Figure 18B, the GBC operations described above in relation to Figure 18A are combined with the BC operations described above in relation to Figure 4B. Blocks that are the same between Figures 4B, 18A, and 18B have the same markers. In the example illustrated in Figure 18B, the method includes 1820 interleaving after rate matching (470B) instead of 460B interleaving before rate matching.

[00206] GBCs can be generated using several different methods. In one GBC generation mode, the number of BCs in each GBC can be configured. B can be a value that represents the Petition 870190085290, dated 08 / 30 / 2019, p. 84 / 150 79 / 106 total number of segmented BCs in a single BT. This value can be determined during parameter determination (420B) and can be used during code block segmentation (430B). Allow ε, —, εβ to be the sizes of the segmented BCs. L can be the total number of GBCs in a BT, and they can be the number of BCs in L GBCs. L and can be determined in one of several different ways. In the following embodiments, the methods can be signaled by the first GBC-related signaling embodiment described below.

[00207] In one embodiment, the number of BCs in a GBC (e.g., Xmax) can be predefined or preconfigured. L can be adjusted from i· = ismdo that . The number of BCs in the first í· - 1 GBCs can be equal to while the number of BCs in the last GBC can be equal to B —(.L - í) *in other words: Xf=XmflI,í = l.....£-1 ^ = 5-(1-1),^. number of BCs in the first ιηοάίβ,ί) GBC can be L, While the number of BCs in the remaining GBCs can be L— πιοάίβ,I) GBCs can be L.. In other words: Â} = , í = 1,..., modÍB, L) Ig· -., í = mod (β, L) 4- 1, ..., L LJ ·

[00208] In another mode, the number of bits supported in a GBC (e.g., fmai) can be predefined or preconfigured. These can be the number of bits in each code block of a BT. The number of BCs in the first GBC can be defined as the largest value such that Σ / =ι — Σmax; the number of BCs in the second GBC can be defined as the largest value such that u — nΣ; and so on. Petition 870190085290, dated 08 / 30 / 2019, p. 85 / 150 80 / 106

[00209] In another mode of GBC generation, the number of GBCs in each BT can be configured. A communication system may have some restrictions on the maximum number (e.g., B') of ACK / NACK feedback bits per BT. It is clear that in this case, the maximum number (i.e., X) of GBCs in a BT can be predefined or preconfigured. If a BT has a total of B segmented GBCs in a single BT, each GBC can have i-1 Ib' BCs. Here, the last GBC may contain less than i-1 Is' BCs. In an alternative scheme for grouping BCs, with the given maximum number (e.g., B') of GBCs per BT, some i-1 GBCs can be adjusted to contain Is' BCs, and other GBCs can be adjusted to contain I— Lb'J BCs. could be the number of GBCs containing i-1 Is' BCs, and it could be the number of GBCs that contain Ils'J BCs. The values ​​of e^2 can be determined by the following equations: + ^2 =&'; b). ís' +&2L'J—& (specifically, ~BL'.e—). It is possible that the first GBCs contain Is' BCs, I— while the latest GBCs contain Ls'J BCs. It is also possible that the The first GBCs contain Ls'J BCs, while the last GBCs contain Ib' BCs.

[00210] In a condition where B, each GBC can contain only a single BC. Since the total number of GBCs is less than B, some additional signaling may be necessary to inform the receiver. This mode may include signaling using the second GBC-related signaling mode described below.

[00211] In another embodiment, the two GBC generation modes described above can be combined depending on the BT size. For a large BT size (e.g., eMBB traffic), it may be desirable to limit the feedback signaling overhead of Petition 870190085290, dated 08 / 30 / 2019, p. 86 / 150 / 106 ACK / NACK. For small to medium BT sizes, it may be desirable to specify the number of BCs for each GBC so that appropriate sets of BCs are formed and transmitted in a timely manner. This can be implemented by applying the following: if the BT size > TB_thres, then the second GBC generation mode described above can be applied. Otherwise, the first GBC generation mode described above can be applied. The TB_thres can be predefined or configured by CRR messages. Based on this mode, the first or second GBC generation mode described above can be selected to determine the number of GBCs or the number of BCs in each GBC, respectively, that can be signaled to the receiver for decoding using the corresponding GBC signaling methods described below.

[00212] In various modes, multi-level GBCs can be used to avoid retransmitting entire BCs within a large GBC. For an initial transmission, a receiver can generate a single bit ACK or NACK per GBC, depending on the success or failure of decoding the BCs within the GBC. A transmitter can retransmit all BCs from a GBC if it matches a NACK. For retransmissions, the GBC size can be reduced, for example, to a sub-GBC size. In other words, the receiver can generate a single bit ACK or NACK per sub-GBC for the retransmitted BCs, depending on the success or failure of decoding the BCs within the sub-GBCs. The transmitter can, in a second retransmission, send all BCs from a sub-GBC if the sub-GBC matches a NACK. This can avoid retransmitting all BCs from the GBC. The sub-GBC size can continue to decrease with subsequent rounds of retransmissions.

[00213] Consider, for example, a two-level GBC, where the GBC corresponds to the initial transmissions and the sub-GBC corresponds to all subsequent transmissions. Petition 870190085290, dated 08 / 30 / 2019, page 87 / 150 / 106, regarding retransmission rounds. For the initial transmission, a 1-bit ACK / NACK per GBC can be used. If the feedback is an ACK, then a 1-bit ACK / NACK per GBC can continue to be used for the new transmission. If a 1-bit feedback NACK is used for the initial transmission, then the sub-GBC level ACK / NACK can be used for retransmissions, and a 1-bit ACK / NACK per sub-GBC can be used.

[00214] Figure 19 is a 1900 diagram of the two-level GBC example. In the example illustrated in Figure 19, a GBC includes 6 BCs, and a subGBC includes 3 BCs. A 1960 transmitter can send an initial 1910 transmission from a GBC. Under a condition where a BC (for example, the first BC1) in a GBC is not correctly decoded after the initial 1910 transmission, a 1970 receiver can send back a single-bit NACK 1920. The 1960 transmitter can then retransmit all 6 BCs in the GBC in a first 1930 retransmission. Since these 6 BCs belong to two sub-GBCs, the feedback for the first 1930 retransmission can be composed of two bits, one per sub-GBC.

[00215] In the illustrated example, the first BC is again not decoded correctly after the first retransmission 1930. The feedback 1940, here, is (NACK, ACK), where NACK implies the failed decoding of the first sub-GBC and ACK implies the successful decoding of the second sub-GBC. After receiving the feedback 1940, transmitter 1960 will only send the 3 BCs in the first sub-GBC in the second retransmission 1950. This can reduce the number of transmissions required.

[00216] Alternatively, GBC-level recognition can be asymmetric. If the GBC is successfully detected, a bit can be set in the GBC ACK. If the GBC is not successfully detected, a bitmap can be used in the GBC NACK. Each bit in the bitmap can correspond to a BC in the GBC. If the BC is considered successfully detected, the corresponding bit in the bitmap can be set to 0. Otherwise, it Petition 870190085290, dated 08 / 30 / 2019, page 88 / 150 83 / 106 can be adjusted to 1. In this example, 0 and 1 can be swapped. The number of bits in the bitmap can be explicitly signaled in the NACK. Alternatively, the number of bits in the bitmap can be implicit and determined by the number of BCs per GBC, which can be known at both the transmitter and the receiver.

[00217] To determine the VRC length for each GBC, one of several different methods can be used. In one embodiment, the GBC-level VRC length G may depend on the number (e.g., X) of BCs in a GBC. For example, a long VRC length can be used for a larger group of BCs to achieve similar false alarm rate (FAR) performance as for a short VRC length with a smaller group of BCs. For example, it is assumed that supported GBC-level VRC lengths are FffQ < < FRCg bits. GBC-level VRC lengths can be determined by: í?3= PRG, se^< Thresi= VRC2.seThresl < X < Thres2;=VTÍCg, se Thres'2 X, where TVtresl Thres2

[00218] In another embodiment, the GBC C3 level VRC length may depend on the BC size (e.g., Y bits per BC) in a GBC. For example, a long VRC length may be used for a GBC with a larger BC size, while a short VRC length may be used for a GBC with a smaller BC size. GBC level VRC lengths can be determined by: c3= seY< ThresS; C3= RfíCjseThres3 <Y< Thres4^ Petition 870190085290, dated 08 / 30 / 2019, page 89 / 150 84 / 106 c3=seThresh < P where Thres3 < Thresi. This mode and the immediately preceding mode can be used under the assumption of uniform GBC generation, as described above.

[00219] In yet another embodiment, the GBC-level VRC length may be GBC-specific based on the total BC sizes in a GBC. Specifically, the GBC-level VRC length A may depend on the sum of the BC sizes in a GBC. For example, let *í be the BC size of the *-esbuo BC in a GBC. GBC-level VRC lengths may be determined by: if Σ?=ιKί < ThresSC3= VfíC2, if ThresS < Σ?=1ξ- < Thres6C3= WG3, if where TVitsThvesõ

[00220] It is mentioned above that, in the VPBD encoding process, the mother code rate of a VPBD code can be determined based on the data QoS. For downlink transmissions in cellular systems, the eNB can determine a mother code rate of the VPBD code. This mother code information may need to be sent to the UTRSF so that the UTRSF can use the same parity check matrix for decoding.

[00221] In some modes, the mother code rate is different from (or lower than) the code rate of each transmission. In LTE systems, for example, the 5-bit EMC index and BR assignment information are contained within the ICED information block. Both the EMC index and the BR assignment imply the length of the encoded block. Furthermore, based on a lookup table, the TBT size can be determined. Then, the Petition 870190085290, dated 08 / 30 / 2019, page 90 / 150 The 85 / 106 receiver can be derived from the length of each segment. The code rate can then be determined for transmission. The UTRSF may still need to know the mother code rate so that it allocates sufficient memory for retransmissions and uses the appropriate parity check matrix for decoding.

[00222] For example, assume there are R supported mother code rates. A total of \l°3z bits can be used to indicate this mother code rate. For example, =4, and 2-bit information for parent code rates can be generated. These bits can be placed in the ICED, along with other parameters, and delivered to the UTRSF.

[00223] Since the mother code rate can be just timing information sent across multiple retransmissions, this information can be combined with the new data indicator bit. For example, if the new data indicator is 1, then a mother code rate of \l°3z bits can be contained in the ICEDs. If the new data indicator is 0, then it may be that no mother code rate information is needed in the ICEDs, since these are just retransmissions and the same mother code rate can be used.

[00224] In the example described above, the absolute parent code rate can be encoded and transmitted in ICEDs, since the parent code rate is generally lower than the code rate of each transmission. Therefore, it can be wasteful to use the complete bits to indicate the parent code rate, given the code rate of the current transmission. This can only indicate possible parent code rates lower than the code rate of the current transmission. Here, the parent code rate relative to the code rate of the current transmission can be used. For example, assume that the complete set of parent code rates is {1 / 3, 2 / 5, Vi, 2 / 3} and the code rate of the current transmission is already 0.45. Then, the possible parent code rates can only be {1 / 3, 2 / 5}. Petition 870190085290, dated 08 / 30 / 2019, pp. 91 / 150 / 106 Therefore, 1-bit information can be used.

[00225] For uplink transmissions in cellular systems, an eNB can also determine, for example, the modulation and encoding scheme, the redundancy version, the BR and NID assignment for the UTRSF. This information can be contained in ICED 0 format and sent to the UTRSF. The UTRSF can follow this instruction for this uplink transmission. Again, for uplink transmissions, the mothercode rate of the VPBD code can also be contained in ICED 0 format. This information may only be necessary for the transmission, as it remains the same for retransmissions.

[00226] It is mentioned above that the protographic array selection may be implied by the UTRSF category, which may be included in the UTRSF capacity information. Once a base station (e.g., ENB) receives the UTRSF category information, it can perform the protographic array selection accordingly.

[00227] Figure 20 is a 2000 flow diagram of an exemplary method for selecting a protographic matrix for a specific UTRSF at a base station (e.g., eNB), where the base station is provided with UTRSF category information. In the example illustrated in Figure 20, a base station receives a radio resource control (RRC) message that includes UTRSF category information (2010). The base station can determine whether the UTRSF category is associated with a single protographic matrix (2020). In a condition where the UTRSF category is associated with a single protographic matrix, a single protographic matrix can be applied (2030). In a condition where the UTRSF category is not associated with a single protographic matrix (or is associated with more than one protographic matrix), multiple protographic matrices can be applied (2040). Petition 870190085290, dated 08 / 30 / 2019, p. 92 / 150 / 106

[00228] As mentioned above, the ability of a UTRSF to support multiple protographic arrays can be explicitly provided in a UTRSF capability information element (EI). For example, in the EU EUTRA capability EI, an additional item can be added that specifies whether or not the UTRSF supports multiple protographic arrays and / or indicates how many protographic arrays the UTRSF supports. This can be indicated below by: ldpc_matrix_number is an INTEGER {1,2} if only two VPBD codes are used in the system. EUTRAdo EU Capacity = accessStratumRelease EU Category pdcp parameters phyLayerParameters rf parameters measParameters ;; / ii í featureGroupIndicators i; InterRAT parameters utraFDD utraTDDl28 utraTDD384 utraTDD768 cdma2000-HRPD cdma2000-1xRTT }. < <::::i::i::nonCriticalExtension:::: SEQUENCE { AccessStratumRelease, WHOLE NUMBER (1..5), INTEGER {1,2,3}, PDCP Parameters, PhyLayerParameters, RF Parameters, MeasParameters, BIT CHAIN ​​(SIZE (32)) OPTIONAL, tttttttttlOiOOiffiliie IRAT-UTRA-FDD Parameters IRAT-Parameters UTRA-TDD12S IRAT-Parameters UTRA-TDD384 IRAT-Parameters UTRA-TDD768 IRAT-Parameters GERAN IRAT-Parameters CDMA2000-HRPD IRAT-Parameters CDMA2000-1XRTT EU-EUTRA-Capacity-v920-IEs OPTIONAL, OPTIONAL, OPTIONAL, OPTIONAL, OPTIONAL, OPTIONAL, OPTIONAL, OPTIONAL,

[00229] Figure 21 is a flow diagram 2100 of another exemplary method of protographic matrix selection for a specific UTRSF at a base station (e.g., eNB), where the base station is provided with UTRSF capacity information. In the example illustrated in Figure 21, a base station receives a CRR message that includes UTRSF capacity information (2110). The base station can determine if the UTRSF capacity information, EU idp capacity information, includes ldpc_matrix_number > 1. In a condition where the UTRSF capacity information does not indicate the capacity to apply more than one protographic matrix (e.g., EU ldpc capacity information does not have ldpc_matrix_number > 1), a single protographic matrix can be applied (2130). In a condition where the capacity information of Petition 870190085290, dated 08 / 30 / 2019, p. 93 / 150 88 / 106 UTRSF indicate the ability to apply more than one protographic matrix (e.g., EU idpc capability information has ldpc_matrix_number > 1), multiple protographic matrices can be applied (2140).

[00230] As described in detail above, GBC generation may include determining the number of BCs in each GBC and the total number of GBCs in each BT. GBC-related parameters can be signaled to a UTRSF in several different ways.

[00231] In one embodiment, the number of BCs in each GBC and the total number of GBCs in each BT may depend on the maximum number of BCs (i.e., Xmax) supported in a GBC. In another embodiment, these numbers may depend on the maximum number of bits (i.e., Pmax) supported by a GBC. In these embodiments, Xmax or Pmax may need to be signaled from the transmitter to the receiver. In these embodiments, this information may be included in the ICEDs. Here, the value of Xmax or Pmax may be selected from a set of candidates, where only the candidate index may need to be included in the ICEDs for downlink transmissions or in the ICEAs for uplink transmissions. For example, the maximum number of BCs in a GBC can be chosen from the set x = (5, 10, 15 / 20}. Bits '00' can indicate 5, bits 'Γ' can indicate 10, bits '10' can indicate 15, and bits '11' can indicate 20. ICEDs or ICEAs can also include 2 more bits compared to GBC generation.

[00232] An alternative way to configure the GBC can be to use an offset setting. An offset can be selected from the set {-1,0,1}, where '-1' can imply that the new maximum number of BCs is less than the previous value, '0' can imply that the new maximum number of BCs is equal to the previous value, and '1' can imply that the new maximum number of BCs is greater than the previous value. For example, assume that the maximum number of BCs in the previous generation of GBC for a Petition 870190085290, dated 08 / 30 / 2019, pp. 94 / 150 / 106 BT previous is 10 from the set of ^ = (5,10.,15,20} the shift value of '-Γ' may imply that the new value is 5, the shift value of '0' may imply that the new value is 10 and the shift value of '1' may imply that the new value is 15.

[00233] In the modes described above, the GBC size is assumed to be dynamically adjustable via ICED indication. In some modes, this configuration may be semi-static. In such modes, signaling may be based on CRR. For example, the GBC enabler and GBC size may be configured during CRR connection establishment or in the CRR connection reconfiguration message. For example, the following items may be added to the CRRConnectionReconfiguration message: CRRConnectionRecognization SEQUENCE {:))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))): GBC size index of DL INTEGER {0,1,2,3} GBC size index of UL INTEGER {0,1,2,3}

[00234] The GBC size configuration can also be based on 2 levels: either semi-static via CRR signaling or dynamic via ICED / ICEA signaling. For example, CRR signaling can provide a default GBC size based, for example, on UTRSF capacity and channel bandwidth, while ICED signaling can provide an adjusted GBC size based, for example, on channel condition, total number of BCs in a BT and data QoS.

[00235] In another embodiment, the number of GBCs in each GBC and the total number of GBCs in each BT may depend on the maximum number of GBCs (i.e., £') supported in a BT. In embodiments, the value of can be set in a semi-static way, such as through CRR signaling, for example, where only the candidate index may need to be included in the CRR message. For example, the maximum number of GBCs in a BT can be chosen from the set B={10*20}{30,40} the index 0 Petition 870190085290, dated 08 / 30 / 2019, page 95 / 150 90 / 106 may indicate B' — 10, index 1 may indicate B' —20, index 2 may indicate Bf= 30 and index 3 may indicate Bf=40.

[00236] The GBC number can be configured during CRR connection establishment or in the CRR connection reconfiguration message. For example, the following items can be added to the CRRConectionReconfiguration message. GBC Number Index for DL ​​INTEGER {0,1,2,3} GBC Number Index for UL INTEGER {0,1,2,3}

[00237] The DL / UL GBC enabler in the message above can be combined with the DL / UL GBC number index. If the DL / UL GBC functionality is disabled, then the corresponding DL / UL GBC number can be equal to the number of BCs per BT. In other words, each GBC can be composed of a single BC. This information can be loaded into the DL / UL GBC number index if a value is reserved in the DL / UL GBC number index to indicate this.

[00238] In modalities, a list of possible Br values ​​can be configured via CRR signaling, while selection from the configured GBC numbers can occur via MAC signaling. For example, the set of possible B' values ​​can be {10, 20, 30, 40}. This set of values ​​can be provided by the CRR connection establishment message or the CRR connection reconfiguration message. Depending, for example, on data QoS, data size, channel conditions, and channel bandwidth, the actual GBC number can be selected from the configured GBC numbers and signaled via MAC signaling. In the example above, MAC signaling can use the index 00 for GBC number equal to 10, 01 for GBC number equal to 20, 10 for GBC number equal to 30, and 11 for GBC number equal to 30. Petition 870190085290, dated 08 / 30 / 2019, page 96 / 150 91 / 106

[00239] In modalities, a list of possible values ​​can be configured via CRR signaling, while selection from the configured GBC numbers can occur via LI signaling (e.g., ICED). For example, the set of possible B' values ​​can be {10, 20, 30, 40}. This set of values ​​can be provided by the CRR connection establishment message or the CRR connection reconfiguration message. Depending, for example, on data QoS, data size, channel conditions, and channel bandwidth, an actual GBC number can be selected from the configured GBC numbers and signaled via LI signaling (e.g., ICED). In the example above, LI signaling can use the index 00 for GBC number equal to 10, 01 for GBC number equal to 20, 10 for GBC number equal to 30, and 11 for GBC number equal to 30.

[00240] If a BT contains fewer BCs (i.e., B BCs, where B < Bf) than the configured value, dynamic signaling in ICED or ICEA may be applied. Here, a one-bit indicator may be added to the ICED or ICEA. Setting this bit to 1 may imply that B — B\ that subsequently each GBC contains 1 BC and that the BT contains fewer than GBCs. In the case of retransmissions, the number of GBCs retransmitted may be less than the number of GBCs contained in the initial transmission. In this case, a one-bit indicator may be added to the ICED or ICEA, indicating that the number of GBCs in the retransmission is less than the configured number of GBCs.

[00241] In some modes, ICEDs or ICEAs can include information about actual GBCs used in a current transmission. A simple way to handle this is to include a GBC bitmap in the ICEDs or ICEAs, where the bitmap size is the number of GBCs configured. For example, in a condition where the number of GBCs configured is 5, the Petition 870190085290, dated 08 / 30 / 2019, pages 97 / 150 / 106 ICEDs can contain 5 bits, each bit corresponding to a GBC. If the bit is set to 0, the corresponding GBC is not included in the current transmission. If the bit is set to 1, the GBC is included in the current transmission.

[00242] The number of NACK / ACK feedback bits from the receiver can be equal to the configured (or indicated) GBC number or equal to the actual (or programmed) transmitted GBC number. The selection between these two options can also be predetermined or configured (e.g., via CRR signaling). For example, the following items can be added to the CRRConectionReconfiguration message. CRRConnectionReconfigurationSEQUENCE { Configured_CBG ACK_NACK ENUMERATED {true, false}

[00243] In a condition where Configured_GBC_ACK_NACK is set to true, the ACK / NACK feedback can be based on the configured GBC number. Otherwise, the ACK / NACK feedback can be based on the actual transmitted GBC number.

[00244] Figure 22 is an exemplary 2200 signaling diagram for a bit-based GBC indication and associated ACK / NACK feedback. In the example illustrated in Figure 22, CRR and / or MAC signaling is used to provide a configuration where each BT can contain a maximum of 5 GBCs. A 2210 transmitter can send an initial 2230 transmission to a 2200 receiver including all 5 GBCs. Here, the ICEDs include a 5-bit GBC bitmap, with all bits set to 1. In the illustrated example, the 2220 receiver decodes the first, second, and fourth GBCs and fails to decode the third and fifth GBCs. The receiver can provide ACK / NACK feedback given by [Ack, Ack, Nack, Ack, Nack]. In the first retransmission 2250, only the third and fifth GBCs are retransmitted, and the bitmap of the ICED GBC is set to [0, 0, 1, 0, 1]. Petition 870190085290, dated 08 / 30 / 2019, p. 98 / 150 93 / 106

[00245] Receiver 2220 can decode both GBCs retransmitted this time. Receiver 2220 can have two options for ACK / NACK feedback 2260. One option can be to have the number of ACK / NACK bits equal to the configured number of GBCs (i.e., 5). Here, the 2260 feedback is [A, A, A, A, A], indicating that all 5 GBCs were successfully decoded. Another option can be to have the number of ACK / NACK bits in the 2260 feedback equal to the number of GBCs included in the retransmission (i.e., 2 for the first retransmission). Here, the 2260 feedback is [A, A], indicating that the two GBCs in the first retransmission were successfully decoded.

[00246] In bitmap-based GBC indication, the NID for BT can be reused. Here, the NID can serve as GBC disposal information.

[00247] As an alternative to bitmap-based GBC indication, an actual GBC number can be indicated in each transmission. This number can be included in the ICED or ICEA. For example, assume the configured GBC number is . For each transmission, the ICED or ICEA can use Γ^°λ?2 bits to indicate how many GBCs are included in the transmission. The actual number of GBCs in the initial transmission can be equal to the configured GBC number. If the number of BCs per BT (i.e., B) is less than the configured GBC number, then the actual number of GBCs in the initial transmission can be equal to the number of BCs per BT. The actual number of GBCs in a retransmission can depend on the ACK / NACK feedback from the previous transmission. Specifically, the actual number of GBCs in a retransmission can be equal to the number of NACK bits in the feedback.

[00248] Figure 23 is an exemplary 2300 signaling diagram for a real number of GBCs and associated ACK / NACK feedback. In the example illustrated in Figure 23, signaling of Petition 870190085290, dated 08 / 30 / 2019, page 99 / 150 94 / 106 CRR and / or MAC is used to provide a configuration that each BT can contain, at most, 5 GBCs. A 2310 transmitter can send an initial 2330 transmission to a 2320 receiver including all 5 GBCs. Here, the ICEDs can contain the GBC real number field (i.e., 5), and only 3 bits are used as [Iog25]=3. If the receiver decodes the first, second, and fourth GBCs and fails to decode the third and fifth GBCs, the 2320 receiver can provide 2340 feedback given by [Ack, Ack, Nack, Ack, Nack]. In the first 2350 retransmission, only the third and fifth GBCs can be included, and the actual number of GBCs in the ICEDs can be set to 2. If receiver 2320 decodes both BCs this time, the ACK / NACK feedback from receiver 2320 can be sent using several options. In one option, the number of ACK / NACK bits in the 2360 feedback can be equal to the configured number of GBCs (i.e., 5).Here, the 2360 feedback will be [A, A, A, A, A], indicating that all 5 GBCs were successfully decoded. A second option could be that the number of ACK / NACK bits in the 2360 feedback is equal to the actual number of GBCs included in the 2350 retransmission (i.e., 2 for the first 2350 retransmission). Here, the 2360 feedback will be [A, A], indicating that the two GBCs in the first 2350 retransmission were successfully decoded.

[00249] A determination of ^max UU may depend on several factors, including, for example, channel condition (e.g., received signal strength (IISR), received reference signal power (PSRR), and / or received reference signal quality (QSRR)), UTRSF capability, channel bandwidth, total number of GBCs in a BT, and / or data QoS. A better channel condition may imply that more bits of SRAH ACK / NACK information can be encoded and fed back. This may implicitly alleviate the limitation of the total number of GBCs in a BT. Therefore, the corresponding Petition 870190085290, dated 08 / 30 / 2019, pp. 100 / 150 95 / 106 may be lower.

[00250] For a UTRSF with fewer capacities, the number of SRAH processes it can support may be limited. Therefore, the value of should be selected to be higher, so that fewer GBCs (and therefore fewer SRAH processes) per BT can be maintained.

[00251] For a UTRSF operating at a higher bandwidth, more bits of ACK / NACK information from SRAH can be encoded and fed back. This can alleviate the limitation on the total number of GBCs in a BT. Therefore, the corresponding ^ma:c can be smaller.

[00252] Transmitting more data per BT can result in more BCs. Therefore, the value of must be larger to correspond to the total number of BCs to be sent in a BT.

[00253] For some data with high reliability requirements, the value of 2max should be lower in order to optimize FAR performance, since the ratio of VRC bits to the total number of bits in a GBC may be higher. For some data with low latency requirements, the value of should be lower in order to increase the probability of successful detection.

[00254] The number of VRC bits per GBC can also be signaled as the receiver may need this information for error detection. Possible VRC bit numbers can be selected from a set of candidates where only the candidate index may need to be included in ICED for downlink transmissions or ICEA for uplink transmissions.

[00255] The number of VRC bits per GBC can also be configured using some high-level signaling. In this case, the GBC-level VRC length can be semi-statistical.

[00256] In a situation where two or more code words are used for MIMO applications, GBC-related signaling can be Petition 870190085290, dated 08 / 30 / 2019, pp. 101 / 150 / 106, is defined. For example, the maximum number of GBCs for each codeword can be configured by CRR flagging. A simple way to do this might be to assume that all codewords contain the same number of GBCs. Therefore, configuring a single GBC number might be sufficient. Another way to do this might be to assume that each codeword includes a different number of GBCs. Here, configuring the GBC number for each codeword might be necessary. Yet another way to do this might be to configure the maximum number of GBCs shared by all codewords.

[00257] ICED information may indicate that GBCs are included in current transmissions. In the case of multiple codewords, this indication may be based on the codeword. Alternatively, the indication may be included in ICEDs corresponding to a single codeword.

[00258] If GBC is applied, then the ACK / NACK feedback can be multi-bit. Additionally, GBC-level ACK / NACK and BT-level ACK / NACK can occur simultaneously. Consequently, two-level ACK / NACK feedback can be included in the same ICEA or ICED.

[00259] GBC-level ACK / NACK can be based on GBC-level VRC verification or it can be based on the AND logic of ACK / NACK from all BCs in a GBC. BT-level ACK / NACK can be primarily based on BT-level VRC verification. It is possible that even all GBC levels may be acknowledged, and BT-level VRC verification may fail. Therefore, BT-level ACK / NACK feedback may be required in addition to GBC-level ACK / NACK feedback.

[00260] At the BT level, a single-bit ACK / NACK can be multiplexed with a multi-bit GBC-level ACK / NACK. By Petition 870190085290, dated 08 / 30 / 2019, p. 102 / 150 / 106, for example, the BT-level ACK / NACK may be located at the beginning, while the GBC-level ACK / NACK may be located later. The number of GBC-level ACK / NACK bits may change with retransmissions and may change with BTs, depending on the number of GBCs used in the current transmissions.

[00261] Figures 24A, 24B, 24C, and 24C are diagrams 2400A, 2400B, 2400C, and 2400D of an example of GBC-level ACK / NACK feedback and retransmission assisted by BT-level ACK / NACK. In the illustrated example, it can be assumed that the number of ACK / NACK feedback bits is equal to the number of actual (or programmed) transmitted GBCs. The same BT-level ACK / NACK approach can be applied to the case where the number of ACK / NACK feedback bits is equal to the number of configured (or indicated) GBCs.

[00262] The illustrated example assumes that a BT has 10 GBCs. After the first transmission, the third, fifth, and ninth BCs are not decoded correctly. The BT and mixed GBC ACK / NACK 2400A have 11 bits, including a 10-bit GBC-level ACK / NACK 2410 and a one-bit BT-level ACK / NACK 2420, as illustrated in Figure 24A.

[00263] After the first retransmission of the failed GBCs, only the ninth GBC is still incorrectly decoded. The BT and ACK / NACK of mixed GBC 2400B can have 4 bits, including a 3-bit GBC-level ACK / NACK 2430 and a 1-bit BT-level ACK / NACK 2440, as illustrated in Figure 24B.

[00264] If, after the second retransmission of the ninth GBC, all GBCs are correctly decoded and the entirety of BT also passes the VRC check, the BT and the ACK / NACK of mixed GBC 2400C may have two bits, including a GBC-level ACK / NACK of one bit 2450 and a BT-level ACK / NACK of one bit 2460, as illustrated in Figure Petition 870190085290, dated 08 / 30 / 2019, pp. 103 / 150 / 106 24C. If, after the second retransmission of the ninth GBC, all GBCs are correctly decoded, but the entirety of BT fails the VRC check, the BT and ACK / NACK of mixed GBCs 2400D may have 2 bits, including a GBC-level ACK / NACK of one 2470-bit and a BT-level ACK / NACK of one 2480-bit, as illustrated in Figure 24D.

[00265] The BT-level ACK / NACK can also be implicitly indicated by the GBC-level ACK / NACK if the number of ACK / NACK feedback bits is equal to the number of GBCs configured (or indicated). Specifically, if all configured GBCs are successfully decoded, and the BT-level VRC check passes, the receiver can send ACK for all GBCs. If all configured GBCs are correctly decoded, but the BT-level VRC check fails, the receiver can send NACK for all GBCs.

[00266] Consider the same example as above, and assume there are 10 GBCs in a BT. After the first transmission, the third, fifth, and ninth GBCs are not decoded correctly. The GBC ACK / NACK has 10 bits.

[00267] Figures 25A, 25B, 25C and 25C are diagrams 2500A, 2500B, 2500C and 2500D of another example of GBC-level ACK / NACK feedback and retransmission assisted by BT-level ACK / NACK based on the example above. Figure 25A shows the GBC 2500A ACK / NACK which has 10 bits, as mentioned in the previous paragraph. After the first retransmission of the failed GBCs, only the ninth GBC is still incorrectly decoded. The GBC 2500B ACK / NACK has 10 bits, as illustrated in Figure 25B. If, after the second retransmission of the ninth GBC, all GBCs are correctly decoded and the total BT also passes the VRC verification, the ACK / NACK of GBC 2500C has 10 bits, as illustrated in Figure 25C. Petition 870190085290, dated 08 / 30 / 2019, pages 104 / 150 / 106 If, after the second retransmission of the ninth GBC, all GBCs are correctly decoded, but the overall BT fails the VRC check, the ACK / NACK of GBC 2500D has 10 bits, as illustrated in Figure 25D.

[00268] In LTE, the maximum number of redundancy versions is 4. Thus, 2 bits are reserved in ICED / ICEA for the VR field. In new radio (nr), the maximum number of redundancy versions may be greater than 4. Therefore, more bits may be needed in ICED / ICEA for the VR field. To avoid increasing the ICED / ICEA payload size, the EMC field in ICED / ICEA can be used to carry the VR information.

[00269] In the initial LTE transmission, the EMC index can be selected from 0 to 28, and VR is set to 0. In LTE retransmission, the EMC index can be selected from 29 to 31. Therefore, the EMC index in ICED / ICEA has 5 bits for the 32 possible values.For retransmitted PDSCH, the EMC index is determined by modulation order rather than by VR. For retransmitted PUSCH, the EMC index is determined by VR rather than by modulation order.

[00270] For retransmitted NR-PDSCH, it is considered that only 2 bits are used for the EMC index in ICEDs, which depends on the modulation order. This saves 3 bits of the EMC index in ICEDs. The 3 saved bits can be used for VR increments. This usage is based on the assumption that the VR field for the initial transmission should be restricted to 2 bits. In other words, the possible VRs for the initial transmission can be selected from 0, 1, 2, 3. Consider the example where the EMC index of the first transmission = '10010' and VR = '00'. This implies that the EMC index is 18 and the modulation order is 6. In the retransmission, the EMC index = '10' and VR = '00001'. This implies that the modulation order is 6 and the redundancy version is 1. Through this dynamic switching of the EMC index field and the VR field in ICEDs between initial transmissions and retransmissions, the ICED payload size can be maintained. Petition 870190085290, dated 08 / 30 / 2019, pp. 105 / 150 100 / 106 constant while the number of supported VRs can be increased from 4 (i.e., 2 bits) to 32 (i.e., 5 bits). In other words, dynamic switching of the EMC index field in ICEDs between initial transmission and retransmission can enable support for up to 32 VRs.

[00271] If, in NR, the supported VR number is not as large as 32, the bits saved from the EMC fields in retransmissions can be used to indicate GBC information (for example, the indication of the actual GBC number is less than the indication of the configured GBC number or the actual GBC number). A similar scheme can be applied to ICEA.

[00272] Several bit interleaver modes are described above. Various modulation mapping orders are defined (e.g., natural order, inverse order, and shifted circular order). In modes, the modulation mapping order can be synchronized between the transmitter and receiver. There are several ways to handle such synchronization between the transmitter and receiver: static signaling, semi-static signaling, dynamic signaling with additional ICED / ICEA bits, and dynamic signaling with an EMC table.

[00273] For static signaling, there is no explicit signaling for the modulation mapping order. The modulation mapping order can be linked to the VR. In a modality, each VR corresponds to either a natural modulation mapping order or an inverse modulation mapping order. For example, VR0 and VR2 can always be in the natural modulation mapping order, and VR1 and VR3 can always be in the inverse modulation mapping order. This is because VR0 and (VR1, VR3) may have some overlap in encoded bits. The inverse modulation mapping order (VR1, VR3) provides diversity of those overlapping encoded bits. Similarly, VR2 and (VR1, VR3) may have some overlap in encoded bits. The mapping order of Petition 870190085290, dated 08 / 30 / 2019, pp. 106 / 150 101 / 106 reverse modulation (VR1, VR3) provides diversity of those overlapping encoded bits. It may be possible that the VR1, VR3 reverse modulation mapping order is only applicable to high-order modulations such as 16QAM, 64QAM, and 256QAM. In another mode, each VR corresponds to a circularly shifted order with a certain offset value. For example, VR0 can always be in a circularly shifted order with an offset value of 0, VR1 can always be in a circularly shifted order with an offset value of 2, VR2 can always be in a circularly shifted order with an offset value of 4, and VR3 can be in a circularly shifted order with an offset value of 6. In yet another mode, each VR can correspond to a certain IOMM value. For example, VR0 can always correspond to IOMM=0, VR1 can always correspond to IOMM=1, VR2 can always correspond to IOMM=2, and VR3 can always correspond to IOMM=3.

[00274] For semi-static signaling, some CRR signaling can be used to configure the modulation mapping order, and the modulation mapping order can be linked to VR. Here, the CRR connection establishment or CRR connection reconfiguration message can be used for configuration. For example, the following items can be added to the CRRConectionReconfiguration message: CRRConnectionReconfiguration :!= SEQUENCE { RVO modulation mapping order INTEGER {0,1,2,3} ]) / / / / ) / iÍròf^O?êiameniçde / modula^[^ RV2 modulation mapping order INTEGER {0,1,2,3} where the value 0 indicates a shifted circular order with a shift value of 0, the value 1 indicates a shifted circular order with a shift value of 2, the value 2 indicates a shifted circular order with a shift value of 4, the value 3 indicates a shifted circular order with a shift value of 6. Petition 870190085290, dated 08 / 30 / 2019, pp. 107 / 150 102 / 106

[00275] In another modality, the value may indicate the index of IOMM, and the following items can be added to the message. CRRConnectionReconfiguration: CRRConnectionReconfiguration SEQUENCE [ New order of RVO modulation mapping New order of RV1 modulation mapping New order of RV2 modulation mapping New order of RV3 modulation mapping ENUMERADO {true, false} ENUMERADO {true, false} ENUMERADO {true, false} ENUMERADO {true, false} where the value true indicates a natural modulation mapping order and the value false indicates an inverse modulation mapping order.

[00276] A static or semi-static signaling of the modulation mapping order may not benefit the type of combination pursued by SRAH, since VR0 is linked to a constant modulation mapping order. To improve the diversity level, VR0 can switch between a natural modulation mapping order and an inverse modulation mapping order based on the NID value. If the NID value is switched (i.e., new transmission), then VR0 can be used for the natural modulation mapping order. Otherwise, VR0 can be used for the inverse modulation mapping order.

[00277] For dynamic signaling with additional ICED / ICEA bits, the modulation mapping order can be dynamically signaled in additional ICED / ICEA fields. For example, 1 additional bit in the ICED or ICEA can indicate whether a natural modulation mapping order is used or an inverse modulation mapping order is used. In another example, 2 additional bits in the ICED or ICEA can indicate the offset values ​​(i.e., 0, 2, 4, 6) of the offset circular modulation mapping. In yet another example, additional bits in the ICED or ICEA can indicate the IOMM index.

[00278] For dynamic signaling with an EMC table, it can be assumed that for the initial transmission, the modulation mapping order Petition 870190085290, dated 08 / 30 / 2019, pages 108 / 150 103 / 106 natural is always applied. The new modulation mapping order can only occur in retransmissions. Therefore, the EMC table can be used to indicate the new modulation mapping order.

[00279] For downlink transmissions, the EMC table for PDSCH can use only 3 or 4 indices (i.e., 29, 30, 31, and / or 28) to indicate the modulation order in retransmissions. For uplink transmissions, the EMC table for PUSCH can use only 3 or 4 indices (i.e., 29, 30, 31, and / or 28) to indicate the VR version in retransmissions. Here, 2 bits can actually be used. Considering that the EMC indices have a total of 5 bits, an additional 3 bits can be made available to indicate the modulation mapping order for downlink retransmissions or uplink retransmissions. One, two, or three of the additional bits can be used. In the case of 1 bit, it can be used to indicate whether a natural modulation mapping order or an inverse modulation mapping order is used in the current retransmission.In the case of 2 or 3 bits, they can be used to indicate the offset value in the circularly shifted modulation mapping or to indicate the IOMM index.

[00280] The performance of some VPBD decoding algorithms may depend on an accurate estimate of the SNR. For example, the offset minimum sum decoder or the adjusted minimum sum decoder may not be sensitive to SNR estimation error, while the normalized minimum sum decoder may not be sensitive to SNR estimation error.

[00281] The base station (e.g., eNB, gBN, or TPR) may need to know about the decoding capabilities of a UTRSF, including the decoding algorithms that the UTRSF can support. This can be done in CRR messages at the initial camp stage.

[00282] Based on channel conditions, as well as some tests of Petition 870190085290, dated 08 / 30 / 2019, pp. 109 / 150 104 / 106 SNR alignment, the base station can estimate whether the UTRSF is capable of having the appropriate SNR estimate. If so, then the more advanced decoding algorithm, which may be sensitive to SNR estimate error, can be used. This decision can be communicated from the base station to the UTRSF using CRR messages. This message can be updated according to channel conditions.

[00283] Figure 26 is a 2600 signal diagram of an exemplary message exchange for UTRSF capability with supported decoding algorithms. In the example illustrated in Figure 26, an eNB 2610 sends a 2630 EU capability request message to a 2620 UTRSF. In response to the 2630 request, the 2620 UTRSF sends a 2640 EU capability response, which may include UTRSF decoding algorithms. The eNB 2610 receiving the 2640 EU capability response may send a suggested decoding algorithm to the 2620 UTRSF (2650), which can be determined based, at least in part, on the UTRSF decoding algorithms supported by the 2620 UTRSF, as indicated in the 2640 EU capability response.

[00284] Since VPBD can also be used for eMBB UL, similar adaptive SNR estimation decoding algorithms can be used for UL. Alternatively, a more advanced decoding algorithm that is sensitive to SNR estimation error can be used. This algorithm can, for example, be predefined or specified for use at the base station.

[00285] Regarding symbol-level interleaving for SRAH retransmissions, a simple symbol interleaver can be used. For example, a column-row interleaver can be used, in which the bit stream of a codeword can first be written along the rows, then the columns. The interleaver can first be read through the columns and then the rows. Petition 870190085290, dated 08 / 30 / 2019, pages 110 / 150 105 / 106

[00286] Figure 27 is a diagram 2700 of an exemplary symbol-level row-column interleaver 2710. In the example illustrated in Figure 27, the modulation symbols S1,1...Sm,nm of each BC1...CBm are distributed over the frequency domain. A row-column interleaver, as illustrated in Figure 27, can be used for the first transmission. If a retransmission is required, a similar interleaver can be used. However, it is likely that the subcarriers that include BC modulation symbols in the first transmission will also include modulation symbols of the same BC in the retransmission. This can lead to a performance degradation in BC decoding if the subcarriers experience deep fading. To avoid this problem, a scrambling operation can be applied to the component BCs in a codeword for the retransmissions before applying the row-column interleaver.

[00287] Figure 28 is a diagram 2800 of an exemplary symbol-level row-column interleaver 2810 with retransmission shuffling 2820. In the example illustrated in Figure 28, retransmission shuffling 2820 occurs before interleaving using the row-column interleaver 2810. In the illustrated example, BCm 2830a is moved to the beginning of codeword 2840 (designated as 2830b). In modes, other shuffling schemes may be applied. For example, if a BC is at the i-th location in a codeword in the initial transmission, it may be adjusted to the (i + offset)-th location in a codeword for retransmission. In modes, the shuffling algorithm may depend on the transmission number. For example, the first retransmission and the second retransmission may use different scrambling parameters.

[00288] Although the resources and elements are described above in specific combinations, one skilled in the art should consider that each Petition 870190085290, dated 08 / 30 / 2019, pp. 111 / 150 106 / 106 resource or element can be used alone or in any combination with the other resources and elements. Furthermore, the methods described herein can be implemented in a computer program, software, or firmware embedded in a computer-readable medium for execution by a computer or processor. Examples of computer-readable media include electronic signals (transmitted via wired and / or wireless connections) and computer-readable storage media. Examples of computer-readable storage media include, but are not limited to, read-only memory (ROM), random access memory (RAM), a register, cache memory, semiconductor memory devices, magnetic media such as internal hard disks and removable disks, magneto-optical media, and optical media such as CD-ROMs and / or digital versatile discs (DVDs).A processor, in conjunction with software, can be used to implement a radio frequency transceiver for use in a UTRSF, an EU, a terminal, a base station, an RNC, and / or any host computer. Petition 870190085290, dated 08 / 30 / 2019, pp. 112 / 150< / nulos> < / nulos>

Claims

1 / 5 CLAIMS 1. Wireless transmit / receive unit, WTRU, characterized in that it comprises: a transceiver; and a processor, the transceiver and the processor are configured to: fix transport block (TB) level cyclic redundancy check (CRC) bits to a payload of one TB, select a first low-density parity check (LDPC) base graph (BG) or a second LDPC BG based on a code rate (CR) and payload size, apply, based on the first or second LDPC BG selected, the corresponding CB segmentation scheme to segment the TB that includes the TB-level CRC bits into B CBs, where B is a positive integer having a value greater than 1, receive code block group (CBG) configuration information from a base station, determine L CBGs based on the CBG configuration information such that each of a first mod(B,L) CBGs comprise a first number of CBs and each remaining (L - mod(B,L)) CBGs comprise a second number of CBs, where L is a positive integer having a value greater than 1, and where the second number is different from the first number, determine a number of CB-level CRC bits for fixing CB-level CRC bits, under a condition where the determined number of CB-level CRC bits for fixing CB-level CRC bits is > 0, fix the determined number of CB-level CRC bits to each of the CBs, encode each of the CBs using the selected LDPC Petition 870250106406, dated 11 / 19 / 2025, page 13 / 26 2 / 5 BG, and transmit the encoded CBs corresponding to the L CBGs.

2. Unit according to claim 1, characterized in that the transceiver and processor are further configured to add payload bits to each of the CBs, wherein the number of payload bits depends on a set of elevation measures, the selected LDPC BG and a determined CB size.

3. Unit according to claim 1, characterized in that the determined number of CB-level CRC bits is 0.

4. Unit according to claim 1, characterized in that the determined number of CB-level CRC bits is 24.

5. Unit according to claim 1, characterized in that a maximum number of CBGs per TB is configured by the radio resource control (RRC) signaling, and the transceiver and processor are additionally configured to apply CBG configuration information to select a value for L that is less than or equal to the maximum configuration.

6. Unit according to claim 1, characterized in that the processor and transceiver are further configured to receive downlink control information (DCI) associated with at least one transmission or retransmission of encoded CBs, wherein the DCI includes CBG scheduling information that identifies which of the CBGs should be transmitted or retransmitted, wherein the CBG scheduling information comprises at least one of: and a CBG bitmap indicating each CBG to include in the transmission or retransmission, or a number of CBG fields indicating the quantity of CBGs to include in the retransmission.

7. Unit according to claim 1, characterized Petition 870250106406, dated 11 / 19 / 2025, page 14 / 26 3 / 5 by the fact that the first number of CBs is equal to a ceiling of (B / L) and the second number of CBs is equal to a floor of (B / L).

8. Unit according to claim 1, characterized in that: the processor and the transceiver are configured to transmit to the base station capacity information about the use of CBGs, and the capacity information about the use of CBGs comprises information indicating support for CBG-based transmission.

9. Method implemented in a wireless transmit / receive unit, WTRU, wherein the method is characterized by comprising: fixing transport block (TB) level cyclic redundancy check (CRC) bits to a TB payload; selecting a first low-density parity check (LDPC) base graph (BG) or a second LDPC BG based on a code rate (CR) and a payload size; applying, based on the first or second LDPC BG selected, the corresponding CB segmentation scheme to segment the TB that includes the TB-level CRC bits into B CBs, where B is a positive integer having a value greater than 1; receiving code block group (CBG) configuration information from a base station;Determine L CBGs based on CBG configuration information such that each of a first mod(B,L) CBG comprises a first number of the CBs and each remaining (L - mod(B,L)) CBG comprises a second number of the CBs, where L is a positive integer having a value greater than 1, and where the second number is different from the first number; Petition 870250106406, 11 / 19 / 2025, p. 15 / 26 4 / 5 determine a number of CB-level CRC bits for fixing CB-level CRC bits; in a condition where the determined number of CB-level CRC bits for fixing CB-level CRC bits is > 0, fix the determined number of CB-level CRC bits to each of the CBs; encode each of the CBs using the selected LDPC BG; and transmit the encoded CBs corresponding to the L CBGs.

10. Method according to claim 9, characterized in that it further comprises adding load bits to each of the CBs, the number of load bits depending on a set of elevation measurements, the selected LDPC BG and a determined CB size.

11. Method according to claim 9, characterized in that the determined number of CB-level CRC bits is 0.

12. Method according to claim 9, characterized in that the determined number of CB-level CRC bits is 24.

13. Method according to claim 9, characterized in that a maximum number of CBGs per TB is configured by the radio resource control (RRC) signaling, and the method further comprises applying CBG configuration information to select a value for L that is less than or equal to the maximum configuration.

14. Method according to claim 9, characterized in that it further comprises receiving downlink control information (DCI) associated with at least one of a transmission or retransmission of encoded CBs, wherein the DCI includes CBG scheduling information that identifies which of the CBGs should be transmitted or retransmitted, wherein the CBG scheduling information comprises at least one of: Petition 870250106406, dated 11 / 19 / 2025, page 16 / 26 5 / 5 a CBG bitmap indicating each CBG to include in the transmission or retransmission, or a number of CBG fields indicating the quantity of CBGs to include in the retransmission.

15. Method according to claim 9, characterized in that the first number of CBs is equal to a ceiling of (B / L) and the second number of CBs is equal to a floor of (B / L).

16. Method according to claim 9, characterized in that it further comprises: transmitting to the base station capacity information regarding the use of CBGs, and the capacity information regarding the use of CBGs comprises information indicating support for CBG-based transmission. Petition 870250106406, dated 11 / 19 / 2025, pp. 17 / 26

Images