IP Library Granted Patent US 11,606,233
Granted Patent B2
US 11,606,233 · App. 16/932,755 · Granted Mar 14, 2023

Distributed radio system

Inventor: Steve Shattil (Cheyenne, WY)
Assignee: Tybalt, LLC
H04L27/2602G06N20/00H04B7/024H04B7/0456H04L27/2614H04L27/2626
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 11,606,233
App. No.
16/932,755
Granted
Mar 14, 2023
Kind
B2
Abstract

Systems, methods, and apparatuses for analyzing a wireless communication signal are provided. A set of linear operations is performed on a received signal vector, which comprises values of a transmitted signal received by a receiver. The set of linear operations is configured to produce an expanded matrix having multiple rows and multiple columns. The column values in each row of the base expanded matrix are summed to produce a processed signal vector. At least one signal parameter of the processed signal vector is measured to produce at least one signal parameter measurement, and based on the at least one signal parameter measurement, at least one column in the expanded matrix is updated to produce an updated expanded matrix.

Claims (37)

1. A method performed by a receiver in a wireless communication network, the receiver converting a received transmission into a set of received symbol values, the method, comprising:

producing a base expanded matrix having a plurality N of column values and N rows, wherein the base expanded matrix equals a product of at least one NxN matrix operator with an N×N diagonal matrix comprising the received symbol values;

summing the N column values in each of the N rows of the base expanded matrix to produce a processed signal vector;

measuring at least one signal parameter of the processed signal vector to produce at least one signal parameter measurement; and

based on the at least one signal parameter measurement, updating at least one column in the base expanded matrix to produce an updated expanded matrix.

2. The method of claim 1 , wherein the updating employs a set of update weights computed from a machine-learning algorithm.

3. The method of claim 2 , wherein the machine-learning algorithm comprises at least one of an association-rule algorithm, a clustering algorithm, a k-means algorithm, a collaborative filtering algorithm, an artificial intelligence algorithm, an artificial neural network algorithm, a filter-generating network, a dynamic filtering layer, a multilayer perceptron algorithm, or a prediction network.

4. The method of claim 1 , wherein the at least one signal parameter measurement comprises signal-to-noise ratio, reference signal received power, received signal strength indicator, Multiple-Input Multiple-Output (MIMO) performance, MIMO condition number, sum rate, mean per-user rate, spectral efficiency, bit error probability, signal to interference plus noise ratio, outage probability, or correlation between subchannels.

5. The method of claim 1 , wherein updating comprises at least one of multiplying the base expanded matrix with a weight matrix, changing a sign of a selected value in the base expanded matrix, deleting selected values in the base expanded matrix, phase-shifting selected values in the base expanded matrix, performing bit operations on selected values of the base expanded matrix, performing an additive update to the base expanded matrix, and performing an additive update to a base signal vector.

6. The method of claim 1 , wherein the base expanded matrix is a previously updated expanded matrix.

7. The method of claim 1 , wherein updating employs a sparse operator matrix.

8. The method of claim 1 , wherein performing, summing, measuring, and updating are computed on a graphics processing unit (GPU), and wherein at least updating is configured to optimize global memory access, optimize shared memory access, exploit reuse, or exploit parallelism in the GPU.

9. A network device that converts a received transmission into a set of received symbol values, the network device comprising:

a non-transitory computer-readable memory; and

at least one processor in communication with the non-transitory computer-readable memory and configured for:

producing a base expanded matrix having a plurality N of column values and N rows, wherein the base expanded matrix equals a product of at least one N×N matrix operator with an NxN diagonal matrix comprising the received symbol values;

summing the N column values in each of the N rows of the base expanded matrix to produce a processed signal vector;

measuring at least one signal parameter of the processed signal vector to produce at least one signal parameter measurement; and

based on the at least one signal parameter measurement, updating at least one column in the base expanded matrix to produce an updated expanded matrix.

10. The network device of claim 9 , wherein the updating employs a set of update weights computed from a machine-learning algorithm.

