WO2019226028A1 - Methods of beam codebook generation for 5g terminals - Google Patents

Methods of beam codebook generation for 5g terminals Download PDF

Info

Publication number
WO2019226028A1
WO2019226028A1 PCT/KR2019/006321 KR2019006321W WO2019226028A1 WO 2019226028 A1 WO2019226028 A1 WO 2019226028A1 KR 2019006321 W KR2019006321 W KR 2019006321W WO 2019226028 A1 WO2019226028 A1 WO 2019226028A1
Authority
WO
WIPO (PCT)
Prior art keywords
codebook
data
antenna
codeword
codewords
Prior art date
Application number
PCT/KR2019/006321
Other languages
English (en)
French (fr)
Inventor
Jianhua MO
Pengda Huang
Jianzhong Zhang
Sanghyun CHANG
Boon Loong Ng
Original Assignee
Samsung Electronics Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US16/224,531 external-priority patent/US10735066B2/en
Application filed by Samsung Electronics Co., Ltd. filed Critical Samsung Electronics Co., Ltd.
Priority to EP19807907.1A priority Critical patent/EP3785377A4/en
Priority to CN201980029827.6A priority patent/CN112075033B/zh
Publication of WO2019226028A1 publication Critical patent/WO2019226028A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413—MIMO systems
    • H04B7/0456—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting
    • H04B7/046—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting taking physical layer constraints into account
    • H04B7/0465—Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting taking physical layer constraints into account taking power constraints at power amplifier or emission constraints, e.g. constant modulus, into account
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0404—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas the mobile station comprising multiple antennas, e.g. to provide uplink diversity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0686—Hybrid systems, i.e. switching and simultaneous transmission
    • H04B7/0695—Hybrid systems, i.e. switching and simultaneous transmission using beam selection

