Multi-user multiplexing of orthogonal time frequency space signals

Information

  • Patent Grant
  • 11451348
  • Patent Number
    11,451,348
  • Date Filed
    Thursday, December 31, 2020
    3 years ago
  • Date Issued
    Tuesday, September 20, 2022
    a year ago
Abstract
A method for performing downlink transmissions from a transmitting device to multiple user devices using transmission resources from a multi-dimensional grid of resources is described. The method includes logically partitioning the transmission resources into multiple segments, assigning, to a given user device of the multiple user devices, transmission resources of one or more of the multiple segments, and performing, using at least some of the assigned transmission resources for the given user device, a downlink transmission using an orthogonal time frequency space (OTFS) transformation on data or signals to be transmitted to the given user device.
Description
TECHNICAL FIELD

The present document relates to wireless communication, and more particularly, transmission and reception of multi-user signals in single-input-single-output (SISO) and multiple-input-multiple-output (MIMO) systems.


BACKGROUND

Due to an explosive growth in the number of wireless user devices and the amount of wireless data that these devices can generate or consume, current wireless communication networks are fast running out of bandwidth to accommodate such a high growth in data traffic and provide high quality of service to users.


Various efforts are underway in the telecommunication industry to come up with next generation of wireless technologies that can keep up with the demand on performance of wireless devices and networks.


SUMMARY

This document discloses techniques for multiplexing, in the uplink and/or downlink direction, signals from/to multiple user devices.


In one example aspect, a method for performing downlink transmissions from a transmitting device to multiple user devices using transmission resources from a multi-dimensional grid of resources is disclosed. The method includes logically partitioning the transmission resources into multiple segments, assigning, to a given user device of the multiple user devices, transmission resources of one or more of the multiple segments, and performing, using at least some of the assigned transmission resources for the given user device, a downlink transmission using an orthogonal time frequency space (OTFS) transformation on data or signals to be transmitted to the given user device.


In another aspect, a wireless communication method for performing uplink transmissions from multiple user devices using transmission resources from a multi-dimensional grid of resources to a receiving device is disclosed. The method includes logically partitioning the transmission resources into multiple segments, assigning, to a given user device of the multiple user devices, transmission resources of one or more of the multiple segments, and performing, an uplink transmission from the given user device using at least some of the assigned transmission resources for the given user device, wherein the uplink transmission includes data that has undergone an orthogonal time frequency space (OTFS) transform.


In yet another aspect, a method for performing transmissions between a wireless device to multiple user devices is disclosed. The method includes logically grouping the multiple user devices into a first group of user devices and a second group of user devices, allocating a first group of transmission resources to the first group of user devices and a second group of transmission resources to the second group of user devices by multiplexing along a first dimension of a first multi-dimensional representation of transmission resources, allocating, from the first group of transmission resources, transmissions resources to user devices in the first group by multiplexing along a second dimension in a second multi-dimensional representation of the transmission resources, and performing a transmission between the wireless device and at least one user device using corresponding allocated transmission resources.


In yet another aspect, a wireless communication method, implemented at a network-side equipment, for receiving an orthogonal time frequency space (OTFS) signal comprising a multiplex of uplink transmissions from multiple user equipment, is disclosed. The method includes performing joint equalization on the multiplex to generate jointly equalized symbols, extracting, from the jointly equalized symbols, symbols corresponding to a given transmitting device based on extrinsic information about transmission resource location of the symbols, demapping the extracted symbols and performing forward error correction to generate output bits, and generating a feedback signal based on the output bits for improving the joint equalization in a next iteration.


In yet another aspect, a method for receiving an orthogonal time frequency space (OTFS) signal comprising a multiplex of transmissions for multiple receiving devices is disclosed. The method includes performing joint equalization on the multiplex to generate jointly equalized symbols, extracting, from the jointly equalized symbols, symbols corresponding to one or more receiving devices, and demapping the extracted symbols and performing forward error correction to generate output bits, and generating a feedback signal based on the output bits for improving the joint equalization in a next iteration.


In yet another aspect, a wireless device comprising a processor configured to implement one of the above-described methods is disclosed.


In yet another aspect, a computer-readable memory storing instructions that, when executed by a processor, cause the processor to implement one of the described methods is disclosed.


These, and other, features and embodiments are described in this document.





DESCRIPTION OF THE DRAWINGS

Drawings described herein are used to provide a further understanding and constitute a part of this application. Example embodiments and illustrations thereof are used to explain the technology rather than limiting its scope.



FIG. 1 shows an example communication network.



FIG. 2 shows an example of transmission resource allocation based on multiplexing in the delay-Doppler grid along the delay dimension.



FIG. 3 shows an example of a multi-user uplink communication system.



FIG. 4 shows an example of a multi-user downlink communication system.



FIG. 5 is a block diagram of an example implementation of a multi-user iterative receiver.



FIG. 6 shows an example of allocation of transmission resource in the time-frequency grid along the frequency dimension.



FIG. 7 shows an example of allocation of transmission resources for transmissions between one or more user devices and a wireless device by multiplexing both in the delay-Doppler domain and in the time-frequency domain.



FIG. 8 shows a flowchart of an example wireless communication downlink transmission method.



FIG. 9 shows a flowchart of an example wireless communication uplink transmission method.



FIG. 10 shows an example of a wireless transceiver apparatus.



FIG. 11 shows a flowchart of an example of a wireless communication method.



