Methods and apparatus for transmitting payload including radio network temporary identifier scrambled cyclic redundancy check bits in mobile communications
By strategically placing RNTI scrambled CRC bits at higher reliability positions within the payload and encoding with a polar code, the issue of RNTI false alarms is addressed, enhancing decoding robustness and reducing UL transmission collisions in New Radio mobile communications.
Patent Information
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2025-09-24
- Publication Date
- 2026-04-02
AI Technical Summary
In New Radio mobile communications, RNTI false alarms occur due to consecutively arranged RNTI scrambled CRC bits in the ending portion of the payload, leading to UL transmission collisions and compromising system stability.
RNTI scrambled CRC bits are placed at positions within the payload corresponding to higher bit-channel reliabilities, avoiding consecutive arrangement in the ending portion, and encoded using a polar code to enhance decoding robustness.
Significantly reduces RNTI false alarms while maintaining or improving decoding performance in wireless communication systems.
Smart Images

Figure CN2025123514_02042026_PF_FP_ABST
Abstract
Description
METHODS AND APPARATUS FOR TRANSMITTING PAYLOAD INCLUDING RADIO NETWORK TEMPORARY IDENTIFIER SCRAMBLED CYCLIC REDUNDANCY CHECK BITS IN MOBILE COMMUNICATIONSCROSS REFERENCE TO RELATED PATENT APPLICATION (S)
[0001] The present disclosure is part of a non-provisional application claiming the priority benefit of U.S. Patent Application No. 63 / 698, 087, filed 24 September 2024, the content of which herein being incorporated by reference in its entirety.TECHNICAL FIELD
[0002] The present disclosure is generally related to mobile communications and, more particularly, to transmitting payload including Radio Network Temporary Identifier (RNTI) scrambled Cyclic Redundancy Check (CRC) bits with respect to apparatus in mobile communications.BACKGROUND
[0003] Unless otherwise indicated herein, approaches described in this section are not prior art to the claims listed below and are not admitted as prior art by inclusion in this section.
[0004] In New Radio (NR) mobile communications, a Downlink (DL) control channel may be used to carry control information such as scheduling grants and resource allocation instructions. In some scenarios, a payload size of such DL control information may be small. For example, a Downlink Control Information (DCI) format 1_0 may include only 44 information bits and a 24-bit Cyclic Redundancy Check (CRC) appended to the information bits to support error detection, RNTI (Radio Network Temporary Identifier) classification, and to serve as an outer code to enhance list decoding performance.
[0005] In some scenarios, the positions of some CRC bits (e.g., last 16 CRC bits) may not be altered and may be subsequently scrambled using an RNTI to identify a target User Equipment (UE) . Then, Polar encoding and rate matching may be performed to generate the DL control codeword for over-the-air transmission.
[0006] However, based on the above mechanism, false alarm events related to RNTI detection (i.e., RNTI false alarm) may occur. Specifically, although the target UE may correctly decode its own DL control channel using the RNTI, other UEs with different RNTI values may also erroneously pass CRC checking and falsely regard the same DL control message as intended for themselves. The RNTI false alarm may result in multiple UEs responding to the same DCI message, which may cause Uplink (UL) transmission collisions (e.g., by using the same Resource Block (RB) assignment) and compromise system stability.
[0007] Therefore, there is a need for improved techniques to reduce RNTI-related false alarm probability while maintaining or improving the decoding performance of the DL control channel in wireless communication systems.SUMMARY
[0008] The following summary is illustrative only and is not intended to be limiting in any way. That is, the following summary is provided to introduce concepts, highlights, benefits and advantages of the novel and non-obvious techniques described herein. Select implementations are further described below in the detailed description. Thus, the following summary is not intended to identify essential features of the claimed subject matter, nor is it intended for use in determining the scope of the claimed subject matter.
[0009] An objective of the present disclosure is to propose solutions or schemes that address the aforementioned issues pertaining to transmitting payload including Radio Network Temporary Identifier (RNTI) scrambled Cyclic Redundancy Check (CRC) bits with respect to apparatus in mobile communications.
[0010] In one aspect, a method may involve an apparatus determining a payload including a plurality of information bits and a plurality of CRC bits. A plurality of RNTI scrambled CRC bits may be placed in positions within the payload, and the RNTI scrambled CRC bits may not be consecutively arranged in an ending portion of the payload. The method may further involve the apparatus encoding the payload using a polar code. The method may further involve the apparatus transmitting the payload to a receiver.
[0011] In one aspect, an apparatus may comprise a transceiver which, during operation, wirelessly communicates with a UE. The apparatus may also comprise a processor communicatively coupled to the transceiver. The processor, during operation, may perform operations comprising determining a payload including a plurality of information bits and a plurality of CRC bits. A plurality of RNTI scrambled CRC bits may be placed in positions within the payload, and the RNTI scrambled CRC bits may not be consecutively arranged in an ending portion of the payload. The processor may further perform operations comprising encoding the payload using a polar code. The processor may further perform operations comprising transmitting, via the transceiver, the payload to a receiver.
[0012] It is noteworthy that, although description provided herein may be in the context of certain radio access technologies, networks and network topologies such as Long-Term Evolution (LTE) , LTE-Advanced, LTE-Advanced Pro, 5th Generation (5G) , New Radio (NR) , Internet-of-Things (IoT) and Narrow Band Internet of Things (NB-IoT) , Industrial Internet of Things (IIoT) , and 6th Generation (6G) , the proposed concepts, schemes and any variation (s) / derivative (s) thereof may be implemented in, for and by other types of radio access technologies, networks and network topologies. Thus, the scope of the present disclosure is not limited to the examples described herein.BRIEF DESCRIPTION OF THE DRAWINGS
[0013] The accompanying drawings are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of the present disclosure. The drawings illustrate implementations of the disclosure and, together with the description, serve to explain the principles of the disclosure. It is appreciable that the drawings are not necessarily in scale as some components may be shown to be out of proportion than the size in actual implementation in order to clearly illustrate the concept of the present disclosure.
[0014] FIGs. 1A and 1B are diagrams depicting example scenarios under schemes in accordance with implementations of the present disclosure.
[0015] FIG. 2 is a diagram depicting an example scenario under schemes in accordance with implementations of the present disclosure.
[0016] FIG. 3 is a diagram depicting an example scenario under schemes in accordance with implementations of the present disclosure.
[0017] FIG. 4 is a diagram depicting an example scenario under schemes in accordance with implementations of the present disclosure.
[0018] FIG. 5 is a diagram depicting an example scenario under schemes in accordance with implementations of the present disclosure.
[0019] FIG. 6 is a block diagram of an example communication system in accordance with an implementation of the present disclosure.
[0020] FIG. 7 is a flowchart of an example process in accordance with an implementation of the present disclosure. DETAILED DESCRIPTION OF PREFERRED IMPLEMENTATIONS
[0021] Detailed embodiments and implementations of the claimed subject matters are disclosed herein. However, it shall be understood that the disclosed embodiments and implementations are merely illustrative of the claimed subject matters which may be embodied in various forms. The present disclosure may, however, be embodied in many different forms and should not be construed as limited to the exemplary embodiments and implementations set forth herein. Rather, these exemplary embodiments and implementations are provided so that description of the present disclosure is thorough and complete and will fully convey the scope of the present disclosure to those skilled in the art. In the description below, details of well-known features and techniques may be omitted to avoid unnecessarily obscuring the presented embodiments and implementations. Overview
[0022] Implementations in accordance with the present disclosure relate to various techniques, methods, schemes and / or solutions pertaining to transmitting payload including Radio Network Temporary Identifier (RNTI) scrambled Cyclic Redundancy Check (CRC) bits with respect to apparatus in mobile communications. According to the present disclosure, a number of possible solutions may be implemented separately or jointly. That is, although these possible solutions may be described below separately, two or more of these possible solutions may be implemented in one combination or another.
[0023] In some scenarios, a Polar code may be employed for encoding / decoding a message. In particular, the Polar code may be a class of capacity-achieving error-correcting codes that may exploit channel polarization to select reliable bit positions, enabling efficient encoding and decoding, sometimes for short control messages. The Polar code may have N (e.g., 128, 256, 512, etc. ) bit-length and include frozen bits (indicated as 0) and Polar code information bits (indicated as 1) .
[0024] FIGs. 1A and 1B illustrate example scenarios 100A and 100B under schemes in accordance with implementations of the present disclosure. For example, a Polar code is used for encoding / decoding Downlink Control Information (DCI) 0_0. The Polar code has a 256-bit length. The 256-bit sequence is illustrated as a matrix in FIG. 1A, where the top-left corner represents the first bit. The bits are arranged in a left-to-right, top-to-bottom order to cover all 256 bits. The Polar code includes 200 frozen bits (indicated as 0) and 56 Polar code information bits (indicated as 1) as shown in FIG. 1A. The DCI 0_0 includes a payload. The payload has a 56-bit length and includes 34 information bits and 24 CRC bits. The 56-bit payload corresponds to the 56-bit Polar code information bits.
[0025] In this example, the last 16 CRC bits of the payload are scrambled using an RNTI. At the receiver side, Polar decoding is performed using Successive Cancellation List (SCL) decoding, which improves Polar code performance by exploring multiple decoding paths, enhancing reliability through CRC validation. Over a wide range of channel Signal-to-Noise Ratio (SNR) values, from 0 dB to 20 dB in this example, a representative example of SCL output is illustrated in FIG. 1B.
[0026] More specifically, 8 candidate codeword vectors of the SCL output are shown. To facilitate bit-level comparison, each of the candidate codeword vectors is bitwise XORed with the first candidate (i.e., the most likely decoding result for the targeted receiver) in the list. Based on this example, it is observed that most of the bit errors (i.e., bit positions with a value of 1 after XOR) are concentrated in the last 16 bits, which are the RNTI scrambled CRC bits.
[0027] While the targeted receiver is capable of successfully decoding the control message (i.e., the payload) , there may be up to seven other receivers (each having RNTI values differing by only a few bits from the RNTI scrambled CRC bits for the target receiver) that may also inadvertently decode the same control message (i.e., the payload) , which may be RNTI false alarms. The RNTI false alarms may cause Uplink (UL) transmission collisions (e.g., by using the same Resource Block (RB) assignment indicated in the control message) and compromise system stability. Accordingly, to avoid such inadvertent RNTI decoding and potential uplink collisions, the CRC bits scrambled using the RNTI (i.e., the RNTI scrambled CRC bits) may be arranged at alternative bit positions within the payload.
[0028] Regarding the present disclosure, a transmitter (e.g., a network node) may determine a payload including a plurality of information bits and a plurality of CRC bits. The CRC bits may include a plurality of RNTI scrambled CRC bits. The plurality of RNTI scrambled CRC bits may be placed in positions within the payload, and the RNTI scrambled CRC bits may not be consecutively arranged in an ending portion of the payload. In other words, in the payload, the RNTI scrambled CRC bits may not be consecutively arranged in the ending portion of the payload. Then, the transmitter may encode the payload using a polar code and transmit the payload to a receiver (e.g., a User Equipment (UE) ) .
[0029] Accordingly, by placing the RNTI scrambled CRC bits at the positions corresponding to higher bit-channel reliabilities after Polar coding, the RNTI false alarm may be significantly reduced while maintaining or improving the coding (encoding / decoding) performance in wireless communication systems.
[0030] FIG. 2 illustrates an example scenario 200 under schemes in accordance with implementations of the present disclosure. Scenario 200 involves at least one network node and a UE, which may be a part of a wireless communication network (e.g., an LTE network, a 5G / NR network, an IoT network or a 6G network) . Scenario 200 illustrates the current network framework. The UE may connect to the network side. The network side may comprise one or more network nodes. It should be noted that, in FIG. 2, the network node is illustrated as a transceiver and the UE is illustrated as a receiver. However, it is not intended to limit the implementations of the transmitter and the receiver. In some cases, the network node may be the receiver, and the UE may be the transmitter.
[0031] In some embodiments, the transmitter may determine a payload associated with a control channel (e.g., Downlink (DL) control channel payload or Uplink (UL) control channel payload) including a plurality of information bits and a plurality of CRC bits. The transmitter may scramble some of the CRC bits by an RNTI, and these bits may be a plurality of RNTI scrambled CRC bits. The plurality of RNTI scrambled CRC bits may be placed in positions within the payload, and the RNTI scrambled CRC bits may not be consecutively arranged in an ending portion of the payload, while bits of the ending portion may have lower reliabilities after being encoded by the Polar code. In other words, in the payload, the RNTI scrambled CRC bits may not be consecutively arranged in the ending portion of the payload since the bits of the ending portion may not be reliable after being encoded by a Polar code. Then, the transmitter may encode the payload using the Polar code and transmit the payload to the receiver.
[0032] In some implementations, the RNTI scrambled CRC bits may be cyclically shifted to some positions within the payload, and the RNTI scrambled CRC bits may not be consecutively arranged in the ending portion of the payload. In particular, the transmitter may determine a payload. The payload may include a plurality of information bits and a plurality of CRC bits appended to the plurality of information bits. Then, the transmitter may scramble an ending portion of the plurality of CRC bits by an RNTI as a plurality of RNTI scrambled CRC bits.
[0033] Before encoding by a Polar code, the transmitter may shift the RNTI scrambled CRC bits cyclically to place the RNTI scrambled CRC bits in positions within the payload, and the RNTI scrambled CRC bits may not be consecutively arranged in the ending portion of the payload. Then, the transmitter may encode the payload using the Polar code and transmit the encoded payload to the receiver.
[0034] Accordingly, since the RNTI scrambled CRC bits may be avoided from being consecutively placed in the ending portion of the payload (where bit errors may be more likely to occur) , the decoding of the RNTI may become more robust, thereby significantly reducing the likelihood of RNTI false alarms.
[0035] In some cases, before scrambling some of the plurality of CRC bits using the RNTI, the transmitter may interleave another portion of the CRC bits with the plurality of information bits. The interleaved CRC bits may be independent of the RNTI scrambled CRC bits. The distributed CRC interleaving may enable early error detection and list pruning in Polar SCL decoding, enhancing decoding efficiency and reliability.
[0036] FIG. 3 illustrates an example scenario 300 under schemes in accordance with implementations of the present disclosure. For example, the transmitter determines a DCI 0_0 with 56 56-bit payload. The payload includes 32 information bits and 24 CRC bits. The transmitter interleaves a portion of the 24 CRC bits with the 32 information bits as shown in FIG. 3. The interleaved CRC bits exclude the last 16 CRC bits, which are reserved for RNTI scrambling.
[0037] The transmitter subsequently scrambles the last 16 CRC bits with an RNTI, resulting in 16 RNTI scrambled CRC bits. The transmitter performs a right cyclic shift of the entire 56-bit payload by 16 bits, thereby repositioning the 16 RNTI scrambled CRC bits to a front portion of the payload. After the cyclic shift, the transmitter encodes the payload using a Polar code and transmits the encoded payload to the receiver. Accordingly, the 16 RNTI scrambled CRC bits are no longer placed consecutively at the end of the payload (where bit errors are more likely to occur) , thereby reducing the likelihood of RNTI false alarms.
[0038] In some implementations, the RNTI scrambled CRC bits may be mapped to a plurality of specific Polar information bit locations associated with a plurality of specific row weights of a Polar code generator matrix. In particular, the transmitter may determine a payload. The payload may include a plurality of information bits and a plurality of CRC bits appended to the plurality of information bits. Then, the transmitter may scramble an ending portion of the plurality of CRC bits by an RNTI as a plurality of RNTI scrambled CRC bits.
[0039] Before encoding by a Polar code, the transmitter may map the RNTI scrambled CRC bits to a plurality of specific Polar information bit locations associated with a plurality of specific row weights of a Polar code generator matrix. Then, the transmitter may encode the payload using the Polar code and transmit the encoded payload to the receiver.
[0040] Accordingly, by mapping the RNTI scrambled CRC bits to Polar information bit positions with relatively higher reliabilities (i.e., those associated with higher row weights in the generator matrix) , the robustness of RNTI decoding may be improved, thereby significantly reducing the likelihood of RNTI false alarms.
[0041] In some cases, the plurality of specific row weights may be the largest among a plurality of row weights of the polar code generator matrix. In some cases, the plurality of row weights may include Hamming weights.
[0042] FIG. 4 illustrates an example scenario 400 under schemes in accordance with implementations of the present disclosure. First, for a Polar code with length N=2m, a corresponding Polar code generator matrix G is expressed as where the operation indicates Kronecker m times on F and a matrix F is defined as:
[0043] In this example, the Polar code has length 256, and m is 8. By extracting the rows of the Polar code generator matrix G corresponding to Polar code information bits (as shown in FIG. 1A) , Hamming weights (i.e., row weights) of the corresponding row for the Polar code information bits are determined as shown in FIG. 4. In this example, the minimum Hamming distance (dmin) for this Polar code is 16. The Polar code information bit location associated with 16 dmin corresponds to a location that is more susceptible to bit errors. Therefore, in this example, the 16 RNTI scrambled CRC bits are mapped to the specific Polar information bit locations having relatively high row weights (e.g., largest weights) , such as 256, 128, or 64.
[0044] In some implementations, the RNTI scrambled CRC bits may be mapped to a plurality of specific polar information bit locations associated with a plurality of specific reliabilities. In particular, the transmitter may determine a payload. The payload may include a plurality of information bits and a plurality of CRC bits appended to the plurality of information bits. Then, the transmitter may scramble an ending portion of the plurality of CRC bits by an RNTI as a plurality of RNTI scrambled CRC bits.
[0045] Before encoding by a Polar code, the transmitter may map the RNTI scrambled CRC bits to a plurality of specific Polar information bit locations associated with a plurality of specific polar information bit locations associated with a plurality of specific reliabilities. Then, the transmitter may encode the payload using the Polar code and transmit the encoded payload to the receiver.
[0046] Accordingly, by mapping the RNT scrambled CRC bits to specific polar information bit locations with relatively higher reliabilities, the robustness of RNTI decoding may be improved, thereby significantly reducing the likelihood of RNTI false alarms.
[0047] In some cases, the plurality of specific reliabilities may be the highest among a plurality of reliabilities of a plurality of polar information bits.
[0048] In some implementations, a Polar code (N, K) may be introduced, where N denotes the Polar code length and K denotes the number of information bits. Regarding Polar encoding, a Polar sequence may determine the reliability of each bit location in an increasing order as [p0, p1, …, pN-1] . Most reliable K location bits may be selected at [pN-K, pN-K+1, …, pN-1] to carry out information. Specifically, for a message vector m of length N, K binary information bits may be placed at positions [pN-K, pN-K+1, …, pN-1] , and N-K positions may be putted by zero. The Polar codeword c may be then generated by multiplying m with the generator matrix G as c=mG.
[0049] In some implementations, to reduce RNTI false alarms associated with Polar codes, the RNTI scrambled ‘n’ CRC bits may be transmitted at the most reliable ‘n’ information bit locations determined according to the Polar sequence of the Polar code. Among the K-bit locations selected for transmitting the payload of the Polar code, the most reliable n locations may be further chosen to carry the RNTI scrambled CRC bits, thereby providing enhanced protection.
[0050] In some implementations, to reduce RNTI false alarms associated with Polar codes, the RNTI scrambled ‘n’ CRC bits may be transmitted at the bit locations corresponding to the ‘n’ rows of the Polar generator matrix that have the largest row weights. The selected K-bit locations correspond to K rows of the generator matrix G. Among these K row vectors of G, the n locations associated with the largest row weights (i.e., Hamming weights) may be further chosen to carry the RNTI-scrambled CRC bits, thereby enhancing protection.
[0051] FIG. 5 illustrates an example scenario 500 under schemes in accordance with implementations of the present disclosure. First, Polar code information bits are selected based on the bit-channel reliability determined through channel polarization. Assigning more reliable positions enhances decoding performance and reduces the probability of errors.
[0052] For a Polar code of length 256, the reliability-ordered sequence of Polar information bit locations is shown in FIG. 5, where higher order indices correspond to higher bit-channel reliabilities. Therefore, in this example, the 16 RNTI scrambled CRC bits are mapped to the specific polar information bit locations, such as the 256th, 255th, 254th, and 248th bits of the Polar code, with relatively higher reliabilities (i.e., with the highest order indexes) . Illustrative Implementations
[0053] FIG. 6 illustrates an example communication system 600 having an example communication apparatus 610 and an example network apparatus 620 in accordance with an implementation of the present disclosure. Each of communication apparatus 610 and network apparatus 620 may perform various functions to implement schemes, techniques, processes and methods described herein pertaining to transmitting payload including RNTI scrambled CRC bits with respect to UE and network apparatus in mobile communications, including scenarios / schemes described above as well as process 700 described below.
[0054] Communication apparatus 610 may be a part of an electronic apparatus, which may be a UE such as a portable or mobile apparatus, a wearable apparatus, a wireless communication apparatus or a computing apparatus. For instance, communication apparatus 610 may be implemented in a smartphone, a smartwatch, a personal digital assistant, a digital camera, or a computing equipment such as a tablet computer, a laptop computer or a notebook computer. Communication apparatus 610 may also be a part of a machine type apparatus, which may be an IoT, NB-IoT, or IIoT apparatus such as an immobile or a stationary apparatus, a home apparatus, a wire communication apparatus or a computing apparatus. For instance, communication apparatus 610 may be implemented in a smart thermostat, a smart fridge, a smart door lock, a wireless speaker or a home control center. Alternatively, communication apparatus 610 may be implemented in the form of one or more integrated-circuit (IC) chips such as, for example and without limitation, one or more single-core processors, one or more multi-core processors, one or more reduced-instruction set computing (RISC) processors, or one or more complex-instruction-set-computing (CISC) processors. Communication apparatus 610 may include at least some of those components shown in FIG. 6 such as a processor 612, for example. Communication apparatus 610 may further include one or more other components not pertinent to the proposed scheme of the present disclosure (e.g., internal power supply, display device and / or user interface device) , and, thus, such component (s) of communication apparatus 610 are neither shown in FIG. 6 nor described below in the interest of simplicity and brevity.
[0055] Network apparatus 620 may be a part of a network apparatus, which may be a network node such as a satellite, a base station, a small cell, a router or a gateway. For instance, network apparatus 620 may be implemented in an eNodeB in an LTE network, in a gNB in a 5G / NR, IoT, NB-IoT or IIoT network or in a satellite or base station in a 6G network. Alternatively, network apparatus 620 may be implemented in the form of one or more IC chips, such as, for example, and without limitation, one or more single-core processors, one or more multi-core processors, or one or more RISC or CISC processors. Network apparatus 620 may include at least some of those components shown in FIG. 6, such as a processor 622, for example. Network apparatus 620 may further include one or more other components not pertinent to the proposed scheme of the present disclosure (e.g., internal power supply, display device and / or user interface device) , and, thus, such component (s) of network apparatus 620 are neither shown in FIG. 6 nor described below in the interest of simplicity and brevity.
[0056] In one aspect, each of processor 612 and processor 622 may be implemented in the form of one or more single-core processors, one or more multi-core processors, or one or more CISC processors. That is, even though a singular term “aprocessor” is used herein to refer to processor 612 and processor 622, each of processor 612 and processor 622 may include multiple processors in some implementations and a single processor in other implementations in accordance with the present disclosure. In another aspect, each of processor 612 and processor 622 may be implemented in the form of hardware (and, optionally, firmware) with electronic components including, for example and without limitation, one or more transistors, one or more diodes, one or more capacitors, one or more resistors, one or more inductors, one or more memristors and / or one or more varactors that are configured and arranged to achieve specific purposes in accordance with the present disclosure. In other words, in at least some implementations, each of processor 612 and processor 622 is a special-purpose machine specifically designed, arranged and configured to perform specific tasks including transmitting payload including RNTI scrambled CRC bits in a device (e.g., as represented by communication apparatus 610) and a network (e.g., as represented by network apparatus 620) in accordance with various implementations of the present disclosure.
[0057] In some implementations, communication apparatus 610 may also include a transceiver 616 coupled to processor 612 and capable of wirelessly transmitting and receiving data. In other words, processor 612 may transceive the data, such as configuration, message, signal, information, indicator, etc., via transceiver 616. In some implementations, communication apparatus 610 may further include a memory 614 coupled to processor 612 and capable of being accessed by processor 612 and storing data therein. In some implementations, network apparatus 620 may also include a transceiver 626 coupled to processor 622 and capable of wirelessly transmitting and receiving data. In other words, processor 622 may transceive the data, such as configuration, message, signal, information, indicator, etc., via transceiver 626. In some implementations, network apparatus 620 may further include a memory 624 coupled to processor 622 and capable of being accessed by processor 622 and storing data therein. Accordingly, communication apparatus 610 and network apparatus 620 may wirelessly communicate with each other via transceiver 616 and transceiver 626, respectively. To aid better understanding, the following description of the operations, functionalities and capabilities of each of communication apparatus 610 and network apparatus 620 is provided in the context of a mobile communication environment in which communication apparatus 610 is implemented in or as a communication apparatus or a UE and network apparatus 620 is implemented in or as a network node of a communication network.
[0058] In some implementations, each of memory 614 and memory 624 may include a type of random-access memory (RAM) such as dynamic RAM (DRAM) , static RAM (SRAM) , thyristor RAM (T-RAM) and / or zero-capacitor RAM (Z-RAM) . Alternatively, or additionally, each of memory 614 and memory 624 may include a type of read-only memory (ROM) such as mask ROM, programmable ROM (PROM) , erasable programmable ROM (EPROM) and / or electrically erasable programmable ROM (EEPROM) . Alternatively, or additionally, each of memory 614 and memory 624 may include a type of non-volatile random-access memory (NVRAM) such as flash memory, solid-state memory, ferroelectric RAM (FeRAM) , magnetoresistive RAM (MRAM) and / or phase-change memory. Illustrative Processes
[0059] FIG. 7 illustrates an example process 700 in accordance with an implementation of the present disclosure. Process 700 may be an example implementation of above scenarios / schemes, whether partially or completely, with respect to transmitting payload including RNTI scrambled CRC bits of the present disclosure. Process 700 may represent an aspect of implementation of features of a transmitter (e.g., communication apparatus 610 or network apparatus 620) . Process 700 may include one or more operations, actions, or functions as illustrated by one or more of blocks 710 to 730. Although illustrated as discrete blocks, various blocks of process 700 may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks of process 700 may be executed in the order shown in FIG. 7 or, alternatively, in a different order. Process 700 may be implemented by a transmitter (e.g., communication apparatus 610 or network apparatus 620) or any suitable network device or machine type devices. Solely for illustrative purposes and without limitation, process 700 is described below in the context of the transmitter. Process 700 may begin at block 710.
[0060] At block 710, process 700 may involve processor 612 / 622 of communication apparatus 610 / network apparatus 620 determining a payload including a plurality of information bits and a plurality of CRC bits. A plurality of RNTI scrambled CRC bits may be placed in positions within the payload, and the RNTI scrambled CRC bits may not be consecutively arranged in an ending portion of the payload. Process 700 may proceed from block 710 to block 720.
[0061] At block 720, process 700 may involve processor 612 / 622 of communication apparatus 610 / network apparatus 620 encoding the payload using a polar code. Process 700 may proceed from block 710 to block 730.
[0062] At block 730, process 700 may involve processor 612 / 622 of communication apparatus 610 / network apparatus 620 transmitting the payload to a receiver.
[0063] In some implementations, process 700 may further involve processor 612 / 622 determining the payload including the plurality of information bits and the plurality of CRC bits appended to the plurality of information bits. Process 700 may further involve processor 612 / 622 scrambling an ending portion of the plurality of CRC bits by an RNTI as the RNTI scrambled CRC bits. Process 700 may further involve processor 612 / 622 shifting the RNTI scrambled CRC bits cyclically to place the RNTI scrambled CRC bits in the positions within the payload, and the RNTI scrambled CRC bits may not be consecutively arranged in the ending portion of the payload.
[0064] In some implementations, process 700 may further involve processor 612 / 622 interleaving bits of the plurality of CRC bits with the plurality of information bits. The bits may be independent of the RNTI scrambled CRC bits.
[0065] In some implementations, the RNTI scrambled CRC bits may be cyclically shifted to a front portion of the payload.
[0066] In some implementations, process 700 may further involve processor 612 / 622 determining the payload including the plurality of information bits and the plurality of CRC bits appended to the plurality of information bits. Process 700 may further involve processor 612 / 622 scrambling an ending portion of the plurality of CRC bits by an RNTI as the RNTI scrambled CRC bits. Process 700 may further involve processor 612 / 622 mapping the RNTI scrambled CRC bits to a plurality of specific polar information bit locations associated with a plurality of specific row weights of a polar code generator matrix.
[0067] In some implementations, the plurality of specific row weights may be the largest among a plurality of row weights of the polar code generator matrix.
[0068] In some implementations, the plurality of row weights may include Hamming weights.
[0069] In some implementations, process 700 may further involve processor 612 / 622 determining the payload including the plurality of information bits and the plurality of CRC bits appended to the plurality of information bits. Process 700 may further involve processor 612 / 622 scrambling an ending portion of the plurality of CRC bits by an RNTI as the RNTI scrambled CRC bits. Process 700 may further involve processor 612 / 622 mapping the RNTI scrambled CRC bits to a plurality of specific polar information bit locations associated with a plurality of specific reliabilities.
[0070] In some implementations, the plurality of specific reliabilities may be the highest among a plurality of reliabilities of a plurality of polar information bits.
[0071] In some implementations, the payload may be associated with a control channel. Additional Notes
[0072] The herein-described subject matter sometimes illustrates different components contained within, or connected with, different other components. It is to be understood that such depicted architectures are merely examples, and that in fact many other architectures can be implemented which achieve the same functionality. In a conceptual sense, any arrangement of components to achieve the same functionality is effectively "associated" such that the desired functionality is achieved. Hence, any two components herein combined to achieve a particular functionality can be seen as "associated with" each other such that the desired functionality is achieved, irrespective of architectures or intermedial components. Likewise, any two components so associated can also be viewed as being "operably connected" , or "operably coupled" , to each other to achieve the desired functionality, and any two components capable of being so associated can also be viewed as being "operably couplable" , to each other to achieve the desired functionality. Specific examples of operably couplable include but are not limited to physically mateable and / or physically interacting components and / or wirelessly interactable and / or wirelessly interacting components and / or logically interacting and / or logically interactable components.
[0073] Further, with respect to the use of substantially any plural and / or singular terms herein, those having skill in the art can translate from the plural to the singular and / or from the singular to the plural as is appropriate to the context and / or application. The various singular / plural permutations may be expressly set forth herein for sake of clarity.
[0074] Moreover, it will be understood by those skilled in the art that, in general, terms used herein, and especially in the appended claims, e.g., bodies of the appended claims, are generally intended as “open” terms, e.g., the term “including” should be interpreted as “including but not limited to, ” the term “having” should be interpreted as “having at least, ” the term “includes” should be interpreted as “includes but is not limited to, ” etc. It will be further understood by those within the art that if a specific number of an introduced claim recitation is intended, such an intent will be explicitly recited in the claim, and in the absence of such recitation no such intent is present. For example, as an aid to understanding, the following appended claims may contain usage of the introductory phrases "at least one" and "one or more" to introduce claim recitations. However, the use of such phrases should not be construed to imply that the introduction of a claim recitation by the indefinite articles "a" or "an" limits any particular claim containing such introduced claim recitation to implementations containing only one such recitation, even when the same claim includes the introductory phrases "one or more" or "at least one" and indefinite articles such as "a" or "an, " e.g., “a” and / or “an” should be interpreted to mean “at least one” or “one or more; ” the same holds true for the use of definite articles used to introduce claim recitations. In addition, even if a specific number of an introduced claim recitation is explicitly recited, those skilled in the art will recognize that such recitation should be interpreted to mean at least the recited number, e.g., the bare recitation of "two recitations, " without other modifiers, means at least two recitations, or two or more recitations. Furthermore, in those instances where a convention analogous to “at least one of A, B, and C, etc. ” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention, e.g., “asystem having at least one of A, B, and C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and / or A, B, and C together, etc. In those instances where a convention analogous to “at least one of A, B, or C, etc. ” is used, in general such a construction is intended in the sense one having skill in the art would understand the convention, e.g., “asystem having at least one of A, B, or C” would include but not be limited to systems that have A alone, B alone, C alone, A and B together, A and C together, B and C together, and / or A, B, and C together, etc. It will be further understood by those within the art that virtually any disjunctive word and / or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase “A or B” will be understood to include the possibilities of “A” or “B” or “A and B. ”
[0075] From the foregoing, it will be appreciated that various implementations of the present disclosure have been described herein for purposes of illustration, and that various modifications may be made without departing from the scope and spirit of the present disclosure. Accordingly, the various implementations disclosed herein are not intended to be limiting, with the true scope and spirit being indicated by the following claims.
Claims
1.A method, comprising:determining, by a processor of an apparatus, a payload including a plurality of information bits and a plurality of Cyclic Redundancy Check (CRC) bits, wherein a plurality of Radio Network Temporary Identifier (RNTI) scrambled CRC bits are placed in positions within the payload, and the RNTI scrambled CRC bits are not consecutively arranged in last 16 bits of the payload;encoding, by the processor, the payload using a polar code; andtransmitting, by the processor, the payload to a receiver.2.The method of Claim 1, wherein the determining of the payload including the plurality of information bits and the plurality of CRC bits further comprises:determining, by the processor, the payload including the plurality of information bits and the plurality of CRC bits appended to the plurality of information bits;scrambling, by the processor, last 16 bits of the plurality of CRC bits by an RNTI as the RNTI scrambled CRC bits; andshifting, by the processor, the RNTI scrambled CRC bits cyclically to place the RNTI scrambled CRC bits in the positions within the payload, and the RNTI scrambled CRC bits are not consecutively arranged in the last 16 bits of the payload.3.The method of Claim 2, further comprising:interleaving, by the processor, bits of the plurality of CRC bits with the plurality of information bits, wherein the bits are independent of the RNTI scrambled CRC bits.4.The method of Claim 2, wherein the RNTI scrambled CRC bits are cyclically shifted to first 16 bits of the payload.5.The method of Claim 1, wherein the determining of the payload including the plurality of information bits and the plurality of CRC bits further comprises:determining, by the processor, the payload including the plurality of information bits and the plurality of CRC bits appended to the plurality of information bits;scrambling, by the processor, last 16 bits of the plurality of CRC bits by an RNTI as the RNTI scrambled CRC bits; andmapping, by the processor, the RNTI scrambled CRC bits to a plurality of polar information bit locations associated with a plurality of row weights of a polar code generator matrix.6.The method of Claim 5, wherein the plurality of row weights are the largest among row weights of the polar code generator matrix.7.The method of Claim 6, wherein the plurality of row weights include Hamming weights.8.The method of Claim 1, wherein the determining of the payload including the plurality of information bits and the plurality of CRC bits further includes:determining, by the processor, the payload including the plurality of information bits and the plurality of CRC bits appended to the plurality of information bits;scrambling, by the processor, last 16 bits of the plurality of CRC bits by an RNTI as the RNTI scrambled CRC bits; andmapping, by the processor, the RNTI scrambled CRC bits to a plurality of polar information bit locations associated with a plurality of reliabilities.9.The method of Claim 8, wherein the plurality of reliabilities are the highest among reliabilities of a plurality of polar information bits.10.The method of Claim 1, wherein the payload is associated with a control channel.11.An apparatus, comprising:a transceiver which, during operation, wirelessly communicates with a wireless apparatus; anda processor communicatively coupled to the transceiver such that, during operation, the processor performs operations comprising:determining a payload including a plurality of information bits and a plurality of Cyclic Redundancy Check (CRC) bits, wherein a plurality of Radio Network Temporary Identifier (RNTI) scrambled CRC bits are placed in positions within the payload, and the RNTI scrambled CRC bits are not consecutively arranged in last 16 bits of the payload;encoding the payload using a polar code; andtransmitting, via the transceiver, the payload to a receiver.12.The apparatus of Claim 11, wherein, during operation, the processor further performs operations comprising:determining the payload including the plurality of information bits and the plurality of CRC bits appended to the plurality of information bits;scrambling last 16 bits of the plurality of CRC bits by an RNTI as the RNTI scrambled CRC bits; andshifting the RNTI scrambled CRC bits cyclically to place the RNTI scrambled CRC bits in the positions within the payload, and the RNTI scrambled CRC bits are not consecutively arranged in the last 16 bits of the payload.13.The apparatus of Claim 12, wherein, during operation, the processor further performs operations comprising:interleaving bits of the plurality of CRC bits with the plurality of information bits, wherein the bits are independent of the RNTI scrambled CRC bits.14.The apparatus of Claim 12, wherein the RNTI scrambled CRC bits are cyclically shifted to first 16 bits of the payload.15.The apparatus of Claim 11, wherein, during operation, the processor further performs operations comprising:determining the payload including the plurality of information bits and the plurality of CRC bits appended to the plurality of information bits;scrambling last 16 bits of the plurality of CRC bits by an RNTI as the RNTI scrambled CRC bits; andmapping the RNTI scrambled CRC bits to a plurality of specific polar information bit locations associated with a plurality of specific row weights of a polar code generator matrix.16.The apparatus of Claim 15, wherein the plurality of specific row weights are the largest among a plurality of row weights of the polar code generator matrix.17.The apparatus of Claim 16, wherein the plurality of row weights include Hamming weights.18.The apparatus of Claim 11, wherein, during operation, the processor further performs operations comprising:determining the payload including the plurality of information bits and the plurality of CRC bits appended to the plurality of information bits;scrambling last 16 bits of the plurality of CRC bits by an RNTI as the RNTI scrambled CRC bits; andmapping the RNTI scrambled CRC bits to a plurality of specific polar information bit locations associated with a plurality of specific reliabilities.19.The apparatus of Claim 18, wherein the plurality of specific reliabilities are the highest among a plurality of reliabilities of a plurality of polar information bits.20.The apparatus of Claim 11, wherein the payload is associated with a control channel.
Citation Information
Patent Citations
Downlink control information response to idle mode requests
CN112425112A
Techniques for masking and unmasking cyclic redundancy check bits to early termination of decoding
CN117223238A
Method and apparatus for channel coding in the fifth generation new radio system
US20190097756A1
Method and apparatus for configuring downlink control channel in wireless backhaul system
US20240224291A1