Definitions

  • the present application relates generally to beam management. More specifically, this disclosure relates to beam codebook generation for an advanced communication system.
  • the 5G or pre-5G communication system is also called a 'Beyond 4G Network' or a 'Post LTE System'.
  • the 5G communication system is considered to be implemented in higher frequency (mmWave) bands, e.g., 60GHz bands, so as to accomplish higher data rates.
  • mmWave e.g., 60GHz bands
  • MIMO massive multiple-input multiple-output
  • FD-MIMO Full Dimensional MIMO
  • array antenna an analog beam forming, large scale antenna techniques are discussed in 5G communication systems.
  • RANs Cloud Radio Access Networks
  • D2D device-to-device
  • CoMP Coordinated Multi-Points
  • FQAM Hybrid FSK and QAM Modulation
  • SWSC sliding window superposition coding
  • ACM advanced coding modulation
  • FBMC filter bank multi carrier
  • NOMA non-orthogonal multiple access
  • SCMA sparse code multiple access
  • the Internet which is a human centered connectivity network where humans generate and consume information
  • IoT Internet of Things
  • IoE Internet of Everything
  • sensing technology “wired/wireless communication and network infrastructure”, “service interface technology”, and “Security technology”
  • M2M Machine-to-Machine
  • MTC Machine Type Communication
  • IoT Internet technology services
  • IoT may be applied to a variety of fields including smart home, smart building, smart city, smart car or connected cars, smart grid, health care, smart appliances and advanced medical services through convergence and combination between existing Information Technology (IT) and various industrial applications.
  • IT Information Technology
  • 5G communication systems to IoT networks.
  • technologies such as a sensor network, Machine Type Communication (MTC), and Machine-to-Machine (M2M) communication may be implemented by beamforming, MIMO, and array antennas.
  • MTC Machine Type Communication
  • M2M Machine-to-Machine
  • Application of a cloud Radio Access Network (RAN) as the above-described Big Data processing technology may also be considered to be as an example of convergence between the 5G technology and the IoT technology.
  • RAN Radio Access Network
  • a network access and a radio resource management are enabled by physical layer synchronization signals and higher (MAC) layer procedures.
  • RRM radio resource management
  • a user equipment (UE) attempts to detect the presence of synchronization signals along with at least one cell identification (ID) for initial access.
  • ID cell identification
  • the UE monitors several neighboring cells by attempting to detect their synchronization signals and/or measuring the associated cell-specific reference signals (RSs).
  • RSs cell-specific reference signals
  • next generation cellular systems such as third generation partnership-new radio access or interface (3GPP-NR), efficient and unified radio resource acquisition or tracking mechanism which works for various use cases such as enhanced mobile broadband (eMBB), ultra-reliable low latency (URLLC), massive machine type communication (mMTC), each corresponding to a different coverage requirement and frequency bands with different propagation losses is desirable.
  • 3GPP-NR third generation partnership-new radio access or interface
  • eMBB enhanced mobile broadband
  • URLLC ultra-reliable low latency
  • mMTC massive machine type communication
  • a user equipment (UE) in a wireless communication system comprises antennas, and a processor operably connected to the antennas.
  • the processor is configured to identify E-field data of each of the antennas of the UE to be used for transmitting and receiving data, generate, based on the E-field data, a set of codewords including a first and second upper bounds, the set of codewords corresponding to candidate beams of each of the antennas, select at least one codeword from the set of codewords based on a performance criteria, configure a codebook to be used for each of the antennas by adding the at least one codeword into the codebook, determine whether the codebook including the at least one codeword satisfies a condition to stop adding another codeword to the codebook, and apply the configured codebook for use in transmitting or receiving the data at each of the antennas based on whether the condition is satisfied.
  • a method of a user equipment (UE) in a wireless communication system comprises identifying E-field data of each antenna of the UE to be used for transmitting and receiving data, generating, based on the E-field data, a set of codewords including a first and second upper bounds, the set of codewords corresponding to candidate beams of each antenna, selecting at least one codeword from the set of codewords based on a performance criteria, configuring a codebook to be used for each antenna by adding the at least one codeword into 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 for use in transmitting or receiving the data at each antenna based on whether the condition is satisfied.
  • a non-transitory computer readable medium comprising instructions, that when executed by at least one processor, perform a method.
  • the method comprises identifying E-field data of each antenna of the UE to be used for transmitting and receiving data, generating, based on the E-field data, a set of codewords including a first and second upper bounds, the set of codewords corresponding to candidate beams of each antenna, selecting at least one codeword from the set of codewords based on a performance criteria, configuring a codebook to be used for each antenna by adding the at least one codeword into 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 for use in transmitting or receiving the data at each antenna based on whether the condition is satisfied.
  • 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.
  • transmit and “communicate,” as well as derivatives thereof, encompass both direct and indirect communication.
  • the term “or” is inclusive, meaning and/or.
  • controller means any device, system or part thereof that controls at least one operation. Such a 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.
  • phrases “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 only one item in the list may be needed.
  • “at least one of: A, B, and C” includes any of the following combinations: A, B, C, A and B, A and C, B and C, and A and B and C.
  • various functions described below can be implemented or supported by one or more computer programs, each of which is formed from computer readable program code and embodied in a computer readable medium.
  • 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.
  • computer readable program code includes any type of computer code, including source code, object code, and executable code.
  • 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.
  • ROM read only memory
  • RAM random access memory
  • CD compact disc
  • DVD digital video disc
  • a “non-transitory” computer readable medium excludes wired, wireless, optical, or other communication links that transport transitory electrical or other signals.
  • a non-transitory computer readable medium includes media where data can be permanently stored and media where data can be stored and later overwritten, such as a rewritable optical disc or an erasable memory device.
  • Embodiments of the present disclosure provide beam codebook generation for an advanced communication system.
  • FIGURE 1 illustrates an example wireless network according to embodiments of the present disclosure
  • FIGURE 2 illustrates an example gNB according to embodiments of the present disclosure
  • FIGURE 3 illustrates an example UE according to embodiments of the present disclosure
  • FIGURE 4A illustrates a high-level diagram of an orthogonal frequency division multiple access transmit path according to embodiments of the present disclosure
  • FIGURE 4B illustrates a high-level diagram of an orthogonal frequency division multiple access receive path according to embodiments of the present disclosure
  • FIGURE 5 illustrates a transmitter block diagram for a PDSCH in a subframe according to embodiments of the present disclosure
  • FIGURE 6 illustrates a receiver block diagram for a PDSCH in a subframe according to embodiments of the present disclosure
  • FIGURE 7 illustrates a transmitter block diagram for a PUSCH in a subframe according to embodiments of the present disclosure
  • FIGURE 8 illustrates a receiver block diagram for a PUSCH in a subframe according to embodiments of the present disclosure
  • FIGURE 9 illustrates an example antenna blockaccording to embodiments of the present disclosure
  • FIGURE 10 illustrates an example user equipment according to embodiments of the present disclosure
  • FIGURE 11 illustrates an example upper bound for single and multi-array according to embodiments of the present disclosure
  • FIGURE 12 illustrates an example automatic codebook generation according to embodiments of the present disclosure
  • FIGURE 13 illustrates a flow chart of a heuristic scheme according to embodiments of the present disclosure
  • FIGURE 14 illustrates an example coordinate system according to embodiments of the present disclosure
  • FIGURE 15 illustrates an example EIRP CDF and some key metrics according to embodiments of the present disclosure
  • FIGURE 16 illustrates an example two-D heat map of spherical coverage of a codebook according to embodiments of the present disclosure
  • FIGURE 17 illustrates an example difference between the radiations of the upper bound and the codebook according to embodiments of the present disclosure
  • FIGURE 18 illustrates an example EIRP CDF of the composite pattern according to embodiments of the present disclosure
  • FIGURE 19 illustrates an example partitioning the set of directions into subsets according to embodiments of the present disclosure
  • FIGURE 20 illustrates an example definition of which determines the beamwidth according to embodiments of the present disclosure
  • FIGURE 21 illustrates an example definition of which determines the coverage area according to embodiments of the present disclosure
  • FIGURE 22 illustrates an example Fibonacci grid with 363 points on the whole sphere according to embodiments of the present disclosure
  • FIGURE 23 illustrates an example Impact of LCD to the UE EIRP pattern according to embodiments of the present disclosure
  • FIGURE 24 illustrates an example antenna modules activation based on device handling according to embodiments of the present disclosure
  • FIGURE 25 illustrates an example beam codebook design methodology according to embodiments of the present disclosure
  • FIGURE 26 illustrates an example multi-beam codebook management system according to embodiments of the present disclosure
  • FIGURE 27 illustrates an example beam codebook adaptation over time according to embodiments of the present disclosure
  • FIGURE 28 illustrates an example UE beam codebook learning based on data analytics according to embodiments of the present disclosure
  • FIGURE 29 illustrates an example UE beam data analytics module on terminal according to embodiments of the present disclosure
  • FIGURE 30 illustrates another example UE beam data analytics module on terminal according to embodiments of the present disclosure
  • FIGURE 31 illustrates an example UE beam data analytics circuit with other beam management blocks on the terminal according to embodiments of the present disclosure
  • FIGURE 32 illustrates an example procedures with UE beam data analytics module according to embodiments of the present disclosure
  • FIGURE 33 illustrates an example UE beam data analytics circuit according to embodiments of the present disclosure.
  • FIGURE 34 illustrates a flow chart of a method for UE beam data analytics module according to embodiments of the present disclosure.
  • FIGURES 1 through FIGURE 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 understand that the principles of the present disclosure may be implemented in any suitably arranged system or device.
  • the 5G or pre-5G communication system is also called a “beyond 4G network” or a “post LTE system.”
  • the 5G communication system is considered to be implemented in higher frequency (mmWave) bands, e.g., 28GHz, 39GHz, 60GHz bands, so as to accomplish higher data rates.
  • mmWave e.g., 28GHz, 39GHz, 60GHz bands
  • MIMO massive multiple-input multiple-output
  • FD-MIMO full dimensional MIMO
  • array antenna an analog beam forming, large scale antenna techniques and the like are discussed in 5G communication systems.
  • RANs cloud radio access networks
  • D2D device-to-device
  • wireless backhaul communication moving network
  • cooperative communication coordinated multi-points (CoMP) transmission and reception, interference mitigation and cancellation and the like.
  • CoMP coordinated multi-points
  • FQAM frequency shift keying and quadrature amplitude modulation
  • SWSC sliding window superposition coding
  • AMC adaptive modulation and coding
  • FBMC filter bank multi carrier
  • NOMA non-orthogonal multiple access
  • SCMA sparse code multiple access
  • FIGURES 1-4B below describe various embodiments implemented in wireless communications systems and with the use of orthogonal frequency division multiplexing (OFDM) or orthogonal frequency division multiple access (OFDMA) communication techniques.
  • OFDM orthogonal frequency division multiplexing
  • OFDMA orthogonal frequency division multiple access
  • FIGURE 1 illustrates an example wireless network according to embodiments of the present disclosure.
  • the embodiment of the wireless network shown in FIGURE 1 is for illustration only. Other embodiments of the wireless network 100 could be used without departing from the scope of this disclosure.
  • the wireless network includes a gNB 101, a gNB 102, and a gNB 103.
  • the gNB 101 communicates with the gNB 102 and the gNB 103.
  • the gNB 101 also communicates with at least one network 130, such as the Internet, a proprietary Internet Protocol (IP) network, or other data network.
  • IP Internet Protocol
  • the gNB 102 provides wireless broadband access to the network 130 for a first plurality of UEs within a coverage area 120 of the gNB 102.
  • the first plurality of UEs includes a UE 111, which may be located in a small business (SB); a UE 112, which may be located in an enterprise (E); a UE 113, which may be located in a WiFi hotspot (HS); a UE 114, which may be located in a first residence (R); a UE 115, which may be located in a second residence (R); and a UE 116, which may be a mobile device (M), such as a cell phone, a wireless laptop, a wireless PDA, or the like.
  • M mobile device
  • the gNB 103 provides wireless broadband access to the network 130 for a second plurality of UEs within a coverage area 125 of the gNB 103.
  • the second plurality of UEs includes the UE 115 and the UE 116.
  • one or more of the gNBs 101-103 may communicate with each other and with the UEs 111-116 using 5G, LTE, LTE-A, WiMAX, WiFi, or other wireless communication techniques.
  • the term “base station” or “BS” can refer to any component (or collection of components) configured to provide wireless access to a network, such as transmit point (TP), transmit-receive 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 wirelessly enabled devices.
  • TP transmit point
  • TRP transmit-receive point
  • eNodeB or eNB or gNB enhanced base station
  • gNB 5G base station
  • macrocell a macrocell
  • femtocell a femtocell
  • WiFi access point AP
  • Base stations may provide wireless access in accordance with one or more wireless communication protocols, e.g., 5G 3GPP new radio interface/access (NR), long term evolution (LTE) , LTE advanced (LTE-A) , high speed packet access (HSPA), Wi-Fi 802.11a/b/g/n/ac, etc.
  • wireless communication protocols e.g., 5G 3GPP new radio interface/access (NR), long term evolution (LTE) , LTE advanced (LTE-A) , high speed packet access (HSPA), Wi-Fi 802.11a/b/g/n/ac, etc.
  • NR 5G 3GPP new radio interface/access
  • LTE long term evolution
  • LTE-A LTE advanced
  • HSPA high speed packet access
  • Wi-Fi 802.11a/b/g/n/ac Wi-Fi 802.11a/b/g/n/ac
  • the term “user equipment” or “UE” can refer to any component such as “mobile station,” “subscriber station,” “remote terminal,” “wireless terminal,” “receive point,” or “user device.”
  • the terms “user equipment” and “UE” are used in this patent document to refer to remote wireless equipment that wirelessly accesses a BS, whether the UE is a mobile device (such as a mobile telephone or smartphone) or is normally considered a stationary device (such as a desktop computer or vending machine).
  • Dotted lines show the approximate extents of the coverage areas 120 and 125, which are shown as approximately circular for the purposes of illustration and explanation only. It should be clearly understood that the coverage areas associated with gNBs, such as the coverage areas 120 and 125, may have other shapes, including irregular shapes, depending upon the configuration of the gNBs and variations in the radio environment associated with natural and man-made obstructions.
  • one or more of the UEs 111-116 include circuitry, programing, or a combination thereof, for efficient beam codebook generation for 5G terminal.
  • one or more of the gNBs 101-103 includes circuitry, programing, or a combination thereof, for efficient beam codebook generation for 5G terminals.
  • FIGURE 1 illustrates one example of a wireless network
  • the wireless network could include any number of gNBs and any number of UEs in any suitable arrangement.
  • the gNB 101 could communicate directly with any number of UEs and provide those UEs with wireless broadband access to the network 130.
  • each gNB 102-103 could communicate directly with the network 130 and provide UEs with direct wireless broadband access to the network 130.
  • the gNBs 101, 102, and/or 103 could provide access to other or additional external networks, such as external telephone networks or other types of data networks.
  • FIGURE 2 illustrates an example gNB 102 according to embodiments of the present disclosure.
  • the embodiment of the gNB 102 illustrated in FIGURE 2 is for illustration only, and the gNBs 101 and 103 of FIGURE 1 could have the same or similar configuration.
  • gNBs come in a wide variety of configurations, and FIGURE 2 does not limit the scope of this disclosure to any particular implementation of a gNB.
  • the gNB 102 includes multiple antennas 205a-205n, multiple RF transceivers 210a-210n, transmit (TX) processing circuitry 215, and receive (RX) processing circuitry 220.
  • the gNB 102 also includes a controller/processor 225, a memory 230, and a backhaul or network interface 235.
  • the RF transceivers 210a-210n receive, from the antennas 205a-205n, incoming RF signals, 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 signals are sent to the RX processing circuitry 220, which generates processed baseband signals by filtering, decoding, and/or digitizing the baseband or IF signals.
  • the RX processing circuitry 220 transmits the processed baseband signals to the controller/processor 225 for further processing.
  • the TX processing circuitry 215 receives analog or digital data (such as voice data, web data, e-mail, or interactive video game data) from the controller/processor 225.
  • the TX processing circuitry 215 encodes, multiplexes, and/or digitizes the outgoing baseband data to generate processed baseband or IF signals.
  • the RF transceivers 210a-210n receive the outgoing processed baseband or IF signals from the TX processing circuitry 215 and up-converts the baseband or IF signals to RF signals that are transmitted via the antennas 205a-205n.
  • the controller/processor 225 can include one or more processors or other processing devices that control the overall operation of the gNB 102.
  • the controller/processor 225 could control the reception of forward channel signals and the transmission of reverse channel signals by the RF transceivers 210a-210n, the RX processing circuitry 220, and the TX processing circuitry 215 in accordance with well-known principles.
  • the controller/processor 225 could support additional functions as well, such as more advanced wireless communication functions.
  • the controller/processor 225 could support beam forming or directional routing operations in which outgoing/incoming signals from/to multiple antennas 205a-205n are weighted differently to effectively steer the outgoing signals in a desired direction. Any of a wide variety of other functions could be supported in the gNB 102 by the controller/processor 225.
  • the controller/processor 225 is also capable of executing programs and other processes resident in the memory 230, such as an OS.
  • the controller/processor 225 can move data into or out of the memory 230 as required by an executing process.
  • the controller/processor 225 is also coupled to the backhaul or network interface 235.
  • the backhaul or network interface 235 allows the gNB 102 to communicate with other devices or systems over a backhaul connection or over a network.
  • the interface 235 could support communications over any suitable wired or wireless connection(s). For example, when the gNB 102 is implemented as part of a cellular communication system (such as one supporting 5G, LTE, or LTE-A), the interface 235 could allow the gNB 102 to communicate with other gNBs over a wired or wireless backhaul connection.
  • the interface 235 could allow the gNB 102 to communicate over a wired or wireless local area network or over a wired or wireless connection to a larger network (such as the Internet).
  • the interface 235 includes any suitable structure supporting communications over a wired or wireless connection, such as an Ethernet or RF transceiver.
  • the memory 230 is coupled to the controller/processor 225. Part of the memory 230 could include a RAM, and another part of the memory 230 could include a Flash memory or other ROM.
  • FIGURE 2 illustrates one example of gNB 102
  • the gNB 102 could include any number of each component shown in FIGURE 2.
  • an access point could include a number of interfaces 235, and the controller/processor 225 could support routing functions to route data between different network addresses.
  • the gNB 102 while shown as including a single instance of TX processing circuitry 215 and a single instance of RX processing circuitry 220, the gNB 102 could include multiple instances of each (such as one per RF transceiver).
  • various components in FIGURE 2 could be combined, further subdivided, or omitted and additional components could be added according to particular needs.
  • FIGURE 3 illustrates an example UE 116 according to embodiments of the present disclosure.
  • the embodiment of the UE 116 illustrated in FIGURE 3 is for illustration only, and the UEs 111-115 of FIGURE 1 could have the same or similar configuration.
  • UEs come in a wide variety of configurations, and FIGURE 3 does not limit the scope of this disclosure to any particular implementation of a UE.
  • the 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.
  • the UE 116 also includes a speaker 330, a processor 340, an input/output (I/O) interface (IF) 345, a touchscreen 350, a display 355, and a memory 360.
  • the memory 360 includes an operating system (OS) 361 and one or more applications 362.
  • the RF transceiver 310 receives, from the antenna 305, an incoming RF signal transmitted by a gNB of the network 100.
  • the RF transceiver 310 down-converts the incoming RF signal to generate an intermediate frequency (IF) or baseband signal.
  • the IF or baseband signal is sent to the RX processing circuitry 325, which generates a processed baseband signal by filtering, decoding, and/or digitizing the baseband or IF signal.
  • the RX processing circuitry 325 transmits the processed baseband signal to the speaker 330 (such as for voice data) or to the processor 340 for further processing (such as for web browsing data).
  • the TX processing circuitry 315 receives analog or digital voice data from the microphone 320 or other outgoing baseband data (such as web data, e-mail, or interactive video game data) from the processor 340.
  • the TX processing circuitry 315 encodes, multiplexes, and/or digitizes the outgoing baseband data to generate a processed baseband or IF signal.
  • the RF transceiver 310 receives the outgoing 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.
  • the processor 340 can include one or more processors or other processing devices and execute the OS 361 stored in the memory 360 in order to control the overall operation of the UE 116.
  • the processor 340 could control the reception of forward channel signals and the transmission of reverse channel signals by the RF transceiver 310, the RX processing circuitry 325, and the TX processing circuitry 315 in accordance with well-known principles.
  • the processor 340 includes at least one microprocessor or microcontroller.
  • the processor 340 is also capable of executing other processes and programs resident in the memory 360, such as processes for CSI reporting on PUCCH.
  • the processor 340 can move data into or out of the memory 360 as required by an executing process.
  • the processor 340 is configured to execute the applications 362 based on the OS 361 or in response to signals received from gNBs or an operator.
  • the processor 340 is also coupled to the I/O interface 345, which provides the UE 116 with the ability to connect to other devices, such as laptop computers and handheld computers.
  • the I/O interface 345 is the communication path between these accessories and the processor 340.
  • the processor 340 is also coupled to the touchscreen 350 and the display 355.
  • the operator of the UE 116 can use the touchscreen 350 to enter data into the UE 116.
  • the display 355 may be a liquid crystal display, light emitting diode display, or other display capable of rendering text and/or at least limited graphics, such as from web sites.
  • the memory 360 is coupled to the processor 340.
  • Part of the memory 360 could include a random access memory (RAM), and another part of the memory 360 could include a Flash memory or other read-only memory (ROM).
  • RAM random access memory
  • ROM read-only memory
  • FIGURE 3 illustrates one example of UE 116
  • various changes may be made to FIGURE 3.
  • various components in FIGURE 3 could be combined, further subdivided, or omitted and additional components could be added according to particular needs.
  • the processor 340 could be divided into multiple processors, such as one or more central processing units (CPUs) and one or more graphics processing units (GPUs).
  • FIGURE 3 illustrates the UE 116 configured as a mobile telephone or smartphone, UEs could be configured to operate as other types of mobile or stationary devices.
  • FIGURE 4A is a high-level diagram of transmit path circuitry.
  • the transmit path circuitry may be used for an orthogonal frequency division multiple access (OFDMA) communication.
  • FIGURE 4B is a high-level diagram of receive path circuitry.
  • the receive path circuitry may be used for an orthogonal frequency division multiple access (OFDMA) communication.
  • the transmit path circuitry may be implemented in a base station (eNB or gNB) 102 or a relay station, and the receive path circuitry may be implemented in a user equipment (e.g. user equipment 116 of FIGURE 1).
  • the receive path circuitry 450 may be implemented in a base station (e.g. gNB 102 of FIGURE 1) or a relay station, and the transmit path circuitry may be implemented in a user equipment (e.g. user equipment 116 of FIGURE 1).
  • Transmit path circuitry comprises channel coding and modulation block 405, serial-to-parallel (S-to-P) block 410, Size N Inverse Fast Fourier Transform (IFFT) block 415, parallel-to-serial (P-to-S) block 420, add cyclic prefix block 425, and up-converter (UC) 430.
  • Receive path circuitry 450 comprises down-converter (DC) 455, remove cyclic prefix block 460, serial-to-parallel (S-to-P) block 465, Size N Fast Fourier Transform (FFT) block 470, parallel-to-serial (P-to-S) block 475, and channel decoding and demodulation block 480.
  • DC down-converter
  • FFT Fast Fourier Transform
  • FIGURES 4A 400 and 4B 450 may be implemented in software, while other components may be implemented by configurable hardware or a mixture of software and configurable hardware.
  • the FFT blocks and the IFFT blocks described in this disclosure document may be implemented as configurable software algorithms, where the value of Size N may be modified according to the implementation.
  • the value of the N variable may be any integer number (i.e., 1, 2, 3, 4, etc.), while for FFT and IFFT functions, the value of the N variable may be any integer number that is a power of two (i.e., 1, 2, 4, 8, 16, etc.).
  • channel coding and modulation block 405 receives a set of information bits, applies 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 sequence of frequency-domain modulation symbols.
  • Serial-to-parallel block 410 converts (i.e., de-multiplexes) the serial modulated symbols to parallel data to produce N parallel symbol streams where N is the IFFT/FFT size used in BS 102 and UE 116.
  • Size N IFFT block 415 then performs an IFFT operation on the N parallel symbol streams to produce time-domain output signals.
  • Parallel-to-serial block 420 converts (i.e., multiplexes) the parallel time-domain output symbols from Size N IFFT block 415 to produce a serial time-domain signal.
  • Add cyclic prefix block 425 then inserts a cyclic prefix to the time-domain signal.
  • up-converter 430 modulates (i.e., up-converts) the output of add cyclic prefix block 425 to RF frequency for transmission via a wireless channel.
  • the signal may also be filtered at baseband before conversion to RF frequency.
  • the transmitted RF signal arrives at UE 116 after passing through the wireless channel, and reverse operations to those at gNB 102 are performed.
  • Down-converter 455 down-converts the received signal to baseband frequency
  • remove cyclic prefix block 460 removes the cyclic prefix to produce the serial time-domain baseband signal.
  • Serial-to-parallel block 465 converts the time-domain baseband signal to parallel time-domain signals.
  • Size N FFT block 470 then performs an FFT algorithm to produce N parallel frequency-domain signals.
  • Parallel-to-serial block 475 converts the parallel frequency-domain signals to a sequence of modulated data symbols.
  • Channel decoding and demodulation block 480 demodulates and then decodes the modulated symbols to recover the original input data stream.
  • Each of gNBs 101-103 may implement a transmit path that is analogous to transmitting in the downlink to user equipment 111-116 and may implement a receive path that is analogous to receiving in the uplink from user equipment 111-116.
  • each one of user equipment 111-116 may implement a transmit path corresponding to the architecture for transmitting in the uplink to gNBs 101-103 and may implement a receive path corresponding to the architecture for receiving in the downlink from gNBs 101-103.
  • enhanced mobile broadband eMBB
  • ultra reliable and low latency URLL
  • massive machine type communication mMTC is determined that a number of devices can be as many as 100,000 to 1 million per km2, but the reliability/throughput/latency requirement could be less stringent. This scenario may also involve power efficiency requirement as well, in that the battery consumption should be minimized as possible.
  • a communication system includes a downlink (DL) that conveys signals from transmission points such as base stations (BSs) or NodeBs to user equipments (UEs) and an Uplink (UL) that conveys signals from UEs to reception points such as NodeBs.
  • DL downlink
  • UE user equipment
  • UL Uplink
  • a UE also commonly referred to as a terminal or a mobile station, may be fixed or mobile and may be a cellular phone, a personal computer device, or an automated device.
  • An eNodeB which is generally a fixed station, may also be referred to as an access point or other equivalent terminology.
  • eNB eNodeB
  • gNodeB a NodeB is referred to as gNodeB.
  • the present disclosure does not limit a usage of eNB or gNB in types of wireless communication systems.
  • DL signals can include data signals conveying information content, control signals conveying DL control information (DCI), and reference signals (RS) that are also known as pilot signals.
  • DCI DL control information
  • RS reference signals
  • An eNodeB transmits data information through a physical DL shared channel (PDSCH).
  • An eNodeB transmits DCI through a physical DL control channel (PDCCH) or an Enhanced PDCCH (EPDCCH).
  • PDSCH physical DL shared channel
  • EPCCH Enhanced PDCCH
  • An eNodeB transmits acknowledgement information in response to data transport block (TB) transmission from a UE in a physical hybrid ARQ indicator channel (PHICH).
  • An eNodeB transmits one or more of multiple types of RS including a UE-common RS (CRS), channel state information RS (CSI-RS), or a demodulation RS (DMRS).
  • CRS is transmitted over a DL system bandwidth (BW) and can be used by UEs to obtain a channel estimate to demodulate data or control information or to perform measurements.
  • BW DL system bandwidth
  • an eNodeB may transmit a CSI-RS with a smaller density in the time and/or frequency domain than a CRS.
  • DMRS can be transmitted only in the BW of a respective PDSCH or EPDCCH and a UE can use the DMRS to demodulate data or control information in a PDSCH or an EPDCCH, respectively.
  • a transmission time interval for DL channels is referred to as a subframe and can have, for example, duration of 1 millisecond.
  • DL signals also include transmission of a logical channel that carries system control information.
  • a BCCH is mapped to either a transport channel referred to as 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).
  • MIB master information block
  • DL-SCH DL shared channel
  • SIB system information block
  • Most system information is included in different SIBs that are transmitted using DL-SCH.
  • a presence of system information on a DL-SCH in a subframe can be indicated by a transmission of a corresponding PDCCH conveying a codeword with a cyclic redundancy check (CRC) scrambled with special system information RNTI (SI-RNTI).
  • SI-RNTI special system information RNTI
  • SIB-1 scheduling information for the first SIB (SIB-1) can be provided by the MIB.
  • a DL resource allocation is performed in a unit of subframe and a group of physical resource blocks (PRBs).
  • a transmission BW includes frequency resource units referred to as resource blocks (RBs).
  • Each RB includes sub-carriers, or resource elements (REs), such as 12 REs.
  • a unit of one RB over one subframe is referred to as a PRB.
  • a UE can be allocated M_ ⁇ PDSCH ⁇ RBs for a total of REs for the PDSCH transmission BW.
  • UL signals can include data signals conveying data information, control signals conveying UL control information (UCI), and UL RS.
  • UL RS includes DMRS and Sounding RS (SRS).
  • a UE transmits DMRS only in a BW of a respective PUSCH or PUCCH.
  • An eNodeB can use a DMRS to demodulate data signals or UCI signals.
  • a UE transmits SRS to provide an eNodeB with an UL CSI.
  • a UE transmits data information or UCI through a respective physical UL shared channel (PUSCH) or a Physical UL control channel (PUCCH). If a UE needs to transmit data information and UCI in a same UL subframe, the UE may multiplex both in a PUSCH.
  • PUSCH physical UL shared channel
  • PUCCH Physical UL control channel
  • UCI includes Hybrid Automatic Repeat request acknowledgement (HARQ-ACK) information, indicating correct (ACK) or incorrect (NACK) detection for a data TB in a PDSCH or absence of a PDCCH detection (DTX), scheduling request (SR) indicating whether a UE has data in the UE's buffer, rank indicator (RI), and channel state information (CSI) enabling an eNodeB to perform link adaptation for PDSCH transmissions to a UE.
  • HARQ-ACK information is also transmitted by a UE in response to a detection of a PDCCH/EPDCCH indicating a release of semi-persistently scheduled PDSCH.
  • An UL subframe includes two slots. Each slot includes symbols for transmitting data information, UCI, DMRS, or SRS.
  • a frequency resource unit of an UL system BW is a RB.
  • a UE is allocated RBs for a total of REs for a transmission BW.
  • a last subframe symbol can be used to multiplex SRS transmissions from one or more UEs.
  • a number of subframe symbols that are available for data/UCI/DMRS transmission is , where if a last subframe symbol is used to transmit SRS and otherwise.
  • FIGURE 5 illustrates a transmitter block diagram 500 for a PDSCH in a subframe according to embodiments of the present disclosure.
  • the embodiment of the transmitter block diagram 500 illustrated in FIGURE 5 is for illustration only.
  • FIGURE 5 does not limit the scope of this disclosure to any particular implementation of the transmitter block diagram 500.
  • information bits 510 are encoded by encoder 520, such as a channel encoder (e.g., turbo encoder for LTE and/or LDPC encoder for NR), and modulated by modulator 530, for example using quadrature phase shift keying (QPSK) modulation.
  • encoder 520 such as a channel encoder (e.g., turbo encoder for LTE and/or LDPC encoder for NR)
  • modulator 530 for example using quadrature phase shift keying (QPSK) modulation.
  • QPSK quadrature phase shift keying
  • a serial to parallel (S/P) converter 540 generates M modulation symbols that are subsequently provided to a mapper 550 to be mapped to REs selected by a transmission BW selection unit 555 for an assigned PDSCH transmission BW, unit 560 applies an Inverse fast Fourier transform (IFFT), the output is then serialized by a parallel to serial (P/S) converter 570 to create a time domain signal, filtering is applied by filter 580, and a signal transmitted 590.
  • Additional functionalities such as data scrambling, cyclic prefix insertion, time windowing, interleaving, and others are well known in the art and are not shown for brevity.
  • FIGURE 6 illustrates a receiver block diagram 600 for a PDSCH in a subframe according to embodiments of the present disclosure.
  • the embodiment of the diagram 600 illustrated in FIGURE 6 is for illustration only.
  • FIGURE 6 does not limit the scope of this disclosure to any particular implementation of the diagram 600.
  • a received signal 610 is filtered by filter 620, REs 630 for an assigned reception BW are selected by BW selector 635, unit 640 applies a fast Fourier transform (FFT), and an output is serialized by a parallel-to-serial converter 650.
  • a demodulator 660 coherently demodulates data symbols by applying a channel estimate obtained from a DMRS or a CRS (not shown), and a decoder 670, such as a turbo decoder, decodes the demodulated data to provide an estimate of the information data bits 680. Additional functionalities such as time-windowing, cyclic prefix removal, de-scrambling, channel estimation, and de-interleaving are not shown for brevity.
  • FIGURE 7 illustrates a transmitter block diagram 700 for a PUSCH in a subframe according to embodiments of the present disclosure.
  • the embodiment of the block diagram 700 illustrated in FIGURE 7 is for illustration only.
  • FIGURE 7 does not limit the scope of this disclosure to any particular implementation of the block diagram 700.
  • information data bits 710 are encoded by encoder 720, such as a turbo encoder, and modulated by modulator 730.
  • a discrete Fourier transform (DFT) unit 740 applies a DFT on the modulated data bits, REs 750 corresponding to an assigned PUSCH transmission BW are selected by transmission BW selection unit 755, unit 760 applies an IFFT and, after a cyclic prefix insertion (not shown), filtering is applied by filter 770 and a signal transmitted 780.
  • DFT discrete Fourier transform
  • FIGURE 8 illustrates a receiver block diagram 800 for a PUSCH in a subframe according to embodiments of the present disclosure.
  • the embodiment of the block diagram 800 illustrated in FIGURE 8 is for illustration only.
  • FIGURE 8 does not limit the scope of this disclosure to any particular implementation of the block diagram 800.
  • a received signal 810 is filtered by filter 820. Subsequently, after a cyclic prefix is removed (not shown), unit 830 applies a FFT, REs 840 corresponding to an assigned PUSCH reception BW are selected by a reception BW selector 845, unit 850 applies an inverse DFT (IDFT), a demodulator 860 coherently demodulates data symbols by applying a channel estimate obtained from a DMRS (not shown), a 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 the information data bits 880.
  • a channel decoder e.g., turbo decoder for LTE and/or LDPC decoder for NR
  • the 5G network In order for the 5G network to support such diverse services with different quality of services (QoS), one embodiment has been identified in LTE specification, called network slicing.
  • network slicing To utilize PHY resources efficiently and multiplex various slices (with different resource allocation schemes, numerologies, and scheduling strategies) in DL-SCH, a flexible and self-contained frame or subframe design is utilized.
  • FIGURE 9 illustrates an example antenna blocks 900 according to embodiments of the present disclosure.
  • the embodiment of the antenna blocks 900 illustrated in FIGURE 9 is for illustration only.
  • FIGURE 9 does not limit the scope of this disclosure to any particular implementation of the antenna blocks 900.
  • the number of CSI-RS ports - which can correspond to the number of digitally precoded ports - tends to be limited due to hardware constraints (such as the feasibility to install a large number of ADCs/DACs at mmWave frequencies) as illustrated in FIGURE 10.
  • one CSI-RS port is mapped onto a large number of antenna elements which can be controlled by a bank of analog phase shifters.
  • One CSI-RS port can then correspond to one sub-array which produces a narrow analog beam through analog beamforming. This analog beam can be configured to sweep across a wider range of angles by varying the phase shifter bank across symbols or subframes.
  • the number of sub-arrays (equal to the number of RF chains) is the same as the number of CSI-RS ports N CSI-PORT .
  • a digital beamforming unit performs a linear combination across N CSI-PORT analog beams to further increase precoding gain. While analog beams are wideband (hence not frequency-selective), digital precoding can be varied across frequency sub-bands or resource blocks.
  • CSI reporting modes exist for both periodic (PUCCH-based) and aperiodic (PUSCH-based) CSI reporting.
  • Each CSI reporting mode is depend on (coupled with) many other parameters (e.g. codebook selection, transmission mode, eMIMO-Type, RS type, number of CRS or CSI-RS ports).
  • codebook selection e.g. codebook selection, transmission mode, eMIMO-Type, RS type, number of CRS or CSI-RS ports.
  • UL CSI measurement framework exists in a primitive form and is not as evolved as DL counterpart.
  • a same (or at least similar) CSI measurement and reporting framework applicable for both DL and UL is beneficial.
  • a beam sweeping procedure is employed consisting of the gNB transmitting a set of transmit beams to sweep the cell area and the UE measuring the signal quality on different beams using the UE's receive beams.
  • the gNB configures the UE with one or more RS resource (e.g. SS Block, Periodic/Aperiodic/Semi-Persistent CSI-RS resources or CRIs) corresponding to a set of TX beams.
  • RS resource e.g. SS Block, Periodic/Aperiodic/Semi-Persistent CSI-RS resources or CRIs
  • An RS resource refers to a reference signal transmission on a combination of one or more time (OFDM symbol)/frequency (resource element)/spatial (antenna port) domain locations.
  • the UE reports different TX beams received using that RX beam, ranked in order of signal strength (RSRP) and optionally CSI (CQI/PMI/RI)).
  • the gNB configures the UE with a set of Tx beams for reception of PDCCH and/or PDSCH.
  • FIGURE 10 illustrates an example user equipment 1000 according to embodiments of the present disclosure.
  • the embodiment of the user equipment 1000 illustrated in FIGURE 10 is for illustration only.
  • FIGURE 10 does not limit the scope of this disclosure to any particular implementation.
  • the UE includes a 2G/3G/4G communication module and a 5G mmWave communication module.
  • Each communication module includes one or more antennas, one 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 sensor(s), proximity sensor(s), gyroscope, etc.), a touchscreen, a display, and a memory.
  • the memory includes, a firmware, an operating system (OS) and one or more applications.
  • OS operating system
  • the RF transceiver receives, from the antenna, an incoming RF signal transmitted by an eNB/gNB of the network.
  • the RF transceiver down-converts the incoming RF signal to generate an intermediate frequency (IF) or baseband signal.
  • IF or baseband signal is sent to the RX processing circuitry, which generates a processed baseband signal by filtering, decoding, and/or digitizing the baseband or IF signal.
  • the RX processing circuitry transmits the processed baseband signal to the processor for further processing (such as for voice or web browsing data).
  • the TX processing circuitry receives outgoing baseband data (such as voice, web data, e-mail, or interactive video game data) from the processor.
  • the TX processing circuitry encodes, multiplexes, and/or digitizes the outgoing baseband data to generate a processed baseband or IF signal.
  • the RF transceiver receives the outgoing 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 via the antenna
  • the processor can include one or more processors and execute the basic OS program stored in the memory in order to control the overall operation of the UE.
  • the main processor controls the reception of forward channel signals and the transmission of reverse channel signals by the RF transceiver, the RX processing circuitry, and the TX processing circuitry in accordance with well-known principles.
  • the main processor can also include processing circuitry configured to allocate one or more resources.
  • the processor can include allocator processing circuitry configured to allocate a unique carrier indicator and detector processing circuitry configured to detect a physical downlink control channel (PDCCH) scheduling a physical downlink shared channel (PDSCH) reception of a physical uplink shared channel (PUSCH) transmission in one of the carriers.
  • downlink control information serves several purposes and is conveyed through DCI formats in respective PDCCHs.
  • a DCI format may correspond to a downlink assignment for PDSCH receptions or to an uplink grant for PUSCH transmissions.
  • the processor includes at least one microprocessor or microcontroller.
  • the processor is also capable of executing other processes and programs resident in the memory, such as operations for inter-eNB/gNB coordination schemes to support inter-eNB/gNB carrier aggregation. It should be understood that inter-eNB/gNB carrier aggregation can also be referred to as dual connectivity.
  • the processor can move data into or out of the memory as required by an executing process.
  • the processor is configured to execute a plurality of applications, such as applications for MU-MIMO communications, including obtaining control channel elements of PDCCHs.
  • the processor can operate the plurality of applications based on the OS program or in response to a signal received from an eNB/gNB.
  • the main processor is also coupled to the I/O interface, which provides UE with the ability 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 main controller.
  • the processor is also coupled to the touchscreen and the display.
  • the operator of the UE can use the touchscreen to enter data into the UE.
  • the display may be a liquid crystal display, light emitting diode display, or other display capable of rendering text and/or at least limited graphics, such as from web sites.
  • the memory is coupled to the processor.
  • Part of the memory could include a random access memory (RAM), and another part of the memory could include a Flash memory or other read-only memory (ROM).
  • RAM random access memory
  • ROM read-only memory
  • FIGTURE 10 illustrates one example of UE
  • various changes may be made to FIGURE 10.
  • various components in FIGURE 10 could be combined, further subdivided, or omitted and additional components could be added according to particular needs.
  • the processor could be divided into multiple processors, such as one or more central processing units (CPUs) and one or more graphics processing units (GPUs).
  • FIGURE 10 illustrates the UE configured as a mobile telephone or smartphone, UEs could be configured to operate as other types of mobile or stationary devices.
  • a 5G terminal or a UE can be equipped with multiple antenna elements. Beamforming is an important factor when UE tries to establish a connection with a BS station. To compensate for the narrower analog beamwidth in mmWave, analog beams sweeping can be employed to enable wider signal reception or transmission coverage for the UE.
  • a beam codebook comprises a set of codewords, where a codeword is a set of analog phase shift values, or a set of amplitude plus phase shift values, applied to the antenna elements, in order to form an analog beam.
  • the present disclosure describes the beam codebook generation procedure and the algorithms to generate a beam codebook to meet a given set of requirements and performance criteria.
  • codebook design is to provide the optimal coverage for a UE.
  • the upper bound provides a good reference for evaluation of codebook design schemes. For example, the number of beams required for the composite pattern to approach the upper bound can be evaluated.
  • the upper bound is computed across the whole sphere.
  • the whole sphere consists of 180x360 samples along the azimuth (360 samples) and elevation domain (180 samples). Each sample corresponds to one direction.
  • a gain is computed by maximizing over beamforming weights. Two upper bounds are considered. For the first upper bound, the beamforming weights are subject to sum power constraint; whereas for the second upper bound, the beamforming weights are subject to per-element power constraint.
  • the gain corresponding to the beamforming weights is given by where and , ( ⁇ ) c denotes the conjugate, ( ⁇ ) T denotes the transpose, and ( ⁇ ) H denotes the conjugate transpose or Hermitian conjugate.
  • the upper bound for gain is derived with the optimal such that is maximized:
  • the upper bound with a sum power constraint can be formulated as . It is defined that an auxiliary matrix as .
  • the upper bound with power constraint per antenna element can be formulated as .
  • Step 1 updates the weight imposed on each antenna element for all 's sequentially where is the weight on the -th antenna element at -th iteration, and is defined as follows, .
  • Step 2 calculate the iteration stopping condition variable , .
  • Step 3 if is smaller than a predefined threshold, , the iteration stopping condition is satisfied and the optimal weights is given by the final and .
  • Step 1 If the stopping condition is not satisfied after a predetermined maximum number of iterations, convergence is not achieved within the maximum number of iterations tolerable and the algorithm is terminated. If there are multiple antenna modules, upper bounds of individual can still be obtained as above. The overall upper bound can be defined based on the individual upper bounds, for example, maximization over the individual upper bounds.
  • FIGURE 11 illustrates an example upper bound 1100 for single and multi-array according to embodiments of the present disclosure.
  • the embodiment of the upper bound 1100 illustrated in FIGURE 11 is for illustration only.
  • FIGURE 11 does not limit the scope of this disclosure to any particular implementation.
  • FIGURE 11 A comparison of the upper bounds in EIRP CDF for single and multiple arrays for an example antenna module is plotted in FIGURE 11.
  • TABLE 1 shows that patch + dipole provides gains of 35.59% and 33.47% for 50%-tile and 20%-tile, respectively, compared to patch only.
  • a good beam codebook design depends on many factors including: antenna element type and gain (e.g. isotropic, dipole, microstrip patch); array size and layout (e.g. linear, rectangular, circular); requirements of codebook (e.g. codebook size); and/or consideration about housing and display in set-level.
  • antenna element type and gain e.g. isotropic, dipole, microstrip patch
  • array size and layout e.g. linear, rectangular, circular
  • requirements of codebook e.g. codebook size
  • consideration about housing and display in set-level e.g. isotropic, dipole, microstrip patch
  • FIGURE 12 illustrates an example automatic codebook generation 1200 according to embodiments of the present disclosure.
  • the embodiment of the automatic codebook generation 1200 illustrated in FIGURE 12 is for illustration only.
  • FIGURE 12 does not limit the scope of this disclosure to any particular implementation.
  • step 1202 at least one of a module of set level EM data, a band, or a number of phase shifter bits is sent to an automatic codebook generation algorithm in step 1208.
  • codebook design requirements comprising at least one of a codebook size, or spherical coverage requirements are sent to the automatic codebook generation algorithm in step 1208.
  • other prior knowledge comprising at least one of a UE orientation or historical knowledge is sent to the automatic codebook generation algorithm in step 1208.
  • step 1208 the automatic generation algorithm outputs an output codebook that satisfies the requirements and provides the performance results in step 1210.
  • FIGURE 13 illustrates a flow chart of a heuristic scheme 1300 according to embodiments of the present disclosure.
  • the embodiment of the heuristic scheme 1300 illustrated in FIGURE 13 is for illustration only.
  • FIGURE 13 does not limit the scope of this disclosure to any particular implementation.
  • Step 1 import E-field data of module-level antenna design from measurement or simulation.
  • Step 2 generate candidate beam codewords according to configured codebook type. In such example, applicable codebook types depend on beam codebook generation algorithm.
  • Step 2 select beams from the candidate set according to a certain performance criterion. In such example, performance criterion depends on detailed beam codebook generation algorithm design.
  • Step 3 stop if a certain stopping criterion is met; repeat Step 2 otherwise, stopping criterion depends on user inputs on codebook design requirements (codebook size or spherical coverage requirement).
  • E-field data of each antenna is imported.
  • a set of candidate beams are generated based on the E-field date.
  • the current codebook is set as an empty set.
  • a beam (or a batch of beams) is selected from the candidate set and add the beam (or beams) into the current codebook.
  • the candidate codeword set is designed be large enough to cover the whole sphere (or a certain required coverage region) to avoid coverage holes.
  • Options of the candidate set considered are but not limited as follows.
  • the candidate set is taken from the eigenvectors that maximize radiation gain.
  • M x N DFT candidate set. (M, N) are determined by the number of phase shifter, antenna dimensions.
  • uniformly distributed beams on the sphere i.e., the beam pointing to a set of uniformly distributed directions on the sphere.
  • beams with random phases at i-th element defined as or if the phase shifter has limited resolution as b bits.
  • the provided codebook design scheme is applicable for hardware implementation.
  • the hardware requirements considered are listed but not limited to the items below: module-level or set-level; for set-level, the number of antenna modules, their locations and their orientation in the device; the number of bits for the phase shifter (e.g. 3, 4, 5); supported band, for example, 28GHz, 39GHz or both; supported bandwidth (low/wide/high); MIMO capability : diversity/multiplexing; gain control capability; and residual error in RF calibration & housing/assemble dimensions deviation.
  • codebook size e.g. 16 beams
  • spherical coverage CDF requirements such as -Y dB from max EIRP at X%-tile CDF, spatial coverage region in the ranges of azimuth and elevation, and the range of azimuth is configurable from 0° to 360° and the range of elevation is configurable from 0° to 180°.
  • Default is the whole sphere; sidelobe level; and beam width, e.g., 3-dB beam width or half power beam width (HPBW).
  • FIGURE 14 illustrates an example coordinate system 1400 according to embodiments of the present disclosure.
  • the embodiment of the coordinate system 1400 illustrated in FIGURE 14 is for illustration only.
  • FIGURE 14 does not limit the scope of this disclosure to any particular implementation.
  • Optimization criteria need to be defined in order to determine the codeword (beam) selection criterion and/or the algorithm stopping condition.
  • the same or different metrics may be used for performance optimization criterion and the stopping condition criterion.
  • Performance optimization criterion defines the metric or the objective function that the algorithm tries to maximize/minimize. For the EIRP maximizing greedy algorithm, it is the maximization of EIRP value at X%-tile CDF sampled over a given spatial coverage region (default is the whole sphere). This is described as Y dB droop from the peak EIRP at X%-tile CDF (both X and Y can be configured in the codebook design). Other possible objective function can be the maximization of mean EIRP, i.e. the average EIRP over the given spatial coverage region.
  • the uniform beam covering algorithm it is the minimization of the number of beams required to cover a target spatial region, such that overlapping of beam patterns at the adjacent beam positions at some gain level (e.g. 3dB below the max gain) is guaranteed.
  • Stopping condition criterion defines the metric used to terminate the algorithm.
  • the metrics are taken from the codebook design requirements.
  • the codebook size is one embodiment of the criterion.
  • the EIRP value at X%-tile CDF is another embodiment of the criterion, i.e. the algorithm stops after the EIRP value at the X%-tile CDF is reached.
  • Yet another criterion is the spatial coverage region, which is applicable for the uniform beam covering algorithm, i.e. the algorithm stops after a required spatial region has been covered with beams.
  • Performance of the generated codebook is compared against the upper bound as described in the previous section, in particular the following comparisons with the upper bound(s) are made: spherical coverage or EIRP CDF; 2-D heat map of radiation pattern of the generated codebook and the difference compared to the heat map of the optimal spherical coverage; sidelobe level of the generated beams; and beamwidth, e.g., 3-dB beamwidth or half power beam width (HPBW) of the generated beams.
  • spherical coverage or EIRP CDF 2-D heat map of radiation pattern of the generated codebook and the difference compared to the heat map of the optimal spherical coverage
  • sidelobe level of the generated beams and beamwidth, e.g., 3-dB beamwidth or half power beam width (HPBW) of the generated beams.
  • HPBW half power beam width
  • the following metrics are included as the criteria for the codebook design: peak EIRP value; peak - 50% drop: difference between the 50 th percentile EIRP and the peak EIRP; gap to upper bound at 50 th percentile: the difference between the EIRP of the codebook and the upper bound at the 50 th percentile; and gap to upper bound at 100 th percentile: the difference between the EIRP of the codebook and the upper bound at the 100 th percentile.
  • FIGURE 15 illustrates an example EIRP CDF and some key metrics 1500 according to embodiments of the present disclosure.
  • the embodiment of the EIRP CDF and some key metrics 1500 illustrated in FIGURE 15 is for illustration only.
  • FIGURE 15 does not limit the scope of this disclosure to any particular implementation.
  • the EIRP CDF comprises an upper bound 1 and an upper bound 2.
  • FIGURE 15 shows a peak EIRP value at (1), peak 50% drop at (2), a distribution to upper bound- 50% at (3), and distribution to upper bound-100% at (4).
  • FIGURE 16 illustrates an example two-D heat map 1600 of spherical coverage of a codebook according to embodiments of the present disclosure.
  • the embodiment of the two-D heat map 1600 illustrated in FIGURE 16 is for illustration only.
  • FIGURE 16 does not limit the scope of this disclosure to any particular implementation.
  • An example 2-D heat map of radiation pattern of a codebook is given in FIGURE 15.
  • FIGURE 17 illustrates an example difference between the radiations of the upper bound and the codebook 1700 according to embodiments of the present disclosure.
  • the embodiment of the difference between the radiations of the upper bound and the codebook 1700 illustrated in FIGURE 17 is for illustration only.
  • FIGURE 17 does not limit the scope of this disclosure to any particular implementation.
  • the difference between the radiations of the upper bound and the codebook can also be generated as a 2-D heat map as shown in FIGURE 17.
  • the selection maximizes EIRP-related metric (for example, the mean EIRP value or X%-tile of the EIRP CDF) in a greedy manner.
  • EIRP-related metric for example, the mean EIRP value or X%-tile of the EIRP CDF
  • the greedy algorithm first selects a beam out of the candidate set, whose CDF has the largest X%-tile EIRP value. Then in each step, the beam which maximizes the X-tile EIRP value of the composite beam is selected. If a requirement on the spatial coverage region is specified, the CDF for beam selection is constructed based on sampling within the specified spatial coverage region.
  • FIGURE 18 illustrates an example EIRP CDF 1800 of the composite pattern according to embodiments of the present disclosure.
  • the embodiment of the EIRP CDF 1800 illustrated in FIGURE 18 is for illustration only.
  • FIGURE 18 does not limit the scope of this disclosure to any particular implementation.
  • FIGURE 18 An example result of the greedy algorithm is shown in FIGURE 18.
  • the black dash curves represent the improvement in EIRP CDF as each beam is added to the codebook.
  • the blue curve is the EIRP CDF of the final codebook.
  • Performance criterion is supported for the greedy algorithm.
  • Y dB drop from the peak EIRP at X%-tile CDF over a specified spatial coverage region (azimuth and elevation ranges).
  • weighted average of configured percentile points over a specified spatial coverage region (azimuth and elevation ranges).
  • Option 1 is a special case with all but one percentile point set to be zero weight.
  • mean EIRP in linear domain i.e. for each iteration, the beam providing the largest gain in mean EIPR in linear domain is selected.
  • Stopping condition supported for the greedy algorithm includes: codebook size; and performance criterion according to Option 1, 2 or 3 above is satisfied.
  • FIGURE 19 illustrates an example partitioning the set of directions 1900 into subsets according to embodiments of the present disclosure.
  • the embodiment of the partitioning the set of directions 1900 illustrated in FIGURE 19 is for illustration only.
  • FIGURE 19 does not limit the scope of this disclosure to any particular implementation.
  • assignment step assign each direction to the beam, which has the largest gain.
  • Each subset is served by a beam.
  • FIGURE 19 shows one possible realization.
  • Each circle represents a direction. The circles with same color belong to the same subset.
  • FIGURE 20 illustrates an example definition of 2000 which determines the beamwidth according to embodiments of the present disclosure.
  • the embodiment of the definition of 2000 illustrated in FIGURE 20 is for illustration only.
  • FIGURE 20 does not limit the scope of this disclosure to any particular implementation.
  • update step optimize a new beam to serve all directions in every subset. This is done by solving the following problem. It is similar to the computation of the 2 nd upper bound, the only difference is that the problem is solved for only one point for each subset S k by summing the matrices for all the points in subset S k . The objective is to maximize the mean gain (in linear scale, not dB).
  • the algorithm is terminated when the mean gains for all S k converged or the assignments of beams to S k no longer change.
  • possible options include: the initial codebook is generated from the greedy algorithm. In other words, the two algorithms are concatenated. The greedy algorithm first runs and then treat the output of the greedy algorithm as the initial point of the Lloyd-Max algorithm; and the initial codebook is generated by selecting k codewords from the candidate codewords pool.
  • the candidate codewords pool may be Eigen-based codebook, iterative Eigen-based codebook, DFT codebook, uniform grid codebook, random phase codebook, etc. The selection may be done randomly or by following certain metric.
  • a pair angle represents a direction (or a point on the unit sphere), instead of the polarization directions.
  • the algorithm assumes that all the beams have the same beam shape regardless of their directions.
  • the main lobe directions of the beams are decided to cover a required area without holes.
  • the input parameters of this algorithm include: determines minimum allowed antenna gain level; and determines the elevation angle limiting spherical sector and has to be within the range of [0:90 0 ].
  • scheme 1 is directly configured.
  • scheme 2 is calculated from x-dB beam width configuration. The value of 'x' can be directly configured. Then, a beam width is calculated within which the radiation power falls below the maximum value by no larger than x-dB. Then, the calculated beam width is taken as the .
  • the x-dB beam width based calculation follows the four steps below.
  • Step 1 find the direction at which the radiation power achieves the maximum ;
  • Step 2 in the plane find the two boundaries between which the radiation power falls below by no more than x-dB.
  • the angle between the boundary is denoted by (Step 3) calculate the plane which (1) is the orthogonal to the plane , (2) contains the origin, and (3) contains the point .
  • Step 4 calculate the plane which (1) is the orthogonal to the plane , (2) contains the origin, and (3) contains the point .
  • Step 4 The smaller one between and is taken as the for the “uniform beam covering” algorithm, .
  • FIGURE 21 illustrates an example definition of 2100 which determines the coverage area according to embodiments of the present disclosure.
  • the embodiment of the definition of 2100 illustrated in FIGURE 21 is for illustration only.
  • FIGURE 21 does not limit the scope of this disclosure to any particular implementation.
  • FIGURE 22 is an example of 363 points on the Fibonacci grid.
  • FIGURE 22 illustrates an example Fibonacci grid with 363 points 2200 on the whole sphere according to embodiments of the present disclosure.
  • the embodiment of the Fibonacci grid with 363 points 2200 illustrated in FIGURE 22 is for illustration only.
  • FIGURE 22 does not limit the scope of this disclosure to any particular implementation.
  • Stopping condition supported for the greedy algorithm codebook size; and target spatial region (defined as azimuth and elevation ranges) is reached.
  • the algorithm is treated as a benchmark algorithm. The strong assumptions required for this algorithm, which states that the beam width is independent of the direction, does not generally hold for antenna arrays.
  • the candidate codewords are the eigenvectors corresponding to the maximum eigenvalue of sampled over the target spatial coverage region (e.g. whole sphere, semi-sphere).
  • the performance of the Eigen-based codebook approaches that of the upper bound with sum power constraint.
  • the beamforming weights can be fixed to 1 (or a constant), only the phase of the eigenvector is used for constructing the codebook.
  • the candidate codewords are the eigenvectors corresponding to the maximum eigenvalue of , sampled over the target spatial coverage region (e.g. whole sphere, semi-sphere).
  • the magnitude of each element of the eigenvectors is restricted to be same.
  • the candidate codeword pool is taken from a DFT matrix.
  • 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.
  • the candidate codeword pool is obtained from uniformly distributed beams on the sphere (see FIGURE 22 for illustration of a scheme to generate the candidate set through Fibonacci grid).
  • the candidate codeword pool is generated with random phases at i-th element , according to , or for b bits phase shifter. Due to the randomness, the codebook generated by this scheme is not unique. Note that this codebook serves as a reference and is not intended as an implementation option.
  • the Tx/Rx RF beam codebook is the set of complex-valued weights that are applied to individual antenna elements on the RF module.
  • the complex-valued weights determine the magnitudes and phases of beamforming matrix applied on the antenna array. In certain design, the magnitude is fixed and only the phase of the beamforming matrix can be changed.
  • the beam codebook can be applied to both the RF antenna arrays of the base station and the user device, and typically the codebook for the base station and the user device would be different. It may be focusing on the RF beam codebook system design at the user device for the remainder of the disclosure. However, it is understood that the schemes described hereafter can be extended to the RF beam codebook system design at the base station.
  • the mmWave Tx/Rx RF beam codebook design may be optimized considering the following factors: device design (e.g. material, form factor, antenna module design etc.); users' handling of device (handgrip, orientation, body/object blockage, etc.); and network deployment environment (indoor office, dense urban, urban macro, rural area, etc.).
  • device design e.g. material, form factor, antenna module design etc.
  • users' handling of device handgrip, orientation, body/object blockage, etc.
  • network deployment environment indoor office, dense urban, urban macro, rural area, etc.
  • FIGURE 23 illustrates an example impact of LCD 2300 to the UE EIRP pattern according to embodiments of the present disclosure.
  • the embodiment of the impact of LCD 2300 illustrated in FIGURE 23 is for illustration only.
  • FIGURE 23 does not limit the scope of this disclosure to any particular implementation.
  • FIGURE 23 shows an example of the impact of having a full LCD display covering one side of the UE on the UE's Rx/Tx EIRP pattern. If the UE is equipped with multiple antenna modules, e.g. located at the four corners (or subset) of the rectangular UE, the set of antenna modules that may be turned on to receive or transmit signals can be highly dependent on how the device is being handled by the user. Some examples are illustrated in FIGURE 24.
  • FIGURE 24 illustrates an example antenna modules activation 2400 based on device handling according to embodiments of the present disclosure.
  • the embodiment of the antenna modules activation 2400 illustrated in FIGURE 24 is for illustration only.
  • FIGURE 24 does not limit the scope of this disclosure to any particular implementation.
  • Tx/Rx beam codebook There are several ways of designing the Tx/Rx beam codebook.
  • One scheme is a heuristic approach where radio measurement data is collected from real deployment scenarios or from a lab setup that sufficiently mimics the real environment. The measurement data is then post-processed to search for the best Tx/Rx beam codebook according to a predefined objective function, e.g. through gradient descent or machine learning techniques.
  • the measurement data collection can be manually performed for different environment experienced by the device, such as orientation and movement, or it can be automated with a robot setup.
  • An example of the procedure is described in FIGURE 25, where the measurement for various position of the device is assumed performed with a robot setup.
  • FIGURE 25 illustrates an example beam codebook design methodology 2500 according to embodiments of the present disclosure.
  • the embodiment of the beam codebook design methodology 2500 illustrated in FIGURE 25 is for illustration only.
  • FIGURE 25 does not limit the scope of this disclosure to any particular implementation.
  • the robot setup is a mechanical test fixture capable of orienting the test device through 3D space, with measurements made in magnitude/phase for H and V polarization.
  • raw measurement is obtained for each antenna chain.
  • the measurement is obtained for all the positions that the final beam codebook design may aim to cover.
  • the beam codebook search based on a predefined performance criterion can be performed.
  • the beam codebook design can be tested in the field to evaluate the beam codebook's effectiveness.
  • Another example of beam codebook design methodology is the maximum power exhaustive search beamforming algorithm.
  • the algorithm uses a scheme of spherical sector coverage that takes required spatial sector and antenna beamwidth as input parameters, identifies angular positions of the antenna steering directions to fully cover the given spherical sector and at the same to minimize overlapping between adjacent antenna beams and the number of required antenna positions. After the set of antenna steering directions is identified, the beamforming algorithm iterates over all combinations of transmit and receive antennas steering directions from this set and finds the combination of the transmit and receive antennas positions providing the maximum received power.
  • the present disclosure provides schemes of adapting the beam codebook for the user device over time.
  • the system includes one or more of the following modules.
  • a beam codebook (CB) set is included, comprising multiple beam codebooks, stored in the internal memory of the device.
  • a scenario or context can be defined to include one or more of device orientation, user handgrip, body blockage, network deployment scenario, UE speed.
  • Example device orientation includes portrait orientation and landscape orientation.
  • the baseband measurements can be based on signals transmitted by the base station, including SS block, CSI-RS, Tracking Reference Signal (TRS)
  • the codebook selected for each RF antenna module on the device can be different.
  • the output of the module is the beamforming codebook selected for each RF antenna module.
  • a selected codebook is applied to all the RF antenna modules.
  • FIGURE 26 illustrates an example multi-beam codebook management system 2600 according to embodiments of the present disclosure.
  • the embodiment of the multi-beam codebook management system 2600 illustrated in FIGURE 26 is for illustration only.
  • FIGURE 26 does not limit the scope of this disclosure to any particular implementation.
  • FIGURE 27 illustrates an example beam codebook adaptation 2700 over time according to embodiments of the present disclosure.
  • the embodiment of the beam codebook adaptation 2700 illustrated in FIGURE 27 is for illustration only.
  • FIGURE 27 does not limit the scope of this disclosure to any particular implementation.
  • FIGURE 26 The multi-beam codebook system is illustrated in FIGURE 26.
  • FIGURE 27 An example of beam codebook adaptation over time is illustrated in FIGURE 27.
  • the UE beam codebook selection function if the UE beam codebook selection function is determined to not able to meet a requirement such as a performance requirement (e.g. RSRP, SINR or the like), the UE can trigger an alternative connectivity technology such as 2G, 3G, 4G, or Wi-Fi radio technologies. This provides a fall back connectivity for the UE. Other scheme to trigger the fall back connectivity is also possible, such as the scenario detection function determines that the scenario detected requires the fall back connectivity.
  • a performance requirement e.g. RSRP, SINR or the like
  • an improved beam codebook can be learned based on real-life user data via an on-line beam codebook learning framework.
  • UE measurement data or UE beam data analytics can be collected (in the background) from active user devices and uploaded (e.g. via tunneling) to a cloud control center or a UE beam codebook learning unit, where new improved beam codebook can be learned, redesigned, or fine-tuned.
  • the new UE beam codebook is then pushed back to users' devices for improved beamforming performance.
  • FIGURE 28 illustrates an example UE beam codebook learning 2800 based on data analytics according to embodiments of the present disclosure.
  • the embodiment of the UE beam codebook learning 2800 illustrated in FIGURE 28 is for illustration only.
  • FIGURE 28 does not limit the scope of this disclosure to any particular implementation.
  • the UE beam learning unit can also be located at the edge (wireless network base stations).
  • the raw UE beam data i.e. beam identity that is selected at a given time
  • the UE beam data are first processed on the terminals to extract certain features or statistics, which are then sent, typically with significantly less amount of data size than the raw data size, to the UE beam codebook learning unit for further processing.
  • An example of the processed data at terminal is the statistics of UE beam usage rate, i.e. the percentage of time a UE beam is utilized for wireless connection.
  • the UE beams can be indexed to indicate identity of the beam.
  • the UE beam indexing is performed over all beams of the UE.
  • the UE beam indexing is perform per antenna module, in which case the antenna module index may be needed to uniquely identify the beam.
  • the beam identity and the corresponding beam usage rate can be sent to the UE beam codebook learning unit.
  • Other examples are the beam searching latency and the rate of occurrence of beam misalignment event.
  • One or more of these beam data can be collected and sent to the UE beam codebook learning unit.
  • FIGURE 29 illustrates an example UE beam data analytics module 2900 on terminal according to embodiments of the present disclosure.
  • the embodiment of the UE beam data analytics module 2900 illustrated in FIGURE 29 is for illustration only.
  • FIGURE 29 does not limit the scope of this disclosure to any particular implementation.
  • FIGURE 30 illustrates another example UE beam data analytics module 3000 on terminal according to embodiments of the present disclosure.
  • the embodiment of the UE beam data analytics module 3000 illustrated in FIGURE 30 is for illustration only.
  • FIGURE 30 does not limit the scope of this disclosure to any particular implementation.
  • contextual information examples include the UE location information (e.g. obtained from the GPS module), the sensor data on the terminal (e.g. gyroscope, accelerometer, inertial measurement unit (IMU)), the device model and software version.
  • the UE location information e.g. obtained from the GPS module
  • the sensor data on the terminal e.g. gyroscope, accelerometer, inertial measurement unit (IMU)
  • the device model and software version e.g. obtained from the GPS module
  • the sensor data on the terminal e.g. gyroscope, accelerometer, inertial measurement unit (IMU)
  • IMU inertial measurement unit
  • FIGURE 29 and FIGURE 30 Some examples of the UE beam data analytics modules are illustrated in FIGURE 29 and FIGURE 30.
  • the scenario detection module can be the same as the scenario detection module in FIGURE 26.
  • the UE beam learning unit can either produce a revised beam codebook or a revised set of codebooks for UEs.
  • the codebook(s) can be revised in a dedicated manner for each individual UE.
  • the codebook(s) can also be common (or have strong correlation) for a group of UEs that fit the same contextual profile, e.g. the codebook is common (or have strong correlation) for all UEs of the same hardware model, or the codebook is common (or have strong correlation) for all UEs in the same geographical area.
  • the UE beam data analytics module can compare the real-life performance of the new beam codebook with that of the original beam codebook.
  • One or more performance metrics can be compared, e.g. the beam usage rate, the beam search latency and the occurrence rate of the beam failure event. If the performance is worse in one or more metrics than the original beam codebook, the module can revert back to the original codebook and provide the new performance information to the UE beam learning unit. This function can also be performed by a different module than the UE beam data analytics module.
  • FIGURE 31 illustrates an example UE beam data analytics circuit 3100 with other beam management blocks on the terminal according to embodiments of the present disclosure.
  • the embodiment of the UE beam data analytics module 3100 illustrated in FIGURE 31 is for illustration only.
  • FIGURE 31 does not limit the scope of this disclosure to any particular implementation.
  • the UE beam data analytic circuit 3100 comprises a CB set block 3102, a scenario detection block 3104, a CB selection block 3106, and a UE beam data analytic block 3108.
  • the CB set block 3102 is connected to the CB selection block 3106 and receives new codebook(s) from the UE beam analytic block 3108.
  • the scenario detection block 3104 is connected to the CB selection block 3106.
  • the CB selection block 3106 generates a selected CB that is sent to the UE beam data analytic module 3108.
  • the UE beam data analytic block 3108 receives other contextual information, other beam related information from a modem and/or RF circuit, and new codebook(s).
  • the UE beam data analytic block 3108 generates data analytics to a UE beam learning circuit.
  • FIGURE 32 illustrates an example procedure with UE beam data analytics module 3200 according to embodiments of the present disclosure.
  • the embodiment of the procedures with UE beam data analytics module 3200 illustrated in FIGURE 32 is for illustration only.
  • FIGURE 32 does not limit the scope of this disclosure to any particular implementation.
  • a UE beam data analytic module receives information from beam codebook selection module sensors.
  • the UE beam data analytics module generates UE date analytic information and sends to the UE beam learning units.
  • a UE beam data analytics module receives information from the UE beam learning unit.
  • the UE beam data analytics module sends codebook information to terminal codebook database.
  • FIGURE 31 An illustration of the UE beam data analytics module and the other functional blocks for a multi-codebook beam management system is shown in FIGURE 31. Example procedures performed by the UE beam data analytics module is given in FIGURE 32.
  • FIGURE 33 illustrates an example UE beam data analytics circuit 3300 according to embodiments of the present disclosure.
  • the embodiment of the UE beam data analytics module 3300 illustrated in FIGURE 33 is for illustration only.
  • FIGURE 33 does not limit the scope of this disclosure to any particular implementation.
  • the UE beam data analytic circuit 3300 comprises a CB set block 3302, a scenario detection block 3304, a CB selection block 3306, and a UE beam data analytic block 3308.
  • the CB set block 3302 is connected to the CB selection block 3306 and receives new codebook(s) from the UE beam analytic block 3308.
  • the scenario detection block 3304 is connected to the CB selection block 3306.
  • the CB selection block 3306 generates a selected CB that is sent to the UE beam data analytic module 3308.
  • the UE beam data analytic block 3308 receives other contextual information and other beam related information from a modem and/or an RF circuit.
  • FIGURE 34 illustrates a flow chart of a method 3400 for UE beam data analytics module according to embodiments of the present disclosure.
  • the embodiment of the method 3400 illustrated in FIGURE 34 is for illustration only.
  • FIGURE 34 does not limit the scope of this disclosure to any particular implementation.
  • the beam learning unit is also located in the UE beam data analytics module on the terminal.
  • An illustration is given in FIGURE 33.
  • the aspects mentioned for the previous embodiment is also applicable in this case, except that the new codebook is generated within UE beam data analytics module as well.
  • An example procedure is given in FIGURE 34.
  • the option of user consent can be provided on a user interface of the mobile terminal.
  • the option of user consent can be provided in the “connection” setting on the terminal, for “5G mmWave beam learning and update.” Other locations are not precluded. If the “5G mmWave beam learning and update” option is turned on, the user's beam data analytics are collected and the beam codebook update is performed, else the user's beam data analytics are not collected and the beam codebook update is not performed.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