FIG. 12 shows a flowchart of an example of a wireless communication method.



FIG. 13 shows a flowchart of an example of a wireless communication method.





DETAILED DESCRIPTION

To make the purposes, technical solutions and advantages of this disclosure more apparent, various embodiments are described in detail below with reference to the drawings. Unless otherwise noted, embodiments and features in embodiments of the present document may be combined with each other.


Section headings are used in the present document, including the appendices, to improve readability of the description and do not in any way limit the discussion to the respective sections only.



FIG. 1 shows an example communication network 100 in which the disclosed technologies can be implemented. The network 100 may include a base station transmitter that transmits wireless signals s(t) (downlink signals) to one or more receivers 102, the received signal being denoted as r(t), which may be located in a variety of locations, including inside or outside a building and in a moving vehicle. The receivers may transmit uplink transmissions to the base station, typically located near the wireless transmitter. The technology described herein may be implemented at a receiver 102.


BRIEF INTRODUCTION

The orthogonal time frequency space (OTFS) transform may be used to transform constellation symbols placed on a delay-Doppler grid to symbols on a time-frequency grid. These time-frequency symbols may then be modulated using Orthogonal Frequency Division Multiplexing (OFDM) and transmitted over a fading channel of a wireless system.


Wireless systems are often configured to have a base station on the network side and multiple user devices (abbreviated as users) deployed in an area. The transmissions from the user devices to the base station are called uplink transmissions, while transmissions from the base station to the user devices are called downlink transmissions. To accommodate transmissions to and from the user devices, there are two multi-user schemes, which are often used in different communication systems:


Multi-user uplink—where different users are transmitting at the same time (subject to being time division multiplexed), sharing the bandwidth, but experiencing different channels and all the signals are received by a single receiver (e.g., a base station), which decodes all the users.


Multi-user downlink—where a single transmitter sends data to several different users over a shared bandwidth. Each user device receives a signal, which experiences a generally different channel and decodes only the data targeted to itself.


While the various transmission and reception techniques are described in the present document with reference to uplink and downlink transmissions, the techniques are also applicable to other situations when transmissions are made between a transmitting wireless device and multiple wireless devices in both directions. Such examples include, e.g., ad hoc networks that may be established among wireless devices.


When OTFS signal is used, the prevalent OFDM transmission technologies do not address ways that can effectively multiplex the OTFS transmissions. The techniques disclosed in this document can be used for multi-user to share and decode an OTFS signal.


While various embodiments are described with the example of a delay-Doppler domain or a time-frequency domain representation of transmission resources, in general, transmission bandwidth may be represented in multiple dimensions, with each of the multiple dimensions having an orthogonal relationship with other dimensions.


Multiplexing in the Delay-Doppler Domain


One possible way to share an OTFS signal (or OTFS transmission resources) between multiple user devices is to multiplex the user devices in the delay-Doppler domain, meaning, to allocate different portions of the resource grid to different users. This allocation may be arbitrary, but to simplify the receiver, it may be better to multiplex the users along one of the grid dimensions, either along the delay or the Doppler dimension. FIG. 2 shows an example for multiplexing users in the delay-Doppler grid, along the delay dimension.


Multi-User Uplink Transmission Scheme



FIG. 3 shows an example of 3 user devices (user 1, user 2 and user 3) multiplexed in the delay-Doppler grid (along delay). Each user occupies a different portion of the delay-Doppler grid, having the rest of the grid unallocated (zeros). Each user may add specific reference signals to its transmission to enable channel estimation at the receiver. The users are transmitted simultaneously over different channels (H1, . . . , H3) and received together at a single receiver. After applying the inverse OTFS transform, the receiver's delay-Doppler grid contains all the received users. As depicted in FIG. 3, the uplink signals from a user device may be transformed using an OTFS transform into an OFDM signal. A waveform generator may assign transmissions resources to the OFDM signal along the time-frequency grid. In addition, the waveform generator may also include reference signals. The resulting signal may be transmitted to the multi-user receiver device. At the receiver device, the received signal may be inverse transformed using an OTFS inverse transform and the resulting signals may be demultiplexed into signals originating from the multiple user devices.


Examples of Multi-User Downlink Transmission Schemes



FIG. 4 shows an example of 3 users sharing a transmission and received by 3 different receivers after experiencing 3 different channels. Each user decodes only its specific data. As depicted, the single transmission device may multiplex signals from multiple user devices, transform them into the OFDM time-frequency grid, optionally add reference signals and transmit to the user devices. At the user devices, each user device may receive the transmission, and extract the data that is intended for transmission to the user device.


Examples of Multi-User Iterative Receiver Embodiments


One possible implementation of a multi-user receiver includes an iterative scheme, where an equalizer gets extrinsic prior information about the users' symbols. The extrinsic information may include information that allows the receiver device to successfully demultiplex a signal that includes transmissions from the multiple transmitting devices. For example, the extrinsic information may include a schedule allocated to the multiple transmitting devices. The equalizer may perform linear Minimum Mean Squared Error (MMSE) filtering for each user device to extract the corresponding estimated symbols on the time-frequency grid. Then, these symbols are transformed to the delay-Doppler grid using an inverse OTFS transform, converted to bit likelihoods and possibly forward error correction (FEC) decoded. From the FEC of each user, the likelihoods of the of coded bits are converted to symbols' prior information and transformed back to the time-frequency grid using an OTFS transform. The equalization of each specific user also may take into account the prior information of all the other users. FIG. 5 shows an example of such a receiver for three uplink users. An equivalent receiver for a downlink user may only include of a single processing chain for that specific target user.


