IP Library Granted Patent US 12,640,907
Granted Patent B2
US 12,640,907 · App. 18/187,630 · Granted May 26, 2026

Modulation-agnostic transformations using unitary braid divisional multiplexing (UBDM)

Inventor: Matthew Brandon Robinson (Millersville, MD)
Assignee: Rampart Communications, Inc.
H04L9/0637H04L27/2627H04L2209/80
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,640,907
App. No.
18/187,630
Filed
Mar 21, 2023
Granted
May 26, 2026
Kind
B2
Art Unit
2433
USPC
380/28
Abstract

A method for implementing a fast UBDM transform includes receiving a first, input vector via a processor, and partitioning the first vector to produce a magnitude vector and a sign vector. A second vector, including a modified magnitude vector and a modified sign vector, is generated by: applying a permutation to the magnitude vector to produce the modified magnitude vector, converting the sign vector, based on an algorithm, into an intermediate sign vector, and applying nonlinear layers to the intermediate sign vector. Each nonlinear layer includes a permutation, an S-box transformation, a diffusive linear operation and/or an Xor operation. Multiple linear layers are applied to the second vector to produce a third vector, the third vector being a transformed version of the first vector. A first signal representing the third vector is sent to at least one transmitter for transmission of a second signal representing the transformed data vector.

Claims (40)

1 . A non-transitory, processor-readable medium storing instructions that, when executed by a processor, cause the processor to:

receive a first vector comprising a plurality of symbols;

partition the first vector to produce a magnitude vector comprising magnitude values of each symbol in the plurality of symbols and a sign vector comprising sign values of each symbol in the plurality of symbols;

generate a second vector that includes a modified magnitude vector and a modified sign vector, by:

applying a permutation to the magnitude vector to produce the modified magnitude vector,

converting the sign vector, based on an algorithm, into an intermediate sign vector, and

applying a sequenced plurality of sets of nonlinear transformations to the intermediate sign vector, to produce the modified sign vector, wherein an encryption mode of operation of the processor is one of a cipher block chaining (CBC) mode or an electronic code book (ECB) mode;

apply a sequenced plurality of sets of linear transformations to the second vector to produce a third vector, the third vector being a transformed version of the first vector, wherein at least one of a number of sets of linear transformations from the plurality of sets of linear transformations or a number of sets of nonlinear transformations from the plurality of sets of nonlinear transformations is equal to log 2 (N), wherein Nis an integer; and

cause transmission of a first signal representing the third vector to at least one transmitter for transmission of a second signal representing the transformed version of the first vector from the at least one transmitter to at least one receiver.

2 . The non-transitory, processor-readable medium of claim 1 , wherein the instructions further comprise instructions to cause the processor to select the algorithm based on the encryption mode of operation of the processor, and the instructions to convert the sign vector include instructions to convert the sign vector based on an initialization vector.

3 . The non-transitory, processor-readable medium of claim 1 , wherein the instructions further comprise instructions to cause the processor to select the algorithm based on the encryption mode of operation of the processor, and the encryption mode of operation of the processor is one of a cipher block chaining (CBC) mode or an electronic code book (ECB) mode.

4 . The non-transitory, processor-readable medium of claim 1 , wherein the algorithm includes an Xor operation, the encryption mode of operation of the processor is a cipher block chaining (CBC) mode, and the permutation applied to the magnitude vector does not reduce a total power of the first vector.

5 . The non-transitory, processor-readable medium of claim 1 , wherein the algorithm includes an Xor operation, the encryption mode of operation of the processor is an electronic code book (ECB) mode, and the permutation applied to the magnitude vector does not reduce a total power of the first vector.

6 . The non-transitory, processor-readable medium of claim 1 , wherein:

the number of sets of nonlinear transformations from the plurality of sets of nonlinear transformations equals the number of sets of linear transformations from the plurality of sets of linear transformations; and

the algorithm is selected based on the encryption mode of operation of the processor.

7 . The non-transitory, processor-readable medium of claim 1 , wherein:

the number of sets of nonlinear transformations from the plurality of sets of nonlinear transformations is different from the number of sets of linear transformations in the plurality of sets of linear transformations; and

the algorithm is selected based on the encryption mode of operation of the processor.

8 . The non-transitory, processor-readable medium of claim 1 , wherein:

at least one of the number of sets of nonlinear transformations from the plurality of sets of nonlinear transformations or the number of sets of linear transformations from the plurality of sets of linear transformations is based on a performance constraint.

9 . The non-transitory, processor-readable medium of claim 1 , wherein:

at least one of the number of sets of nonlinear transformations from the plurality of sets of nonlinear transformations or the number of sets of linear transformations from the plurality of sets of linear transformations is based on a security constraint.

10 . The non-transitory, processor-readable medium of claim 1 , wherein:

the algorithm is selected based on an encryption mode of operation of the processor; and

the permutation applied to the magnitude vector does not reduce a total power of the first vector.

11 . A system, comprising a processor and a memory operably coupled to the processor, the memory storing instructions that, when executed by the processor, cause the processor to:

