IP Library › Granted Patent US 12,556,243
Granted Patent B2
US 12,556,243 · App. 18/576,233 · Granted Feb 17, 2026

Port selection with low complexity

Inventors: Xueying Hou (Lund, SE); Mats Åhlander (Solna, SE); Sebastian Faxér (Stockholm, SE); Krister Edström (Hjärup, SE)
Assignee: Telefonaktiebolaget LM Ericsson (publ)
H04B7/0456H04L25/021
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,556,243
App. No.
18/576,233
Granted
Feb 17, 2026
Kind
B2
Abstract

Systems and methods are disclosed for port selection for a wireless communication system. In one embodiment, a method performed by a Radio Access Network (RAN) node comprises dividing a channel matrix of one subcarrier of a Multiple-Input-Multiple-Output (MIMO) channel between an antenna array of the RAN node and a particular User Equipment (UE) into sub-matrices. The method further comprises forming a re-ordered channel matrix as a concatenation of the sub-matrices and forming a port-sorting matrix based on eigen vector matrices and eigen value matrices obtained via Eigen Value Decompositions (EVDs) performed on channel covariance matrices for the sub-matrices. The method further comprises applying the port-sorting matrix to the re-ordered channel matrix, re-ordering column vectors in the port-sorted channel matrix based on eigen values obtained from the EVDs, and applying grouping of the re-ordered, port-sorted channel matrix and port sorting accordingly to obtain a final port-sorted channel matrix.

Claims (128)

1 . A method performed by a radio access network, RAN, node, the method comprising:

dividing a channel matrix, H, into two or more sub-matrices, wherein:

the channel matrix, H, is a full channel matrix of one subcarrier of a Multiple-Input-Multiple-Output, MIMO, channel between an antenna array of the RAN node and a particular User Equipment, UE; and

each sub-matrix of the two or more sub-matrices comprises two or more column vectors of the channel matrix, H;

forming a re-ordered channel matrix, H re-order , as a concatenation of the two or more sub-matrices;

forming a port-sorting matrix based on eigen vector matrices, U g i , and eigen value matrices, D g i , obtained via Eigen Value Decompositions, EVDs, performed on channel covariance matrices for the two or more sub-matrices;

applying the port-sorting matrix to the re-ordered channel matrix, H re-order , to provide a port-sorted channel matrix, H re-order ps ;

re-ordering column vectors in the port-sorted channel matrix, H re-order ps , based on eigen values obtained from the EVDs performed on the channel covariance matrices for the two or more sub-matrices to provide a re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps ; and

applying grouping of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps , and port sorting accordingly to obtain a final port-sorted channel matrix, {tilde over (H)} final ; and

transmitting a downlink transmission to the particular UE based on the final port-sorted channel matrix or the first L columns of the final port-sorted channel matrix.

2 . The method of claim 1 wherein dividing the channel matrix, H, into the two or more sub-matrices comprises:

computing correlation values, ρ i,j , for all pairs of column vectors in the channel matrix, H; and

dividing the channel matrix, H, into the two or more sub-matrices based on the correlation values, ρ i,j .

3 . The method of claim 1 wherein the two or more sub-matrices consist of a first sub-matrix and a second sub-matrix, and dividing the channel matrix, H, into the two or more sub-matrices comprises:

finding the pair of column vectors in the channel matrix, H, having a highest correlation value from among the correlation values, ρ i,j , for all pairs of column vectors in the channel matrix, H;

selecting one column vector from the pair of column vectors in the channel matrix, H, having the highest correlation value as a reference column vector;

selecting the pair of column vectors in the channel matrix, H, having a highest correlation value and N r /2−2 additional channel vectors having the highest correlation values with respect to the reference column vector as the first sub-matrix; and

selecting the N r /2 that are not included in the first-matrix as the second sub-matrix.

4 . The method of claim 1 wherein forming the port-sorting matrix comprises:

for each sub-matrix of the two or more sub-matrices:

computing a channel covariance matrix for the sub-matrix; and

performing an Eigen Value Decomposition, EVD, on the channel covariance matrix for the sub-matrix; and

forming the port-sorting matrix based on the eigen vector matrices, U g i , and the eigen value matrices, D g i , obtained via the EVDs performed on the channel covariance matrices for the two or more sub-matrices.

5 . The method of claim 1 wherein the two or more sub-matrices consist of a first sub-matrix and a second sub-matrix, and the port-sorting sub-matrix is computed as:

U

=

[

U

g

1

*

0

0

U

g

2

*

]

[

D

g

1

-

1

2

0

0

D

g

2

-

1

2

]

wherein U g 1 is the eigen vector matrix for the first sub-matrix, D g 1 is the eigen value matrix for the first sub-matrix, U g 2 is the eigen vector matrix for the second sub-matrix, and D g 2 is the eigen value matrix for the second sub-matrix.

