CN112075033B

CN112075033B - Beam codebook generating method of 5G terminal

Info

Publication number: CN112075033B
Application number: CN201980029827.6A
Authority: CN
Inventors: 莫建华; 黄鹏达; 张建中; 蒋尚铉; 黄文隆
Original assignee: Samsung Electronics Co Ltd
Current assignee: Samsung Electronics Co Ltd
Priority date: 2018-05-25
Filing date: 2019-05-27
Publication date: 2024-02-09
Anticipated expiration: 2039-05-27
Also published as: EP3785377A4; EP3785377A1; CN112075033A; WO2019226028A1

Abstract

The present disclosure relates to providing a communication method and system for fusing a fifth generation (5G) communication system supporting higher data rates than a fourth generation (4G) system with internet of things (IoT) technology. The present disclosure may be applied to smart services based on 5G communication technology and IoT-related technology, such as smart home, smart building, smart city, smart car, networking car, healthcare, digital education, smart retail, security and security services. A method of a User Equipment (UE) in a wireless communication system is provided. The method comprises the following steps: identifying electric field data of each antenna of the UE to be used for transmitting and receiving data; generating a set of codewords comprising a first upper limit and a second upper limit based on the electric field data, the set of codewords corresponding to candidate beams for each antenna; selecting at least one codeword from a set of codewords based on a performance criterion; configuring a codebook to be used for each antenna by adding at least one codeword to the codebook; determining whether a codebook including at least one codeword satisfies a condition to stop adding another codeword to the codebook; and applying the configured codebook to transmit or receive data on each antenna based on whether the condition is satisfied.

Description

Beam codebook generating method of 5G terminal

Technical Field

The present application relates generally to beam management. More particularly, the present disclosure relates to generating a beam codebook for advanced communication systems.

Background

In order to meet the increasing demand for wireless data services since the deployment of 4G communication systems, efforts have been made to develop improved 5G or quasi 5G communication systems. Therefore, the 5G or pre-5G communication system is also referred to as a "super 4G network" or a "LTE-after-system". A 5G communication system is considered to be implemented in a higher frequency (mmWave) band (e.g., 60GHz band) to achieve a higher data rate. In order to reduce propagation loss of radio waves and increase transmission distances, beamforming, massive multiple-input multiple-output (MIMO), full-dimensional MIMO (FD-MIMO), array antennas, analog beamforming, and large-scale antenna techniques have been discussed in 5G communication systems. Further, in the 5G communication system, system network improvement developments based on advanced small cells, cloud Radio Access Networks (RANs), ultra dense networks, device-to-device (D2D) communication, wireless backhaul, mobile networks, cooperative communication, cooperative multipoint (CoMP), receiving-end interference cancellation, and the like are underway. In the 5G system, hybrid Frequency Shift Keying (FSK) and Quadrature Amplitude Modulation (QAM) modulation (FQAM) and Sliding Window Superposition Coding (SWSC) as Advanced Code Modulation (ACM), and Filter Bank Multicarrier (FBMC), non-orthogonal multiple access (NOMA), sparse Code Multiple Access (SCMA), and the like have been developed.

The internet is evolving from a human-centric connected network through which humans generate and consume information to an internet of things (IoT) network in which distributed entities, such as objects, can exchange and process information without human intervention. Everything interconnect (IoE) has emerged that combines big data processing technology, etc. with IoT technology through a connection with a cloud server. As technical elements, such as "sensing technology", "wired/wireless communication and network infrastructure", "service interface technology", and "security technology" are required to implement IOT, recently, technologies such as sensor networks, machine-to-machine (M2M) communication, machine Type Communication (MTC), and the like have been studied. This IoT environment may provide a smart internet technology service that creates new value for human life by collecting and analyzing data generated between connected objects. By fusing and combining existing Information Technology (IT) with various industries, ioT may be applied in a variety of fields including smart homes, smart buildings, smart cities, smart cars or networked cars, smart grids, healthcare, smart appliances, and advanced medical services.

Similarly, various attempts have been made to apply 5G communication systems to IoT networks. For example, techniques such as sensor networks, machine Type Communications (MTC), machine-to-machine (M2M) communications may be implemented through such as beamforming, MIMO, and array antennas. Applications of the cloud Radio Access Network (RAN) as the big data processing technology described above may also be considered as examples of the convergence of 5G technology with IoT technology.

Disclosure of Invention

Technical problem

In a wireless communication network, network access and Radio Resource Management (RRM) are enabled through physical layer synchronization signals and higher (MAC) layer procedures. In particular, a User Equipment (UE) attempts to detect the presence of a synchronization signal and at least one cell Identification (ID) for initial access. Once the UE is in the network and associated with the serving cell, the UE monitors several neighboring cells by attempting to detect their synchronization signals and/or measuring associated cell-specific Reference Signals (RSs). For next generation cellular systems, such as third generation partnership-new air interface access or interface (3 GPP-NR), efficient unified radio resource acquisition or tracking mechanisms are desired, which are applicable to various use cases, such as enhanced mobile broadband (eMBB), ultra-reliable low latency (URLLC), large-scale machine type communications (mctc), each corresponding to different coverage requirements and frequency bands with different propagation losses.

Technical proposal

In one embodiment, a User Equipment (UE) in a wireless communication system is provided. The UE includes an antenna and a processor operatively connected to the antenna. The processor is configured to: identifying electric field (E-field) data of each of the antennas of the UE to be used for transmitting and receiving data; generating a set of codewords comprising a first upper limit and a second upper limit based on the electric field data, the set of codewords corresponding to candidate beams for each of the antennas; selecting at least one codeword from the set of codewords based on a performance criterion; configuring a codebook to be used for each of the antennas by adding the at least one codeword to the codebook; determining whether the codebook including the at least one codeword satisfies a condition to stop adding another codeword to the codebook; and applying the configured codebook to transmit or receive the data on each of the antennas based on whether the condition is satisfied.

In another embodiment, a method of a User Equipment (UE) in a wireless communication system is provided. The method comprises the following steps: identifying electric field data of each antenna of the UE to be used for transmitting and receiving data; generating a set of codewords comprising a first upper limit and a second upper limit based on the electric field data, the set of codewords corresponding to candidate beams for each antenna; selecting at least one codeword from the set of codewords based on a performance criterion; configuring a codebook to be used for each antenna by adding the at least one codeword to the codebook; determining whether the codebook including the at least one codeword satisfies a condition to stop adding another codeword to the codebook; and applying the configured codebook to transmit or receive the data on each antenna based on whether the condition is satisfied.

In yet another embodiment, a non-transitory computer-readable medium is provided that includes instructions that, when executed by at least one processor, perform a method. The method comprises the following steps: identifying electric field data of each antenna of the UE to be used for transmitting and receiving data; generating a set of codewords comprising a first upper limit and a second upper limit based on the electric field data, the set of codewords corresponding to candidate beams for each antenna; selecting at least one codeword from the set of codewords based on a performance criterion; configuring a codebook to be used for each antenna by adding the at least one codeword to the codebook; determining whether the codebook including the at least one codeword satisfies a condition to stop adding another codeword to the codebook; and applying the configured codebook to transmit or receive the data on each antenna based on whether the condition is satisfied.

Other technical features may be readily apparent to one skilled in the art from the following figures, descriptions, and claims.

Before proceeding with the following detailed description, it may be advantageous to set forth definitions of certain words and phrases used throughout this patent document. The term "couple" and its derivatives refer to any direct or indirect communication between two or more elements, whether or not those elements are in physical contact with one another. The terms "transmit," "receive," and "communicate," and derivatives thereof, encompass both direct and indirect communication. The terms "include" and "comprise," as well as derivatives thereof, mean inclusion without limitation. The term "or" is inclusive, meaning and/or. The phrase "associated with," and derivatives thereof, is intended to include, be included in, interconnect with, contain, be included in, be connected to or be connected with, be coupled to, communicate with, cooperate with, interleave, juxtapose, be proximate to, bind or combine with, have the properties of …, be related to, or the like. The term "controller" refers to any device, system, or portion thereof that controls at least one operation. The controller may be implemented in hardware or a combination of hardware and software and/or firmware. The functionality associated with any particular controller may be centralized or distributed, whether locally or remotely. The phrase "at least one of" when used with a list of items means that different combinations of one or more of the listed items may be used and that only one item in the list may be required. For example, "at least one of A, B and C" includes any one of the following combinations: a, A is as follows; b, a step of preparing a composite material; c, performing operation; a and B; a and C; b and C; and A and B and C.

Furthermore, the various functions described below may be implemented or supported by one or more computer programs, each of which is formed from and embodied in a computer readable medium. The terms "application" and "program" refer to one or more computer programs, software components, sets of instructions, procedures, functions, objects, classes, instances, related data, or a portion thereof adapted for implementation in a suitable computer readable program code. The phrase "computer readable program code" includes any type of computer code, including source code, object code, and executable code. The phrase "computer readable medium" includes any type of medium capable of being accessed by a computer, such as Read Only Memory (ROM), random Access Memory (RAM), a hard disk drive, a Compact Disc (CD), a Digital Video Disc (DVD), or any other type of memory. "non-transitory" computer-readable media do not include wired, wireless, optical, or other communication links that transmit transitory electrical or other signals. Non-transitory computer readable media include media that can permanently store data as well as media that can store and subsequently overwrite data, such as rewritable optical disks or erasable memory devices.

Definitions for certain other words and phrases are provided throughout this patent document. Those of ordinary skill in the art should understand that in many, if not most instances, such definitions apply to prior as well as future uses of such defined words and phrases.

Advantageous effects

Embodiments of the present disclosure provide for generating a beam codebook for an advanced communication system.

Drawings

For a more complete understanding of the present disclosure and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which like reference numbers indicate like parts throughout:

fig. 1 illustrates an example wireless network according to an embodiment of the disclosure;

FIG. 2 illustrates an example gNB, according to an embodiment of the present disclosure;

fig. 3 illustrates an example UE in accordance with an embodiment of the present disclosure;

fig. 4A illustrates a high-level diagram of an orthogonal frequency division multiple access transmit path according to an embodiment of the present disclosure;

fig. 4B illustrates a high-level diagram of an orthogonal frequency division multiple access receive path according to an embodiment of the present disclosure;

fig. 5 shows a transmitter block diagram of PDSCH in a subframe according to an embodiment of the disclosure;

fig. 6 shows a receiver block diagram of PDSCH in a subframe according to an embodiment of the disclosure;

fig. 7 shows a transmitter block diagram of PUSCH in a subframe according to an embodiment of the disclosure;

Fig. 8 shows a receiver block diagram of PUSCH in a subframe according to an embodiment of the disclosure;

fig. 9 illustrates an example antenna block according to an embodiment of the disclosure;