PCT/KR2019/006321 2018-05-25 2019-05-27 Methods of beam codebook generation for 5g terminals WO2019226028A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP19807907.1A EP3785377A4 (en) 2018-05-25 2019-05-27 METHOD OF GENERATING A RADIATION CODE BOOK FOR 5G TERMINALS
CN201980029827.6A CN112075033B (zh) 2018-05-25 2019-05-27 5g终端的波束码本生成方法

Applications Claiming Priority (10)

Application Number Priority Date Filing Date Title
US201862676718P 2018-05-25 2018-05-25
US62/676,718 2018-05-25
US201862716597P 2018-08-09 2018-08-09
US62/716,597 2018-08-09
US201862740564P 2018-10-03 2018-10-03
US62/740,564 2018-10-03
US201862742035P 2018-10-05 2018-10-05
US62/742,035 2018-10-05
US16/224,531 US10735066B2 (en) 2017-12-22 2018-12-18 Methods of beam codebook generation for the 5G terminals
US16/224,531 2018-12-18

Publications (1)

Publication Number Publication Date
WO2019226028A1 true WO2019226028A1 (en) 2019-11-28

Family

ID=68617340

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2019/006321 WO2019226028A1 (en) 2018-05-25 2019-05-27 Methods of beam codebook generation for 5g terminals

