CODEBOOK FOR AI-ASSISTED CHANNEL ESTIMATION
    1.
    发明公开

    公开(公告)号:US20240056138A1

    公开(公告)日:2024-02-15

    申请号:US18365874

    申请日:2023-08-04

    CPC classification number: H04B7/0456 H04L25/0204 H04L25/0256

    Abstract: A method includes identifying ACF information by: obtaining channel information including multiple channels of expected operation scenarios; and based on the channel information for each of the channels, determining MMSE channel estimation (CE) weights expressed in a form of ACFs and an SNR, and covariance matrices. The method includes clustering the MMSE CE weights into K clusters. A center ACF weight of each of the K clusters represents a codeword. The method includes determining a distance metric based on a cluster distance after a re-clustering. The method includes, in response to a determination that cluster distances before and after the clustering differ from each other by a non-negligibly, iteratively re-clustering the ACF information thereby updating the center ACF weights and cluster distances. The method includes generating the codebook to include an index k of each of the K clusters and the center ACF weight of each of the K clusters.

    Codebook for AI-assisted channel estimation

    公开(公告)号:US12250035B2

    公开(公告)日:2025-03-11

    申请号:US18365874

    申请日:2023-08-04

    Abstract: A method includes identifying ACF information by: obtaining channel information including multiple channels of expected operation scenarios; and based on the channel information for each of the channels, determining MMSE channel estimation (CE) weights expressed in a form of ACFs and an SNR, and covariance matrices. The method includes clustering the MMSE CE weights into K clusters. A center ACF weight of each of the K clusters represents a codeword. The method includes determining a distance metric based on a cluster distance after a re-clustering. The method includes, in response to a determination that cluster distances before and after the clustering differ from each other by a non-negligibly, iteratively re-clustering the ACF information thereby updating the center ACF weights and cluster distances. The method includes generating the codebook to include an index k of each of the K clusters and the center ACF weight of each of the K clusters.

Patent Agency Ranking