fig. 10 illustrates an example user device according to an embodiment of the disclosure;

FIG. 11 illustrates example upper limits for single and multiple arrays according to an embodiment of the present disclosure;

FIG. 12 illustrates example automatic codebook generation according to an embodiment of the present disclosure;

FIG. 13 illustrates a flow chart of a heuristic according to an embodiment of the present disclosure;

FIG. 14 illustrates an example coordinate system according to an embodiment of the disclosure;

FIG. 15 illustrates an example EIRP CDF and some key metrics according to an embodiment of the disclosure;

FIG. 16 illustrates an example two-dimensional heat map of spherical coverage areas of a codebook according to an embodiment of the present disclosure;

FIG. 17 illustrates an example difference between upper bound radiation and codebook radiation in accordance with an embodiment of the present disclosure;

FIG. 18 illustrates an example EIRP CDF combining patterns according to an embodiment of the disclosure;

FIG. 19 illustrates an example of dividing a set of directions into subsets according to an embodiment of the disclosure;

FIG. 20 illustrates an example definition of a to determine beam width according to an embodiment of the present disclosure;

FIG. 21 illustrates θ for determining coverage areas according to an embodiment of the present disclosure _sec Is defined as an example of (a);

FIG. 22 shows an example fibonacci grid having 363 points across a sphere in accordance with an embodiment of the disclosure;

FIG. 23 illustrates an example impact of an LCD on UE EIRP mode according to an embodiment of the disclosure;

fig. 24 illustrates exemplary antenna module activation based on device operation in accordance with an embodiment of the present disclosure;

FIG. 25 illustrates an example beam codebook design methodology according to an embodiment of the present disclosure;

fig. 26 illustrates an example multi-beam codebook management system according to an embodiment of the present disclosure;

fig. 27 illustrates an example beam codebook adaptation over time in accordance with an embodiment of the present disclosure;

fig. 28 illustrates example UE beam codebook learning based on data analysis in accordance with an embodiment of the present disclosure;

fig. 29 illustrates an example UE beam data analysis module on a terminal according to an embodiment of the disclosure;

fig. 30 illustrates another example UE beam data analysis module on a terminal according to an embodiment of this disclosure;

fig. 31 shows an example UE beam data analysis circuit with other beam management blocks on a terminal according to an embodiment of the disclosure;

fig. 32 illustrates an example process of using a UE beam data analysis module according to an embodiment of the disclosure;

Fig. 33 illustrates an example UE beam data analysis circuit in accordance with an embodiment of the present disclosure; and

fig. 34 shows a flowchart of a method for a UE beam data analysis module according to an embodiment of the present disclosure.

Detailed Description

Figures 1 through 34, discussed below, and the various embodiments used to describe the principles of the present disclosure in this patent document are by way of illustration only and should not be construed in any way to limit the scope of the disclosure. Those skilled in the art will appreciate that the principles of the present disclosure may be implemented in any suitably arranged system or device.

In order to meet the increasing demand for wireless data services since the deployment of 4G communication systems, efforts have been made to develop improved 5G or quasi 5G communication systems. Therefore, the 5G or pre-5G communication system is also referred to as a "super 4G network" or a "LTE-after-system".

A 5G communication system is considered to be implemented in a higher frequency (mmWave) band (e.g., 28GHz, 39GHz, 60GHz bands) to achieve higher data rates. In order to reduce propagation loss of radio waves and increase transmission coverage area, beamforming, massive Multiple Input Multiple Output (MIMO), full-dimensional MIMO (FD-MIMO), array antennas, analog beamforming, and large-scale antenna techniques, etc. have been discussed in 5G communication systems.

Further, in the 5G communication system, system network improvement developments based on advanced small cells, cloud Radio Access Networks (RANs), ultra dense networks, device-to-device (D2D) communication, wireless backhaul communication, mobile networks, cooperative communication, cooperative multipoint (CoMP) transmission and reception, interference mitigation and cancellation, and the like are underway.

In the 5G system, hybrid Frequency Shift Keying (FSK) and Quadrature Amplitude Modulation (QAM) modulation (FQAM) and Sliding Window Superposition Coding (SWSC) as Adaptive Modulation and Coding (AMC) techniques, and Filter Bank Multicarrier (FBMC), non-orthogonal multiple access (NOMA), sparse Code Multiple Access (SCMA) and the like as advanced access techniques have been developed.

Fig. 1-4B below describe various embodiments implemented in a wireless communication system and utilizing Orthogonal Frequency Division Multiplexing (OFDM) or Orthogonal Frequency Division Multiple Access (OFDMA) communication techniques. The descriptions of fig. 1-3 are not meant to imply physical or architectural limitations with respect to the manner in which different embodiments may be implemented. The various embodiments of the present disclosure may be implemented in any suitably arranged communication system.

Fig. 1 illustrates an example wireless network according to an embodiment of this disclosure. The embodiment of the wireless network shown in fig. 1 is for illustration only. Other embodiments of wireless network 100 may be used without departing from the scope of this disclosure.

As shown in fig. 1, the wireless network includes a gNB 101, a gNB 102, and a gNB 103.gNB 101 communicates with gNB 102 and gNB 103. The gNB 101 is also in communication with at least one network 130, such as the Internet, a proprietary Internet Protocol (IP) network, or other data network.

The gNB 102 provides wireless broadband for the access network 130 for a first plurality of UEs within the coverage area 120 of the gNB 102. The first plurality of UEs includes: UE 111, which may be located in a Small Business (SB); UE 112, which may be located in enterprise (E); UE 113, which may be located in a WiFi Hotspot (HS); UE 114, which may be located in a first home (R); a UE 115, which may be located in a second home (R); UE 116, which may be a mobile device (M), such as a cellular telephone, wireless laptop, wireless PDA, or the like. The gNB 103 provides wireless broadband for the access network 130 for a second plurality of UEs within the coverage area 125 of the gNB 103. The second plurality of UEs includes UE 115 and UE 116. In some embodiments, one or more gNBs 101-103 may communicate with each other and with UEs 111-116 using 5G, LTE, LTE-A, wiMAX, wiFi or other wireless communication techniques.

Depending on the network type, the term "base station" or "BS" may refer to any component (or set of components) configured to provide wireless access to the network, such as a Transmission Point (TP), a transmission-reception point (TRP), an enhanced base station (eNodeB or eNB or gNB), a 5G base station (gNB), a macrocell, a femtocell, a WiFi Access Point (AP), or other wireless-enabled device. The base station may provide wireless access according to one or more wireless communication protocols (e.g., 5g 3gpp new air interface/access (NR), long Term Evolution (LTE), LTE-advanced (LTE-a), high Speed Packet Access (HSPA), wi-fi802.11a/b/g/n/ac, etc.). For convenience, the terms "BS" and "TRP" are used interchangeably in this patent document to refer to the network infrastructure components that provide wireless access to remote terminals. Furthermore, the term "user equipment" or "UE" may refer to any component, such as a "mobile station", "subscriber station", "remote terminal", "wireless terminal", "reception point" or "user equipment", depending on the network type. For convenience, the terms "user equipment" and "UE" are used in this patent document to refer to a remote wireless device that is wireless to access the BS, whether the UE is a mobile device (such as a mobile phone or a smart phone) or is generally considered a stationary device (such as a desktop computer or a vending machine).

The dashed lines represent the general extent of coverage areas 120 and 125, which are shown as being generally circular for purposes of illustration and explanation only. It should be clearly understood that the coverage areas associated with the gnbs, such as coverage areas 120 and 125, may have other shapes, including irregular shapes, depending on the configuration of the gnbs and the variations in the wireless environment associated with the natural and man-made obstructions.

As described in more detail below, one or more of UEs 111-116 include circuitry, procedures, or a combination thereof for efficient beam codebook generation for 5G terminals. In some embodiments, one or more gNBs 101-103 include circuitry, programming, or a combination thereof for generating an effective beam codebook for 5G terminals.

Although fig. 1 shows one example of a wireless network, various modifications may be made to fig. 1. For example, the wireless network may include any number of gnbs and any number of UEs in any suitable arrangement. Further, the gNB 101 may communicate directly with any number of UEs and provide wireless broadband for the access network 130 for those UEs. Similarly, each gNB 102-103 may communicate directly with the network 130 and provide the UE with direct wireless broadband access to the network 130. Furthermore, gNB 101, gNB 102, and/or gNB 103 may provide access to other or additional external networks (such as an external telephone network or other type of data network).

Fig. 2 illustrates an example gNB 102, according to an embodiment of the disclosure. The embodiment of the gNB 102 shown in fig. 2 is for illustration only, and the gnbs 101 and 103 of fig. 1 may have the same or similar configuration. However, the gNB has a variety of configurations, and fig. 2 does not limit the scope of the present disclosure to any particular implementation of the gNB.

As shown in fig. 2, the gNB 102 includes a plurality of antennas 205a-205n, a plurality of RF transceivers 210a-210n, transmit (TX) processing circuitry 215, and Receive (RX) processing circuitry 220. The gNB 102 also includes a controller/processor 225, memory 230, and a backhaul or network interface 235.

The RF transceivers 210a-210n receive incoming RF signals from the antennas 205a-205n, such as signals transmitted by UEs in the network 100. The RF transceivers 210a-210n down-convert the incoming RF signals to generate IF or baseband signals. The IF or baseband signal is sent to RX processing circuit 220, which generates a processed baseband signal by filtering, decoding, and/or digitizing the baseband or IF signal. The RX processing circuit 220 sends the processed baseband signals to a controller/processor 225 for further processing.

TX processing circuitry 215 receives analog or digital data (such as voice data, network (web) data, email, or interactive video game data) from controller/processor 225. TX processing circuitry 215 encodes, multiplexes, and/or digitizes the output baseband data to generate a processed baseband or IF signal. RF transceivers 210a-210n receive the output processed baseband or IF signals from TX processing circuitry 215 and up-convert the baseband or IF signals to RF signals for transmission via antennas 205a-205 n.

The controller/processor 225 may include one or more processors or other processing devices that control the overall operation of the gNB 102. For example, controller/processor 225 may control the reception of forward channel signals and the transmission of reverse channel signals by RF transceivers 210a-210n, RX processing circuitry 220, and TX processing circuitry 215, in accordance with well-known principles. The controller/processor 225 may also support additional functions, such as higher-level wireless communication functions. For example, the controller/processor 225 may support beamforming or directional routing operations in which output/input signals from/to the multiple antennas 205a-205n are weighted differently to effectively steer the output signals in a desired direction. The controller/processor 225 may support any of a variety of other functions in the gNB 102.

The controller/processor 225 is also capable of executing programs and other processes residing in memory 230, such as an OS. Controller/processor 225 may move data into and out of memory 230 as needed to perform the process.