Country Status (3)

Country Link
EP (1) EP3785377A4 (zh)
CN (1) CN112075033B (zh)
WO (1) WO2019226028A1 (zh)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022235288A1 (en) * 2021-05-06 2022-11-10 Qualcomm Incorporated A divergence statistical approach for narrow beam-based channel access
CN115499045A (zh) * 2022-08-22 2022-12-20 中国电信股份有限公司 一种波束搜索系统、方法、装置、电子设备及存储介质
US20230170976A1 (en) * 2021-11-30 2023-06-01 Qualcomm Incorporated Beam selection and codebook learning based on xr perception
US11973558B2 (en) * 2021-09-27 2024-04-30 Qualcomm Incorporated Narrow beam-based channel access

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113382418B (zh) * 2021-06-09 2023-03-14 上海移远通信技术股份有限公司 波束码本生成方法及装置、移动终端和存储介质
CN115549849A (zh) * 2021-06-29 2022-12-30 华为技术有限公司 数据处理方法及装置

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110164696A1 (en) 2010-01-04 2011-07-07 Choi Junil Multiple-input multiple-output (mimo) communication system using a codebook and method of designing the codebook
US20130058424A1 (en) * 2010-04-06 2013-03-07 Nokia Corporation Codebook Design and Structure for Multi-Granular Feedback
JP2014513482A (ja) * 2011-04-28 2014-05-29 アルカテル−ルーセント ネットワーク・デバイスにおいてコードブックおよび関連データを生成するための方法および装置
US20150092878A1 (en) * 2008-04-29 2015-04-02 Apple Inc. Codebook Subset Selection
WO2017003252A1 (ko) 2015-07-01 2017-01-05 엘지전자 주식회사 다중 안테나 무선 통신 시스템에서 코드북 구성 방법 및 이를 위한 장치
EP3293890A1 (en) 2016-09-12 2018-03-14 Intel IP Corporation Mobile communication device and method for selecting a beam direction for an antenna
US20180102817A1 (en) * 2015-04-10 2018-04-12 Lg Electronics Inc. Method for reporting channel state information in wireless communication system and device therefor

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101622797A (zh) * 2007-04-26 2010-01-06 三星电子株式会社 无线通信系统中的传输分集
US8644409B2 (en) * 2009-02-11 2014-02-04 Qualcomm Incorporated Method and apparatus for modulation and layer mapping in a wireless communication system
KR20130020102A (ko) * 2011-08-19 2013-02-27 삼성전자주식회사 다중 송/수신 페어들과 다수의 안테나들을 포함하는 릴레이를 포함하는 네트워크에서의 릴레이와 단말 및 그 통신 방법
US20140198868A1 (en) * 2013-01-17 2014-07-17 Nokia Solutions And Networks Oy DL MIMO Precoding Enhancement
CN105144600B (zh) * 2013-05-31 2018-11-02 英特尔Ip公司 用于大型天线阵列的混合数字和模拟波束成形
KR102258289B1 (ko) * 2014-05-22 2021-05-31 삼성전자 주식회사 이차원 배열 안테나를 사용하는 이동통신 시스템에서의 채널 피드백의 생성 및 전송 방법 및 장치
WO2016051792A1 (en) * 2014-10-01 2016-04-07 Nec Corporation Method and system for mimo communication
WO2017196098A1 (ko) * 2016-05-11 2017-11-16 엘지전자(주) 다중 안테나 무선 통신 시스템에서 채널 상태 정보 송수신 방법 및 이를 위한 장치
EP3455950B1 (en) * 2016-05-13 2023-08-23 Apple Inc. Evolved node-b (enb), user equipment (ue) and methods for adaptive beamforming and channel state information (csi) reporting
CN107864000B (zh) * 2017-11-22 2020-12-25 重庆邮电大学 基于用户分布密度匹配的3d mimo码本生成方法

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150092878A1 (en) * 2008-04-29 2015-04-02 Apple Inc. Codebook Subset Selection
US20110164696A1 (en) 2010-01-04 2011-07-07 Choi Junil Multiple-input multiple-output (mimo) communication system using a codebook and method of designing the codebook
US20130058424A1 (en) * 2010-04-06 2013-03-07 Nokia Corporation Codebook Design and Structure for Multi-Granular Feedback
JP2014513482A (ja) * 2011-04-28 2014-05-29 アルカテル−ルーセント ネットワーク・デバイスにおいてコードブックおよび関連データを生成するための方法および装置
US20180102817A1 (en) * 2015-04-10 2018-04-12 Lg Electronics Inc. Method for reporting channel state information in wireless communication system and device therefor
WO2017003252A1 (ko) 2015-07-01 2017-01-05 엘지전자 주식회사 다중 안테나 무선 통신 시스템에서 코드북 구성 방법 및 이를 위한 장치
EP3293890A1 (en) 2016-09-12 2018-03-14 Intel IP Corporation Mobile communication device and method for selecting a beam direction for an antenna

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3785377A4

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022235288A1 (en) * 2021-05-06 2022-11-10 Qualcomm Incorporated A divergence statistical approach for narrow beam-based channel access
US11973558B2 (en) * 2021-09-27 2024-04-30 Qualcomm Incorporated Narrow beam-based channel access
US20230170976A1 (en) * 2021-11-30 2023-06-01 Qualcomm Incorporated Beam selection and codebook learning based on xr perception
US12068832B2 (en) * 2021-11-30 2024-08-20 Qualcomm Incorporated Beam selection and codebook learning based on XR perception
CN115499045A (zh) * 2022-08-22 2022-12-20 中国电信股份有限公司 一种波束搜索系统、方法、装置、电子设备及存储介质
CN115499045B (zh) * 2022-08-22 2024-04-30 中国电信股份有限公司 一种波束搜索系统、方法、装置、电子设备及存储介质

