Sequence partitioning for multi-user uplink channels
By dividing the sequence set into multiple sequence pools and generating the sequence pools based on parameters and a random number generator, and combining orthogonal matrices and cyclic shift indices to generate the sequence set, the problem of low resource allocation efficiency in multi-user wireless communication systems is solved, and efficient and reliable communication is achieved.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-05-28
- Publication Date
- 2026-04-07
AI Technical Summary
In multi-user wireless communication systems, existing technologies struggle to effectively utilize sequence sets for resource allocation, leading to interference and inefficiency when multiple user devices communicate on the same resources.
By dividing the sequence set into multiple sequence pools, each used by a different user device, and generating sequence pools based on parameters and a random number generator, and combining orthogonal matrices and cyclic shift indices to generate sequence sets, a codebook is constructed for sequence selection and transmission.
It enables multiple user devices to communicate efficiently on the same resources, improves data rate and throughput, reduces latency, and enhances communication reliability.
Smart Images

Figure CN115918000B_ABST
Abstract
Description
[0001] Cross-references
[0002] This patent application claims the benefit of U.S. Provisional Patent Application No. 63 / 033,169, filed June 1, 2020, entitled "Sequence Partitioning for a Multi-User Uplink Channel"; and U.S. Patent Application No. 17 / 332,922, filed May 27, 2021, entitled "Sequence Partitioning for a Multi-User Uplink Channel"; each of which is assigned to the assignee of this application. Technical Field
[0003] The following text generally refers to wireless communication, especially sequence partitioning for multi-user uplink channels.
[0004] background
[0005] Wireless communication systems are widely deployed to provide various types of communication content, such as voice, video, packet data, message sending and receiving, broadcasting, and so on. These systems can support communication with multiple users by sharing available system resources (e.g., time, frequency, and power). Examples of such multiple access systems include fourth-generation (4G) systems (such as Long Term Evolution (LTE) systems, LTE-A Advanced (LTE-A) systems, or LTE-A Pro systems) and fifth-generation (5G) systems, which may be referred to as New Radio (NR) systems. These systems can employ various technologies, such as Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiple Access (OFDMA), or Discrete Fourier Transform Extended Orthogonal Frequency Division Multiplexing (DFT-S-OFDM). A wireless multiple access communication system may include one or more base stations or one or more network access nodes, each of which simultaneously supports communication from multiple communication devices, which may also be referred to as User Equipment (UE).
[0006] In some wireless communication systems, the UE can use a sequence selected from a sequence group to transmit a payload to the base station.
[0007] Overview
[0008] The described techniques relate to improved methods, systems, devices, and apparatuses for supporting sequence partitioning for multi-user uplink channels. Typically, the described techniques provide multi-user designs for sequence-based transmissions using uplink control channels; however, these techniques can also be applied to sidelink control channels. For example, a user equipment (UE) or base station, or both, can determine a partition from a set of sequences to a set of sequence pools, each of which can be used by a different UE to transmit a payload on the uplink control channel. This set of sequence pools can be contiguous (e.g., non-interleaved) or interleaved within a larger set of sequences. The UE or base station, or both, can determine the first sequence pool usable by the UE based on generating a first sequence pool usable by the UE or based on selecting sequences from a larger set of sequences that can be used by the UE to form the first sequence pool.
[0009] In some implementations, for example, the sequence set may refer to a non-orthogonal sequence set, and the UE or base station, or both, may generate the first sequence pool based on one or more parameters, and in some cases based on random numbers (or a random sequence generator). For example, the UE or base station, or both, may generate the first sequence pool by inputting an initial seed into a random number generator to generate the first sequence pool. In such an example, the UE or base station, or both, may determine the initial seed based on the UE identifier (ID), slot ID, frame ID, or any combination thereof.
[0010] In some other implementations, the sequence set may refer to an orthogonal sequence set, and the UE or base station, or both, may generate a first sequence pool based on the product of selected rows or columns of the orthogonal matrix and selected cyclic shift indices of the base sequences (e.g., selected cyclic shift indices of the base sequences that vary depending on the cell). The orthogonal matrix may have a size (e.g., the number of rows and columns) corresponding to the number of time periods (such as symbol periods) on which the UE can transmit payloads, while the cyclically shifted base sequences may have a size (e.g., the length) corresponding to the number of frequency modulations or subcarriers of that resource allocation. In some examples, the first sequence pool of orthogonal sequences may be generated by determining the product (e.g., the Kronecker product) of each selected row or column of the orthogonal matrix and each selected cyclic shift index of the base sequences.
[0011] In some further implementations, the UE or base station, or both, may generate a sequence set based on determining the product of an orthogonal matrix (e.g., the entire orthogonal matrix) and a cyclically shifted base sequence (e.g., all cyclic shift indices of the base sequence), and may determine a first sequence pool from the sequence set based on determining which sequences in the sequence set correspond to selected rows or columns of the orthogonal matrix and selected cyclic shift indices of the base sequence (e.g., the product of selected rows or columns of the orthogonal matrix and selected cyclic shift indices of the base sequence). Alternatively, the UE or base station, or both, may determine the first sequence pool from the sequence set based on identifying consecutive blocks of sequences addressed to the first sequence pool (e.g., based on this configuration) or based on the interleaving granularity associated with the sequence set.
[0012] When determining the first sequence pool, the UE or the base station, or both, may select a subset of sequences from the first sequence pool based on the number of bits of the payload transmitted from the UE. For example, the UE or the base station, or both, may select a number of sequences such that each bit value of the payload (e.g., each permutation of that number of bits in the payload) corresponds to a different sequence in the sequence subset. The UE or the base station, or both, may construct a codebook and include the selected subset of sequences in the constructed codebook. In some examples, the UE may select sequences from the constructed codebook based on a decimal conversion corresponding to the bit stream of the payload. For example, the UE may convert the bit stream to a decimal number and map the decimal number to an index in the constructed codebook, and thus, the UE may select a sequence from the codebook corresponding to a determined index. Accordingly, the UE may use the selected sequence to transmit the payload to the base station.
[0013] A method for wireless communication at a UE is described. The method may include: receiving a configuration for dividing a set of sequences into a set of sequence pools associated with a set of UEs; determining, based on the configuration, a subset of sequences from a first sequence pool of the set of sequence pools for transmitting a payload, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; selecting a sequence from the subset of sequences based on a mapping between the subset of sequences and the bit set; and using the selected sequence to transmit the payload including the bit set.
[0014] An apparatus for wireless communication at a UE is described. The apparatus may include a processor, a memory coupled to the processor, and instructions stored in the memory. These instructions, when executed by the processor, are operable to cause the apparatus to: receive a configuration for dividing a set of sequences into a set of sequence pools associated with a set of UEs; determine, based on the configuration, a subset of sequences from a first sequence pool of the set of sequence pools for conveying a payload, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; select a sequence from the subset of sequences based on a mapping between the subset of sequences and the bit set; and use the selected sequence to transmit the payload including the bit set.
[0015] Another device for wireless communication at a UE is described. The device may include means for: receiving a configuration for dividing a set of sequences into a set of sequence pools associated with a set of UEs; determining, based on the configuration, a subset of sequences for transmitting a payload from a first sequence pool of the set of sequence pools, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; selecting a sequence from the subset of sequences based on a mapping between the subset of sequences and the bit set; and using the selected sequence to transmit the payload including the bit set.
[0016] A non-transient computer-readable medium is described, storing code for wireless communication at a UE. The code may include instructions executable by a processor for: receiving a configuration for dividing a set of sequences into a set of sequence pools associated with a set of UEs; determining, based on the configuration, a subset of sequences from a first sequence pool of the set of sequence pools for conveying a payload, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; selecting a sequence from the subset of sequences based on a mapping between the subset of sequences and the bit set; and using the selected sequence to transmit the payload comprising the bit set.
[0017] Some examples of the methods, apparatus (devices) and non-transient computer-readable media described herein may further include operations, features, means or instructions for determining a first sequence pool based on the configuration, wherein the first sequence pool may be associated with a UE.
[0018] In some examples of methods, apparatuses, and non-transient computer-readable media described herein, determining a first sequence pool may include operations, features, means, or instructions for determining a pool of consecutive sequences in the sequence set.
[0019] Some examples of the methods, apparatus (devices) and non-transient computer-readable media described herein may further include operations, features, means or instructions for receiving an interleaved value, wherein determining a first sequence pool may be based on the interleaved value.
[0020] In some examples of methods, apparatuses, and nontransient computer-readable media described herein, determining a first sequence pool may include operations, features, means, or instructions for: determining a first number of sequences corresponding to the interleaving value; and determining a second number of sequences corresponding to the interleaving value at a distance from the first number of sequences based on the number of UEs in the UE set and the interleaving value.
[0021] Some examples of the methods, apparatus (devices) and non-transient computer-readable media described herein may further include operations, features, means or instructions for determining an initial seed based on a UE ID, a slot ID, a frame ID or any combination thereof; and generating a first sequence pool based on the initial seed.
[0022] Some examples of the methods, apparatus (devices) and non-transient computer-readable media described herein may further include operations, features, means or instructions for receiving an indication of a UE ID.
[0023] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the first sequence pool may be generated based on a pseudo-random number generator.
[0024] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the first sequence pool may be generated based on a maximum-length sequence.
[0025] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the first sequence pool may be generated based on the Gold sequence.
[0026] Some examples of the methods, apparatus (devices) and non-transient computer-readable media described herein may further include operations, features, means, or instructions for: identifying a first index subset of an orthogonal matrix and a second index subset of cyclically shifted, cell-specific sequences based on the configuration; and generating a first sequence pool based on the product of the first index subset of the orthogonal matrix and the second index subset of cyclically shifted, cell-specific sequences.
[0027] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the first subset of the indexes of the orthogonal matrix and the second subset of the indexes of the cyclically shifted, cell-specific sequences include continuous indices, interleaved indices, or any combination thereof.
[0028] In some examples of the methods, devices, and non-transient computer-readable media described herein, the orthogonal matrix may be a discrete Fourier transform (DFT) matrix.
[0029] Some examples of the methods, apparatus (devices), and non-transient computer-readable media described herein may further include operations, features, means, or instructions for: generating a set of sequences based on the product of an orthogonal matrix having a size corresponding to a number of time periods and a number of cyclically shifted, cell-specific sequences having a length corresponding to a number of frequency modulations, wherein the number of time periods and the number of frequency modulations include resource allocation for conveying the payload; identifying a first index subset of the orthogonal matrix and a second index subset of the cyclically shifted, cell-specific sequences based on the configuration; and determining a first sequence pool from the set of sequences based on the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequences.
[0030] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the first subset of the indexes of the orthogonal matrix and the second subset of the indexes of the cyclically shifted, cell-specific sequences include continuous indices, interleaved indices, or any combination thereof.
[0031] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the orthogonal matrix may be a DFT matrix.
[0032] Some examples of the methods, apparatus (devices) and non-transient computer-readable media described herein may further include operations, features, means or instructions for converting the set of bits into a decimal number, wherein the mapping between the subset of the sequence and the set of bits may be based on a mapping between the decimal number and the index of the subset of the sequence.
[0033] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the sequence subset includes a codebook for conveying the payload comprising the set of bits.
[0034] In some examples of the methods, apparatus (devices), and non-transient computer-readable media described herein, each sequence in the set of sequences may be a digital sequence.
[0035] A method for wireless communication at a base station is described. The method may include: determining a configuration for dividing a set of sequences into a set of sequence pools associated with a set of UEs; transmitting the configuration for dividing the set of sequences; determining, based on the configuration, a subset of sequences from a first sequence pool of the set of sequence pools for conveying a payload, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; and receiving the payload comprising the bit set using a selected sequence from the subset of sequences, the selected sequence being based on a mapping between the subset of sequences and the bit set.
[0036] An apparatus for wireless communication at a base station is described. The apparatus may include a processor, a memory coupled to the processor, and instructions stored in the memory. These instructions, when executed by the processor, are operable to cause the apparatus to: determine a configuration for dividing a set of sequences into a set of sequence pools associated with a set of UEs; transmit the configuration for dividing the set of sequences; determine, based on the configuration, a subset of sequences from a first sequence pool of the set of sequence pools for conveying a payload, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; and receive the payload comprising the bit set using a selected sequence from the subset of sequences, the selected sequence being based on a mapping between the subset of sequences and the bit set.
[0037] Another device for wireless communication at a base station is described. The device may include means for: determining a configuration for dividing a set of sequences into a set of sequence pools associated with a set of UEs; transmitting the configuration for dividing the set of sequences; determining, based on the configuration, a subset of sequences from a first sequence pool of the set of sequence pools for conveying a payload, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; and receiving the payload comprising the bit set using a selected sequence from the subset of sequences, the selected sequence being based on a mapping between the subset of sequences and the bit set.
[0038] A non-transient computer-readable medium is described, storing code for wireless communication at a base station. The code may include instructions executable by a processor for: determining a configuration for partitioning a set of sequences into a set of sequence pools associated with a set of UEs; transmitting the configuration for partitioning the set of sequences; determining, based on the configuration, a subset of sequences from a first sequence pool of the set of sequence pools for conveying a payload, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; and receiving the payload comprising the bit set using a selected sequence from the subset of sequences, the selected sequence being based on a mapping between the subset of sequences and the bit set.
[0039] Some examples of the methods, apparatuses, and nontransient computer-readable media described herein may further include operations, features, means, or instructions for: determining, based on the configuration, a second subset of sequences from a second sequence pool of the sequence pool set for conveying a second payload, wherein the size of the second subset of sequences may be based on a second number of bits in a second set of bits of the second payload; and receiving the second payload comprising the second set of bits using a second selected sequence from the second subset of sequences, the second selected sequence being based on a second mapping between the second subset of sequences and the second set of bits.
[0040] Some examples of the methods, apparatus (devices) and non-transient computer-readable media described herein may further include operations, features, means or instructions for determining a first sequence pool based on the configuration, wherein the first sequence pool may be associated with a first UE.
[0041] In some examples of methods, apparatuses, and non-transient computer-readable media described herein, determining a first sequence pool may include operations, features, means, or instructions for determining a pool of consecutive sequences in the sequence set.
[0042] Some examples of the methods, apparatus (devices) and non-transient computer-readable media described herein may further include operations, features, means or instructions for: determining an interleaving value, wherein determining a first sequence pool may be based on the interleaving value; and transmitting the interleaving value.
[0043] In some examples of methods, apparatuses, and nontransient computer-readable media described herein, determining a first sequence pool may include operations, features, means, or instructions for: determining a first number of sequences corresponding to the interleaving value; and determining a second number of sequences corresponding to the interleaving value at a distance from the first number of sequences based on the number of UEs in the UE set and the interleaving value.
[0044] Some examples of the methods, apparatus (devices) and non-transient computer-readable media described herein may further include operations, features, means or instructions for determining an initial seed based on a UE ID, a slot ID, a frame ID or any combination thereof; and generating a first sequence pool based on the initial seed.
[0045] Some examples of the methods, apparatus (devices) and non-transient computer-readable media described herein may further include operations, features, means or instructions for transmitting an indication of the UE ID.
[0046] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the first sequence pool may be generated based on a pseudo-random number generator.
[0047] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the first sequence pool may be generated based on a maximum-length sequence.
[0048] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the first sequence pool may be generated based on the Gold sequence.
[0049] Some examples of the methods, apparatus (devices) and non-transient computer-readable media described herein may further include operations, features, means, or instructions for: identifying a first index subset of an orthogonal matrix and a second index subset of cyclically shifted, cell-specific sequences based on the configuration; and generating a first sequence pool based on the product of the first index subset of the orthogonal matrix and the second index subset of cyclically shifted, cell-specific sequences.
[0050] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the first subset of the indexes of the orthogonal matrix and the second subset of the indexes of the cyclically shifted, cell-specific sequences include continuous indices, interleaved indices, or any combination thereof.
[0051] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the orthogonal matrix may be a DFT matrix.
[0052] Some examples of the methods, apparatus (devices), and non-transient computer-readable media described herein may further include operations, features, means, or instructions for: generating a set of sequences based on the product of an orthogonal matrix having a size corresponding to a number of time periods and a cyclically shifted, cell-specific sequence having a length corresponding to a number of frequency modulations, wherein the number of time periods and the number of frequency modulations include resource allocation for conveying the payload; identifying a first index subset of the orthogonal matrix and a second index subset of the cyclically shifted, cell-specific sequences based on the configuration; and determining a first sequence pool from the set of sequences based on the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequences.
[0053] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the first subset of the indexes of the orthogonal matrix and the second subset of the indexes of the cyclically shifted, cell-specific sequences include continuous indices, interleaved indices, or any combination thereof.
[0054] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the orthogonal matrix may be a DFT matrix.
[0055] In some examples of the methods, apparatuses, and non-transient computer-readable media described herein, the sequence subset includes a codebook for conveying the payload comprising the set of bits.
[0056] In some examples of the methods, apparatus (devices), and non-transient computer-readable media described herein, each sequence in the set of sequences may be a digital sequence. Brief description of the attached diagram
[0058] Figure 1 Examples of wireless communication systems that support sequence partitioning for multi-user uplink channels according to various aspects of this disclosure are explained.
[0059] Figure 2 Examples of wireless communication systems that support sequence partitioning for multi-user uplink channels according to various aspects of this disclosure are explained.
[0060] Figure 3 An example sequence partitioning for a multi-user uplink channel is explained, supporting various aspects of this disclosure.
[0061] Figure 4 An example sequence partitioning for a multi-user uplink channel is explained, supporting various aspects of this disclosure.
[0062] Figure 5A Examples of orthogonal matrices and base sequences supporting sequence partitioning for multi-user uplink channels are explained in accordance with various aspects of this disclosure.
[0063] Figure 5B Examples of mathematical operations supporting sequence partitioning for multi-user uplink channels, based on various aspects of this disclosure, are explained.
[0064] Figure 6 An example of the process flow for sequence partitioning of a multi-user uplink channel, supported by various aspects of this disclosure, is explained.
[0065] Figure 7 and 8 A block diagram of an apparatus supporting sequence partitioning for a multi-user uplink channel, based on various aspects of this disclosure, is provided.
[0066] Figure 9 A block diagram illustrating a communication manager that supports sequence partitioning for multi-user uplink channels according to various aspects of this disclosure is provided.
[0067] Figure 10The diagram illustrates a system including a device supporting sequence partitioning for multi-user uplink channels, according to various aspects of this disclosure.
[0068] Figure 11 and 12 A block diagram of an apparatus supporting sequence partitioning for a multi-user uplink channel, based on various aspects of this disclosure, is provided.
[0069] Figure 13 A block diagram illustrating a communication manager that supports sequence partitioning for multi-user uplink channels according to various aspects of this disclosure is provided.
[0070] Figure 14 The diagram illustrates a system including a device supporting sequence partitioning for multi-user uplink channels, according to various aspects of this disclosure.
[0071] Figures 15 to 20 A flowchart illustrating a method for sequence partitioning of a multi-user uplink channel, based on various aspects of this disclosure, is provided.
[0072] Detailed description
[0073] Wireless communication systems can support communication between user equipment (UE) and base stations, and the UE and base station can communicate on channels allocated for communication between them. In some cases, the UE and base station can transmit signals, including payloads (such as a number of information bits), to each other on resources allocated in the channel. The UE can transmit the payload of the signal to the base station according to a selected sequence (or code points) associated with the allocated resources. The UE can select the sequence from a set of sequences associated with the allocated resources. However, in some cases, this selection of a sequence from the set of sequences associated with the allocated resources may exclude the opportunity for multiple UEs to communicate with the base station using the same allocated resources. For example, if a UE can select any sequence from the set of sequences associated with the allocated resources, other UEs may not be able to select a sequence from the set without the possibility of selecting the same sequence as the sequence selected by that UE or selecting a sequence that may interfere with the sequence selected by that UE.
[0074] In some examples, the UE or base station, or both, may determine a configuration for dividing the sequence set into a number of sequence pools, each of which can be used by a different UE. For example, a first UE may use a first sequence pool, while a second UE may use a second sequence pool. In some implementations, the sequence set may refer to a non-orthogonal sequence set, and the UE or base station, or both, may generate the sequence pools based on one or more parameters associated with the UE. For example, the UE or base station, or both, may generate the sequence pools based on an initial seed, and in some cases, based on random numbers or a random sequence generator. In some other implementations, the sequence set may refer to an orthogonal sequence set, and the UE or base station, or both, may identify an index subset of an orthogonal matrix (e.g., a subset of rows or columns of the orthogonal matrix) and an index subset of cell-specific base sequences (e.g., a cyclically shifted subset of cell-specific base sequences), and generate the sequence pools based on the product of a first index subset of the orthogonal matrix and a second index subset of cell-specific base sequences (e.g., the Kronecker product). In some other implementations, the UE or base station, or both, may generate a sequence set based on the product (e.g., the Kronecker product) of an orthogonal matrix (e.g., all rows or columns of the orthogonal matrix) and a cell-specific base sequence (e.g., all cyclic shifts of the cell-specific base sequence), and determine the sequence pool based on the sequences that identify the first index subset of the orthogonal matrix and the second index subset of the cell-specific base sequence in the sequence set (e.g., the product of the first index subset of the orthogonal matrix and the second index subset of the cell-specific base sequence).
[0075] The UE or the base station, or both, can determine a subset of sequences from a sequence pool, and the UE can store this subset in a constructed codebook. In some implementations, the number of sequences in this subset can be based on the number of bits included in the payload, and each sequence in the subset can be associated with an index in the constructed codebook. In some examples, the UE can select sequences from the constructed codebook based on the bits of the payload. For example, the UE can determine the bitstream of the payload and convert the bitstream to a decimal number. This decimal number can correspond to an index in the constructed codebook, and thus, the UE can select the sequence associated with the index corresponding to that decimal number from the constructed codebook. Accordingly, the UE can use the selected sequence to transmit a payload comprising multiple bits to the base station.
[0076] Specific aspects of the subject matter described herein can be implemented to achieve one or more potential advantages. The described techniques enable multiple UEs to transmit payloads to a base station on the same resource allocation based on the selection of sequences from different sequence pools to convey their payloads. This can result in higher data rates and greater achievable throughput in systems comprising a base station and multiple UEs. Furthermore, based on enabling multiple UEs to transmit payloads to the base station on the same resource allocation, these multiple UEs can achieve lower latency. Additionally, based on techniques related to the efficient construction of codebooks, UEs can avoid storing more sequences than are needed to convey the payload. Moreover, in the implementation of this disclosure where the sequence set is orthogonal sequences, the use of orthogonal sequences can provide more reliable communication between the UE and the base station, which can increase the likelihood of successful communication between the UE and the base station.
[0077] The aspects of this disclosure are initially described in the context of wireless communication systems. The aspects of this disclosure are additionally described in the context of example sequence partitioning, orthogonal matrices, basis sequences, and mathematical operations involving orthogonal matrices and basis sequences. The aspects of this disclosure are further explained and described by way of and with reference to apparatus diagrams, system diagrams, and flowcharts relating to sequence partitioning for multi-user uplink channels.
[0078] Figure 1 Examples of a wireless communication system 100 supporting sequence partitioning for multi-user uplink channels according to various aspects of this disclosure are described. The wireless communication system 100 may include one or more base stations 105, one or more UEs 115, and a core network 130. In some examples, the wireless communication system 100 may be a Long Term Evolution (LTE) network, an Advanced LTE (LTE-A) network, an LTE-A Pro network, or a New Radio (NR) network. In some examples, the wireless communication system 100 may support enhanced broadband communication, ultra-reliable (e.g., mission-critical) communication, low latency communication, communication with low-cost and low-complexity devices, or any combination thereof.
[0079] Base station 105 can be distributed across a geographical area to form wireless communication system 100, and can be different types of devices or devices with different capabilities. Base station 105 and UE 115 can communicate wirelessly via one or more communication links 125. Each base station 105 can provide a geographical coverage area 110, and UE 115 and base station 105 can establish one or more communication links 125 on the coverage area 110. The geographical coverage area 110 can be an example of a geographical area in which base station 105 and UE 115 can support signal communication according to one or more radio access technologies.
[0080] Each UE 115 can be distributed throughout the geographical coverage area 110 of the wireless communication system 100, and each UE 115 can be stationary or mobile, or stationary and mobile at different times. Each UE 115 can be a different type of device or a device with different capabilities. Figure 1 The document describes some example UE 115s. The UE 115 described herein can communicate with various types of devices, such as other UE 115s, base station 105, or network equipment (e.g., core network nodes, relay equipment, integrated access and backhaul (IAB) nodes, or other network equipment). Figure 1 As shown in the image.
[0081] Each base station 105 may communicate with the core network 130, or with each other, or both. For example, base station 105 may interface with the core network 130 via one or more backhaul links 120 (e.g., via S1, N2, N3, or other interfaces). Base stations 105 may communicate with each other directly (e.g., directly between base stations 105), indirectly (e.g., via the core network 130), or directly and indirectly on backhaul links 120 (e.g., via X2, Xn, or other interfaces). In some examples, backhaul link 120 may be or include one or more radio links.
[0082] One or more of the base stations 105 described herein may include, or may be referred to by those skilled in the art as, base transceiver station, radio base station, access point, radio transceiver, B node, evolved B node (eNB), next-generation B node or gigabit B node (any of which may be referred to as gNB), home B node, home evolved B node, or other suitable terms.
[0083] UE 115 may include or be referred to as a mobile device, wireless device, remote device, handheld device, or subscriber device, or any other suitable term, wherein "device" may also be referred to as a unit, station, terminal, or client, etc. UE 115 may also include or be referred to as a personal electronic device, such as a cellular phone, personal digital assistant (PDA), tablet computer, laptop computer, or personal computer. In some examples, UE 115 may include or be referred to as a wireless local loop (WLL) station, Internet of Things (IoT) device, Internet of Everything (IoE) device, or machine-type communication (MTC) device, which may be implemented in various objects such as appliances or vehicles, meters, etc.
[0084] The UE 115 described herein can communicate with various types of devices, such as other UEs 115 that sometimes act as relays, as well as base station 105 and network equipment including macro eNBs or gNBs, small cell eNBs or gNBs, relay base stations, etc. Figure 1As shown in the image.
[0085] UE 115 and base station 105 can wirelessly communicate with each other via one or more communication links 125 on one or more carriers. The term "carrier" can refer to a set of radio frequency spectrum resources having a defined physical layer structure for supporting communication link 125. For example, a carrier for communication link 125 may include a portion of the radio spectrum band (e.g., a bandwidth portion (BWP)) operating according to one or more physical layer channels for a given radio access technology (e.g., LTE, LTE-A, LTE-A Pro, NR). Each physical layer channel may carry acquisition signaling (e.g., synchronization signals, system information), control signaling coordinating carrier operation, user data, or other signaling. Wireless communication system 100 may support communication with UE 115 using carrier aggregation or multi-carrier operation. UE 115 may be configured to have multiple downlink component carriers and one or more uplink component carriers according to a carrier aggregation configuration. Carrier aggregation may be used in conjunction with both frequency division duplex (FDD) and time division duplex (TDD) component carriers.
[0086] In some examples (e.g., in a carrier aggregation configuration), the carrier may also have acquisition signaling or control signaling to coordinate the operation of other carriers. The carrier may be associated with a frequency channel (e.g., an Evolved Universal Mobile Telecommunications System Terrestrial Radio Access (E-UTRA) Absolute Radio Frequency Channel Number (EARFCN)) and may be located according to a channel grid for discovery by UE 115. The carrier may operate in an autonomous mode in which initial acquisition and connection can be performed by UE 115 via that carrier, or in a non-autonomous mode in which the carrier may connect to carriers anchored using different carriers (e.g., different carriers of the same or different radio access technologies).
[0087] The communication link 125 shown in the wireless communication system 100 may include uplink transmission from UE 115 to base station 105, or downlink transmission from base station 105 to UE 115. The carrier may carry downlink or uplink communication (e.g., in FDD mode), or may be configured to carry both downlink and uplink communication (e.g., in TDD mode).
[0088] A carrier may be associated with a specific bandwidth of the radio frequency spectrum, and in some examples, the carrier bandwidth may be referred to as the carrier or the “system bandwidth” of the wireless communication system 100. For example, the carrier bandwidth may be one of the determined bandwidths of a carrier for a particular radio access technology (e.g., 1.4, 3, 5, 10, 15, 20, 40, or 80 MHz). Devices of the wireless communication system 100 (e.g., base station 105, UE 115, or both) may have a hardware configuration that supports communication over a specific carrier bandwidth, or may be configurable to support communication over a single carrier bandwidth within a set of carrier bandwidths. In some examples, the wireless communication system 100 may include a base station 105 or UE 115 that supports simultaneous communication via carriers associated with multiple carrier bandwidths. In some examples, each served UE 115 may be configured to operate over a portion (e.g., a subband, BWP) or all of the carrier bandwidth.
[0089] The signal waveform transmitted on the carrier may include multiple subcarriers (e.g., using multi-carrier modulation (MCM) techniques, such as orthogonal frequency division multiplexing (OFDM) or discrete Fourier transform extended OFDM (DFT-S-OFDM)). In a system employing MCM, a resource element may include a symbol period (e.g., the duration of a modulation symbol) and a subcarrier, where the symbol period and subcarrier spacing are inversely related. The number of bits carried by each resource element may depend on the modulation scheme (e.g., the order of the modulation scheme, the coding rate of the modulation scheme, or both). Thus, the more resource elements the UE 115 receives and the higher the order of the modulation scheme, the higher the data rate the UE 115 can achieve. Wireless communication resources may refer to a combination of radio frequency spectrum resources, temporal resources, and spatial resources (e.g., spatial layers or beams), and using multiple spatial layers can further improve the data rate or data integrity of communication with the UE 115.
[0090] One or more parameter designs for a carrier can be supported, where the parameter design may include a subcarrier spacing (Δf) and a cyclic prefix. A carrier can be divided into one or more BWPs with the same or different parameter designs. In some examples, UE 115 can be configured with multiple BWPs. In some examples, a single BWP for a carrier can be active at a given time, and communication for UE 115 can be limited to one or more active BWPs.
[0091] The time interval of base station 105 or UE 115 can be expressed as a multiple of a basic time unit, such as the sampling period T. s =1 / (Δf) max ·N f ) seconds, where Δf max This can represent the maximum supported subcarrier spacing, while Nf This can represent the maximum supported Discrete Fourier Transform (DFT) size. The time interval of the communication resources can be organized according to radio frames, each with a specified duration (e.g., 10 milliseconds (ms)). Each radio frame can be identified by a System Frame Number (SFN) (e.g., ranging from 0 to 1023).
[0092] Each frame may include multiple consecutively numbered subframes or time slots, and each subframe or time slot may have the same duration. In some examples, a frame may (e.g., in the time domain) be divided into subframes, and each subframe may be further divided into a number of time slots. Alternatively, each frame may include a variable number of time slots, and the number of time slots may depend on the subcarrier spacing. Each time slot may include a number of symbol periods (e.g., depending on the length of the cyclic prefix added before each symbol period). In some wireless communication systems 100, time slots may be further divided into multiple mini-time slots containing one or more symbols. Excluding the cyclic prefix, each symbol period may contain one or more (e.g., N) symbols. f (Number) sampling periods. The duration of a symbol period can depend on the subcarrier interval or the operating frequency band.
[0093] A subframe, time slot, mini-slot, or symbol can be the smallest scheduling unit of the wireless communication system 100 (e.g., in the time domain) and can be referred to as a transmission time interval (TTI). In some examples, the duration of the TTI (e.g., the number of symbol periods in the TTI) can be variable. Additionally or alternatively, the smallest scheduling unit of the wireless communication system 100 can be dynamically selected (e.g., in bursts of shortened TTIs (sTTIs)).
[0094] Physical channels can be multiplexed on a carrier using various techniques. Physical control channels and physical data channels can be multiplexed on a downlink carrier, for example, using one or more of Time Division Multiplexing (TDM), Frequency Division Multiplexing (FDM), or hybrid TDM-FDM techniques. A control region (e.g., a control resource set (CORESET)) for physical control channels can be defined by the number of symbol periods and can extend across the system bandwidth or a subset of the system bandwidth of the carrier. One or more control regions (e.g., CORESET) can be configured for a set of UEs 115. For example, one or more UEs 115 can monitor or search control regions for control information based on one or more search space sets, and each search space set can include one or more control channel candidates in one or more aggregation levels arranged in a cascaded manner. An aggregation level for control channel candidates can refer to the number of control channel resources (e.g., control channel elements (CCEs)) associated with coded information in a control information format having a given payload size. The search space set may include a common search space set configured to send control information to multiple UEs 115 and a UE-specific search space set configured to send control information to a specific UE 115.
[0095] Each base station 105 may provide communication coverage via one or more cells (e.g., macrocells, small cells, hotspots, or other types of cells, or any combination thereof). The term "cell" may refer to a logical communication entity used to communicate with base station 105 (e.g., on a carrier) and may be associated with an identifier used to distinguish adjacent cells (e.g., Physical Cell Identifier (PCID), Virtual Cell Identifier (VCID), or others). In some examples, a cell may also refer to a geographic coverage area 110 or a portion of geographic coverage area 110 (e.g., a sector) on which a logical communication entity operates. The extent of such cells may vary from smaller areas (e.g., structures, subsets of structures) to larger areas depending on various factors (such as the capabilities of base station 105). For example, a cell may be or include buildings, subsets of buildings, or external space between or overlapping geographic coverage areas 110, among other examples.
[0096] Macrocells typically cover a relatively large geographic area (e.g., a radius of several kilometers) and allow unrestricted access for UEs 115 that have service subscriptions with a network provider supporting the macrocell. Small cells may be associated with a lower-power base station 105 (compared to macrocells) and may operate in the same or different (e.g., licensed or unlicensed) frequency bands as macrocells. Small cells may provide unrestricted access to UEs 115 that have service subscriptions with a network provider, or may provide restricted access to UEs 115 associated with the small cell (e.g., UEs 115 in a Closed Subscriber Group (CSG), or UEs 115 associated with a user in a home or office). Base station 105 may support one or more cells and may also support communication on one or more cells using one or more component carriers.
[0097] In some examples, a carrier can support multiple cells and can be configured with different cells based on different protocol types that can provide access for different types of devices (e.g., MTC, Narrowband IoT (NB-IoT), Enhanced Mobile Broadband (eMBB)).
[0098] In some examples, base station 105 may be mobile, and thus provide communication coverage to mobile geographic coverage areas 110. In some examples, different geographic coverage areas 110 associated with different technologies may overlap, but the different geographic coverage areas 110 may be supported by the same base station 105. In other examples, overlapping geographic coverage areas 110 associated with different technologies may be supported by different base stations 105. Wireless communication system 100 may include, for example, a heterogeneous network, in which different types of base stations 105 use the same or different radio access technologies to provide coverage to various geographic coverage areas 110.
[0099] The wireless communication system 100 can support synchronous or asynchronous operation. For synchronous operation, base stations 105 can have similar frame timing, and transmissions from different base stations 105 can be approximately time-aligned. For asynchronous operation, base stations 105 can have different frame timing, and transmissions from different base stations 105 may not be time-aligned in some examples. The techniques described herein can be used for both synchronous and asynchronous operation.
[0100] Some UE 115 devices (such as MTC or IoT devices) can be low-cost or low-complexity devices and can provide automated communication between machines (e.g., via machine-to-machine (M2M) communication). M2M communication or MTC can refer to data communication technologies that allow devices to communicate with each other or with base station 105 without human intervention. In some examples, M2M communication or MTC may include communication from devices that have integrated sensors or meters to measure or capture information and relay such information to a central server or application that uses the information or presents it to people interacting with the application. Some UE 115 devices may be designed to collect information or automate the behavior of machines or other devices. Examples of applications for MTC devices include: smart metering, inventory monitoring, water level monitoring, equipment monitoring, healthcare monitoring, wilderness survival monitoring, weather and geographic event monitoring, queue management and tracking, remote security sensing, physical access control, and transaction-based commercial toll collection.
[0101] Some UEs 115 can be configured to operate in reduced-power modes, such as half-duplex communication (e.g., a mode that supports unidirectional communication via transmission or reception but not simultaneous transmission and reception). In some examples, half-duplex communication can be performed at a reduced peak rate. Other power-saving techniques for UEs 115 include entering a power-saving deep sleep mode when not engaged in active communication, operating on limited bandwidth (e.g., according to narrowband communication), or a combination of these techniques. For example, some UEs 115 can be configured to operate using a narrowband protocol type associated with a defined portion or range (e.g., subcarriers or resource block (RB) set) within the carrier, within the carrier's guard band, or outside the carrier.
[0102] Wireless communication system 100 may be configured to support ultra-reliable communication or low latency communication, or various combinations thereof. For example, wireless communication system 100 may be configured to support ultra-reliable low latency communication (URLLC) or mission-critical communication. UE 115 may be designed to support ultra-reliable, low latency, or mission-critical functions (e.g., mission-critical functions). Ultra-reliable communication may include private or group communication and may be supported by one or more mission-critical services, such as Mission-Critical Talk-to-Talk (MCPTT), Mission-Critical Video (MCVideo), or Mission-Critical Data (MCData)). Support for mission-critical functions may include prioritization of services, and mission-critical services may be used for public safety or general business applications. The terms ultra-reliable, low latency, mission-critical, and ultra-reliable low latency are used interchangeably herein.
[0103] In some examples, UE 115 may also be able to communicate directly with other UE 115 on a device-to-device (D2D) communication link 135 (e.g., using a peer-to-peer (P2P) or D2D protocol). One or more UE 115s utilizing D2D communication may be within the geographic coverage area 110 of base station 105. Other UE 115s in such a group may be outside the geographic coverage area 110 of base station 105 or may be unable to receive transmissions from base station 105 for other reasons. In some examples, groups of UE 115s communicating via D2D communication may utilize a one-to-many (1:M) system, where each UE 115 transmits to every other UE 115 in the group. In some examples, base station 105 facilitates the scheduling of resources for D2D communication. In other cases, D2D communication is performed between the individual UE 115s without involving base station 105.
[0104] In some systems, the D2D communication link 135 may be an example of a communication channel (such as a sidelink communication channel) between vehicles (e.g., UE 115). In some examples, vehicles may communicate using vehicle-to-vehicle (V2X) communication, vehicle-to-vehicle (V2V) communication, or some combination of these communications. Vehicles may signal information related to traffic conditions, signaling, weather, safety, emergencies, or any other information relevant to the V2X system. In some examples, vehicles in a V2X system may communicate via vehicle-to-network (V2N) communication through one or more network nodes (e.g., base station 105) with roadside infrastructure (such as roadside units), or with the network, or with both.
[0105] Core network 130 provides user authentication, access authorization, tracking, Internet Protocol (IP) connectivity, and other access, routing, or mobility functions. Core network 130 can be an evolved packet core (EPC) or a 5G core (5GC). The EPC or 5GC may include at least one control plane entity (e.g., a Mobility Management Entity (MME), Access and Mobility Management Function (AMF)) for managing access and mobility, and at least one user plane entity (e.g., a Serving Gateway (S-GW), Packet Data Network (PDN) Gateway (P-GW), or User Plane Function (UPF)) for routing packets or interconnecting to external networks. The control plane entity manages non-access stratum (NAS) functions, such as mobility, authentication, and bearer management of UE 115 served by base station 105 associated with core network 130. User IP packets can be delivered through the user plane entity, which provides IP address allocation and other functions. The user plane entity can connect to network operator IP service 150. Carrier IP services 150 may include access to the Internet, intranets, IP Multimedia Subsystem (IMS), or packet-switched streaming services.
[0106] Some network devices (such as base station 105) may include sub-components, such as access network entity 140, which may be an example of an access node controller (ANC). Each access network entity 140 may communicate with each UE 115 through one or more other access network transport entities 145, which may be referred to as a radio headend, smart radio headend, or transmit / receive point (TRP). Each access network transport entity 145 may include one or more antenna panels. In some configurations, the various functions of each access network entity 140 or base station 105 may be distributed across various network devices (e.g., radio headends and ANCs) or combined into a single network device (e.g., base station 105).
[0107] Wireless communication system 100 can operate using one or more frequency bands, sometimes in the range of 300 MHz to 300 GHz. Generally, the 300 MHz to 3 GHz band is referred to as the Ultra High Frequency (UHF) band or decimeter band because the wavelengths range from about 1 decimeter to 1 meter. UHF waves can be blocked or redirected by buildings and environmental features, but these waves can penetrate various structures sufficiently for macrocells to provide service to UE 115 located indoors. Compared to transmissions using smaller frequencies and longer waves in the High Frequency (HF) or Very High Frequency (VHF) portions of the spectrum below 300 MHz, UHF wave transmission can be associated with smaller antennas and shorter ranges (e.g., less than 100 km).
[0108] The wireless communication system 100 can also operate in the ultra-high frequency (SHF) zoning using a frequency band from 3 GHz to 30 GHz (also known as the centimeter band) or in the extremely high frequency (EHF) zoning using a spectrum (e.g., from 30 GHz to 300 GHz) (also known as the millimeter band). In some examples, the wireless communication system 100 can support millimeter-wave (mmW) communication between the UE 115 and the base station 105, and the EHF antennas of the corresponding devices can be smaller and more closely spaced than UHF antennas. In some examples, this can facilitate the use of antenna arrays within the device. However, the propagation of EHF transmissions may suffer even greater atmospheric attenuation and shorter range than SHF or UHF transmissions. The techniques disclosed herein can be employed across transmissions using one or more different frequency zonings, and the frequency band usage specified across these frequency zonings may vary by country or regulatory authority.
[0109] Wireless communication system 100 may utilize both licensed and unlicensed radio spectrum bands. For example, wireless communication system 100 may employ licensed assisted access (LAA), LTE unlicensed (LTE-U) radio access technology, or NR technology in unlicensed frequency bands (such as the 5 GHz Industrial, Scientific, and Medical (ISM) band). When operating in unlicensed radio spectrum bands, devices (such as base station 105 and UE 115) may employ carrier sensing for collision detection and avoidance. In some examples, operation in unlicensed frequency bands may be based on carrier aggregation configuration (e.g., LAA) in coordination with component carriers operating in licensed frequency bands. Operation in unlicensed spectrum may include downlink transmissions, uplink transmissions, P2P transmissions, or D2D transmissions, etc.
[0110] Base station 105 or UE 115 may be equipped with multiple antennas that can be used to employ technologies such as transmit diversity, receive diversity, multiple-input multiple-output (MIMO) communication, or beamforming. The antennas of base station 105 or UE 115 may be located within one or more antenna arrays or antenna panels that can support MIMO operation or transmit or receive beamforming. For example, one or more base station antennas or antenna arrays may coexist at an antenna assembly (such as an antenna tower). In some examples, the antennas or antenna arrays associated with base station 105 may be located in different geographical locations. Base station 105 may have an antenna array with several rows and columns of antenna ports that base station 105 can use to support beamforming for communication with UE 115. Similarly, UE 115 may have one or more antenna arrays that can support various MIMO or beamforming operations. Additionally or alternatively, the antenna panel may support radio frequency beamforming for signals transmitted via the antenna ports.
[0111] Base station 105 or UE 115 can use MIMO communication to leverage multipath signal propagation and improve spectral efficiency by transmitting or receiving multiple signals via different spatial layers. This technique is known as spatial multiplexing. For example, a transmitting device may transmit multiple signals via different antennas or different combinations of antennas. Similarly, a receiving device may receive multiple signals via different antennas or different combinations of antennas. Each of the multiple signals may be referred to as a separate spatial stream and may carry bits associated with the same data stream (e.g., the same codeword) or different data streams (e.g., different codewords). Different spatial layers may be associated with different antenna ports used for channel measurement and reporting. MIMO techniques include single-user MIMO (SU-MIMO), where multiple spatial layers are transmitted to the same receiving device; and multi-user MIMO (MU-MIMO), where multiple spatial layers are transmitted to multiple devices.
[0112] Beamforming (also known as spatial filtering, directional transmission, or directional reception) is a signal processing technique that can be used at a transmitting or receiving device (e.g., base station 105, UE 115) to shape or guide an antenna beam (e.g., a transmit beam, a receive beam) along a spatial path between the transmitting and receiving devices. Beamforming can be achieved by combining signals transmitted via antenna elements of an antenna array, such that some signals propagating relative to a particular orientation of the antenna array experience constructive interference, while others experience destructive interference. Adjustments to the signals transmitted via the antenna elements may include the transmitting or receiving device applying amplitude offset, phase offset, or both to the signals carried via the antenna elements associated with that device. The adjustments associated with each antenna element may be defined by a beamforming weight set associated with a particular orientation (e.g., the antenna array relative to the transmitting or receiving device, or relative to some other orientation).
[0113] Base station 105 or UE 115 may use beamsweeping techniques as part of beamforming operations. For example, base station 105 may use multiple antennas or antenna arrays (e.g., antenna panels) for beamforming operations to facilitate directional communication with UE 115. Some signals (e.g., synchronization signals, reference signals, beam selection signals, or other control signals) may be transmitted multiple times by base station 105 in different directions. For example, base station 105 may transmit signals based on different beamforming weight sets associated with different transmission directions. Transmissions in different beam directions may be used (e.g., by the transmitting device (such as base station 105) or the receiving device (such as UE 115)) to identify the beam direction that base station 105 uses for later transmission or reception.
[0114] Some signals (such as data signals associated with a specific receiving device) may be transmitted by base station 105 in a single beam direction (e.g., the direction associated with the receiving device (such as UE 115)). In some examples, the beam direction associated with transmission along a single beam direction may be determined based on the signals transmitted in one or more beam directions. For example, UE 115 may receive one or more signals transmitted by base station 105 in different directions and may report to base station 105 an indication of the signals received by UE 115 with the highest signal quality or other acceptable signal quality.
[0115] In some examples, transmissions performed by a device (e.g., by base station 105 or UE 115) may be executed using multiple beam directions, and the device may use a combination of digital precoding or radio frequency beamforming to generate combined beams for transmission (e.g., from base station 105 to UE 115). UE 115 may report feedback indicating precoding weights for one or more beam directions, and this feedback may correspond to a configured number of beams across the system bandwidth or one or more subbands. Base station 105 may transmit reference signals that can be precoded or unprecoded (e.g., cell-specific reference signals (CRS), channel state information reference signals (CSI-RS)). UE 115 may provide feedback for beam selection, which may be a precoding matrix indicator (PMI) or codebook-based feedback (e.g., multi-panel type codebook, linear combination type codebook, port selection type codebook). Although these techniques are described with reference to signals transmitted by base station 105 in one or more directions, UE 115 may use similar techniques to transmit signals multiple times in different directions (e.g., to identify the beam direction used by UE 115 for subsequent transmission or reception) or to transmit signals in a single direction (e.g., to transmit data to a receiving device).
[0116] A receiver device (e.g., UE 115) may attempt multiple receive configurations (e.g., directional listening) when receiving various signals (such as synchronization signals, reference signals, beam selection signals, or other control signals) from base station 105. For example, the receiver device may attempt multiple receive directions by: receiving via different antenna subarrays; processing received signals according to different antenna subarrays; receiving according to different sets of receive beamforming weights applied to signals received at multiple antenna elements of the antenna array (e.g., different directional listening weight sets); or processing received signals according to different sets of receive beamforming weights applied to signals received at multiple antenna elements of the antenna array, any of which may be referred to as "listening" according to different receive configurations or receive directions. In some examples, the receiver device may use a single receive configuration to receive along a single beam direction (e.g., when receiving a data signal). The single receive configuration may be aligned on a beam direction determined based on listening according to different receive configuration directions (e.g., a beam direction determined to have the highest signal strength, highest signal-to-noise ratio (SNR), or other acceptable signal quality based on listening according to multiple beam directions).
[0117] The wireless communication system 100 can be a packet-based network operating according to a layered protocol stack. In the user plane, communication at the bearer or Packet Data Convergence Protocol (PDCP) layer can be IP-based. The Radio Link Control (RLC) layer performs packet segmentation and reassembly for communication on logical channels. The Media Access Control (MAC) layer performs priority handling and multiplexing of logical channels into transport channels. The MAC layer can also use error detection, error correction, or both to support MAC layer retransmissions to improve link efficiency. In the control plane, the Radio Resource Control (RRC) protocol layer can provide the establishment, configuration, and maintenance of RRC connections between the UE 115 and the base station 105 or core network 130 that support user plane data radio bearers. At the physical layer, transport channels can be mapped to physical channels.
[0118] UE 115 and base station 105 can support data retransmission to increase the likelihood of successful data reception. Hybrid Automatic Repeat Request (HARQ) feedback is a technique used to increase the likelihood of correctly receiving data on communication link 125. HARQ may include a combination of error detection (e.g., using Cyclic Redundancy Check (CRC)), forward error correction (FEC), and retransmission (e.g., Automatic Repeat Request (ARQ)). HARQ can improve MAC layer throughput in poor radio conditions (e.g., low signal-to-noise ratio conditions). In some examples, the device may support simultaneous time-slot HARQ feedback, where the device can provide HARQ feedback in a specific time slot for data received in previous symbols within that time slot. In other cases, the device may provide HARQ feedback in subsequent time slots or according to some other time interval.
[0119] UE 115 can transmit signals including payloads (e.g., multi-bit payloads) to base station 105 using sequences (or code points) selected from a sequence set in a resource allocation. In some cases, the resource allocation can be an uplink control channel, such as a Physical Uplink Control Channel (PUCCH). Each sequence in the sequence set can have a length corresponding to the number of resource elements in the resource allocation. For example, UE 115 can use a resource allocation of N OFDM symbols and M frequency modulations (e.g., subcarriers), and therefore, each sequence in the sequence set can have a length equal to N*M. The number of sequences in the sequence set can be based on the type of the sequence set. For example, in an example where the sequence set includes non-orthogonal sequences, the sequence set can be any arbitrary number. Alternatively, in an example where the sequence set includes orthogonal sequences, the number of sequences in the sequence set can be based on the number of N OFDM symbols and M frequency modulations in the resource allocation. For example, in such an example where the sequence set includes orthogonal sequences, the number of sequences in the sequence set can be equal to N*M.
[0120] In some implementations of this disclosure, UE 115 may use sequences selected from a sequence pool associated with UE 115 to transmit signals including payloads to base station 105, wherein the sequence pool associated with UE 115 comprises a subset of a sequence set. In some examples, UE 115 may generate or otherwise determine the sequence pool associated with UE 115 based on configuration received from base station 105 for partitioning the sequence set. In some aspects, the sequence pool may include consecutive (e.g., non-interleaved) sequences from the sequence set. In some other aspects, the sequence pool may include sequences (e.g., individual sequences or sequence blocks) interleaved with other sequences in the sequence set or other sequence pools.
[0121] UE 115 may determine or otherwise select a subset of sequences for conveying a payload from a sequence pool associated with UE 115. In some examples, the size of this subset of sequences may be based on the size of the payload (e.g., the number of bits in the payload). For example, UE 115 may identify that the payload comprises a certain number of bits and may select a certain number of sequences from the sequence pool associated with UE 115 based on that number of bits. In some aspects, UE 115 may construct a codebook comprising a subset of sequences from the sequence pool associated with UE 115. UE 115 may select sequences from this subset of sequences based on a bitstream of the payload. For example, UE 115 may determine that the payload is associated with a bitstream (e.g., a certain number of consecutive values of bits) and may determine a value corresponding to that bitstream based on a mapping. UE 115 may use this value to select sequences from the subset of sequences based on an index in the constructed codebook. For example, UE 115 can select a sequence from a constructed codebook based on an index associated with each sequence in the codebook and by mapping (i.e., matching) values determined based on the bitstream to the indexes in the codebook. In this way, UE 115 can select a sequence associated with an index value mapped to the bitstream of the payload, and can use the selected sequence to transmit a payload including that number of bits. Although described in the context of UE 115, base station 105 can perform similar or complementary operations and can use the selected sequence to receive a payload including that number of bits.
[0122] Figure 2Examples of a wireless communication system 200 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure are described. In some examples, the wireless communication system 200 may implement aspects of the wireless communication system 100. The wireless communication system 200 may include a UE 115-a and a base station 105-a, which may be examples of corresponding devices described herein. The UE 115-a and the base station 105-a may communicate via a communication link 205 within a geographic coverage area 110-a. In some examples, the UE 115 may transmit a signal including a payload 210 to the base station 105-a via the communication link 205. The payload 210 may occupy a resource allocation of N OFDM symbols 215 and M frequency modulations 220, and the UE 115 may use a sequence based on the N OFDM symbols 215 and M frequency modulations 220 to convey the payload 210.
[0123] As described herein, N can correspond to any quantity or number, but is sometimes defined in the range of 1 to 14. Similarly, M can correspond to any quantity or number, but is sometimes defined in the range of 1 to 12. In some cases, such as when N = 14 and M = 12, the resource allocation can be a resource block. Furthermore, as described herein, payload 210 can be an example of any signal that includes information (e.g., a certain number of bits), and although described in the context of a transmission from UE 115-a, payload 210 can be transmitted by either UE 115-a or base station 105-a. In some examples, payload 210 can be an example of uplink control information, and accordingly UE 115-a can use the resource allocation of the PUCCH to transmit payload 210. In such examples, N OFDM symbols 215 and M frequency modulations 220 can correspond to the time and frequency resource grids assigned to the PUCCH for UE 115-a to transmit payload 210.
[0124] In some examples, UE 115-a and base station 105-a can support sequence-based transmission, and UE 115-a can transmit payload 210 over resource allocation using a selected sequence (or code points). For UE 115-a to be able to transmit payload 210 over resource allocation, the sequence can have a length corresponding to the number of resource elements in the resource allocation. For example, UE 115 can use a resource allocation of N OFDM symbols 215 and M frequency modulations 220, and therefore UE 115-a can use a sequence with a length equal to N*M. In some cases, UE 115-a can use a non-orthogonal sequence to transmit payload 210. In other cases, UE 115-a can use an orthogonal sequence to transmit payload 210. In some aspects, orthogonal sequences can enable UE 115-a to meet the low latency or high reliability constraints of the wireless communication system 200, which increases the likelihood of successful communication between UE 115-a and base station 105-a. In either case, UE 115-a may select a sequence from a set of sequences associated with resource allocation (e.g., a set of all sequences with a length equal to N*M).
[0125] Some resource allocations (such as PUCCH resource allocation) can be associated with different formats for implementing multi-user designs. For example, in cases where the resource allocation is PUCCH, PUCCH format 0, 1, or 4 can support a multi-user design, and thus, multiple users (e.g., first UE 115-a and second UE 115-a) can share the same PUCCH resources. However, in some cases, sequence-based transmissions on PUCCH may not support such multi-user designs.
[0126] In some implementations of this disclosure, UE 115-a or base station 105-a, or both, may identify a set of sequences and determine a configuration for dividing that set of sequences into different sequence pools, each of which may be used by a different UE 115-a. For example, UE 115-a may select a sequence from one sequence pool to convey payload 210, while other UE 115-a may select sequences from different sequence pools to convey payload. For example, base station 105-a may determine a configuration for dividing the set of sequences and transmit that configuration to UE 115-a. UE 115-a may receive the configuration and, based on the configuration, generate or otherwise determine a sequence pool associated with UE 115-a (e.g., from which UE 115-a may select a sequence pool).
[0127] Base station 105-a may transmit this configuration to a number of other UEs 115-a besides UE 115-a, and each of the other UEs 115-a may similarly generate or otherwise determine a different sequence pool based on this configuration. For example, base station 105-a may transmit a configuration for partitioning the sequence set to a first UE 115-a and a second UE 115-a. The first UE 115-a may determine a first sequence pool associated with the first UE 115-a based on this configuration. Similarly, the second UE 115-a may determine a second sequence pool associated with the second UE 115-a based on this configuration. Therefore, the first UE 115-a and the second UE 115-a can select sequences from different sequence pools, which allows the first UE 115-a and the second UE 115-a to use the same resource allocation (e.g., the same N OFDM symbols 215 and M frequency modulations 220) to transmit the first payload 210 to the base station 105-a and the second payload 210 to the base station 105-a, respectively.
[0128] In examples where the sequence set includes non-orthogonal sequences, UE 115-a or base station 105-a, or both, can determine the sequence pool associated with UE 115-a based on one or more parameters and a pseudo-random number generator (e.g., a pseudo-random sequence generator). For example, UE 115-a or base station 105-a, or both, can use an initial seed as input to the pseudo-random number generator to determine the sequence pool associated with UE 115-a. For example, UE 115-a or base station 105-a, or both, can determine the initial seed based on UE ID, slot ID, frame ID, or any combination thereof (e.g., the initial seed can be a function of UE ID, slot ID, frame ID, or any combination thereof), and can use this initial seed as input to the pseudo-random number generator. In some aspects, base station 105-a can determine the value of the initial seed and can signal the initial seed to UE 115-a. In this respect, base station 105-a can use an initial seed to align the sequence pool generated using that initial seed with other sequence pools associated with other UEs 115-a. Based on the use of a pseudo-random number generator, if UE 115-a and base station 105-a use the same input (e.g., the same initial seed derived from the same UE ID, the same slot ID, the same frame ID, or any combination thereof), then UE 115-a and base station 105-a can determine the same sequence pool.
[0129] In an example where the sequence set includes orthogonal sequences, UE 115-a or base station 105-a, or both, may determine the sequence pool associated with UE 115-a before or after generating the sequence set. In an example where UE 115-a or base station 105-a, or both, determines the sequence pool associated with UE 115-a before generating the sequence set, UE 115-a, base station 105-a, or both may identify a subset of indices of the orthogonal matrix that UE 115-a, base station 105-a, or both can use to generate the orthogonal sequences, as well as a subset of indices of the base sequences. In some aspects, UE 115-a, base station 105-a, or both may identify the subset of indices of the orthogonal matrix and the subset of indices of the base sequences based on a configuration used to partition the sequence set. In some cases, the indices of the orthogonal matrix may correspond to rows or columns of the orthogonal matrix, and the indices of the base sequences may correspond to cyclic shifts of the base sequences (e.g., cyclic shift indices). Therefore, UE 115-a or base station 105-a, or both, can select rows or columns of an orthogonal matrix corresponding to a subset of the indexes of the orthogonal matrix, and can select cyclic shifts of the base sequence based on a subset of the indexes of the base sequence, and can generate a sequence pool associated with UE 115-a based on the product of the selected row or column of the orthogonal matrix and the selected cyclic shift of the base sequence. This document (including references) Figure 5A and 5B This describes additional details related to sequence pooling, which uses orthogonal matrices and basis sequences to generate orthogonal sequences.
[0130] In an example where UE 115-a or base station 105-a, or both, determines the sequence pool associated with UE 115-a after generating a sequence set (e.g., an orthogonal sequence set), UE 115-a, base station 105-a, or both may initially generate the sequence set based on the product of an orthogonal matrix and a base sequence. For example, UE 115-a, base station 105-a, or both may determine the product of all rows or columns of the orthogonal matrix and all cyclic shifts of the base sequence to generate an orthogonal sequence set associated with resource allocation. In some examples, the number of orthogonal sequences in the orthogonal sequence set generated by UE 115-a, base station 105-a, or both may be based on the resource allocation used to convey payload 210. For example, base station 105-a may allocate N OFDM symbols 215 and M frequency modulations 220 for the transmission of payload 210, and therefore, UE 115-a, base station 105-a, or both may generate a sequence number equal to N*M. Therefore, UE 115-a or base station 105-a or both can generate a set with N*M orthogonal sequences.
[0131] When generating a sequence set (e.g., a set of N*M orthogonal sequences), UE 115-a or base station 105-a, or both, may identify an index subset of the orthogonal matrix and an index subset of the base sequences based on a configuration used to partition the sequence set, and may determine which sequences in the sequence set to include in the sequence pool associated with UE 115-a based on the index subsets of the orthogonal matrix and the base sequences. For example, UE 115-a or base station 105-a, or both, may determine which sequences correspond to the index subsets of the orthogonal matrix and the base sequences (e.g., the product of the index subsets of the orthogonal matrix and the base sequences), and may select such sequences for use in the sequence pool associated with UE 115-a. Additionally or alternatively, UE 115-a or base station 105-a, or both, may determine the sequence pool associated with UE 115-a based on identifying consecutive sequence blocks in the sequence set that address to the sequence pool associated with UE 115-a. In some examples, addressing of consecutive sequence blocks to the sequence pool associated with UE 115-a may be included in this configuration. Alternatively, UE 115-a or base station 105-a may determine the sequence pool associated with UE 115-a based on an identifier interleaving granularity value, as referenced Figure 4 A more detailed description.
[0132] In any of the above examples (i.e., generating a sequence pool including non-orthogonal sequences, generating a sequence pool including orthogonal sequences, or determining a sequence pool from a generated set of orthogonal sequences), UE 115-a or base station 105-a, or both, may determine a subset of sequences from the sequence pool associated with UE 115-a based on payload 210. For example, UE 115-a or base station 105-a, or both, may determine the size of payload 210 (e.g., the number of bits included in payload 210) and may determine a subset of sequences from the sequence pool associated with UE 115-a based on the size of payload 210. For example, payload 210 may include a number of bits equal to K, and accordingly, the number of sequences within the determined subset of sequences may be based on the value of K. For example, in some implementations, UE 115-a or base station 105-a, or both, may select a subset of sequences equal to 2 based on identifying that payload 210 includes K bits. K The number of sequences is used to include them in the sequence subset. In some cases, UE 115-a or base station 105-a or both can be selected as 2. K There are 2 sequences, because 2 K A sequence can provide a sequence for each possible value (i.e., permutation) of K bits.
[0133] In some implementations, UE 115-a or base station 105-a, or both, can determine 2 from the sequence pool associated with UE 115-a based on achieving the maximum interval between sequences in the sequence pool associated with UE 115-a. K A sequence. For example, UE 115-a or base station 105-a, or both, can be selected from a pool of sequences associated with UE 115-a that have the largest interval or distance between them. K A subset of sequences is determined from a sequence pool associated with UE 115-a using two sequences. In some other implementations, base station 105-a can signal the interval or offset between each sequence in the sequence subset associated with UE 115-a, and UE 115-a can determine the subset of sequences based on the signaled interval or offset. K Two sequences. In some examples where the sequence pool associated with UE 115-a includes orthogonal sequences, UE 115-a or base station 105-a, or both, can determine two sequences from the sequence pool associated with UE 115-a based on achieving a maximum interval (or a signaled interval) between the indices of the orthogonal matrix (e.g., a subset of the indices of the orthogonal matrix) and the indices of the base sequences (e.g., a subset of the indices of the base sequences). K Two sequences. In such an example, UE 115-a and base station 105-a can implement intervals in the time and frequency domains. In some aspects, base station 105-a can signal the starting index of the sequence pool associated with UE 115-a, and UE 115-a can start selecting 2 sequences from the sequence pool associated with UE 115-a at the sequence corresponding to that starting index. K A sequence.
[0134] Thus, UE 115-a or base station 105-a, or both, can identify a subset of sequences from which UE 115-a can select sequences for conveying payload 210 (e.g., 2...). K (A subset of sequences). UE 115-a or base station 105-a, or both, may include the selected subset of sequences in the constructed codebook. In some aspects, UE 115 or base station 105-a, or both, may construct a codebook such that each sequence in the subset of sequences in the codebook is associated with an index in the codebook. Base station 105-a may additionally identify subsets of sequences in other sequence pools associated with other UE 115-a. For example, the sequence set may be divided into i sequence pools, and base station 105-a and each i-th UE 115-a may identify from the i-th sequence pool. A sequence (for example, each i-th UE 115-a can transmit K) i The payload (a number of bits) is included in the i-th codebook.
[0135] UE 115-a can select sequences from a subset of sequences (e.g., from a constructed codebook) to convey payload 210 based on bits in payload 210. For example, UE 115-a can identify a bit stream of payload 210 (e.g., a sequence of consecutive bits) and can select sequences from a codebook based on that bit stream. The bit stream can be represented as b0, b1, b2, ..., b K-1 Here, b corresponds to a bit value and K is equal to the number of bits in payload 210. In some implementations, UE 115-a can convert the bit stream into a number (e.g., a decimal number), such as K, which may correspond to a sequence in a subset of sequences. For example, K may correspond to or map to an index in the codebook of the subset of sequences. Thus, UE 115-a can convert the bit stream of payload 210 into the value K and can determine which sequence in the subset of sequences corresponds to the index value K (e.g., UE 115-a may choose or otherwise determine the Kth sequence in the constructed codebook). Accordingly, UE 115-a can select the sequence corresponding to the index value K and can use the selected sequence to transmit payload 210.
[0136] The UE 115-a and base station 105-a implementing the described technology can divide the set of sequences associated with resource allocation into multiple distinct (e.g., non-overlapping) sequence pools, each associated with a different UE 115-a. Thus, the wireless communication system 200 can support multi-user designs for sequence-based transmissions (e.g., sequence-based transmissions on the uplink control channel). For example, multiple UEs 115-a can transmit a payload using the same resource allocation based on selecting sequences from different sequence pools for conveying payload 210. Furthermore, UE 115-a or base station 105-a, or both, can efficiently construct codebooks of sequences from the sequence pool associated with UE 115-a and select a sequence from the sequences for conveying payload 210 based on the number of bits in payload 210. This increases the likelihood that base station 105-a can successfully receive payload 210 while avoiding unnecessary storage costs associated with storing the complete set of sequences. Furthermore, some implementations of the described technology can support and maintain a low peak-to-average power ratio (PAPR) associated with the transmission of payload 210, which allows UE 115-a to use more transmit power when transmitting payload 210.
[0137] Although described in the context of communication between base station 105-a and UE 115-a, similar operations and techniques can be applied to communication between two UEs 115-a. For example, as described herein, a first UE 115-a can determine a sequence pool associated with itself and select a sequence from a codebook for conveying payload 210, and can transmit payload 210 to a second UE 115-a on a sidelink channel. In such an example, the first UE 115-a can receive signaling from either base station 105-a or the second UE 115-a relating to determining the sequence pool and codebook associated with itself, in which case the signaling may originate from the second UE 115-a or the second UE 115-a may act as a relay node between base station 105-a and the first UE 115-a.
[0138] Furthermore, although this document describes the actions performed by UE 115-a, similar operations and techniques can be performed by base station 105-a. For example, base station 105-a can use techniques similar to those described as being performed by UE 115-a to select a sequence from a sequence pool associated with base station 105-a for transmitting payload 210. Base station 105-a can use the selected sequence to transmit the payload, which can increase the likelihood that UE 115-a (e.g., in the case of transmitting payload 210 on a downlink channel) or another base station 105-a (e.g., in the case of transmitting payload 210 on a sidelink channel or via a wireless backhaul connection) can successfully receive payload 210, while avoiding the unnecessary storage costs associated with storing the complete set of sequences. In some examples, base station 105-a can receive signaling from UE 115-a, another base station 105-a, and related to determining the sequence pool and codebook associated with base station 105-a, or can determine the sequence pool and codebook associated with base station 105-a without receiving signaling from another device. Furthermore, based on the described technology, base station 105-a can maintain a low PAPR associated with the transmission of payload 210, which allows base station 105-a to use greater transmit power when transmitting payload 210.
[0139] Figure 3An example sequence partition 300 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure is described. In some examples, sequence partitioning 300 can be implemented by implementing aspects of wireless communication system 100 and / or wireless communication system 200. Sequence partitioning 300 illustrates an example partitioning of a set of sequences 325 that can be used by multiple UEs 115 and base station 105 to communicate multiple payloads in resource allocation. In some examples, UE 115 (e.g., one of multiple UEs 115) or base station 105 can determine sequence partitioning 300 based on a configuration for partitioning the set of sequences 325. Base station 115 and UE 105 can be examples of corresponding devices as described herein.
[0140] As in this article (including references) Figure 2 As described in more detail, UE 115 can transmit payloads to base station 105 using selected sequences from a sequence pool associated with UE 115 in terms of resource allocation. UE 115, base station 105, or both can determine the sequence pool associated with UE 115 based on a configuration for partitioning sequence set 325. Sequence set 325 can include non-orthogonal or orthogonal sequences. Each sequence in sequence set 325 can have a length based on the size of the resource allocation used for transmitting the payload (e.g., the number of resource elements). For example, the resource allocation can include N OFDM symbols and M frequency modulations, and thus each sequence in the sequence set can have a length equal to N*M (e.g., the resource allocation can include N*M resource elements).
[0141] The sequence set 325 may include a number of sequences, P. In examples where the sequence set 325 includes non-orthogonal sequences, P can be any arbitrary number. In examples where the sequence set 325 includes orthogonal sequences, P can be equal to N*M. In some aspects, each sequence in the sequence set 325 may be a numerical sequence. In some examples of this disclosure, UE 115 or base station 105, or both, may divide the sequence set 325 into a number of distinct sequence pools. The number of sequence pools may be based on the number of UE 115s that can transmit payloads in the same resource allocation (e.g., in the same resource block). For example, four UE 115s may use the same resource allocation to transmit payloads, and each of the four UE 115s or base station 105 may divide the sequence set 325 into sequence pool 305, sequence pool 310, sequence pool 315, and sequence pool 320. Although four sequence pools and four UEs have been described and explained, the described techniques are applicable to any number of sequence pools (e.g., 2, 3, etc.) and any number of UE 115s (e.g., 2, 3, etc.).
[0142] In some examples, each of the four UEs 115 may receive a configuration for partitioning the sequence set 325 and may determine the sequence pool associated with that UE 115. For example, the first UE 115 may receive this configuration from base station 105 and may generate or otherwise determine a first sequence pool 305 associated with the first UE 115. In some examples, the first UE 115 may generate the first sequence pool 305 based on inputting an initial seed into a pseudo-random number generator. In some aspects, the first UE 115 may receive an indication of the UE ID from base station 105-a (e.g., the configuration received from base station 105-a may include the UE ID), identify a slot ID or frame ID based on the current time-domain location of the UE 115, and determine the initial seed based on the UE ID, slot ID, frame ID, or any combination thereof. Base station 105-a may similarly determine the sequence pool 305 associated with the first UE 115 based on inputting the initial seed into a pseudo-random number generator at base station 105. Base station 105 can also determine the initial seed based on UE ID (e.g., the UE ID associated with the first UE 115), slot ID, frame ID, or any combination thereof.
[0143] In some specific examples, UE 115 or base station 105, or both, can generate a sequence pool associated with UE 115 based on a maximum length sequence generator or a Gold sequence generator. The maximum length sequence generator can generate a maximum length sequence, which in some respects can be referred to as an m-sequence. A Gold sequence can be generated by selecting two maximum length sequences with the same length (e.g., 2). m -1) is used to generate. Two maximum-length sequences in each phase are 2... m -1 sets of XOR (i.e., XOR) sequences together form 2 m A set of +1 Gold sequences.
[0144] In some respects, base station 105-a can control or adjust the value of the initial seed (e.g., by controlling the UE ID) to align sequence pool 305 with other sequence pools in sequence set 325. For example, base station 105 can control the value of the initial seed to align sequence pool 305 with sequence pool 310 such that both sequence pool 305 and sequence pool 310 include sequences in sequence set 325 without overlap. For example, a maximum-length sequence generator or a Gold sequence generator can output a number of sequences, and based on the initial seed input to the maximum-length sequence generator or Gold sequence generator, the maximum-length sequence generator or Gold sequence generator can output sequences starting at different positions in sequence set 325 such that each output (e.g., each sequence pool) does not overlap with other outputs (e.g., other sequence pools) of the maximum-length sequence generator or Gold sequence generator. In some cases, the upper limit of the unique sequences (e.g., non-repeating sequences) that the maximum-length sequence generator or Gold sequence generator can generate is based on a shift register (e.g., a linear feedback shift register). For example, if the shift register is a 10-bit shift register (e.g., a length-10 register), then a maximum length sequence generator or a Gold sequence generator can generate up to 2... 10 (or 2) 10 + / - 1) unique sequences. For example, the set of sequences can be based on a polynomial (e.g., a maximum-length sequence generator, a Gold sequence generator, or other pseudo-random number generator can be deterministic and defined by a function (such as a polynomial), and for a 10-bit shift register, the order of the polynomial can be 2^32. 10 In this scenario, the maximum length sequence generator can output a sequence of length 2. 10 A sequence of -1, which can correspond to a sequence including 2 10 Sequences (or 2) 10 The set of sequences (+ / - 1 sequences) is 325.
[0145] Alternatively, the first UE 115 may generate sequence pool 305 based on the product of an index subset of the orthogonal matrix and an index subset of the base sequence. In some examples, the first UE 115 may identify the index subset of the orthogonal matrix and the index subset of the base sequence based on a configuration received from the base station 105. This generation of sequence pool 305 may be an example of constructing sequence pool 305 by partitioning the orthogonal matrix and the base sequence before determining the product of the orthogonal matrix and the base sequence. In some cases, the orthogonal matrix may be a DFT matrix, and therefore partitioning the orthogonal matrix may be equivalently referred to as partitioning the DFT domain. Similarly, the base sequence may be a cyclically shifted base sequence, and therefore partitioning the base sequence may be equivalently referred to as partitioning the cyclically shifted domain.
[0146] In some examples, the configuration for partitioning the sequence set 325 can divide each of the orthogonal matrix and the base sequence into a number of distinct index subsets (e.g., where the index of the orthogonal matrix refers to a row or column of the orthogonal matrix, and the index of the base sequence refers to a cyclic shift of the base sequence). For example, this configuration can indicate a first index subset of the orthogonal matrix, a second index subset of the orthogonal matrix, a first index subset of the base sequence, and a second index subset of the base sequence, and also indicate which index subset the first UE 115 can use to generate the sequence pool 305. In such an example, the first index subset of the orthogonal matrix may include half of the rows or columns of the orthogonal matrix, and the second index subset of the orthogonal matrix may include the other half. Similarly, the first index subset of the base sequence may include half of the cyclic shift index of the base sequence, and the second index subset of the base sequence may include the other half. Thus, the first UE 115 can generate the sequence pool by determining the product (e.g., the Kronecker product) of either the first or second index subset of the orthogonal matrix with either the first or second index subset of the base sequence. Figure 5A and 5B Additional details related to this generation of sequence pool 305 are described.
[0147] Alternatively, the first UE 115 may determine the sequence pool 305 based on the generated sequence set 325 and by selecting sequences from the generated sequence set 325. In some examples, the first UE 115 may generate the sequence set based on determining the product of an orthogonal matrix (e.g., a complete non-partitioned orthogonal matrix) and a base sequence (e.g., all cyclic shift indices of the base sequence), as referenced. Figure 5A and 5B In a more detailed description, in some implementations, UE 115-a may select consecutive (e.g., non-interleaved) sequences from sequence set 325. For example, UE 115 may determine which consecutive sequence blocks in sequence set 325 to include in sequence pool 305 based on a configuration used to partition sequence set 325. In such an example, the configuration may include an instruction to perform consecutive partitioning for UE 115 and an instruction on which consecutive sequence blocks belong to sequence pool 305 associated with UE 115. In some aspects, such consecutive partitioning may increase the distance between sequences used by different UEs 115, which may result in lower inter-UE interference. In some other implementations, UE 115-a may select sequences from sequence set 325 that are interleaved with other sequences in sequence set 325, as referred to Figure 4 More detailed description.
[0148] The second UE 115, the third UE 115, and the fourth UE 115 can similarly receive this configuration from the base station 105, and can respectively generate or otherwise determine sequence pools 310, 315, and 320. Therefore, the first UE 115 can select a first subset of sequences from sequence pool 305 to construct a first codebook, the second UE 115 can select a second subset of sequences from sequence pool 310 to construct a second codebook, the third UE 115 can select a third subset of sequences from sequence pool 315 to construct a third codebook, and the fourth UE 115 can select a fourth subset of sequences from sequence pool 320 to construct a fourth codebook.
[0149] Furthermore, although described in the context of four UEs 115, base station 105 can perform operations similar to or complementary to those of each of the four UEs 115 to determine which sequence pools of sequence set 325 can be used by each of the four UEs 115. For example, base station 105 can determine that sequence pool 305 is associated with the first UE 115, sequence pool 310 with the second UE 115, sequence pool 315 with the third UE 115, and sequence pool 320 with the fourth UE 115, and can transmit configurations to the four UEs 115 for dividing the sequence set into four sequence pools. Therefore, base station 105 can configure each of the four UEs 115 to generate or otherwise determine four different sequence pools and use these four different sequence pools to select the sequence for conveying the payload. Thus, each of the four UEs 115 can convey payloads to base station 105 using different sequences on the same resource allocation.
[0150] Figure 4 An example sequence partitioning 400 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure is described. In some examples, sequence partitioning 400 can be implemented by implementing various aspects of wireless communication system 100 and / or wireless communication system 200. Sequence partitioning 400 describes an example partitioning of a set 425 of sequences that can be used by multiple UEs 115 and base station 105 to communicate payloads in resource allocation. In some examples, UE 115 (e.g., one of multiple UEs 115) or base station 105 or both can determine sequence partitioning 400 based on a configuration used to partition the set 425 of sequences. Base station 115 and UE 105 can be examples of corresponding devices as described herein.
[0151] Sequence partitioning 400 illustrates an example of interleaved partitioning, where each sequence pool can be interleaved with other sequence pools in sequence set 425. Sequence set 425 can include non-orthogonal or orthogonal sequences. Each sequence in sequence set 425 can have a length based on the size of the resource allocation used to transmit the payload (e.g., the number of resource elements). For example, the resource allocation can include N OFDM symbols and M frequency modulations, and thus each sequence in the sequence set can have a length equal to N*M (e.g., the resource allocation can include N*M resource elements). Sequence set 425 can include a number of sequences of quantity P. In the example where sequence set 425 includes non-orthogonal sequences, P can be any arbitrary number. In the example where sequence set 425 includes orthogonal sequences, P can be equal to N*M. In some aspects, each sequence in sequence set 425 can be a digital sequence.
[0152] In some examples of this disclosure, base station 105 may determine a configuration for dividing sequence set 425 into four sequences (where each sequence can be used by a different UE 115), and may determine an interleaving granularity value L for interleaving the four sequences. In some aspects, base station 105 may configure L to interleave the sequence pool in blocks of L sequences (e.g., L > 1), or configure L to interleave the sequence pool per sequence (e.g., L = 1). In some aspects, base station 105 may configure the interleaving granularity L at each different UE 115 via RRC signaling.
[0153] In some examples, the first UE 115 may identify (e.g., in some implementations, based on the product of an orthogonal matrix and a base sequence) a sequence set 425, and may select or otherwise determine which sequences in the sequence set 425 to be included in the sequence pool 405 associated with the first UE 115 based on the interleaving granularity L, the sequence pool using the same sequence set 425, or the number of UEs 115 (e.g., four), and in some cases, the starting index or relative position of the first UE 115 relative to other UEs 115 using the same sequence set 425. For example, the first UE 115 may identify the starting index from which to select sequences from the sequence set 425 to be included in the sequence pool 405 associated with the first UE 115. As explained in sequence partitioning 400, the starting index of the sequences in the sequence pool 405 may be zero (e.g., the first or topmost sequence of the sequence set 425 may be included in the sequence pool 405). In some aspects, the starting index may be based on the relative position of the UEs 115. For example, the second UE 115 can be identified as the starting index L, the third UE 115 can be identified as the starting index 2*L, and the fourth UE 115 can be identified as the starting index 3*L.
[0154] When determining the starting index of sequence pool 405, the first UE 115 can determine the position of a first number of sequences corresponding to the next L sequences arising from that starting index in sequence pool 405. The first UE 115 can determine the position of a second number of sequences also in sequence pool 405 based on the number of sequence pools using the same sequence set 425 or the product of the number of UEs 115 and the interleaving granularity L. For example, in an example where sequence set 425 is divided into four sequence pools, the first UE 115 can determine the position of the second number of sequences starting from the last sequence of the first number of sequences in sequence pool 405, which equals 3*L. When identifying the position of the second number of sequences, the first UE 115 can determine the position of a second number of sequences corresponding to the next L sequences arising from the starting position of the second number of sequences in sequence pool 405. The first UE 115 can repeat this operation to identify interleaved sequences in sequence pool 405 until the UE 115 reaches the end of sequence set 425. In some examples, this interleaving partitioning can increase the distance between sequences used by UE 115 (e.g., increase the distance between sequences within a sequence pool), which can lead to lower intra-UE errors between different sequences.
[0155] The second UE 115, the third UE 115, and the fourth UE 115 can perform similar operations to identify the interleaved sequence pool sequences associated with each of the third UE 115, namely sequence pool 410, sequence pool 415, and sequence pool 420, respectively. Therefore, the first UE 115 can select a first subset of sequences from sequence pool 405 to construct a first codebook, the second UE 115 can select a second subset of sequences from sequence pool 410 to construct a second codebook, the third UE 115 can select a third subset of sequences from sequence pool 415 to construct a third codebook, and the fourth UE 115 can select a fourth subset of sequences from sequence pool 420 to construct a fourth codebook.
[0156] Furthermore, although described in the context of four UEs 115, base station 105 can perform operations similar to or complementary to those of each of the four UEs 115 to determine which sequence pools of sequence set 425 can be used by each of the four UEs 115. For example, base station 105 can determine that sequence pool 405 is associated with the first UE 115, sequence pool 410 with the second UE 115, sequence pool 415 with the third UE 115, and sequence pool 420 with the fourth UE 115, and can transmit a configuration to the four UEs 115 for dividing the sequence set into four sequence pools. Additionally, base station 105 can notify each of the four UEs 115 of the interleaving granularity L via RRC signaling. Thus, base station 105 can configure each of the four UEs 115 to generate or otherwise determine four different sequence pools and use these four different sequence pools to select the sequence for conveying the payload. Therefore, each of the four UEs 115 can transmit payloads to the base station 105 using a different sequence on the same resource allocation.
[0157] Figure 5A Examples of orthogonal matrix 500 and base sequence 501 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure are explained. In some examples, orthogonal matrix 500 and base sequence 501 may be implemented to implement aspects of wireless communication system 100 or wireless communication system 200. For example, in some examples of this disclosure, orthogonal matrix 500 and base sequence 501 may be implemented to implement sequence partitioning 300 or sequence partitioning 400. UE 115 or base station 105, or both, may use orthogonal matrix 500 and base sequence 501 to generate a sequence pool associated with UE 115 or to generate a set of sequences (e.g., an orthogonal sequence set) from which UE 115-a or base station 105, or both, may select sequences for the sequence pool associated with UE 115. Base station 115 and UE 105 may be examples of corresponding devices as described herein.
[0158] An orthogonal matrix 500 (which may be referred to as W) can be an orthogonal square matrix of size N (i.e., an N×N matrix). In some implementations, N can be equal to the number of symbols allocated for resource sharing associated with the transmission of the payload, as shown in the reference. Figure 2 A more detailed description follows. Furthermore, in some examples, the orthogonal matrix 500 can be a DFT matrix, and thus can be equivalently referred to as a DFT matrix. Accordingly, the rows or columns (e.g., vectors) of the orthogonal matrix 500 can be called... or Where n is the index of a row or column of the orthogonal matrix 500 (e.g., the nth row or column). Although Figure 5AIt has been explained that n = 1, but n can be any number n = 0, 1, 2, ..., N-1. The rows of the orthogonal matrix 500 are defined by Equation 1 shown below.
[0159]
[0160] The corresponding column of orthogonal matrix 500 can be equal to In Equation 1, ω can be defined as ω = e -j2π / N Or ω=e j2π / N .vector Each column (or vector) Each row of the orthogonal matrix 500 can correspond to an OFDM symbol index i, where i = 0 in the first column (i.e., the leftmost column) of the orthogonal matrix 500 and increments by 1 until i = N-1 in the last column (i.e., the rightmost column) of the orthogonal matrix 500. In some cases, the OFDM symbol index i can correspond to the OFDM symbols for resource allocation that the UE 115 can use to transmit payloads. In some cases, the phase ramp of a row or column of the orthogonal matrix 500 can be defined as i*n, where i is the OFDM symbol index and n can describe the slope of the phase change. Thus, a column or row of the orthogonal matrix 500 can include an entry for each OFDM symbol used for resource allocation in a frequency modulation.
[0161] Base sequence 501 (which can be equivalently referred to as base sequence) The base sequence 501 can be a cyclically shifted frequency-domain base sequence. In other words, the base sequence 501 can be a frequency-domain base sequence S associated with a cyclic shift in the time domain. Therefore, the base sequence S can be based on a cyclic shift index m, where m = 0, 1, 2, ..., M-1. In some respects, M can be equal to the number of frequency modulations of the resource allocation associated with the transmission of the payload, as referenced... Figure 2 A more detailed description follows. Equivalently, the basis sequence S can be associated with a phase ramp vector in the frequency domain, such as ei -j2πlm / M or e j2πlm / M Furthermore, the phase ramp vector and the basis sequence S can be multiplied together to determine the basis sequence. As shown by base sequence 501.
[0162] For example, UE 115 or base station 105, or both, can perform a DFT or Fast Fourier Transform (FFT) on the base sequence S in the frequency domain to transform the base sequence S to the time domain, where the time-domain representation of the base sequence S (which may be referred to as...) It has a length M. UE115 or base station 105, or both, can apply the cyclic shift index m. To The shift index m can be efficiently used in a cyclic manner to... The entry is shifted forward or backward by m. A time-domain cyclic shift can correspond to the frequency-domain phase ramp vector e. -j2πlm / M or e j2 πlm / M The index m of the phase slope may correspond to the slope of the phase slope (e.g., the phase slope may be defined as m / M), and the index l may correspond to the frequency modulation index of the resource allocation. As shown in the base sequence 501, S(0), S(1), S(2), ..., S(l), ..., S(M-1) may correspond to entries in the base sequence S for each frequency modulation l = 0, 1, 2, ..., M-1. Accordingly, the base sequence 501 may include entries for each frequency modulation for resource allocation in an OFDM symbol.
[0163] In some cases, the base sequence 501 can be a cell-specific base sequence, allowing each UE 115 within the cell of base station 105 (e.g., within the geographic coverage area of base station 105) to use the same base sequence 501. In some aspects, base station 105 can transmit a signal to UE 115 indicating which base sequence S to use. For example, UE 115 and the base station can support a certain number of base sequences S (e.g., 30 base sequences S), and base station 105 can signal to UE 115 which base sequence S to use to generate the sequence pool associated with UE 115. In some other aspects, UE 115 can identify which base sequence to use to generate the sequence pool associated with UE 115 based on running a pseudo-random number generator (e.g., with an output indexed between 0 and 30) according to the input UE ID and time slot ID. In some cases, this determination of the base sequence based on the output of the pseudo-random number generator can be referred to as a base sequence transition. Furthermore, in some cases, the base sequence 501 may have low PAPR properties and may be referred to as a low PAPR sequence. In some cases, cyclic shifts in the time domain and phase ramps in the frequency domain can avoid affecting the PAPR of the base sequence, thereby maintaining the PAPR associated with the base sequence 501.
[0164] like Figure 5A The explained base sequence 501 can be a vector of size M×1. Additionally, the number of base sequences 501 can be equal to the number of cyclic shift indices associated with each base sequence 501. For example, there can be M base sequences 501 (i.e., one base sequence for each of m = 0, 1, 2, ..., M-1). Furthermore, each row of the base sequence 501 can correspond to a frequency modulation index l, where l = 0 in the first row (i.e., the bottom row) and increments by 1 until l = M-1 in the last column (i.e., the top row). Therefore, each frequency modulation index l can correspond to the frequency modulation of the resource allocation associated with the transmission of the payload. Accordingly, a certain number of base sequences 501 can be considered (e.g., an equal number), and this number of base sequences 501 can be visualized as a base sequence of dimension M×M (e.g., M cyclic shifts × M frequency modulations). The matrix.
[0165] As described herein, UE 115 or base station 105, or both, may generate or otherwise determine a sequence pool associated with UE 115 based on a configuration for partitioning the sequence set. In some implementations, UE 115 or base station 105, or both, may generate the sequence pool associated with UE 115 based on calculating or determining the product (e.g., Kronecker product) of an index subset of orthogonal matrix 500 and an index subset of base sequences 501 (e.g., a selected number of base sequences 501). For example, the configuration for partitioning the sequence set may indicate that the sequence pool associated with UE 115 includes sequences generated by a subset of N rows or columns of orthogonal matrix 500 and a subset of M cyclically shifted base sequences 501. For example, UE 115 or base station 105, or both, may generate the sequence pool associated with UE 115 based on determining a reduced-size orthogonal matrix 500 (e.g., including...). Figure 5A The sequence pool associated with UE115 is determined by the Kronecker product of the orthogonal matrix 500 (a subset of N rows or columns as explained in the text) and the reduced number of base sequences 501 (e.g., fewer than M cyclic shifts of base sequences 501).
[0166] In this example of implementation, UE 115 or base station 105, or both, can determine a first index subset n = 0, 2, 4, 6, 8, 10, 12 of orthogonal matrix 500 and a second index subset n = 1, 3, 5, 7, 9, 11, 13 (e.g., where N = 14), and can determine a first index subset m = 0, 2, 4, 6, 8, 10 and a second index subset m = 1, 3, 5, 7, 9, 11 of base sequence 501 (e.g., where M = 12). In such an example (e.g., by dividing orthogonal matrix 500 into two index subsets and base sequence 501 into two index subsets), the sequence set can be divided into four distinct sequence pools. For example, UE115 or base station 105, or both, may use a first subset of the indexes of orthogonal matrix 500 and a first subset of the indexes of base sequence 501 to determine a first sequence pool, use a first subset of the indexes of orthogonal matrix 500 and a second subset of the indexes of base sequence 501 to determine a second sequence pool, use a second subset of the indexes of orthogonal matrix 500 and a first subset of the indexes of base sequence 501 to determine a third sequence pool, or use a second subset of the indexes of orthogonal matrix 500 and a second subset of the indexes of base sequence 501 to determine a fourth sequence pool. Although described in the context of two partitions of the orthogonal matrix and base sequence, the described techniques can be equivalently applied to any number of index subsets of orthogonal matrix 500 and base sequence 501.
[0167] In some examples, the orthogonal matrix 500 (e.g., the DFT domain) may be sensitive to Doppler shift, and the basis sequence 501 (e.g., the cyclic shift domain) may be sensitive to channel delay spread. Therefore, by implementing the selection of different subsets of the indices of one or both of the orthogonal matrix 500 and the basis sequence 501, the UE 115 or base station 105 or both can customize or tune the partitioning of the orthogonal matrix 500 and the basis sequence 501 based on the channel model to achieve more optimized communication metrics (e.g., lower channel delay spread, less Doppler shift, etc.). For example, if the channel has a high Doppler shift, the UE 115 or base station 105 or both can partition the orthogonal matrix 500 such that there is a larger distance between the indices in the subsets of the orthogonal matrix 500. On the other hand, if the channel has a large delay spread, the UE 115 or base station 105 or both can partition the basis sequence 501 such that there is a larger distance between the indices in the subsets of the basis sequence 501.
[0168] In some other implementations, UE 115 or base station 105, or both, may generate a set of sequences (e.g., an orthogonal sequence set) and select sequences from the generated set to determine a sequence pool associated with UE 115. In such an implementation, UE 115 or base station 105, or both, may generate the sequence set based on the product (such as a Kronecker product) of an orthogonal matrix 500 (e.g., all N rows or columns of orthogonal matrix 500) and each of a number of base sequences 501 (e.g., all M cyclic shift indices of base sequences 501). The Kronecker product of orthogonal matrix 500 and each of the number of base sequences 501 may involve determining the Kronecker product of each row or column n of orthogonal matrix 500 with each cyclic shift index m of base sequences 501, and repeating this operation for all permutations of n and m, where n = 0, 1, ..., N-1 and m = 0, 1, ..., M-1.
[0169] Thus, the number of sequences in the set can be equal to the product of the dimension of the orthogonal matrix 500 and the matrix representation of the base sequence 501. For example, the orthogonal matrix 500 can be an N×N matrix, and the base sequence 501 can be represented by an M×M matrix; therefore, the Kronecker product between them yields an (N*M)×(N*M) matrix (e.g., an orthogonal (N*M)×(N*M) matrix). In other words, UE 115 or base station 105, or both, can generate a set of N*M sequences, and each sequence can have a length of N*M. When generating the sequence set, UE 115 or base station 105, or both, can determine which sequences are in the sequence pool associated with UE 115. In some examples, UE 115 or base station 105, or both, can determine which sequences are in the sequence pool associated with UE 115 based on determining which sequences were generated by a subset of the index of the orthogonal matrix 500 and a subset of the index of the base sequence 501.
[0170] For example, UE 115 or base station 105 or both can determine a first index subset n = 0, 2, 4, 6, 8, 10, 12 of orthogonal matrix 500 and a second index subset n = 1, 3, 5, 7, 9, 11, 13 of orthogonal matrix 500 (e.g., where N = 14), and can determine a first index subset m = 0, 2, 4, 6, 8, 10 and a second index subset m = 1, 3, 5, 7, 9, 11 of base sequence 501 (e.g., where M = 12). UE 115 or base station 105 or both may determine a first sequence pool based on determining which sequences are generated using a first index subset of orthogonal matrix 500 and a first index subset of base sequence 501, determine a second sequence pool based on determining which sequences are generated using a first index subset of orthogonal matrix 500 and a second index subset of base sequence 501, determine a third sequence pool based on determining which sequences are generated using a second index subset of orthogonal matrix 500 and a first index subset of base sequence 501, or determine a fourth sequence pool based on determining which sequences are generated using a second index subset of orthogonal matrix 500 and a second index subset of base sequence 501.
[0171] In another example, UE 115 or base station 105, or both, may identify consecutive sequence blocks from the generated sequence set (e.g., Figure 3 (as explained) or by identifying a certain number of interwoven sequences from the generated set of sequences (such as...) Figure 4 (As explained) to determine the sequence pool associated with UE 115. In an example where sequences in the sequence pool associated with UE 115 are interleaved with each other, base station 105 can signal an interleaving granularity value L, which UE 115-a or base station 105-a or both can use to determine which sequences are in the sequence pool associated with UE 115.
[0172] Based on the Kronecker product of orthogonal matrix 500 and base sequence 501 (e.g., to generate a sequence pool or sequence set), the signal transmitted on each OFDM symbol can have the same PAPR as base sequence 501. This can improve the coverage area of UE 115 because UE 115 can drive the power amplifier to a set power ratio and transmit the signal using UE 115's maximum transmit power. (Refer to...) Figure 5B The use of Kronecker product to generate orthogonal sequences of individuals is described in more detail.
[0173] Figure 5BExamples of mathematical operations 502 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure are explained. In some examples, mathematical operation 502 may be implemented to implement aspects of wireless communication system 100 or wireless communication system 200. For example, in some examples of this disclosure, mathematical operation 502 may be implemented to determine sequence 505 of a sequence pool associated with UE 115. Mathematical operation 502 may be an example of the Kronecker product of rows or columns (e.g., vectors) of orthogonal matrix 500 with base sequence 501. In some examples, UE 115 or base station 105 or both (which may be examples of corresponding devices as described herein) may perform mathematical operation 502 to determine orthogonal sequence 505 (e.g., sequences orthogonal in time and frequency).
[0174] UE 115 or base station 105, or both, may determine sequence 505 when generating a set of orthogonal sequences (e.g., N*M orthogonal sequences) or when generating a sequence pool associated with UE 115, as referenced. Figure 5A To describe in more detail. For example, mathematical operation 502 can explain the steps or operations for generating a set of sequences, and therefore, mathematical operation 502 can be similarly performed for each unique pair of row or column indices n of orthogonal matrix 500 and cyclic shift indices m of base sequence 501 (in the example where UE 115 or base station 105 or both generate a complete set of sequences), or mathematical operation 502 can be similarly performed for each unique pair of indices in a subset of indices of orthogonal matrix 500 and indices in a subset of indices of base sequence 501 (in the example where UE 115 or base station 105 or both generate a pool of sequences associated with UE 115). For example, UE 115 or base station 105 or both can perform mathematical operation 502 N*M times (e.g., to generate N*M orthogonal sequences 505) or the number of times equal to the product of the number of indices of the subset of indices of orthogonal matrix 500 and the number of indices of the subset of indices of base sequence 501.
[0175] UE 115 or base station 105, or both, can determine the row or column index n of orthogonal matrix 500 from N-1 row or column indices or subsets of row or column indices, and determine the cyclic shift index m of base sequence 501 from M-1 cyclic shift indices or subsets of cyclic shift indices. In other words, UE 115 or base station 105, or both, can determine the vector corresponding to the row or column index n of orthogonal matrix 500 (which may be referred to as...). (and defined by Equation 1) and a vector corresponding to the cyclic shift index m of the base sequence 501 (which can be derived from the base sequence) To explain (for example, base sequence 501 can be explained) )).
[0176] UE 115 or base station 105 or both can be determined and The Kronecker product is used to determine the sequence 505. The Kronecker product is defined as such that... In the case of row vectors, the base sequence and Multiply each column, and... In the case of column vectors, the base sequence and Multiply each row together. It can be complete (For example, including all rows or columns) or reduced size (For example, including a subset of rows or columns). and The Kronecker product can be defined by Equation 2, as shown below and in Figure 5B It unfolds within.
[0177]
[0178] In some implementations, such as when and When both are row vectors or both are column vectors, Equation 2 can generate an (N*M)×1 sequence 505 (in and In the case of a column vector) or a 1×(N*M) sequence 505 (in and (In the case of row vectors). Alternatively, in some other implementations, It can be a row vector, and It can be a column vector. In this implementation, Equation 2 can generate an orthogonal sequence of dimension N×M. In this implementation, UE 115 or base station 105, or both, can concatenate each column below the lowest entry of the previous column to efficiently generate an (N*M)×1 sequence 505. UE 115 or base station 105, or both, can perform such concatenation so that sequence 505 is represented as columns (or rows) and can be indexed in a codebook. In either implementation, each entry in sequence 505 can be associated with a unique (i, l) pair, where i can correspond to the OFDM symbol index of the N OFDM symbols allocated in the resource allocation, and l can correspond to the frequency modulation index of the M frequency modulations in the resource allocation. Therefore, regardless of the specific implementation, UE 115 or base station 105 can map the generated sequence 505 to the allocated resource grid such that entries of sequence 505 corresponding to unique (i, l) pairs are mapped to resource elements of the resource grid associated with (i, l) pairs (e.g., the i-th OFDM symbol and the resource element at the l-th frequency modulation of the resource grid).
[0179] In some examples, OFDM symbol index i = 0 may correspond to the first (e.g., the earliest in time) OFDM symbol in a resource allocation, while frequency modulation index i = 0 may correspond to the lowest frequency modulation (e.g., the lowest frequency subcarrier) in that resource allocation. Similarly, OFDM symbol index i = N-1 may correspond to the last (e.g., the latest in time) OFDM symbol in a resource allocation, while frequency modulation index i = M-1 may correspond to the highest frequency modulation (e.g., the highest frequency subcarrier) in that resource allocation.
[0180] This generation of sequence set 505 (e.g., the complete sequence set 505 or sequence 505 in the sequence pool associated with UE 115) can correspond to the expansion of base sequence 501 in the time domain (e.g., based on CDMA concepts) via orthogonal matrix 500 (e.g., using DFT vectors in the time domain) and phase ramping in the frequency domain based on the cyclic shift index of base sequence 501. See reference... Figure 5A As described, phase ramping in the frequency domain can correspond to (e.g., equivalent to) cyclic shifting in the time domain. In the case where the orthogonal matrix is a DFT matrix, the described technique can also correspond to DFT-based orthogonal overlay codes and cyclically shifted multiplexed representations for a single user's payload. Furthermore, implementations of this disclosure can correspond to an indexed modulation scheme using N DFT dimensions and M cyclic shift dimensions to carry a certain number of bits based on N and M dimensions. For example, such an indexed modulation scheme can carry the payload based on switching modes on N*M frequency moduli of sequence 505. When using indexed modulation, UE 115 can convey different information by using different switching modes on the N*M frequency moduli of sequence 505. In some examples, the described technique can be implemented to carry log2(N*M) bits based on N DFT dimensions and M cyclic shift dimensions (e.g., a sequence 505 of length N*M generated by orthogonal matrix 500 and base sequence 501 can carry log2(N*M) bits).
[0181] Therefore, UE 115 or base station 105, or both, can generate sequence 505 that can convey the payload across resources allocated for payload transmission. UE 115 or base station 105, or both, can repeat mathematical operation 502 on each unique pair (i.e., each unique (n, m) pair) of the row or column index n of orthogonal matrix 500 or a subset of the row or column indexes of orthogonal matrix 500 and each cyclic shift index m of base sequence 501 or a subset of the cyclic shift indexes of base sequence 501, to generate a complete set of sequence set 505 or sequences 505 in a sequence pool associated with UE 115, wherein each sequence 505 can convey the payload across each resource element in a resource grid defined by N OFDM symbols and M frequency modulations. In some implementations, UE 115 or base station 105, or both, can construct a codebook of sequence subset 505 from the sequence pool associated with UE 115 based on the number of bits in the payload. See reference. Figure 2 The selection of the sequence subset 505 is described in more detail.
[0182] Figure 6 Examples of a process flow 600 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure are described. In some examples, process flow 600 may implement aspects of wireless communication system 100 or wireless communication system 200. Process flow 600 may describe communication between UE 115-b and base station 105-b (which may be examples of corresponding devices as described herein). UE 115-b or base station 105-b, or both, may determine a sequence pool associated with UE 115-b based on a configuration for partitioning the sequence set, and may determine a subset of sequences from that sequence pool. Furthermore, UE 115-b may select sequences from this subset of sequences, and may use the selected sequences to transmit payloads to base station 105-b. Alternative examples are possible, in which some steps are performed in a different order than described or not at all. In some cases, the steps may include additional features not mentioned below, or further steps may be added.
[0183] At 605, base station 105-b can determine a configuration for dividing the sequence set into a sequence pool set associated with a set of UEs 115-b. For example, multiple UEs 115-b can share a resource allocation for transmitting payloads (e.g., sequence-based transmissions) to base station 105-b, and base station 105-b can configure the sequence set such that each of the multiple UEs 115-b has its own sequence pool from which sequences are selected for transmitting payloads. In some examples, the resource allocation can be a PUCCH, and therefore base station 105-b and multiple UEs 115-b can support a multi-user design for sequence-based transmissions on the PUCCH. The sequences can be orthogonal or non-orthogonal sequences, and can have a number of time periods (e.g., OFDM symbol periods) and a number of frequency modulations (e.g., subcarriers) based on the resource allocation.
[0184] At 610, base station 105-b can transmit configuration for partitioning sequence sets to UE 115-b. In some examples, base station 105-b may additionally transmit configuration for partitioning sequence sets to other UEs 115-b that can use the same resource allocation as UE 115-b to transmit payloads to base station 105-b.
[0185] In 615, UE 115-a can determine a first sequence pool associated with UE 115-b based on a configuration used to partition the sequence set. In some examples, determining the first sequence pool associated with UE 115-b may include generating the first sequence pool based on an initial seed. In such an example, base station 105-b may transmit an indication of the UE ID to UE 115-b, and UE 115-b may determine the initial seed based on the UE ID, slot ID, frame ID, or any combination thereof. In some other examples, determining the first sequence pool associated with UE 115-b may include identifying an index subset of the orthogonal matrix (e.g., a first index subset) and an index subset of the base sequence (e.g., a second index subset), and generating the first sequence pool based on the product of the index subset of the orthogonal matrix and the index subset of the base sequence. In other words, UE 115-b may generate the first sequence pool based on the product of a subset of the rows or columns of the orthogonal matrix and a cyclically shifted subset of the base sequence. In some other examples, determining the first sequence associated with UE 115-b may include generating a set of sequences based on the product of an orthogonal matrix (e.g., a fully orthogonal matrix) and a base sequence (e.g., all cyclic shifts of the base sequence) and selecting a sequence from the generated set of sequences. (Including references) Figure 3 -5) describes additional details related to determining the first sequence pool associated with UE 115-b.
[0186] In 620-a and 620-b, UE 115-b and base station 105-b can determine a subset of sequences from a first sequence pool for conveying the payload. In some examples, the size (e.g., number) of the sequence subset is at least partially based on the number of bits in the bit set of the payload. For example, the payload may include K bits, and thus UE 115-b and base station 105-b can determine that it is equal to 2 K A subset of sequences. UE 115-b or base station 105-b or both may include this subset of sequences in the constructed codebook and may index the subset of sequences in the codebook.
[0187] In 625, UE 115-b can select sequences from the subset of sequences (e.g., from a constructed codebook) based on a mapping between the subset of sequences and the number of bits in the payload. In some examples, UE 115-b can identify the bitstream of the payload and convert that bitstream into a decimal number corresponding to an index in a constructed codebook that includes the subset of sequences, where each sequence in the subset of sequences is associated with an index in the codebook. Accordingly, UE 115-b can select the sequence associated with the index corresponding to the determined decimal number.
[0188] At 630, UE 115-b may use the selected sequence to transmit a payload including that number of bits. Similarly, base station 105-b may use a sequence selected from this subset of sequences to receive a payload including that number of bits. In some implementations, base station 105-b may additionally use a selected sequence from a sequence pool associated with other UE 115-b to receive additional payloads from other UE 115-b. For example, base station 105-b may use a second selected sequence from a second subset of a second sequence pool associated with the second UE 115-b to receive a second payload including a second number of bits from the second UE 115-b. In some examples, UE 115-b may transmit the payload on an uplink channel (such as PUCCH). In such examples, the payload may be an example of uplink control information.
[0189] Although described in the context of uplink communication from UE 115-b to base station 105-b, the described techniques are equivalently applicable to communication from base station 105-b to UE 115-b. For example, base station 105-b may transmit a payload to UE 115-b on a downlink channel. Alternatively, the described techniques may be applied to communication between two UEs 115-b or two base stations 105-b, and in such an example, either device may transmit a payload to the other on a sidelink channel or via a wireless backhaul connection.
[0190] Figure 7 A block diagram 700 illustrates a device 705 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure. Device 705 may be an example of various aspects of UE 115 as described herein. Device 705 may include a receiver 710, a communication manager 715, and a transmitter 720. Device 705 may also include a processor. Each of these components may be in communication with each other (e.g., via one or more buses).
[0191] Receiver 710 can receive information such as packets, user data, or control information associated with various information channels (e.g., control channels, data channels, and information related to sequence allocation for multi-user uplink channels). This information can be transmitted to other components of device 705. Receiver 710 can be a reference... Figure 10 Examples of various aspects of the transceiver 1020 described. The receiver 710 may utilize a single antenna or an array of antennas.
[0192] The communication manager 715 may receive a configuration for dividing a set of sequences into a set of sequence pools associated with a set of UEs; based on the configuration, determine a subset of sequences for conveying a payload from a first sequence pool of the set of sequence pools, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; select a sequence from the subset of sequences based on the mapping between the subset of sequences and the bit set; and use the selected sequence to transmit the payload including the bit set. The communication manager 715 may be an example of aspects of the communication manager 1010 described herein.
[0193] The communication manager 715 or its sub-components may be implemented in hardware, code executed by a processor (e.g., software or firmware), or any combination thereof. If implemented in code executed by a processor, the functionality of the communication manager 715 or its sub-components may be performed by a general-purpose processor, digital signal processor (DSP), application-specific integrated circuit (ASIC), field-programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof, designed to perform the functions described in this disclosure.
[0194] The communication manager 715 or its subcomponents may be physically located at various locations, including being distributed such that portions of the functionality are implemented by one or more physical components at different physical locations. In some examples, according to various aspects of this disclosure, the communication manager 715 or its subcomponents may be separate and distinct components. In some examples, according to various aspects of this disclosure, the communication manager 715 or its subcomponents may be combined with one or more other hardware components, including but not limited to input / output (I / O) components, transceivers, network servers, another computing device, one or more other components described in this disclosure, or combinations thereof.
[0195] Transmitter 720 can transmit signals generated by other components of device 705. In some examples, transmitter 720 may coexist with receiver 710 in a transceiver module. For example, transmitter 720 may be a reference... Figure 10 Examples of various aspects of the transceiver 1020 described. The transmitter 720 may utilize a single antenna or an array of antennas.
[0196] In some examples, the communication manager 715 may be implemented as an integrated circuit or chipset for a mobile device modem, and the receiver 710 and transmitter 720 may be implemented as analog components (e.g., amplifiers, filters, antennas) coupled to the mobile device modem to enable wireless transmission and reception over one or more frequency bands.
[0197] The communication manager 715, as described herein, can be implemented to achieve one or more potential advantages. In some implementations of this disclosure, the communication manager 715 can construct a codebook of a subset of sequences from a sequence pool associated with device 705. In some implementations, the communication manager 715 can generate a codebook of orthogonal sequences (e.g., sequences orthogonal in the time and frequency domains). Orthogonal sequences can maintain a low PAPR of the base sequence, which varies depending on the cell, allowing device 705 to transmit at higher power and similarly improve its coverage area.
[0198] Furthermore, based on a codebook that constructs a subset of sequences from the sequence pool associated with device 705, device 705 can avoid the unnecessary storage costs associated with storing more sequences than are required for a payload of size K, and also allows other UEs 115 to use some sequences from the sequence set that have been identified in the sequence pool associated with device 705. In some specific implementations, using orthogonal sequences to deliver the payload to the base station compared to non-orthogonal sequences can reduce latency and increase reliability, which can increase the likelihood of successful communication between device 705 and the base station. Thus, one or more processing units of device 705 may potentially spend less time retransmitting the payload and, correspondingly, may spend longer durations in sleep mode. Thus, device 705 can experience improved power savings and increased battery life.
[0199] Figure 8 A block diagram 800 of a device 805 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure is illustrated. Device 805 may be an example of aspects of device 705 or UE 115 as described herein. Device 805 may include a receiver 810, a communication manager 815, and a transmitter 840. Device 805 may also include a processor. Each of these components may be in communication with each other (e.g., via one or more buses).
[0200] Receiver 810 can receive information such as packets, user data, or control information associated with various information channels (e.g., control channels, data channels, and information related to sequence allocation for multi-user uplink channels). This information can be transmitted to other components of device 805. Receiver 810 can be a reference... Figure 10 Examples of various aspects of the transceiver 1020 described. The receiver 810 may utilize a single antenna or an array of antennas.
[0201] Communication manager 815 may be an example of aspects of communication manager 715 as described herein. Communication manager 815 may include partition manager 820, codebook manager 825, sequence selection manager 830, and payload manager 835. Communication manager 815 may be an example of aspects of communication manager 1010 as described herein.
[0202] The partition manager 820 can receive a configuration for partitioning a set of sequences into a set of sequence pools associated with a set of UEs. The codebook manager 825 can determine, based on this configuration, a subset of sequences from a first sequence pool of the set of sequence pools for conveying the payload, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload. The sequence selection manager 820 can select a sequence from the subset of sequences based on a mapping between the subset of sequences and the bit set. The payload manager 835 can use the selected sequence to transmit the payload including the bit set.
[0203] Transmitter 840 can transmit signals generated by other components of device 805. In some examples, transmitter 840 may coexist with receiver 810 in a transceiver module. For example, transmitter 840 may be a reference... Figure 10 Examples of various aspects of the transceiver 1020 are described. The transmitter 840 may utilize a single antenna or an array of antennas.
[0204] Figure 9 A block diagram 900 illustrates a communication manager 905 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure. The communication manager 905 may be an example of aspects of the communication manager 715, communication manager 815, or communication manager 1010 described herein. The communication manager 905 may include a partitioning manager 910, a codebook manager 915, a sequence selection manager 920, a payload manager 925, a sequence pool manager 930, a sequence generation manager 935, and a bitstream manager 940. Each of these modules may communicate directly or indirectly with each other (e.g., via one or more buses).
[0205] The partition manager 910 may receive a configuration for partitioning a set of sequences into a set of sequence pools associated with a set of UEs. In some examples, the partition manager 910 may use this configuration to identify a first subset of indexes of an orthogonal matrix and a second subset of indexes of cyclically shifted, cell-specific sequences.
[0206] In some cases, the first subset of the orthogonal matrix and the second subset of the cyclically shifted, cell-specific index sequences include consecutive indices, interleaved indices, or any combination thereof. In some cases, the orthogonal matrix is a DFT matrix.
[0207] The codebook manager 915 can determine, based on this configuration, a subset of sequences from a first sequence pool of the sequence pool set for conveying the payload, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload. In some cases, the subset of sequences includes a codebook for conveying the payload comprising the bit set.
[0208] The sequence selection manager 920 can select a sequence from the sequence subset based on the mapping between the sequence subset and the bit set.
[0209] The payload manager 925 can use the selected sequence to transmit the payload, which includes the set of bits.
[0210] The sequence pool manager 930 can determine a first sequence pool based on this configuration, wherein the first sequence pool is associated with the UE. In some examples, the sequence pool manager 930 can determine a pool of consecutive sequences in the sequence set. In some examples, the sequence pool manager 930 can receive an interleaving value, wherein the determination of the first sequence pool is based on the interleaving value.
[0211] In some examples, the sequence pool manager 930 may determine a first number of sequences corresponding to the interleaving value. In some examples, the sequence pool manager 930 may determine a second number of sequences corresponding to the interleaving value at a distance from the first number of sequences, based on the number of UEs in the UE set and the interleaving value. In some examples, the sequence pool manager 930 may determine an initial seed based on the UE ID, slot ID, frame ID, or any combination thereof. In some examples, the sequence pool manager 930 may generate a first sequence pool based on the initial seed.
[0212] In some examples, the sequence pool manager 930 may receive an indication of the UE ID. In some examples, the sequence pool manager 930 may generate a first sequence pool based on the product of a first subset of the indices of an orthogonal matrix and a second subset of the indices of a cyclically shifted, cell-specific sequence.
[0213] In some examples, the sequence pool manager 930 may determine a first sequence pool from the set of sequences based on a first subset of indices of an orthogonal matrix and a second subset of indices of cyclically shifted, cell-specific sequences. In some cases, the first sequence pool is generated using a pseudo-random number generator. In some cases, the first sequence pool is generated using a maximum-length sequence. In some cases, the first sequence pool is generated using a Gold sequence.
[0214] The sequence generation manager 935 can generate the sequence set based on the product of an orthogonal matrix of size corresponding to the number of time periods and a cyclically shifted, cell-specific sequence of length corresponding to the number of frequency moduli, wherein the number of time periods and the number of frequency moduli include resource allocation for communicating the payload. In some cases, the orthogonal matrix is a DFT matrix. In some cases, each of the multiple sequences is a digital sequence.
[0215] The bit stream manager 940 can convert the bit set into a decimal number, wherein the mapping between the sequence subset and the bit set is based on the mapping between the decimal number and the index of the sequence subset.
[0216] Figure 10 A diagram illustrating a system 1000 including device 1005 supporting sequence partitioning for multi-user uplink channels, according to various aspects of this disclosure, is provided. Device 1005 may be an example of device 705, device 805, or UE 115 as described herein, or a component including the aforementioned devices. Device 1005 may include components for bidirectional voice and data communication, including components for transmitting and receiving communications, including a communication manager 1010, an I / O controller 1015, a transceiver 1020, an antenna 1025, a memory 1030, and a processor 1040. These components may be coupled (e.g., in electronic communication) via one or more buses (e.g., bus 1045).
[0217] The communication manager 1010 may receive a configuration for dividing a set of sequences into a set of sequence pools associated with a set of UEs; determine a subset of sequences for transmitting a payload from a first sequence pool of the set of sequence pools based on the configuration, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; select a sequence from the subset of sequences based on the mapping between the subset of sequences and the bit set; and use the selected sequence to transmit the payload including the bit set.
[0218] I / O controller 1015 manages the input and output signals of device 1005. I / O controller 1015 can also manage peripheral devices not integrated into device 1005. In some cases, I / O controller 1015 may represent a physical connection or port to an external peripheral device. In some cases, I / O controller 1015 may utilize an operating system, such as... OS / Or another known operating system. In other cases, the I / O controller 1015 may represent or interact with a modem, keyboard, mouse, touchscreen, or similar device. In some cases, the I / O controller 1015 may be implemented as part of a processor. In some cases, a user may interact with the device 1005 via the I / O controller 1015 or via hardware components controlled by the I / O controller 1015.
[0219] Transceiver 1020 can communicate bidirectionally via one or more antennas, wired or wireless links, as described herein. For example, transceiver 1020 may represent a wireless transceiver and be able to communicate bidirectionally with another wireless transceiver. Transceiver 1020 may also include a modem to modulate packets and provide the modulated packets to the antenna for transmission, and to demodulate packets received from the antenna.
[0220] In some cases, the wireless device may include a single antenna 1025. However, in other cases, the device may have more than one antenna 1025, which may be able to transmit or receive multiple wireless transmissions concurrently.
[0221] Memory 1030 may include random access memory (RAM) and read-only memory (ROM). Memory 1030 may store computer-readable, computer-executable code 1035, including instructions that, when executed, cause the processor to perform the various functions described herein. In some cases, memory 1030 may particularly include a basic I / O system (BIOS) that controls basic hardware or software operations, such as interaction with peripheral components or devices.
[0222] Processor 1040 may include intelligent hardware devices (e.g., general-purpose processors, DSPs, central processing units (CPUs), microcontrollers, ASICs, FPGAs, programmable logic devices, discrete gate or transistor logic components, discrete hardware components, or any combination thereof). In some cases, processor 1040 may be configured to use a memory controller to operate a memory array. In other cases, the memory controller may be integrated into processor 1040. Processor 1040 may be configured to execute computer-readable instructions stored in memory (e.g., memory 1030) to cause device 1005 to perform various functions (e.g., functions or tasks supporting sequence partitioning for a multi-user uplink channel).
[0223] Code 1035 may include instructions for implementing various aspects of this disclosure, including instructions for supporting wireless communication. Code 1035 may be stored in a non-transient computer-readable medium, such as system memory or other types of memory. In some cases, code 1035 may not be directly executed by processor 1040, but may cause a computer (e.g., when compiled and executed) to perform the functions described herein.
[0224] Figure 11A block diagram 1100 of an apparatus 1105 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure is illustrated. Apparatus 1105 may be an example of various aspects of base station 105 as described herein. Apparatus 1105 may include a receiver 1110, a communication manager 1115, and a transmitter 1120. Apparatus 1105 may also include a processor. Each of these components may be in communication with each other (e.g., via one or more buses).
[0225] Receiver 1110 can receive information such as packets, user data, or control information associated with various information channels (e.g., control channels, data channels, and information related to sequence allocation for multi-user uplink channels). This information can be transmitted to other components of device 1105. Receiver 1110 can be a reference... Figure 14 Examples of various aspects of the transceiver 1420 described. The receiver 1110 may utilize a single antenna or an array of antennas.
[0226] Communication manager 1115 may determine a configuration for dividing a set of sequences into a set of sequence pools associated with a set of UEs; transmit the configuration for dividing the set of sequences; determine a subset of sequences for conveying a payload from a first sequence pool of the set of sequence pools based on the configuration, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; and receive the payload including the bit set using a selected sequence from the subset of sequences, the selected sequence being based on a mapping between the subset of sequences and the bit set. Communication manager 1115 may be an example of aspects of communication manager 1410 described herein.
[0227] The communication manager 1115 or its sub-components may be implemented in hardware, code executed by a processor (e.g., software or firmware), or any combination thereof. If implemented in code executed by a processor, the functionality of the communication manager 1115 or its sub-components may be performed by a general-purpose processor, DSP, ASIC, FPGA or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described in this disclosure.
[0228] The communication manager 1115 or its subcomponents may be physically located at various locations, including being distributed such that portions of the functionality are implemented by one or more physical components at different physical locations. In some examples, according to various aspects of this disclosure, the communication manager 1115 or its subcomponents may be separate and distinct components. In some examples, according to various aspects of this disclosure, the communication manager 1115 or its subcomponents may be combined with one or more other hardware components (including, but not limited to, I / O components, transceivers, network servers, another computing device, one or more other components described in this disclosure, or combinations thereof).
[0229] Transmitter 1120 can transmit signals generated by other components of device 1105. In some examples, transmitter 1120 may coexist with receiver 1110 in a transceiver module. For example, transmitter 1120 may be a reference... Figure 14 Examples of various aspects of the transceiver 1420 described. The transmitter 1120 may utilize a single antenna or an array of antennas.
[0230] As described herein, device 1105 can determine a configuration for dividing a sequence set into multiple sequence pools, each sequence pool being associated with a different UE 115 (e.g., usable by a different UE 115). Thus, multiple UEs 115 can select sequences from the sequence set without the possibility of selecting the same sequence (e.g., based on selecting sequences from different, non-overlapping sequence pools). Therefore, multiple UEs 115 can deliver payloads to device 1105 using the selected sequences from the sequence set on a single resource allocation, resulting in greater resource efficiency and higher system-achievable throughput. Furthermore, by enabling multiple UEs 115 to select sequences from different sequence pools from the same sequence set, device 1105 can transmit less control signaling to multiple UEs 115, reducing signaling overhead and improving spectral efficiency.
[0231] Figure 12 A block diagram 1200 illustrates a device 1205 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure. Device 1205 may be an example of a device 1105 or a base station 105 as described herein. Device 1205 may include a receiver 1210, a communication manager 1215, and a transmitter 1235. Device 1205 may also include a processor. Each of these components may be in communication with each other (e.g., via one or more buses).
[0232] Receiver 1210 can receive information such as packets, user data, or control information associated with various information channels (e.g., control channels, data channels, and information related to sequence allocation for multi-user uplink channels). This information can be transmitted to other components of device 1205. Receiver 1210 can be a reference... Figure 14 Examples of various aspects of the transceiver 1420 described. The receiver 1210 may utilize a single antenna or an array of antennas.
[0233] Communication manager 1215 may be an example of aspects of communication manager 1115 as described herein. Communication manager 1215 may include partition manager 1220, codebook manager 1225, and payload manager 1230. Communication manager 1215 may be an example of aspects of communication manager 1410 as described herein.
[0234] The partition manager 1220 determines a configuration for partitioning a set of sequences into a set of sequence pools associated with a set of UEs, and transmits the configuration for partitioning the set of sequences. The codebook manager 1225 determines, based on this configuration, a subset of sequences from a first sequence pool of the set of sequence pools for conveying the payload, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload. The payload manager 1230 can receive the payload, including the bit set, using selected sequences from the subset of sequences, based on a mapping between the subset of sequences and the bit set.
[0235] Transmitter 1235 can transmit signals generated by other components of device 1205. In some examples, transmitter 1235 may coexist with receiver 1210 in a transceiver module. For example, transmitter 1235 may be a reference... Figure 14 Examples of various aspects of the transceiver 1420 described. The transmitter 1235 may utilize a single antenna or an array of antennas.
[0236] Figure 13 A block diagram 1300 illustrates a communication manager 1305 supporting sequence partitioning for a multi-user uplink channel according to various aspects of this disclosure. Communication manager 1305 may be an example of aspects of communication manager 1115, communication manager 1215, or communication manager 1410 described herein. Communication manager 1305 may include partitioning manager 1310, codebook manager 1315, payload manager 1320, sequence pool manager 1325, and sequence generation manager 1330. Each of these modules may communicate directly or indirectly with each other (e.g., via one or more buses).
[0237] The partition manager 1310 can determine a configuration for partitioning a set of sequences into a set of sequence pools associated with a set of UEs. In some examples, the partition manager 1310 can transmit a configuration for partitioning the set of sequences. In some examples, the partition manager 1310 can identify a first subset of indexes of an orthogonal matrix and a second subset of indexes of cyclically shifted, cell-specific sequences based on this configuration.
[0238] In some cases, the first subset of the orthogonal matrix and the second subset of the cyclically shifted, cell-specific index sequences include consecutive indices, interleaved indices, or any combination thereof. In some cases, the orthogonal matrix is a DFT matrix.
[0239] The codebook manager 1315 may, based on this configuration, determine a subset of sequences from a first sequence pool of the sequence pool set for conveying the payload, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload. In some examples, the codebook manager 1315 may, based on this configuration, determine a second subset of sequences from a second sequence pool of the sequence pool set for conveying a second payload, wherein the size of the second subset of sequences is based on the second number of bits in the second bit set of the second payload. In some cases, the subset of sequences includes a codebook for conveying the payload comprising the bit set.
[0240] Payload manager 1320 may receive the payload comprising the bit set using a selected sequence from the subset of sequences, the selected sequence being based on a mapping between the subset of sequences and the bit set. In some examples, payload manager 1320 may receive the second payload comprising the second bit set using a second selected sequence from the second subset of sequences, the second selected sequence being based on a second mapping between the second subset of sequences and the second bit set.
[0241] The sequence pool manager 1325 can determine a first sequence pool based on this configuration, wherein the first sequence pool is associated with a first UE. In some examples, the sequence pool manager 1325 can determine a pool of consecutive sequences in the sequence set. In some examples, the sequence pool manager 1325 can determine an interleaving value, wherein the determination of the first sequence pool is based on this interleaving value.
[0242] In some examples, the sequence pool manager 1325 may transmit the interleaving value. In some examples, the sequence pool manager 1325 may determine a first number of sequences corresponding to the interleaving value. In some examples, the sequence pool manager 1325 may determine a second number of sequences corresponding to the interleaving value at a distance from the first number of sequences, based on the number of UEs in the UE set and the interleaving value.
[0243] In some examples, the sequence pool manager 1325 may determine an initial seed based on the UE ID, slot ID, frame ID, or any combination thereof. In some examples, the sequence pool manager 1325 may generate a first sequence pool based on this initial seed. In some examples, the sequence pool manager 1325 may transmit an indication of the UE ID. In some examples, the sequence pool manager 1325 may generate a first sequence pool based on the product of a first subset of the indexes of an orthogonal matrix and a second subset of the indexes of a cyclically shifted, cell-specific sequence.
[0244] In some examples, the sequence pool manager 1325 may determine a first sequence pool from the set of sequences based on a first subset of indices of an orthogonal matrix and a second subset of indices of cyclically shifted, cell-specific sequences. In some cases, the first sequence pool is generated based on a pseudo-random number generator. In some cases, the first sequence pool is generated based on a maximum-length sequence. In some cases, the first sequence pool is generated based on a Gold sequence.
[0245] The sequence generation manager 1330 can generate the sequence set based on the product of an orthogonal matrix of size corresponding to the number of time periods and a cyclically shifted, cell-specific sequence of length corresponding to the number of frequency moduli, wherein the number of time periods and the number of frequency moduli include resource allocation for communicating the payload. In some cases, the orthogonal matrix is a DFT matrix. In some cases, each of the plurality of sequences is a digital sequence.
[0246] Figure 14 A diagram illustrating a system 1400 including device 1405 supporting sequence partitioning for multi-user uplink channels, according to various aspects of this disclosure, is provided. Device 1405 may be an example of device 1105, device 1205, or base station 105 as described herein, or a component including such devices. Device 1405 may include components for bidirectional voice and data communication, including components for transmitting and receiving communications, including a communication manager 1410, a network communication manager 1415, a transceiver 1420, an antenna 1425, a memory 1430, a processor 1440, and an inter-station communication manager 1445. These components may be coupled (e.g., in electronic communication) via one or more buses (e.g., bus 1450).
[0247] The communication manager 1410 may determine a configuration for dividing a set of sequences into a set of sequence pools associated with a set of UEs; transmit the configuration for dividing the set of sequences; determine a subset of sequences for conveying a payload from a first sequence pool of the set of sequences based on the configuration, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload; and receive the payload including the bit set using a selected sequence from the subset of sequences, the selected sequence being based on a mapping between the subset of sequences and the bit set.
[0248] The network communication manager 1415 can manage communication with the core network (e.g., via one or more wired backhaul links). For example, the network communication manager 1415 can manage the delivery of data communication by client devices (such as one or more UEs 115).
[0249] Transceiver 1420 can communicate bidirectionally via one or more antennas, wired or wireless links, as described herein. For example, transceiver 1420 may represent a wireless transceiver and be able to communicate bidirectionally with another wireless transceiver. Transceiver 1420 may also include a modem to modulate packets and provide the modulated packets to the antenna for transmission, and to demodulate packets received from the antenna.
[0250] In some cases, the wireless device may include a single antenna 1425. However, in other cases, the device may have more than one antenna 1425, which may be able to transmit or receive multiple wireless transmissions concurrently.
[0251] Memory 1430 may include RAM, ROM, or a combination thereof. Memory 1430 may store computer-readable code 1435 including instructions that, when executed by a processor (e.g., processor 1440), cause the device to perform the various functions described herein. In some cases, memory 1430 may particularly include a BIOS that controls basic hardware or software operation, such as interaction with peripheral components or devices.
[0252] Processor 1440 may include intelligent hardware devices (e.g., general-purpose processors, DSPs, CPUs, microcontrollers, ASICs, FPGAs, programmable logic devices, discrete gate or transistor logic components, discrete hardware components, or any combination thereof). In some cases, processor 1440 may be configured to use a memory controller to operate a memory array. In some cases, the memory controller may be integrated into processor 1440. Processor 1440 may be configured to execute computer-readable instructions stored in memory (e.g., memory 1430) to cause device 1405 to perform various functions (e.g., supporting functions or tasks for sequence partitioning of a multi-user uplink channel).
[0253] Inter-site communication manager 1445 manages communication with other base stations 105 and may include a controller or scheduler for cooperating with other base stations 105 to control communication with UE 115. For example, inter-site communication manager 1445 may coordinate the scheduling of transmissions to UE 115 for various interference mitigation techniques, such as beamforming or joint transmission. In some examples, inter-site communication manager 1445 may provide an X2 interface within LTE / LTE-A wireless communication network technology to facilitate communication between base stations 105.
[0254] Code 1435 may include instructions for implementing various aspects of this disclosure, including instructions for supporting wireless communication. Code 1435 may be stored in a non-transient computer-readable medium, such as system memory or other types of memory. In some cases, code 1435 may not be directly executed by processor 1440, but may cause a computer (e.g., when compiled and executed) to perform the functions described herein.
[0255] Figure 15 A flowchart illustrating a method 1500 for sequence partitioning of a multi-user uplink channel according to various aspects of this disclosure is provided. Operation of method 1500 can be implemented by a UE 115 or its components as described herein. For example, operation of method 1500 can be implemented by referring to... Figures 7 to 10 The described communication manager is used to perform these functions. In some examples, the UE can execute a set of instructions to control the UE's functional elements to perform the functions described herein. Additionally or alternatively, the UE can use dedicated hardware to perform aspects of the functions described herein.
[0256] At 1505, the UE may receive configuration for dividing the sequence set into a sequence pool set associated with the UE set. The operation of 1505 may be performed according to the methods described herein. In some examples, aspects of the operation of 1505 may be provided as referenced. Figures 7 to 10 The partition manager described is used to execute this.
[0257] In step 1510, the UE can determine a subset of sequences for conveying the payload from a first sequence pool of the sequence pool set based on this configuration, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload. The operation of step 1510 can be performed according to the method described herein. In some examples, aspects of the operation of step 1510 can be derived from, as referenced... Figures 7 to 10 The described codebook manager is used to execute this.
[0258] In step 1515, the UE can select a sequence from the subset of sequences based on the mapping between the subset of sequences and the set of bits. The operation of step 1515 can be performed according to the method described herein. In some examples, aspects of the operation of step 1515 can be derived from, as referenced... Figures 7 to 10 The described sequence selection manager is used to perform this.
[0259] At 1520, the UE can use the selected sequence to transmit the payload including the set of bits. The operation of 1520 can be performed according to the method described herein. In some examples, aspects of the operation of 1520 can be derived from, as referenced... Figures 7 to 10 The described payload manager is used for execution.
[0260] Figure 16A flowchart illustrating method 1600 for sequence partitioning of a multi-user uplink channel according to various aspects of this disclosure is provided. Operation of method 1600 can be implemented by UE 115 or its components as described herein. For example, operation of method 1600 can be implemented by, as referred to... Figures 7 to 10 The described communication manager is used to perform these functions. In some examples, the UE can execute a set of instructions to control the UE's functional elements to perform the functions described herein. Additionally or alternatively, the UE can use dedicated hardware to perform aspects of the functions described herein.
[0261] At 1605, the UE may receive configuration for partitioning the sequence set into sequence pool sets associated with the UE set. The operation of 1605 may be performed according to the methods described herein. In some examples, aspects of the operation of 1605 may be provided as referenced. Figures 7 to 10 The partition manager described is used to execute this.
[0262] In step 1610, the UE can generate a first sequence pool based on an initial seed. The operation of step 1610 can be performed according to the method described herein. In some examples, aspects of the operation of step 1610 can be derived from, as referenced... Figures 7 to 10 The sequence pool manager described is used for execution.
[0263] In step 1615, the UE can determine, based on this configuration, a subset of sequences for conveying the payload from a first sequence pool of the sequence pool set, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload. The operation of step 1615 can be performed according to the method described herein. In some examples, aspects of the operation of step 1615 can be derived from, as referenced... Figures 7 to 10 The described codebook manager is used to execute this.
[0264] In step 1620, the UE can select a sequence from the subset of sequences based on the mapping between the subset of sequences and the set of bits. The operation of step 1620 can be performed according to the method described herein. In some examples, aspects of the operation of step 1620 can be derived from, as referenced... Figures 7 to 10 The described sequence selection manager is used to perform this.
[0265] In step 1625, the UE can use the selected sequence to transmit the payload comprising that set of bits. Operation of step 1625 can be performed according to the methods described herein. In some examples, aspects of operation of step 1625 can be derived from, as referenced... Figures 7 to 10 The described payload manager is used for execution.
[0266] Figure 17A flowchart illustrating method 1700 for sequence partitioning of a multi-user uplink channel according to various aspects of this disclosure is provided. Operation of method 1700 can be implemented by UE 115 or its components as described herein. For example, operation of method 1700 can be implemented by, as referred to... Figures 7 to 10 The described communication manager is used to perform these functions. In some examples, the UE can execute a set of instructions to control the UE's functional elements to perform the functions described herein. Additionally or alternatively, the UE can use dedicated hardware to perform aspects of the functions described herein.
[0267] At 1705, the UE may receive configuration for dividing the sequence set into a sequence pool set associated with the UE set. The operation of 1705 may be performed according to the methods described herein. In some examples, aspects of the operation of 1705 may be provided as referenced. Figures 7 to 10 The partition manager described is used to execute this.
[0268] In 1710, the UE can identify a first subset of the orthogonal matrix and a second subset of the cyclically shifted, cell-specific sequences based on this configuration. Operation of 1710 can be performed according to the methods described herein. In some examples, aspects of the operation of 1710 can be determined by referring to... Figures 7 to 10 The partition manager described is used to execute this.
[0269] In 1715, the UE can generate a first sequence pool based on the product of a first subset of the orthogonal matrix and a second subset of the cyclically shifted, cell-specific sequences. The operation of 1715 can be performed according to the method described herein. In some examples, aspects of the operation of 1715 can be derived from, as referenced... Figures 7 to 10 The sequence pool manager described is used for execution.
[0270] At 1720, the UE can determine, based on this configuration, a subset of sequences for conveying the payload from a first sequence pool of the sequence pool set, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload. The operation of 1720 can be performed according to the method described herein. In some examples, aspects of the operation of 1720 can be derived from, as referenced... Figures 7 to 10 The described codebook manager is used to execute this.
[0271] In step 1725, the UE can select a sequence from the subset of sequences based on the mapping between the subset of sequences and the set of bits. The operation of step 1725 can be performed according to the method described herein. In some examples, aspects of the operation of step 1725 can be derived from, as referenced... Figures 7 to 10 The described sequence selection manager is used to perform this.
[0272] At 1730, the UE can use the selected sequence to transmit the payload including the set of bits. The operation of 1730 can be performed according to the method described herein. In some examples, aspects of the operation of 1730 can be derived from, as referenced... Figures 7 to 10 The described payload manager is used for execution.
[0273] Figures 7 to 10 A flowchart illustrating method 1800 for sequence partitioning of a multi-user uplink channel according to various aspects of this disclosure is provided. Operation of method 1800 can be implemented by UE 115 or its components as described herein. For example, operation of method 1800 can be implemented by, as referred to... Figure 19 The described communication manager is used to perform these functions. In some examples, the UE can execute a set of instructions to control the UE's functional elements to perform the functions described herein. Additionally or alternatively, the UE can use dedicated hardware to perform aspects of the functions described herein.
[0274] At 1805, the UE may receive configuration for dividing the sequence set into a sequence pool set associated with the UE set. The operation of 1805 may be performed according to the methods described herein. In some examples, aspects of the operation of 1805 may be provided as referenced. Figures 11 to 14 The partition manager described is used to execute this.
[0275] In 1810, the UE can generate the sequence set based on the product of an orthogonal matrix of size corresponding to the number of time periods and a cyclically shifted, cell-specific sequence of length corresponding to the number of frequency moduli, wherein the number of time periods and the number of frequency moduli include resource allocation for conveying the payload. The operation of 1810 can be performed according to the method described herein. In some examples, aspects of the operation of 1810 can be derived from, as referenced... Figures 11 to 14 The sequence generation manager described is used to execute this.
[0276] In 1815, the UE can identify a first subset of the orthogonal matrix and a second subset of the cyclically shifted, cell-specific sequences based on this configuration. Operation of 1815 can be performed according to the method described herein. In some examples, aspects of the operation of 1815 can be determined by referring to... Figures 11 to 14 The partition manager described is used to execute this.
[0277] In step 1820, the UE can determine a first sequence pool from the set of sequences based on a first subset of the orthogonal matrix and a second subset of the cyclically shifted, cell-specific sequences. The operation of step 1820 can be performed according to the method described herein. In some examples, aspects of the operation of step 1820 can be derived from, as referenced... Figures 11 to 14 The sequence pool manager described is used for execution.
[0278] In step 1825, the UE can determine, based on this configuration, a subset of sequences for conveying the payload from a first sequence pool of the sequence pool set, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload. The operation of step 1825 can be performed according to the method described herein. In some examples, aspects of the operation of step 1825 can be derived from, as referenced... Figures 11 to 14 The described codebook manager is used to execute this.
[0279] At 1830, the UE can select a sequence from the subset of sequences based on the mapping between the subset of sequences and the set of bits. The operation at 1830 can be performed according to the method described herein. In some examples, aspects of the operation at 1830 can be derived from, as referenced... Figure 20 The described sequence selection manager is used to perform this.
[0280] In step 1835, the UE can use a selected sequence to transmit the payload comprising that set of bits. Operation of step 1835 can be performed according to the methods described herein. In some examples, aspects of operation of step 1835 can be derived from, as referenced... Figures 11 to 14 The described payload manager is used for execution.
[0281] Figures 11 to 14 A flowchart illustrating a method 1900 for sequence partitioning of a multi-user uplink channel according to various aspects of this disclosure is provided. Operation of method 1900 can be implemented by a base station 105 or its components as described herein. For example, operation of method 1900 can be implemented by referring to... Figures 11 to 14 The described communication manager is used to perform these functions. In some examples, the base station can execute a set of instructions to control the functional elements of the base station to perform the functions described herein. Additionally or alternatively, the base station may use dedicated hardware to perform aspects of the functions described herein.
[0282] In step 1905, the base station can determine the configuration for dividing the sequence set into sequence pool sets associated with the UE set. The operation of step 1905 can be performed according to the method described herein. In some examples, aspects of the operation of step 1905 can be determined as described in reference... Figures 11 to 14 The partition manager described is used to execute this.
[0283] In step 1910, the base station can transmit a configuration for partitioning the sequence set. Operation of step 1910 can be performed according to the methods described herein. In some examples, aspects of operation of step 1910 can be derived from, as referenced... Figures 11 to 14 The partition manager described is used to execute this.
[0284] In 1915, the base station can determine a subset of sequences for conveying the payload from a first sequence pool of the sequence pool set based on this configuration, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload. The operation of 1915 can be performed according to the method described herein. In some examples, aspects of the operation of 1915 can be derived from, as referenced... Figures 11 to 14 The described codebook manager is used to execute this.
[0285] In 1920, the base station can receive the payload comprising the set of bits using a selected sequence from the subset of sequences, the selected sequence being based on a mapping between the subset of sequences and the set of bits. Operation of 1920 can be performed according to the method described herein. In some examples, aspects of operation of 1920 can be derived from, as referenced... Figures 11 to 14 The described payload manager is used for execution.
[0286] The flowchart illustrates a method 2000 for sequence partitioning of a multi-user uplink channel, which supports various aspects of this disclosure. The operation of method 2000 can be implemented by a base station 105 or its components as described herein. For example, the operation of method 2000 can be implemented by referring to... The described communication manager is used to perform these functions. In some examples, the base station can execute a set of instructions to control the functional elements of the base station to perform the functions described herein. Additionally or alternatively, the base station may use dedicated hardware to perform aspects of the functions described herein.
[0287] In 2005, the base station can determine the configuration for dividing the sequence set into sequence pool sets associated with the UE set. Operation of 2005 can be performed according to the method described herein. In some examples, aspects of operation of 2005 can be determined as described in reference... The partition manager described is used to execute this.
[0288] In 2010, the base station can transmit configurations for partitioning the sequence set. Operation of 2010 can be performed according to the methods described herein. In some examples, aspects of operation of 2010 can be derived as described in reference... The partition manager described is used to execute this.
[0289] In 2015, the base station can determine a subset of sequences for conveying the payload from a first sequence pool of the sequence pool set based on this configuration, wherein the size of the subset of sequences is based on the number of bits in the bit set of the payload. Operation in 2015 can be performed according to the method described herein. In some examples, aspects of operation in 2015 can be derived from, as referenced... The described codebook manager is used to execute this.
[0290] In 2020, the base station can determine a second subset of sequences for conveying the second payload from a second sequence pool of the sequence pool set based on this configuration, wherein the size of the second subset of sequences is based on the number of second bits in the second bit set of the second payload. Operation of 2020 can be performed according to the method described herein. In some examples, aspects of operation of 2020 can be derived from, as referenced... The described codebook manager is used to execute this.
[0291] In 2025, a base station can receive the payload comprising the set of bits using a selected sequence from the subset of sequences, the selected sequence being based on a mapping between the subset of sequences and the set of bits. Operation of 2025 can be performed according to the methods described herein. In some examples, aspects of operation of 2025 can be derived from, as referenced... The described payload manager is used for execution.
[0292] In 2030, the base station can receive the second payload including the second set of bits using a second selected sequence from the second sequence subset, the second selected sequence being based on a second mapping between the second sequence subset and the second set of bits. Operation of 2030 can be performed according to the method described herein. In some examples, aspects of operation of 2030 can be derived from, as referenced... The described payload manager is used for execution.
[0293] The following provides an overview of the various aspects of this disclosure:
[0294] Aspect 1: A method for wireless communication at a UE, comprising: receiving a configuration for dividing a plurality of sequences into a plurality of sequence pools associated with a plurality of UEs; determining, at least in part based on the configuration, a subset of sequences for transmitting a payload from a first sequence pool of the plurality of sequence pools, wherein the size of the subset of sequences is at least in part based on the number of a plurality of bits of the payload; selecting a sequence from the subset of sequences at least in part based on a mapping between the subset of sequences and the plurality of bits; and using the selected sequence to transmit the payload comprising the plurality of bits.
[0295] Aspect 2: The method of aspect 1 further includes: determining a first sequence pool based at least in part on the configuration, wherein the first sequence pool is associated with the UE.
[0296] Aspect 3: The method of aspect 2, wherein determining the first sequence pool includes: determining a pool of consecutive sequences among the plurality of sequences.
[0297] Aspect 4: The method of aspect 2 further includes: receiving an interleaved value, wherein determining the first sequence pool is at least partially based on the interleaved value.
[0298] Aspect 5: The method of aspect 4, wherein determining the first sequence pool includes: determining a first number of sequences corresponding to the interleaving value; and determining a second number of sequences corresponding to the interleaving value at a distance from the first number of sequences, based at least in part on the number of the plurality of UEs and the interleaving value.
[0299] Aspect 6: The method of any one of Aspects 1 to 5 further includes: determining an initial seed based at least in part on a UE identifier, a slot identifier, a frame identifier, or any combination thereof; and generating a first sequence pool based at least in part on the initial seed.
[0300] Aspect 7: The method of aspect 6 further includes: receiving an indication of a UE identifier.
[0301] Aspect 8: The method of any one of Aspects 6 or 7, wherein the first sequence pool is generated at least in part based on a pseudo-random number generator.
[0302] Aspect 9: The method of any one of Aspects 6 to 8, wherein the first sequence pool is generated at least in part based on the maximum length sequence.
[0303] Aspect 10: The method of any one of Aspects 6 to 9, wherein the first sequence pool is generated at least in part based on the Gold sequence.
[0304] Aspect 11: The method of any one of Aspects 1 to 5 further includes: identifying a first index subset of an orthogonal matrix and a second index subset of cyclically shifted, cell-specific sequences based at least in part on the configuration; and generating a first sequence pool based at least in part on the product of the first index subset of the orthogonal matrix and the second index subset of cyclically shifted, cell-specific sequences.
[0305] Aspect 12: The method of aspect 11, wherein the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequence include continuous indices, interleaved indices, or any combination thereof.
[0306] Aspect 13: The method of any one of Aspects 11 to 12, wherein the orthogonal matrix is the DFT matrix.
[0307] Aspect 14: The method of any one of Aspects 1 to 5 further includes: generating the plurality of sequences based at least in part on the product of an orthogonal matrix having a size corresponding to the number of time periods and a cyclically shifted, cell-specific sequence having a length corresponding to the number of frequency modulations, wherein the number of time periods and the number of frequency modulations include resource allocation for conveying the payload; identifying a first index subset of the orthogonal matrix and a second index subset of the cyclically shifted, cell-specific sequences based at least in part on the configuration; and determining a first sequence pool from the plurality of sequences based at least in part on the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequences.
[0308] Aspect 15: The method of aspect 14, wherein the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequence include continuous indices, interleaved indices, or any combination thereof.
[0309] Aspect 16: The method of any one of Aspects 14 or 15, wherein the orthogonal matrix is a DFT matrix.
[0310] Aspect 17: The method of any one of Aspects 1 to 16 further includes: converting the plurality of bits into a decimal number, wherein the mapping between the subset of the sequence and the plurality of bits is based at least in part on the mapping between the decimal number and the index of the subset of the sequence.
[0311] Aspect 18: The method of any one of Aspects 1 to 17, wherein the subset of the sequence includes a codebook for conveying the payload comprising the plurality of bits.
[0312] Aspect 19: The method of any one of Aspects 1 to 18, wherein each of the plurality of sequences is a sequence of numbers.
[0313] Aspect 20: A method for wireless communication at a base station, comprising: determining a configuration for dividing a plurality of sequences into a plurality of sequence pools associated with a plurality of UEs; transmitting the configuration for dividing the plurality of sequences; determining, at least in part based on the configuration, a subset of sequences for conveying a payload from a first sequence pool of the plurality of sequence pools, wherein the size of the subset of sequences is at least in part based on the number of a plurality of bits of the payload; and receiving the payload comprising the plurality of bits using a selected sequence from the subset of sequences, the selected sequence being at least in part based on a mapping between the subset of sequences and the plurality of bits.
[0314] Aspect 21: The method of aspect 20 further includes: determining, at least in part based on the configuration, a second subset of sequences from a second sequence pool of the plurality of sequence pools for conveying a second payload, wherein the size of the second subset of sequences is at least in part based on a second number of a second plurality of bits of the second payload; and receiving the second payload including the second plurality of bits using a second selected sequence from the second subset of sequences, the second selected sequence being at least in part based on a second mapping between the second subset of sequences and the second plurality of bits.
[0315] Aspect 22: The method of any one of Aspects 20 or 21 further includes: determining a first sequence pool based at least in part on the configuration, wherein the first sequence pool is associated with a first UE.
[0316] Aspect 23: The method of aspect 22, wherein determining the first sequence pool includes: determining a pool of consecutive sequences among the plurality of sequences.
[0317] Aspect 24: The method of aspect 22 further includes: determining an interleaving value, wherein the determination of the first sequence pool is at least partially based on the interleaving value; and transmitting the interleaving value.
[0318] Aspect 25: The method of aspect 24, wherein determining the first sequence pool includes: determining a first number of sequences corresponding to the interleaving value; and determining a second number of sequences corresponding to the interleaving value at a distance from the first number of sequences, based at least in part on the number of the plurality of UEs and the interleaving value.
[0319] Aspect 26: The method of any one of Aspects 20 to 25 further includes: determining an initial seed based at least in part on a UE identifier, a slot identifier, a frame identifier, or any combination thereof; and generating a first sequence pool based at least in part on the initial seed.
[0320] Aspect 27: The method of aspect 26 further includes: transmitting an indication of a UE identifier.
[0321] Aspect 28: The method of any one of Aspects 26 or 27, wherein the first sequence pool is generated at least in part based on a pseudo-random number generator.
[0322] Aspect 29: The method of any of Aspects 26 to 28, wherein the first sequence pool is generated at least in part based on the maximum length sequence.
[0323] Aspect 30: The method of any of Aspects 26 to 29, wherein the first sequence pool is generated at least in part based on the Gold sequence.
[0324] Aspect 31: The method of any one of Aspects 20 to 25 further includes: identifying a first index subset of an orthogonal matrix and a second index subset of cyclically shifted, cell-specific sequences based at least in part on the configuration; and generating a first sequence pool based at least in part on the product of the first index subset of the orthogonal matrix and the second index subset of cyclically shifted, cell-specific sequences.
[0325] Aspect 32: The method of aspect 31, wherein the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequence include continuous indices, interleaved indices, or any combination thereof.
[0326] Aspect 33: The method of any one of Aspects 31 or 32, wherein the orthogonal matrix is the DFT matrix.
[0327] Aspect 34: The method of any one of Aspects 20 to 25 further includes: generating the plurality of sequences based at least in part on the product of an orthogonal matrix having a size corresponding to a number of time periods and a cyclically shifted, cell-specific sequence having a length corresponding to a number of frequency modulations, wherein the number of time periods and the number of frequency modulations include resource allocation for conveying the payload; identifying a first index subset of the orthogonal matrix and a second index subset of the cyclically shifted, cell-specific sequences based at least in part on the configuration; and determining a first sequence pool from the plurality of sequences based at least in part on the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequences.
[0328] Aspect 35: The method of aspect 34, wherein the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequence include continuous indices, interleaved indices, or any combination thereof.
[0329] Aspect 36: The method of any one of Aspects 34 or 35, wherein the orthogonal matrix is the DFT matrix.
[0330] Aspect 37: The method of any one of Aspects 20 to 36, wherein the subset of the sequence includes a codebook for conveying the payload comprising the plurality of bits.
[0331] Aspect 38: The method of any one of Aspects 20 to 37, wherein each of the plurality of sequences is a sequence of numbers.
[0332] Aspect 39: An apparatus for wireless communication at a UE, comprising: a processor; a memory coupled to the processor; and instructions stored in the memory and operable, when executed by the processor, to cause the apparatus to perform a method as described in any one of Aspects 1 to 19.
[0333] Aspect 40: An apparatus for wireless communication at a UE, comprising at least one means for performing the method of any one of aspects 1 to 19.
[0334] Aspect 41: A non-transient computer-readable medium storing code for wireless communication at a UE, the code including instructions executable by a processor to perform methods as described in any of Aspects 1 to 19.
[0335] Aspect 42: An apparatus for wireless communication at a base station, comprising: a processor; a memory coupled to the processor; and instructions stored in the memory and operable, when executed by the processor, to cause the apparatus to perform a method as described in any one of Aspects 20 to 38.
[0336] Aspect 43: An apparatus for wireless communication at a base station, comprising at least one means for performing the method of any one of aspects 20 to 38.
[0337] Aspect 44: A non-transient computer-readable medium storing code for wireless communication at a base station, the code including instructions executable by a processor to perform methods as described in any of Aspects 20 to 38.
[0338] It should be noted that the methods described in this paper describe possible implementations, and the operations and steps can be rearranged or otherwise modified, and other implementations are also possible. Furthermore, aspects from two or more methods can be combined.
[0339] While aspects of LTE, LTE-A, LTE-A Pro, or NR systems may be described for illustrative purposes, and the terms LTE, LTE-A, LTE-A Pro, or NR may be used in most of the description, the techniques described herein can also be applied to networks other than LTE, LTE-A, LTE-A Pro, or NR networks. For example, the described techniques can be applied to a variety of other wireless communication systems, such as Ultra Mobile Broadband (UMB), IEEE 802.11 (Wi-Fi), IEEE 802.16 (WiMAX), IEEE 802.20, Flash-OFDM, and other systems and radio technologies not explicitly mentioned herein.
[0340] The information and signals described herein can be represented using any of a wide variety of different techniques and methods. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referred to throughout this description can be represented by voltage, current, electromagnetic waves, magnetic fields or magnetic particles, light fields or light particles, or any combination thereof.
[0341] The various illustrative boxes and components described herein can be implemented or executed using a general-purpose processor, DSP, ASIC, CPU, FPGA or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. The general-purpose processor may be a microprocessor, but in alternatives, the processor may be any processor, controller, microcontroller, or state machine. The processor may also be implemented as a combination of computing devices (e.g., a combination of a DSP and a microprocessor, multiple microprocessors, one or more microprocessors working in conjunction with a DSP core, or any other such configuration).
[0342] The functions described herein can be implemented in hardware, software executed by a processor, firmware, or any combination thereof. If implemented in software executed by a processor, the functions can be stored or transmitted as one or more instructions or code on a computer-readable medium. Other examples and implementations fall within the scope of this disclosure and the appended claims. For example, due to the nature of software, the functions described herein can be implemented using software executed by a processor, hardware, firmware, hardwired, or any combination thereof. Features implementing the functions can also be physically located in various locations, including being distributed such that different parts of the function are implemented at different physical locations.
[0343] Computer-readable media includes both non-transient computer storage media and communication media, encompassing any medium that facilitates the transfer of a computer program from one location to another. Non-transient storage media can be any available medium accessible to a general-purpose or special-purpose computer. By way of example and not limitation, non-transient computer-readable media may include RAM, ROM, electrically erasable programmable ROM (EEPROM), flash memory, compact disc (CD) ROM or other optical disc storage, magnetic disk storage or other magnetic storage devices, or any other non-transient medium that can be used to carry or store desired program code in the form of instructions or data structures and is accessible to a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Similarly, any connection is also legitimately referred to as computer-readable media. For example, if software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then that coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of computer-readable media. As used in this article, "disk" and "disc" include CDs, laser discs, optical discs, DVDs, floppy disks, and Blu-ray discs, where disks often magnetically reproduce data and discs optically reproduce data using lasers. Combinations of these media are also included within the scope of computer-readable media.
[0344] As used herein (including in the claims), the word "or" in an enumeration of items (e.g., an enumeration of items accompanied by phrases such as "at least one of" or "one or more of") indicates an inclusive enumeration, such that an enumeration of at least one of, for example, A, B, or C means A or B or C or AB or AC or BC or ABC (i.e., A and B and C). Similarly, as used herein, the phrase "based on" should not be interpreted as referring to a closed set of conditions. For example, an example step described as "based on condition A" may be based on both condition A and condition B without departing from the scope of this disclosure. In other words, as used herein, the phrase "based on" should be interpreted in the same manner as the phrase "at least partially based on".
[0345] As used herein, the term "determine" or "determine" encompasses a wide variety of actions, and therefore, "determine" can include calculation, computation, processing, derivation, investigation, lookup (such as by searching in a table, database, or other data structure), identification, and similar actions. Additionally, "determine" can include receiving (such as receiving information), accessing (such as accessing data in memory), and similar actions. Furthermore, "determine" can include parsing, selecting, choosing, building, and other such similar actions.
[0346] In the accompanying drawings, similar components or features may have the same reference numerals. Furthermore, components of the same type may be distinguished by a dash following the reference numeral and a second reference numeral used to differentiate between similar components. If only the first reference numeral is used in the description, the description may apply to any of the similar components having the same first reference numeral, regardless of the second reference numeral or other subsequent reference numerals.
[0347] This document, illustrated with reference to the accompanying drawings, describes exemplary configurations but does not represent all examples that can be implemented or fall within the scope of the claims. The term "example" as used herein means "serving as an example, instance, or illustration" and does not imply "superior" or "outperforming" other examples. This detailed description includes specific details to provide an understanding of the described techniques. However, these techniques may be practiced without these specific details. In some instances, known structures and devices are shown in block diagram form to avoid obscuring the concepts of the described examples.
[0348] The description provided herein is intended to enable those skilled in the art to make or use this disclosure. Various modifications to this disclosure will be apparent to those skilled in the art, and the universal principles defined herein can be applied to other variations without departing from the scope of this disclosure. Therefore, this disclosure is not limited to the examples and designs described herein, but should be granted the widest scope consistent with the principles and novel features disclosed herein.
Claims
1. A method for conducting wireless communication at a user equipment (UE), comprising: Receive configuration for dividing multiple sequences into multiple sequence pools associated with multiple UEs; An initial seed is determined, wherein each of the plurality of sequence pools is aligned with each other at least in part based on the initial seed; A subset of sequences for conveying the payload is determined from a first sequence pool of the plurality of sequence pools, at least in part based on the configuration, wherein the size of the subset of sequences is at least in part based on the number of multiple bits of the payload; A sequence is selected from the sequence subset based at least in part on the mapping between the sequence subset and the plurality of bits; as well as The selected sequence is used to transmit the payload, which includes the plurality of bits.
2. The method of claim 1, further comprising: The first sequence pool is determined at least in part based on the configuration, wherein the first sequence pool is associated with the UE.
3. The method as described in claim 2, wherein, Determining the first sequence pool includes: Determine a pool of consecutive sequences among the plurality of sequences.
4. The method of claim 2, further comprising: Receive interleaved values, wherein the determination of the first sequence pool is based at least in part on the interleaved values.
5. The method of claim 4, wherein, Determining the first sequence pool includes: Determine a first number of sequences corresponding to the interleaving values; and A second number of sequences corresponding to the interleaving value are determined at least in part based on the number of the plurality of UEs and the interleaving value, at a distance from the first number of sequences.
6. The method as described in claim 1, The initial seed is at least partially based on a UE identifier, a slot identifier, a frame identifier, or any combination thereof; and the method further includes The first sequence pool is generated at least in part based on the initial seed.
7. The method of claim 6, further comprising: Receive an indication of the UE identifier.
8. The method of claim 6, wherein, The first sequence pool is generated at least in part based on a pseudo-random number generator.
9. The method of claim 6, wherein, The first sequence pool is generated at least in part based on the longest sequence.
10. The method of claim 1, further comprising: The first subset of the orthogonal matrix and the second subset of the cyclically shifted, cell-specific sequences are identified at least in part based on the configuration. as well as The first sequence pool is generated at least in part based on the product of the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequence.
11. The method of claim 10, wherein, The first subset of the orthogonal matrix and the second subset of the cyclically shifted, cell-specific sequence include continuous indices, interleaved indices, or any combination thereof.
12. The method of claim 1, further comprising: The plurality of sequences are generated at least in part based on the product of an orthogonal matrix having a size corresponding to the number of time periods and a cyclically shifted, cell-specific sequence having a length corresponding to the number of frequency modulations, wherein the number of time periods and the number of frequency modulations include resource allocation for communicating the payload. The first subset of the orthogonal matrix and the second subset of the cyclically shifted, cell-specific sequences are identified at least in part based on the configuration. as well as The first sequence pool is determined from the plurality of sequences based at least in part on the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequences.
13. The method of claim 12, wherein, The first subset of the orthogonal matrix and the second subset of the cyclically shifted, cell-specific sequence include continuous indices, interleaved indices, or any combination thereof.
14. The method of claim 1, further comprising: The plurality of bits are converted into decimal numbers, wherein the mapping between the sequence subset and the plurality of bits is based at least in part on the mapping between the decimal numbers and the indices of the sequence subset.
15. The method of claim 1, wherein, The sequence subset includes a codebook for conveying the payload comprising the plurality of bits.
16. The method of claim 15, wherein, The mapping includes a mapping between the index of the codebook and the plurality of bits, and the plurality of bits includes a bit stream of the payload.
17. A method for conducting wireless communication at a network entity, comprising: Determine the configuration for dividing multiple sequences into multiple sequence pools associated with multiple user equipment (UEs); An initial seed is determined, wherein each of the plurality of sequence pools is aligned with each other at least in part based on the initial seed; Transmit the configuration for dividing the plurality of sequences; A subset of sequences for conveying the payload is determined from a first sequence pool of the plurality of sequence pools, at least in part based on the configuration, wherein the size of the subset of sequences is at least in part based on the number of multiple bits of the payload; as well as The payload comprising the plurality of bits is received using a selected sequence from the subset of sequences, the selected sequence being at least in part based on a mapping between the subset of sequences and the plurality of bits.
18. The method of claim 17, further comprising: A second subset of sequences for conveying a second payload is determined from a second sequence pool of the plurality of sequence pools, at least in part based on the configuration, wherein the size of the second subset of sequences is at least in part based on a second number of a second plurality of bits of the second payload; as well as The second payload, comprising the second plurality of bits, is received using a second selected sequence from the second sequence subset, the second selected sequence being at least partially based on a second mapping between the second sequence subset and the second plurality of bits.
19. The method of claim 17, further comprising: The first sequence pool is determined at least in part based on the configuration, wherein the first sequence pool is associated with the first UE.
20. The method of claim 19, wherein, Determining the first sequence pool includes: Determine a pool of consecutive sequences among the plurality of sequences.
21. The method of claim 19, further comprising: Determine the interleaving value, wherein the determination of the first sequence pool is based at least in part on the interleaving value; as well as Transmit the interleaved value.
22. The method of claim 21, wherein, Determining the first sequence pool includes: Determine a first number of sequences corresponding to the interleaving values; and A second number of sequences corresponding to the interleaving value are determined at least in part based on the number of the plurality of UEs and the interleaving value, at a distance from the first number of sequences.
23. An apparatus for conducting wireless communication at a user equipment (UE), comprising: One or more processors; Memory coupled to the one or more processors; as well as Instructions, stored in the memory and operable when executed by the one or more processors, to cause the device to: Receive configuration for dividing multiple sequences into multiple sequence pools associated with multiple UEs; An initial seed is determined, wherein each of the plurality of sequence pools is aligned with each other at least in part based on the initial seed; A subset of sequences for conveying the payload is determined from a first sequence pool of the plurality of sequence pools, at least in part based on the configuration, wherein the size of the subset of sequences is at least in part based on the number of multiple bits of the payload; A sequence is selected from the sequence subset based at least in part on the mapping between the sequence subset and the plurality of bits; as well as The selected sequence is used to transmit the payload, which includes the plurality of bits.
24. The apparatus of claim 23, wherein, When executed by the one or more processors, the instructions are further operable to cause the device to: The first sequence pool is determined at least in part based on the configuration, wherein the first sequence pool is associated with the UE.
25. The apparatus of claim 24, wherein, The instructions for determining the first sequence pool are operable, when executed by the one or more processors, to cause the device to: Determine a pool of consecutive sequences among the plurality of sequences.
26. The apparatus of claim 24, wherein, When executed by the one or more processors, the instructions are further operable to cause the device to: Receive interleaved values, wherein the determination of the first sequence pool is based at least in part on the interleaved values.
27. The apparatus of claim 26, wherein, The instructions for determining the first sequence pool are operable, when executed by the one or more processors, to cause the device to: Determine a first number of sequences corresponding to the interleaving values; and A second number of sequences corresponding to the interleaving value are determined at least in part based on the number of the plurality of UEs and the interleaving value, at a distance from the first number of sequences.
28. The apparatus of claim 23, wherein the initial seed is at least partially based on a UE identifier, a slot identifier, a frame identifier, or any combination thereof; and wherein the instructions, when executed by the one or more processors, are further operable to cause the apparatus to: The first sequence pool is generated at least in part based on the initial seed.
29. The apparatus of claim 28, wherein, When executed by the one or more processors, the instructions are further operable to cause the device to: Receive an indication of the UE identifier.
30. The apparatus of claim 28, wherein, The first sequence pool is generated at least in part based on a pseudo-random number generator.
31. The apparatus of claim 28, wherein, The first sequence pool is generated at least in part based on the longest sequence.
32. The apparatus of claim 23, wherein, When executed by the one or more processors, the instructions are further operable to cause the device to: The first subset of the orthogonal matrix and the second subset of the cyclically shifted, cell-specific sequences are identified at least in part based on the configuration. as well as The first sequence pool is generated at least in part based on the product of the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequence.
33. The apparatus of claim 32, wherein, The first subset of the orthogonal matrix and the second subset of the cyclically shifted, cell-specific sequence include continuous indices, interleaved indices, or any combination thereof.
34. The apparatus of claim 23, wherein, When executed by the one or more processors, the instructions are further operable to cause the device to: The plurality of sequences are generated at least in part based on the product of an orthogonal matrix having a size corresponding to the number of time periods and a cyclically shifted, cell-specific sequence having a length corresponding to the number of frequency modulations, wherein the number of time periods and the number of frequency modulations include resource allocation for communicating the payload. The first subset of the orthogonal matrix and the second subset of the cyclically shifted, cell-specific sequences are identified at least in part based on the configuration. as well as The first sequence pool is determined from the plurality of sequences based at least in part on the first index subset of the orthogonal matrix and the second index subset of the cyclically shifted, cell-specific sequences.
35. The apparatus of claim 34, wherein, The first subset of the orthogonal matrix and the second subset of the cyclically shifted, cell-specific sequence include continuous indices, interleaved indices, or any combination thereof.
36. The apparatus of claim 23, wherein, When executed by the one or more processors, the instructions are further operable to cause the device to: The plurality of bits are converted into decimal numbers, wherein the mapping between the sequence subset and the plurality of bits is based at least in part on the mapping between the decimal numbers and the indices of the sequence subset.
37. The apparatus of claim 23, wherein, The sequence subset includes a codebook for conveying the payload comprising the plurality of bits.
38. The apparatus of claim 37, wherein, The mapping includes a mapping between the index of the codebook and the plurality of bits, and the plurality of bits includes a bit stream of the payload.
39. An apparatus for wireless communication at a network entity, comprising: One or more processors; Memory coupled to the one or more processors; as well as Instructions, stored in the memory and operable when executed by the one or more processors, to cause the device to: Determine the configuration for dividing multiple sequences into multiple sequence pools associated with multiple user equipment (UEs); An initial seed is determined, wherein each of the plurality of sequence pools is aligned with each other at least in part based on the initial seed; Transmit the configuration for dividing the plurality of sequences; A subset of sequences for conveying the payload is determined from a first sequence pool of the plurality of sequence pools, at least in part based on the configuration, wherein the size of the subset of sequences is at least in part based on the number of multiple bits of the payload; as well as The payload comprising the plurality of bits is received using a selected sequence from the subset of sequences, the selected sequence being at least in part based on a mapping between the subset of sequences and the plurality of bits.
40. The apparatus of claim 39, wherein, When executed by the one or more processors, the instructions are further operable to cause the device to: A second subset of sequences for conveying a second payload is determined from a second sequence pool of the plurality of sequence pools, at least in part based on the configuration, wherein the size of the second subset of sequences is at least in part based on a second number of a second plurality of bits of the second payload; as well as The second payload, comprising the second plurality of bits, is received using a second selected sequence from the second sequence subset, the second selected sequence being at least partially based on a second mapping between the second sequence subset and the second plurality of bits.
41. The apparatus of claim 39, wherein, When executed by the one or more processors, the instructions are further operable to cause the device to: The first sequence pool is determined at least in part based on the configuration, wherein the first sequence pool is associated with the first UE.
42. The apparatus of claim 41, wherein, The instructions for determining the first sequence pool are operable, when executed by the one or more processors, to cause the device to: Determine a pool of consecutive sequences among the plurality of sequences.
43. The apparatus of claim 41, wherein, When executed by the one or more processors, the instructions are further operable to cause the device to: Determine the interleaving value, wherein determining the first sequence pool is at least partially based on the interleaving value; and Transmit the interleaved value.
44. The apparatus of claim 43, wherein, The instructions for determining the first sequence pool are operable, when executed by the one or more processors, to cause the device to: Determine a first number of sequences corresponding to the interleaving values; and A second number of sequences corresponding to the interleaving value are determined at least in part based on the number of the plurality of UEs and the interleaving value, at a distance from the first number of sequences.
Citation Information
Patent Citations
User equipment shift randomization for uplink control channel transmission
US20190165879A1