The controller/processor 225 is also coupled to a backhaul or network interface 235. Backhaul or network interface 235 allows the gNB 102 to communicate with other devices or systems through a backhaul connection or through a network. The interface 235 may support communication over any suitable wired or wireless connection. For example, when the gNB 102 is implemented as part of a cellular communication system (such as a 5G, LTE or LTE-a enabled cellular communication system), the interface 235 may allow the gNB 102 to communicate with other gnbs over a wired or wireless backhaul. When the gNB 102 is implemented as an access point, the interface 235 may allow the gNB 102 to communicate with a larger network (such as the internet) through a wired or wireless local area network or through a wired or wireless connection. Interface 235 includes any suitable structure that supports communication over a wired or wireless connection, such as an ethernet or RF transceiver.

Memory 230 is coupled to controller/processor 225. A portion of memory 230 may include RAM and another portion of memory 230 may include flash memory or other ROM.

Although fig. 2 shows one example of the gNB 102, various modifications may be made to fig. 2. For example, the gNB 102 may include any number of each of the components shown in FIG. 2. As a particular example, an access point may include multiple interfaces 235 and the controller/processor 225 may support routing functions to route data between different network addresses. As another particular example, while shown as including a single instance of TX processing circuitry 215 and a single instance of RX processing circuitry 220, the gNB 102 may include multiple instances of each (such as one for each RF transceiver). Moreover, the various components in FIG. 2 may be combined, further subdivided, or omitted, and additional components may be added according to particular needs.

Fig. 3 illustrates an example UE 116 according to an embodiment of this disclosure. The embodiment of UE 116 shown in fig. 3 is for illustration only and UEs 111-115 of fig. 1 may have the same or similar configuration. However, the UE has a variety of configurations, and fig. 3 does not limit the scope of the present disclosure to any particular implementation of the UE.

As shown in fig. 3, UE 116 includes an antenna 305, a Radio Frequency (RF) transceiver 310, TX processing circuitry 315, a microphone 320, and Receive (RX) processing circuitry 325.UE 116 also includes speaker 330, processor 340, input/output (I/O) Interface (IF) 345, touch screen 350, display 355, and memory 360. Memory 360 includes an Operating System (OS) 361 and one or more applications 362.

RF transceiver 310 receives an input RF signal from antenna 305 that is transmitted by the gNB of network 100. The RF transceiver 310 down-converts the input RF signal to generate an Intermediate Frequency (IF) or baseband signal. The IF or baseband signal is sent to RX processing circuit 325, which generates a processed baseband signal by filtering, decoding, and/or digitizing the baseband or IF signal. RX processing circuit 325 sends the processed baseband signal to speaker 330 (such as for voice data) or processor 340 for further processing (such as for web browsing data).

TX processing circuitry 315 receives analog or digital voice data from microphone 320 or other output baseband data (such as network data, email, or interactive video game data) from processor 340. TX processing circuitry 315 encodes, multiplexes, and/or digitizes the output baseband data to generate a processed baseband or IF signal. The RF transceiver 310 receives the output processed baseband or IF signal from the TX processing circuitry 315 and up-converts the baseband or IF signal to an RF signal that is transmitted via the antenna 305.

Processor 340 may include one or more processors or other processing devices and execute OS 361 stored in memory 360 to control the overall operation of UE 116. For example, processor 340 may control the reception of forward channel signals and the transmission of reverse channel signals by RF transceiver 310, RX processing circuit 325, and TX processing circuit 315 in accordance with well-known principles. In some embodiments, processor 340 includes at least one microprocessor or microcontroller.

Processor 340 is also capable of executing other processes and programs residing in memory 360, such as processes for CSI reporting on PUCCH. Processor 340 may move data into and out of memory 360 as needed to perform the process. In some embodiments, the processor 340 is configured to execute the application 362 based on the OS 361 or in response to a signal received from the gNB or operator. The processor 340 is also coupled to an I/O interface 345 that provides the UE 116 with the ability to connect to other devices, such as laptop computers and handheld computers. I/O interface 345 is the communication path between these accessories and processor 340.

Processor 340 is also coupled to touch screen 350 and display 355. An operator of UE 116 may use touch screen 350 to input data to UE 116. Display 355 may be a liquid crystal display, a light emitting diode display, or other display capable of rendering text and/or at least limited graphics, such as from a website.

A memory 360 is coupled to the processor 340. A portion of memory 360 may include Random Access Memory (RAM) and another portion of memory 360 may include flash memory or other Read Only Memory (ROM).

Although fig. 3 shows one example of UE 116, various changes may be made to fig. 3. For example, the various components in FIG. 3 may be combined, further subdivided, or omitted, and additional components may be added according to particular needs. As a particular example, the processor 340 may be divided into multiple processors, such as one or more Central Processing Units (CPUs) and one or more Graphics Processing Units (GPUs). Also, although fig. 3 shows the UE 116 configured as a mobile phone or smart phone, the UE may be configured to operate as other types of mobile or stationary devices.

Fig. 4A is a high-level diagram of a transmit path circuit. For example, the transmit path circuitry may be used for Orthogonal Frequency Division Multiple Access (OFDMA) communications. Fig. 4B is a high-level diagram of a receive path circuit. For example, the receive path circuitry may be used for Orthogonal Frequency Division Multiple Access (OFDMA) communications. In fig. 4A and 4B, for downlink communications, the transmit path circuitry may be implemented in a base station (eNB or gNB) 102 or relay station, and the receive path circuitry may be implemented in a user equipment (e.g., user equipment 116 of fig. 1). In other examples, for uplink communications, the receive path circuitry 450 may be implemented in a base station (e.g., the gNB 102 of fig. 1) or a relay station, and the transmit path circuitry may be implemented in a user device (e.g., the user device 116).

The transmit path circuitry includes a channel coding and modulation block 405, a serial-to-P (S-to-P) block 410, an inverse fourier transform (IFFT) block 415 of size N, a parallel-to-serial (P-to-S) block 420, an add cyclic prefix block 425, and an up-converter (UC) 430. The receive path circuitry 450 includes a Down Converter (DC) 455, a remove cyclic prefix block 460, a serial parallel (S-P) block 465, a Fast Fourier Transform (FFT) block 470 of size N, a parallel serial (P-to-S) block 475, and a channel decoding and demodulation block 480.

At least some of the components 400 of fig. 4A and 450 of fig. 4B may be implemented in software, while other components may be implemented in configurable hardware or a mixture of software and configurable hardware. In particular, note that the FFT blocks and IFFT blocks described in this disclosure document may be implemented as configurable software algorithms, where the value of size N may be modified depending on the implementation.

Furthermore, while the present disclosure is directed to embodiments implementing a fast fourier transform and an inverse fast fourier transform, this is merely exemplary and may not be construed as limiting the scope of the present disclosure. It will be appreciated that in alternative embodiments of the present disclosure, the inverse fast fourier transform function and the inverse fast fourier transform function may be readily replaced by a Discrete Fourier Transform (DFT) function and an Inverse Discrete Fourier Transform (IDFT) function, respectively. It is understood that for DFT and IDFT functions, the value of the N variable may be any integer (i.e., 1, 2, 3, 4, etc.), while for FFT and IFFT functions, the value of the N variable may be any integer that is a power of 2 (i.e., 1, 2, 4, 8, 16, etc.).

In transmit path circuitry 400, a channel coding and modulation block 405 receives a set of information bits, applies a coding (e.g., LDPC coding) and modulates (e.g., quadrature Phase Shift Keying (QPSK) or Quadrature Amplitude Modulation (QAM)) the input bits to produce a series of frequency domain modulation symbols. Serial-to-parallel block 410 converts (i.e., demultiplexes) the serial modulated symbols into parallel data to produce N parallel symbol streams, where N is the IFFT/FFT size used in BS 102 and UE 116. Then, an IFFT block 415 of size N performs an IFFT operation on the N parallel symbol streams to produce a time domain output signal. The parallel-to-serial block 420 converts (i.e., multiplexes) the parallel time-domain output symbols from the size N IFFT block 415 to produce a serial time-domain signal. The add cyclic prefix block 425 then inserts the cyclic prefix into the time domain signal. Finally, up-converter 430 modulates (i.e., up-converts) the output of the added cyclic prefix block 425 to an RF frequency for transmission via a wireless channel. The signal may also be filtered at baseband before conversion to RF frequency.

The transmitted RF signals arrive at the UE 116 after passing through the wireless channel and perform the inverse operation of the operation at the gNB 102. The down converter 455 down converts the received signal to baseband frequency and the remove cyclic prefix block 460 removes the cyclic prefix to produce a serial time domain baseband signal. Serial parallel block 465 converts the time-domain baseband signal into a parallel time-domain signal. The FFT block 470 of size N then performs an FFT algorithm to produce N parallel frequency domain signals. Parallel-to-serial block 475 converts the parallel frequency-domain signal into a series of modulated data symbols. Channel decode and demodulate block 480 demodulates and then decodes the modulated symbols to recover the original input data stream.

Each of the gnbs 101-103 may implement a transmit path similar to transmitting to the user devices 111-116 in the downlink and may implement a receive path similar to receiving from the user devices 111-116 in the uplink. Similarly, each of user devices 111-116 may implement a transmit path corresponding to an architecture for transmitting in the uplink to gNBs 101-103 and may implement a receive path corresponding to an architecture for receiving in the downlink from gNBs 101-103.

5G communication system use cases have been identified and described. These use cases can be roughly divided into three different groups. In one example, an enhanced mobile broadband (eMBB) is determined to have high bit per second (bits/sec) requirements, as well as relaxed latency and reliability requirements. In another example, ultra-reliable and low latency (URLL) is determined to have relaxed bit/second requirements. In yet another example, large machine type communication (mctc) is determined as a number of devices per square kilometer may be as many as 100,000 to 100 tens of thousands, but reliability/throughput/latency requirements may not be stringent. The scheme may also relate to power efficiency requirements, as battery consumption should be minimized as much as possible.

The communication system includes: a Downlink (DL) transmitting a signal from a transmission point, such as a Base Station (BS) or a NodeB, to a User Equipment (UE); and an Uplink (UL) transmitting signals from the UE to a reception point such as a NodeB. The UE, also commonly referred to as a terminal or mobile station, may be fixed or mobile and may be a cellular telephone, a personal computer device or an automated device. An eNodeB, which is typically a fixed station, may also be referred to as an access point or other equivalent terminology. For LTE systems, the NodeB is commonly referred to as an eNodeB (eNB). For 5G systems, the NodeB is called a gNodeB. The present disclosure does not limit the use of enbs or gnbs in the type of wireless communication system.

In a communication system such as an LTE system, DL signals may include a data signal transmitting information content, a control signal transmitting DL Control Information (DCI), and a Reference Signal (RS), which is also referred to as a pilot signal. The eNodeB transmits data information through a Physical DL Shared Channel (PDSCH). The eNodeB transmits DCI over a Physical DL Control Channel (PDCCH) or Enhanced PDCCH (EPDCCH).