6 . The method of claim 1 wherein applying grouping of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps , and port sorting accordingly to obtain the final port-sorted channel matrix, {tilde over (H)} final , comprises:

dividing the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps , into two or more sub-matrices each comprising two or more consecutive column vectors from the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps ;

for each sub-matrix of the two or more sub-matrices of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps :

computing a channel covariance matrix for the sub-matrix of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps ; and

performing an EVD on the channel covariance matrix for the sub-matrix of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps ;

forming a second port-sorting matrix based on eigen vector matrices, N s k , and the eigen value matrices, L s k , obtained via the EVDs performed on the channel covariance matrices for the two or more sub-matrices of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps ; and

applying the second port-sorting matrix to the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps , to provide the final port-sorted channel matrix, {tilde over (H)} final .

7 . The method of claim 1 further comprising performing layer selection for the particular UE by selecting a first L columns of the final port-sorted channel matrix, {tilde over (H)} final , wherein L is a number of layers for a current rank of the particular UE.

8 . The method of claim 1 further comprising computing beamforming weights for a downlink transmission to the particular UE based on the final port-sorted channel matrix, {tilde over (H)} final , or the first L columns of the final port-sorted channel matrix, {tilde over (H)} final .

9 . A radio access network, RAN, node comprising processing circuitry configured to cause the RAN node to:

divide a channel matrix, H, into two or more sub-matrices, wherein:

the channel matrix, H, is a full channel matrix of one subcarrier of a Multiple-Input-Multiple-Output, MIMO, channel between an antenna array of the RAN node and a particular User Equipment, UE; and

each sub-matrix of the two or more sub-matrices comprises two or more column vectors of the channel matrix, H;

form a re-ordered channel matrix, H re-order , as a concatenation of the two or more sub-matrices;

form a port-sorting matrix based on eigen vector matrices, U g i , and eigen value matrices, D gi , obtained via Eigen Value Decompositions, EVDs, performed on channel covariance matrices for the two or more sub-matrices;

apply the port-sorting matrix to the re-ordered channel matrix, H re-order , to provide a port-sorted channel matrix, H re-order ps ;

re-order column vectors in the port-sorted channel matrix, H re-order ps , based on eigen values obtained from the EVDs performed on the channel covariance matrices for the two or more sub-matrices to provide a re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps ; and

apply grouping of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps , and port sorting accordingly to obtain a final port-sorted channel matrix, {tilde over (H)} final ; and

transmitting a downlink transmission to the particular UE based on the final port-sorted channel matrix or the first L columns of the final port-sorted channel matrix.

10 . The RAN node of claim 9 wherein, in order to divide the channel matrix, H, into the two or more sub-matrices, the processing circuitry is further configured to cause the RAN node to:

compute correlation values, β i,j for all pairs of column vectors in the channel matrix, H; and

divide the channel matrix, H, into the two or more sub-matrices based on the correlation values, ρ i,j .

11 . The RAN node of claim 9 wherein the two or more sub-matrices consist of a first sub-matrix and a second sub-matrix, and, in order to divide the channel matrix, H, into the two or more sub-matrices, the processing circuitry is further configured to cause the RAN node to:

find the pair of column vectors in the channel matrix, H, having a highest correlation value from among the correlation values, ρ i,j , for all pairs of column vectors in the channel matrix, H;

select one column vector from the pair of column vectors in the channel matrix, H, having the highest correlation value as a reference column vector;

select the pair of column vectors in the channel matrix, H, having a highest correlation value and N r /2−2 additional channel vectors having the highest correlation values with respect to the reference column vector as the first sub-matrix; and

select the N r /2 that are not included in the first-matrix as the second sub-matrix.

12 . The RAN node of claim 11 wherein, in order to form the port-sorting matrix, the processing circuitry is further configured to cause the RAN node to:

for each sub-matrix of the two or more sub-matrices:

compute a channel covariance matrix for the sub-matrix;

perform an Eigen Value Decomposition, EVD, on the channel covariance matrix for the sub-matrix;

form the port-sorting matrix based on the eigen vector matrices, U g i , and the eigen value matrices, D g i , obtained via the EVDs performed on the channel covariance matrices for the two or more sub-matrices.

13 . The RAN node of claim 11 wherein the two or more sub-matrices consist of a first sub-matrix and a second sub-matrix, and the port-sorting sub-matrix is computed as:

U

=

[

U

g

1

*

0

0

U

g

2

*

]

[

D

g

1

-

1

2

0

0

D

g

2

-

1

2

]

wherein U g 1 is the eigen vector matrix for the first sub-matrix, D g 1 is the eigen value matrix for the first sub-matrix, U g 2 is the eigen vector matrix for the second sub-matrix, and D g 2 is the eigen value matrix for the second sub-matrix.

