User equipment and base station for wireless communication and related methods.
By applying cell-specific scrambling and phase rotation at the base station, the method enhances wireless communication performance in interference-limited scenarios by optimizing processing stages for symbol-level blending and reducing computational resource usage.
Patent Information
- Authority / Receiving Office
- BR · BR
- Patent Type
- Patents
- Current Assignee / Owner
- QUALCOMM INC
- Filing Date
- 2018-01-05
- Publication Date
- 2026-07-14
AI Technical Summary
In interference-limited scenarios with synchronous cells, existing wireless communication systems face challenges in overcoming interference between repetitions of symbols from different cells, leading to inefficient use of computational resources and reduced network performance.
A base station applies initial scrambling based on cell identity to blocks of a channel and subsequent scrambling or phase rotation to bits, allowing a user equipment to reverse these processes efficiently without excessive computational resources, using a common processing scheme for symbol-level blending.
This approach reduces interference and improves network performance by enabling efficient bit-level unscrambling and symbol-level blending, minimizing the need for large LLR buffers and optimizing processing resources.
Smart Images

Figure 00000119_0000 
Figure 00000120_0000 
Figure 00000121_0000
Abstract
Description
1 / 113 User equipment and base station for wireless communication and related methods. FUNDAMENTALS Field
[001] Aspects of the present description are generally related to wireless communication and, more particularly, to techniques and devices for reducing channel interference. Fundamentals
[002] Wireless communication systems are widely deployed to provide various telecommunication services, such as telephony, video, data, message exchange, and broadcasts. Typical wireless communication systems may employ multiple access technologies capable of supporting communication with multiple users sharing available system resources (e.g., bandwidth, transmission power, and / or similar). Examples of such multiple access technologies include 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), synchronous time-division code-division multiple access (TD-SCDMA), and Long Term Evolution (LTE).LTE / LTE Enhanced is a set of enhancements to the Universal Mobile Telecommunications System (UMTS) mobile standard enacted by the Third Generation Partnership Project (3GPP). Petition 870250048548, dated 10 / 06 / 2025, page 13 / 19 2 / 113
[003] A wireless communication network may include multiple base stations (BSs) that can support communication to multiple user equipment (UEs). A UE can communicate with a BS via downlink and uplink. Downlink (or forward link) refers to the communication link from the BS to the UE, and uplink (or reverse link) refers to the communication link from the UE to the BS. As will be described in more detail in this document, a BS may be referred to as a B Node, a gNB, an access point (AP), a radio head, a transmit-receive point (TRP), a BS new radio (NR), a 5G B Node, and / or similar.
[004] The multiple access technologies above have been adopted in various telecommunications standards to provide a common protocol that allows different wireless communication devices to communicate at the municipal, national, regional, and even global levels. New radio NR, which may also be called 5G, is a set of improvements to the LTE mobile standard promulgated by the Third Generation Partnership Project (3GPP).NR was designed to better support mobile broadband internet access by improving spectral efficiency, reducing costs, enhancing services, making use of new spectrum, and better integrating with other open standards by using OFDM with a cyclic prefix (CP) (CP-OFDM) on the downlink (DL), using CP-OFDM and / or SC-FDM (e.g., also known as discrete Fourier transform scattering ODFM (DFT-s-OFDM)) on the uplink (UL), as well as supporting beamforming, multiple-input multiple-output (MIMO) technology, and carrier aggregation. However, as the demand for mobile broadband access... Petition 870190069224, dated 07 / 22 / 2019, page 9 / 150 As the 3 / 113 rate continues to rise, there is a need for further improvements in LTE and NR technologies. Ideally, these improvements should be applicable to other multiple access technologies and to the telecommunications standards that employ these technologies.
[005] A BS can transmit a channel to provide information to an UE. For example, the BS can transmit a narrowband physical broadcast channel (NBPBCH) to provide service to an Internet of Things (IoT) UE. The physical broadcast channel can be associated with a transmission time interval (TTI), such as approximately 640 milliseconds. The BS can repeat symbols across a plurality of consecutive transmissions of a subframe of the physical broadcast channel, and can scramble the consecutive transmissions of the subframe using the same scrambling sequence and based, at least in part, on a cell identifier. However, in an interference-limited scenario for synchronous cells, repetitions of a first symbol from a first cell can interfere with repetitions of a second symbol from a second cell.An emission unit (EU) that serves to receive the first symbol through a first physical broadcast channel from a first cell may not be able to average to overcome the interference from a second physical broadcast channel transmitted by a second cell. Furthermore, since the repetitions of a first symbol from the first cell and the repetitions of the second symbol from a second cell remain constant throughout each set of repetitions, the EU may not be able to reduce interference through symbol matching techniques. Petition 870190069224, dated 07 / 22 / 2019, page 10 / 150 4 / 113 SUMMARY
[006] The aspects described in this document provide a mechanism by which a BS can transmit, and a UE can receive, a channel in a scenario limited by interference with synchronous cells. It was considered that the BS had performed bit-level scrambling for repetitions of a symbol from the first cell to allow the UE to overcome interference from the second cell. Performing additional scrambling of channel transmissions may, in some cases, prevent the UE from performing symbol-level blending. For example, when the BS applies a different scrambling sequence for each bit, the UE may be prevented from performing symbol-level blending. In this case, the UE may perform bit-level unscramble, which may utilize additional computational resources, such as an excessively large log-likelihood ratio (LLR) buffer, compared to performing symbol-level blending.Thus, it may be beneficial for the BS to perform multiple processing stages, such that the UE can reverse the multiple processing stages without using additional computational resources, such as an excessively large LLR buffer.
[007] The aspects described in this document may allow the transmission and reception of a channel without performing scrambling by means of a BS, which prevents symbol-level matching by means of a UE. The BS may apply, in an initial processing stage, scrambling to blocks of the channel based, at least in part, on a BS cell identity. The BS may, in Petition 870190069224, dated 07 / 22 / 2019, page 11 / 150 5 / 113 In some aspects, apply, in a second processing stage, scrambling or phase rotation to bits of each block based, at least in part, on the identity of the BS cell. This can ensure reduced interference for a channel relative to the channel being transmitted without multiple scrambling stages.
[008] The BS can transmit information, such as a cell identifier, identifying the cell identity, and can transmit channel blocks including the scrambled bits. Similarly, the UE can receive the cell identifier and can receive the channel. The UE can reverse the second processing step based, at least in part, on the second processing stage, including the same scrambling sequence applied to the bits of multiple blocks and, at least in part, on the determination of a boundary between each block. The UE can reverse the first processing stage using a hypothesis testing procedure. In this way, the UE can determine the bits included in the channel, using a reduced utilization of processing resources relative to each bit associated with a different scrambling sequence.Furthermore, by compensating for interference with another channel using multiple processing stages, the UE can determine the bits included in the channel, thus improving network performance.
[009] In one aspect of the description, methods, devices, apparatus and products of computer programs are provided.
[0010] In some respects, the method may include transmitting, via a base station, a Petition 870190069224, dated 07 / 22 / 2019, page 12 / 150 6 / 113 Cell identifier for a cell. In some respects, the method may include transmitting, through the base station, a physical broadcast channel. The physical broadcast channel may include a plurality of blocks. Each block, among the plurality of blocks, may include bit repetition subsets. Each block, among the plurality of blocks, may be processed using a first processing stage. Each repetition of the bit repetition subsets, for each block, may be processed using a second processing stage such that a particular repetition of the bit repetition subset of a first block and a corresponding particular repetition of the bit repetition subset of a second block are processed using a common processing scheme. The first processing stage and the second processing stage may be initialized based, at least in part, on the cell identifier.
[0011] In some respects, the device may include a memory and one or more processors coupled to the memory. The memory and the one or more processors may be configured to transmit a cell identifier to a cell. The memory and the one or more processors may be configured to transmit a physical broadcast channel. The physical broadcast channel may include a plurality of blocks. Each block, among the plurality of blocks, may include bit repetition subsets. Each block, among the plurality of blocks, may be processed using a first processing stage. Each repetition of the bit repetition subsets, for each block, may be processed using a second processing stage. Petition 870190069224, dated 07 / 22 / 2019, page 13 / 150 7 / 113 such that a particular repetition of the bit repetition subset of a first block and a corresponding particular repetition of the bit repetition subset of a second block are processed using a common processing scheme. The first processing stage and the second processing stage can be initialized based, at least in part, on the cell identifier.
[0012] In some aspects, the apparatus may include means for transmitting a cell identifier to a cell. The apparatus may include means for transmitting a physical broadcast channel. The physical broadcast channel may include a plurality of blocks. Each block, of the plurality of blocks, may include bit repetition subsets. Each block, among the plurality of blocks, may be processed using a first processing stage. Each repetition of the bit repetition subsets, for each block, may be processed using a second processing stage such that a particular repetition of the bit repetition subset of a first block and a corresponding particular repetition of the bit repetition subset of a second block are processed using a common processing scheme. The first processing stage and the second processing stage may be initialized based, at least in part, on the cell identifier.
[0013] In some respects, the computer program product may include a non-transient, computer-readable medium storing one or more instructions for wireless communication which, when executed by one or more processors of a device, cause Petition 870190069224, dated 07 / 22 / 2019, page 14 / 150 8 / 113 that one or more processors transmit a cell identifier to a cell. The one or more instructions may cause the one or more processors to transmit a physical broadcast channel. The physical broadcast channel may include a plurality of blocks. Each block, among the plurality of blocks, may include bit repetition subsets. Each block, among the plurality of blocks, may be processed using a first processing stage. Each repetition of the bit repetition subsets, for each block, may be processed using a second processing stage such that a particular repetition of the bit repetition subset of a first block and a corresponding particular repetition of the bit repetition subset of a second block are processed using a common processing scheme.The first processing stage and the second processing stage can be initialized based, at least in part, on the cell identifier.
[0014] In some aspects, the method may include transmitting, via a base station, a cell identifier to a cell. In some aspects, the method may include transmitting, via the base station, a physical broadcast channel. The physical broadcast channel may include a plurality of blocks. Each block, among the plurality of blocks, may include subsets of symbol repetition. Each repetition of the subsets of symbol repetition, for each block, may be processed using a processing stage such that a particular repetition of the subset of symbol repetition of a first block and a corresponding particular repetition of the Petition 870190069224, dated 07 / 22 / 2019, page 15 / 150 9 / 113 Subsets of repeating symbols from a second block are processed using a common processing scheme. The processing stage can be initialized based, at least in part, on the cell identifier or frame number.
[0015] In some respects, the method may include receiving, through a user device, a cell identifier for a cell. In some respects, the method may include receiving, through the user device, a physical broadcast channel. The physical broadcast channel may include a plurality of blocks. Each block, among the plurality of blocks, may include bit repetition subsets. Each block, among the plurality of blocks, may be processed using a first processing stage. Each repetition of the bit repetition subsets, for each block, may be processed using a second processing stage such that a particular repetition of the bit repetition subset of a first block and a corresponding particular repetition of the bit repetition subset of a second block are processed using a common processing scheme.The first processing stage and the second processing stage can be initialized based, at least in part, on the cell identifier.
[0016] In some respects, the device may include a memory and one or more processors coupled to the memory. The memory and the one or more processors may be configured to receive a cell identifier for a cell. The memory and the one or more processors may be configured to receive a physical broadcast channel. The Petition 870190069224, dated 07 / 22 / 2019, page 16 / 150 A physical broadcast channel (10 / 113) may include a plurality of blocks. Each block, among the plurality of blocks, may include bit repetition subsets. Each block, among the plurality of blocks, may be processed using a first processing stage. Each repetition of the bit repetition subsets, for each block, may be processed using a second processing stage such that a particular repetition of the bit repetition subset of a first block and a corresponding particular repetition of the bit repetition subset of a second block are processed using a common processing scheme. The first processing stage and the second processing stage may be initialized based, at least in part, on the cell identifier.
[0017] In some respects, the apparatus may include means for receiving a cell identifier for a cell. The apparatus may include means for receiving a physical broadcast channel. The physical broadcast channel may include a plurality of blocks. Each block, among the plurality of blocks, may include bit repetition subsets. Each block, among the plurality of blocks, may be processed using a first processing stage. Each repetition of the bit repetition subsets, for each block, may be processed using a second processing stage such that a particular repetition of the bit repetition subset of a first block and a corresponding particular repetition of the bit repetition subset of a second block are processed using a common processing scheme. The first processing stage and the second processing stage Petition 870190069224, dated 07 / 22 / 2019, page 17 / 150 11 / 113 processing can be initialized based, at least in part, on the cell identifier.
[0018] In some respects, the computer program product may include a non-transient, computer-readable medium storing one or more instructions for wireless communication which, when executed by one or more processors of a device, cause one or more processors to receive a cell identifier for a cell. The one or more instructions may cause the one or more processors to receive a physical broadcast channel. The physical broadcast channel may include a plurality of blocks. Each block, among the plurality of blocks, may include repeating bit subsets. Each block, among the plurality of blocks, may be processed using a first processing stage.Each repetition of the bit repetition subsets, for each block, can be processed using a second processing stage such that a particular repetition of the bit repetition subset of a first block and a corresponding particular repetition of the bit repetition subset of a second block are processed using a common processing scheme. The first processing stage and the second processing stage can be initialized based, at least in part, on the cell identifier.
[0019] In some respects, the method may include receiving, through user equipment, a cell identifier for a cell. In some respects, the method may include receiving, through user equipment, a physical broadcast channel. The broadcast channel Petition 870190069224, dated 07 / 22 / 2019, page 18 / 150 12 / 113 physical can include a plurality of blocks. Each block, among the plurality of blocks, can include subsets of repeating symbols. Each repetition of the subsets of repeating symbols, for each block, can be processed using a processing stage such that a particular repetition of the subset of repeating symbols of a first block and a corresponding particular repetition of the subset of repeating symbols of a second block are processed using a common processing scheme. The processing stage can be initialized based, at least in part, on the cell identifier or the frame number.
[0020] In some aspects, the method may include transmitting, through a base station, a cell identifier to a cell. In some aspects, the method may include transmitting, through the base station, a physical broadcast channel. The physical broadcast channel may include a plurality of symbol sets. Each symbol set, among the plurality of symbol sets, may be scrambled with a respective scrambling sequence among a plurality of scrambling sequences. Each symbol set, among the plurality of symbol sets, may be associated with at least one phase rotation. The at least one phase rotation may be based at least in part on the cell identifier for the cell.
[0021] In some respects, the device may include a memory and one or more processors coupled to the memory. The memory and the one or more processors may be configured to transmit a cell identifier to Petition 870190069224, dated 07 / 22 / 2019, page 19 / 150 13 / 113 a cell. The memory and one or more processors can be configured to transmit a physical broadcast channel. The physical broadcast channel may include a plurality of symbol sets. Each symbol set, among the plurality of symbol sets, may be scrambled with a respective scrambling sequence from among a plurality of scrambling sequences. Each symbol set, among the plurality of symbol sets, may be associated with at least one phase rotation. The at least one phase rotation may be based at least in part on the cell identifier for the cell. In some aspects, the apparatus may include means for transmitting a cell identifier for a cell.
[0022] In some respects, the computer program product may include a non-transient, computer-readable medium storing one or more instructions for wireless communication which, when executed by one or more processors of a device, cause one or more processors to transmit a cell identifier to a cell. The one or more instructions may cause the one or more processors to transmit a physical broadcast channel. The physical broadcast channel may include a plurality of symbol sets. Each symbol set, among the plurality of symbol sets, may be scrambled with a respective scrambling sequence from among a plurality of scrambling sequences. Each symbol set, among the plurality of symbol sets, may be associated with at least one phase rotation. The at least one phase rotation may be based, at least in part, on the identifier. Petition 870190069224, dated 07 / 22 / 2019, page 20 / 150 14 / 113 from cell to cell.
[0023] In some aspects, the method may include receiving, through a user device, a cell identifier for a cell. In some aspects, the method may include receiving, through the user device, a physical broadcast channel. The physical broadcast channel may include a plurality of symbol sets. Each symbol set, among the plurality of symbol sets, may be scrambled with a respective scrambling sequence among a plurality of scrambling sequences. Each symbol set, among the plurality of symbol sets, may be associated with at least one phase rotation. The at least one phase rotation may be based, at least in part, on the cell identifier for the cell.
[0024] In some respects, the device may include a memory and one or more memory-coupled processors. The memory and the one or more processors may be configured to receive a cell identifier for a cell. The memory and the one or more processors may be configured to receive a physical broadcast channel. The physical broadcast channel may include a plurality of symbol sets. Each symbol set, among the plurality of symbol sets, may be scrambled with a respective scrambling sequence among a plurality of scrambling sequences. Each symbol set, among the plurality of symbol sets, may be associated with at least one phase rotation. The at least one phase rotation may be based, at least in part, on the cell identifier for the cell. Petition 870190069224, dated 07 / 22 / 2019, p. 21 / 150 15 / 113
[0025] In some respects, the apparatus may include means for receiving a cell identifier for a cell. The apparatus may include means for receiving a physical broadcast channel. The physical broadcast channel may include a plurality of symbol sets. Each symbol set, among the plurality of symbol sets, may be scrambled with a respective scrambling sequence among a plurality of scrambling sequences. Each symbol set, among the plurality of symbol sets, may be associated with at least one phase rotation. The at least one phase rotation may be based, at least in part, on the cell identifier for the cell.
[0026] In some respects, the computer program product may include a non-transient, computer-readable means of storing one or more instructions for wireless communication which, when executed by one or more processors of a device, cause one or more processors to receive a cell identifier for a cell. The one or more instructions may cause the one or more processors to receive a physical broadcast channel. The physical broadcast channel may include a plurality of symbol sets. Each symbol set, among the plurality of symbol sets, may be scrambled with a respective scrambling sequence among a plurality of scrambling sequences. Each symbol set, among the plurality of symbol sets, may be associated with at least one phase rotation. The at least one phase rotation may be based, at least in part, on the cell identifier for the cell.
[0027] In some respects, the method can Petition 870190069224, dated 07 / 22 / 2019, page 22 / 150 16 / 113 include transmitting, through a base station associated with a cell identifier to a cell, a channel, wherein each block, among a plurality of blocks in the channel, includes repetitions of sets of symbols, wherein each block, among the plurality of blocks, is shuffled using a shuffling sequence, among a plurality of shuffling sequences, initialized based, at least in part, on a block index of the block and on the cell identifier of the cell, and wherein each repetition among the repetitions of sets of symbols, for each block, is rotated using a different rotation sequence, among a plurality of rotation sequences, initialized based, at least in part, on a repetition index of the repetition.
[0028] In some respects, the device may include a memory and one or more memory-coupled processors. The memory and the one or more processors may be configured to transmit a channel, wherein each block, among a plurality of blocks in the channel, includes repetitions of sets of symbols, wherein each block, among the plurality of blocks, is shuffled using a shuffling sequence, among a plurality of shuffling sequences, initialized based, at least in part, on a block index of the block and a cell identifier for a cell, and wherein each repetition among the repetitions of sets of symbols for each block is rotated using a different rotation sequence, among a plurality of rotation sequences, initialized based, at least in part, on a repetition index of the repetition.
[0029] In some respects, the device can Petition 870190069224, dated 07 / 22 / 2019, page 23 / 150 17 / 113 include means for transmitting a channel, wherein each block, among a plurality of blocks in the channel, includes repetitions of sets of symbols, wherein each block, among the plurality of blocks, is shuffled using a shuffling sequence, among a plurality of shuffling sequences, initialized based, at least in part, on a block index of the block and a cell identifier for a cell, and wherein each repetition of the repetitions of sets of symbols for each block is rotated using a different rotation sequence, among a plurality of rotation sequences, initialized based, at least in part, on a repetition index of the repetition.
[0030] In some respects, the computer program product may include a non-transient, computer-readable medium storing one or more instructions for wireless communication which, when executed by one or more processors of a device, cause one or more processors to transmit a channel, wherein each block, among a plurality of blocks in the channel, includes repetitions of sets of symbols, wherein each block, among the plurality of blocks, is shuffled using a shuffling sequence, among a plurality of shuffling sequences, initialized based, at least in part, on a block index of the block and a cell identifier for a cell, and wherein each repetition of the repetitions of sets of symbols, for each block, is rotated using a different rotation sequence, among a plurality of rotation sequences, initialized at least in part on a repetition index. Petition 870190069224, dated 07 / 22 / 2019, page 24 / 150 18 / 113 of the repetition.
[0031] In some respects, the method may include receiving, by means of a user device and from a base station associated with a cell identifier for a cell, a channel, wherein each block, among a plurality of blocks in the channel, includes repetitions of sets of symbols; wherein each block, among the plurality of blocks, is shuffled using a shuffling sequence, among a plurality of shuffling sequences, initialized based, at least in part, on a block index of the block and on the cell identifier of the cell and wherein each repetition, among the repetitions of sets of symbols, for each block, is rotated using a different rotation sequence, among a plurality of rotation sequences, initialized based, at least in part, on a repetition index of the repetition.
[0032] In some respects, the device may include a memory and one or more processors coupled to the memory. The memory and the one or more processors may be configured to receive, from a base station associated with a cell identifier for a cell, a channel, in which each block, among a plurality of blocks in the channel, includes repetitions of sets of symbols, in which each block, among the plurality of blocks, is shuffled using a shuffling sequence, among a plurality of shuffling sequences, initialized based, at least in part, on a block index of the block and the cell identifier of the cell, and in which each repetition of the repetitions of sets of symbols, for each Petition 870190069224, dated 07 / 22 / 2019, page 25 / 150 19 / 113 block is rotated using a different rotation sequence, from among a plurality of rotation sequences, initialized based, at least in part, on a repetition index of the repetition.
[0033] In some respects, the apparatus may include means for receiving, from a base station associated with a cell identifier for a cell, a channel, wherein each block, among a plurality of blocks in the channel, includes repetitions of sets of symbols, wherein each block, among the plurality of blocks, is shuffled using a shuffling sequence, among a plurality of shuffling sequences, initialized based, at least in part, on a block index of the block and the cell identifier for the cell, and wherein each repetition, among the repetitions of sets of symbols, for each block is rotated using a different rotation sequence, among a plurality of rotation sequences, initialized based, at least in part, on a repetition index of the repetition.
[0034] In some respects, the computer program product may include a non-transient, computer-readable medium storing one or more instructions for wireless communication which, when executed by one or more processors of a device, cause one or more processors to receive, from a base station associated with a cell identifier for a cell, a channel, wherein each block, among a plurality of blocks in the channel, includes repetitions of sets of symbols, wherein each block among the plurality of blocks is scrambled using a scrambling sequence, Petition 870190069224, dated 07 / 22 / 2019, page 26 / 150 20 / 113 among a plurality of shuffling sequences, initialized based, at least in part, on a block index of the block and on the cell identifier for the cell, and wherein each repetition of the symbol set repetitions for each block is rotated using a different rotation sequence, among a plurality of rotation sequences, initialized based, at least in part, on a repetition index of the repetition.
[0035] In some respects, the method may involve transmitting, via a base station associated with a cell identifier to a cell, a channel, wherein the channel includes a plurality of repetitions of a set of bits in a plurality of subframes, and wherein each repetition, among the plurality of repetitions, is scrambled using a different scrambling sequence, among a plurality of different scrambling sequences, initialized based, at least in part, on a non-linear combination of the cell identifier and a repetition index.
[0036] In some respects, the device may include a memory and one or more processors coupled to the memory. The memory and the one or more processors may be configured to transmit a channel, wherein the channel includes a plurality of repetitions of a set of bits in a plurality of subframes, and wherein each repetition, among the plurality of repetitions, is shuffled using a different shuffling sequence, among a plurality of different shuffling sequences, initialized based, at least in part, on a non-linear combination of a cell identifier for a cell and Petition 870190069224, dated 07 / 22 / 2019, page 27 / 150 21 / 113 is a repetition index.
[0037] In some respects, the apparatus may include means for transmitting a channel, wherein the channel includes a plurality of repetitions of a bit set in a plurality of subframes, and wherein each repetition, among the plurality of repetitions, is scrambled using a different scrambling sequence, among a plurality of different scrambling sequences, initialized based, at least in part, on a non-linear combination of a cell identifier for a cell and a repetition index.
[0038] In some respects, the computer program product may include a non-transient, computer-readable medium storing one or more instructions for wireless communication which, when executed by one or more processors of a device, cause the one or more processors to transmit a channel, wherein the channel includes a plurality of repetitions of a set of bits in a plurality of subframes, and wherein each repetition, among the plurality of repetitions, is scrambled using a different scrambling sequence, among a plurality of different scrambling sequences, initialized based, at least in part, on a non-linear combination of a cell identifier for a cell and a repetition index.
[0039] In some respects, the method may include receiving, through a user device and from a base station associated with a cell identifier for a cell, a channel, wherein the channel includes a plurality of repetitions of a set of bits in a Petition 870190069224, dated 07 / 22 / 2019, page 28 / 150 22 / 113 plurality of subframes, and wherein each repetition, among the plurality of repetitions, is shuffled using a different shuffling sequence, among a plurality of different shuffling sequences, initialized based, at least in part, on a non-linear combination of the cell identifier and a repetition index.
[0040] In some respects, the device may include a memory and one or more processors coupled to the memory. The memory and the one or more processors may be configured to receive, from a base station associated with a cell identifier for a cell, a channel, wherein the channel includes a plurality of repetitions of a set of bits in a plurality of subframes, and wherein each repetition, among the plurality of repetitions, is shuffled using a different shuffling sequence, among a plurality of different shuffling sequences, initialized based, at least in part, on a non-linear combination of the cell identifier and a repetition index.
[0041] In some respects, the apparatus may include means for receiving, from a base station associated with a cell identifier for a cell, a channel, wherein the channel includes a plurality of repetitions of a set of bits in a plurality of subframes, and wherein each repetition, among the plurality of repetitions, is scrambled using a different scrambling sequence, among a plurality of different scrambling sequences, initialized based, at least in part, on a non-linear combination of the identifier. Petition 870190069224, dated 07 / 22 / 2019, page 29 / 150 23 / 113 of cells and a repeat index.
[0042] In some respects, the computer program product may include a non-transient, computer-readable medium storing one or more instructions for wireless communication which, when executed by one or more processors of a device, cause the one or more processors to receive, from a base station associated with a cell identifier for a cell, a channel, wherein the channel includes a plurality of repetitions of a set of bits in a plurality of subframes, and wherein each repetition, among the plurality of repetitions, is scrambled using a different scrambling sequence, among a plurality of different scrambling sequences, initialized based, at least in part, on a non-linear combination of the cell identifier and a repetition index.
[0043] The aspects generally include a method, an apparatus, a system, a computer program product, a non-transient computer-readable medium, a user device, a base station, a wireless communication device, an access point and a processing system as substantially described in this document with reference to and as illustrated by the accompanying drawings.
[0044] What has been presented above has described in a fairly broad way the characteristics and technical advantages of the examples according to the description so that the detailed description that follows can be more easily understood. Additional characteristics and advantages will be described below. The design and the Petition 870190069224, dated 07 / 22 / 2019, page 30 / 150 24 / 113 specific examples described can readily be used as a basis for modifying or designing other structures to accomplish the same objectives as the present description. Such equivalent constructions do not depart from the scope of the appended claims. The characteristics of the concepts described in this document, both their organization and method of operation, as well as the associated advantages, will be more easily understood from the description that follows, when considered in connection with the appended figures. Each of the figures is provided for illustrative and descriptive purposes, and not as a definition of the limits of the claims. BRIEF DESCRIPTION OF THE DRAWINGS
[0045] FIG. 1 is a diagram illustrating an example of a wireless communication network.
[0046] FIG. 2 is a diagram illustrating an example of a base station (BS) communicating with a user device (UE) on a wireless communication network.
[0047] FIG. 3 is a diagram illustrating an example of a frame structure in a wireless communication network.
[0048] FIG. 4 is a diagram illustrating two example subframe formats with a normal cyclic prefix.
[0049] FIG. 5 is a diagram illustrating an example of a BS, in a scenario limited by interference with synchronous cells, transmitting a physical broadcast channel and a UE receiving the physical broadcast channel.
[0050] FIG. 6 is a diagram illustrating a Petition 870190069224, dated 07 / 22 / 2019, page 31 / 150 25 / 113 example of a BS, in a scenario limited by interference with synchronous cells, transmitting a physical broadcast channel and a UE receiving the physical broadcast channel.
[0051] FIG. 7 is a diagram illustrating an example of a BS, in a scenario limited by interference with synchronous cells, transmitting a physical broadcast channel, which includes a set of phase rotation symbols, and a UE receiving the physical broadcast channel.
[0052] FIG. 8 is a flowchart of a wireless communication method.
[0053] FIG. 9 is a flowchart of another wireless communication method.
[0054] FIG. 10 is a flowchart of another wireless communication method.
[0055] FIG. 11 is a flowchart of another wireless communication method.
[0056] FIG. 12 is a conceptual data flow diagram illustrating the flow of data between different modules / media / components in an example device.
[0057] FIG. 13 is a diagram illustrating an example of a hardware implementation for a device employing a processing system.
[0058] FIG. 14 is a flowchart of another wireless communication method.
[0059] FIG. 15 is a flowchart of another wireless communication method.
[0060] FIG. 16 is a flowchart of another wireless communication method.
[0061] FIG. 17 is a flowchart of another wireless communication method. Petition 870190069224, dated 07 / 22 / 2019, page 32 / 150 26 / 113
[0062] FIG. 18 is a conceptual data flow diagram illustrating the flow of data between different modules / media / components in another example device.
[0063] FIG. 19 is a diagram illustrating an example of a hardware implementation for the other device employing a processing system. DETAILED DESCRIPTION
[0064] The detailed description presented below with respect to the attached drawings is intended to be a description of various configurations and is not intended to represent the configurations in which the concepts described in this document can be practiced. The detailed description includes specific details for the purpose of providing a complete understanding of various concepts. However, it will be evident to those skilled in the art that these concepts can be practiced without these specific details. In some cases, well-known structures and components are shown in block diagram form to avoid obscuring such concepts.
[0065] Several aspects of telecommunications systems will now be presented with reference to various devices and methods. These devices and methods will be described in the detailed description below and illustrated in the accompanying drawings by various blocks, modules, components, circuits, steps, processes, algorithms and / or the like (collectively referred to as elements). These elements may be implemented using electronic hardware, computer software or any combination thereof. Whether these elements are implemented as hardware or software depends on the particular application and design constraints. Petition 870190069224, dated 07 / 22 / 2019, page 33 / 150 27 / 113 imposed on the system as a whole.
[0066] By way of example, an element, or any part of an element, or any combination of elements may be implemented with a processing system that includes one or more processors. Examples of processors include microprocessors, microcontrollers, digital signal processors (DSPs), field-programmable gate arrays (FPGAs), programmable logic devices (PLDs), state machines, logic gates, discrete hardware circuits, and other suitable hardware configured to perform the various functionalities described throughout this description. One or more processors in the processing system may execute the software.Software should be broadly interpreted to mean instructions, instruction sets, code, code segments, program code, programs, subprograms, software modules, applications, software applications, software packages, routines, subroutines, objects, executables, execution threads, procedures, functions, and / or the like, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.
[0067] Therefore, in one or more example embodiments, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored or encoded as one or more instructions or code in a computer-readable medium. The computer-readable medium includes computer storage media. The storage medium may be any Petition 870190069224, dated 07 / 22 / 2019, page 34 / 150 28 / 113 available medium that can be accessed by a computer. By way of example, and not limitation, such computer-readable media may comprise random access memory (RAM), read-only memory (ROM), electrically erasable programmable ROM (EEPROM), compact disc ROM (CD-ROM) or other optical disc storage, magnetic disc storage or other magnetic storage devices, combinations of the aforementioned types of computer-readable media, or any other medium that can be used to store computer-executable code in the form of instructions or data structures that can be accessed by a computer.
[0068] An access point (AP) may comprise, be implemented as, or be known as a B Node, a Radio Network Controller (RNC), an eB Node (eNB), a Base Station Controller (BSC), a Base Transceiver Station (BTS), a Base Station (BS), a Transceiver Function (TF), a Radio Router, a Radio Transceiver, a Basic Service Set (BSS), an Extended Service Set (ESS), a Radio Base Station (RBS), a Node B (NB), a gNB, a 5G NB, a BS NR, a Receiving Point of Transmission (TRP), or some other terminology.
[0069] An access terminal (AT) may comprise, be implemented as, or be known as an access terminal, a subscriber station, a subscriber unit, a mobile station, a remote station, a remote terminal, a user terminal, a user agent, a user device, user equipment (UE), a user station, a wireless node, or some other Petition 870190069224, dated 07 / 22 / 2019, p. 35 / 150 29 / 113 terminology. In some respects, an access terminal may comprise a cell phone, a smartphone, a cordless phone, a Session Initiation Protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a tablet, a netbook, a smartbook, an ultrabook, a wirelessly capable portable device, a Station (STA), or some other suitable processing device connected to a wireless modem. Thus, one or more aspects taught in this document may be incorporated into a phone (e.g., a cell phone, a smartphone), a computer (e.g., a desktop), a portable communication device, a portable computing device (e.g., a laptop, a personal data assistant, a tablet, a netbook, a smartbook, an ultrabook), a wearable device (e.g., smartwatch, smart glasses, smart bracelet, smart wristband, smart ring, etc.).Smart clothing and / or similar devices), medical devices or equipment, biometric sensors / devices, an entertainment device (e.g., music device, video device, satellite radio, gaming device and / or similar), a vehicle component or sensor, smart meters / sensors, industrial manufacturing equipment, a global positioning system device, or any other suitable device that is configured to communicate via a wired or wireless medium. In some respects, the node is a wireless node. A wireless node can provide, for example, connectivity to or from a network (e.g., a wide area network such as the Internet or a cellular network) via, Petition 870190069224, dated 07 / 22 / 2019, page 36 / 150 30 / 113 a wired or wireless communication link. Some UEs may be considered machine-type communication (MTC) UEs, which may include remote devices that can communicate with a base station, another remote device, or some other entity. Machine-type communication (MTC) may refer to communication involving at least one remote device at at least one end of the communication and may include forms of data communication involving one or more entities that do not necessarily require human interaction. MTC UEs may include UEs that are capable of MTC communications with MTC servers and / or other MTC devices via Public Terrestrial Mobile Networks (PLMN), for example. Examples of MTC devices include sensors, meters, location tags, monitors, drones, robots / robotic devices, and / or similar.MTC UEs, as well as other types of UEs, can be implemented as NB-IoT (Narrowband Internet of Things) devices.
[0070] It should be noted that although aspects may be described in this document using terminology normally associated with 3G and / or 4G wireless technologies, aspects of this description may be applied to other generation-based communication systems, such as 5G and later, including NR technologies.
[0071] FIG. 1 is a diagram illustrating a 100 network in which aspects of the present description can be practiced. The 100 network can be an LTE network or some other wireless network, such as a 5G or NR network. The 100 wireless network can include several BSs 110 (shown as BS 110a, BS 110b, BS 110c, and BS 110d) and other network entities. A BS is an entity that communicates with user equipment (UEs). Petition 870190069224, dated 07 / 22 / 2019, page 37 / 150 31 / 113 and may also be referred to as a base station, a BS NR, a B Node, a gNB, a NB 5G, an access point, a TRP and / or similar. Each BS can provide communication coverage for a specific geographic area. In 3GPP, the term cell can refer to a coverage area of a BS subsystem and / or BS serving that coverage area, depending on the context in which the term is used.
[0072] A BS can provide communication coverage for a macro cell, a pico cell, a femto cell, and / or another type of cell. A macro cell can cover a relatively large geographic area (e.g., several kilometers in radius) and can allow unrestricted access by subscription-based UEs. A pico cell can cover a relatively small geographic area and can allow unrestricted access by subscription-based UEs. A femto cell can cover a relatively small geographic area (e.g., a house) and can allow restricted access by UEs that have an association with the femto cell (e.g., UEs in a closed subscriber group (CSG)). A BS for a macro cell can be referred to as a macro BS. A BS for a pico cell can be referred to as a pico BS. A BS for a femto cell can be referred to as a femto BS or a household BS. In the example shown in FIG.1. A BS 110a can be a macro BS for a macro cell 102a, a BS 110b can be a pico BS for a pico cell 102b, and a BS 110c can be a femto BS for a femto cell 102c. A BS can support one or multiple (e.g., three) cells. The terms eNB, base station, BS NR, gNB, TRP, AP, B node, NB 5G, and cell can be used interchangeably in this document. Petition 870190069224, dated 07 / 22 / 2019, page 38 / 150 32 / 113
[0073] In some examples, a cell may not necessarily be stationary, and the geographic area of the cell may move according to the location of a mobile BS. In some examples, BSs may be interconnected with each other and / or with one or more other BSs or network nodes (not shown) in the 100 access network through various types of backhaul transport channel interfaces, such as a direct physical connection, a virtual network, and / or similar, using any suitable transport network. The 100 wireless network may also include relay stations. A relay station is an entity that can receive a data transmission from an upstream station (e.g., a BS or a UE) and send a transmission of the data to a downstream station (e.g., a UE or a BS). A relay station may also be a UE that can relay transmissions to other UEs. In the example shown in FIG.1. A relay station 110d can communicate with the macro BS 110a and with a UE 120d in order to facilitate communication between the BS 110a and the UE 120d. A relay station may also be referred to as a relay BS, a relay base station, a repeater and / or similar.
[0074] A 100 wireless network can be a heterogeneous network that includes BSs of different types, for example, macro BSs, pico BSs, femto BSs, relay BSs, and / or similar. These different types of BSs may have different transmission power levels, different coverage areas, and different impacts on interference in the 100 wireless network. For example, macro BSs may have a high level Petition 870190069224, dated 07 / 22 / 2019, page 39 / 150 33 / 113 transmission power (e.g., 5 to 40 Watts) while pico BSs, femto BSs, and relay BSs may have lower transmission power levels (e.g., 0.1 to 2 Watts).
[0075] A network controller 130 can couple to a set of BSs and can provide coordination and control for these BSs. The network controller 130 can communicate with the BSs through a return transport channel. The BSs can also communicate with each other, for example, directly or indirectly through a wireless or wired return transport channel. In some respects, the network controller 130 can communicate with the BSs to determine a scrambling sequence that should be used for a first processing stage, for a second processing stage, and / or the like. For example, the network controller 130 can determine that a first cell associated with a first BS is to use a first scrambling sequence for the second processing stage and a second cell associated with a second BS is to use a second scrambling sequence for the second processing stage.Additionally, or alternatively, the network controller. 130 may determine that the BSs must perform a set of phase rotations during the second processing stage. Additionally, or alternatively, the network controller 130 can determine that the BSs are to shift bits based, at least in part, on a shift sequence selected based, at least in part, on the respective physical cell IDs (PCIDs), pseudorandom sequences and / or similar during the second stage of Petition 870190069224, dated 07 / 22 / 2019, page 40 / 150 34 / 113 processing.
[0076] EUs 120 (e.g., 120a, 120b, Units (UEs) can be dispersed throughout the wireless network 100, and each UE can be stationary or mobile. A UE may also be referred to as an access terminal, a terminal, a mobile station, a subscriber unit, a station, and / or similar. A UE can be a mobile phone (e.g., a smartphone, such as UE 120b and / or 120d), a personal digital assistant (PDA), a wireless modem, a wireless communication device, a portable device, a laptop computer, a cordless phone, a wireless local loop (WLL) station, a tablet, a camera, a gaming device, a netbook, a smartbook, an ultrabook, a medical device or equipment, biometric sensors / devices (e.g., such as UE 120c), wearable devices (smartwatches, smart clothing, smart glasses, smart bracelets, smart jewelry (e.g., smart ring, smart bracelet)), an entertainment device (e.g.,a music or video device, or a satellite radio), a vehicle component or sensor, smart meters / sensors, industrial manufacturing equipment, a global positioning system device, a smart home device (e.g., a smart appliance, a smart lamp, such as the UE 120a) or any other suitable device that is configured to communicate via a wireless or wired medium. Some UEs may be considered evolved or enhanced machine-type communication (eMTC) UEs. MTC and eMTC UEs include, for example, robots, drones, remote devices such as, Petition 870190069224, dated 07 / 22 / 2019, page 41 / 150 35 / 113 sensors, meters, monitors, location tags and / or similar devices that can communicate with a base station, with another device (e.g., remote device) or with some other entity. A wireless node can provide, for example, connectivity over or to a network (e.g., a wide area network such as the Internet or a cellular network) via a wired or wireless communication link. Some UEs may be considered Internet of Things (IoT) devices. Some UEs may be considered Equipment of Customer Premises Equipment (CPE).
[0077] In FIG. 1, a solid line with double arrows indicates candidate transmissions between a UE and a serving BS, which is a BS designated to serve the UE on the downlink and / or uplink. A dashed line with double arrows indicates potentially interfering transmissions between a UE and a BS. For example, a scenario limited by interference with synchronous cells can occur when macro BS 110a is operating in sync with pico BS 110b, resulting in a physical broadcast channel transmission from the macro. BS 110a to UE 120a interfering with the transmission of a physical broadcast channel from pico BS 110b to UE 120b. Similarly, a scenario limited by interference with synchronous cells can occur when a physical broadcast transmission from femto BS 110c interferes with the physical broadcast transmission from macro BS 110a to UE 120c. In some respects, BSs, such as macro BS 110a and pico BS 110b, can transmit their respective physical broadcast channels with bits that are processed using a first processing stage, such as the use of a first scrambling sequence initialized based on at least Petition 870190069224, dated 07 / 22 / 2019, page 42 / 150 36 / 113 partly in a cell identifier and processed using a second processing stage, such as using a second scrambling sequence initialized at least partly in the cell identifier, to reduce interference and to allow a UE, such as the UE 120b, to receive the physical broadcast channel and determine the information transmitted through the physical broadcast channel.
[0078] In general, any number of wireless networks can be deployed in a given geographic area. Each wireless network can support a particular RAT and can operate on one or more frequencies. A RAT can also be referred to as a radio technology, an air interface, and / or similar. A frequency can also be referred to as a carrier, a frequency channel, and / or similar. Each frequency can support a single RAT in a given geographic area in order to avoid interference between wireless networks of different RATs. In some cases, NR or 5G RAT networks can be deployed.
[0079] In some examples, access to the air interface can be scheduled, where a scheduling entity (e.g., a base station, a network controller, a user device, etc.) allocates resources for communication between some or all devices and equipment within the service area or cell of the scheduling entity. Within the present description, as discussed further below, the scheduling entity may be responsible for scheduling, assigning, reconfiguring, and releasing resources to one or more subordinate entities. That is, for scheduled communication, the subordinate entities use resources allocated by the scheduling entity. Petition 870190069224, dated 07 / 22 / 2019, page 43 / 150 37 / 113 For example, the programming entity can schedule the transmission of physical broadcast channels, such as a narrowband physical broadcast channel (NB-PBCHs), from BSs to UEs. In some respects, this scheduling information can be communicated through the programming entity's signaling. For example, a UE might receive a System Information Block (SIB) message identifying a resource allocation for the physical broadcast channel, a set of scrambling sequences to be applied during processing stages to the physical broadcast channel bits, a phase rotation to be applied to the physical broadcast channel symbols, a shift sequence to be applied to the physical broadcast channel bits, and / or similar.
[0080] Base stations are not the only entities that can function as a scheduling entity. That is, in some examples, a UE can function as a scheduling entity by scheduling resources for one or more subordinate entities (e.g., one or more other UEs). In this example, the UE is functioning as a scheduling entity, and other UEs utilize resources scheduled by the UE for wireless communication. A UE can function as a scheduling entity in a peer-to-peer (P2P) network and / or in a mesh network. In a mesh network example, UEs can optionally communicate directly with each other, in addition to communicating with the scheduling entity.
[0081] Thus, in a wireless communications network with scheduled access to time-frequency resources and having a cellular configuration, a P2P configuration and a Petition 870190069224, dated 07 / 22 / 2019, page 44 / 150 38 / 113 mesh configuration, a programming entity and one or more subordinate entities can communicate using programmed resources.
[0082] As indicated above, FIG. 1 is provided only as an example. Other examples are possible and may differ from what has been described in relation to FIG. 1.
[0083] FIG. 2 shows a block diagram. 200 of a design of base station 110 and UE 120, which may be one of the base stations and one of the UEs in FIG. 1. Base station 110 may be equipped with T antennas 234a to 234t and UE 120 may be equipped with R antennas 252a to 252r, where generally T>1 and R>1.
[0084] At base station 110, a transmission processor 220 can receive data from a data source 212 for one or more UEs, select one or more modulation and coding schemes (MCS) for each UE based, at least in part, on the channel quality indicators (CQIs) received from the UE, process (e.g., encode and modulate) the data for each UE based, at least in part, on the MCS(s) selected for the UE, and provide data symbols for all UEs. The transmission processor 220 can also process system information (e.g., for semi-static resource partitioning information (SRPI) and / or similar) and control information (e.g., CQI requests, grants, upper-layer signaling and / or similar) and provide overhead symbols and control symbols. The transmission processor 220 can also generate reference symbols for reference signals (e.g., the CRS) and Petition 870190069224, dated 07 / 22 / 2019, p. 45 / 150 39 / 113 synchronization signals (e.g., primary synchronization signal (PSS) and secondary synchronization signal (SSS)). A multi-input multiple-output (MIMO) transmission processor 230 can perform spatial processing (e.g., pre-coding) on data symbols, control symbols, overhead symbols, and / or reference symbols, if applicable, and can provide T output symbol streams to T modulators (MODs) 232a to 232t. Each modulator 232 can process a respective output symbol stream (e.g., for OFDM and / or similar) to obtain an output sample stream. Each modulator 232 can additionally process (e.g., convert to analog, amplify, filter, and upconvert) the output sample stream to obtain a downlink signal.Each modulator 232 and / or other component, such as the transmission processor 220, the TX MIMO processor 230, the controller / processor 240, and / or the like, may additionally process modulated symbols (e.g., IQ symbols) from a physical broadcast channel (e.g., QPSK symbols) to apply a phase rotation to the modulated symbols based at least in part on a cell identifier, such as a cell identity (ID or CID). In some respects, each modulator 232 and / or other component, such as the transmission processor 220, the TX MIMO processor 230, the controller / processor 240, and / or the like, may additionally process modulated symbols from the physical broadcast channel to apply a first processing stage (e.g., a set of scrambling sequences applied to a set of blocks), to apply a second processing stage (e.g., a... Petition 870190069224, dated 07 / 22 / 2019, page 46 / 150 40 / 113 (a set of scrambling sequences applied to repetitions of a subset of bit repetitions from each block) and / or similar. The downlink signals from modulators 232a to 232t can be transmitted via antennas 234a to 234t, respectively. In accordance with certain aspects described in more detail below, synchronization signals can be generated with location coding to transmit additional information.
[0085] In UE 120, antennas 252a to 252r can receive downlink signals from base station 110 and / or from other base stations and can provide received signals to demodulators (DEMODs) 254a to 254r, respectively. Each demodulator 254 can condition (e.g., filter, amplify, down-convert, and digitize) a received signal to obtain input samples. Each demodulator 254 can further process the input samples (e.g., for OFDM and / or similar) to obtain received symbols. Each demodulator 254 and / or other component, such as the MIMO detector 256, the receiver processor 258, the controller / processor 280, and / or similar, can further process the input samples to reverse-process bits included in a physical broadcast channel, as described in more detail in this document.A MIMO detector 256 can obtain received symbols from all R demodulators 254a to 254r, perform MIMO detection on the received symbols, if applicable, and provide detected symbols. A receiving processor 258 can process (e.g., reverse rotation, demodulate, decode, or unscramble) the detected symbols, provide decoded data via UE 120 to a. Petition 870190069224, dated 07 / 22 / 2019, p. 47 / 150 41 / 113 data store 260 and provide decoded control information and system information to a controller / processor 280. A channel processor can determine RSRP, RSSI, RSRQ, CQI and / or similar.
[0086] In the uplink, on UE 120, a transmission processor 264 can receive and process data from a data source 262 and control information (e.g., for reports comprising RSRP, RSSI, RSRQ, CQI and / or similar) from the controller / processor 280. The transmission processor 264 can also generate reference symbols for one or more reference signals. The symbols originating from the transmission processor 264 can be precoded by a TX MIMO processor 266, if applicable, further processed by modulators 254a to 254r (e.g., for DFT-s-OFDM, CP-OFDM and / or similar) and transmitted to base station 110.At base station 110, uplink signals from UE 120 and other UEs can be received via antennas 234, processed by demodulators 232, detected by a MIMO detector 236, if applicable, and further processed by a receiving processor 238 to obtain decoded data and control information sent via UE 120. The receiving processor 238 can provide the decoded data to a data store 239 and the decoded control information to the controller / processor 240. Base station 110 may include communication unit 244 and communicate with network controller 130 via communication unit 244. Network controller 130 may include communication unit 294, controller / processor 290, and memory 292. Petition 870190069224, dated 07 / 22 / 2019, page 48 / 150 42 / 113
[0087] Controllers / processors 240 and 280 and / or any other components in FIG. 2 may direct operation on base station 110 and UE 120, respectively. For example, controller / processor 240 and / or other processors and modules on base station 110 may transmit a cell identifier (e.g., a cell identity) to a cell to allow UE 120 to reverse processing stages (e.g., scrambling sequences initialized based at least in part on the cell identifier) applied to the bits of a physical broadcast channel. In some respects, controller / processor 240 of base station 110 and / or other processors and modules on base station 110 may transmit a physical broadcast channel that includes, for example, blocks of repetitions of bit subsets that are at least partially scrambled into a cell identifier associated with base station 110.In some respects, the 280 controller / processor and / or one or more processors and modules in the UE 120 may receive a cell identifier from the 110 base station. In some respects, the 280 controller / processor and / or one or more processors and modules in the UE 120 may receive a physical broadcast channel including blocks of repetitions of bit repetition subsets that are scrambled based, at least in part, on the cell identifier.
[0088] For example, controller / processor 240 and / or other processors and modules in base station 110 may cause a transmission of the cell identifier (e.g., a cell identity) to the cell to allow UE 120 to reverse the symbol rotation of Petition 870190069224, dated 07 / 22 / 2019, page 49 / 150 43 / 113 Phase rotation of a physical broadcast channel, to unscramble the scrambled blocks of a physical broadcast channel and / or similar. In some respects, the controller / processor 240 of base station 110 and / or other processors and modules in base station 110 may transmit a physical broadcast channel that includes, for example, sets of symbols associated with at least one phase rotation based at least in part on a cell identifier associated with base station 110. In some respects, the controller / processor 280 and / or one or more other processors and modules in UE 120 may receive a cell identifier from base station 110. In some respects, the controller / processor 280 and / or one or more other processors and modules in UE 120 may receive a physical broadcast channel including sets of symbols rotated in phase based at least in part on the cell identifier.
[0089] In some respects, one or more of the components shown in FIG. 2 may be employed to perform example method 800 of FIG. 8, example method 900 of FIG. 9, example method 1000 of FIG. 10, example method 1100 of FIG. 11, example method 1400 of FIG. 14, example method 1500 of FIG. 15, example method 1600 of FIG. 16, example method 1700 of FIG. 17, and / or other processes for the techniques described in this document. Memories 242 and 282 may store data and program codes for the BS 110 and UE 120, respectively.
[0090] A 246 programmer can program UEs for data transmission on the downlink and / or uplink. By Petition 870190069224, dated 07 / 22 / 2019, page 50 / 150 44 / 113 For example, programmer 246 can program base station 110 to transmit a cell identifier and to transmit a physical broadcast channel, and can cause UE 120 to receive the cell identifier and receive the physical broadcast channel. In some respects, programmer 246 can program base station 110 to transmit the cell identifier and to transmit the physical broadcast channel concurrently, consecutively, and / or similarly. In some respects, programmer 246 can program UE 120 to receive the cell identifier and to receive the physical broadcast channel concurrently, consecutively, and / or similarly. As indicated above, FIG. 2 is provided only as an example. Other examples are possible and may differ from what has been described with respect to FIG. 2.
[0091] FIG. 3 shows an example of a 300-frame structure for FDD in a telecommunications system (e.g., LTE). The transmission timeline for each between the downlink and uplink can be partitioned into radio frame units. Each radio frame can have a predetermined duration (e.g., 10 milliseconds (ms)) and can be partitioned into 10 subframes with indices from 0 to 9. Each subframe can include two partitions. Each radio frame can include 20 partitions with indices from 0 to 19. Each partition can include L symbol periods, e.g., seven symbol periods for a normal cyclic prefix (as shown in FIG. 3) or six symbol periods for an extended cyclic prefix. The 2L symbol periods in each subframe can be indexed from 0 to 2L1. Although some techniques are described in this document in relation to frames, subframes, partitions and / or the like, Petition 870190069224, dated 07 / 22 / 2019, page 51 / 150 45 / 113 These techniques can be equally applied to other types of wireless communication structures, which may be referred to using terms other than frame, subframe, partition and / or similar in NR 5G. In some respects, a wireless communication structure may refer to a time-limited periodic communication unit defined by a wireless communication standard and / or protocol.
[0092] In certain telecommunications (for example, (LTE), a BS can transmit a primary synchronization signal (PSS) and a secondary synchronization signal (SSS) in the downlink at the center of the system bandwidth for each cell supported by the BS. The PSS and SSS can be transmitted in symbol periods 6 and 5, respectively, in subframes 0 and 5 of each radio frame with the normal cyclic prefix, as shown in FIG. 3. The PSS and SSS can be used by UEs for cell search, acquisition, cell identity determination, unscrambling, and phase rotation reversal. The BS can transmit a cell-specific reference signal (CRS) across the system bandwidth for each cell supported by the BS. The CRS can be transmitted in specific symbol periods of each subframe and can be used by UEs to perform channel estimation, channel quality measurement, and / or other functions.A BS can also transmit a physical broadcast channel (PBCH), such as a narrowband PBCH (NB-PBCH), during symbol periods 0 to 3 in partition 1 of certain radio frames. The PBCH can carry some system information.
[0093] In some respects, a block of Petition 870190069224, dated 07 / 22 / 2019, page 52 / 150 46 / 113 Main Information Bullets (MIB) are encoded for an NB-PBCH to obtain a quantity of L bits for rate matching. The quantity of L bits can be scrambled, in a first processing stage, and can be partitioned into N blocks. For example, the MIB can be encoded to a total of 1600 bits, which can be scrambled during a first processing stage using a first scrambling sequence and which can be divided into 8 blocks of 200 bits in each block. Each block can include repetitions of a bit repetition subset, with the repetitions being transmitted during a particular number of radio frames. For example, repetitions of a bit repetition subset from a first block can be transmitted during radio frames 0, 1, 2, 3, 4, 5, 6, and 7, and repetitions of a bit repetition subset from a second block can be transmitted during radio frames 8, 9, 10, 11, 12, 13, 14, and 15.
[0094] In some respects, BS can apply a second processing stage to repetitions of bit repetition subsets of each block. For example, BS can apply a set of scrambling sequences such that, for example, a particular repetition of the bit repetition subset of a first block (e.g., the bit subset for transmission in radio frame 0) and a corresponding particular repetition of the bit repetition subset of a second block (e.g., the bit subset for transmission in radio frame 8) are processed using a common processing scheme (e.g., the same scrambling sequence). In some respects, BS can modulate the Petition 870190069224, dated 07 / 22 / 2019, p. 53 / 150 47 / 113 repetitions of bit repetition subsets in symbols, and can apply a phase rotation to the symbols during the second processing stage. In some respects, the BS can apply a shift sequence to the bit repetition subset repetitions. For example, the BS can shift bit repetition subset repetitions by a first number of feature elements when mapping the feature elements to subframes, and another BS can offset repetitions of another repeated bit subset by a second, different number of feature elements when mapping feature elements to subframes. In this way, the BS can reduce interference or randomize interference between the NB-PBCHs provided through the BS and the other BS.
[0095] The BS may transmit other system information, such as System Information Blocks (SIBs) on a Physical Downlink Shared Channel (PDSCH) in certain subframes. The BS may transmit control information / data on a Physical Downlink Control Channel (PDCCH) in the first B symbol periods of a subframe, where B may be configurable for each subframe. The BS may transmit traffic data and / or other data on the PDSCH in the remaining symbol periods of each subframe.
[0096] In other systems (for example, such as NR or 5G systems), a Node B may transmit these or other signals at these locations or at different locations of the subframe.
[0097] As indicated above, FIG. 3 is provided only as an example. Other examples are Petition 870190069224, dated 07 / 22 / 2019, page 54 / 150 48 / 113 possible and may differ from what was described in relation to FIG. 3
[0098] FIG. 4 shows two examples of 410 and 420 subframe formats with the normal cyclic prefix. The available frequency time resources can be partitioned into resource blocks. Each resource block can cover 12 subcarriers in a partition and can include multiple resource elements. Each resource element can cover one subcarrier in a symbol period and can be used to send a modulation symbol, which can be a real or complex value.
[0099] The 410 subframe format can be used for two antennas. A CRS can be transmitted from antennas 0 and 1 in symbol periods 0, 4, 7, and 11. A reference signal is a signal that is known a priori by a transmitter and a receiver and can also be referred to as a pilot. A CRS is a reference signal that is specific to a cell, for example, generated based, at least in part, on a cell identity (ID). In FIG. 4, for a given feature element labeled Ra, a modulation symbol can be transmitted on that feature element from antenna a, and no modulation symbol can be transmitted on that feature element from other antennas. The modulation symbol bits can be processed using a first processing stage and a second processing stage based, at least in part, on a cell ID to compensate for interference in a physical broadcast channel.The 420 subframe format can be used with four antennas. A CRS can be transmitted from antennas 0 and 1 during the periods. Petition 870190069224, dated 07 / 22 / 2019, p. 55 / 150 49 / 113 of symbol 0, 4, 7 and 11 and antennas 2 and 3 in symbol periods 1 and 8. For both 410 and 420 subframe formats, a CRS can be transmitted on evenly spaced subcarriers, which can be determined based, at least in part, on the cell ID. CRSs can be transmitted on the same or different subcarriers depending on their cell IDs. For both 410 and 420 subframe formats, feature elements not used for the CRS can be used to transmit data (e.g., traffic data, control data, and / or other data).
[00100] An interleaved structure can be used for each between the downlink and uplink for FDD in certain telecommunications systems (e.g., LTE). For example, Q interleave can be defined with indices from 0 to Q - 1, where Q can be equal to 4, 6, 8, 10, or some other value. Each interleave can include subframes spaced by Q frames. In particular, the q interleave can include q, q + Q, q + 2Q, and / or similar subframes, where q € {0, ..., Q-1}.
[00101] The wireless network can support Hybrid Automatic Retransmission Request (HARQ) for data transmission on both the downlink and uplink. For HARQ, a transmitter (e.g., a BS) can send one or more transmissions of a packet until the packet is correctly decoded by a receiver (e.g., a UE) or some other termination condition is met. For synchronous HARQ, all transmissions of the packet can be sent in subframes of a single interleave. For asynchronous HARQ, each transmission of the packet can be sent in any subframe. Petition 870190069224, dated 07 / 22 / 2019, page 56 / 150 50 / 113
[00102] An UE may be located within the coverage of multiple BSs. One of these BSs may be selected to serve the UE. The serving BS may be selected based, at least in part, on several criteria, such as received signal strength, received signal quality, path loss, and / or similar. Received signal quality may be quantified by a signal-to-noise-interference ratio (SINR) or a reference received signal quality (RSRQ), or some other metric. The UE may operate in a dominant interference scenario (an interference-limited scenario) in which the UE may experience high interference from one or more interfering BSs.In such a scenario, the BS can scramble, shift, and / or phase-rotate bits that are transmitted through a physical broadcast channel based, at least in part, on, for example, a cell ID, and the UE can receive the physical broadcast channel and can unscramble the bits, compensate for a bit shift, and / or reverse the bit rotation based, at least in part, on a cell identifier, such as the cell ID.
[00103] Although aspects of the examples described in this document may be associated with LTE technologies, aspects of the present description may be applicable to other wireless communication systems, such as NR or 5G technologies.
[00104] New radio (NR) may refer to radios configured to operate under a new air interface (e.g., interfaces other than Frequency Division Multiple Access-based air interfaces). Petition 870190069224, dated 07 / 22 / 2019, p. 57 / 150 51 / 113 Orthogonal (OFDMA) or fixed transport layer (e.g., other than Internet Protocol (IP)). In some aspects, NR can use OFDM with a CP (referred to in this document as cyclic prefix OFDM or CP-OFDM) and / or SC-FDM on the uplink, can use CP-OFDM on the downlink, and include support for half-duplex operation using TDD. In other aspects, NR can, for example, use OFDM with a CP (referred to in this document as CP-OFDM) and / or orthogonal frequency division multiplexing with discrete Fourier transform spreading (DFT-s-OFDM) on the uplink, can use CPOFDM on the downlink, and includes support for half-duplex operation using TDD.NR may include Enhanced Mobile Broadband (eMBB) service targeting wide bandwidth (e.g., 80 megahertz (MHz) and higher), millimeter wave (mmW) targeting high carrier frequency (e.g., 60 gigahertz (GHz)), massive MTC (mMTC) targeting backward compatible MTC techniques, and / or mission-critical segmentation targeting ultra-reliable low-latency communications (URLLC).
[00105] A single-component carrier bandwidth of 100 MHz can be supported. NR resource blocks can span 12 subcarriers with a subcarrier bandwidth of 75 kilohertz (kHz) for a duration of 0.1 ms. Each radio frame can include 50 subframes with a length of 10 ms. Consequently, each subframe can have a length of 0.2 ms. Each subframe can indicate a link direction (e.g., DL or UL) for data transmission, and the link direction for each subframe can be dynamically switched. Each subframe can include DL / UL data as well as data from Petition 870190069224, dated 07 / 22 / 2019, page 58 / 150 52 / 113 DL / UL control.
[00106] Beamforming can be supported and beam direction can be dynamically configured. MIMO transmissions with pre-coding can also be supported. MIMO configurations in DL can support up to 8 transmit antennas with multilayer DL transmissions of up to 8 streams and up to 2 streams per UE. Multilayer transmissions with up to 2 streams per UE can be supported. Multi-cell aggregation can be supported with up to 8 server cells. Alternatively, NR can support a different air interface, other than an OFDM-based interface. NR networks can include entities such as central units or distributed units.
[00107] A RAN may include a central unit (CU) and distributed units (DUs). An NR BS (e.g., gNB, 5G Node B, Node B, Transmit Receive Point (TRP), Access Point (AP)) may correspond to one or multiple BSs. NR cells may be configured as access cells (ACells) or data-only cells (DCells). For example, the RAN (e.g., a central unit or distributed unit) may configure the cells. DCells may be cells used for carrier aggregation or dual connectivity, but not used for initial access, cell selection / reselection, or handover. In some cases, DCells may not transmit synchronization signals – in some cases, DCells may transmit SS. NR BSs may transmit downlink signals to UEs indicating the cell type. Based, at least in part, on the cell type indication, the UE may communicate with the NR BS. For example, the EU may determine BSs NR to consider for Petition 870190069224, dated 07 / 22 / 2019, page 59 / 150 53 / 113 Cell selection, access, handover and / or measurement based, at least in part, on the indicated cell type.
[00108] As indicated above, FIG. 4 is provided only as an example. Other examples are possible and may differ from what has been described in relation to FIG. 4.
[00109] FIG. 5 is a diagram illustrating a 500 example of a BS, in a scenario limited by interference with synchronous cells, transmitting an NB-PBCH and a UE receiving the NB-PBCH. As shown in FIG. 5, the 500 example may include BSs 110-1 and 110-2 (collectively referred to as BS 110 and generally referred to as BS 110) and UEs 120-1 and 120-2 (collectively referred to as UE 120 and generally referred to as UE 120).
[00110] In 510, BSs 110 can apply, respectively, a first processing stage to the blocks of the respective NB-PBCHs and a second processing stage to repetitions of bit repetition subsets of each block of the respective NB-PBCHs. For example, BS 110-1 can apply, during the first processing stage, a first set of shuffling sequences, S = {So, Si,...,Sm}, which are initialized based, at least in part, on a cell identity associated with BS 110-1, to the blocks of the first NBPBCH. In this case, a first block can be shuffled using a first shuffling sequence, from the first set of shuffling sequences, So; a second block can be shuffled using a second shuffling sequence, from the first set of shuffling sequences, Si; an nth block can be Petition 870190069224, dated 07 / 22 / 2019, p. 60 / 150 54 / 113 shuffled using an nth shuffling sequence, from the first set of shuffling sequences, Sm (where M = N - 1); and / or similar. In this case, the first set of shuffling sequences provides redundancy differentiation. In some respects, BS 110-2 may apply a second set of shuffling sequences that is different from the first set of shuffling sequences.
[00111] In some respects, the shuffling sequences of the first set of shuffling sequences may be portions of a single shuffling sequence. For example, a single shuffling sequence S may be used, such that So is a first set of shuffling values of S, S1 is a second set of shuffling values of S, and Sm is an nth set of shuffling values of S. In some respects, each shuffling sequence may include a plurality of shuffling values. For example, the shuffling sequence may represent a set of shuffling values [s(0, 0), s(0, 1), s(0, 2), ...], such that s(i, j) = 0 or 1.
[00112] In some respects, BS 110-1 can apply, during the second processing stage, a second set of shuffling sequences, C = {Co, C1, ..., C7}, for each repetition of a bit repetition subset of a block. For example, BS 110-1 can apply the shuffling sequence C0 for a first repetition of a bit repetition subset of the first block, and the shuffling sequence C1 for a second repetition of the bit repetition subset of the first block. Petition 870190069224, dated 07 / 22 / 2019, p. 61 / 150 55 / 113 block, etc. In some respects, each repetition of the bit repetition subset that is encoded based, at least in part, on Co, Ci, ..., C7 is a repetition of a block rather than a repetition of a portion of a block. Similarly, BS 11o-1 can apply the same Co scrambling sequence to a first corresponding repetition of a bit repetition subset of the second block, the same Ci scrambling sequence to a second corresponding repetition of the bit repetition subset of the second block, etc. In this case, the second set of scrambling sequences provides inter-cell interference randomization to compensate for interference between, for example, BS 110-1 and BS 110-2 based, at least in part, on BS 11o-2, by applying a different C scrambling set.Based, at least in part, on the use of the same C-scrambling sequence for each block of the first PBB-NB, BS 110-1 allows UE 120 to reverse the second processing stage with reduced use of computing resources compared to using different Co,7, C8,15, etc. scrambling sequences for each block.
[00113] In some respects, each shuffling sequence of the second set of shuffling sequences may include a plurality of bit tuples, such as a plurality of four-bit quadruples, for shuffling repetitions of bit repetition subsets. For example, the Co shuffling sequence may include a bit set of the form [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, ...], the Ci shuffling sequence may include a bit set [1, 1, 1, 1, 0, 0, 0, 0, 1, ...] Petition 870190069224, dated 07 / 22 / 2019, p. 62 / 150 56 / 113 1, 1, 1, ...], the C2 scrambling sequence may include a set of bits [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, ], etc. In this case, BS 110-1 may generate the second set of scrambling sequences based, at least in part, on the repetition of bits from another scrambling sequence. For example, for a shuffling sequence S0 =[0, 1, 1, ...], BS 110-1 can obtain C0 = [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, ...]. In this case, a modulation symbol. A two-bit consecutive QPSK can be scrambled by [0, 0], which has the effect of multiplying the QPSK symbol by 1, or by [1, 1], which has the effect of multiplying the QPSK symbol by -1. Furthermore, an Alamouti pair of two consecutive QPSK symbols is multiplied by [1, -1]. Thus, when the BS BS 110-1 applies C-level scrambling sequences to bit subsets; it performs a transformation implemented as a bit-level scrambling sequence that can be equated to a phase rotation of symbols. QPSK (e.g., a 0-degree or 180-degree phase rotation) at a symbol level. This can allow the UE 120-1 to perform a symbol-level combination to unscramble the first NB-PBCH, thus enabling the UE 120-1 to perform the unscramble with reduced processing resource usage compared to performing bit-level combination.
[00114] In some respects, BS 110-1 may apply another differentiator during the second processing stage. For example, BS 110-1 may apply a mapped feature element offset based, at least in part, on the BS 110-1 cell identity. In this case, when mapping QPSK symbols to feature elements, Petition 870190069224, dated 07 / 22 / 2019, page 63 / 150 57 / 113 each BS 110 can initiate mapping at a different subframe (for example, BS 110-1 can initiate mapping at an offset of 3 feature elements, BS 110-2 can initiate mapping at an offset of 1 feature element, etc.). In this case, BS 110-2 can initiate mapping at an offset of a different number of feature elements, which can result in reduced intercellular interference. In this way, BS 110s can provide intercellular randomness to compensate for intercellular interference.
[00115] In 520, BSs 110 can transmit their respective NB-PBCHs. For example, BS 110-1 can transmit a first NB-PBCH that is destined for UE 120-1, and it may be an interfering transmission for UE 120-2. Similarly, BS 110-2 can transmit a second NB-PBCH destined for UE 120-2, and it may be an interfering transmission for UE 120-1. In some respects, BSs 110 can transmit their respective cell identifiers identifying the respective cell identities before transmitting their respective NB-PBCHs. For example, BSs 110 can transmit their respective PSSs or SSSs based, at least in part, on which UEs 120 can determine the respective cell identities for the respective BSs 110. In some respects, BSs 110 can transmit their respective cell identifiers simultaneously with the transmission of their respective NB-PBCHs.For example, BS 1101 can transmit a transmission that includes a cell identifier identifying a BS 1101 cell identity and that includes an NB-PBCH.
[00116] In 530, the EUs 120 can receive the Petition 870190069224, dated 07 / 22 / 2019, page 64 / 150 58 / 113 respective NB-PBCHs. For example, UE 120-1 may receive the first NB-PBCH from BS 110-1, and may receive interference transmissions from one or more other cells, such as the second NB-PBCH from BS 110-2. Similarly, UE 120-2 may receive the second NB-PBCH from BS 110-2 and may receive interference transmissions from one or more other cells, such as the first NB-PBCH from BS 110-1. In some respects, based at least in part on the scrambling sequences applied to the respective NB-PBCHs or other differentiating factors in the respective NB-PBCHs, the interference associated with the interference transmissions may be below a threshold value. In some respects, UEs 120 may receive cell identifiers from their respective BS 110s before receiving their respective NBPBCHs.For example, UE 120-1 may receive a PSS or an SSS that includes information identifying a cell identifier for a cell from which UE 120-1 should receive a PBCH-NB. In some respects, UE 120s may receive the respective cell identifiers simultaneously with receiving the respective NB-PBCHs. For example, UE 1201 may receive a transmission from BS 110-1 that includes a cell identifier and that includes an NB-PBCH.
[00117] In 540, UEs 120 can perform the shuffling of their respective NB-PBCHs using their respective cell identifiers. For example, based at least in part on information identifying block boundaries between each block (for example, based at least in part on stored information indicating a block boundary at 80 ms) and based at least in part, Petition 870190069224, dated 07 / 22 / 2019, page 65 / 150 Using the same set of Co,7 shuffling sequences in each block, UE 120-1 can determine log-likelihood ratios (LLRs) for a group of 200 bits in 8 consecutive subframes, which can result in the storage and processing of 1600 LLRs and can perform the combination in different blocks of the first NB-PBCH to reverse the second processing stage to recover the NB-PBCH. Additionally, UE 120-1 can reverse the first processing stage using a hypothesis testing procedure to recover the NB-PBCH. Thus, UE 120-1 requires reduced memory and processing resource usage compared to another proposed shuffling technique that does not repeat the Co,7 shuffling sequences for each block. For example, it has been proposed that each block uses a different shuffling sequence (e.g., Co,7 for the first block, C8,15 for the second block, etc.).), which can result in 1600*M LLRs for a quantity of M blocks, thus causing a substantially higher utilization of processing resources and / or memory resources by UEs 120.
[00118] As indicated above, FIG. 5 is provided as an example. Other examples are possible and may differ from what has been described in relation to FIG. 5.
[00119] FIG. 6 is a diagram illustrating a 600 example of a BS, in a scenario limited by interference with synchronous cells, transmitting an NBPBCH, and a UE receiving the NB-PBCH. As shown in FIG. 6, the 600 example may include BSs 110-1 and 110-2 (collectively referred to as BS 110 and generally referred to as BS 110) and UE 120-1 and 120-2 (collectively referred to as UE 120-1 and 120-2). Petition 870190069224, dated 07 / 22 / 2019, page 66 / 150 60 / 113 as EU 120 and generally referred to as EU 120).
[00120] In 610, BSs 110 can apply, respectively, a processing stage for repetitions of symbol repetition subsets of each block of the respective NB-PBCHS. In the processing stage, a set of shuffling sequences, S = {S0, S1, ..., S7}, can be applied for each repetition of symbol repetition subsets of a block. For example, BS 1101 can apply a shuffling or rotation sequence S0 for a first repetition of a symbol repetition subset of the first block, a shuffling or rotation sequence S1 for a second repetition of the symbol repetition subset of the first block, etc.Similarly, BS 110-1 can apply the same shuffling or rotation sequence S0 for a first corresponding repetition of a symbol repetition subset of the second block, the same shuffling or rotation sequence S1 for a second corresponding repetition of the symbol repetition subset of the second block, etc. In this case, the set of shuffling or rotation sequences provides interference randomization between cells to compensate for interference between, for example, BS 110-1 and BS 110-2 based, at least in part, on BS 110-2, applying a different set of shuffling or rotation sequences, S. Based, at least in part, on the use of the same shuffling or rotation sequence S for each block of the first NB-PBCH, BS 110-1 allows UE 120 to reverse the processing stage with reduced use of computational resources compared to using different sequences. Petition 870190069224, dated 07 / 22 / 2019, page 67 / 150 61 / 113 shuffling sequences for each block.
[00121] In some respects, the sequence of shuffling or rotation sequences can be generated based, at least in part, on a cell identifier (cell ID) and / or a timing indication (e.g., frame number). For example, the set of sequences used by cell c1 (e.g., BS 1101), Sc1 = {So,c1, S1,c1, ..., S7,c1}, can be obtained by generating a first binary sequence (e.g., a pseudorandom binary sequence, a binary sequence generated by a binary generator, a deterministic binary sequence, and / or similar) for each of the shuffling or rotation sequences Si,j (e.g., using a Gold code) that can be mapped to a complex shuffling or rotation sequence. In some respects, the binary sequence can be generated based, at least in part, on a binary generator, which may be a pseudorandom bit generator initialized based on a particular value.In some respects, the pseudorandom bit generator can be a bit generator based on the linear feedback shift register (LFSR), in which an initial state of the LFSR is based, at least in part, on a particular value. For a pseudorandom binary sequence ci, j of length 2W, the corresponding shuffling or rotation sequence Si,j can be of length W. For example, the shuffling or rotation sequence can be obtained from the pseudorandom binary sequence as... Petition 870190069224, dated 07 / 22 / 2019, p. 68 / 150 62 / 113 3^} = ' 1=seCj j (2«) = 0eCj j(ln +1) = 0 —1=se Cj j(2n) = 0 and Cj j (2?r +1) = 1 lj:seCj y(2n) = 1eíj j(2n +1) = 0 -1^56^-(217) = 1 and ς-_7-(2?7+ 1)=1 where Ij denotes the imaginary unit.
[00122] Generating a pseudorandom sequence set ciy can be based, at least in part, on an initialization value. In some cases (e.g., for Gold codes), the pseudorandom sequence can be an affine function of the initialization value. In other words, the pseudorandom sequence can be based, at least in part, on a combination of a linear term and a constant term, such that ciy = L líy + X, where L is a binary generator matrix that depends on the generator polynomial of the pseudorandom sequence, Ιϊρ is a binary vector containing the initialization value of the pseudorandom sequence for the i-th repetition of the repeating subset of symbols associated with cell j, and X is a binary constant vector. The initialization of the pseudorandom sequence can be selected based, at least in part, on a non-linear combination of the cell ID je of the repetition index 1.In contrast, selecting initializations that are linear functions of i and j can lead to a cross-correlation property, such as Cnyi + Cn,j2 = Ci2,ji + Ci2,j2. In one example, lip = j + 29(i + 1)3* (j + 1) . The term 29(i + 1)3* (j + 1) introduces a non-linear dependence that can improve the cross-correlation properties of the sequences.
[00123] In some respects, for an NB-PBCH, a block of complex-valued symbols y(p)(0) , . . ., y(p)(Msyrrí, Petition 870190069224, of 22 / 07 / 2019, p. 69 / 150 63 / 113 1) must be transmitted in subframe 0 during 64 consecutive radio frames, where Msy^b = 800 for a normal cyclic prefix. The complex-valued symbol block can be transmitted in a first radio frame that satisfies m mod 64 = 0. In this case, nf denotes an index of a radio frame and Msyrob denotes a number of symbols. A complex-valued symbol block to be transmitted in subframe 0 of the radio frame f = nf is denoted as y(p)(0), ..., y(p)(K - 1), where y(p)(f)(i) = Qf(i) y(X(K[f / 8j + i)), for i = 0, ..., 99. In this case, K = 100 for a normal cyclic prefix and a phase rotation is applied based, at least in part, on:
[00124] In some respects, for an NB-PBCH, a shuffling sequence Cf(j), for j 0, 199 is initialized at the beginning of each radio frame based, at least in part, on an equation: cinit= <XiDe11 m°d8 + l)3-2$ + / V^e^ , onde N^cel1denota um identificador de uma célula. O bloco de símbolos com valores complexos é mapeado, iniciando em y(p)f(0) para os elementos de recurso (k, 1).
[00125] In some respects, for a system information block (SIB) of a shared downlink channel (for example, a narrowband physical shared downlink channel (NB-PDSCH or NPDSCH)) carrying a transmission control channel (BCCH), a Petition 870190069224, dated 07 / 22 / 2019, page 70 / 150 64 / 113 scrambling sequence using a scrambling sequence generator initialized based, at least in part, on an equation cinit = nRNTI · 215 + (^iNce1 + 1)((nf mod 61) + 1), an equation cinit = nRNTI · 214 + nf mod 2 · 213 + Lns / 2J · 29 + NNce11 and / or similar, where ns denotes a first partition of a codeword transmission. In this case, the scrambling sequence generator can be reinitialized for each repetition of NB-PDSCH, after each set among a plurality of repetitions of NB-PDSCH, and / or similar.
[00126] In 620, BSs 110 can transmit their respective NB-PBCHs. For example, BS 110-1 can transmit a first NB-PBCH that is destined for UE 120-1, and it may be an interfering transmission for UE 120-2. Similarly, BS 110-2 can transmit a second NB-PBCH destined for UE 120-2, and it may be an interfering transmission for UE 120-1. In some respects, BSs 110 can transmit their respective cell identifiers, identifying the respective cell identities before transmitting their respective NB-PBCHs. For example, BSs 110 may transmit their respective PSSs or SSSs based, at least in part, on what UEs 120 may determine as their respective cell identities for the respective BSs 110. In some respects, BSs 110 may transmit their respective cell identifiers simultaneously with the transmission of their respective NB-PBCHs.For example, BS 1101 can transmit a transmission that includes a cell identifier identifying a BS 1101 cell identity and that includes an NB-PBCH. Petition 870190069224, dated 07 / 22 / 2019, page 71 / 150 65 / 113
[00127] In 630, UEs 120 can receive their respective NB-PBCHs. For example, UE 120-1 can receive the first NB-PBCH from BS 110-1, and can receive interfering transmissions from one or more other cells, such as the second NB-PBCH from BS 110-2. Similarly, UE 120-2 can receive the second NB-PBCH from BS 110-2 and can receive interfering transmissions from one or more other cells, such as the first NB-PBCH from BS 110-1. In some respects, based at least in part on the scrambling or rotation sequences applied to the respective NB-PBCHs or other differentiating factors in the respective NB-PBCHs, the interference associated with interfering transmissions may be less than a threshold and / or random value. In some respects, UEs 120 may receive cell identifiers from their respective BSs 110 before receiving their respective NB-PBCHs.For example, UE 120-1 may receive a PSS or an SSS that includes information identifying a cell identifier for a cell from which UE 120-1 should receive an NB-PBCH. In some respects, UE 120s may receive their respective cell identifiers simultaneously with receiving their respective NB-PBCHs. For example, UE 1201 may receive a transmission from BS 110-1 that includes a cell identifier and that includes an NB-PBCH.
[00128] In 640, UEs 120 can perform unscramble or reverse rotation of their respective NB-PBCHs using their respective cell identifiers.
[00129] As indicated above, FIG. 6 is provided as an example. Other examples are possible and Petition 870190069224, dated 07 / 22 / 2019, page 72 / 150 66 / 113 may differ from what was described in relation to FIG. 6
[00130] FIG. 7 is a diagram illustrating an example 700 of a BS, in a scenario limited by interference with synchronous cells, transmitting an NB-PBCH including a set of phase rotation symbols and a UE receiving the NB-PBCH. As shown in FIG. 7, the example 1300 may include BSs 110-1 and 110-2 (collectively referred to as BS 110 and generally referred to as BS 110) and UEs 120-1 and 120-2 (collectively referred to as UE 120 and generally referred to as UE 120). In 710, BSs 110 may apply, respectively, a first set of phase rotations to a first set of symbols and a second set of phase rotations to a second set of symbols, where the first set of phase rotations is different from the sending set of phase rotations. For example, BS 110-1 may apply the first set of phase rotations based, at least in part, on a cell identity associated with base station 110-1. In some respects, the symbols may be modulated QI symbols (e.g., QPSK symbols). For example, after modulating a symbol, BS 110-1 can apply a phase rotation to the symbol.
[00131] In some respects, BS 110s can apply phase rotations based, at least in part, on a scrambling sequence of a respective NB-PBCH. For example, BS 110-1 can apply phase rotations: 1: c(2i) = 0 and c(2i + 1) = 0 I -1: c(2i) = 0 E c(2l + 1) =1 r(l)= | j: c(2i) = 1 E c(2l + 1) =0 { -j:c(2i) = 1 E c(2l + 1) =1 where r(i) represents a phase rotation applied to each feature element i within a set of Petition 870190069224, dated 07 / 22 / 2019, p. 73 / 150 67 / 113 repetition of OFDM symbols using the same scrambling sequence, c(i) represents a value at position i in a sequence of length 2M, and M represents a quantity of feature elements in a subframe. In this case, BS 110-1 can apply the first set of phase rotations based, at least in part, on a first cell identity associated with BS 110-1 and the scrambling sequence, and BS 110-2 can apply the second set of phase rotations based, at least in part, on a second cell identity associated with BS 110-2 and the scrambling sequence. Thus, the transmissions of the respective NB-PBCHs from BS 110-1 and BS 110-2 are associated with different phase rotations, which can allow UEs 120 to identify the symbols included in the respective NB-PBCHs.Additionally, or alternatively, BS 110s can apply phase rotations based, at least in part, on an orthogonal or nearly orthogonal sequence. For example, a BS 110 can select a nearly orthogonal sequence from a set of nearly orthogonal sequences based, at least in part, on a cell identity and can use the nearly orthogonal sequence to determine a phase rotation to apply to a symbol.
[00132] In some respects, BS 110 standards may apply different phase rotations to each feature element of an OFDM symbol. For example, BS 110-1 may apply a set of phase rotations to a set of feature elements in an OFDM symbol. In some respects, BS 110 standards may apply different phase rotations to each OFDM symbol of a subframe. For example, BS 110-1 Petition 870190069224, dated 07 / 22 / 2019, p. 74 / 150 68 / 113 can apply a first phase rotation to each feature element in a first OFDM symbol and can apply a second phase rotation to each feature element in a second OFDM symbol. In some respects, BS 110s can apply different phase rotations to each subframe. For example, BS 110-1 can apply a first phase rotation to each feature element of each OFDM symbol in a first subframe and can apply a second phase rotation to each feature element of each OFDM symbol in a second subframe.
[00133] In another example, BSs 110 can apply another differentiator to an NB-PBCH to compensate for and / or reduce interference. For example, BSs 110 can compensate for the transmission frequencies of their respective NB-PBCH transmissions. In this case, BS 110-1 can transmit an NB-PBCH on a first frequency and BS 110-2 can transmit an NB-PBCH on a second frequency that is offset from the first frequency by a limiting amount. Additionally, or alternatively, BSs 110 can offset subframes of their respective NB-PBCH transmissions. In this case, BS 110-1 and BS 110-2 can apply relative subframe delays of respective amounts of subframes based, at least in part, on their respective physical cell identities.
[00134] In 720, BS 110s can transmit their respective NB-PBCHs. For example, BS 110-1 can transmit a first NB-PBCH that is intended for UE 120-1, and this may be an interfering transmission for UE 120-2. Similarly, BS 110-2 can transmit a second NB-PBCH intended for UE 120-2, and this may be an interfering transmission. Petition 870190069224, dated 07 / 22 / 2019, page 75 / 150 69 / 113 for UE 120-1. In some respects, BSs 110 may transmit their respective cell identifiers identifying their respective cell identities before transmitting their respective NB-PBCHs. For example, BSs 110 may transmit their respective PSSs or SSSs based, at least in part, on which UEs 120 may determine the respective cell identities for their respective BSs 110. In some respects, BSs 110 may transmit their respective cell identifiers simultaneously with the transmission of their respective NB-PBCHs. For example, BS 1101 may transmit a transmission that includes a cell identifier identifying a BS 1101 cell identity and that includes an NB-PBCH.
[00135] In 730, UEs 120 can receive their respective NB-PBCHs. For example, UE 120-1 can receive the first NB-PBCH from BS 110-1, and can receive interfering transmissions from one or more other cells, such as the second NB-PBCH from BS 110-2. Similarly, UE 120-2 can receive the second NB-PBCH from BS 110-2 and can receive interfering transmissions from one or more other cells, such as the first NB-PBCH from BS 110-1. In some respects, based at least in part on phase rotation or other differentiating factors in the respective NB-PBCHs, interference associated with interfering transmissions may be below a threshold value. In some respects, UEs 120 may receive cell identifiers from their respective BS 110s before receiving their respective NBPBCHs. For example, UE 120-1 may receive a PSS or an SSS that includes information identifying a cell identity. Petition 870190069224, dated 07 / 22 / 2019, page 76 / 150 70 / 113 for a cell from which UE 120-1 should receive a PBCH-NB. In some respects, UE 120s may receive their respective cell identifiers simultaneously with receiving their respective NB-PBCHs. For example, UE 1201 may receive a transmission from BS 110-1 that includes a cell identifier and that includes an NB-PBCH.
[00136] In 740, UEs 120 can reverse the symbol rotation of the respective NB-PBCHs. For example, UE 120-1 can reverse the rotation of the first set of symbols based, at least in part, on the first set of phase rotations applied by BS 110-1. In this case, based, at least in part, on receiving phase-rotated symbols to compensate for interference, UEs 120 can perform averaging to determine the phase-rotated symbols of the desired NB-PBCH. In some respects, UE 120 can reverse the rotation of phase-rotated symbols based, at least in part, on cell identity. For example, UE 120-1 can determine a set of phase rotations that were applied to the symbol set via BS 110-1 based, at least in part, on cell identity, and can reverse the rotation of the symbol set based, at least in part, on the set of phase rotations.In this case, the UEs 120 can demodulate the symbol set after reversing the rotation of the symbol set to determine the information transmitted by the symbol set.
[00137] As indicated above, FIG. 7 is provided as an example. Other examples are possible and may differ from what has been described in relation to FIG. 7.
[00138] FIG. 8 is a flowchart of a method Petition 870190069224, dated 07 / 22 / 2019, p. 77 / 150 71 / 113 800 wireless communication. The 800 method can be implemented by a BS (for example, which may correspond to one or more BSs 110, such as BSs 110-1 and / or 110-2, the 1202 / 1202' handset, the 1850 base station, and / or similar devices).
[00139] In 810, in some respects, BS applies a set of processing stages to the bits of a physical broadcast channel (810 block). For example, BS may apply a first processing stage, such as a first set of scrambling sequences, to the bit blocks of the physical broadcast channel. Additionally, or alternatively, BS may apply a second processing stage, such as a second set of scrambling sequences, to repetitions of bit repetition subsets of the physical broadcast channel. In some respects, BS may cause a phase rotation to be applied to the bits of the physical broadcast channel, as based, at least in part, on the use of bit quadruples for a scrambling sequence. In some respects, BS may apply a shift to a feature element mapping of the physical broadcast channel.In some respects, the BS may apply the set of processing stages to each bit before transmitting the physical broadcast channel. In some respects, the BS may apply one or more processing stages to the first bits of the physical broadcast channel, may transmit the first bits, and may subsequently apply one or more processing stages to the second bits of the physical broadcast channel and may transmit the second bits.
[00140] In 820, the BS transmits a cell identifier for a cell (block 820). For example, the BS Petition 870190069224, dated 07 / 22 / 2019, page 78 / 150 72 / 113 can transmit the cell identifier to a UE before transmitting a physical broadcast channel, such as an NBPBCH. In some respects, the BS can transmit a PSS or an SSS, as described in more detail in this document, which can indicate a cell identifier, such as a cell identity (cell ID or CID), that identifies a cell. Additionally, or alternatively, the BS can transmit the cell identifier simultaneously with the transmission of the physical broadcast channel. In some respects, the BS can transmit the cell identifier before applying the set of processing stages to the bits of the physical broadcast channel. For example, the BS can transmit the cell identifier before applying the set of processing stages to the bits of the physical broadcast channel.For example, the BS can transmit the cell identifier to the UE, and can subsequently process bits from the physical broadcast channel based, at least in part, on the set of processing stages.
[00141] In 830, the BS transmits a physical broadcast channel (block 830). For example, the BS may transmit the physical broadcast channel, which includes a plurality of blocks. In some respects, each block, among the plurality of blocks, includes bit repetition subsets. In some respects, each block, among the plurality of blocks, is processed using a first processing stage. In some respects, each repetition of the bit repetition subsets, for each block, is processed using a second processing stage such that a particular repetition of the bit repetition subset of a first block and a particular repetition Petition 870190069224, dated 07 / 22 / 2019, page 79 / 150 73 / 113 corresponding bits of the repeating subset of a second block are processed using a common processing scheme. In some respects, the first processing stage and the second processing stage are initialized based, at least in part, on the cell identifier.
[00142] In some respects, the first block and the second block are shuffled using different shuffling sequences during the first processing stage. In some respects, the different shuffling sequences during the first processing stage are based, at least in part, on a number of system frames.
[00143] In some respects, each repetition of the bit repetition subset of the first block is shuffled using a respective shuffling sequence from a plurality of shuffling sequences during the second processing stage, each repetition of the bit repetition subset of the second block is shuffled using a respective shuffling sequence from a plurality of shuffled sequences during the second processing stage, and the particular repetition of the bit repetition subset of the first block and the corresponding particular repetition of the bit repetition subset of the second block are shuffled using the same shuffling sequence from a plurality of shuffling sequences during the second processing stage. In some respects, the plurality of shuffling sequences provides interference randomization between Petition 870190069224, dated 07 / 22 / 2019, page 80 / 150 74 / 113 cells. In some respects, each shuffling sequence, among the plurality of shuffling sequences, comprises a group of bits having a common value.
[00144] In some respects, the bit repetition subsets are symbol-modulated and the symbols are phase-rotated during the second processing stage. In some respects, the first bits of the particular repetition of the bit repetition subset of the first block are phase-rotated using a first-phase rotation, the second bits of the particular repetition of the bit repetition subset of the first block are phase-rotated using a second-phase rotation, and the second-phase rotation is different from the first-phase rotation. In this case, the first bits and the second bits can be scrambled using a scrambling sequence so that the first-phase rotation and the second-phase rotation are effectively caused, respectively, by the scrambling.In some respects, the bit repetition subsets are shifted based, at least in part, on a shift sequence during the second processing stage.
[00145] In some respects, the physical broadcast channel includes a plurality of blocks, each block, among the plurality of blocks, includes subsets of symbol repetition, each repetition of the subsets of symbol repetition, for each block, is processed using a processing stage such that a particular repetition of the subsets of symbol repetition of a first block and a corresponding particular repetition of the subsets Petition 870190069224, dated 07 / 22 / 2019, page 81 / 150 75 / 113 of the repeating symbols in a second block are processed using a common processing scheme, and the processing stage is initialized based, at least in part, on the cell, the identifier, and a repeating index.
[00146] In some respects, a binary sequence is generated for each repetition index during the processing stage, the shuffling sequences or the rotation sequences are generated based, at least in part, on the binary sequences during the processing stage, and the repetitions of the symbol repetition subsets are shuffled based, at least in part, on the shuffling sequences or rotated based, at least in part, on the rotation sequences during the processing stage. In some respects, the binary sequence is obtained based, at least in part, on a pseudorandom binary generator, and the pseudorandom binary generator is initialized based, at least in part, on the cell identifier and the repetition index. In some respects, the pseudorandom binary generator is initialized based, at least in part, on a binary vector associated with a non-linear combination of the cell identifier and the repetition index.In some respects, the repetition rate is based, at least in part, on a number of radio frames.
[00147] Although FIG. 8 shows examples of blocks of a wireless communication method, in some aspects, the method may include additional blocks, fewer blocks, different blocks, or blocks arranged differently from those shown in FIG. 8. Additionally, or alternatively, two or more blocks shown in FIG. 8 may be implemented. Petition 870190069224, dated 07 / 22 / 2019, page 82 / 150 76 / 113 in parallel.
[00148] FIG. 9 is a flowchart of a 900 wireless communication method. The 900 method can be implemented by a BS (for example, which may correspond to one or more BS 110s, such as BSs 110-1 and / or 110-2, the 1202 / 1202' device, base station 1850, and / or the like).
[00149] In 910, the BS transmits a cell identifier for a cell (block 910). For example, the BS may transmit the cell identifier for a UE before transmitting the physical broadcast channel, such as an NBPBCH. In some respects, the BS may transmit a PSS or an SSS, as described in more detail in this document, which may indicate a cell identifier, such as a cell identity (cell ID or CID), that identifies a cell. Additionally, or alternatively, the BS may transmit the cell identifier simultaneously with the transmission of the physical broadcast channel.
[00150] In 920, BS transmits a physical broadcast channel (block 920). For example, BS may transmit the physical broadcast channel, which may include a plurality of symbol sets, to UE. In some respects, each symbol set, among the plurality of symbol sets, is scrambled with a respective scrambling sequence from among a plurality of scrambling sequences. In some respects, each symbol set, among the plurality of symbol sets, is associated with at least one phase rotation. In some respects, the at least one phase rotation is based, at least in part, on the cell identifier for the cell. Petition 870190069224, dated 07 / 22 / 2019, p. 83 / 150 77 / 113
[00151] In some respects, each symbol, from a set of symbols among a plurality of sets of symbols, is associated with the same scrambling sequence among a plurality of scrambling sequences. In some respects, the plurality of sets of symbols are modulated IQ symbols. In some respects, the plurality of sets of symbols are quadrature phase-shift keying (QPSK) symbols. In some respects, each cell, from a set of cells that includes the cell, is associated with a different set of phase rotations.
[00152] In some respects, at least one phase rotation is a plurality of phase rotations. For example, the plurality of phase rotations may be a sequence of phase rotations, or be the result of a formula for determining a plurality of phase rotations based, at least in part, on a symbol, set, or subframe indices. In some respects, at least one phase rotation is a phase rotation. In some respects, at least one phase rotation is determined based, at least in part, on a shuffling sequence among a plurality of shuffling sequences. In some respects, at least one phase rotation is determined based, at least in part, on a set of orthogonal or near-orthogonal sequences.
[00153] Although FIG. 9 shows examples of blocks of a wireless communication method, in some aspects, the method may include additional blocks, fewer blocks, different blocks, or blocks arranged differently from those shown in FIG. 9. Additionally, or alternatively, Petition 870190069224, dated 07 / 22 / 2019, p. 84 / 150 78 / 113 Two or more blocks shown in FIG. 9 can be implemented in parallel.
[00154] FIG. 10 is a flowchart of a wireless communication method 1000. The method 1000 can be implemented by a BS (for example, which may correspond to one or more BS 110s, such as BSs 110-1 and / or 110-2, the 1202 / 1202' device, the 1850 base station, and / or the like).
[00155] In 1010, in some respects, BS shuffles blocks of a channel (block 1010). For example, BS can determine shuffling sequences for each block of a narrowband physical broadcast channel, and can shuffle each block of the narrowband physical broadcast channel to reduce channel interference for the narrowband physical broadcast channel. In some respects, each block, among a plurality of blocks, is shuffled using a shuffling sequence, among a plurality of shuffling sequences, initialized based, at least in part, on a block index of the block and a cell identifier for a cell.
[00156] In 1020, in some respects, the BS rotates sets of channel symbols (1020 block). For example, the BS may determine rotation sequences for each repetition of a set of symbols in a block of the narrowband physical broadcast channel, and may gradually rotate each block of the narrowband physical broadcast channel to reduce channel interference in the narrowband physical broadcast channel. In some respects, each block, among a plurality of channel blocks, includes repetitions of sets of symbols. In some respects, each repetition, among the repetitions of sets of symbols Petition 870190069224, dated 07 / 22 / 2019, page 85 / 150 79 / 113 symbols, for each block, is rotated using a different rotation sequence from a plurality of rotation sequences, initialized based, at least in part, on a repetition index of the repetition. In some respects, a repetition may be initiated based, at least in part, on some combination of at least the repetition index and a cell identifier, such as a non-linear combination, a linear combination, and / or the like.
[00157] At 1030, BS broadcasts the channel (block 1030). For example, BS can transmit a narrowband physical broadcast channel based, at least in part, on coding blocks of the narrowband physical broadcast channel and phase rotation repetitions of symbol sets of the narrowband physical broadcast channel, thus allowing UE to retrieve data from the physical broadcast channel.
[00158] In some respects, a plurality of phase rotations is applied to repetitions of symbol sets based, at least in part, on the equation: ryQ?+1)=0
[00159] In some respects, the plurality of shuffling sequences is initialized based, at least in part, on the equation: cinit =(^CeU+l)(vmod8 + 1)3-29+ 2vNce11
[00160] In some respects, the channel is a physical broadcast channel. In some respects, the repetition rate Petition 870190069224, dated 07 / 22 / 2019, page 86 / 150 80 / 113 is based, at least in part, on a number of radio frames. In some respects, a binary sequence, among a plurality of binary sequences, is generated for each repetition index associated with the repetitions of sets of symbols, and the plurality of rotation sequences is generated based, at least in part, on the plurality of binary sequences.
[00161] In some respects, the plurality of binary sequences is obtained based, at least in part, on a pseudorandom binary generator, and the pseudorandom binary generator is initialized, for each binary sequence, from among the plurality of binary sequences based, at least in part, on a corresponding cell identifier and a corresponding repetition index. In some respects, the plurality of binary sequences is obtained based, at least in part, on a pseudorandom binary generator, and the pseudorandom binary generator is initialized, for each binary sequence, from among the plurality of binary sequences based, at least in part, on a binary vector associated with a non-linear combination of a corresponding cell identifier and a corresponding repetition index.
[00162] Although FIG. 10 shows examples of blocks of a wireless communication method, in some aspects, the method may include additional blocks, fewer blocks, different blocks, or blocks arranged differently from those shown in FIG. 10. Additionally, or alternatively, two or more blocks shown in FIG. 10 may be implemented in parallel.
[00163] FIG. 11 is a flowchart of a method Petition 870190069224, dated 07 / 22 / 2019, p. 87 / 150 81 / 113 1100 wireless communication. The 1100 method can be performed by a BS (for example, which may correspond to one or more BS 110s, such as BSs 110-1 and / or 110-2, the 1202 / 1202' handset, the 1850 base station, and / or similar devices).
[00164] In 1110, in some respects, the BS determines a scrambling sequence (block 1110). For example, the BS can determine the scrambling sequence for repetitions of a bit set of a channel, such as based, at least in part, on an output of the scrambling sequence generator.
[00165] In 1120, in some respects, the BS shuffles a repetition of a bit set of a channel using the shuffling sequence (block 1120). For example, the BS can shuffle each repetition of a plurality of repetitions of a bit set of a channel, using a different shuffling sequence from among a plurality of different shuffling sequences.
[00166] In 1130, the BS transmits the channel (block 1130). For example, the BS may transmit a channel to a UE to transmit information to the UE. In some respects, each shuffling sequence, among the plurality of different shuffling sequences, includes a plurality of bit tuples, and each repetition is shuffled based, at least in part, on a bit tuple, among the plurality of bit tuples, associated with a corresponding shuffling sequence, among the plurality of different shuffling sequences. In some respects, the channel transmits a type of System Information Block 1 (SIB1).
[00167] In some respects, each sequence Petition 870190069224, dated 07 / 22 / 2019, page 88 / 150 82 / 113 binary, from a plurality of binary sequences, is obtained based, at least in part, on a pseudorandom binary generator; the pseudorandom binary generator is initialized based, at least in part, on the cell identifier and the repetition index; and the plurality of shuffling sequences is obtained based, at least in part, on a corresponding binary sequence from the plurality of binary sequences. In some respects, the pseudorandom binary generator is initialized based, at least in part, on a binary vector associated with a non-linear combination of the cell identifier and the repetition index.
[00168] In some respects, the repetition index is based, at least in part, on multiple radio frames. In some respects, the plurality of scrambling sequences is determined based, at least in part, on a Gold code. In some respects, the channel is a shared physical channel.
[00169] In some respects, the plurality of different shuffling sequences is based, at least in part, on an equation: cinit =nRNTI ' 215+ (NiDel +1)((nfmod61)+ D.
[00170] In some respects, the plurality of different shuffling sequences is based, at least in part, on an equation: cinit = nRNTI ·214+nfmod2·213+ Lns / 2J·29 +Nme11.
[00171] Although FIG. 11 shows examples of blocks of a wireless communication method, in some aspects, the method may include additional, less complex blocks. Petition 870190069224, dated 07 / 22 / 2019, page 89 / 150 83 / 113 blocks, different blocks, or blocks arranged differently from those shown in FIG. 11. Additionally, or alternatively, two or more blocks shown in FIG. 11 may be constructed in parallel.
[00172] FIG. 12 is a conceptual data flow diagram 1200 illustrating the data flow between different modules / media / components in an example device 1202. The device 1202 may be a BS. In some respects, the device 1202 includes a receiving module 1204, a determining module 1206 and / or a transmitting module 1208.
[00173] The receiving module 1204 can receive, from a user device 1250 and as data 1210, one or more signaling messages. For example, the receiving module 1204 can receive information associated with the synchronization of the user device 1250 with the device 1202 to allow the device 1202 to transmit a physical broadcast channel (e.g., an NB-PBCH). In some respects, the receiving module 1204 can receive control information associated with determining a set of scrambling sequences to apply to the bits of the physical broadcast channel, an offset to apply to a mapping of modulation symbols to subframe feature elements of the physical broadcast channel, and / or similar, such as from a network controller, as described in this document.In some respects, the 1204 receiving module can receive control information associated with determining a set of phase rotations to apply to a set of symbols, such as from a network controller, as described in this document. Petition 870190069224, dated 07 / 22 / 2019, pp. 90 / 150 84 / 113
[00174] In some respects, the determination module 1206 may receive, from the receiving module 1204 and as data 1212, information associated with the determination of a set of scrambling sequences to apply to the bits of a physical broadcast channel, a shift sequence to map modulation symbols (e.g., QPSK symbols) to access subframe elements of the physical broadcast channel and / or the like. For example, the determination module 1206 may receive information identifying a scrambling sequence to be used by device 1202 to scramble blocks of the physical broadcast channel, a scrambling sequence to be used by device 1202 to scrambling repetitions of bit repetition subsets of each block of the physical broadcast channel, a cell identity associated with device 1202 to initialize the scrambling sequences and / or the like.In some respects, the 1206 determination module can determine the application of bit tuples (e.g., quadruples) by shuffling repetitions of bit repetition subsets. For example, during a second processing stage, the 1206 determination module can use a shuffling sequence that includes quadruples of the same bit to shuffle consecutive bits of repetitions of bit repetition subsets. This can have an effect equivalent to performing a symbol phase rotation of the physical broadcast channel, thus allowing the 1250 user equipment to perform symbol-level matching to recover the physical broadcast channel. In some respects, the 1206 determination module can determine the application of another. Petition 870190069224, dated 07 / 22 / 2019, page 91 / 150 85 / 113 differentiator for the physical broadcast channel, such as using a shift sequence to shift a QPSK symbol mapping to physical broadcast channel subframe feature elements to compensate for inter-cell interference.
[00175] In some respects, the determination module 1206 can receive, from the receiving module 1204 and as data 1212, information associated with the determination of a set of phase rotations to apply to a set of symbols. For example, the determination module 1206 can receive information identifying a scrambling sequence to be used by the device 1202, a cell identity associated with the device 1202, a repetition index associated with a repetition of a set of bits and / or similar, and can determine a set of phase rotations that should be applied to feature elements of an OFDM symbol. In some respects, the determination module 1206 can determine the application of a different phase rotation for each feature element of an OFDM symbol. For example, the determination module 1206 can determine the application of a plurality of phase rotations to an OFDM symbol.In some respects, the determination module 1206 can determine the application of a different phase rotation for each OFDM symbol. For example, the determination module 1206 can apply the same phase rotation to each feature element of an OFDM symbol and can apply a plurality of phase rotations to a corresponding plurality of OFDM symbols of a subframe. In some respects, the determination module 1206 can determine the application of a different phase rotation for... Petition 870190069224, dated 07 / 22 / 2019, page 92 / 150 86 / 113 each subframe. For example, the determination module 1206 can apply the same phase rotation to each feature element of each OFDM symbol in a subframe, and can apply a plurality of phase rotations to a corresponding plurality of subframes in a physical broadcast channel (e.g., an NB-PBCH).
[00176] In some respects, the transmission module 1208 may receive, from the determination module 1206 and as data 1214, information associated with the transmission of a physical broadcast channel (e.g., an NB-PBCH), a physical shared channel (e.g., a narrowband physical downlink shared channel (NB-PDSCH or NPDSCH)), and / or similar to the user equipment 1250. In some respects, the transmission module 1208 may receive information associated with the transmission of a cell identifier identifying a cell identity. The transmission module 1208 may transmit, to the user equipment 1250 and as data 1216, a cell identifier and a physical broadcast channel. For example, the transmission module 1208 may transmit, as data 1216 and to the user equipment 1250, a plurality of blocks of the physical broadcast channel.In some respects, during an initial processing phase, the 1208 transmission module can shuffle each block, from among a plurality of blocks, with a respective shuffling sequence from among a plurality of shuffling sequences. In some respects, during a second processing stage, the 1208 transmission module can shuffle each repetition of bit repetition subsets from each block using a shuffling sequence. Petition 870190069224, dated 07 / 22 / 2019, page 93 / 150 87 / 113 of a set of scrambling sequences, such that a particular repetition of a bit repetition subset of a block, the first block, and a corresponding particular repetition of a bit repetition subset of a second block are scrambled using the same scrambling sequence. In some respects, the 1208 transmission module can scramble physical broadcast channel bits based, at least in part, on a cell identifier of a 1202 device cell and can transmit the physical broadcast channel based, at least in part, on the scrambling of the physical broadcast channel bits.
[00177] In some respects, the transmission module 1208 can receive, from the determination module 1206 and as data 1214, information associated with the transmission of a physical broadcast channel (e.g., an NB-PBCH) to the user equipment 1250. In some respects, the transmission module 1208 can receive information associated with the application of a set of phase rotations to a set of symbols. In some respects, the transmission module 1208 can receive information associated with the transmission of a cell identifier identifying a cell identity. The transmission module 1208 can transmit, to the user equipment 1250 and as data 1216, a cell identifier and a physical broadcast channel. For example, the transmission module 1208 can transmit, as data 1216 and to the user equipment 1250, a plurality of sets of symbols from the physical broadcast channel.In some respects, the 1208 transmission module can scramble each set of symbols, among the plurality of sets of symbols, with... Petition 870190069224, dated 07 / 22 / 2019, page 94 / 150 88 / 113 a respective scrambling sequence among a plurality of scrambling sequences. In some respects, each set of symbols can be associated with at least one phase rotation. For example, transmission module 1208 can phase-rotate a symbol based, at least in part, on a cell identifier of a cell from device 1202 and can transmit the symbol based, at least in part, on the phase rotation of the symbol.
[00178] The device may include additional modules that perform each of the algorithm blocks in the flowcharts mentioned above in FIG. 8, FIG. 9, FIG. 10 and / or FIG. 11. As such, each block in the flowcharts mentioned above in FIG. 8, FIG. 9, FIG. 10 and / or FIG. 11 may be performed by a module, and the device may include one or more such modules. The modules may be one or more hardware components specifically configured to perform the established processes / algorithms, implemented by a processor configured to perform the established processes / algorithms, stored on a computer-readable medium for implementation by a processor, or some combination thereof.
[00179] The number and arrangement of modules shown in FIG. 12 are provided as an example. In practice, there may be additional modules, fewer modules, different modules, or modules arranged differently from those shown in FIG. 12. Furthermore, two or more modules shown in FIG. 12 may be implemented within a single module, or a single module shown in FIG. 12 may be implemented as multiple distributed modules. Additionally, or alternatively, a set of modules Petition 870190069224, dated 07 / 22 / 2019, page 95 / 150 89 / 113 (for example, one or more modules) shown in FIG. 12 can perform one or more functions described as being performed by another set of modules shown in FIG. 12.
[00180] FIG. 13 is a diagram 1300 illustrating an example of a hardware implementation for a device 1202' employing a processing system 1302. The device 1202' may be a BS. The processing system 1302 may be implemented with a bus architecture, generally represented by the bus 1304. The bus 1304 may include any number of interconnecting buses and bridges, depending on the specific application of the processing system 1302 and the general design constraints. The 1304 bus interconnects various circuits, including one or more processors and / or hardware modules, represented by the 1306 processor, the 1204, 1206, and 1208 modules, and the 1308 computer-readable / memory medium. The 1304 bus can also interconnect various other circuits, such as timing sources, peripherals, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further.
[00181] The processing system 1302 can be coupled to a transceiver 1310. The transceiver 1310 is coupled to one or more antennas 1312. The transceiver 1310 provides a means of communication with various other devices through a transmission medium. The transceiver 1310 receives a signal from one or more antennas 1312, extracts information from the received signal, and provides the extracted information to the processing system 1302, specifically the receiving module 1204. In addition, the transceiver 1310 receives information from the processing system 1302, specifically the Petition 870190069224, dated 07 / 22 / 2019, page 96 / 150 The 90 / 113 transmission module 1208, and based, at least in part, on the received information, generates a signal to be applied to one or more antennas 1312. The processing system 1302 includes a processor 1306 coupled to a computer-readable medium / memory 1308. The processor 1306 is responsible for general processing, including the execution of software stored in the computer-readable medium / memory 1308. The software, when executed by the processor 1306, causes the processing system 1302 to perform the various functions described above for any particular device. The computer-readable medium / memory 1308 may also be used to store data that is manipulated by the processor 1306 when executing the software. The processing system additionally includes at least one of the modules 1204, 1206, and 1208.The modules may be software modules running on processor 1306, resident / stored in computer-readable medium / memory 1308, one or more hardware modules coupled to processor 1306, or some combination thereof. The processing system 1302 may be a component of BS 110 and may include memory 242 and / or at least one of the transmit processor 220, the receive processor 238 and / or the controller / processor 240.
[00182] In some respects, the device The 1202 / 1202' wireless communication device includes means for transmitting a cell identifier to a cell. In some respects, the 1202 / 1202' wireless communication device includes means for transmitting a physical broadcast channel. The physical broadcast channel may include a plurality of blocks. Each block, among the plurality of blocks, may Petition 870190069224, dated 07 / 22 / 2019, page 97 / 150 91 / 113 include bit repetition subsets. Each block, among the plurality of blocks, can be processed using a first processing stage. Each repetition of the bit repetition subsets, for each block, can be processed using a second processing stage such that a particular repetition of the bit repetition subset of a first block and a corresponding particular repetition of the bit repetition subset of a second block are processed using a common processing scheme. The first processing stage and the second processing stage can be initialized based, at least in part, on the cell identifier.
[00183] In some aspects, the 1202 / 1202' wireless communication apparatus includes means for transmitting a cell identifier to a cell. In some aspects, the 1202 / 1202' wireless communication apparatus includes means for transmitting a physical broadcast channel. The physical broadcast channel may include a plurality of symbol sets. Each symbol set, among the plurality of symbol sets, may be scrambled with a respective scrambling sequence among a plurality of scrambling sequences. Each symbol set, among the plurality of symbol sets, may be associated with at least one phase rotation. The at least one phase rotation may be based at least in part on the cell identifier for the cell.
[00184] In some respects, the 1202 / 1202' wireless communication device includes means for transmitting a channel, wherein each block, among a plurality of channel blocks, includes repetitions of Petition 870190069224, dated 07 / 22 / 2019, page 98 / 150 92 / 113 sets of symbols, wherein each block, among a plurality of blocks, is shuffled using a shuffling sequence, among a plurality of shuffling sequences, initialized based, at least in part, on a block index of the block and a cell identifier for a cell, and wherein each repetition among the repetitions of sets of symbols for each block is rotated using a different rotation sequence, among a plurality of rotation sequences, initialized based, at least in part, on a repetition index of the repetition.
[00185] In some respects, the 1202 / 1202' wireless communication apparatus includes means for transmitting a channel, wherein the channel includes a plurality of repetitions of a bit set in a plurality of subframes, and wherein each repetition, among the plurality of repetitions, is scrambled using a different scrambling sequence, among a plurality of different scrambling sequences, initialized based, at least in part, on a non-linear combination of a cell identifier for a cell and a repetition index.
[00186] The aforementioned means may be one or more of the aforementioned modules of device 1202 and / or the processing system 1302 of device 1202' configured to perform the functions mentioned by the aforementioned means. As described above, the processing system 1302 may include the transmission processor 220, the reception processor 238 and / or the controller / processor 240. As such, in one configuration, Petition 870190069224, dated 07 / 22 / 2019, page 99 / 150 93 / 113 The aforementioned means may be the transmission processor 220, the reception processor 238 and / or the controller / processor 240 configured to perform the functions mentioned by the aforementioned means.
[00187] FIG. 13 is provided as an example. Other examples are possible and may differ from what has been described in relation to FIG. 13.
[00188] FIG. 14 is a flowchart of a 1400 wireless communication method. The 1400 method can be implemented by a UE (for example, which may correspond to one or more of the UE 120s, such as the UE 120-1 and / or 120-2, the UE 1250, the 1802 / 1802' device and / or similar). In 1410, the UE receives a cell identifier for a cell (1410 block). For example, the UE may receive the cell identifier from a BS before receiving a physical broadcast channel, such as an NB-PBCH. In some respects, the UE may receive a PSS or an SSS, as described in more detail in this document, which may include a cell identifier identifying, for example, a cell identity (cell ID or CID). Additionally, or alternatively, the UE may receive the cell identifier simultaneously with the reception of the physical broadcast channel.
[00189] In 1420, the UE receives a physical broadcast channel (block 1420). For example, the UE may receive the physical broadcast channel, which may include a plurality of blocks, from the BS. In some respects, each block, among the plurality of blocks, includes repeating bit subsets. In some respects, each block, among the plurality of blocks, is processed using a first processing stage. In some respects, each repetition Petition 870190069224, dated 07 / 22 / 2019, pages 100 / 150 94 / 113 of the bit repetition subsets, for each block, is processed using a second processing stage such that a particular repetition of the bit repetition subset of a first block and a corresponding particular repetition of the bit repetition subset of a second block are processed using a common processing scheme. In some respects, the first processing stage and the second processing stage are initialized based, at least in part, on the cell identifier.
[00190] In some respects, the physical broadcast channel bits are recovered based, at least in part, on log-likelihood ratios (LLRs) for each block. In some respects, the second processing stage is reversed based, at least in part, on information identifying the block boundaries associated with block plurality. In some respects, the first processing stage is reversed based, at least in part, on a specific shuffling sequence for block plurality.
[00191] In some respects, the first block and the second block are shuffled using different shuffling sequences during the first processing stage. In some respects, the different shuffling sequences during the first processing stage are based, at least in part, on a number of system frames.
[00192] In some respects, each repetition of the bit repetition subset of the first block is shuffled using a respective sequence of Petition 870190069224, dated 07 / 22 / 2019, pp. 101 / 150 95 / 113 shuffling among a plurality of shuffling sequences during the second processing stage, each repetition of the bit repetition subset of the second block is shuffled using a respective shuffling sequence among the plurality of shuffling sequences during the second processing stage, and the particular repetition of the bit repetition subset of the first block and the corresponding particular repetition of the bit repetition subset of the second block are shuffled using the same shuffling sequence, among the plurality of shuffling sequences, during the second processing stage. In some respects, the plurality of shuffling sequences provides interference randomization between cells.
[00193] In some respects, each scrambling sequence, among the plurality of scrambling sequences, comprises a group of bits having a common value. In some respects, the bit repetition subsets are modulated into symbols and the symbols are phase-rotated during the second processing stage.
[00194] In some respects, the first bits of the particular repetition of the bit repetition subset are phase-rotated using a first phase rotation, the second bits of the particular repetition of the bit repetition subset are phase-rotated using a second phase rotation, and the rotation of the second phase is different from the rotation of the first phase. In this case, the first bits and the second bits can be shuffled using a shuffling sequence of Petition 870190069224, dated 07 / 22 / 2019, pp. 102 / 150 96 / 113 so that the rotation of the first phase and the rotation of the second phase are effectively caused, respectively, by scrambling. In some respects, the bit repetition subsets are shifted based, at least in part, on a shift sequence during the second processing stage.
[00195] In 1430, in some respects, the UE reverses a set of processing stages applied to bits of the physical broadcast channel (block 1430). For example, the UE may reverse a first processing stage, such as a first set of scrambling sequences, applied to blocks of bits of the physical broadcast channel. Additionally, or alternatively, the UE may reverse a second processing stage, such as a second set of scrambling sequences, applied to repetitions of repetition subsets of bits of the physical broadcast channel. In some respects, the UE may reverse the rotation of a phase rotation applied to bits of the physical broadcast channel, such as a phase rotation applied based, at least in part, on the use of quadruples of bits for a scrambling sequence. In some respects, the UE may compensate for an offset applied to a mapping of feature elements of the physical broadcast channel.In some respects, the UE can reverse the set of processing steps applied to each bit after receiving the physical broadcast channel. In some respects, the UE can reverse one or more processing stages applied to the first bits of the physical broadcast channel after receiving the first bits, and can subsequently receive second bits and reverse one or more processing stages applied to the second bits. Petition 870190069224, dated 07 / 22 / 2019, pp. 103 / 150 97 / 113 physical broadcast channel.
[00196] In some respects, the physical broadcast channel includes a plurality of blocks, each block, among the plurality of blocks, includes subsets of repeating symbols, each repetition of the subsets of repeating symbols, for each block, is processed using a processing stage such that a particular repetition of the subsets of repeating symbols of a first block and a corresponding particular repetition of the subsets of repeating symbols of a second block are processed using a common processing scheme, and the processing stage is initialized based, at least in part, on the cell identifier and a repetition index.
[00197] In some respects, a binary sequence is generated for each repetition index during the processing stage, shuffling sequences or rotation sequences are generated based, at least in part, on the binary sequences during the processing stage, and repetitions of symbol repetition subsets are shuffled based, at least in part, on the shuffling sequences or rotated based, at least in part, on the rotation sequences during the processing stage. In some respects, the binary sequence is obtained based, at least in part, on a pseudorandom binary generator, and the pseudorandom binary generator is initialized based, at least in part, on the cell identifier and the repetition index. In some respects, the pseudorandom binary generator is initialized based, at least in part, on a binary vector associated with a non-linear combination of the cell identifier and the index. Petition 870190069224, dated 07 / 22 / 2019, pp. 104 / 150 98 / 113 repetition. In some respects, the repetition rate is based, at least in part, on a number of radio frames.
[00198] Although FIG. 14 shows examples of blocks of a wireless communication method, in some aspects, the method may include additional blocks, fewer blocks, different blocks, or blocks arranged differently from those shown in FIG. 14. Additionally, or alternatively, two or more blocks shown in FIG. 14 may be implemented in parallel.
[00199] FIG. 15 is a flowchart of a 1500 wireless communication method. The 1500 method can be implemented by a UE (for example, which may correspond to one or more of the UE 120s, such as UEs 120-1 and / or 120-2, the UE 1250, the 1802 / 1802' device, and / or similar devices).
[00200] In 1510, the UE receives a cell identifier for a cell (block 1510). For example, the UE may receive the cell identifier from a BS before receiving a physical broadcast channel, such as an NB-PBCH. In some respects, the UE may receive a PSS or an SSS, as described in more detail in this document, which may include a cell identifier identifying, for example, a cell identity (cell ID or CID). Additionally, or alternatively, the UE may receive the cell identifier simultaneously with the receipt of the physical broadcast channel.
[00201] In 1520, the UE receives a physical broadcast channel (block 1520). For example, the UE may receive the physical broadcast channel, which may include a plurality of symbol sets, from the BS. In some respects, Petition 870190069224, dated 07 / 22 / 2019, pp. 105 / 150 99 / 113 each set of symbols, among the plurality of sets of symbols, is shuffled with a respective shuffling sequence among a plurality of shuffling sequences. In some respects, each set of symbols, among the plurality of sets of symbols, is associated with at least one phase rotation. In some respects, the at least one phase rotation is based, at least in part, on the cell identifier for the cell.
[00202] In some respects, a symbol, among the plurality of symbol sets, is reversed based, at least in part, on the cell identifier for the cell. In some respects, each symbol, from a set of symbols among the plurality of symbol sets, is associated with the same shuffling sequence among the plurality of shuffling sequences. In some respects, the plurality of symbol sets are modulated QI symbols. In some respects, the plurality of symbol sets are phase-quadrature keying (QPSK) symbols.
[00203] In some respects, each cell, in a set of cells that includes the cell, is associated with a different set of phase rotations. In some respects, the rotation of at least one phase is a plurality of phase rotations. In some respects, the rotation of at least one phase is a phase rotation. In some respects, the at least one phase rotation is determined based, at least in part, on a shuffling sequence among a plurality of shuffling sequences. In some respects, the at least one phase rotation is determined with Petition 870190069224, dated 07 / 22 / 2019, pp. 106 / 150 100 / 113 based, at least in part, on a set of orthogonal or nearly orthogonal sequences.
[00204] Although FIG. 15 shows examples of blocks of a wireless communication method, in some aspects, the method may include additional blocks, fewer blocks, different blocks, or blocks arranged differently from those shown in FIG. 15. Additionally, or alternatively, two or more blocks shown in FIG. 15 may be implemented in parallel.
[00205] FIG. 16 is a flowchart of a 1600 wireless communication method. The 1600 method can be implemented by a UE (for example, which may correspond to one or more of the UE 120, such as UEs 120-1 and / or 120-2, the UE 1250, the 1802 / 1802' device, and / or the like).
[00206] In 1610, the UE receives a channel (block 1610). For example, the UE may receive a narrowband physical broadcast channel from a base station associated with a cell. In some respects, the UE may receive a plurality of blocks of the narrowband physical broadcast channel, and each block may include repetitions of bit sets.
[00207] In some respects, a plurality of phase rotations is applied to repetitions of symbol sets based, at least in part, on the equation: -j=se ry(2?)=le
[00208] In some respects, the plurality of shuffling sequences is initialized based on at least Petition 870190069224, dated 07 / 22 / 2019, pp. 107 / 150 101 / 113 minus in part, in the equation: cinit = (NSe11+1)(nfmod 8+1)3 ' 29 +NΝ^ .
[00209] In some respects, the channel is a physical broadcast channel. In some respects, the repetition index is based, at least in part, on a number of radio frames. In some respects, a binary sequence, from a plurality of binary sequences, is generated for each repetition index associated with the repetitions of sets of symbols, and wherein the plurality of rotation sequences is generated based, at least in part, on the plurality of binary sequences. In some respects, the plurality of binary sequences is obtained based, at least in part, on a pseudorandom binary generator, and the pseudorandom binary generator is initialized, for each binary sequence, from among the plurality of binary sequences, based at least in part on a corresponding cell identifier and a corresponding repetition index.
[00210] In 1620, in some respects, the UE unscrambles and / or reverses the rotation of the channel (block 1620). For example, the UE may unscramble and / or reverse the rotation of channel bits based, at least in part, on a plurality of shuffling sequences and / or a plurality of rotation sequences. In some respects, each block, among a plurality of channel blocks, includes repetitions of symbol sets. In some respects, each block, among the plurality of blocks, is shuffled using a shuffling sequence, among a plurality of shuffling sequences, initialized based, at least in part, on a block index of the block. Petition 870190069224, dated 07 / 22 / 2019, pp. 108 / 150 102 / 113 and the cell identifier for the cell. In some respects, each repetition, among the repetitions of sets of symbols, for each block is rotated using a different rotation sequence, among a plurality of rotation sequences, initialized based, at least in part, on a repetition index of the repetition.
[00211] In 1630, in some respects, the UE recovers channel bits based, at least in part, on unscrambling and / or channel rotation reversal (block 1630). For example, the UE can recover channel data based, at least in part, on unscrambling and / or channel rotation reversal to recover a communication from the base station.
[00212] Although FIG. 16 shows examples of blocks of a wireless communication method, in some aspects, the method may include additional blocks, fewer blocks, different blocks, or blocks arranged differently from those shown in FIG. 16. Additionally, or alternatively, two or more blocks shown in FIG. 16 may be implemented in parallel.
[00213] FIG. 17 is a flowchart of a 1700 method of wireless communication. The 1700 method can be implemented by a UE (for example, which may correspond to one or more UE 120s, such as UEs 120-1 and / or 120-2, UE 1250, the 1802 / 1802' device and / or similar devices).
[00214] In 1710, the UE receives a channel (block 1710). For example, the UE may receive a channel that includes a plurality of repetitions of a bit set in a plurality of subframes. In some respects, each repetition, among the plurality of repetitions, is shuffled. Petition 870190069224, dated 07 / 22 / 2019, pp. 109 / 150 103 / 113 using a different shuffling sequence, from among a plurality of different shuffling sequences, initialized based, at least in part, on a non-linear combination of the cell identifier and a repeat index.
[00215] In 1720, in some respects, the UE unscrambles the channel (block 1720). For example, the UE may determine a scrambling sequence applied to a set of bits in the channel and may reverse the scrambling sequence to unscramble the channel. In some respects, each scrambling sequence, among the plurality of different scrambling sequences, includes a plurality of bit tuples, and each repetition is scrambling based, at least in part, on a bit tuple, among the plurality of bit tuples, associated with a corresponding scrambling sequence, among the plurality of different scrambling sequences. In some respects, the channel transmits a SIB1.
[00216] In some respects, each binary sequence, among a plurality of binary sequences, is obtained based, at least in part, on a binary generator; the binary generator is initialized based, at least in part, on the cell identifier and the repetition index; and the plurality of shuffling sequences is obtained based, at least in part, on a corresponding binary sequence among the plurality of binary sequences. In some respects, the binary generator is initialized based, at least in part, on a binary vector associated with a non-linear combination of the cell identifier and the repetition index. In some respects, the index of Petition 870190069224, dated 07 / 22 / 2019, pages 110 / 150 104 / 113 repetition is based, at least in part, on a number of radio frames.
[00217] In 1730, in some respects, the UE recovers channel bits based, at least in part, on channel unscrambling (block 1730). For example, the UE can recover channel bits based, at least in part, on channel unscrambling to determine the information transmitted via a base station to the UE.
[00218] Although FIG. 17 shows examples of blocks of a wireless communication method, in some aspects, the method may include additional blocks, fewer blocks, different blocks, or blocks arranged differently from those shown in FIG. 17. Additionally, or alternatively, two or more blocks shown in FIG. 17 may be implemented in parallel.
[00219] FIG. 18 is a conceptual data flow diagram 1800 illustrating the data flow between different modules / media / components in an example of an 1802 device. The 1802 device may be a UE. In some respects, the 1802 device includes a receiving module 1804, a determining module 1806 and / or a transmitting module 1808.
[00220] The 1804 receiver module can receive, from a base station 1850 and as 1810 data, information associated with a physical broadcast channel (e.g., an NB-PBCH), a physical shared channel (e.g., an NB-PDSCH) and / or similar. For example, the 1804 receiver module can receive a cell identifier identifying a cell identity, such as information included in a PSS or SSS transmission. Additionally, or Petition 870190069224, dated 07 / 22 / 2019, pp. 111 / 150 Alternatively, the 1804 receiver module can receive a physical broadcast channel or a shared physical channel. In some respects, the 1804 receiver module can unscramble the scrambled bits of the physical broadcast channel, reverse the rotation of the phase rotation symbols of the physical broadcast channel, and / or similarly. In some respects, the 1804 receiver module can demodulate the bits of the physical broadcast channel. In some respects, the 1804 receiver module can perform an averaging procedure on a set of repetitions of a subset of bit repetitions in blocks of the physical broadcast channel to recover the information transmitted on the physical broadcast channel. In some respects, the 1804 receiver module can receive a physical broadcast channel including phase rotation symbols. In some respects, the 1804 receiver module can reverse the rotation of the phase rotation symbols to determine the information transmitted by the phase rotation symbols.
[00221] In some respects, the determination module 1806 can receive, from the receiving module 1804 and as data 1812, information associated with the physical broadcast channel (e.g., an NB-PBCH). For example, based at least in part on the reception of a cell identifier identifying a cell identity, information identifying a block boundary associated with blocks of the physical broadcast channel and / or similar, the determination module 1806 can determine a set of scrambling sequences that are applied to bits of the physical broadcast channel to allow the apparatus 1802 to unscramble the bits of the physical broadcast channel. In some respects, the determination module 1806 Petition 870190069224, dated 07 / 22 / 2019, page 112 / 150 106 / 113 can determine a set of LLRs for the bit set of the physical broadcast channel. For example, the 1806 determination module can determine a set of LLRs and can combine the LLRs across blocks of the physical broadcast channel (e.g., based at least in part on the second processing stage repeating a set of scrambling sequences for each block of the physical broadcast channel) to remove bit scrambling from the physical broadcast channel.
[00222] In some respects, the determination module 1806 can receive, from the receiving module 1804 and as data 1812, information associated with the physical broadcast channel (e.g., an NB-PBCH). For example, based at least in part on receiving a cell identifier identifying a cell identity, the determination module 1806 can determine a set of phase rotations that are applied to symbols of the physical broadcast channel to allow the apparatus 1802 to unrotate the phase-rotated symbols of the physical broadcast channel.
[00223] Transmission module 1808 can receive, from determination module 1806 and as data 1814, information associated with the physical broadcast channel (e.g., an NB-PBCH). For example, based at least in part on the descramble of bits from the physical broadcast channel to recover the information transmitted through the physical broadcast channel, determination module 1806 can determine information to transmit to base station 1850 and can provide the information to transmission module 1808 for transmission to base station 1850. Petition 870190069224, dated 07 / 22 / 2019, pp. 113 / 150 107 / 113 In some respects, the transmission module can transmit data 1816 to the base station 1850 to transmit the information from the determination module 1806.
[00224] The device may include additional modules that perform each of the algorithm blocks in the aforementioned flowcharts of FIG. 14, FIG. 15, FIG. 16 and / or FIG. 17. As such, each block in the aforementioned flowcharts of FIG. 14, FIG. 15, FIG. 16 and / or FIG. 17 may be performed by a module, and the device may include one or more such modules. The modules may be one or more hardware components specifically configured to execute the established processes / algorithms, implemented by a processor configured to perform the established processes / algorithms, stored on a computer-readable medium for implementation by a processor, or some combination thereof.
[00225] The number and arrangement of modules shown in FIG. 18 are provided as an example. In practice, there may be additional modules, fewer modules, different modules, or modules arranged differently from those shown in FIG. 18. Furthermore, two or more modules shown in FIG. 18 may be implemented within a single module, or a single module shown in FIG. 18 may be implemented as multiple distributed modules. Additionally, or alternatively, a set of modules (e.g., one or more modules) shown in FIG. 18 may perform one or more functions described as being performed by another set of modules shown in FIG. 18.
[00226] FIG. 19 is a 1900 diagram illustrating an example of a hardware implementation for a device. Petition 870190069224, dated 07 / 22 / 2019, pp. 114 / 150 108 / 113 1802' employing a 1902 processing system. The 1802' device may be a UE. The 1902 processing system may be implemented with a bus architecture, generally represented by the 1904 bus. The 1904 bus may include any number of interconnecting buses and bridges, depending on the specific application of the 1902 processing system and general design constraints. The 1904 bus interconnects various circuits, including one or more processors and / or hardware modules, represented by the 1906 processor, the 1804, 1806, 1808 modules, and the 1908 computer-readable / memory medium. The 1904 bus may also interconnect various other circuits, such as timing sources, peripherals, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further.
[00227] The processing system 1902 can be coupled to a transceiver 1910. The transceiver 1910 is coupled to one or more antennas 1912. The transceiver 1910 provides a means of communication with various other devices through a transmission medium. The transceiver 1910 receives a signal from one or more antennas 1912, extracts information from the received signal, and provides the extracted information to the processing system 1902, specifically the receiving module 1804. In addition, the transceiver 1910 receives information from the processing system 1902, specifically the transmitting module 1808, and based, at least in part, on the received information, generates a signal to be applied to one or more antennas 1912. The processing system 1902 includes a processor 1906 coupled to a readable medium. Petition 870190069224, dated 07 / 22 / 2019, pp. 115 / 150 109 / 113 computer / memory 1908. The 1906 processor is responsible for general processing, including the execution of software stored in the computer-readable medium / memory 1908. The software, when executed by the 1906 processor, causes the 1902 processing system to perform the various functions described above for any particular device. The computer-readable medium / memory 1908 may also be used to store data that is manipulated by the 1906 processor when executing the software. The processing system additionally includes at least one of the modules 1804, 1806, and 1808. The modules may be software modules running on the 1906 processor, residing / stored in the computer-readable medium / memory 1908, one or more hardware modules coupled to the 1906 processor, or some combination thereof.The 1902 processing system may be a component of the UE 120 and may include memory 282 and / or at least one 258 receiver processor, 264 transmitter processor and / or 280 controller / processor.
[00228] In some respects, the 1802 / 1802' wireless communication apparatus includes means for receiving a cell identifier for a cell. In some respects, the 1802 / 1802' wireless communication apparatus includes means for receiving a physical broadcast channel. The physical broadcast channel may include a plurality of blocks. Each block, among the plurality of blocks, may include bit repetition subsets. Each block, among the plurality of blocks, may be processed using a first processing stage. Each repetition of the bit repetition subsets, for each block, may be Petition 870190069224, dated 07 / 22 / 2019, pp. 116 / 150 110 / 113 processed using a second processing stage such that a particular repetition of the bit repetition subset of a first block and a corresponding particular repetition of the bit repetition subset of a second block are processed using a common processing scheme. The first processing stage and the second processing stage may be initialized based, at least in part, on the cell identifier.
[00229] In some respects, the device 1802 / 1802' for wireless communication includes means for receiving a cell identifier for a cell. In some respects, the 1802 / 1802' for wireless communication includes means for receiving a physical broadcast channel. The physical broadcast channel may include a plurality of symbol sets. Each symbol set, among the plurality of symbol sets, may be scrambled with a respective scrambling sequence from among a plurality of scrambling sequences. Each symbol set, among the plurality of symbol sets, may be associated with at least one phase rotation. The at least one phase rotation may be based at least in part on the cell identifier for the cell.
[00230] In some respects, the device '1802 / 1802' for wireless communication includes means for receiving, from a base station associated with a cell identifier for a cell, a channel, wherein each block, among a plurality of blocks of the channel, includes repetitions of sets of symbols, wherein each block, among the plurality of blocks, is scrambled using a scrambling sequence, among a plurality of Petition 870190069224, dated 07 / 22 / 2019, pp. 117 / 150 111 / 113 shuffling sequences, initialized based, at least in part, on a block index of the block and the cell identifier of the cell, wherein each repetition, among the repetitions of sets of symbols, for each block is rotated using a different rotation sequence, among a plurality of rotation sequences, initialized based, at least in part, on a repetition index of the repetition.
[00231] In some respects, the device 1802 / 1802' for wireless communication includes means for receiving, from a base station associated with a cell identifier for a cell, a channel, wherein the channel includes a plurality of repetitions of a set of bits in a plurality of subframes, and wherein each repetition, among the plurality of repetitions, is scrambled using a different scrambling sequence, among a plurality of different scrambling sequences, initialized based, at least in part, on a non-linear combination of the cell identifier and a repetition index.
[00232] The aforementioned means may be one or more of the aforementioned modules of the 1802 device and / or the 1902 processing system of the 1802 device configured to perform the functions mentioned by the aforementioned means. As described above, the 1902 processing system may receive the 258 processor, the 264 transmission processor and / or the 280 controller / processor. As such, in one configuration, the aforementioned means may be the 258 receiving processor, the 264 transmission processor and / or the Petition 870190069224, dated 07 / 22 / 2019, pp. 118 / 150 112 / 113 controller / processor 280 configured to perform the aforementioned functions by the means mentioned above.
[00233] FIG. 19 is provided as an example. Other examples are possible and may differ from what has been described in relation to FIG. 19.
[00234] It should be understood that the specific order or hierarchy of blocks in the processes / flowcharts described is an illustration of example approaches. Based on design preferences, it should be understood that the specific order or hierarchy of blocks in the processes / flowcharts may be rearranged. Furthermore, some blocks may be combined or omitted. The attached method claims elements present from the various blocks in a sample order, and is not intended to be limited to the specific order or hierarchy presented.
[00235] The preceding description is provided to enable anyone skilled in the art to practice the various aspects described in this document. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles set forth in this document may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown in this document, but are to be in accordance with the full scope consistent with the language of the claims, wherein reference to an element in the singular does not mean one and only one unless specifically so stated, but rather one or more. The word “exemplary” is used in this document to mean “serving as an example, instance, or illustration.” Any aspect described in this document as exemplary Petition 870190069224, dated 07 / 22 / 2019, pp. 119 / 150 113 / 113 is not necessarily to be interpreted as preferred or advantageous in relation to other aspects. Unless otherwise indicated, the term "some" refers to one or more. Combinations such as "at least one of A, B, or C," "at least one of A, B, and C," and "A, B, C," or any combination thereof" include any combination of A, B, and / or C, and may include multiples of A, multiples of B, or multiples of C. Specifically, combinations such as "at least one of A, B, or C," "at least one of A, B, and C," and "A, B, C," or any combination thereof" may be only A, only B, only C, A and B, A and C, B and C, or A and B and C, where any of these combinations may contain one or more members or members of A, B, or C.All structural and functional equivalents to the elements of the various aspects described throughout this description that are known or will hereafter become known to those skilled in the art are expressly incorporated herein by reference and are intended to be covered by the claims. Furthermore, nothing disclosed in this document is intended to be made available to the public, regardless of whether such description has been explicitly stated in the claims. No element of a claim should be construed as a means plus function unless the element is expressly cited using the expression "means to". Petition 870190069224, dated 07 / 22 / 2019, pp. 120 / 150
Claims
1 / 5 CLAIMS 1. Method for wireless communication comprising: transmitting (910), by a base station associated with a cell identifier to a cell, an indication of the cell identifier; transmitting (920), by the base station, a physical broadcast channel, PBCH, wherein the PBCH comprises a plurality of blocks, each block comprising subsets of repeating bits, wherein, in a first processing stage, each block, among the plurality of blocks, is scrambled (1010) using a first scrambling sequence, among a first plurality of scrambling sequences, initialized based, at least in part, on a block index of the block and the cell identifier to the cell, wherein, in a second processing stage, each repetition, of the subsets of repeating bits, for each block, is scrambled using a second different scrambling sequence, among a second plurality of scrambling sequences,initialized based, at least in part, on a repetition index of repetition, characterized in that each of the second plurality of shuffling sequences includes a plurality of consecutive tuples of repeated bits leading to a phase rotation at a symbol level.
2. Method according to claim 1, characterized in that the repetition index is based, at least in part, on a number of radio frames.
3. Method, according to claim 1, characterized in that a binary sequence, from among a plurality of binary sequences, is generated for each repetition index associated with the repetition bit subsets; and Petition 870250048548, dated 10 / 06 / 2025, page 14 / 19 2 / 5 in which the second plurality of scrambling sequences is generated based, at least in part, on the plurality of binary sequences.
4. A method according to claim 3, characterized in that the plurality of binary sequences is obtained based, at least in part, on a binary generator; and in that the binary generator is initialized, for each binary sequence among the plurality of binary sequences, based, at least in part, on a corresponding cell identifier and a corresponding repetition index.
5. A method according to claim 3, characterized in that the plurality of binary sequences is obtained based, at least in part, on a binary generator; and wherein the binary generator is initialized, for each binary sequence among the plurality of binary sequences, based, at least in part, on a binary vector associated with a non-linear combination of a corresponding cell identifier and a corresponding repetition index.
6. Base station for wireless communication, the base station associated with a cell identifier for a cell and comprising: means for transmitting an indication of the cell identifier; means for transmitting a physical broadcast channel, PBCH, wherein the PBCH comprises a plurality of blocks, each block comprising subsets of repeating bits, wherein, in a first processing stage, each block, among the plurality of blocks, is scrambled using a first scrambling sequence, among a first plurality of scrambling sequences, initialized based, at least in part, on a block index of the block and the cell identifier for the cell, Petition 870250048548, dated 10 / 06 / 2025, p.15 / 19 3 / 5 wherein, in a second processing stage, each repetition, among the subsets of repetition bits, for each block, is shuffled using a second different shuffling sequence, among a second plurality of shuffling sequences, initialized based, at least in part, on a repetition index of the repetition, characterized in that each of the second plurality of shuffling sequences includes a plurality of consecutive tuples of repeated bits leading to a phase rotation at a symbol level.
7. Method for wireless communication comprising: receiving (1510), by a user equipment, an indication of a cell identifier from a base station, the cell identifier being associated with a cell; receiving (1520), by the user equipment, a physical broadcast channel, PBCH, from the base station, wherein the PBCH comprises a plurality of blocks, each block comprising subsets of repeating bits, unscrambling (1610) the blocks, wherein each block, among the plurality of blocks, is scrambled using a first scrambling sequence, among a first plurality of scrambling sequences, initialized based, at least in part, on a block index of the block and the cell identifier for the cell, and unscrambling the blocks, wherein each repetition, among the subsets of repeating bits, for each block, is scrambled using a different second scrambling sequence,among a second plurality of scrambling sequences, initialized based, at least in part, on a repetition index of repetition, characterized in that each of the second plurality of scrambling sequences includes a plurality of consecutive tuples of repeated bits leading to a phase rotation at a symbol level.
8. Method according to claim 7, characterized in that the repetition rate is based, at least in part, on a number of radio frames.
9. A method according to claim 7, characterized in that a binary sequence, from among a plurality of binary sequences, is generated for each repetition index associated with the subsets of repetition bits; and wherein the second plurality of scrambling sequences is generated based, at least in part, on the plurality of binary sequences.
10. A method according to claim 9, characterized in that the plurality of binary sequences is obtained based, at least in part, on a binary generator; and in that the binary generator is initialized, for each binary sequence among the plurality of binary sequences, based, at least in part, on a corresponding cell identifier and a corresponding repetition index.
11. User equipment for wireless communication, the user equipment comprising: means for receiving an indication of a cell identifier from a base station, the cell identifier being associated with a cell; means for receiving a physical broadcast channel, PBCH, from the base station, wherein the PBCH comprises a plurality of blocks, each block comprising subsets of repeating bits, means for unscrambling the blocks, wherein each block, among Petition 870250048548, dated 10 / 06 / 2025, page.17 / 19 5 / 5 plurality of blocks, is shuffled using a first shuffling sequence, among a first plurality of shuffling sequences, initialized based, at least in part, on a block index of the block and on the cell identifier for the cell, and means to unscramble the blocks, wherein each repetition, among the subsets of repetition bits, for each block, is shuffled using a different second shuffling sequence, among a second plurality of shuffling sequences, initialized based, at least in part, on a repetition index of the repetition, characterized in that each of the second plurality of shuffling sequences includes a plurality of consecutive tuples of repeated bits leading to a phase rotation at a symbol level. Petition 870250048548, dated 10 / 06 / 2025, pp. 18 / 19.