The eNodeB transmits the acknowledgement information in response to a data Transport Block (TB) transmitted by the UE in a physical hybrid ARQ indicator channel (PHICH). The eNodeB transmits one or more of multiple types of RSs including UE-Common RSs (CRSs), channel state information RSs (CSI-RSs), or demodulation RSs (DMRSs). CRS is transmitted over DL system Bandwidth (BW) and may be used by UEs to acquire channel estimates to demodulate data or control information or perform measurements. To reduce CRS overhead, the eNodeB may transmit CSI-RS in the time and/or frequency domain at a smaller density than CRS. The DMRS may be transmitted only in BW of the corresponding PDSCH or EPDCCH, and the UE may use the DMRS to demodulate data or control information in the PDSCH or EPDCCH, respectively. The transmission time interval of the DL channel is called a subframe and may have a duration of, for example, 1 millisecond.

The DL signal also includes the transmission of logical channels carrying system control information. The BCCH is mapped to a transport channel called a Broadcast Channel (BCH) when the BCCH conveys a Master Information Block (MIB) or to a DL shared channel (DL-SCH) when the BCCH conveys a System Information Block (SIB). Most of the system information is included in different SIBs transmitted using the DL-SCH. The presence of system information on the DL-SCH in a subframe may be indicated by transmission of a corresponding PDCCH transmitting a codeword with a Cyclic Redundancy Check (CRC) scrambled with a special system information RNTI (SI-RNTI). Alternatively, the scheduling information for SIB transmission may be provided in an earlier SIB, and the scheduling information for the first SIB (SIB-1) may be provided by the MIB.

DL resource allocation is performed in units of subframes and a set of Physical Resource Blocks (PRBs). The transmission BW includes frequency resource units called Resource Blocks (RBs). Each RB includes N _sc ^RB Individual subcarriers or Resource Elements (REs), such as 12 REs. A unit of one RB on one subframe is called a PRB. The UE may be for the total M _sc ^PDSCH ＝M _PDSCH ·N _sc ^RB The REs are allocated M_ { PDSCH } RBs for PDSCH transmissions BW.

The UL signal may include a data signal transmitting data information, a control signal transmitting UL Control Information (UCI), and UL RS. UL RS includes DMRS and Sounding RS (SRS). The UE transmits the DMRS only in BW of the corresponding PUSCH or PUCCH. The eNodeB may demodulate the data signal or UCI signal using DMRS. The UE transmits SRS to provide UL CSI to the eNodeB. The UE transmits data information or UCI through a corresponding Physical UL Shared Channel (PUSCH) or Physical UL Control Channel (PUCCH). If the UE needs to transmit data information and UCI in the same UL subframe, the UE may multiplex both in PUSCH. UCI includes: hybrid automatic repeat request acknowledgement (HARQ-ACK) information indicating correct (ACK) or incorrect (NACK) detection of data TBs in PDSCH) or lack of PDCCH Detection (DTX); a Scheduling Request (SR) indicating whether the UE has data in a buffer of the UE; rank Indicator (RI); and Channel State Information (CSI) that enables the eNodeB to perform link adaptation for PDSCH transmission to the UE. The UE also transmits HARQ-ACK information in response to detecting PDCCH/EPDCCH indicating a release of the semi-persistent scheduled PDSCH.

The UL subframe includes two slots. Each slot includes N for transmitting data information, UCI, DMRS, or SRS _symb ^UL And a symbol. The frequency resource unit of UL system BW is RB. UE for total N _RB ·N _sc ^RB The RE is assigned N _RB The RBs are used to transmit BW. For PUCCH, N _RB =1, the last subframe symbol may be used to multiplex SRS transmissions from one or more UEs. The number of subframe symbols available for data/UCI/DMRS transmission is N _symb ＝2(N _symb ^UL -1)-N _SRS Wherein if the last subframe symbol is used for transmitting SRS, N _SRS =1; otherwise, N _SRS ＝O。

Fig. 5 shows a transmitter block diagram 500 for PDSCH in a subframe according to an embodiment of the disclosure. The embodiment of the transmitter block diagram 500 shown in fig. 5 is for illustration only. Fig. 5 does not limit the scope of the present disclosure to any particular implementation of the transmitter block diagram 500.

As shown in fig. 5, information bits 510 are encoded by an encoder 520, such as a channel encoder (e.g., a Turbo encoder for LTE and/or an LDPC encoder for NR), and modulated by a modulator 530, e.g., using Quadrature Phase Shift Keying (QPSK). Serial-to-parallel (S/P) converter 540 generates M modulation symbols that are then provided to mapper 550 to be mapped to REs selected by transmission BW selection unit 555 for allocated PDSCH transmission BW, unit 560 applies an Inverse Fast Fourier Transform (IFFT), and then outputs a time domain signal serialized by parallel-to-serial (P/S) converter 570 to be created, filtered by filter 580, and transmitted 590 signal. Other functions such as data scrambling, cyclic prefix insertion, time windowing, interleaving, etc. are well known in the art and are not shown for the sake of brevity.

Fig. 6 shows a receiver block diagram 600 for PDSCH in a subframe according to an embodiment of the disclosure. The embodiment of diagram 600 shown in fig. 6 is for illustration only. Fig. 6 does not limit the scope of the present disclosure to any particular implementation of diagram 600.

As shown in fig. 6, the received signal 610 is filtered by a filter 620, REs 630 for allocation of received BW are selected by a BW selector 635, a unit 640 applies a Fast Fourier Transform (FFT), and the output is serialized by a parallel to serial converter 650. Subsequently, demodulator 660 coherently demodulates the data symbols by applying channel estimates obtained from the DMRS or CRS (not shown), and decoder 670 (such as a turbo decoder) decodes the demodulated data to provide estimates of information data bits 680. For simplicity, other functions such as time window, cyclic prefix removal, descrambling, channel estimation and de-interleaving are not shown.

Fig. 7 shows a transmitter block diagram 700 for PUSCH in a subframe, according to an embodiment of the disclosure. The embodiment of block diagram 700 shown in fig. 7 is for illustration only. Fig. 7 does not limit the scope of the present disclosure to any particular implementation of block diagram 700.

As shown in fig. 7, information data bits 710 are encoded by an encoder 720 (such as a Turbo encoder) and modulated by a modulator 730. Discrete Fourier Transform (DFT) unit 740 applies DFT on the modulated data bits, REs 750 corresponding to allocated PUSCH transmission BW are selected by transmission BW selection unit 755, unit 760 applies IFFT, and after cyclic prefix insertion (not shown), filtering is applied by filter 770 and 780 signals are transmitted.

Fig. 8 shows a receiver block diagram 800 for PUSCH in a subframe according to an embodiment of the disclosure. The embodiment of block diagram 800 shown in fig. 8 is for illustration only. Fig. 8 does not limit the scope of the present disclosure to any particular implementation of block diagram 800.

As shown in fig. 8, the received signal 810 is filtered by a filter 820. Subsequently, after the cyclic prefix (not shown) is removed, element 830 applies FFT, RE 840 corresponding to the allocated PUSCH reception BW is selected by reception BW selector 845, element 850 applies Inverse DFT (IDFT), demodulator 860 coherently demodulates the data symbols by applying channel estimation obtained from DMRS (not shown), and decoder 870, such as a channel decoder (e.g., turbo decoder for LTE and/or LDPC decoder for NR), decodes the demodulated data to provide an estimate of information data bits 880.

In order for 5G networks to support such diverse services with different quality of service (QoS), one embodiment, referred to as network slicing, has been determined in the LTE specifications. In order to efficiently utilize PHY resources and multiplex the various slices in the DL-SCH (using different resource allocation schemes, numbers and scheduling strategies), a flexible and self-organizing frame or subframe design is utilized.

Fig. 9 illustrates an example antenna block 900 according to an embodiment of this disclosure. The embodiment of the antenna block 900 shown in fig. 9 is for illustration only. Fig. 9 does not limit the scope of the present disclosure to any particular implementation of antenna block 900.

For the millimeter wave (mmWave) band, although the number of antenna elements may be large for a given form factor, the number of CSI-RS ports (which may correspond to the number of digital pre-coding ports) is susceptible to being limited due to hardware limitations (the feasibility of installing a large number of ADCs/DACs on millimeter wave frequencies), as shown in fig. 10. In this case, one CSI-RS port is mapped onto a large number of antenna elements, which may be controlled by a set of analog phase shifters. One CSI-RS port may then correspond to one sub-array that generates a narrow analog beam by analog beamforming. The analog beam may be configured to sweep through a larger angular range by varying the set of phase shifters across the symbol or sub-frame. The number of subarrays (equal to the number of RF chains) and CSI-RS port N _CSI-PORT The number of (3) is the same. Digital beam forming unit spans N _CSI-PORT The analog beams perform linear combining to further increase the precoding gain. Although the analog beams are wideband (and thus not frequency selective), the digital precoding may vary across sub-bands or resource blocks.

In LTE, there are multiple CSI reporting modes for both periodic (PUCCH-based) and aperiodic (PUSCH-based) CSI reporting. Each CSI reporting mode depends on (is coupled to) many other parameters (e.g., codebook selection, transmission mode, emomo type, RS type, CRS, or CSI-RS port number). At least two disadvantages can be perceived. First, there are complex "nested loops" (IF … ELSE …) and coupling/linking networks. This complicates the testing effort. Second, forward compatibility is limited, especially when new features are introduced.

Although the above-described drawbacks apply to DL CSI measurements, they apply to UL CSI measurements as well. In LTE, the UL CSI measurement framework exists in raw form and does not evolve as does the DL replica. With the advent of TDD or reciprocity-based systems for next generation systems, and OFDMA or OFDMA-based multiple access for UL may be outstanding, the same (or at least similar) CSI measurement and reporting framework for both DL and UL is advantageous.

To assist the UE in determining the RX and/or TX beams of the UE, a beam scanning procedure is employed, including the gNB transmitting a set of transmit beams to scan the cell area, and the UE measuring the signal quality of the different beams using the receive beams of the UE. To facilitate candidate beam identification, beam measurement, and beam quality reporting, the gNB configures the UE with one or more RS resources (e.g., SS blocks, periodic/aperiodic/semi-permanent CSI-RS resources, or CRI) corresponding to a set of TX beams. RS resources refer to reference signal transmission over a combination of one or more time (OFDM symbols)/frequency (resource elements)/space (antenna port) domain locations. For each RX beam, the UE reports the different TX beams received using that RX beam and ranks in order of signal strength (RSRP) and optional CSI (CQI/PMI/RI). Based on the measurement report feedback of the UE, the gNB configures a set of Tx beams for the UE for receiving PDCCH and/or PDSCH.