Multiplexing in the Time-Frequency Domain


In general, in various embodiments, other type of multiplexing is also possible, such as multiplexing users in the time-frequency grid (FIG. 6) or combining multiplexing in delay-Doppler and multiplexing in time-frequency (FIG. 7). In particular, as depicted in FIG. 7, in some embodiments, multiplexing may be achieved in two stages. In the first stage, transmissions from multiple user devices in a first group may be multiplexed in the delay dimension and a second group may be separately multiplexed in the delay dimension (or another suitable dimension along a multi-dimensional resource grid). The resulting signal output may then be multiplexed in the frequency domain as the first user group (User group 1) and the second user group (user group 2). In FIG. 7, the user devices 1, 2, and so on in the first user group and the second user groups may represent different user devices. In general, the user groups may have a different number of user devices (N1 and N2, where N1 and N2 are equal to 1 or more).



FIG. 8 is a flowchart of an example method 800 for performing downlink transmissions from a transmitting device to multiple user devices using transmission resources from a multi-dimensional grid of resources. The method includes logically partitioning (802) the transmission resources into multiple segments, assigning (804), to a given user device of the multiple user devices, transmission resources of one or more of the multiple segments, and performing (806), using at least some of the assigned transmission resources for the given user device, a downlink transmission using an orthogonal time frequency space (OTFS) transformation on data or signals to be transmitted to the given user device.


In some embodiments, the logically partitioning the transmission resource includes multiplexing the transmission resources along one dimension of the multi-dimensional grid of resources. In some embodiments, the multi-dimensional grid of resources includes a delay dimension and a Doppler dimension and wherein the multiplexing the transmission resources includes multiplexing the transmission resources along the delay dimension. Alternatively, in some embodiments, the multi-dimensional grid of resources includes a delay dimension and a Doppler dimension and wherein the multiplexing the transmission resources includes multiplexing the transmission resources along the Doppler dimension. In some embodiments, the multi-dimensional grid or resources includes a time dimension and a frequency dimension and wherein the multiplexing the transmission resources includes multiplexing the transmission resources along the frequency dimension. In some embodiments, the multi-dimensional grid or resources includes a time dimension and a frequency dimension and wherein the multiplexing the transmission resources includes multiplexing the transmission resources along the time dimension.


In some embodiments, the downlink transmission includes a reference signal to enable channel estimation by the given user device. For example, the reference signal is based on an identity of the given user device. In some embodiments, the multi-dimensional grid may represent a two-dimensional resource grid such as the time-frequency grid or the delay-Doppler grid of resources. In some embodiments, the partitioning of resources may be non-uniformly spaced in the multi-dimensional grid of resources. For example, some user devices may be allocated more transmission resources than other devices, based on their application layer bandwidth requests.



FIG. 9 is a flowchart of an example method 900 for performing uplink transmissions from multiple user devices using transmission resources from a multi-dimensional grid of resources to a receiving device. The method 900 includes logically partitioning (902) the transmission resources into multiple segments, assigning (904), to a given user device of the multiple user devices, transmission resources of one or more of the multiple segments, and performing (906), an uplink transmission from the given user device using at least some of the assigned transmission resources for the given user device, wherein the uplink transmission includes data that has undergone an orthogonal time frequency space (OTFS) transform.


In some embodiments, the logically partitioning the transmission resource includes multiplexing the transmission resources along one dimension of the multi-dimensional grid of resources. In some embodiments, the multi-dimensional grid or resources includes a delay dimension and a Doppler dimension and wherein the multiplexing the transmission resources includes multiplexing the transmission resources along the delay dimension. In some embodiments, the multi-dimensional grid or resources includes a delay dimension and a Doppler dimension and wherein the multiplexing the transmission resources includes multiplexing the transmission resources along the Doppler dimension. In some embodiments, the two dimensional grid or resources includes a delay dimension and a Doppler dimension and wherein the multiplexing the transmission resources includes multiplexing the transmission resources along the frequency dimension. In some embodiments, the two dimensional grid or resources includes a delay dimension and a Doppler dimension and wherein the multiplexing the transmission resources includes multiplexing the transmission resources along the time dimension.


In some embodiments the uplink transmission includes a reference signal to enable channel estimation by the receiving device. The reference signal may be based on an identity of the receiving signal. For example, the reference signal may be specifically designed to allow the receiving design to perform channel equalization, and other optimization functions.



FIG. 10 shows an example of a wireless transceiver apparatus 500. The apparatus 500 may be used to implement method 200. The apparatus 500 includes a processor 502, a memory 504 that stores processor-executable instructions and data during computations performed by the processor. The apparatus 500 includes reception and/or transmission circuitry 506, e.g., including radio frequency operations for receiving or transmitting signals.



FIG. 11 is a flowchart for a method 1100 for performing transmissions between a wireless device to multiple user devices. The method 1100 includes logically grouping (1102) the multiple user devices into a first group of user devices and a second group of user devices, allocating (1104) a first group of transmission resources to the first group of user devices and a second group of transmission resources to the second group of user devices by multiplexing along a first dimension of a first multi-dimensional representation of transmission resources, allocating (1106), from the first group of transmission resources, transmissions resources to user devices in the first group by multiplexing along a second dimension in a second multi-dimensional representation of the transmission resources, and performing (1108) a transmission between the wireless device and at least one user device using corresponding allocated transmission resources.