11. The network device of claim 10 , wherein the machine-learning algorithm comprises at least one of an association-rule algorithm, a clustering algorithm, a k-means algorithm, a collaborative filtering algorithm, an artificial intelligence algorithm, an artificial neural network algorithm, a filter-generating network, a dynamic filtering layer, a multilayer perceptron algorithm, or a prediction network.

12. The network device of claim 9 , wherein the at least one signal parameter measurement comprises signal-to-noise ratio, reference signal received power, received signal strength indicator, Multiple-Input Multiple-Output (MIMO) performance, MIMO condition number, sum rate, mean per-user rate, spectral efficiency, bit error probability, signal to interference plus noise ratio, outage probability, or correlation between subchannels.

13. The network device of claim 9 , wherein updating comprises at least one of multiplying the base expanded matrix with a weight matrix, changing a sign of a selected value in the base expanded matrix, deleting selected values in the base expanded matrix, phase-shifting selected values in the base expanded matrix, performing bit operations on selected values of the base expanded matrix, performing an additive update to the base expanded matrix, and performing an additive update to a base signal vector.

14. The network device of claim 9 , wherein the base expanded matrix is a previously updated expanded matrix.

15. The network device of claim 9 , wherein updating employs a sparse operator matrix.

16. The network device of claim 9 , wherein the at least one processor comprises at least one graphics processing unit (GPU), and wherein at least updating is configured to optimize global memory access, optimize shared memory access, exploit reuse, or exploit parallelism in the at least one GPU.

17. A computer program product, comprising a non-transitory computer-readable memory having computer-readable program code stored thereon, the computer-readable program code containing instructions executable by one or more processors to implement a method wherein a receiver in a communication network converts a received transmission into a set of received symbol values, the method comprising:

producing a base expanded matrix having a plurality N of column values and N rows, wherein the base expanded matrix equals a product of at least one NxN matrix operator with an N×N diagonal matrix comprising the received symbol values;

summing the N column values in each of the N rows of the base expanded matrix to produce a processed signal vector;

measuring at least one signal parameter of the processed signal vector to produce at least one signal parameter measurement; and

based on the at least one signal parameter measurement, updating at least one column in the base expanded matrix to produce an updated expanded matrix.

18. The computer program product of claim 17 , wherein the updating employs a set of update weights computed from a machine-learning algorithm.

19. The computer program product of claim 18 , wherein the machine-learning algorithm comprises at least one of an association-rule algorithm, a clustering algorithm, a k-means algorithm, a collaborative filtering algorithm, an artificial intelligence algorithm, an artificial neural network algorithm, a filter-generating network, a dynamic filtering layer, a multilayer perceptron algorithm, or a prediction network.

20. The computer program product of claim 17 , wherein the at least one signal parameter measurement comprises signal-to-noise ratio, reference signal received power, received signal strength indicator, Multiple-Input Multiple-Output (MIMO) performance, MIMO condition number, sum rate, mean per-user rate, spectral efficiency, bit error probability, signal to interference plus noise ratio, outage probability, or correlation between subchannels.

21. The computer program product of claim 17 , wherein updating comprises at least one of multiplying the base expanded matrix with a weight matrix, changing a sign of a selected value in the base expanded matrix, deleting selected values in the base expanded matrix, phase-shifting selected values in the base expanded matrix, performing bit operations on selected values of the base expanded matrix, performing an additive update to the base expanded matrix, and performing an additive update to a base signal vector.

22. The computer program product of claim 17 , wherein the base expanded matrix is a previously updated expanded matrix.

23. The computer program product of claim 17 , wherein updating employs a sparse operator matrix.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 6, 2022
From: GENGHISCOMM HOLDINGS, LLC
To: TYBALT, LLC
Reel/Frame 059179/0468 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 3, 2022
From: SHATTIL, STEVE J
To: GENGHISCOMM HOLDINGS, LLC
Reel/Frame 059310/0087 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 3, 2022
From: DEPARTMENT 13, INC.
To: GENGHISCOMM HOLDINGS, LLC
Reel/Frame 059709/0683 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 15, 2020
From: SHATTIL, STEVE
To: GENGHISCOMM HOLDINGS, LLC
Reel/Frame 053505/0953 →
Cited By (1)
US 12,244,446