Efficient linear detection implementation for massive MIMO
First Claim
Patent Images
1. A method comprising:
- per given time instance, acquiring K samples b from a signal r, which is based at least on K transmitted symbols x and a transfer matrix H of a communication channel, and a linear detection matrix A of a size K×
K, which is based at least on the transfer matrix H;
iteratively calculating at most K(K−
1) tentative parameters b{tilde over (
)} and at most K(K−
1) tentative parameters A{tilde over (
)} for the K samples b and the linear detection matrix A;
checking whether or not the tentative parameters b{tilde over (
)} and A{tilde over (
)} have converged;
if b{tilde over (
)} and A{tilde over (
)} have converged, deciding K estimation values x{circumflex over (
)} for the K transmitted symbols x based on b{tilde over (
)} and A{tilde over (
)}; and
if b{tilde over (
)} and A{tilde over (
)} have not converged, returning to the iteratively calculating b{tilde over (
)} and A{tilde over (
)}for the K samples b.
1 Assignment
0 Petitions
Accused Products
Abstract
Per given time instance, K samples b are acquired from a signal r, which is based at least on K transmitted symbols x and a transfer matrix H of a communication channel, and a linear detection matrix A of a size K×K is acquired, which is based at least on the transfer matrix H (S101). For the K samples b and the linear detection matrix A, at most K(K−1) tentative parameters b{tilde over ( )} and at most K(K−1) tentative parameters A{tilde over ( )} are iteratively calculated (S102). It is checked whether or not the tentative parameters b{tilde over ( )} and A{tilde over ( )} have converged (S103). If b{tilde over ( )} and A{tilde over ( )} have converged, K estimation values x{circumflex over ( )} are decided for the K transmitted symbols x based on b{tilde over ( )} and A{tilde over ( )} (S104). If b{tilde over ( )} and A{tilde over ( )} have not converged, it is returned to the iteratively calculating b{tilde over ( )} and A{tilde over ( )} for the K samples b.
-
Citations
20 Claims
-
1. A method comprising:
-
per given time instance, acquiring K samples b from a signal r, which is based at least on K transmitted symbols x and a transfer matrix H of a communication channel, and a linear detection matrix A of a size K×
K, which is based at least on the transfer matrix H;iteratively calculating at most K(K−
1) tentative parameters b{tilde over (
)} and at most K(K−
1) tentative parameters A{tilde over (
)} for the K samples b and the linear detection matrix A;checking whether or not the tentative parameters b{tilde over (
)} and A{tilde over (
)} have converged;if b{tilde over (
)} and A{tilde over (
)} have converged, deciding K estimation values x{circumflex over (
)} for the K transmitted symbols x based on b{tilde over (
)} and A{tilde over (
)}; andif b{tilde over (
)} and A{tilde over (
)} have not converged, returning to the iteratively calculating b{tilde over (
)} and A{tilde over (
)}for the K samples b. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A non-transitory computer readable medium comprising program instructions for causing an apparatus to perform at least the following:
-
per given time instance, acquiring K samples b from a signal r, which is based at least on K transmitted symbols x and a transfer matrix H of a communication channel, and a linear detection matrix A of a size K×
K, which is based at least on the transfer matrix H;iteratively calculating at most K(K−
1) tentative parameters b{tilde over (
)} and at most K(K−
1) tentative parameters A{tilde over (
)} for the K samples b and the linear detection matrix A;checking whether or not the tentative parameters b{tilde over (
)} and A{tilde over (
)} have converged;if b{tilde over (
)} and A{tilde over (
)} have converged, deciding K estimation values x{circumflex over (
)} for the K transmitted symbols x based on b{tilde over (
)} and A{tilde over (
)}; andif b{tilde over (
)} and A{tilde over (
)} have not converged, returning to the iteratively calculating b{tilde over (
)} and A{tilde over (
)} for the K samples b. - View Dependent Claims (10, 11, 12, 13)
-
-
14. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following:
-
per given time instance, acquiring K samples b from a signal r, which is based at least on K transmitted symbols x and a transfer matrix H of a communication channel, and a linear detection matrix A of a size K×
K, which is based at least on the transfer matrix H;iteratively calculating at most K(K−
1) tentative parameters b{tilde over (
)} and at most K(K−
1) tentative parameters A{tilde over (
)} for the K samples b and the linear detection matrix A;checking whether or not the tentative parameters b{tilde over (
)} and A{tilde over (
)} have converged;if b{tilde over (
)} and A{tilde over (
)} have converged, deciding K estimation values x{circumflex over (
)} for the K transmitted symbols x based on b{tilde over (
)} and A{tilde over (
)}; andif b{tilde over (
)} and A{tilde over (
)} have not converged, returning to the iteratively calculating b{tilde over (
)} and A{tilde over (
)} for the K samples b. - View Dependent Claims (15, 16, 17, 18, 19, 20)
-
Specification
-
- Resources
Litigation Campaign Assessment
Thank you for your request. You will receive a custom alert email when the Litigation Campaign Assessment is available.
×
-
Current AssigneeNokia Technologies Oy (Nokia Corporation)
-
Original AssigneeNokia Technologies Oy (Nokia Corporation)
-
InventorsShental, Ori
-
Primary Examiner(s)Phu, Phuong
-
Application NumberUS16/434,377Publication NumberTime in Patent Office333 DaysField of Search375260, 375346, 375340, 375349US Class CurrentCPC Class CodesH04B 7/0413 MIMO systemsH04B 7/0473 taking constraints in layer...H04B 7/0478 Special codebook structures...H04B 7/0634 Antenna weights or vector/m...H04L 25/067 providing soft decisions, i...