Fig. 10 illustrates an example user device 1000 in accordance with an embodiment of the disclosure. The embodiment of the user equipment 1000 shown in fig. 10 is for illustration only. Fig. 10 is not intended to limit the scope of the present disclosure to any particular embodiment.

As shown in fig. 10, the UE includes a 2G/3G/4G communication module and a 5G millimeter wave (mmWave) communication module. Each communication module includes one or more antennas, a Radio Frequency (RF) transceiver, transmit (TX) and Receive (RX) processing circuitry. The UE also includes a speaker, a processor, an input/output (I/O) Interface (IF), one or more sensors (touch sensors, proximity sensors, gyroscopes, etc.), a touch screen, a display, and memory. The memory includes firmware, an Operating System (OS), and one or more applications.

The RF transceiver receives an incoming RF signal from an antenna that is transmitted by an eNB/gNB of the network. The RF transceiver down-converts the input RF signal to generate an Intermediate Frequency (IF) or baseband signal. The IF or baseband signal is sent to an RX processing circuit that generates a processed baseband signal by filtering, decoding, and/or digitizing the baseband or IF signal. The RX processing circuitry sends the processed baseband signals to a processor for further processing (such as for voice or web browsing data).

The TX processing circuitry receives output baseband data (such as voice, network data, email, or interactive video game data) from the processor. The TX processing circuitry encodes, multiplexes, and/or digitizes the output baseband data to generate a processed baseband or IF signal. The RF transceiver receives the output processed baseband or IF signal from the TX processing circuitry and up-converts the baseband or IF signal to an RF signal that is transmitted through the antenna.

The processor may include one or more processors and execute basic OS programs stored in the memory to control the overall operation of the UE. In one such operation, the main processor controls the reception of forward channel signals and the transmission of reverse channel signals by the RF transceiver, RX processing circuitry, and TX processing circuitry in accordance with well-known principles. The main processor may also include processing circuitry configured to allocate one or more resources.

For example, the processor may include: an allocator processing circuit configured to allocate a unique carrier indicator; and detector processing circuitry configured to detect physical uplink shared channel (PDSCH) transmissions in one carrier received by a physical downlink shared channel (PDCCH) scheduling Physical Downlink Shared Channel (PDSCH). Downlink Control Information (DCI) is used for various purposes and is transmitted in a corresponding PDCCH through a DCI format. For example, the DCI format may correspond to a downlink allocation for PDSCH reception or an uplink grant for PUSCH transmission. In some embodiments, the processor includes at least one microprocessor or microcontroller.

The processor can also execute other processes and programs residing in memory, such as operations for a coordination scheme between enbs/gnbs to support carrier aggregation between enbs/gnbs. It should be appreciated that carrier aggregation between enbs/gnbs may also be referred to as dual connectivity. The processor may move data into or out of memory as needed to perform the process. In some embodiments, the processor is configured to execute a plurality of applications, such as an application for MU-MIMO communication, including obtaining control channel elements of the PDCCH.

The processor may operate the plurality of applications based on an OS program or in response to signals received from the eNB/gNB. The main processor is also coupled to an I/O interface that enables the UE to connect to other devices, such as laptop computers and handheld computers. The I/O interface is the communication path between these accessories and the host controller.

The processor is also coupled to the touch screen and the display. The operator of the UE may use the touch screen to input data into the UE. The display may be a liquid crystal display, a light emitting diode display, or other display capable of rendering text and/or at least limited graphics, such as from a website.

The memory is coupled to the processor. A portion of the memory may include Random Access Memory (RAM) and another portion of the memory may include flash memory or other Read Only Memory (ROM).

Although fig. 10 shows one example of a UE, various changes may be made to fig. 10. For example, the various components in FIG. 10 may be combined, further subdivided, or omitted, and additional components may be added according to particular needs. As a particular example, a processor may be divided into multiple processors, such as one or more Central Processing Units (CPUs) and one or more Graphics Processing Units (GPUs). Also, although fig. 10 shows a UE configured as a mobile phone or smart phone, the UE may be configured to operate as other types of mobile or stationary devices.

A 5G terminal or UE may be equipped with multiple antenna elements. Beamforming is an important factor when a UE attempts to establish a connection with a BS station. To compensate for the narrower analog beamwidth in millimeter waves, analog beam scanning may be employed to support a wider signal receiving or transmitting coverage area for the UE. The beam codebook includes a set of codewords, wherein a codeword is a set of analog phase shift values or amplitude plus phase shift values applied to antenna elements to form an analog beam. The present disclosure describes a beam codebook generation process and an algorithm that generates a beam codebook to meet a given set of requirements and performance criteria.

One of the goals of codebook design is to provide the UE with the best coverage area. With an upper limit of the spherical coverage area determined by the antenna element electric field radiation data. The upper limit provides a good reference for evaluating codebook designs. For example, the number of beams required for the combined pattern to approach the upper limit may be evaluated.

In one embodiment, the upper limit is calculated across the entire sphere. As an example, the entire sphere consists of 180×360 samples along the azimuth (360 samples) and elevation domains (180 samples). One for each sample. For each direction on the sphere, the gain is calculated by maximizing the beamforming weights. Two upper limits are considered. For a first upper bound, the beamforming weights are constrained by the total power; while for the second upper limit, the beamforming weights are constrained by the per-element power.

Let L antenna elements be provided. Let theAnd->Respectively for the theta component and +.>Complex-valued electric field (E-field) of the first antenna element of the assembly. Let w= [ w ] ₁ ，w ₂ ，...，w _L ] ^T Representing a complex applied to an antenna elementAnd (5) value weight. After applying the beamforming weights, by +.>Gives θ component and +.>The electric field of the assembly (E-field).

By passing throughGiving a gain corresponding to the beamforming weights, wherein +. >And->Representing conjugation (. Cndot.) ^T Represent transpose, and (·) ^H Representing a conjugate transpose or hermitian conjugate.

The upper limit B of the gain is derived by the best w such that G (w) is maximized:the upper limit of the total power constraint can be summarized as: />An auxiliary matrix M is defined:

thus B ¹ From M, B ¹ The maximum eigenvalue of =max { λ (M) }, where λ (·) represents the eigenvalue calculation, expressed asB of (2) ¹ Is the eigenvector corresponding to the largest eigenvalue of M, i.e. +.>

The upper power constraint limit for each antenna element can be summarized as: in one embodiment of initialization, a plurality of weights w are initialized ^o Wherein the superscript indicates the 0 th iteration step. In the examples, but not limited to this example, w ^o Is configured as +.>

In one example of step 1, for all l' ^s Sequentially updating the application to each antenna elementWeights onWherein->Is the weight on the first antenna element of the kth iteration, and f (x) is defined as follows: />

In one example of step 2, an iteration stop condition variable γ is calculated ^k ，

In one example of step 3, if γ ^k Less than a predefined threshold ε, the iteration stop condition is met and the best weightFrom the final w ^k And->Given.

Otherwise, if gamma ^k Greater than ε, go to step 1. If the stop condition is not satisfied after the predetermined maximum number of iterations, convergence is not achieved within the allowable maximum number of iterations and the algorithm is terminated. If there are multiple antenna modules, a single upper limit may still be obtained as described above. The overall upper limit may be defined based on the respective upper limit, e.g., maximized at the respective upper limit.

FIG. 11 illustrates an example upper limit 1100 for single and multiple arrays according to embodiments of the disclosure. The embodiment of the upper limit 1100 shown in fig. 11 is for illustration only. Fig. 11 is not intended to limit the scope of the present disclosure to any particular embodiment.

A comparison of the upper limits in EIRP CDFs for a single array and multiple arrays of example antenna modules is plotted in fig. 11. Table 1 shows that patch + dipole provides 35.59% and 33.47% gain for 50% and 20% patches (tile), respectively, as compared to patch only.

Table 1: upper limit 1 patch to patch + dipole comparison

Good beam codebook design depends on many factors, including: types and gains of antenna elements (e.g., isotropic, dipole, microstrip patches); array size and layout (e.g., linear, rectangular, circular); codebook requirements (e.g., codebook size); and/or regarding the set level of the housing and display.

In general, it is difficult to find an analysis scheme for generating a codebook. Thus, a heuristic scheme is provided that can be used for all possible element electric field data and array layouts. The whole process is shown in fig. 12.

Fig. 12 illustrates an example automatic codebook generation 1200 in accordance with an embodiment of the disclosure. The embodiment of automatic codebook generation 1200 shown in fig. 12 is for illustration only. Fig. 12 is not intended to limit the scope of the present disclosure to any particular embodiment.

As shown in fig. 12, in step 1202, at least one of the number of modules, bands or phase shifter bits to set the level EM data is sent to the automatic codebook generation algorithm in step 1208. In step 1202, codebook design requirements, including at least one of codebook size or sphere coverage requirements, are sent to the automatic codebook generation algorithm in step 1208. Similarly, in step 1206, other a priori knowledge including at least one of UE orientation or historical knowledge is sent to the automatic codebook generation algorithm in step 1208. In step 1208, the auto-generation algorithm output outputs a codebook that meets the requirements and provides performance results in step 1210.

Fig. 13 shows a flowchart of a heuristic 1300 according to an embodiment of the present disclosure. The embodiment of heuristic 1300 shown in FIG. 13 is for illustration only. Fig. 13 is not intended to limit the scope of the present disclosure to any particular embodiment.

The main steps of the heuristic are as follows and as shown in fig. 13. In one example of step 0, the electric field data for the module level antenna design is imported from measurements or simulations. In one example of step 1, candidate beam codewords are generated according to the configured codebook type. In such an example, the applicable codebook type depends on the beam codebook generation algorithm. In one example of step 2, a beam is selected from the candidate set according to some performance criteria. In such an example, the performance criteria depend on the detailed beam codebook generation algorithm design. In one example of step 3, if a certain stop condition is met, stopping; otherwise, repeating step 2, the stop condition depends on user input of codebook design requirements (codebook size or sphere coverage requirements).

As shown in fig. 13, in step 1302, electric field data for each antenna is imported. In step 1304, a set of candidate beams is generated based on the electric field data. In step 1306, the current codebook is set to an empty set. In step 1308, a beam (or a batch of beams) is selected from the candidate set and the beam(s) is (are) added to the current codebook. In step 1310, it is determined whether the current codebook satisfies a stop condition. If the current codebook satisfies the condition, the current codebook is exported as the final codebook in step 1312. In step 1310, the current code does not satisfy the stop condition, and step 1308 is performed.

