IP Library › Granted Patent US 12,580,800
Granted Patent B2
US 12,580,800 · App. 18/589,420 · Granted Mar 17, 2026

Orthogonal multiple access and non-orthogonal multiple access

Inventor: Steve Shattil (Cheyenne, WY)
Assignee: Tybalt, LLC
H04L27/2627H04L27/2607
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,580,800
App. No.
18/589,420
Granted
Mar 17, 2026
Kind
B2
Abstract

A transmitter in a wireless communication network includes a bits-to-symbol mapper that produces a plurality of data symbols; and a waveform modulator that receives a first discrete-time waveform and at least a second discrete-time waveform that comprises a cyclic shift of the first discrete-time waveform; modulates a first one of the plurality of data symbols onto the first discrete-time waveform and modulates a second one of the plurality of second data symbol onto the second discrete-time waveform, to produce a plurality of modulated discrete-time waveforms; and sums the plurality of modulated discrete-time waveforms to produce a modulated discrete-time signal to be transmitted in the network. The first discrete-time waveform and at least the second discrete-time waveform are multicarrier signals.

Claims (32)

1 . A method for uplink transmission in a wireless communication system, the method comprising:

receiving, at a User Equipment (UE), a transmission from a network node, the transmission comprising configuration information for frequency domain spectral shaping (FDSS), wherein the configuration information comprises one or more parameters indicative of spectral shaping characteristics;

generating Discrete Fourier Transform (DFT) spread data symbols from a plurality of data symbols;

applying a frequency domain window function to the DFT spread data symbols according to the one or more parameters, wherein applying the frequency domain window function modifies spectral characteristics of the DFT spread data symbols to produce modified DFT spread data symbols; and

employing an inverse fast Fourier transform (IFFT) to transmit the uplink transmission based on the modified DFT spread data symbols.

2 . The method of claim 1 , wherein the transmission comprising the configuration information is a physical downlink control channel (PDCCH).

3 . The method of claim 1 , wherein the configuration information is in a downlink control information (DCI) message.

4 . The method of claim 1 , wherein the configuration information indicates FDSS without spectrum extension.

5 . The method of claim 1 , wherein the configuration information indicates FDSS with spectrum extension with an amount of excess bandwidth, and generating DFT spread data symbols produces a number of DFT spread data symbols that is greater than the plurality of data symbols, the number of DFT spread data symbols based on the amount of excess bandwidth.

6 . The method of claim 1 , wherein the configuration information comprises at least one of a pulse shape, a roll-off factor, or a secondary pulse-shaping factor.

7 . The method of claim 1 , wherein the data symbols comprise reference signals.

8 . An apparatus for communication in a wireless communication system, the apparatus comprising:

control-channel processing circuitry in a User Equipment (UE) configured to receive a transmission from a network node, the transmission comprising configuration information for frequency domain spectral shaping (FDSS), wherein the configuration information comprises one or more parameters indicative of spectral shaping characteristics;

Discrete Fourier Transform (DFT) circuitry configured to transform a plurality of data symbols into DFT spread data symbols;

frequency-domain filter circuitry configured to apply a frequency domain window function to the DFT spread data symbols according to the one or more parameters, wherein the frequency domain window function modifies spectral characteristics of the DFT spread data symbols to produce modified DFT spread data symbols; and

transmission circuitry configured to transmit an uplink transmission based on the modified DFT spread data symbols.

9 . The apparatus of claim 8 , wherein the transmission comprising the configuration information is a physical downlink control channel (PDCCH).

10 . The apparatus of claim 8 , wherein the configuration information is in a downlink control information (DCI) message.

11 . The apparatus of claim 8 , wherein the configuration information indicates FDSS without spectrum extension.

12 . The apparatus of claim 8 , wherein the configuration information indicates FDSS with spectrum extension with an amount of excess bandwidth, and the DFT circuitry is configured to produce a number of DFT spread data symbols that is greater than the plurality of data symbols, the number of DFT spread data symbols based on the amount of excess bandwidth.

13 . The apparatus of claim 8 , wherein the configuration information comprises at least one of a pulse shape, a roll-off factor, or a secondary pulse-shaping factor.