14 . The RAN node of claim 9 wherein, in order to apply grouping of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps , and port sorting accordingly to obtain the final port-sorted channel matrix, {tilde over (H)} final , the processing circuitry is further configured to cause the RAN node to:

divide the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps , into two or more sub-matrices each comprising two or more consecutive column vectors from the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps ;

for each sub-matrix of the two or more sub-matrices of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps :

compute a channel covariance matrix for the sub-matrix of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps ;

perform an EVD on the channel covariance matrix for the sub-matrix of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps ;

form a second port-sorting matrix based on eigen vector matrices, N s k , and the eigen value matrices, L s k , obtained via the EVDs performed on the channel covariance matrices for the two or more sub-matrices of the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps ;

apply the second port-sorting matrix to the re-ordered, port-sorted channel matrix, {tilde over (H)} re-order ps , to provide the final port-sorted channel matrix, {tilde over (H)} final .

15 . The RAN node of claim 9 wherein the processing circuitry is further configured to cause the RAN node to perform layer selection for the particular UE by selecting a first L columns of the final port-sorted channel matrix, {tilde over (H)} final , wherein L is a number of layers for a current rank of the particular UE.

16 . The RAN node of claim 9 wherein the processing circuitry is further configured to cause the RAN node to compute beamforming weights for a downlink transmission to the particular UE based on the final port-sorted channel matrix, {tilde over (H)} final , or the first L columns of the final port-sorted channel matrix, {tilde over (H)} final .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 3, 2024
From: HOU, XUEYING; ÅHLANDER, MATS; FAXÉR, SEBASTIAN; EDSTRÖM, KRISTER
To: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Reel/Frame 066007/0442 →
Continuity (2)
Provisional Application 63220221 · Jul 9, 2021
Related Publication 20240313832A1 · Sep 19, 2024
References Cited (33)
US 10389414B1 · Qi et al. · 2019 [cited by applicant]
US 12316577B2 · Liu · 2025 [cited by examiner]
US 20060071807A1 · Sadowsky · 2006 [cited by applicant]
US 20060120478A1 · Kim et al. · 2006 [cited by applicant]
US 20090103641A1 · Masui et al. · 2009 [cited by applicant]
US 20120002759A1 · Lin · 2012 [cited by examiner]
US 20130215989A1 · Miyatani et al. · 2013 [cited by applicant]
US 20180167183A1 · Zhang et al. · 2018 [cited by applicant]
US 20190174527A1 · Park et al. · 2019 [cited by applicant]
US 20190260613A1 · Lee et al. · 2019 [cited by applicant]
US 20200229201A1 · Tong et al. · 2020 [cited by applicant]
US 20210143874A1 · Park et al. · 2021 [cited by applicant]
US 20220209839A1 · Cheng et al. · 2022 [cited by applicant]
CN 107547117A · 2018 [cited by applicant]
CN 109309517A · 2019 [cited by applicant]
CN 111758272A · 2020 [cited by applicant]
EP 1657829A1 · 2006 [cited by applicant]
EP 4087151A1 · 2022 [cited by applicant]
WO 2017008307A1 · 2017 [cited by applicant]
WO 2017219739A1 · 2017 [cited by applicant]
WO 2018050088A1 · 2018 [cited by applicant]
WO 2020154832A1 · 2020 [cited by applicant]
WO 2020200471A1 · 2020 [cited by applicant]
WO 2021135837A1 · 2021 [cited by applicant]
WO 2023282840A1 · 2023 [cited by applicant]
Supplementary European Search Report for European Patent Application No. 22838134.9, mailed Oct. 18, 2024, 4 pages. [cited by applicant]
Supplementary European Search Report for European Patent Application No. 22838133.1, mailed Oct. 16, 2024, 5 pages. [cited by applicant]
Author Unknown, “Technical Specification Group Radio Access Network; NR; Physical layer procedures for data (Release 16),” Technical Specification 38.214, Version 16.6.0, Jun. 2021, 3GPP Organizational Partners, 172 pag… [cited by applicant]
Bhavatharini, et al., “Offloading Mobile Computations To Cloud To Save Mobile Energy,” International Journal of Engineering Research and Technology, Jul. 30, 2018, pp. 26-30. [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/SE2022/050699, mailed Sep. 16, 2022, 15 pages. [cited by applicant]
International Search Report and Written Opinion for International Patent Application No. PCT/SE2022/050698, mailed Sep. 27, 2022, 14 pages. [cited by applicant]
Examination Report for European Patent Application No. 22838134.9, mailed Oct. 30, 2024, 7 pages. [cited by applicant]
Examination Report for European Patent Application No. 22838133.1, mailed Oct. 28, 2024, 7 pages. [cited by applicant]