In some embodiments, the first multi-dimensional representation comprises a time-frequency representation and the second multi-dimensional representation comprises a delay-Doppler representation. In various embodiments, the first dimension may be frequency or time dimension and the second dimension may be delay or Doppler dimension. In some embodiments, the user groups may include one device, or more than one devices.



FIG. 12 is a flowchart of a method 1200 for receiving an orthogonal time frequency space (OTFS) signal comprising a multiplex of transmissions from multiple transmitting devices. The method 1200 includes performing (1202) joint equalization on the multiplex to generate jointly equalized symbols, extracting (1204), from the jointly equalized symbols, symbols corresponding to a given transmitting device based on extrinsic information about transmission resource location of the symbols, demapping (1206) the extracted symbols and performing forward error correction to generate output bits, and generating (1208) a feedback signal based on the output bits for improving the joint equalization in a next iteration.


In some embodiments, the operation of the generating the feedback signal includes performing symbol mapping followed by OTFS transforming results of the symbol mapping to generate the feedback signal. In some embodiments, the operation of generating the output bits for the user device includes performing inverse OTFS modulation.



FIG. 13 is a flowchart representation of a method 1300 for receiving an orthogonal time frequency space (OTFS) signal comprising a multiplex of transmissions for multiple receiving devices. The method 1300 includes performing (1302) joint equalization on the multiplex to generate jointly equalized symbols, extracting (1304), from the jointly equalized symbols, symbols corresponding to one or more receiving devices, and demapping the extracted symbols and performing forward error correction to generate output bits, and generating (1306) a feedback signal based on the output bits for improving the joint equalization in a next iteration.


In some embodiments, the generating the feedback signal includes performing symbol mapping followed by OTFS transforming results of the symbol mapping to generate the feedback signal. In some embodiments, the operation of generating the output bits for the receiving device includes performing inverse OTFS modulation.


It will be appreciated that the disclosed techniques can be used to improve reception performance of wireless apparatus and/or reduce complexity of implementation.


The disclosed and other embodiments, modules and the functional operations described in this document can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this document and their structural equivalents, or in combinations of one or more of them. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.


A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a standalone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.


The processes and logic flows described in this document can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).


Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Computer readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and CD ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.


While this patent document contains many specifics, these should not be construed as limitations on the scope of an invention that is claimed or of what may be claimed, but rather as descriptions of features specific to particular embodiments. Certain features that are described in this document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable sub-combination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a sub-combination or a variation of a sub-combination. Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results.


Only a few examples and implementations are disclosed. Variations, modifications, and enhancements to the described examples and implementations and other implementations can be made based on what is disclosed.

Claims
  • 1. A wireless communication method for performing transmissions between a wireless device to multiple user devices, comprising: logically grouping the multiple user devices into a first group of user devices and a second group of user devices;allocating a first group of transmission resources to the first group of user devices and a second group of transmission resources to the second group of user devices by multiplexing along a first dimension of a first multi-dimensional representation of transmission resources;allocating, from the first group of transmission resources, transmissions resources to user devices in the first group by multiplexing along a second dimension in a second multi-dimensional representation of the transmission resources; andperforming a transmission between the wireless device and at least one user device using corresponding allocated transmission resources.
  • 2. The method of claim 1, wherein the first multi-dimensional representation comprises a time-frequency representation and the second multi-dimensional representation comprises a delay-Doppler representation.
  • 3. The method of claim 2, wherein the first dimension of the first multi-dimensional representation comprises a frequency dimension.
  • 4. The method of claim 2, wherein the first dimension of the first multi-dimensional representation comprises a time dimension.
  • 5. The method of claim 2, wherein the second dimension of the second multi-dimensional representation comprises a delay dimension.
  • 6. The method of claim 2, wherein the second dimension of the second multi-dimensional representation comprises a Doppler dimension.
  • 7. The method of claim 2, wherein the transmission is performed from the wireless device to the at least one user device.
  • 8. The method of claim 2, wherein the transmission is performed from the at least one user device to the wireless device.
  • 9. The method of claim 1, wherein the first group of receiving devices includes one or more receiving devices and the second group of receiving devices includes one or more receiving devices.
  • 10. The method of claim 1, wherein the transmissions include a reference signal that enables channel estimation by a given receiving device.
  • 11. The method of claim 1, wherein the reference signal is based on an identity of the given transmitting device.
  • 12. The method of claim 1, wherein the logical partitioning of the transmission resources is non-uniformly spaced in the multi-dimensional grid of resources.
  • 13. A wireless device comprising a processor configured to implement a method for wireless communication, comprising: logically grouping multiple user devices into a first group of user devices and a second group of user devices;allocating a first group of transmission resources to the first group of user devices and a second group of transmission resources to the second group of user devices by multiplexing along a first dimension of a first multi-dimensional representation of transmission resources;allocating, from the first group of transmission resources, transmissions resources to user devices in the first group by multiplexing along a second dimension in a second multi-dimensional representation of the transmission resources; andperforming a transmission between the wireless device and at least one user device using corresponding allocated transmission resources.
  • 14. The wireless device of claim 13, wherein the logical partitioning of the transmission resources is non-uniformly spaced in the multi-dimensional grid of resources.
  • 15. The wireless device of claim 13, wherein the first multi-dimensional representation comprises a time-frequency representation and the second multi-dimensional representation comprises a delay-Doppler representation.
  • 16. The wireless device of claim 15, wherein the first dimension of the first multi-dimensional representation comprises a frequency dimension or a time dimension and the second dimension of the second multi-dimensional representation comprises a delay dimension or a Doppler dimension.
  • 17. The wireless device of claim 13, wherein the first group of receiving devices includes one or more receiving devices and the second group of receiving devices includes one or more receiving devices.
  • 18. The wireless device of claim 13, wherein the transmission includes a reference signal that enables channel estimation by a given receiving device.
  • 19. The wireless device of claim 18, wherein the reference signal is based on an identity of the given receiving device.