The candidate codeword set is designed to be large enough to cover the entire sphere (or some desired coverage area) to avoid coverage holes. The options for the candidate set considered are as follows but are not limited thereto. In one example of option 1, the eigen-based candidate set has a total power constraint or per antenna element power constraint. In this option, the candidate set is taken from eigenvectors that maximize the radiation gain. In one example of option 2, the m×n DFT candidate set (M, N) is determined by the number of phase shifters, the antenna size. In one example of option 3, the beams are uniformly distributed over the sphere, i.e., beams pointing in a set of uniformly distributed directions over the sphere. In one example of option 4, the beam with random phase at the ith element is defined asOr (2pi)/2 ^b *U{0，2 ^b -1 }); if the limited resolution of the phase shifter is limited to b bits.

The codebook design scheme is suitable for hardware implementation. To implement the designed codebook, the hardware requirements considered are listed as follows, but are not limited to: a module level or a set level; for a set level, the number of antenna modules, their position and orientation in the device; the number of bits of the phase shifter (e.g., 3, 4, 5); supported frequency bands, such as 28GHz, 39GHz, or both; supported bandwidth (low/wide/high); MIMO capability: diversity/multiplexing; gain control capability; and residual errors in RF calibration and housing/assembly dimensional deviations.

Possible beam codebook requirements are listed below: codebook size, e.g., 16 beams; spherical coverage CDF requires a spatial coverage area, such as-Y dB of maximum EIRP at X% collage CDF, in azimuth and elevation ranges, which may be configured from 0 ° to 360 °, and elevation ranges from 0 ° to 180 °. Default is the entire sphere; sidelobe levels; and beamwidth, such as 3-dB beamwidth or Half Power Beamwidth (HPBW).

Fig. 14 illustrates an example coordinate system 1400 in accordance with an embodiment of the present disclosure. The embodiment of the coordinate system 1400 shown in fig. 14 is for illustration only. Fig. 14 does not limit the scope of the present disclosure to any particular embodiment.

Optimization criteria need to be defined in order to determine codeword (beam) selection criteria and/or algorithm stopping conditions. The same or different metrics may be used for the performance optimization criteria and the stop condition criteria.

Performance optimization criteria define metrics or objective functions that the algorithm attempts to maximize/minimize. For the EIRP maximization greedy algorithm, it is maximizing the EIRP value at the X% collage CDF sampled over a given spatial coverage area (by default the entire sphere). This is described as a drop of Y dB from the peak EIRP at the X% collage CDF (both X and Y are configured in the codebook design). Other possible objective functions may be to maximize the average EIRP, i.e. the average EIRP within a given spatial coverage area.

For a uniform beam coverage algorithm, it minimizes the number of beams required to cover the target spatial region, thereby ensuring beam pattern overlap at adjacent beam positions at a certain gain level (e.g., 3dB below maximum gain).

The stop condition criteria define a metric for terminating the algorithm. Metrics are taken from codebook design requirements. Codebook size is one embodiment of the standard. The EIRP value at the X% tile CDF is another embodiment of the criteria, i.e., the algorithm stops after the EIRP value at the X% tile CDF is reached. Yet another criterion is the spatial coverage area, which is suitable for a uniform beam coverage algorithm, i.e. the algorithm stops after the desired spatial area has been covered by the beam.

As described in the previous section, the performance of the generated codebook is compared with an upper limit, in particular the following: spherical coverage area or EIRP CDF; a two-dimensional heat map of the radiation pattern of the generated codebook, and differences compared to the heat map of the optimal spherical coverage area; sidelobe levels of the generated beam; and beamwidth, e.g., 3dB beamwidth or Half Power Beamwidth (HPBW) of the generated beam.

On the spherical coverage area or EIRP CDF, the following metrics are included as criteria for codebook design: EIRP peak; peak drop 50%: the difference between the 50 th percentile EIRP and the peak EIRP; the difference from the upper limit of the 50 th percentile: the difference between the EIRP of the codebook and the upper limit of the 50 th percentile; gap from the upper limit of the 100 th percentile: the difference between the EIRP of the codebook and the upper limit of the 100 th percentile.

The above metrics are shown in fig. 15. Fig. 15 illustrates an example EIRP CDF and some key metrics 1500 in accordance with an embodiment of the present disclosure. The embodiment of the EIRP CDF and some key metrics 1500 shown in fig. 15 is for illustration only. Fig. 15 does not limit the scope of the present disclosure to any particular embodiment.

As shown in fig. 15, the EIRP CDF includes an upper limit 1 and an upper limit 2. FIG. 15 shows the EIRP peaks at (1); peak drop at (2) by 50%; (3) The upper limit distribution at (4) was 50%, and the upper limit distribution at (4) was 100%.

Fig. 16 illustrates an example two-dimensional heat map 1600 of spherical coverage areas of a codebook according to an embodiment of the disclosure. The embodiment of the two-dimensional heat map 1600 shown in FIG. 16 is for illustration only. Fig. 16 does not limit the scope of the present disclosure to any particular embodiment. Fig. 15 gives an example two-dimensional heat map of the codebook radiation pattern.

Fig. 17 illustrates an example difference between upper bound radiation and codebook radiation 1700 in accordance with an embodiment of the disclosure. The embodiment of the difference between the upper bound radiation and the codebook radiation 1700 shown in fig. 17 is for illustration only. Fig. 17 is not intended to limit the scope of the present disclosure to any particular embodiment.

The difference between the upper bound radiation and the codebook radiation may also be generated as a two-dimensional heat map, as shown in fig. 17.

In this algorithm, the selection maximizes the metric related to EIRP in a greedy manner (e.g., average EIRP value or X% collage of EIRP CDF).

If the selection criteria is an X% collage EIRP value, the greedy algorithm first selects a beam from the candidate set whose CDF has the largest X% collage EIRP value. Then, in each step, a beam is selected that maximizes the X tile EIRP value of the composite beam. If a requirement for a spatial coverage area is specified, a CDF for beam selection is constructed based on samples within the specified spatial coverage area.

Fig. 18 illustrates an example EIRP CDF 1800 of a combined pattern in accordance with an embodiment of the disclosure. The embodiment of the EIRP CDF 1800 shown in fig. 18 is for illustration only. Fig. 18 is not intended to limit the scope of the present disclosure to any particular embodiment.

An example result of the greedy algorithm is shown in FIG. 18. The black dashed line represents the improvement in EIRP CDF as each beam is added to the codebook. The blue curve is the EIRP CDF of the final codebook.

The greedy algorithm supports performance criteria. In one example of option 1, the EIRP peak at the X% collage CDF is reduced by Y dB over the specified spatial coverage area (azimuth and elevation ranges).

In one example of option 2, a weighted average of percentiles is configured over a specified spatial coverage area (azimuth and elevation ranges). Mathematically, this means a weighted sum w ₁ f(20)+w ₂ f(50)+w ₃ f (80) is maximized, where f (x) is the x% collage gain, and w _i Is a weight. Since these three points are equally important in our hypothesis, w is chosen ₁ ＝w ₂ ＝w ₃ =1. Option 1 is a special case where all but one percentile is set to zero weight.

In one example of option 3, the average EIRP in the linear domain (i.e., for each iteration, the beam that provides the greatest gain in the average EIPR in the linear domain is selected).

The stop conditions supported by the greedy algorithm include: codebook size; and meets the performance criteria according to options 1, 2 or 3 above.

A scheme for constructing a candidate set of beams or codewords for selection by a greedy algorithm is described later.

The idea of this algorithm is similar to the Lloyd Max algorithm for quantization. Given a K beamInitial set w ₁ ，w ₂ ，...，w _k And a set d= { D of directions of interest ₁ ,d ₂ ,d ₃ ,…,d _N The algorithm is performed by alternating between two steps.

Fig. 19 illustrates an example of dividing a set of directions 1900 into subsets according to an embodiment of the disclosure. The embodiment of the set of partition directions 1900 shown in fig. 19 is for illustration only. Fig. 19 is not intended to limit the scope of the present disclosure to any particular embodiment.

In one embodiment of the assigning step, each direction is assigned to the beam with the greatest gain. Mathematically, this means dividing the direction set D into K subsets, denoted S _1, S ₂ ,…S _K . Each subset is served by a beam. For example, fig. 19 shows one possible implementation. Each circle represents a direction. Circles with the same color belong to the same subset.

Fig. 20 shows an example definition of a 2000 of determining beam width according to an embodiment of the present disclosure. The defined embodiment of a 2000 shown in fig. 20 is for illustration only. Fig. 20 is not intended to limit the scope of the present disclosure to any particular embodiment.

In one embodiment of the updating step, the new beam is optimized to serve all directions in each subset. This is accomplished by solving the following problems. It is similar to the calculation of the second upper limit, the only difference being that for each subset S only _k By combining a subset S _k All points in (1)Matrix summation solves the problem. The objective is to maximize the average gain (linear scale rather than dB).

When all S _k Is converged or distributed to S _k When the beam of (a) is no longer changing, the algorithm terminates. For codebook { w ₁ ，w ₂ ，...，w _k Initialization of } possible options include: the initial codebook is generated by a greedy algorithm. In other words, the two algorithms are in series. The greedy algorithm is operated firstly, and then the output of the greedy algorithm is used as an initial point of the Lloyd-Max algorithm; and generating an initial codebook by selecting k codewords from the candidate codeword pool. The candidate codeword pool may be an eigenvoice-based codebook, an iterative eigenvoice-based codebook, a DFT codebook, a unified trellis codebook, a random phase codebook, or the like. The selection may be performed randomly or may follow a certain metric.

Note that here the diagonal angleRepresenting the direction (or point on a unit sphere) rather than the polarization direction. The algorithm assumes that all beams have the same beam shape, regardless of their direction. The main lobe direction of the beam is determined to cover the desired non-aperture area.

The input parameters of the algorithm include: alpha determines the minimum antenna gain level allowed; θ _sec Determining the elevation angle limiting the sphere sector and must be at [0:90 °and]Within a range of (2).

A method of configuring the value of a in a codebook design may be included. In one example of scheme 1, α is configured directly. In one example of scheme 2, α is calculated from an x dB beamwidth configuration. The value of "x" may be directly configured. Then, a beam width is calculated, within which the radiation power is not more than x dB below the maximum value. Then, the calculated beam width is taken as α. The following four steps are followed for alpha computation based on x dB beamwidth.

In this example: (step 1) find the maximum P over which the radiated power reaches _M Is of the direction of (2)(step 2) in plane->Is found to have a radiation power lower than P between them _M Not exceeding the two boundaries of x dB. Boundary ofThe angle between them is defined by alpha ₁ A representation; (step 3) calculating and plane- >Orthogonal plane (1), plane (2) containing origin, plane (2) containing point +.>Is a plane (3). On the calculated plane, find the radiation power between them below P _M Not exceeding the two boundaries of x dB. The angle between the boundaries is defined by alpha ₂ A representation; and step 4. Alpha ₁ And alpha ₂ Is used as a, a = min (a ₁ ，α ₂ )。

FIG. 21 illustrates θ for determining coverage areas according to an embodiment of the present disclosure _sec 2100 is defined as an example. θ shown in FIG. 21 _sec 2100 is for illustration only. Fig. 21 does not limit the scope of the present disclosure to any particular embodiment.

One option for generating the beam forming directions is to have them evenly distributed over the sphere. There are several different schemes to do this. Each point corresponds to a direction that points from the origin to a point on the sphere. Fig. 22 is an example of 363 points on a fibonacci grid.

Fig. 22 shows an example fibonacci grid 2200 with 363 points across the sphere in accordance with an embodiment of the disclosure. The embodiment of the fibonacci grid 2200 with 363 points shown in fig. 22 is for illustration only. Fig. 22 is not intended to limit the scope of the present disclosure to any particular embodiment.

The minimum number of beams required to cover the target spatial region is such that beam patterns at adjacent beam positions at a certain gain level (e.g., 3dB below maximum gain) are ensured to overlap.

Stopping conditions supported by greedy algorithm: codebook size; and to reach a target spatial region (defined as azimuth and elevation ranges). The algorithm is considered as a reference algorithm. The strong assumption required by this algorithm (i.e., setting forth that the beam width is independent of direction) is generally not applicable to antenna arrays.

For an eigen-based codebook, candidate codewords are sampled over a target spatial coverage area (e.g., entire sphere, hemisphere)Eigenvectors corresponding to the largest eigenvalues of (a) are provided. With a sufficiently large candidate pool and a sufficiently large codebook size, the performance of the eigen-based codebook approaches the upper limit of the total power constraint.

In this codebook design, the beamforming weights may be fixed to 1 (or constant), with only the phases of the eigenvectors used to construct the codebook.

For an eigenvector-based iterative codebook, candidate codewords are sampled over a target spatial coverage area (e.g., whole sphere, hemisphere)Eigenvectors corresponding to the largest eigenvalues of (a) are provided. The magnitude of each element of the eigenvector is limited to be the same. With a sufficiently large candidate pool and a sufficiently large codebook size, the performance of the eigen-based iterative codebook approaches the upper limit of the power constraint for each antenna element.

For the DFT codebook, the candidate codeword pool is taken from the DFT matrix. Candidate codewords from the mxn DFT matrix of the kxl antenna array are formed byGiven, where k=0, …, K-1, l=0, …, L-1, n=0, …, N-1 and m=0, …, M-1.M and N are equal to 2 ^b Where b is the total number of phase shifter bits. The candidate codeword pool size is 2 ^b Where b is the number of phase shifter bits.

For a unified trellis codebook, the candidate codeword pool is obtained from beams that are uniformly distributed over the sphere (see fig. 22, which illustrates a scheme for generating a candidate set by a fibonacci trellis).

For random phase codebooks, according to b-bit phase shiftersOr (2pi)/2 ^b *U{0，2 ^b -1 }) using the i-th element +.>A pool of candidate codewords is generated. The codebook generated by this scheme is not unique due to randomness. Note that this codebook is used as a reference and not as an implementation option.