14 . The apparatus of claim 8 , wherein the data symbols comprise reference signals.

15 . A User Equipment (UE) for communication in a wireless communication system, the apparatus comprising:

a control-signal processor configured to receive a transmission from a network node, the transmission comprising configuration information for frequency domain spectral shaping (FDSS), wherein the configuration information comprises one or more parameters indicative of spectral shaping characteristics;

a Discrete Fourier Transform (DFT) configured to transform a plurality of data symbols into DFT spread data symbols;

a pulse-shaping filter configured to apply a frequency domain window function to the DFT spread data symbols according to the one or more parameters, wherein the frequency domain window function modifies spectral characteristics of the DFT spread data symbols to produce modified DFT spread data symbols; and

an inverse DFT configured to generate an uplink discrete-time signal from the modified DFT spread data symbols.

16 . The apparatus of claim 15 , wherein the transmission comprising the configuration information is a physical downlink control channel (PDCCH).

17 . The apparatus of claim 15 , wherein the configuration information is in a downlink control information (DCI) message.

18 . The apparatus of claim 15 , wherein the configuration information indicates FDSS without spectrum extension.

19 . The apparatus of claim 15 , wherein the configuration information indicates FDSS with spectrum extension with an amount of excess bandwidth, and the DFT produces a number of DFT spread data symbols that is greater than the plurality of data symbols, the number of DFT spread data symbols based on the amount of excess bandwidth.

20 . The apparatus of claim 15 , wherein the configuration information comprises at least one of a pulse shape, a roll-off factor, or a secondary pulse-shaping factor.