Also Published As

Publication number Publication date
EP3785377A4 (en) 2021-06-23
CN112075033A (zh) 2020-12-11
EP3785377A1 (en) 2021-03-03
CN112075033B (zh) 2024-02-09

Similar Documents

Publication Publication Date Title
WO2020141951A1 (en) Method and apparatus for interference measurement in wireless communication system
WO2020091536A1 (en) Method and apparatus for channel and interference measurement and reporting
WO2021118326A1 (en) Method and apparatus for group-based multi-beam operation in a wireless communication system
WO2019226028A1 (en) Methods of beam codebook generation for 5g terminals
WO2018174695A1 (en) Method and apparatus for channel state information reference signal(csi-rs)
WO2021101191A1 (en) Method and apparatus for beam management for inter-cell mobility
WO2021080391A1 (en) Method and apparatus for antenna parameter configuration for cellular communication systems
WO2018038517A1 (ko) 다수의 배열 안테나를 사용하는 이동통신 시스템에서 상향링크 전송을 위한 프리코딩 정보 시그날링 방법 및 장치
WO2019190210A1 (en) Methods of radio front-end beam sweeping for 5g terminals
WO2022108180A1 (en) Method and apparatus for a user equipment sub-chain beam codebook design and operation
WO2019177419A1 (en) Methods of radio front-end beam management for 5g terminals
WO2022030969A1 (en) Method and apparatus for site-specific and dynamic base station beam codebook design
WO2022154600A1 (en) Method and apparatus for configuring and determining default beams in a wireless communication system
WO2019031953A1 (en) METHOD AND APPARATUS FOR CHANNEL QUALITY INDICATOR (CQI) REPORT AND CHANNEL STATUS INFORMATION (CSI)
WO2019240446A1 (en) Methods for terminal-specific beamforming adaptation for advanced wireless systems
WO2023277655A1 (en) Method and apparatus for wireless communication using beamforming
WO2022177161A1 (en) Multiple antenna channel tracking under practical impairment
WO2021086075A1 (en) Method and apparatus for indexing of ss/pbch blocks in unlicensed spectrum
WO2023003437A1 (en) Method and apparatus for full-duplex wireless communication systems
WO2021145652A1 (en) Method and apparatus for uplink timing and frequency offset estimation and compensation in a wireless communication system
EP4245082A1 (en) Method and apparatus for beam management after channel setup
WO2024072126A1 (en) Method and apparatus for estimating channel state information in advanced mimo antenna systems for cellular communications
WO2024181769A1 (en) Channel state information reference signals for wireless communications
WO2024096652A1 (en) Method and apparatus for reporting channel state information in advanced mimo antenna systems for cellular communications
WO2024136419A1 (en) Multiple beam operations in wireless communication systems

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19807907

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019807907

Country of ref document: EP

Effective date: 20201123