receive an input vector comprising a plurality of symbols;

generate a transformed vector based on the input vector, by:

applying a permutation to a magnitude vector comprising magnitude values of each symbol in the plurality of symbols of the input vector, to produce a modified magnitude vector,

applying an algorithm and a sequenced plurality of sets of nonlinear transformations to a sign vector comprising sign values of each symbol in the plurality of symbols of the input vector, to produce a modified sign vector, the modified magnitude vector and the modified sign vector defining an intermediate vector, wherein an encryption mode of operation of the processor is one of a cipher block chaining (CBC) mode or an electronic code book (ECB) mode, and

applying a sequenced plurality of sets of linear transformations to the intermediate vector to produce the transformed vector, wherein at least one of a number of sets of linear transformations from the plurality of sets of linear transformations or a number of sets of nonlinear transformations from the plurality of sets of linear transformations is equal to [log 2 (N)], where Nis an integer; and

cause transmission of a signal representing the transformed vector to at least one transmitter.

12 . The system of claim 11 , wherein the plurality of sets of nonlinear transformations includes at least two of: a permutation, an S-box transformation, a diffusive linear operation, or an Xor operation.

13 . The system of claim 12 , wherein the memory further stores instructions to cause the processor to select the algorithm based on the encryption mode of operation of the processor.

14 . The system of claim 11 , wherein the algorithm includes an Xor operation, and the algorithm is selected based on an encryption mode of operation of the processor.

15 . The system of claim 11 , wherein the number of sets of nonlinear transformations from the plurality of sets of nonlinear transformations equals the number of sets of linear transformations in the plurality of sets of linear transformations.

16 . The system of claim 11 , wherein the number of sets of nonlinear transformations from the plurality of sets of nonlinear transformations is different from the number of sets of linear transformations from the plurality of sets of linear transformations.

17 . The system of claim 11 , wherein at least one of the number of sets of nonlinear transformations from the plurality of sets of nonlinear transformations or the number of sets of linear transformations from the plurality of sets of linear transformations is based on at least one of a performance constraint or a security constraint.