Continuity (5)
Continuation 17751654 · May 23, 2022
Continuation 16994622 · Aug 16, 2020
Continuation 16751946 · Jan 24, 2020
Provisional Application 62796994 · Jan 25, 2019
Related Publication 20250274323A1 · Aug 28, 2025
References Cited (157)
US 6340964B1 · Nakazawa et al. · 2002 [cited by applicant]
US 7787556B2 · Zhang et al. · 2010 [cited by applicant]
US 8090000B2 · Hamamura · 2012 [cited by applicant]
US 8374074B2 · Liao et al. · 2013 [cited by applicant]
US 8401095B2 · Han et al. · 2013 [cited by applicant]
US 8538159B2 · Lu · 2013 [cited by applicant]
US 8677050B2 · Chen et al. · 2014 [cited by applicant]
US 8724721B2 · Soler Garrido · 2014 [cited by applicant]
US 9015093B1 · Commons · 2015 [cited by applicant]
US 9698888B2 · Ko et al. · 2017 [cited by applicant]
US 10094650B2 · Todeschini · 2018 [cited by applicant]
US 10243773B1 · Shattil · 2019 [cited by applicant]
US 10447520B1 · Shattil · 2019 [cited by applicant]
US 10505774B1 · Shattil · 2019 [cited by applicant]
US 10728074B1 · Shattil · 2020 [cited by applicant]
US 10985961B1 · Shattil · 2021 [cited by applicant]
US 11032022B1 · Sen et al. · 2021 [cited by applicant]
US 11151445B2 · Fowers et al. · 2021 [cited by applicant]
US 11196603B2 · Shattil · 2021 [cited by applicant]
US 20030085832A1 · Yu et al. · 2003 [cited by applicant]
US 20040178954A1 · Vook et al. · 2004 [cited by applicant]
US 20040240535A1 · Verma et al. · 2004 [cited by applicant]
US 20060034378A1 · Lindskog et al. · 2006 [cited by applicant]
US 20060245346A1 · Bar-Ness et al. · 2006 [cited by applicant]
US 20070098099A1 · Gore et al. · 2007 [cited by applicant]
US 20070110172A1 · Faulkner et al. · 2007 [cited by applicant]
US 20070206686A1 · Vook et al. · 2007 [cited by applicant]
US 20080075188A1 · Kowalski et al. · 2008 [cited by applicant]
US 20080298335A1 · Lee · 2008 [cited by applicant]
US 20080317172A1 · Zhang et al. · 2008 [cited by applicant]
US 20090074093A1 · Han et al. · 2009 [cited by applicant]
US 20090112551A1 · Hollis · 2009 [cited by applicant]
US 20090290800A1 · Lo · 2009 [cited by applicant]
US 20100008432A1 · Kim et al. · 2010 [cited by applicant]
US 20100157925A1 · Francos · 2010 [cited by applicant]
US 20100232413A1 · Dakshinamurthy · 2010 [cited by examiner]
US 20110012798A1 · Triolo · 2011 [cited by applicant]
US 20110105051A1 · Thomas et al. · 2011 [cited by applicant]
US 20110107174A1 · Liu et al. · 2011 [cited by applicant]
US 20110122930A1 · Al-Naffouri et al. · 2011 [cited by applicant]
US 20110150325A1 · Hill · 2011 [cited by applicant]
US 20110228863A1 · Papasakellariou et al. · 2011 [cited by applicant]
US 20110307424A1 · Jin et al. · 2011 [cited by applicant]
US 20120014392A1 · Bhushan et al. · 2012 [cited by applicant]
US 20130058432A1 · Futatsugi et al. · 2013 [cited by applicant]
US 20130198590A1 · Kim et al. · 2013 [cited by applicant]
US 20130304683A1 · Lo · 2013 [cited by applicant]
US 20140169501A1 · Nazarathy et al. · 2014 [cited by applicant]
US 20140180738A1 · Phillipps et al. · 2014 [cited by applicant]
US 20140376652A1 · Sayana et al. · 2014 [cited by applicant]
US 20150009971A1 · Han et al. · 2015 [cited by applicant]
US 20150092872A1 · Keusgen et al. · 2015 [cited by applicant]
US 20150117558A1 · Phillips · 2015 [cited by applicant]
US 20150146806A1 · Terry · 2015 [cited by applicant]
US 20150227747A1 · Gassi · 2015 [cited by applicant]
US 20160034810A1 · Hershey et al. · 2016 [cited by applicant]
US 20160094318A1 · Shattil · 2016 [cited by applicant]
US 20160142117A1 · Rahman et al. · 2016 [cited by applicant]
US 20160198474A1 · Raghavan et al. · 2016 [cited by applicant]
US 20160254889A1 · Shattil · 2016 [cited by applicant]
US 20160328644A1 · Lin et al. · 2016 [cited by applicant]
US 20160344497A1 · Myung et al. · 2016 [cited by applicant]
US 20160352012A1 · Foo · 2016 [cited by applicant]
US 20170054584A1 · Madaiah et al. · 2017 [cited by applicant]
US 20170126454A1 · Hao et al. · 2017 [cited by applicant]
US 20170126458A1 · Shattil · 2017 [cited by applicant]
US 20170192089A1 · Parker et al. · 2017 [cited by applicant]
US 20170228646A1 · O'Connor et al. · 2017 [cited by applicant]
US 20170295000A1 · Yoo et al. · 2017 [cited by applicant]
US 20170331532A1 · Le-Ngoc · 2017 [cited by applicant]
US 20180006692A1 · Noh et al. · 2018 [cited by applicant]
US 20180075482A1 · Gierach · 2018 [cited by applicant]
US 20180109408A1 · Sandell et al. · 2018 [cited by applicant]
US 20180123846A1 · Kibutu et al. · 2018 [cited by applicant]
US 20180219590A1 · Matsuda et al. · 2018 [cited by applicant]
US 20180262253A1 · Rahman et al. · 2018 [cited by applicant]
US 20180278303A1 · Hong et al. · 2018 [cited by applicant]
US 20180309599A1 · Lee · 2018 [cited by applicant]
US 20180332573A1 · Yu et al. · 2018 [cited by applicant]
US 20190132177A1 · Wang et al. · 2019 [cited by applicant]
US 20190158338A1 · Herath et al. · 2019 [cited by applicant]
US 20190181928A1 · Pan et al. · 2019 [cited by applicant]
US 20190190753A1 · Bayesteh et al. · 2019 [cited by applicant]
US 20190222453A1 · Cao · 2019 [cited by examiner]
US 20190236445A1 · Das et al. · 2019 [cited by applicant]
US 20190260441A1 · Akuon et al. · 2019 [cited by applicant]
US 20190363821A1 · Whittaker · 2019 [cited by applicant]
US 20190386717A1 · Shattil · 2019 [cited by applicant]
US 20190392297A1 · Lau et al. · 2019 [cited by applicant]
US 20190393948A1 · Zhao et al. · 2019 [cited by applicant]
US 20200028727A1 · Chen · 2020 [cited by applicant]
US 20200177418A1 · Hoydis et al. · 2020 [cited by applicant]
US 20200204421A1 · Levinbook · 2020 [cited by examiner]
US 20220060363A1 · Shattil · 2022 [cited by applicant]
CN 101622797A · 2010 [cited by applicant]
CN 103039047A · 2013 [cited by applicant]
CN 105978655A · 2016 [cited by applicant]
CN 108737307A · 2018 [cited by applicant]
CN 105635025B · 2018 [cited by applicant]
EP 1835682 · 2007 [cited by applicant]
EP 2763321 · 2014 [cited by applicant]
EP 2449690 · 2016 [cited by applicant]
EP 3118573A1 · 2017 [cited by applicant]
JP 2004147126A · 2004 [cited by applicant]
JP 2011229090A · 2011 [cited by applicant]
JP 2012109811 · 2012 [cited by applicant]
JP 2013521741A · 2013 [cited by applicant]
JP 2017537514A · 2017 [cited by applicant]
KR 1020090033703 · 2011 [cited by applicant]
WO WO2007068214A1 · 2007 [cited by applicant]
WO WO2011161601 · 2011 [cited by applicant]
WO WO2014199989A1 · 2014 [cited by applicant]
WO WO2014206461 · 2014 [cited by applicant]
WO WO2016115546 · 2016 [cited by applicant]
WO WO2016172875A1 · 2016 [cited by applicant]
WO WO2017077848A1 · 2017 [cited by applicant]
WO WO2017078779 · 2017 [cited by applicant]
WO WO2017186301 · 2017 [cited by applicant]
WO WO2018031709A1 · 2018 [cited by applicant]
WO WO2018082791 · 2018 [cited by applicant]
WO WO2018083601 · 2018 [cited by applicant]
WO WO2018174686 · 2018 [cited by applicant]
WO WO2019006088A1 · 2019 [cited by applicant]
WO WO2019023283 · 2019 [cited by applicant]
Written Opinion dated Nov. 5, 2018 from corresponding PCT Application No. PCT/US2018/043573. [cited by applicant]
International Search Report dated Nov. 5, 2018 from corresponding PCT Application No. PCT/US2018/043573. [cited by applicant]
Extended European Search Report dated Mar. 18, 2021 from corresponding EPO Application No. 18837572.9. [cited by applicant]
Examination Report, India Patent Office, dated Jul. 26, 2021 from corresponding India Application No. 202047007281. [cited by applicant]
C-Y. Hsu, et al.; “Novel SLM Scheme with Low-Complexity for PAPR Reduction in OFDM System”, IEICE Trans. Fundamentals, vol. E91-A. No. 7, pp. 1689-1696, Jul. 2008. [cited by applicant]
N. Jacklin, et al.; “A Linear Programming Based Tone Injection Algorithm for PAPR Reduction of OFDM and Linearly Precoded Systems”, IEEE Trans. on Circuits and Systems- I: Regular Papers, vol. 60, No. 7, pp. 1937-1945, … [cited by applicant]
Examination Report dated Jan. 12, 2022 from corresponding EPO Application No. 18837572.9. [cited by applicant]
Notice of Reasons for Refusal dated May 19, 2022 from corresponding Japan Appl. No. 2019-556330. [cited by applicant]
R. Baxley, et al.; “Comparing Selected Mapping and Partial Transmit Sequence for PAR Reduction”; IEEE Transactions on Broadcasting ( vol. 53, Issue: 4, Dec. 2007), pp. 797-803; Dec. 31, 2007. [cited by applicant]
International Search Report and Written Opinion dated Oct. 4, 2019 from corresponding PCT Application No. PCT/US2019/037399. [cited by applicant]
I.M. Hussain; “Low Complexity Partial SLM Technique for PAPR Reduction in OFDM Transmitters”; Int. J. on Electrical Engineering and Informatics, vol. 5, No. 1, Mar. 2013. [cited by applicant]
A. Boonkajay, et al.; “A blind selected mapping technique for low-PAPR single-carrier signal transmission”; 2015 10th ICICS, Apr. 28, 2016. [cited by applicant]
China National Intellectual Property Administration, first Office Action for Appl. No. 201980040903.3; Nov. 10, 2023. [cited by applicant]
China National Intellectual Property Administration, second Office Action for Appl. No. 201980040903.3; Apr. 30, 2024. [cited by applicant]
Extended European Search Report dated Jan. 26, 2022 from corresponding EPO Application No. 19822936.1 (Corresponding to PCT/US2019/037399). [cited by applicant]
Intellectual Property India; Examination Report dated Dec. 27, 2021 from corresponding Appl. No. 20204704503. [cited by applicant]
T.Nylanden, et al. “A GPU Implementation for two MIMO-OFDM Detectors”; 2010 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation; Jul. 19-22, 2010. [cited by applicant]
L. Xu, et al.; “Resource allocation based on quantum particle swarm optimization and RBF neural network for overlay cognitive OFDM System”; Neurocomputing; vol. 173, Part 3, pp. 1250-1256; Jan. 15, 2016. [cited by applicant]
W. Xu, et al.; “Joint Sensing Duration Adaptation, User Matching, and Power Allocation for Cognitive OFDM-NOMA Systems”; IEEE Transactions on Wireless Communications, pp. 1269-1282 ( vol. 17, Issue: 2, Feb. 2018). [cited by applicant]
International Search Report dated Nov. 25, 2020 from corresponding PCT Application No. PCT/US2020/045773. [cited by applicant]
International Search Report and Written Opinion of the International Searching Authority dated May 20, 2020 from corresponding PCT Application No. PCT/US2020/014862. [cited by applicant]
International Preliminary Report on Patentability dated Jul. 27, 2021 from corresponding PCT Application No. PCT/US2020/014862. [cited by applicant]
Intellectual Property India Examination Report dated May 13, 2022 from National Stage Application No. 202147033497. [cited by applicant]
International Search Report and Written Opinion of the International Searching Authority dated Aug. 31, 2020 from corresponding PCT Application No. PCT/US2020/034071. [cited by applicant]
Examination Report from Intellectual Property India for corresponding application No. 202147051388, mailed Mar. 30, 2022. [cited by applicant]
Yuanwei Liu et al., ‘Non-Orthogonal Multiple Access for 5G and Beyond’, arXiv:1808.00277, Aug. 1, 2018 [retrieved on Aug. 21, 2020]. Retrieved from <URL: https://arxiv.org/abs/1808.00277>. pp. 1-54. [cited by applicant]
3rd Generation Partnership Project; Technical Specification Group SA; Feasibility Study for Proximity Services (ProSe) (Release 12); 3GPP TR 22.803 V2.0.0 (Nov. 2012). [cited by applicant]
J.S. Chow, et al.; “Equalizer Training Algorithms for Multicarrier Modulation Systems,” Communications, 1993. ICC '93 Geneva. Technical Program, Conference Record, IEEE International Conference on; vol. 2, May 23-26, 19… [cited by applicant]
Vrcelj et al. “Pre-and post-processing for optimal noise reduction in cyclic prefix based channel equalizers.” Communications, 2002. ICC 2002. IEEE International Conference on. vol. 1. IEEE, 2002. [cited by applicant]
LTE: Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation (3GPP TS 36.211 version 8.7.0 Release 8), Jun. 2009. [cited by applicant]
LTE: Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding (3GPP TS 36.212 version 8.8.0 Release 8), Jan. 2010. [cited by applicant]
3GPP TR 21.914 version 0.8.0 Release 14: Technical Specification Group Services and Systems Aspects. (Jun. 2018). [cited by applicant]
3GPP TR 21.915 version 0.5.0 Release 15: Technical Specification Group Services and Systems Aspects. [cited by applicant]