The present document relates to wireless communication, and more particularly, transmission and reception of multi-level constellation signals.
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.
This document discloses techniques for transmission and reception of signals with improved error-rate performance, using multi-level constellation symbols.
In one example aspect, a method of wireless communication in which data is transmitted in units of transport blocks is disclosed. The method includes dividing bits of the transport block into a number of code blocks, wherein each code block corresponds to a bit-level of a multi-level modulation scheme used for transmission, and wherein a size of each code block is inversely proportional to a corresponding coding rate used for coding the code block,
In another example aspect, an apparatus comprising a processor and a transmitter circuit is disclosed. The apparatus includes a first circuit at which data is received for transmission over network, and a second circuit, which organizes the data into a number of code blocks. The processor processes the code blocks to generate a quadrature amplitude modulation (QAM) modulated output signal. The transmitter circuit that transmits the output signal. Sizes of code blocks are selected such that at least one code block per bit level of a multi-level encoding is used, all code blocks have sizes less than or equal to a maximum size and coded bit levels occupy a same number of QAM symbols
These, and other, features are described in this document.
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.
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 to improve readability of the description and do not in any way limit the discussion to the respective sections.
Fifth generation (5G) wireless systems are expected to provide unprecedented data rates and support a vast range of services. In this context, the 3GPP standards organization is defining the physical layer capabilities the NR (5G New Radio) system to support higher data rates. In the following, processing a basic unit of information, referred to as a transport block (TB), is described including processing coding and modulation applied to the information. The process is suitable for a family of codes that may be referred to as multi-level coding (MLC) codes, which present several important advantages for wireless systems, as described below.
It is expected that MLC codes will be used for error correction coding of data in the next generation communication systems. In some embodiments, MLC codes may be used to provide different levels of robustness, or error protection, to different bit positions in a multi-bit constellation. For example, a number of most significant bits of a multi-level QAM modulation may be protected using different error correction codes than the less significant bits. Current wireless systems, such as a long term evolution (LTE) system defined by the 3GPP consortium, do not provide MLC protection. The LTE system, however, prescribes the use of a transport block (TB) that is encoded and transmitted in a subframe of transmission.
The techniques described in the present document can be used to generate code blocks suitable for MLC at a transmitter and to modulate according to a QAM constellation the code blocks prior to transmission over the medium. Described herein are methods for data segmentation and encoding.
LTE Transport Block Segmentation Procedure
In an LTE system and other system, information is encapsulated in transport blocks (TB), which are transmitted in a given subframe. The information bits in each TB are encoded by the channel encoder prior to transmission. For large TBs, a segmentation process is defined for LTE in 3GPP TS 36.212, “LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding,” (hereinafter “TS 36.212”). In this procedure, the TB is broken into a number of codeblocks (CB) with a given maximum size. For example, the maximum size may be L=6144 bits. A cyclic redundancy code (CRC) is appended to each CB, and an additional CRC is appended at the end of the TB. The LTE process for CB segmentation is detailed in
NR Transport Block Segmentation Procedure
NR also has a block segmentation process defined in 3GPP TS 38.212, “NR; Multiplexing and channel coding”, v0.0.2 (hereinafter, TS 38.212). Information is encapsulated in transport blocks (TB), which are transmitted in a given subframe. The information bits in each TB are encoded by the channel encoder prior to transmission. For large TB, a segmentation procedure is performed. In this procedure, the TB is broken into a number of codeblocks (CB) with a given maximum size such as KCB=8448 bits. Each CB is appended a CRC. The NR procedure for CB segmentation can also be described by
Multi-Level Coding
MLC codes are channel codes that include multiple encoders and/or decoders. When coupled with a quadrature amplitude modulation (QAM), MLC codes may be used to separately encode each bit level in a constellation, from the most significant bit (MSB) to the least significant bit (LSB). Each bit level may be understood to be a parallel bit channel, with each individual encoder in the MLC encoder being used for each parallel bit channel. Any channel code may be used as an individual MLC encoder. Examples include turbo codes, such as the LTE turbo code, and low density parity check (LDPC) codes, such as the NR LDPC code. For a bit level, in-phase and quadrature signals may be encoded jointly. Moreover, several bit levels may be encoded together.
An example is given in
The decoder may decode each parallel bit channel successively (referred to as successive decoding), and use information about already decoded bit channels to improve the decoder performance of ensuing decoders, as illustrated in
Transport Block Segmentation for Multilevel Codes
In order to enable independent operation of the MLC encoders and decoders, a TB is segmented into multiple code blocks. At a minimum, the number of code blocks equals the number of MLC encoders. Since the code rates of each MLC encoder may be different, code block sizes may be different.
In addition, in order to facilitate implementation by limiting buffer sizes, a maximum code block size may be determined.
In one embodiment, suitable for LTE, LTE NR, or new generations of cellular, wireless, wired, satellite, or other communications systems, where M-QAM is used, and for a TB of size B bits, the following process may be is used:
and define the size of the code blocks in bit level c as Kc,i, i=1, . . . , nc·Kc,i should be defined so as not to exceed Z.
At the end of the code block segmentation process, code block sizes are such that at least one code block per bit level is used, the code blocks satisfy the maximum length constraint, and the coded bit levels occupy the same number of QAM symbols.
If the equalities above (Equations 1-3) cannot be satisfied, the TB size B may be increased with filler bits so that the equalities above may be satisfied. For example, filler bits may include one or more dummy“1s” or “0s” to increase the size of B.
In one embodiment, Z=6144 bits, the current maximum code block size for the LTE standard.
In another embodiment, Z=8448 bits, the maximum block size specified for the 3GPP NR standard TS 38.212. Other values that facilitate hardware implementation may be adopted.
In another embodiment, the procedure described in TS 36.212 may be applied to determine the code block sizes in the second step of the above process.
In another embodiment, in-phase and quadrature bits may be contained in separate code blocks, such as that the total number of blocks is at least log2 M.
In some example embodiments, codes may be LDPC codes, such as the 3GPP NR LDPC code, turbo codes, polar codes, convolutional and tail-biting convolutional codes, or any other type of forward error correcting code.
In order to achieve all code rates required in the multi-level code, a single code followed by puncturing may be used, or different codes with different code rates may be used.
Repetition coding may be used to further reduce the code rate of the codes.
In other embodiments, the foregoing process may be used for other types of modulations, such as M-PSK, hierarchical QAM constellations, M-ASK, irregular constellations, and, in general, any constellation containing more than one bit per symbol.
As part of the transmitter processing, bit interleaving can be included prior to mapping to constellation symbols. In order to allow independent decoding, interleaving may be restricted to each bit level. This does not preclude interleaving multiple code blocks in a given bit level.
At the receiver, a code block aggregation procedure may be performed, which includes removing the CRC field of each code block and concatenating the code blocks to recover the original TB.
The segmentation procedure described above may be inserted in the MLC transmitter as shown in
The method 600 includes, at 602, receiving information bits for transmission. The information bits may include user data and/or control data. The information bits may be locally generated at the transmitter apparatus implementing the method 600 and may represent application-level data or audio signal. In some embodiments, the information bits may be received at a peripheral interface (e.g., USB, Lightening, or HDMI interface) for transmission over the network.
The method 600 includes, at 604, dividing bits of the transport block into a number of code blocks. As described above, each code block may correspond to a bit-level of a multi-level modulation scheme used for transmission. The sizes may be selected so that sizes of each code block is inversely proportional to a corresponding coding rate used for coding the code block and the equality shown in Equations 1-3 may be satisfied.
The method 600 includes, at 606, processing the code blocks to generate an output signal. The processing operation may include concatenating the code blocks to generate a concatenated code block sequence, interleaving the concatenated sequence to generate a concatenated code block sequence, and mapping the concatenated code block sequence to a QAM constellation.
The method 600 includes, at 608, transmitting the output signal.
In some embodiments, a wireless communication apparatus includes a first circuit at which data is received for transmission over network, a second circuit, which organizes the data into a number of code blocks, a processor that processes the code blocks to generate a Quadrature Amplitude Modulation (QAM) modulated output signal, and a transmitter circuit that transmits the output signal. Sizes of code blocks are selected such that at least one code block per bit level of a multi-level encoding is used, all code blocks have sizes less than or equal to a maximum size and coded bit levels occupy a same number of QAM symbols.
It will be appreciated that the disclosed techniques can be used to improve transmission and allocate bits to code blocks in a multi-level encoding based transmission scheme. Unless otherwise noted, various terms used herein are consistent with the usage in 3GPP TS 36.212, “LTE; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding” document version 14.0.0, dated September 2016, and/or 3GPP TS 38.212, “NR; Multiplexing and channel coding”, v0.0.2, dated August 2017, both of which are incorporated by reference in their entirety herein.
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.
This patent document is a 371 National Phase Application of PCT Application No. PCT/US2017/054517 entitled “TRANSPORT BLOCK SEGMENTATION FOR MULTI-LEVEL CODES” filed on Sep. 29, 2017, which claims priority to and benefit of U.S. Provisional Patent Application No. 62/401,682 entitled “TRANSPORT BLOCK SEGMENTATION FOR MULTI-LEVEL CODES” filed on Sep. 29, 2016. The entire contents of the aforementioned patent applications are incorporated by reference as part of the disclosure of this patent document.
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/US2017/054517 | 9/29/2017 | WO | 00 |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2018/064587 | 4/5/2018 | WO | A |
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 |
8630363 | Seyedi-Esfahani | Jan 2014 | 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 |
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 |
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 |
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 et al. | 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 |
20180077540 | Choi | Mar 2018 | A1 |
Number | Date | Country |
---|---|---|
1235720 | Nov 1999 | CN |
101682316 | Mar 2010 | CN |
101939935 | Jan 2011 | CN |
1432168 | Jun 2004 | EP |
2011127910 | Jun 2011 | JP |
2007004297 | Jan 2007 | WO |
2011137699 | Nov 2011 | WO |
2011150315 | Dec 2011 | WO |
2013148546 | Oct 2013 | WO |
2014004585 | Jan 2014 | 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 |
Entry |
---|
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. |
Number | Date | Country | |
---|---|---|---|
20210288765 A1 | Sep 2021 | US |
Number | Date | Country | |
---|---|---|---|
62401682 | Sep 2016 | US |