| Sonstiges: |
- Nachgewiesen in: USPTO Patent Grants
- Sprachen: English
- Patent Number: 11277,392
- Publication Date: March 15, 2022
- Appl. No: 17/103182
- Application Filed: November 24, 2020
- Assignees: Department 13, Inc. (Columbia, MD, US)
- Claim: 1. An apparatus for communicating in a wireless communication network, comprising: at least one processor; and at least one non-transitory computer-readable memory communicatively coupled to the at least one processor, the at least one non-transitory computer-readable memory including a set of instructions stored thereon and executable by the processor for: receiving a linear transformation signal transmitted from a wireless transmitter, the linear transformation signal having been generated by applying a data-bearing pre-coding transform to a first set of reference symbols; producing a second set of reference symbols; employing the second set of reference symbols to remove the first set of reference symbols from the linear transformation signal; and decoding the data-bearing pre-coding transform to recover data encoded thereon.
- Claim: 2. The apparatus recited in claim 1 , wherein the data-bearing pre-coding transform further comprises a precoding matrix computed from channel measurements.
- Claim: 3. The apparatus recited in claim 2 , wherein the precoding matrix is a Multiple Input, Multiple Output (MIMO) precoding matrix.
- Claim: 4. The apparatus recited in claim 1 , wherein the data-bearing pre-coding transform is generated with an encryption key, and the encryption key is employed by the receiver to decode the linear transformation signal.
- Claim: 5. The apparatus recited in claim 1 , wherein the linear transformation signal complies with a data transmission format for a cellular network, and the apparatus and the wireless transmitter communicate via a peer-to-peer network.
- Claim: 6. The apparatus recited in claim 1 , wherein the data-bearing pre-coding transform comprises time-varying features based on at least one of the data and channel measurements.
- Claim: 7. The apparatus recited in claim 1 , wherein the first set of reference symbol values comprises at least one of a predetermined data sequence known by both the apparatus and the wireless transmitter, symbol values received from a broadcast signal, and symbol values generated by an algorithm that is common to both the apparatus and the wireless transmitter.
- Claim: 8. A method performed by a wireless receiver in a wireless communication network, comprising: receiving a linear transformation signal transmitted from a wireless transmitter, the linear transformation signal having been generated by applying a data-bearing pre-coding transform to a first set of reference symbols; producing a second set of reference symbols; employing the second set of reference symbols to remove the first set of reference symbols from the linear transformation signal; and decoding the data-bearing pre-coding transform to recover data encoded thereon.
- Claim: 9. The method recited in claim 8 , wherein the data-bearing pre-coding transform further comprises a precoding matrix computed from channel measurements.
- Claim: 10. The method recited in claim 9 , wherein the precoding matrix is a Multiple Input, Multiple Output (MIMO) precoding matrix.
- Claim: 11. The method recited in claim 8 , wherein the data-bearing pre-coding transform is generated with an encryption key, and the encryption key is employed by the wireless receiver to decode the linear transformation signal.
- Claim: 12. The method recited in claim 8 , wherein the linear transformation signal complies with a data transmission format for a cellular network, and the wireless transmitter and the wireless receiver communicate via a peer-to-peer network.
- Claim: 13. The method recited in claim 8 , wherein the data-bearing pre-coding transform comprises time-varying features based on at least one of the information and channel measurements.
- Claim: 14. The method recited in claim 8 , wherein the first set of reference symbol values comprises at least one of a predetermined data sequence known by both the wireless transmitter and the wireless receiver, symbol values received from a broadcast signal, and symbol values generated by an algorithm that is common to both the wireless transmitter and the wireless receiver.
- Claim: 15. A non-transitory computer-readable memory including a set of instructions stored thereon and executable by a processor for: receiving a linear transformation signal transmitted from a wireless transmitter, the linear transformation signal having been generated by applying a data-bearing pre-coding transform to a first set of reference symbols; producing a second set of reference symbols; employing the second set of reference symbols to remove the first set of reference symbols from the linear transformation signal; and decoding the data-bearing pre-coding transform to recover data encoded thereon.
- Claim: 16. The non-transitory computer-readable memory recited in claim 15 , wherein the data-bearing pre-coding transform comprises a precoding matrix computed from channel measurements.
- Claim: 17. The non-transitory computer-readable memory recited in claim 16 , wherein the precoding matrix is a Multiple Input, Multiple Output (MIMO) precoding matrix.
- Claim: 18. The non-transitory computer-readable memory recited in claim 15 , wherein the data-bearing pre-coding transform is generated with an encryption key, and decoding employs the encryption key to decode the linear transformation signal.
- Claim: 19. The non-transitory computer-readable memory recited in claim 15 , wherein the linear transformation signal complies with a data transmission format for a cellular network, and a wireless receiver on which the processor resides and the wireless transmitter communicate via a peer-to-peer network.
- Claim: 20. The non-transitory computer-readable memory recited in claim 15 , wherein the data-bearing pre-coding transform comprises time-varying features based on at least one of the information and channel measurements.
- Claim: 21. The non-transitory computer-readable memory recited in claim 15 , wherein the first set of reference symbol values comprises at least one of a predetermined data sequence known by both a wireless receiver on which the processor resides and the wireless transmitter, symbol values received from a broadcast signal, and symbol values generated by an algorithm that is common to both the wireless transmitter and the wireless receiver.
- Patent References Cited: 6031913 February 2000 Hassan et al. ; 6686879 February 2004 Shattil ; 7430257 September 2008 Shattil ; 8051181 November 2011 Larson et al. ; 8122505 February 2012 Verma ; 8180057 May 2012 Delaney et al. ; 8594026 November 2013 Hirschman et al. ; 8670390 March 2014 Shattil ; 2002/0067757 June 2002 Philips et al. ; 2003/0163697 August 2003 Pabla et al. ; 2005/0091399 April 2005 Candan et al. ; 2005/0228659 October 2005 Mitlin ; 2006/0034177 February 2006 Schrempp ; 2006/0146802 July 2006 Baldwin et al. ; 2008/0232238 September 2008 Agee ; 2009/0003591 January 2009 Murakami ; 2009/0005094 January 2009 Lee et al. ; 2009/0017829 January 2009 Laroia et al. ; 2011/0033044 February 2011 Britz ; 2011/0170574 July 2011 Ripple et al. ; 2011/0173696 July 2011 Dynes et al. ; 2012/0231739 January 2012 Chen et al. ; 2013/0078954 March 2013 Fan et al. ; 2013/0095845 April 2013 Lim et al. ; 2013/0286972 October 2013 Dateki ; 2014/0038657 February 2014 Jo et al. ; 2015/0049713 February 2015 Lan et al.
- Other References: J.L. Brooks, et al., “Coherence Multiplexing of Fiber-optic Interferometric Sensors,” Journal of Lightwave Technology, vol. LT-3, No. 5, Oct. 1985. cited by applicant ; A.O. Hero, “Secure space-time communication,” IEEE Transactions on Information Theory, vol. 49, No. 12, pp. 3235-3249, Dec. 2003. cited by applicant ; R.M. Narayanan, “Sensing and Communications Using Ultrawideband Random Noise Waveforms,” 2005 AFOSR Program Review for Sensing, Imaging and Object Recognition , Raleigh, NC, May 26, 2005. cited by applicant
- Primary Examiner: Bhatti, Hashim S
- Attorney, Agent or Firm: Schmeiser, Olsen & Watts, LLP ; Meola, Anthony L.
|