CROSS REFERENCE TO RELATED APPLICATIONS

This patent document is a divisional of U.S. application Ser. No. 16/273,482, filed Feb. 12, 2019, which is a continuation of PCT Application No. PCT/US2017/046604, filed Aug. 11, 2017, entitled “MULTI-USER MULTIPLEXING OF ORTHOGONAL TIME FREQUENCY SPACE SIGNALS” which claims the benefits and priority of U.S. Provisional Patent Application No. 62/374,705, filed Aug. 12, 2016, entitled “MULTI-USER MULTIPLEXING OF ORTHOGONAL TIME FREQUENCY SPACE SIGNALS”. The entire content of the before-mentioned patent applications is incorporated by reference as part of the disclosure of this application.

US Referenced Citations (181)
Number Name Date Kind
4754493 Coates Jun 1988 A
5083135 Nagy et al. Jan 1992 A
5182642 Gersdorff et al. Jan 1993 A
5623511 Bar-David et al. Apr 1997 A
5831977 Dent Nov 1998 A
5872542 Simons et al. Feb 1999 A
5956624 Hunsinger et al. Sep 1999 A
6212246 Hendrickson Apr 2001 B1
6289063 Duxbury Sep 2001 B1
6356555 Rakib et al. Mar 2002 B1
6388621 Lynch May 2002 B1
6426983 Rakib et al. Jul 2002 B1
6608864 Strait Aug 2003 B1
6631168 Izumi Oct 2003 B2
6704366 Combes et al. Mar 2004 B1
6956814 Campanella Oct 2005 B1
7010048 Shattil Mar 2006 B1
7327812 Auer Feb 2008 B2
7392018 Ebert et al. Jun 2008 B1
7689049 Monro Mar 2010 B2
7773685 Tirkkonen et al. Aug 2010 B2
7864877 Hottinen Jan 2011 B2
8229017 Lee et al. Jul 2012 B1
8259845 Dent Sep 2012 B2
8401131 Fety et al. Mar 2013 B2
8547988 Hadani et al. Oct 2013 B2
8619892 Vetter et al. Dec 2013 B2
8717210 Eldar et al. May 2014 B2
8879378 Rakib et al. Nov 2014 B2
8892048 Turner Nov 2014 B1
8976851 Hadani et al. Mar 2015 B2
9031141 Hadani et al. May 2015 B2
9071285 Hadani et al. Jun 2015 B2
9071286 Hadani et al. Jun 2015 B2
9083483 Rakib et al. Jul 2015 B1
9083595 Rakib et al. Jul 2015 B2
9130638 Hadani et al. Sep 2015 B2
9282528 Hashimoto Mar 2016 B2
9294315 Hadani et al. Mar 2016 B2
9444514 Hadani et al. Sep 2016 B2
9548840 Hadani et al. Jan 2017 B2
9553984 Krause et al. Jan 2017 B2
9590779 Hadani et al. Mar 2017 B2
9634719 Rakib et al. Apr 2017 B2
9660851 Hadani et al. May 2017 B2
9668148 Hadani et al. May 2017 B2
9712354 Hadani et al. Jul 2017 B2
9729281 Hadani et al. Aug 2017 B2
20010031022 Petrus et al. Oct 2001 A1
20010033614 Hudson Oct 2001 A1
20010046205 Easton et al. Nov 2001 A1
20020001308 Heuer Jan 2002 A1
20020034191 Shattil Mar 2002 A1
20020181388 Jain et al. Dec 2002 A1
20020181390 Mody et al. Dec 2002 A1
20020181607 Izumi Dec 2002 A1
20030073464 Giannakis et al. Apr 2003 A1
20030185295 Yousef Oct 2003 A1
20030235147 Walton et al. Dec 2003 A1
20040044715 Aldroubi et al. Mar 2004 A1
20040174812 Murakami et al. Sep 2004 A1
20040189581 Sako et al. Sep 2004 A1
20040218523 Varshney et al. Nov 2004 A1
20050157778 Trachewsky et al. Jul 2005 A1
20050157820 Wongwirawat et al. Jul 2005 A1
20050180517 Abe Aug 2005 A1
20050207334 Hadad Sep 2005 A1
20050251844 Martone et al. Nov 2005 A1
20060008021 Bonnet Jan 2006 A1
20060039270 Strohmer et al. Feb 2006 A1
20070014272 Palanki et al. Jan 2007 A1
20070038691 Candes et al. Feb 2007 A1
20070078661 Sriram et al. Apr 2007 A1
20070104283 Han et al. May 2007 A1
20070110131 Guess et al. May 2007 A1
20070211952 Faber et al. Sep 2007 A1
20070237181 Cho et al. Oct 2007 A1
20070253465 Muharemovic et al. Nov 2007 A1
20070253504 Hasegawa Nov 2007 A1
20080043857 Dias et al. Feb 2008 A1
20080117999 Kadous et al. May 2008 A1
20080186843 Ma et al. Aug 2008 A1
20080187062 Pan et al. Aug 2008 A1
20080232504 Ma et al. Sep 2008 A1
20080310383 Kowalski Dec 2008 A1
20090080403 Hamdi Mar 2009 A1
20090092259 Jot et al. Apr 2009 A1
20090103558 Zangi Apr 2009 A1
20090103593 Bergamo Apr 2009 A1
20090122854 Zhu et al. May 2009 A1
20090161804 Chrabieh et al. Jun 2009 A1
20090204627 Hadani Aug 2009 A1
20090222226 Baraniuk et al. Sep 2009 A1
20090303961 Popovic et al. Dec 2009 A1
20100001901 Baraniuk et al. Jan 2010 A1
20100008432 Kim et al. Jan 2010 A1
20100027608 Priotti Feb 2010 A1
20100111138 Hosur et al. May 2010 A1
20100142476 Jiang et al. Jun 2010 A1
20100187914 Rada et al. Jul 2010 A1
20100238787 Guey Sep 2010 A1
20100277308 Potkonjak Nov 2010 A1
20100297936 Nan Nov 2010 A1
20100303136 Ashikhmin et al. Dec 2010 A1
20100322349 Lee et al. Dec 2010 A1
20110007789 Garmany Jan 2011 A1
20110110532 Svendsen May 2011 A1
20110116489 Grandhi May 2011 A1
20110116516 Hwang et al. May 2011 A1
20110126071 Han et al. May 2011 A1
20110131463 Gunnam Jun 2011 A1
20110216808 Tong et al. Sep 2011 A1
20110286502 Adachi et al. Nov 2011 A1
20110287778 Levin et al. Nov 2011 A1
20110292971 Hadani et al. Dec 2011 A1
20110293030 Rakib et al. Dec 2011 A1
20110299379 Sesia et al. Dec 2011 A1
20110305267 Riu et al. Dec 2011 A1
20120021769 Lindoff et al. Jan 2012 A1
20120051457 Ma et al. Mar 2012 A1
20120140716 Baldemair et al. Jun 2012 A1
20120170684 Yim et al. Jul 2012 A1
20120201322 Rakib et al. Aug 2012 A1
20120213098 Sun Aug 2012 A1
20120235795 Liao et al. Sep 2012 A1
20120269201 Atungsiri et al. Oct 2012 A1
20120272117 Stadelmeier et al. Oct 2012 A1
20120320994 Loghin et al. Dec 2012 A1
20130021977 Yang et al. Jan 2013 A1
20130058390 Haas et al. Mar 2013 A1
20130077579 Cho et al. Mar 2013 A1
20130083661 Gupta et al. Apr 2013 A1
20130107791 Oh May 2013 A1
20130121497 Smaragdis et al. May 2013 A1
20130230010 Kim et al. Sep 2013 A1
20130260787 Hashimoto Oct 2013 A1
20130279627 Wu et al. Oct 2013 A1
20130315133 Wang et al. Nov 2013 A1
20140143639 Loghin et al. May 2014 A1
20140161154 Hadani et al. Jun 2014 A1
20140169385 Hadani Jun 2014 A1
20140169406 Hadani et al. Jun 2014 A1
20140169433 Hadani et al. Jun 2014 A1
20140169436 Hadani et al. Jun 2014 A1
20140169437 Hadani et al. Jun 2014 A1
20140169441 Hadani et al. Jun 2014 A1
20140247803 Arambepola et al. Sep 2014 A1
20140348252 Siohan et al. Nov 2014 A1
20140364128 Lee et al. Dec 2014 A1
20150117395 Hadani et al. Apr 2015 A1
20150326273 Rakib et al. Nov 2015 A1
20150327085 Hadani et al. Nov 2015 A1
20150382231 Jabbar et al. Dec 2015 A1
20160043835 Hadani et al. Feb 2016 A1
20160135132 Donepudi et al. May 2016 A1
20160182269 Hadani et al. Jun 2016 A1
20160191217 Hadani et al. Jun 2016 A1
20160191280 Hadani et al. Jun 2016 A1
20160254889 Shattil Sep 2016 A1
20160277225 Frenne et al. Sep 2016 A1
20160309345 Tehrani et al. Oct 2016 A1
20160380743 Rakib Dec 2016 A1
20160381576 Hadani et al. Dec 2016 A1
20170012749 Rakib et al. Jan 2017 A1
20170012810 Rakib et al. Jan 2017 A1
20170019297 Rakib Jan 2017 A1
20170033899 Rakib et al. Feb 2017 A1
20170040711 Rakib et al. Feb 2017 A1
20170078054 Hadani et al. Mar 2017 A1
20170099122 Hadani et al. Apr 2017 A1
20170099607 Hadani et al. Apr 2017 A1
20170149594 Rakib et al. May 2017 A1
20170149595 Rakib et al. May 2017 A1
20170201354 Hadani et al. Jul 2017 A1
20170207817 Hadani et al. Jul 2017 A1
20170222700 Hadani et al. Aug 2017 A1
20170230215 Rakib et al. Aug 2017 A1
20170244524 Hadani et al. Aug 2017 A1
20170295000 Yoo Oct 2017 A1
20190053128 Wang Feb 2019 A1
20190182083 Ashrafi Jun 2019 A1
Foreign Referenced Citations (22)
Number Date Country
1235720 Nov 1999 CN
101682316 Mar 2010 CN
101939935 Jan 2011 CN
111786763 Oct 2020 CN
1432168 Jun 2004 EP
2011127910 Jun 2011 JP
2007004297 Jan 2007 WO
WO-2009026788 Mar 2009 WO
2011137699 Nov 2011 WO
2011150315 Dec 2011 WO
2013148546 Oct 2013 WO
2014004585 Jan 2014 WO
WO-2015149668 Oct 2015 WO
2016014596 Jan 2016 WO
2016014598 Jan 2016 WO
2016176642 Nov 2016 WO
2016183230 Nov 2016 WO
2016183240 Nov 2016 WO
2016209848 Dec 2016 WO
2017003952 Jan 2017 WO
2017011478 Jan 2017 WO
WO-2020095101 May 2020 WO
Non-Patent Literature Citations (73)
Entry
Extended European Search Report for European Application No. 17840372.1, dated Mar. 26, 2020, 10 pages.
Cohere Technologies et al., “OTFS Modulation Waveform and Reference Signals for New RAT”, 3GPP Draft; R1-163619, vol. RAN WG1, No. Busan, South Korea; Apr. 11, 2016-Apr. 15, 2016;Apr. 18, 2016 (Apr. 18, 2016); 15 pages.
Cohere Technologies et al., “Overview of OTFS Waveform for Next Generation RAT”, 3GPP TSG RA WG1 Meeting #84-bis; R1-162929, Busan, South Korea, Apr. 11-15, 2016 3 pages.
Communication Pursuant to Article 94(3) for European Application No. 17840372.1, dated Sep. 24, 2021, 4 pages.
Office Action for U.S. Appl. No. 13/117,119, dated Aug. 5, 2013, 5 pages.
Notice of Allowance for U.S. Appl. No. 13/117,119, dated Feb. 28, 2014, 13 pages.
Banelli, P. et al., “Modulation Formats and Waveforms for 5G Networks: Who Will Be the Heir of OFDM?,” IEEE Signal Processing Magazine, vol. 81, pp. 80-93, Nov. 2014.
El Hattachi, R. et al., “NGMN 5G Initiative White Paper,” NGMN Alliance, Feb. 17, 2015. [Online]. Available: https://www.ngmn.org/uploads/media/NGMN_5G_White_Paper_V1_0.pdf, 125 pages.
Rusek, F. et al., “Scaling Up MIMO, Opportunities and Challenges with Very Large Arrays,” IEEE Signal Processing Magazine, pp. 40-60 (2013).
Vodafone, “Cellular Internet of Things: Architectural Aspects,” RP-150869, 3GPP RAN#68, Malmo, Sweden (Jun. 9, 2015), 19 pages.
Supplementary European Search Report for European Application No. 11787483.4, dated Sep. 9, 2014, 6 pages.
International Search Report and Written Opinion for International Application No. PCT/US2011/038302, dated Nov. 15, 2011, 8 pages.
International Preliminary Report on Patentability for International Application No. PCT/US2011/038302, dated Dec. 4, 2012, 7 pages.
Office Action for U.S. Appl. No. 13/117,124, dated Feb. 22, 2013, 7 pages.
Notice of Allowance for U.S. Appl. No. 13/117,124, dated Aug. 8, 2013, 10 pages.
Office Action for U.S. Appl. No. 14/605,957, dated Jun. 22, 2017, 6 pages.
Supplementary European Search Report for European Application No. 13809004.8, dated Apr. 14, 2016, 8 pages.
Communication Pursuant to Article 94(3) EPC for European Application No. 13809004.8, dated Feb. 17, 2017, 5 pages.
Notice of Allowance for U.S. Appl. No. 13/927,087, dated Feb. 25, 2015, 9 pages.
Office Action for U.S. Appl. No. 13/927,087, dated Nov. 12, 2014, 14 pages.
Gurevich, S. et al. “Group Representation Design of Digital Signals and Sequences,” S.W. Golomb et al. (eds.), SETA 2008, LNCS 5203, pp. 153-166, Springer-Verlag Berlin Heidelberg (2008).
International Search Report and Written Opinion for International Application No. PCT/US2013/047723, dated Oct. 29, 2013, 17 pages.
International Preliminary Report on Patentability for International Application No. PCT/US2013/047723, dated Dec. 31, 2014, 15 pages.
Notice of Allowance for U.S. Appl. No. 13/927,088, dated Feb. 18, 2015, 7 pages.
Office Action for U.S. Appl. No. 13/927,088, dated Nov. 28, 2014, 13 pages.
Notice of Allowance for U.S. Appl. No. 13/927,086, dated Dec. 26, 2014, 8 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 13/927,086, dated Mar. 19, 2015, 4 pages.
Office Action for U.S. Appl. No. 13/927,086, dated Oct. 14, 2014, 10 pages.
Office Action for U.S. Appl. No. 13/927,089, dated Dec. 24, 2014, 13 pages.
Office Action for U.S. Appl. No. 13/927,089, dated Aug. 14, 2015, 7 pages.
Supplemental Notice of Allowability for U.S. Appl. No. 13/927,091, dated Jun. 11, 2015, 4 pages.
Notice of Allowance for U.S. Appl. No. 13/927,091, dated Apr. 24, 2015, 8 pages.
Office Action for U.S. Appl. No. 13/927,091, dated Jan. 27, 2015, 15 pages.
Office Action for U.S. Appl. No. 13/927,092, dated Oct. 8, 2014, 5 pages.
Notice of Allowance for U.S. Appl. No. 13/927,092, dated Oct. 24, 2014, 7 pages.
Office Action for U.S. Appl. No. 13/927,095, dated Apr. 30, 2015, 11 pages.
Office Action for U.S. Appl. No. 13/927,095, dated Nov. 4, 2015, 9 pages.
Office Action for U.S. Appl. No. 13/927,095, dated Jun. 1, 2016, 10 pages.
Office Action for U.S. Appl. No. 14/717,886, dated Apr. 19, 2016, 10 pages.
Office Action for U.S. Appl. No. 14/709,377, dated Dec. 11, 2015, 12 pages.
Office Action for U.S. Appl. No. 14/709,377, dated Jul. 13, 2016, 17 pages.
Examination Report No. 1 for Australian Application No. 2013239970, dated Dec. 8, 2015, 3 pages.
“AT&T Annual Report 2014,” Opening Our Network [Online]. Retrieved from the Internet: Sep. 22, 2016. <URL: http://www.att.com/Investor/ATT_Annual/2014/att_introduces_new_concepts_for_telecom_network.html>, 5 pages.
Catt, “UL ACK/NACK transmission methods for LTE-A,” 3GPP TSG RAN WG1 Meeting #60bis, R1-102453, Beijing, China, Apr. 12-16, 2010, 8 pages.
Toskala, A. et al., “Physical Layer,” Chapter 5 In: “LTE for UMTS: OFDMA and SC-FDMA Based Radio Access,” Holma, H. et al. (eds.), John Wiley & Sons, Ltd., United Kingdom, 2009, pp. 83-135.
Mecklenbrauker, W., “A Tutorial on Non-Parametric Bilinear Time-Frequency Signal Representations,” In: Time and Frequency Representation of Signals and Systems, Longo, G et al. (eds.), Springer-Verlag Wien, vol. 309, pp. 11-68 (1989).
Nehorai, A. et al., “MURI: Adaptive waveform design for full spectral dominance (2005-2010),” AFOSR FA9550-05-1-0443, Final Report, [online], Mar. 11, 2011 Retrieved on May 11, 2013, Retrieved from the Internet <URL: http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=ADA565420>, 103 pages.
Office Action for Japanese Application No. 2015-518647, dated Jul. 7, 2015, 10 pages.
Office Action for U.S. Appl. No. 14/754,596, dated Apr. 19, 2016, 18 pages.
Office Action for U.S. Appl. No. 14/809,129, dated Jul. 19, 2016, 5 pages.
Office Action for U.S. Appl. No. 15/617,962, dated Sep. 6, 2017, 10 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/050825, dated Feb. 8, 2017, 12 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/052524, dated Dec. 20, 2016, 8 pages.
Office Action for U.S. Appl. No. 15/374,995, dated Aug. 7, 2017, 6 pages.
International Search Report and Written Opinion for International Application No. PCT/US2017/025797, dated Jun. 21, 2017, 6 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/030259, dated Aug. 4, 2016, 13 pages.
Office Action for U.S. Appl. No. 15/152,464, dated Apr. 6, 2017, 10 pages.
Examination Report No. 1 for Australian Application No. 2013280487, dated May 2, 2016, 3 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/031928, dated Oct. 7, 2016, 10 pages.
Office Action for U.S. Appl. No. 15/188,946, dated May 8, 2017, 14 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/038584, dated Sep. 26, 2016, 8 pages.
Office Action for U.S. Appl. No. 15/187,668, dated Feb. 16, 2017, 6 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/031909, dated Aug. 11, 2016, 13 pages.
Office Action for U.S. Appl. No. 15/194,494, dated May 5, 2017, 16 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/039662, dated Nov. 29, 2016, 14 pages.
Office Action for U.S. Appl. No. 15/436,653, dated Jun. 2, 2017, 10 pages.
Office Action for U.S. Appl. No. 15/208,545, dated Aug. 21, 2017, 15 pages.
International Search Report and Written Opinion for International Application No. PCT/US2016/041940, dated Oct. 20, 2016, 8 pages.
Supplementary European Search Report for European Application No. 13768150.8, dated Oct. 30, 2015, 7 pages.
International Search Report and Written Opinion for International Application No. PCT/US2013/033652, dated Jun. 12, 2013, 8 pages.
International Search Report and Written Opinion for International Application No. PCT/US2015/041417, dated Oct. 1, 2015, 7 pages.
Office Action for U.S. Appl. No. 14/805,407, dated Dec. 14, 2016, 7 pages.
International Search Report and Written Opinion for International Application No. PCT/US2015/041420, dated Oct. 1, 2015, 6 pages.
Related Publications (1)
Number Date Country
20210126750 A1 Apr 2021 US
Provisional Applications (1)
Number Date Country
62374705 Aug 2016 US
Divisions (1)
Number Date Country
Parent 16273482 Feb 2019 US
Child 17139478 US
Continuations (1)
Number Date Country
Parent PCT/US2017/046604 Aug 2017 US
Child 16273482 US