There is a need to develop Tx and/or Rx RF beam codebook systems in millimeter wave (mmWave) wireless communication systems. The Tx/Rx RF beam codebook is a set of complex-valued weights applied to the individual antenna elements on the RF module. The complex-valued weights determine the amplitude and phase of the beamforming matrix applied to the antenna array. In some designs, the amplitude is fixed, only the phase of the beamforming matrix may be changed.

The beam codebook may be applied to the RF antenna arrays of the base station and the user equipment, and typically the codebooks of the base station and the user equipment will be different. For the remainder of this disclosure, an RF beam codebook system design at a user device may be focused. However, it should be understood that the schemes described below can be extended to RF beam codebook system designs at the base station.

Millimeter wave (mmWave) Tx/Rx RF beam codebook design may be optimized in view of the following factors: device design (e.g., material, form factor, antenna module design, etc.); user manipulation of the device (handle, orientation, body/object blockage, etc.); and network deployment environments (indoor offices, dense urban areas, urban macro-cells, rural areas, etc.).

Fig. 23 illustrates an example impact of LCD 2300 on UE EIRP mode, according to embodiments of the disclosure. The embodiment of the effect of the LCD 2300 shown in fig. 23 is for illustration only. Fig. 23 is not intended to limit the scope of the present disclosure to any particular embodiment.

Fig. 23 shows an example of the effect of having full LCD display coverage on the Rx/Tx EIRP pattern of a UE on one side of the UE. If the UE is equipped with multiple antenna modules, e.g., multiple antenna modules located at four corners (or subsets) of a rectangular UE, the set of antenna modules that may be turned on to receive or transmit signals may be highly dependent on how the user operates the device. Some examples are shown in fig. 24.

Fig. 24 illustrates an example antenna module activation 2400 based on device operation in accordance with an embodiment of the disclosure. The embodiment of the antenna module activation 2400 shown in fig. 24 is for illustration only. Fig. 24 does not limit the scope of the present disclosure to any particular embodiment.

There are various ways to design the Tx/Rx beam codebook. One approach is a heuristic approach in which radio measurement data is collected from a real deployment scenario or laboratory setting that sufficiently mimics a real environment. The measurement data is then post-processed to search for an optimal Tx/Rx beam codebook according to a predetermined objective function, for example by gradient descent or machine learning techniques.

Measurement data collection may be performed manually for different environments experienced by the device (such as orientation and movement) or automatically using robotic settings. An example of this process is depicted in fig. 25, where it is assumed that measurements of various locations of the device are performed using robotic settings.

Fig. 25 illustrates an example beam codebook design method 2500 in accordance with an embodiment of the present disclosure. The embodiment of the beam codebook design method 2500 shown in fig. 25 is for illustration only. Fig. 25 is not intended to limit the scope of the present disclosure to any particular embodiment.

Referring to fig. 25, the robotic setup is a mechanical test fixture that is capable of orienting the test equipment through 3D space and making measurements in amplitude/phase for H and V polarizations. For a given position in 3D space, raw measurements for each antenna chain are obtained. Measurements are obtained for all locations that the final beam codebook design may cover. Based on the measurement data collected for all locations, a beam codebook search based on predefined performance criteria may be performed. Finally, the design of the beam codebook may be tested in the field to evaluate the validity of the beam codebook.

Another example of a beam codebook design method is a maximum power exhaustive search beamforming algorithm. The algorithm uses a spherical sector coverage scheme that uses a desired spatial sector and antenna beam width as input parameters, identifies the angular position of the antenna steering direction to fully cover a given spherical sector, while minimizing the number of overlaps between adjacent antenna beams and desired antenna positions. After identifying the set of antenna steering directions, the beamforming algorithm iterates over all combinations of transmit antenna steering directions and receive antenna steering directions of the set and finds the combination of transmit antenna position and receive antenna position that provides the greatest received power.

Since the optimal Tx/Rx beam codebook is highly dependent on the scenario in which it is designed, a system that enables the beam codebook to adapt to varying scenarios will perform better than just a single size for all beam codebooks. The present disclosure provides a scheme for adapting a beam codebook for a user equipment over time.

The system includes one or more of the following modules.

In one example, a set of beam Codebooks (CBs) is included that includes a plurality of beam codebooks stored in an internal memory of the device. In one example, a module performs scene (or context) detection or determination inferred from external inputs, such as sensors and baseband measurements of a device. A scene or context may be defined to include one or more of the following: device orientation, user handle, body blockage, network deployment scenario, UE speed. Example device orientations include a portrait orientation and a landscape orientation. The baseband measurements may be based on signals transmitted by the base station, including SS blocks, CSI-RS, tracking Reference Signals (TRSs).

In one example, a module performs codebook selection based at least on an output of a scene detection module. The codebook selected for each RF antenna module on the device may be different. The output of the module is a beamforming codebook selected for each RF antenna module. In special cases, the selected codebook is applied to all RF antenna modules.

Fig. 26 illustrates an example multi-beam codebook management system 2600 according to an embodiment of the disclosure. The embodiment of the multi-beam codebook management system 2600 shown in fig. 26 is for illustration only. Fig. 26 is not intended to limit the scope of the present disclosure to any particular embodiment.

Fig. 27 illustrates an example beam codebook adaptation 2700 over time according to an embodiment of the present disclosure. The embodiment of the beam codebook adaptation 2700 shown in fig. 27 is for illustration only. Fig. 27 does not limit the scope of the present disclosure to any particular embodiment.

A multi-beam codebook system is shown in fig. 26. An example of the adaptation of the beam codebook over time is shown in fig. 27.

In one embodiment, if it is determined that the UE beam codebook selection function is unable to meet requirements such as performance requirements (e.g., RSRP, SINR, etc.), the UE may trigger an alternative connection technique, such as a 2G, 3G, 4G, or Wi-Fi wireless technique. This provides a fallback connection for the UE. Other schemes of triggering a fallback connection are also possible, such as the scene detection function determining that a detected scene requires a fallback connection.

In one embodiment, the improved beam codebook may be learned based on real user data via an online beam codebook learning framework. UE measurement data or UE beam data analysis may be collected from active user equipment (in the background) and uploaded (e.g., via tunneling) to a cloud control center or UE beam codebook learning unit, where a new and improved beam codebook may be learned, redesigned, or trimmed. The new UE beam codebook is then pushed back to the user equipment to improve the beamforming performance.

Fig. 28 illustrates example UE beam codebook learning 2800 based on data analysis in accordance with an embodiment of the disclosure. The embodiment of UE beam codebook learning 2800 shown in fig. 28 is for illustration only. Fig. 28 is not intended to limit the scope of the present disclosure to any particular embodiment.

The frame is shown in fig. 28. The UE beam learning unit may also be located at the edge (radio network base station). In one option, the original UE beam data (i.e., the beam identity selected at a given time) is sent to a UE beam codebook learning unit for further processing. In another option, the UE beam data is first processed at the terminal to extract certain features or statistics and then sent to the UE beam codebook learning unit for further processing, typically at a data size significantly smaller than the original data size.

An example of processing data at a terminal is statistics of UE beam usage, i.e. the percentage of time that a UE beam is used for a wireless connection. The UE beams may be indexed to indicate the identity of the beams. In one example, UE beam indexing is performed on all beams of a UE. In another example, the UE beam index is performed for each antenna module, in which case the antenna module index may be required to uniquely identify the beam. The beam identities and corresponding beam usage may be sent to a UE beam codebook learning unit. Other examples are the occurrence of beam search delays and beam misalignment events. One or more of these beam data may be collected and sent to the UE beam codebook learning unit.