18 . The system of claim 11 , wherein the permutation applied to the magnitude vector does not reduce a total power of the input vector, and the algorithm is selected based on the encryption mode of operation of the processor.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 6, 2023
From: ROBINSON, MATTHEW BRANDON
To: RAMPART COMMUNICATIONS, INC.
Reel/Frame 063241/0074 →
Continuity (2)
Continuation 16916303 · Jun 30, 2020
Related Publication 20230224143A1 · Jul 13, 2023
References Cited (337)
US 5237587A · Schoolcraft · 1993 [cited by applicant]
US 5345599A · Paulraj et al. · 1994 [cited by applicant]
US 5555268A · Fattouche et al. · 1996 [cited by applicant]
US 6389138B1 · Li et al. · 2002 [cited by applicant]
US 6519278B1 · Hiramatsu · 2003 [cited by applicant]
US 6526037B1 · Song et al. · 2003 [cited by applicant]
US 6973124B2 · Miller · 2005 [cited by applicant]
US 7075968B1 · Ghassemzadeh et al. · 2006 [cited by applicant]
US 7330496B2 · Ohmi et al. · 2008 [cited by applicant]
US 7376173B2 · Yedidia et al. · 2008 [cited by applicant]
US 7454084B2 · Faber et al. · 2008 [cited by applicant]
US 8254476B2 · Ohwatari et al. · 2012 [cited by applicant]
US 8320507B2 · Higuchi · 2012 [cited by applicant]
US 8737509B2 · Yu et al. · 2014 [cited by applicant]
US 8780771B2 · Kim et al. · 2014 [cited by applicant]
US 9648444B2 · Agee · 2017 [cited by applicant]
US 10020839B2 · Robinson et al. · 2018 [cited by applicant]
US 10491262B2 · Robinson et al. · 2019 [cited by applicant]
US 10637705B1 · Shattil · 2020 [cited by applicant]
US 10735062B1 · Robinson · 2020 [cited by applicant]
US 10771128B1 · Sitaram et al. · 2020 [cited by applicant]
US 10819387B2 · Robinson et al. · 2020 [cited by applicant]
US 10833749B1 · Robinson · 2020 [cited by applicant]
US 10873361B2 · Robinson · 2020 [cited by applicant]
US 10917148B2 · Robinson · 2021 [cited by applicant]
US 10951442B2 · Robinson · 2021 [cited by applicant]
US 10965352B1 · Robinson · 2021 [cited by applicant]
US 11018715B2 · Robinson et al. · 2021 [cited by applicant]
US 11025470B2 · Robinson · 2021 [cited by applicant]
US 11050604B2 · Robinson · 2021 [cited by applicant]
US 11075681B2 · Robinson · 2021 [cited by applicant]
US 11159220B2 · Robinson · 2021 [cited by applicant]
US 11258487B2 · Robinson · 2022 [cited by applicant]
US 11336341B2 · Robinson · 2022 [cited by applicant]
US 11394588B2 · Robinson · 2022 [cited by applicant]
US 11476912B2 · Robinson · 2022 [cited by applicant]
US 11641269B2 · Robinson · 2023 [cited by applicant]
US 11716131B2 · Robinson · 2023 [cited by applicant]
US 11838078B2 · Robinson · 2023 [cited by applicant]
US 20010012316A1 · Maruyama · 2001 [cited by applicant]
US 20020009209A1 · Inoue et al. · 2002 [cited by applicant]
US 20030185309A1 · Pautler et al. · 2003 [cited by applicant]
US 20030210750A1 · Onggosanusi et al. · 2003 [cited by applicant]
US 20040059547A1 · Aftelak · 2004 [cited by applicant]
US 20040105489A1 · Kim et al. · 2004 [cited by applicant]
US 20040253986A1 · Hochwald et al. · 2004 [cited by applicant]
US 20050169374A1 · Marpe et al. · 2005 [cited by applicant]
US 20060023803A1 · Perlman et al. · 2006 [cited by applicant]
US 20060109897A1 · Guo et al. · 2006 [cited by applicant]
US 20060274825A1 · Cioffi et al. · 2006 [cited by applicant]
US 20070091999A1 · Nissan-Cohen et al. · 2007 [cited by applicant]
US 20070097856A1 · Wang et al. · 2007 [cited by applicant]
US 20070098063A1 · Reznic et al. · 2007 [cited by applicant]
US 20070115797A1 · Reznic et al. · 2007 [cited by applicant]
US 20070211786A1 · Shattil · 2007 [cited by applicant]
US 20070211816A1 · Hwang · 2007 [cited by applicant]
US 20070281746A1 · Takano et al. · 2007 [cited by applicant]
US 20080095262A1 · Ho et al. · 2008 [cited by applicant]
US 20080285667A1 · Mondal et al. · 2008 [cited by applicant]
US 20080317104A1 · Akcaba et al. · 2008 [cited by applicant]
US 20090046801A1 · Pan et al. · 2009 [cited by applicant]
US 20090268840A1 · Clerckx et al. · 2009 [cited by applicant]
US 20090316802A1 · Tong et al. · 2009 [cited by applicant]
US 20100008432A1 · Kim et al. · 2010 [cited by applicant]
US 20100067605A1 · Jongren · 2010 [cited by applicant]
US 20100111219A1 · Wang et al. · 2010 [cited by applicant]
US 20100119001A1 · Walton et al. · 2010 [cited by applicant]
US 20100150266A1 · Mondal et al. · 2010 [cited by applicant]
US 20100202553A1 · Kotecha et al. · 2010 [cited by applicant]
US 20100246656A1 · Hammerschmidt · 2010 [cited by applicant]
US 20100329393A1 · Higuchi · 2010 [cited by applicant]
US 20110134902A1 · Ko et al. · 2011 [cited by applicant]
US 20110235728A1 · Karabinis · 2011 [cited by applicant]
US 20120093090A1 · Han et al. · 2012 [cited by applicant]
US 20120236817A1 · Chen et al. · 2012 [cited by applicant]
US 20120257664A1 · Yue et al. · 2012 [cited by applicant]
US 20120307937A1 · Higuchi · 2012 [cited by applicant]
US 20130064315A1 · Heath, Jr. et al. · 2013 [cited by applicant]
US 20130100965A1 · Ohmi et al. · 2013 [cited by applicant]
US 20130129008A1 · Ko et al. · 2013 [cited by applicant]
US 20130194961A1 · Kang et al. · 2013 [cited by applicant]
US 20130223548A1 · Kang et al. · 2013 [cited by applicant]
US 20140056332A1 · Soualle et al. · 2014 [cited by applicant]
US 20150003500A1 · Kesling · 2015 [cited by applicant]
US 20150049713A1 · Lan et al. · 2015 [cited by applicant]
US 20150124897A1 · Phan Huy · 2015 [cited by applicant]
US 20150171982A1 · Wang et al. · 2015 [cited by applicant]
US 20150304130A1 · Logothetis et al. · 2015 [cited by applicant]
US 20160277083A1 · Koike-Akino et al. · 2016 [cited by applicant]
US 20160309396A1 · Chai et al. · 2016 [cited by applicant]
US 20160337156A1 · Milleth et al. · 2016 [cited by applicant]
US 20170180020A1 · Namgoong et al. · 2017 [cited by applicant]
US 20170195030A1 · Yoshimura et al. · 2017 [cited by applicant]
US 20170201321A1 · Uysal et al. · 2017 [cited by applicant]
US 20170237545A1 · Khandani · 2017 [cited by applicant]
US 20170272239A1 · Minematsu · 2017 [cited by examiner]
US 20170288902A1 · Rusek et al. · 2017 [cited by applicant]
US 20170294946A1 · Wang et al. · 2017 [cited by applicant]
US 20170302415A1 · Park et al. · 2017 [cited by applicant]
US 20170331539A1 · Pham et al. · 2017 [cited by applicant]
US 20180138939A1 · Robinson et al. · 2018 [cited by applicant]
US 20190075091A1 · Shattil et al. · 2019 [cited by applicant]
US 20190097694A1 · Jeon et al. · 2019 [cited by applicant]
US 20190115960A1 · Jiang et al. · 2019 [cited by applicant]
US 20190158206A1 · Li et al. · 2019 [cited by applicant]
US 20190215222A1 · Cheng et al. · 2019 [cited by applicant]
US 20190260444A1 · Hauzner et al. · 2019 [cited by applicant]
US 20190268035A1 · Robinson et al. · 2019 [cited by applicant]
US 20190280719A1 · Yu · 2019 [cited by applicant]
US 20190349042A1 · Ramireddy et al. · 2019 [cited by applicant]
US 20190349045A1 · Varatharaajan et al. · 2019 [cited by applicant]
US 20190370652A1 · Shen · 2019 [cited by examiner]
US 20190379430A1 · Pekoz et al. · 2019 [cited by applicant]
US 20200007204A1 · Jeon et al. · 2020 [cited by applicant]
US 20200014407A1 · Smith et al. · 2020 [cited by applicant]
US 20200028617A1 · Landis et al. · 2020 [cited by applicant]
US 20200162123A1 · Robinson et al. · 2020 [cited by applicant]
US 20200366333A1 · Robinson · 2020 [cited by applicant]
US 20210006288A1 · Robinson et al. · 2021 [cited by applicant]
US 20210006303A1 · Robinson · 2021 [cited by applicant]
US 20210006317A1 · Robinson · 2021 [cited by applicant]
US 20210006446A1 · Robinson · 2021 [cited by applicant]
US 20210006451A1 · Robinson · 2021 [cited by applicant]
US 20210013936A1 · Zhu et al. · 2021 [cited by applicant]
US 20210036901A1 · Robinson · 2021 [cited by applicant]
US 20210067211A1 · Robinson · 2021 [cited by applicant]
US 20210091830A1 · Robinson · 2021 [cited by applicant]
US 20210159950A1 · Robinson · 2021 [cited by applicant]
US 20210184899A1 · Robinson · 2021 [cited by applicant]
US 20210250075A1 · Robinson · 2021 [cited by applicant]
US 20210409193A1 · Robinson · 2021 [cited by applicant]
US 20220006504A1 · Robinson · 2022 [cited by applicant]
US 20220209831A1 · Robinson · 2022 [cited by applicant]
US 20220353114A1 · Robinson · 2022 [cited by applicant]
US 20230015280A1 · Robinson · 2023 [cited by applicant]
US 20240072854A1 · Robinson · 2024 [cited by applicant]
CN 1061312A · 1992 [cited by applicant]
CN 1168611A · 1997 [cited by applicant]
CN 1273721A · 2000 [cited by applicant]
CN 1312620A · 2001 [cited by applicant]
CN 1703863A · 2005 [cited by applicant]
CN 1813435A · 2006 [cited by applicant]
CN 1841953A · 2006 [cited by applicant]
CN 101047417A · 2007 [cited by applicant]
CN 101179539A · 2008 [cited by applicant]
CN 101222470A · 2008 [cited by applicant]
CN 101321059A · 2008 [cited by applicant]
CN 101395875A · 2009 [cited by applicant]
CN 101510799A · 2009 [cited by applicant]
CN 101715641A · 2010 [cited by applicant]
CN 101795257A · 2010 [cited by applicant]
CN 102122980A · 2011 [cited by applicant]
CN 102804623A · 2012 [cited by applicant]
CN 103338168A · 2013 [cited by applicant]
CN 103609047A · 2014 [cited by applicant]
CN 103634065A · 2014 [cited by applicant]
CN 103716111A · 2014 [cited by applicant]
CN 103957086A · 2014 [cited by applicant]
CN 104618293A · 2015 [cited by applicant]
CN 105007625A · 2015 [cited by applicant]
CN 105337714A · 2016 [cited by applicant]
CN 105515658A · 2016 [cited by applicant]
CN 106953671A · 2017 [cited by applicant]
CN 107040341A · 2017 [cited by applicant]
CN 107113124A · 2017 [cited by applicant]
CN 107251499A · 2017 [cited by applicant]
CN 107276716A · 2017 [cited by applicant]
CN 110176951A · 2019 [cited by applicant]
EP 1514355A1 · 2005 [cited by applicant]
EP 1566909A1 · 2005 [cited by applicant]
EP 1826915A1 · 2007 [cited by applicant]
EP 1883168A2 · 2008 [cited by applicant]
EP 2961080A1 · 2015 [cited by applicant]
EP 3211812A1 · 2017 [cited by applicant]
JP 2002232391A · 2002 [cited by applicant]
JP 2003198500A · 2003 [cited by applicant]
JP 2007124301A · 2007 [cited by applicant]
JP 2012170110A · 2012 [cited by applicant]
JP 2013162293A · 2013 [cited by applicant]
JP 2014183460A · 2014 [cited by applicant]
KR 20080026010A · 2008 [cited by applicant]
KR 20100131373A · 2010 [cited by applicant]
KR 20110028993A · 2011 [cited by applicant]
KR 20120040138A · 2012 [cited by applicant]
KR 20130093465A · 2013 [cited by applicant]
KR 20130118525A · 2013 [cited by applicant]
KR 20180043719A · 2018 [cited by applicant]
TW 200820650A · 2008 [cited by applicant]
WO WO9200639A1 · 1992 [cited by applicant]
WO WO2006025382A1 · 2006 [cited by applicant]
WO WO2006078687A2 · 2006 [cited by applicant]
WO WO2008024773A2 · 2008 [cited by applicant]
WO WO2008098225A2 · 2008 [cited by applicant]
WO WO2009099013A1 · 2009 [cited by applicant]
WO WO2010101097A1 · 2010 [cited by applicant]
WO WO2010111194A1 · 2010 [cited by applicant]
WO WO2010147443A2 · 2010 [cited by applicant]
WO WO2012141227A1 · 2012 [cited by applicant]
WO WO2014014576A1 · 2014 [cited by applicant]
WO WO2015186531A1 · 2015 [cited by applicant]
WO WO2016132873A1 · 2016 [cited by applicant]
WO WO2017027469A1 · 2017 [cited by applicant]
WO WO2018089985A1 · 2018 [cited by applicant]
WO WO2021003054A1 · 2021 [cited by applicant]
WO WO2021003072A1 · 2021 [cited by applicant]
WO WO2021003204A1 · 2021 [cited by applicant]
WO WO2021021703A1 · 2021 [cited by applicant]
WO WO2021046104A1 · 2021 [cited by applicant]
WO WO2021061604A1 · 2021 [cited by applicant]
WO WO2021162974A1 · 2021 [cited by applicant]
Extended European Search Report for European Application No. EP23204173.1 dated Feb. 7, 2024, 11 pages. [cited by applicant]
Ishikawa, E., et al., “An Implementation of Butterfly Network on Partially Dynamically Reconfigurable FGPA”, 2007 IEICE General Conference (2007); vol. 1, p. 190; 4 pages with English translation. [cited by applicant]
Office Action and search report for Chinese Application No. CN202080061735 mailed Feb. 28, 2024, 8 pages. [cited by applicant]
Office Action and Search report for Chinese Application No. CN202080074980.3 dated Apr. 4, 2024, 8 pages. [cited by applicant]
Office Action and Search Report for Chinese Application No. CN20208054209 dated Mar. 12, 2024, 8 pages. [cited by applicant]
Office Action and Search report for Chinese Patent Application No. CN202110526855.8 dated Mar. 7, 2024, 13 pages. [cited by applicant]
Office Action for European Application No. EP20742591.9 dated Jan. 29, 2024, 7 pages. [cited by applicant]
Office Action for European Patent Application No. EP21707588.6 dated Feb. 16, 2024, 7 pages. [cited by applicant]
Office Action for Indian Patent Application No. IN202217000418 dated Feb. 12, 2024, 7 pages. [cited by applicant]
Office Action for Israel Application No. IL290241 dated Feb. 25, 2024, 4 pages. [cited by applicant]
Office Action for Japanese Patent Application No. JP2021578092 dated Mar. 7, 2024, 11 pages. [cited by applicant]
Office Action for Japanese Patent Application No. JP2022518908 dated Feb. 14, 2024, 6 pages. [cited by applicant]
Office Action for Korean Application No. KR1020227006756 dated Jan. 29, 2024, 27 pages. [cited by applicant]
Office Action for Korean Application No. KR20227003443 dated Feb. 23, 2024, 7 pages. [cited by applicant]
Zhu, X., et al., “Transforming the distribution of OFDM signals for peak-to-average power ratio reduction”, European Transactions on Telecommunications (2010); 21(4): 352-362. [cited by applicant]
Korean Office Action for Korean Application No. 10-2022-7032222 dated Mar. 24, 2023, 11 pages with English translation. [cited by applicant]
Office Action for European Application No. EP20757057 dated May 3, 2023, 9 pages. [cited by applicant]
U.S. Appl. No. 17/845,965: Requirement for Restriction/Election, mailed Apr. 24, 2023; 6 pages. [cited by applicant]
Office Action for Canadian Application No. CA3043340 dated Aug. 10, 2023, 4 pages. [cited by applicant]
Office Action for European Application No. EP21707588.6 dated Aug. 4, 2023, 6 pages. [cited by applicant]
Office Action for Korean Application No. KR20227003443 mailed Jul. 4, 2023, 13 pages. [cited by applicant]
Office Action for European Application No. EP20170870211 dated Jun. 22, 2023, 5 pages. [cited by applicant]
Office Action for European Application No. EP20743505.8 dated Jun. 20, 2023, 7 pages. [cited by applicant]
Office Action for Japanese Application No. JP2021578070 dated Jun. 9, 2023, 9 pages. [cited by applicant]
[Author Unknown] “Signature Design for NoMA”, Ericsson, 3GPP TSG-RAN1 #92, R1-1802767, Agenda Item: 7.4.1, Athens, Greece (Feb. 26-Mar. 2, 2018); 8 pages. [cited by applicant]
[Author Unknown] “UL RS via OZCL Sequences”, Sharp, 3GPP TSG-RAN WG1#49bis, R1-072719, Agenda Item: 5.11.2; Orlando, USA (Jun. 25-29, 2007); 16 pages. [cited by applicant]
Kamle, U., et al., “Performance evaluation of new multi level spreading codes for DS CDMA communication over Rayleigh fading channel”, 2013 International Conference on Advances in Computing, Communications and Informati… [cited by applicant]
Office Action and search report for Chinese Application No. CN202080061735 mailed Aug. 16, 2023, 16 pages. [cited by applicant]
Office Action and search report for Chinese Application No. CN202110526855 mailed Aug. 18, 2023, 12 pages. [cited by applicant]
Office Action for European Application No. EP20742591.9 mailed Aug. 24, 2023, 6 pages. [cited by applicant]
Office Action for Indian Application No. IN202117061533 dated Aug. 24, 2023, 6 pages. [cited by applicant]
Office Action for Japanese Application No. JP2022518908 dated Aug. 31, 2023, 20 pages. [cited by applicant]
Office Action for Korean Application No. KR20227003438 mailed Aug. 9, 2023, 7 pages. [cited by applicant]
Sun, Q., et al., “A New Binary Equiangular Tight Frame Based on Steiner System”, Communication Technology (Feb. 2017); 50(2): 220-223; 4 pages with English Abstract. [cited by applicant]
Tang, J., “Research on Vector Quantization Codebook Design and Application”, Dissertation submitted to University of Science and Technology of China, China Academic Journal Electronic Publishing House (Oct. 2006); 156 p… [cited by applicant]
[Author Unknown] “3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation (Release 12)”, Advanced Lte… [cited by applicant]
Co-pending U.S. Appl. No. 18/495,671, inventor Robinson; Matthew Brandon, filed Oct. 26, 2023. [cited by applicant]
Fang, S., et al., “Non-Unitary Precoding Base on Codebook for Multi-User MIMO System with Limited Feedback”, Journal of Electronics and Information (2008); 30(10): 2419-2422. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/845,965 dated Jan. 17, 2024, 23 pages. [cited by applicant]
Fu, M.., et al., “Single User Geometric Mean Decomposition Hybrid Precoding for Massive Multiple-input Multiple-output Millimeter Wave System”, Science Technology and Engineering (2019); 19(11); 160-166. [cited by applicant]
Heath, R. W., et al., “On quasi-orthogonal signatures for CDMA systems”, IEEE Transactions on Information Theory (2006); 52(3): 1217-1226. [cited by applicant]
Jisheng, P., et al., “Linear precoding design for MIMO channels with finite alphabet constraints”, Gaojishu Tongxin/Chinese High Technology Letters (2013); 23(11): 1117-1123. [cited by applicant]
Office Action and Search Report for Chinese Application No. CN202080054209 dated Oct. 20, 2023, 12 pages. [cited by applicant]
Office Action and Search Report for Chinese Application No. CN202080074980.3 dated Oct. 18, 2023, 26 pages. [cited by applicant]
Office Action and Search Report for Chinese Application No. CN20208061350 dated Nov. 13, 2023, 33 pages. [cited by applicant]
Office Action for Canadian Application No. CA20203145735 dated Oct. 19, 2023, 4 pages. [cited by applicant]
Office Action for Canadian Application No. CA20203145809 dated Oct. 17, 2023, 4 pages. [cited by applicant]
Office Action for European Application No. EP20743505 dated Jan. 2, 2024, 7 pages. [cited by applicant]
Office Action for European Application No. EP20803304.3 dated Oct. 16, 2023, 13 pages. [cited by applicant]
Office Action for Indian Application No. IN202117061534 dated Oct. 5, 2023, 7 pages. [cited by applicant]
Office Action for Japanese Application No. 20220149034 dated Nov. 24, 2023, 11 pages. [cited by applicant]
Office Action for Korean Application No. KR1020237030135 dated Nov. 21, 2023, 17 pages. [cited by applicant]
Office Action for Korean Application No. KR20227003438 mailed Dec. 14, 2023, 10 pages. [cited by applicant]
Office Action for Korean Application No. KR20227003443 mailed Sep. 15, 2023, 15 pages. [cited by applicant]
Office Action for Korean Application No. KR20227032222 dated Oct. 25, 2023, 5 pages. [cited by applicant]
Office Action for Korean Application No. KR20237030137 mailed Nov. 21, 2023, 12 pages. [cited by applicant]
Office Action for Korean Application No. KR20237030140 mailed Nov. 21, 2023, 16 pages. [cited by applicant]
Saito, Y., et al., “An efficient random unitary matrix for biometric template protection”, 2016 Joint 8th International Conference on Soft Computing and Intelligent Systems (SCIS) and 2016 17th International Symposium o… [cited by applicant]
Via, J., et al., “Optimal precoding for a novel RF-MIMO scheme in transmit correlated Rayleigh channels”, 2009 IEEE 10th Workshop on Signal Processing Advances in Wireless Communications (2009); 334-338. [cited by applicant]
Zheng, M., “Study on codebook-based MIMO system limited feedback precoding technology”, CMFD (2019); 1-98. [cited by applicant]
Alian, Ehsan Haj Mirza, et al., “A phase adjustment approach for interference reduction in OFDM-based cognitive radios”, IEEE Transactions on Wireless Communications (2013); 12(9): 4668-4679. [cited by applicant]
Chinese Office Action for Chinese Application No. 201780079040.1 dated Sep. 22, 2020, 12 pages with English translation. [cited by applicant]
Ericsson, “Signature design for NOMA,” 3GPP TSG-RAN WG1 Meeting #93, Tdoc R1-1806241, Busan, South Korea, May 21-25, 2018, pp. 1-5. [cited by applicant]
European Application No. 17870211.4, Extended European Search Report mailed Jun. 30, 2020; 8 pages. [cited by applicant]
European Application No. 17870211.4, Office Action mailed Dec. 15, 2021; 5 pages. [cited by applicant]
European Application No. 20740468.2, Office Action mailed Nov. 30, 2022; 12 pages. [cited by applicant]
European Application No. EP 20743505.8, Office Action dated Dec. 7, 2022; 7 pages. [cited by applicant]
Huang et al., “Multi-dimensional encryption scheme based on physical layer for fading channel,” IET Communications, Oct. 2018, vol. 12, Issue 19, pp. 2470-2477. [cited by applicant]
Huawei, “Initial Performance Evaluation of Multi-user MIMO Scheme for E-UTRA Downlink,” 3GPP TSG RAN WG1, R1-051094, San Diego, USA, Oct. 10-14, 2005, 7 pages. [cited by applicant]
Huo and Gong, “A New Efficient Physical Layer OFDM Encryption Scheme,” IEEE INFOCOM 2014, IEEE Conference on Computer Communications, pp. 1024-1032. [cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2020/051927, mailed on Apr. 7, 2022, 14 pages. [cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2020/043686, mailed Feb. 10, 2022, 16 pages. [cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2020/049031, mailed on Mar. 8, 2022, 15 pages. [cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2021/017043, mailed Aug. 25, 2022, 9 pages. [cited by applicant]
International Preliminary Report on Patentability for PCT Application No. PCT/US2017/061489, mailed May 14, 2019, 6 pages. [cited by applicant]
International Preliminary Report on Patentability in International Application No. PCT/US2020/039879 dated Jan. 13, 2022, 8 pages. [cited by applicant]
International Preliminary Report on Patentability in International Application No. PCT/US2020/039606 dated Jan. 13, 2022, 13 pages. [cited by applicant]
International Preliminary Report on Patentability in International Application No. PCT/US2020/040393 dated Jan. 13, 2022, 9 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2020/039606, mailed Nov. 25, 2020, 18 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2020/039879, mailed Oct. 9, 2020, 10 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2020/040393, mailed Sep. 3, 2020, 12 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2020/043686, mailed Dec. 3, 2020, 24 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2020/049031, mailed Jan. 18, 2021, 20 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2020/051927, mailed Jan. 15, 2021, 19 pages. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2021/017043 dated May 14, 2021, 10 pages. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2017/061489, mailed Feb. 26, 2018, 8 pages. [cited by applicant]
Invitation to Pay Additional Fees for International Application No. PCT/US2020/039606 dated Sep. 21, 2020, 12 pages. [cited by applicant]
Invitation to Pay Additional Fees for International Application No. PCT/US2020/043686 dated Oct. 7, 2020, 16 pages. [cited by applicant]
Invitation to Pay Additional Fees for International Application No. PCT/US2020/049031 dated Nov. 11, 2020, 13 pages. [cited by applicant]
Japanese Office Action for Japanese Application No. 2019-546787 mailed Aug. 12, 2022; 4 pages with Translation. [cited by applicant]
Japanese Office Action for Japanese Application No. 2019-546787 mailed Mar. 31, 2022; 5 pages with Translation. [cited by applicant]
Japanese Office Action for Japanese Application No. 2019-546787 mailed Nov. 9, 2021, 19 pages with Translation. [cited by applicant]
Korean Office Action for Korean Application No. 10-2019-7016867 dated Dec. 20, 2021, 11 pages with English translation. [cited by applicant]
Lan, Pang-Chang, et al., “Unitary modulation for secrecy enhancement in multi-antenna wireless systems with only CSIT”, 2015 IEEE International Conference on Communication Workshop (ICCW) IEEE (Jun. 8, 2015); pp. 417-42… [cited by applicant]
Liu et al., “Piecewise Chaotic Permutation Method for Physical Layer Security in OFDM-PON,” IEEE Photonics Technology Letters, Nov. 2016, vol. 28, No. 21, pp. 2359-2362. [cited by applicant]
Ma et al., “Secure Communication in TDS-OFDM System Using Constellation Rotation and Noise Insertion,” IEEE Transactions on Consumer Electronics, Aug. 2010, vol. 56, No. 3, pp. 1328-1332. [cited by applicant]
Non Final Office Action for U.S. Appl. No. 17/695,703 dated Jan. 19, 2023, 16 pages. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 16/916,303 mailed on Jun. 20, 2022, 14 pages. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 16/459,254 dated Nov. 5, 2020, 9 pages. [cited by applicant]
Notice of Allowance for U.S. Appl. No. 17/953,276, mailed Feb. 16, 2023, 9 pages. [cited by applicant]
Office Action for European Application No. 20803304.3 dated Mar. 17, 2023, 13 pages. [cited by applicant]
Office Action for European Application No. EP20742591 dated Dec. 22, 2022, 5 pages. [cited by applicant]
Strohmer et al., “Grassmannian frames with applications to coding and communication,” Appl. Comput. Harmon. Anal. (2003); 14: 257-275. [cited by applicant]
Sung et al., “M-PSK Codebook Based Clustered MIMO-OFDM SDMA with Efficient Codebook Search,” IEEE, 2012, 5 pages. [cited by applicant]
Tseng et al., “Hardware Implementation of the Joint Precoding Sub-System and MIMO Detection Preprocessor in IEEE 802.11n/ac WLAN,” Journal of Signal Processing Systems (2019); 91: 875-884. [cited by applicant]
Tsiligianni et al., “Construction of Incoherent Unit Norm Tight Frames With Application to Compressed Sensing,” IEEE Transactions on Information Theory, Apr. 2014, vol. 60, No. 4. pp. 2319-2330. [cited by applicant]
U.S. Appl. No. 15/351,428: Ex Parte Quayle Action, mailed Jan. 11, 2018; 6 pages. [cited by applicant]
U.S. Appl. No. 16/403,757: Ex Parte Quayle Action, mailed Jul. 11, 2019; 6 pages. [cited by applicant]
U.S. Appl. No. 16/416,144: Office Action, mailed Dec. 27, 2019; 14 pages. [cited by applicant]
U.S. Appl. No. 16/416,144: Office Action, mailed May 5, 2020; 14 pages. [cited by applicant]
U.S. Appl. No. 16/459,245: Office Action, mailed Jan. 3, 2020; 8 pages. [cited by applicant]
U.S. Appl. No. 16/459,245: Office Action, mailed Jun. 12, 2020; 8 pages. [cited by applicant]
U.S. Appl. No. 16/527,240: Office Action, mailed Jun. 22, 2020; 11 pages. [cited by applicant]
U.S. Appl. No. 16/527,240: Requirement for Restriction/Election, mailed Apr. 16, 2020; 6 pages. [cited by applicant]
U.S. Appl. No. 16/560,447: Ex Parte Quayle Action, mailed Mar. 20, 2020; 5 pages. [cited by applicant]
U.S. Appl. No. 16/580,722: Office Action, mailed Apr. 22, 2020; 11 pages. [cited by applicant]
U.S. Appl. No. 16/690,769: Office Action, mailed Mar. 3, 2020; 9 pages. [cited by applicant]
U.S. Appl. No. 17/027,144: Office Action, mailed Oct. 15, 2020; 9 pages. [cited by applicant]
U.S. Appl. No. 17/142,702: Office Action, mailed Oct. 28, 2021; 11 pages. [cited by applicant]
U.S. Appl. No. 17/161,118: Office Action, mailed Nov. 10, 2021; 37 pages. [cited by applicant]
Wu et al., “Practical Physical Layer Security Schemes for MIMO-OFDM Systems Using Precoding Matrix Indices,” IEEE Journal on Selected Areas in Communications, Sep. 2013, vol. 31, Issue 9, pp. 1687-1700. [cited by applicant]
Xie et al., “Geometric Mean Decomposition Based Hybrid Precoding for Millimeter-Wave Massive MIMO,” China Communications, May 2018, vol. 15, Issue 5, pp. 229-238. [cited by applicant]
Zhang et al., “A Novel Precoder Design for MIMO Multicasting with MMSE-DFE Receivers,” IEEE, 2014, 5 pages. [cited by applicant]
Zheng et al., “Performance Comparison on the Different Codebook for SU/MU MIMO,” IEEE 802.16 Broadband Wireless Access Working Group, IEEE C802.16m-08/1183r1, Sep. 12, 2008, pp. 1-9. [cited by applicant]
Kim, J., “PAPR Reduction of OFDM by Unitary Transformation”, TeleCIS Wireless, Inc., IEEE (Nov. 2002); 19 pages. [cited by applicant]
Non-Final Office Action for U.S. Appl. No. 17/845,965 mailed on Sep. 27, 2023, 23 pages. [cited by applicant]
Office Action for Japanese Application No. JP20210578092 mailed Sep. 6, 2023, 11 pages. [cited by applicant]