Fig. 29 illustrates an example UE beam data analysis module 2900 on a terminal according to an embodiment of this disclosure. The embodiment of the UE beam data analysis module 2900 shown in fig. 29 is for illustration only. Fig. 29 is not intended to limit the scope of the present disclosure to any particular embodiment.

Fig. 30 illustrates another example UE beam data analysis module 3000 on a terminal according to an embodiment of this disclosure. The embodiment of the UE beam data analysis module 3000 shown in fig. 30 is for illustration only. Fig. 30 is not intended to limit the scope of the present disclosure to any particular embodiment.

Additional context information may be included in order to understand the context of the data transmitted by the UE. Examples of context information include UE location information (e.g., obtained from a GPS module), sensor data on the terminal (e.g., gyroscopes, accelerometers, inertial Measurement Units (IMUs)), device models, and software versions.

Some examples of UE beam data analysis modules are shown in fig. 29 and 30. In fig. 30, the scene detection module may be the same as that in fig. 26.

Based on the UE data analysis, the UE beam learning unit may generate a revised beam codebook or revised set of codebooks for the UE. The codebook may be revised in a dedicated manner for each individual UE. The codebook may also be generic (or have a strong correlation) for a set of UEs that fit the same context profile, e.g., the codebook is generic (or has a strong correlation) for all UEs of the same hardware model, or the codebook is generic (or has a strong correlation) for all UEs of the same geographic region.

Upon receiving the revised beam codebook from the UE beam learning unit at the terminal, the UE beam data analysis module may compare the true performance of the new beam codebook with the true performance of the original beam codebook. One or more performance metrics may be compared, such as beam usage, beam search delay, and occurrence of beam failure events. If the performance is worse than the original beam codebook in one or more metrics, the module may revert to the original codebook and provide new performance information to the UE beam learning unit. The functions may also be performed by a different module than the UE beam data analysis module.

Fig. 31 illustrates an example UE beam data analysis circuit 3100 with other beam management blocks on a terminal according to an embodiment of this disclosure. The embodiment of the UE beam data analysis module 3100 shown in fig. 31 is for illustration only. Fig. 31 is not intended to limit the scope of the present disclosure to any particular embodiment.

As shown in fig. 31, the UE beam data analysis circuit 3100 includes a CB aggregation block 3102, a scene detection block 3104, a CB selection block 3106, and a UE beam data analysis block 3108. The CB aggregation block 3102 is connected to the CB selection block 3106 and receives the new codebook from the UE beam analysis block 3108. The scene detection block 3104 is connected to a CB selection block 3106. The CB selection block 3106 generates a selected CB, which is sent to the UE beam data analysis module 3108. The UE beam data analysis block 3108 receives other context information, other beam related information from the modem and/or RF circuitry, and the new codebook. The UE beam data analysis block 3108 generates a data analysis to the UE beam learning circuitry.

Fig. 32 illustrates an example process of using the UE beam data analysis module 3200 according to an embodiment of the disclosure. The embodiment of the process using the UE beam data analysis module 3200 shown in fig. 32 is for illustration only. Fig. 32 is not intended to limit the scope of the present disclosure to any particular embodiment.

As shown in fig. 32, in one embodiment, the ue beam data analysis module receives information from the beam codebook selection module sensor at step 3202. In step 3204, based on the received information, the UE beam data analysis module generates and transmits UE data analysis information to the UE beam learning unit.

As shown in fig. 32, in another embodiment, the UE beam data analysis module receives information from the UE beam learning unit at step 3206. In step 3208, based on the received information, the UE beam data analysis module transmits codebook information to a terminal codebook database.

Fig. 31 shows a diagram of a UE beam data analysis module and other functional modules for a multi-codebook beam management system. An example process performed by the UE beam data analysis module is given in fig. 32.

Fig. 33 illustrates an example UE beam data analysis circuit 3300 according to an embodiment of this disclosure. The embodiment of the UE beam data analysis module 3300 shown in fig. 33 is for illustration only. Fig. 33 does not limit the scope of the present disclosure to any particular embodiment.

As shown in fig. 33, the UE beam data analysis circuit 3300 includes a CB set block 3302, a scene detection block 3304, a CB selection block 3306, and a UE beam data analysis block 3308. The CB aggregation block 3302 is connected to the CB selection block 3306 and receives the new codebook from the UE beam analysis block 3308. The scene detection block 3304 is connected to a CB selection block 3306. The CB selection block 3306 generates a selected CB, which is transmitted to the UE beam data analysis module 3308. The UE beam data analysis block 3308 receives other context information and other beam related information from the modem and/or RF circuitry.

Fig. 34 shows a flowchart of a method 3400 for a UE beam data analysis module according to an embodiment of the present disclosure. The embodiment of the method 3400 shown in FIG. 34 is for illustration only. Fig. 34 is not intended to limit the scope of the present disclosure to any particular embodiment.

In another embodiment, the beam learning unit is further located in a UE beam data analysis module on the terminal. Fig. 33 gives a diagram. In addition to generating a new codebook also within the UE beam data analysis module, the aspects mentioned for the previous embodiments apply also to this case. Fig. 34 gives an example procedure.

To enable the user to select beam learning and updating, user consent options may be provided on the user interface of the mobile terminal. The option of user consent may be provided in the "connect" setting of the terminal for "5G millimeter wave beam learning and updating". Other locations are not excluded. If the "5G millimeter wave beam learning and updating" option is opened, the user's beam data analysis is collected and the beam codebook updating is performed, otherwise the user's beam data analysis is not collected and the beam codebook updating is not performed.

Although the present disclosure has been described with exemplary embodiments, various changes and modifications may be suggested to one skilled in the art. The present disclosure is intended to embrace such alterations and modifications that fall within the scope of the appended claims.

Any description in this application should not be construed as implying that any particular element, step, or function is a essential element that must be included in the claims scope. The scope of patented subject matter is defined only by the claims. Furthermore, all claims are not intended to refer to 35 u.s.c. ≡112 (f), unless the exact word "means for …" is followed by a word segmentation.

Claims

1. A user equipment, UE, (116) in a wireless communication system, the UE comprising:

an antenna (305); and

a processor (340) operatively connected to the antenna, the processor configured to:

identifying electric field data of each of the antennas of the UE to be used for transmitting and receiving data;

generating a set of codewords corresponding to candidate beams for each of the antennas based on the electric field data;

setting the codebook to be empty;

selecting at least one codeword from the set of codewords based on a performance criterion;

generating a codebook to be used for each of the antennas by adding the at least one codeword to the codebook;

Determining whether the codebook including the at least one codeword satisfies a stop condition for stopping adding another codeword to the codebook;

determining the codebook as a final codebook if the stop condition is satisfied; and

the final codebook is applied to transmit or receive data on each of the antennas,

wherein the performance criteria maximizes the effective isotropic radiated power EIRP value at the configured percentile cumulative distribution function CDF sampled over the spatial coverage area, maximizes the average EIRP value over the spatial coverage area, or minimizes the number of beams required to cover the spatial coverage area.

2. The UE of claim 1, wherein the codebook is compared to an upper bound,

wherein the upper limit is determined by a total power constraint of the antennas or a per-element power constraint of each of the antennas,

wherein the set of codewords comprises at least one of a discrete fourier transform, DFT, codebook based on iterative eigenvectors, codebook based on eigenvectors, or unified trellis codebook.

3. The UE according to claim 1,

wherein the stop condition includes at least one of codebook size, EIRP value at configured percentile CDF, or sphere coverage requirement, and

Wherein, in case the stop condition is not met, the processor is further configured to repeatedly select at least one codeword from the set of codewords and add the at least one codeword to the codebook based on the performance criteria.

4. The UE of claim 1, wherein the processor is configured to:

receiving information including at least one of UE beam data, UE location information, sensor data, a device hardware model of the UE, or a device software model of the UE; and

UE beam data analysis information is generated based on the information.

5. The UE of claim 4, wherein the processor is configured to generate a set of beam codebooks including at least one of a new beam codebook or an updated codebook based on the UE beam data analysis information, and

wherein the set of beam codebooks is used in at least one of a per UE dedicated manner or a generic manner for a group of UEs based on at least one of a hardware model of the group of UEs or geographic information of the group of UEs.

6. A method performed by a user equipment, UE, (116) in a wireless communication system, the method comprising:

identifying electric field data of each antenna of the UE to be used for transmitting and receiving data;

setting the codebook to be empty;

generating a codebook to be used for each antenna by adding the at least one codeword to the codebook;

the final codebook is applied to transmit or receive the data on each antenna,

wherein the performance criterion is maximizing the effective isotropic radiated power, EIRP, value at a configured percentile cumulative distribution function, CDF, sampled over a spatial coverage area, maximizing the average EIRP value over the spatial coverage area, or minimizing the number of beams required to cover the spatial coverage area.

7. The method of claim 6, wherein the codebook is compared to an upper bound,

wherein the upper limit is determined by a total power constraint of the antennas or a per-element power constraint of each antenna,

8. The method according to claim 6, wherein the method comprises,

wherein, in case the stop condition is not met, selecting at least one codeword from the set of codewords and adding the at least one codeword to the codebook based on the performance criteria are repeated.

9. The method of claim 6, the method further comprising:

UE beam data analysis information is generated based on the information.

10. The method of claim 9, the method further comprising: generating a set of beam codebooks including at least one of a new beam codebook or an updated codebook based on the UE beam data analysis information, and

11. A non-transitory computer-readable medium comprising instructions that, when executed by at least one processor (340) of a user equipment, UE (116), cause the UE to:

identifying electric field data for each antenna (305) of the UE to be used for transmitting and receiving data;

setting the codebook to be empty;

determining whether the codebook including the at least one codeword satisfies a stop condition for stopping adding another codeword to the codebook,

determining the codebook as a final codebook if the stop condition is satisfied, an

The final codebook is applied to transmit or receive the data on each antenna,

12. The non-transitory computer readable medium of claim 11,

wherein the codebook is compared with an upper limit,

wherein the upper limit is determined by a total power constraint of the antennas or a per-element power constraint of each antenna, and

13. The non-transitory computer readable medium of claim 11,

wherein in case of a uniform beam coverage algorithm, the stop condition comprises a spherical coverage requirement and is fulfilled after the spatial coverage area has been covered by a beam.

14. The non-transitory computer readable medium of claim 11,

wherein, in case the stop condition is not met, the at least one processor is configured to repeatedly select at least one codeword from the set of codewords based on the performance criteria and add the at least one codeword to the codebook.

15. The non-transitory computer-readable medium of claim 11, further comprising instructions that, when executed by the at least one processor, cause the UE to:

receiving information including at least one of UE beam data, UE location information, sensor data, a device hardware model of the UE, or a device software model of the UE;

generating UE beam data analysis information based on the information; and

generating a set of beam codebooks comprising at least one of a new beam codebook or an updated codebook based on the UE beam data analysis information,