Method and apparatus in a node for wireless communication

Abstract

The application provides a method and device in a node for wireless communication, the method comprising: a first node receiving first information, the first information being used for generating, downloading or updating a first codebook; and generating, downloading or updating the first codebook based on the first information. The scheme helps to realize updating of a downloadable codebook and improves accuracy of channel state information feedback calculated according to the downloadable codebook when a channel changes.

Description

Technical Field

[0001] This application relates to the field of communication technology, and more specifically, to methods and apparatus in nodes for wireless communication. Background Technology

[0002] In wireless communication systems, how to update the codebook is a technical problem that urgently needs to be solved in this field. Summary of the Invention

[0003] This application provides methods and apparatus for use in nodes for wireless communication. The various aspects covered by this application are described below.

[0004] In a first aspect, a method for use in a first node of wireless communication is provided, applied to the first node, the method comprising: receiving first information, the first information being used to generate, download or update a first codebook; generating, downloading or updating the first codebook based on the first information.

[0005] In this design, the first node receives first information sent by the second node, and generates, downloads, or updates a first codebook based on this first information. Using the codebook update instruction carried in the first information, the first node updates its currently used codebook according to the second node's configuration, ensuring that the updated codebook matches the current channel environment. This avoids channel state information calculations deviating from actual channel conditions due to codebook mismatch, thereby improving the accuracy of channel state information feedback and ultimately helping the second node make more accurate downlink scheduling decisions.

[0006] In one possible design, the first information also indicates at least one of the following: identification information of one or more codebooks, the first codebook, first parameters for generating the first basis vectors of the first codebook, a set of basis vectors for generating the first basis vectors of the first codebook, second basis vectors of the first codebook, a set of basis vectors for generating the second basis vectors of the first codebook, the number of ports to which the first codebook is applicable, the number of basis vectors of the first codebook, the layer to which the first basis vector and / or the second basis vector belongs, the spatial density of the basis vectors of the first codebook, the precision of the first codebook, the maximum number of layers supported by the first codebook, the type of basis vectors of the first codebook, deleting the second codebook from the first node, or, the update method of the first codebook, the update method including updating all basis vectors or updating some basis vectors, the first codebook containing basis vectors from the above one or more codebooks, limiting the basis vectors contained in the first codebook, and the second codebook being a codebook stored in the first node.

[0007] In this design, the first information module enables multi-dimensional and flexible control over codebook updates through rich configuration parameters. The first node can reuse downloaded basis vectors via codebook identifiers, generate new basis vectors via basis vector parameters, and precisely select target basis vectors from the basis vector set, avoiding resource waste caused by repeatedly downloading existing basis vectors. By limiting the basis vectors included in the first codebook, a subset restriction can be implemented, downloading only the necessary subset of basis vectors, which helps save storage space and download overhead for the first node. The update method indication allows for the selection of updating all or part of the basis vectors, achieving a balance between flexibility and signaling efficiency in codebook updates, thus helping to adapt to differentiated codebook update requirements under different channel environments.

[0008] In one possible design, the first information instructs the first node to download, generate or update a portion of the basis vectors of the first codebook; based on the first information, the first node downloads, generates or updates a portion of the basis vectors of the first codebook.

[0009] In this design, the first information instructs the first node to download, generate, or update only a portion of the basis vectors in the first codebook, rather than replacing the entire codebook. By limiting codebook updates to a subset of basis vectors, the first node only needs to process the changed basis vectors, while the remaining basis vectors remain unchanged. This helps to strike a balance between codebook update flexibility and signaling efficiency, adapting to the differentiated codebook update requirements under different channel environments.

[0010] In one possible design, before receiving the first information, the method further includes sending second information, which is used to determine the first information.

[0011] In this design, the first node proactively sends a second piece of information as auxiliary information before receiving codebook update information. The second node can determine the content of the first information based on the auxiliary information reported by the first node. By reporting its own expectations for the codebook or the current state of the codebook, the first node ensures that the codebook update information sent by the second node reflects the actual needs of the terminal side. This avoids the second node sending codebook configurations that do not match the terminal's needs, thus improving the targeting of codebook updates and consequently increasing codebook update efficiency.

[0012] In one possible design, the second information includes at least one of the following: identification information of the third codebook, the number of layers of the third codebook, the basis vectors of the first direction or the first layer in the third codebook that enhance or restrict it, the basis vector density of the third codebook, the complexity of the third codebook, the precision information of the third codebook (the precision information refers to a high-precision codebook, a low-precision codebook, or the number or spatial density of basis vectors), activation or deactivation of basis vectors in the third codebook, deletion of basis vectors in the third codebook, addition of basis vectors in the third codebook, updating of the third codebook, updating of the spatial basis of the third codebook, channel attribute information, and the third codebook being the codebook requested by the first node.

[0013] In this design, the second information includes a multi-dimensional description of the codebook requirements from the first node: this includes the desired codebook identifier and structural parameters (number of layers, density, complexity, precision), the operational requirements for existing codebook basis vectors (enhancement, restriction, activation, deactivation, deletion, addition, update), and information reflecting the long-term statistical characteristics of the channel, such as channel attribute information. The first node uses this multi-dimensional auxiliary information to enable the second node to fully understand the terminal's codebook requirements. Based on this, the codebook update information generated by the second node is better matched to the current channel conditions and terminal capabilities, facilitating accurate codebook updates.

[0014] In one possible design, the method further includes receiving third information used to activate the first codebook.

[0015] In this design, the first node does not immediately use the codebook to calculate channel state information after generating or updating the first codebook. Instead, it only begins using it after receiving the activation signaling from the second node. By decoupling codebook generation from codebook activation, the second node can control the precise timing of codebook switching. This helps avoid interruptions or decreased accuracy in channel state information calculation caused by improper codebook update timing, ensuring the smoothness of the codebook switching process.

[0016] In one possible design, the first node belongs to a first terminal device group, and the first terminal device group shares the first codebook; the first information is broadcast information or multicast information, and the first information is used to instruct each first node in the first terminal device group to generate, download or update the first codebook based on the first information; and / or, the third information is broadcast information or multicast information, and the third information is used to activate the first codebook of each first node in the first terminal device group.

[0017] In this design, for a first node group sharing the same codebook, the second node sends the same first information to all terminals within the group via broadcast or multicast, and all terminals in the group synchronously generate or update to the same codebook. Furthermore, the second node can also uniformly send a third information via broadcast or multicast to activate the codebook switching of all terminals in the group. Replacing the individual distribution of update information and activation signaling to each terminal with broadcast or multicast significantly reduces the signaling overhead in the codebook update process, which is especially suitable for scenarios with high terminal density. Supporting multicast / broadcast mechanisms for both codebook distribution and activation helps to improve the signaling efficiency of the entire process of group-level codebook management.

[0018] In one possible design, when the first information contains only the current identification information of the first codebook, the identification information of the first codebook after generation, download, or update is the current identification information of the first codebook; or, when the first information contains both the current identification information of the first codebook and new identification information, the identification information of the first codebook after generation, download, or update is the new identification information.

[0019] In this design, the rules for changes in identifier information after codebook generation, download, or update are clarified through the linkage between codebook identifier information and codebook update process. When the first information only contains the current identifier information, the identifier remains the current identifier after codebook generation, download, or update, and the second node and the first node can continue to communicate using the original identifier. When the first information contains both the current identifier and the new identifier information, the second node assigns a new version identifier to the codebook by issuing the new identifier. The second node and the first node can accurately identify the version of the codebook based on this, avoiding codebook mismatch caused by identifier confusion.

[0020] In a second aspect, a method for a second node in wireless communication is provided, applied to the second node, the method comprising: sending first information, the first information being used to generate, download or update a first codebook; the first information being used to instruct the first node to generate, download or update the first codebook based on the first information.

[0021] In this design, the second node sends first information to the first node for generating, downloading or updating the first codebook. By configuring the codebook update information, the first node updates the codebook it is currently using, so that the codebook of the first node matches the current channel environment, which helps to improve the accuracy of channel state information feedback.

[0022] In one possible design, the first information also indicates at least one of the following: identification information of one or more codebooks, the first codebook, first parameters for generating the first basis vectors of the first codebook, a set of basis vectors for generating the first basis vectors of the first codebook, second basis vectors of the first codebook, a set of basis vectors for generating the second basis vectors of the first codebook, the number of ports to which the first codebook is applicable, the number of basis vectors of the first codebook, the layer to which the first basis vector and / or the second basis vector belongs, the spatial density of the basis vectors of the first codebook, the precision of the first codebook, the maximum number of layers supported by the first codebook, the type of basis vectors of the first codebook, deleting the second codebook from the first node, or, the update method of the first codebook, the update method including updating all basis vectors or updating some basis vectors, the first codebook containing basis vectors from the above one or more codebooks, limiting the basis vectors contained in the first codebook, and the second codebook being a codebook stored in the first node.

[0023] In one possible design, the first information instructs the first node to download, generate or update a portion of the basis vectors of the first codebook; based on the first information, the first node downloads, generates or updates a portion of the basis vectors of the first codebook.

[0024] In one possible design, before sending the first information, the method further includes: receiving second information sent by the first node, the second information being used to determine the first information.

[0025] In this design, the second node receives the second information reported by the first node before determining the codebook update information, and generates the first information based on the auxiliary information provided by the terminal. By introducing a terminal assistance mechanism, the codebook update information issued by the second node can reflect the actual needs of the terminal, making the codebook update more targeted and helping to improve the matching degree between the codebook update and the terminal requirements.

[0026] In one possible design, the second information includes at least one of the following: identification information of the third codebook, the number of layers of the third codebook, the basis vectors of the first direction or the first layer in the third codebook that enhance or restrict the third codebook, the basis vector density of the third codebook, the complexity of the third codebook, the precision information of the third codebook, activating or deactivating the basis vectors in the third codebook, deleting the basis vectors in the third codebook, adding the basis vectors in the third codebook, updating the third codebook, updating the spatial basis of the third codebook, channel attribute information, and the third codebook being the codebook requested by the first node.

[0027] In one possible design, the method further includes sending a third message used to activate the first codebook.

[0028] In this design, after the first node generates or updates the first codebook, the second node controls the activation timing of the codebook by sending third information. The second node can flexibly decide when to activate the new codebook based on downlink load, channel conditions, or other scheduling requirements. This avoids unstable channel state information calculation caused by activating the new codebook during periods of drastic fluctuations in channel conditions or peak downlink load, which helps to coordinate codebook switching with network scheduling rhythm, and thus facilitates fine-grained control of codebook switching at the network level.

[0029] In one possible design, the first node belongs to a first terminal device group, and the first terminal device group shares the first codebook; the first information is broadcast information or multicast information, and the first information is used to instruct each first node in the first terminal device group to generate, download or update the first codebook based on the first information; and / or, the third information is broadcast information or multicast information, and the third information is used to activate the first codebook of each first node in the first terminal device group.

[0030] In one possible design, when the first information contains only the current identification information of the first codebook, the identification information of the first codebook after generation, download, or update is the current identification information of the first codebook; or, when the first information contains both the current identification information of the first codebook and new identification information, the identification information of the first codebook after generation, download, or update is the new identification information.

[0031] Thirdly, embodiments of this application provide a first node, including a processor, a memory, and a communication interface. The memory is used to store one or more computer programs, and the processor is used to invoke the computer programs in the memory to cause the first node to perform some or all of the steps described in the method of the first aspect above.

[0032] Fourthly, embodiments of this application provide a second node, including a processor, a memory, and a communication interface. The memory is used to store one or more computer programs, and the processor is used to invoke the computer programs in the memory to cause the second node to perform some or all of the steps described in the method of the second aspect above.

[0033] Fifthly, embodiments of this application provide a communication system that includes the aforementioned communication device. In another possible design, the system may further include other devices that interact with the communication device as described in the embodiments of this application.

[0034] Sixthly, embodiments of this application provide a computer-readable storage medium storing a computer program that causes a computer to perform some or all of the steps in the methods described above.

[0035] In a seventh aspect, embodiments of this application provide a computer program product, wherein the computer program product includes a non-transitory computer-readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of the methods described in the foregoing aspects. In some implementations, the computer program product may be a software installation package.

[0036] Eighthly, embodiments of this application provide a chip including a memory and a processor, the processor being able to call and run a computer program from the memory to implement some or all of the steps described in the methods of the above aspects.

[0037] Ninthly, embodiments of this application provide a chip module including a memory and a processor, the processor being able to call and run a computer program from the memory to implement some or all of the steps described in the methods of the above aspects.

[0038] In a tenth aspect, embodiments of this application provide a communication device, the chip including a memory and a processor, the processor being able to call and run a computer program from the memory to implement some or all of the steps described in the methods of the above aspects.

[0039] In this embodiment, the first node generates, downloads, or updates the codebook based on information sent by the second node, and switches to the new codebook upon receiving an activation signaling. This terminal-assisted closed-loop codebook update process helps achieve flexible and efficient codebook updates, ensuring that the codebook used by the first node matches the current channel environment and improving the accuracy of channel state information feedback. Attached Figure Description

[0040] Figure 1A This is a schematic diagram of the architecture of a communication system provided in an embodiment of this application.

[0041] Figure 1B This is a schematic diagram of the architecture of another communication system provided in an embodiment of this application.

[0042] Figure 1C This is a schematic diagram of the architecture of another communication system provided in an embodiment of this application.

[0043] Figure 2A and Figure 2B This is a schematic diagram of the wireless protocol stack structure provided in an embodiment of this application.

[0044] Figure 3 This is a flowchart illustrating a communication method provided in an embodiment of this application.

[0045] Figure 4This is a schematic diagram of a basis vector constraint method provided in an embodiment of this application.

[0046] Figure 5 This is a schematic diagram of another basis vector constraint method provided in an embodiment of this application.

[0047] Figure 6 This is a schematic diagram of the structure of a terminal device provided in another embodiment of this application.

[0048] Figure 7 This is a schematic diagram of the structure of a network device provided in another embodiment of this application.

[0049] Figure 8 This is a schematic diagram of the structure of a communication device provided in another embodiment of this application.

[0050] Figure 9 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Detailed Implementation

[0051] Communication system architecture The technical solutions of this application embodiment can be applied to various communication systems, such as: Global System for Mobile Communication (GSM) system, Code Division Multiple Access (CDMA) system, Wideband Code Division Multiple Access (WCDMA) system, General Packet Radio Service (GPRS), Long Term Evolution (LTE) system, Advanced Long Term Evolution (LTE-A) system, New Radio (NR) system, evolution of NR system, LTE-based access to unlicensed spectrum (LTE-U) system, NR-based access to unlicensed spectrum (NR-U) system, non-terrestrial network (NTN) system, Universal Mobile Telecommunication System (UMTS), Wireless Local Area Networks (WLAN), and Wireless Fidelity (WF). Fidelity (WiFi), 5th-generation (5G) communication systems or other communication systems, such as future communication systems, such as 6th-generation mobile communication systems, or satellite communication systems.

[0052] Traditional communication systems typically support a limited number of connections and are easy to implement. However, with the development of communication technology, mobile communication systems will not only support traditional communication but also, for example, device-to-device (D2D) communication, machine-to-machine (M2M) communication, machine-type communication (MTC), vehicle-to-vehicle (V2V) communication, or vehicle-to-everything (V2X) communication. The embodiments of this application can also be applied to these communication systems.

[0053] The communication system in this application embodiment can be applied to carrier aggregation (CA) scenarios, dual connectivity (DC) scenarios, and standalone (SA) network deployment scenarios.

[0054] The communication system in this application embodiment can be applied to unlicensed spectrum, which can also be considered as shared spectrum; or, the communication system in this application embodiment can also be applied to licensed spectrum, which can also be considered as dedicated spectrum.

[0055] The embodiments of this application can be applied to non-terrestrial network (NTN) systems as well as terrestrial network (TN) systems. By way of example and not limitation, NTN systems include NR-based NTN systems and IoT-based NTN systems.

[0056] This application describes various embodiments in conjunction with network devices and terminal devices. The terminal device may also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station (MS), mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user equipment, etc.

[0057] In the embodiments of this application, the terminal device may be a station (ST) in a WLAN, a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA) device, a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, a vehicle, an in-vehicle device, a wearable device, a terminal device in a next-generation communication system such as an NR network, or a terminal device in a future evolved public land mobile network (PLMN) network, etc.

[0058] In the embodiments of this application, the terminal device can be a device that provides voice and / or data connectivity to a user, and can be used to connect people, objects, and machines, such as handheld devices with wireless connectivity, in-vehicle devices, etc. The terminal device in the embodiments of this application can be a mobile phone, tablet computer, laptop computer, PDA, mobile internet device (MID), wearable device, virtual reality (VR) device, augmented reality (AR) device, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc. Optionally, the terminal device can be used to act as a base station. For example, the terminal device can act as a scheduling entity, providing sidelink signals between terminal devices in V2X or D2D, etc. For example, cellular phones and cars communicate with each other using sidelink signals. Cellular phones and smart home devices can communicate without relaying communication signals through base stations.

[0059] In the embodiments of this application, the terminal device can be deployed on land, including indoor or outdoor, handheld, wearable or vehicle-mounted; it can also be deployed on water (such as ships); and it can also be deployed in the air (such as airplanes, balloons and satellites).

[0060] In the embodiments of this application, the terminal device may be a mobile phone, tablet computer, computer with wireless transceiver capabilities, virtual reality (VR) terminal device, augmented reality (AR) terminal device, wireless terminal device in industrial control, wireless terminal device in self-driving, wireless terminal device in remote medical care, wireless terminal device in smart grid, wireless terminal device in transportation safety, wireless terminal device in smart city, or wireless terminal device in smart home, etc. The terminal device involved in the embodiments of this application may also be referred to as a terminal, user equipment, access terminal device, vehicle-mounted terminal, industrial control terminal, UE unit, UE station, mobile station, mobile station, remote station, remote terminal device, mobile device, UE, wireless communication device, UE agent, or UE device, etc. The terminal device may also be fixed or mobile.

[0061] By way of example and not limitation, in this embodiment, the terminal device can also be a wearable device. Wearable devices, also known as wearable smart devices, are a general term for devices that utilize wearable technology to intelligently design and develop everyday wearables, such as glasses, gloves, watches, clothing, and shoes. Wearable devices are portable devices that are worn directly on the body or integrated into the user's clothing or accessories. Wearable devices are not merely hardware devices, but also achieve powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include those that are feature-rich, large in size, and can achieve complete or partial functions without relying on a smartphone, such as smartwatches or smart glasses, as well as those that focus on a specific type of application function and require the use of other devices such as smartphones, such as various smart bracelets and smart jewelry for vital sign monitoring.

[0062] The network device in this application embodiment can be a device for communicating with a terminal device. This network device can also be called an access network device or a wireless access network device, such as a base station. In this application embodiment, the network device can refer to a radio access network (RAN) node (or device) that connects the terminal device to the wireless network. A base station can broadly encompass, or be replaced by, various names including: NodeB, evolved NodeB (eNB), next-generation NodeB (gNB), relay station, transmitting and receiving point (TRP), transmitting point (TP), master MeNB, secondary SeNB, multi-mode radio (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. A base station can be a macro base station, micro base station, relay node, donor node, or a combination thereof. A base station can also refer to a communication module, modem, or chip installed within the aforementioned equipment or apparatus. Base stations can also be mobile switching centers, devices that perform base station functions in device-to-device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, network-side devices in 6G networks, and devices that perform base station functions in future communication systems. Base stations can support networks using the same or different access technologies. The embodiments of this application do not limit the specific technologies or device forms used in the network equipment.

[0063] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move depending on the location of the mobile base station. In other examples, a helicopter or drone can be configured as a device to communicate with another base station.

[0064] In some deployments, the network device in this application embodiment may refer to a CU or a DU, or the network device may include both a CU and a DU. The gNB may also include an AAU.

[0065] Network devices and terminal devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can also be deployed in the air on airplanes, balloons, and satellites. This application does not limit the scenario in which the network devices and terminal devices are located.

[0066] By way of example and not limitation, in the embodiments of this application, the network device may have mobility characteristics; for example, the network device may be a mobile device. In some embodiments of this application, the network device may be a satellite or a balloon station. For example, the satellite may be a low Earth orbit (LEO) satellite, a medium Earth orbit (MEO) satellite, a geostationary earth orbit (GEO) satellite, a highly elliptical orbit (HEO) satellite, etc. In some embodiments of this application, the network device may also be a base station located on land, water, or other similar locations.

[0067] In this embodiment of the application, the network device can provide services for a cell. The terminal device communicates with the network device through the transmission resources (e.g., frequency domain resources, or spectrum resources) used by the cell. The cell can be the cell corresponding to the network device (e.g., a base station). The cell can belong to a macro base station or to a base station corresponding to a small cell. The small cell here can include: metro cell, micro cell, pico cell, femto cell, etc. These small cells have the characteristics of small coverage area and low transmission power, and are suitable for providing high-speed data transmission services.

[0068] For example, Figure 1A This is a schematic diagram of the architecture of a communication system provided in an embodiment of this application. Figure 1A As shown, the communication system 100 may include a network device 110, which may be a device that communicates with a terminal device 120 (or a communication terminal, terminal). The network device 110 can provide communication coverage for a specific geographical area and can communicate with terminal devices located within that coverage area.

[0069] Figure 1A An exemplary diagram shows a network device and two terminal devices. In some embodiments of this application, the communication system 100 may include multiple network devices and each network device may include other numbers of terminal devices within its coverage area. This application does not limit the scope of the embodiments.

[0070] For example, Figure 1B This is a schematic diagram of the architecture of another communication system provided in an embodiment of this application. Please refer to... Figure 1B This includes terminal device 1101 and satellite 1102, which can communicate wirelessly. The network formed between terminal device 1101 and satellite 1102 can also be called an NTN. Figure 1B In the architecture of the communication system shown, satellite 1102 can function as a base station, and terminal device 1101 and satellite 1102 can communicate directly. In this system architecture, satellite 1102 can be referred to as a network device. In some embodiments of this application, the communication system may include multiple network devices 1102, and the coverage area of ​​each network device 1102 may include other numbers of terminal devices; this application does not limit this aspect.

[0071] For example, Figure 1C This is a schematic diagram of the architecture of another communication system provided in an embodiment of this application. Please refer to... Figure 1C The network includes terminal device 1201, satellite 1202, and base station 1203. Terminal device 1201 and satellite 1202 can communicate wirelessly, and satellite 1202 can communicate with base station 1203. The network formed by terminal device 1201, satellite 1202, and base station 1203 can also be called an NTN. Figure 1C In the architecture of the communication system shown, satellite 1202 may not function as a base station, and communication between terminal device 1201 and base station 1203 requires relay through satellite 1202. In this system architecture, base station 1203 can be referred to as a network device. In some embodiments of this application, the communication system may include multiple network devices 1203, and the coverage area of ​​each network device 1203 may include other numbers of terminal devices; this application does not limit this aspect.

[0072] It should be noted that, Figures 1A-1C This application is merely an example illustrating the system to which this application applies. Of course, the methods shown in the embodiments of this application can also be applied to other systems, such as 5G communication systems, LTE communication systems, etc. This application does not specifically limit these systems.

[0073] In some embodiments of this application, Figures 1A-1C The wireless communication system shown may also include other network entities such as a mobility management entity (MME) and an access and mobility management function (AMF), but this application does not limit this.

[0074] It should be understood that devices with communication functions in the network / system of this application embodiment can be referred to as communication devices. Figure 1A Taking the communication system 100 shown as an example, the communication equipment may include a network device 110 and a terminal device 120 with communication functions. The network device 110 and the terminal device 120 may be the specific devices described above, which will not be repeated here. The communication equipment may also include other devices in the communication system 100, such as network controllers, mobility management entities and other network entities. This application embodiment does not limit this.

[0075] Wireless Protocol Stack Figure 2A and Figure 2B The following are schematic diagrams of the wireless protocol stack structure of one embodiment of this application. Figure 2A and Figure 2B This introduction uses the 5G wireless protocol stack as an example. The 5G wireless protocol stack is divided into two planes: the user plane (UP) protocol stack and the control plane (CP) protocol stack. The user plane protocol stack contains the protocol suite used for user data transmission, while the control plane protocol stack contains the protocol suite used for control signaling transmission in the 5G system. The specific names of each protocol stack layer are as follows: like Figure 2A As shown, the user plane protocol stack distributed across the UE and gNB includes, from top to bottom: Service Data Adaptation Protocol (SDAP) layer, Packet Data Convergence Protocol (PDCP) layer, Radio Link Control (RLC) layer, Medium Access Control (MAC) layer, and Physical (PHY) layer. The SDAP layer is optional and is not present in LTE.

[0076] like Figure 2BAs shown, the control plane protocol stack involving the UE, gNB, and AMF, from top to bottom, includes: the non-access stratum (NAS); radio resource control (RRC) layer, PDCP layer, RLC layer, MAC layer, and PHY layer. It should be understood that the different layers in the above protocol stack are distributed across the UE, gNB, and AMF, each with different functions. Through inter-layer interactions between the UE and gNB, and between the gNB and AMF, they jointly realize the communication functions between terminal devices and network devices. With the development of artificial intelligence technology, AI-assisted computing functions have permeated the above-mentioned protocol stack processing implementation methods distributed across the UE, gNB, and AMF. For example, the MAC layer scheduling algorithm on the gNB side, and the PHY layer encoding / decoding algorithm between the UE and gNB sides, can all utilize AI algorithms to improve communication algorithm performance.

[0077] As an example, Figure 2A and Figure 2B The wireless protocol architecture described herein is applicable to the first node in this application.

[0078] As an example, Figure 2A and Figure 2B The wireless protocol architecture described herein is applicable to the second node in this application.

[0079] It should be understood that some functionalities in a wireless protocol architecture can also be implemented in one or more devices. For example, the functions of different layers in the control plane protocol stack can be implemented by multiple nodes on the network side.

[0080] It should be understood that the interpretation of the terminology in the embodiments of this application may refer to the TS36, TS37 and TS38 series of specifications of the 3rd generation partnership project (3GPP), but may also refer to the specifications of the Institute of Electrical and Electronics Engineers (IEEE).

[0081] To facilitate understanding, some related technical knowledge involved in the embodiments of this application is first introduced. The following related technologies are optional solutions and can be arbitrarily combined with the technical solutions of the embodiments of this application, all of which fall within the protection scope of the embodiments of this application. The embodiments of this application include at least some of the following contents.

[0082] In the aforementioned communication system, the terminal device reports channel state information to the network device via a wireless link, and the network device performs downlink scheduling based on the channel state information reported by the terminal device. The accuracy of the channel state information feedback directly affects the transmission performance of the communication system. To support multi-antenna transmission technology, the terminal device needs to calculate and report a precoding matrix indicator (PMI) based on a codebook. The codebook defines a set of available precoding vectors. The terminal device selects the precoding vector that best matches the current channel conditions from the codebook and reports the corresponding PMI to the network device. The network device performs downlink data scheduling and beamforming based on the PMI reported by the terminal device.

[0083] Currently, both Type I and Type II codebooks used in 5G systems are of fixed design, with the codebooks already written into the terminal device's storage at the factory. The PMI generated based on the Type I codebook selects basis vectors from a spatial domain basis set, while the PMI generated based on the Type II codebook selects basis vectors jointly from both the spatial and frequency domain basis sets. In next-generation communication systems such as 6G, the maximum downlink bandwidth may reach 400MHz, and the number of ports may support 256 or 512, resulting in a significant overhead for terminal devices to calculate channel state information. To reduce the overhead of terminal devices calculating channel state information, 3GPP is currently discussing a downloadable codebook scheme, whereby the terminal device downloads the codebook from the network equipment and calculates and reports channel state information based on this downloadable codebook.

[0084] Downloadable codebooks are designed for specific scenarios, and their basis vector composition typically only covers a portion of the entire possible set of spatial basis vectors. For example, a downloadable codebook may be constructed by selecting a subset of basis vectors from the spatial basis vector set, or by jointly selecting a subset of basis vectors from both the spatial and frequency domain basis vector sets. Therefore, it is only applicable to specific channel environments. When the wireless environment changes or the terminal device's state changes (e.g., a change in movement speed), the currently downloaded codebook may no longer match the current channel conditions, requiring an update. However, those skilled in the art have not provided specific technical solutions for how to update the downloadable codebook and how network devices determine the codebook update content to be sent to the terminal device.

[0085] This application proposes one or more embodiments, which can respectively solve one or more of the following technical problems: 1. The downloadable codebook only covers a portion of the basis vectors and is only applicable to specific channel environments. When the wireless environment or terminal status changes, the current codebook may no longer match the channel conditions. This application achieves dynamic generation and updating of the codebook by having the terminal receive the first information sent by the base station and generate the first codebook based on the first information, thus solving the problem of the terminal obtaining an applicable codebook when the environment changes.

[0086] 2. How does the base station determine the codebook update content that needs to be sent to the terminal? This application uses the first information to indicate the codebook's basis vector parameters, basis vector source, precision, number of layers, number of ports, and other codebook components, enabling the base station to flexibly control the structure and content of the codebook and achieve accurate determination of the codebook update content.

[0087] Figure 3 The method illustrated is described from the perspective of interaction between the first node and the second node. In some embodiments, the first node can be any type of terminal device mentioned above. The UE is often used as an example of the first node in the following description. In some embodiments, the second node can include an access network device, such as a base station (also known as a terrestrial base station) or a satellite device deploying a base station. The base station is often used as an example of the second node in the following description. In other embodiments, the second node can be a core network element, such as an MME or AMF element. Of course, the second node can also be a gateway device, such as a gateway or a user plane function (UPF) gateway (SGW). The gateway device can be, for example, a call session control function (CSCF) entity.

[0088] Figure 3 The communication process shown includes S301 and S302.

[0089] S301, the second node sends first information to the first node. This first information is used to generate, download, or update the first codebook. Correspondingly, the first node receives the first information sent by the second node.

[0090] The first information can be sent from the second node to the first node via radio resource control (RRC) signaling or media access control (MAC) control element (CE).

[0091] In some implementations, the first node already has a first codebook. After receiving the first information, the first node updates the existing first codebook (or the original first codebook). For ease of description, the updated codebook is still referred to as the first codebook in this embodiment.

[0092] In some implementations, generating the first codebook means that the first node constructs and forms the first codebook locally based on the first information; downloading the first codebook means that the first node obtains the first codebook or a portion of the first codebook from the second node and stores it locally; updating the first codebook means that the first node adds, deletes, replaces, or reconfigures the basis vectors in the stored first codebook based on the first information. These three methods can be used individually or in combination, and this application embodiment does not limit this usage.

[0093] In some implementations, the first information may include at least one of the following: (1) Identification information of one or more codebooks, each identification information corresponding to a codebook that the first node has previously downloaded and stored locally. The first information, by carrying the identification information of the downloaded codebook, instructs the first node to read the corresponding basis vector from the locally stored codebook according to the identification information, in order to construct the first codebook. For example, the second node has previously sent multiple codebooks, such as the first downloadable codebook and the second downloadable codebook, to the first node, which stores them locally. The first information contains the identification of the first downloadable codebook, and the first node reads the basis vector of the first downloadable codebook from the local storage according to the identification, so as to construct the first codebook according to the basis vector.

[0094] In some implementations, the rules governing the changes in the identification information of the first codebook after downloading, generating, or updating the first codebook are related to the content of the first information. When the first information only contains the current identification information of the first codebook, after downloading, generating, or updating the first codebook, the identification information of the first codebook remains the current identification information, and the first node and the second node communicate using the original identification. When the first information contains both the current identification information of the first codebook and new identification information, after downloading, generating, or updating the first codebook, the identification information of the first codebook becomes the new identification information. The new identification information is allocated by the second node in the first information, and the first node and the second node identify the version of the codebook accordingly.

[0095] For example, the current identifier information of the first codebook is ID1. In the first case, the second node includes only ID1 in the first information, instructing the first node to update the first codebook. After the first node updates the first codebook, the identifier information of the first codebook remains ID1. In the second case, the second node includes both ID1 and the new identifier information ID2 in the first information, instructing the first node to update the first codebook. After the first node updates the first codebook, the identifier information of the first codebook is updated to ID2, and subsequently, the first node and the second node use ID2 to identify the codebook for communication.

[0096] In some implementations, the new identification information can also be included in the information required for updating the first codebook as indicated by the first information. After receiving the first information, the first node sends an acknowledgment to the second node, then begins downloading the information required for updating the first codebook. Upon completion of the download, it obtains the new identification information, and updates the identification information of the first codebook to this new information. For example, the second node indicates in the first information that the first codebook needs updating and assigns a new identification information ID2 in the subsequently downloaded information. After the first node confirms receipt and completes the download, it obtains ID2, and the identification information of the first codebook is updated to ID2. Subsequently, the first and second nodes use ID2 to identify the codebook for communication. Through the linkage between the identification information and the codebook update process, the second and first nodes can accurately identify the codebook version, ensuring that both parties use the same identifier for communication before and after the codebook update. For example, ID2 is included in the first information, and the updated codebook is used after the first node confirms receipt and download completion; this updated codebook is identified as ID2.

[0097] In some implementations, the identification information of the first codebook is updated as the basis vectors in the first codebook change. For example, when the first node adds, deletes, or replaces basis vectors in the original first codebook based on the first information, the identification information of the first codebook is updated to the new identification information. As an example, the new identification information is included in the first information, that is, the second node assigns a new identifier to the updated first codebook. As another example, the new identification information is generated autonomously by the first node according to the update situation, such as the first node adding a prefix or appending an identifier suffix to the original identifier. For example, if the original identifier is ID1, after the update, the first node updates the identifier to ID1_001, indicating that the codebook corresponding to this identifier has undergone its first update. When new identification information is generated autonomously by the first node, there are two implementation methods: In the first method, after generating new identification information, the first node sends it to the second node, which then records the updated version of the codebook accordingly. In the second method, the second node is configured with the same identification update rules as the first node. Both the first and second nodes autonomously generate and derive the updated identification information according to the same rules, maintaining consistency without additional signaling interaction. By synchronously updating the identification information along with the codebook content, the second and first nodes can accurately identify the codebook version.

[0098] In some implementations, the identification information of the first codebook is globally unique. For example, the identification information is the same in different cells or in different public land mobile networks. For instance, when the first node moves from one cell to another, the second node can identify the codebook that the first node should use based on the unique identifier of the downloadable codebook corresponding to that cell, without having to reissue the same codebook configuration information.

[0099] (2) A first parameter for generating the first basis vector of the first codebook. For example, the first basis vector may be a spatial basis vector, and the first parameter may include the basis vector index, the position of the basis vector in the basis vector set, or basis vector configuration information. Optionally, the first information may also include a basis vector set, from which the first node selects the corresponding basis vector as the first basis vector according to the first parameter. For example, the second node sends a basis vector set containing N spatial basis vectors or a basis vector set containing N frequency domain basis vectors to the first node, and indicates that the first parameter is the index value k. The first node selects the kth spatial basis vector from the basis vector set as the first basis vector, where N is a positive integer.

[0100] (3) The second basis vector itself should be included in the first codebook. For example, the second basis vector can be a frequency domain basis vector, and the second node directly sends the value of the frequency domain basis vector to the first node in the first information. Optionally, the first information may also include a set of basis vectors, and the first node selects the second basis vector from the set of basis vectors.

[0101] (4) The basis vector type of the first codebook, which indicates what type of basis vectors the first codebook uses. For example, the basis vector type includes spatial basis vectors or frequency domain basis vectors.

[0102] (5) One or more of the following: the number of ports applicable to the first codebook, the number of basis vectors, the layer to which the first and / or second basis vectors belong, the spatial density of the basis vectors, the precision, and the maximum number of supported layers. Wherein, the number of ports indicates the number of antenna ports applicable to the first codebook, such as 32 ports or 64 ports; the number of basis vectors indicates the total number of basis vectors contained in the first codebook; the layer to which it belongs indicates which layer of precoding the basis vectors are applied; the spatial density indicates the distribution density of the basis vectors in the spatial dimension, with higher density corresponding to denser basis vector sampling; the precision indicates the distribution density of the basis vectors in the codebook, or the merging method of the codebook's basis vectors, such as a high-precision codebook supporting CSI reporting at layers 1-4, and a low-precision codebook supporting CSI reporting at layers 1-8. Alternatively, refer to the precision of existing codebooks, such as type-I precision or type-II precision.

[0103] (6) Delete the instruction information of the second codebook, which is a codebook stored in the first node that is no longer needed. The first node deletes the second codebook stored locally according to the instruction, thereby freeing up storage space.

[0104] (7) The update method of the first codebook includes updating all basis vectors or updating some basis vectors. Updating all basis vectors means completely replacing all basis vectors of the current codebook with the new set of basis vectors indicated by the first information; updating some basis vectors means only replacing the part of the basis vectors indicated by the first information, while the rest of the basis vectors remain unchanged.

[0105] (8) The first codebook contains indication information of the basis vectors in one or more of the above codebooks. For example, the first information indicates that the basis vectors of the first codebook come from the first downloadable codebook and the second downloadable codebook. The first node extracts the basis vectors from these two codebooks and combines them to form the first codebook, realizing the reuse of basis vectors across codebooks, without the second node having to repeatedly send these basis vectors.

[0106] (9) Restrict the indication information of the basis vectors contained in the first codebook, i.e. codebook subset restriction (CBSR). For example, if a set of basis vectors contains 4 basis vectors {b1,b2,b3,b4}, the CBSR indicates that {b1,b3} is available while {b2,b4} is restricted to be unavailable. The first node only downloads b1 and b3, and does not download b2 and b4, which helps to save the storage space and download overhead of the first node.

[0107] (10) Bitmap. The bitmap corresponds to each basis vector in a set of basis vectors. Each bit in the bitmap indicates whether the corresponding basis vector belongs to the first codebook. For example, the bitmap {0,1,1,0} indicates that the 2nd and 3rd basis vectors belong to the first codebook, while the 1st and 4th basis vectors do not. A value of 1 in the bitmap indicates that the corresponding basis vector is available, and a value of 0 indicates that the corresponding basis vector is restricted to being unavailable. When the codebook is updated, the bitmap only needs to indicate the parts that have changed: the bit corresponding to the newly added basis vector changes from 0 to 1, and the bit corresponding to the basis vector to be deleted changes from 1 to 0, so as to realize the addition, deletion, and modification operations of the codebook basis vectors with compact bit-level overhead.

[0108] In some implementations, the first information directly contains the complete first codebook. The second node sends all the basis vectors of the first codebook as vector values ​​directly to the first node in the first information. The first node directly uses the basis vectors carried in the first information as the basis vector set of the first codebook, without needing to generate the basis vectors itself based on parameters or identifiers.

[0109] In some implementations, the first information instructs the first node to download, generate, or update only a portion of the basis vectors in the first codebook, while leaving the remaining basis vectors unchanged. These partial basis vectors can be basis vectors from certain layers, basis vectors in certain directions, or basis vectors within certain frequency domain ranges. For example, the first information instructs the first node to update only the basis vectors corresponding to the second layer in the first codebook. The first node downloads, generates, or updates the basis vectors of the second layer based on the first information, while the basis vectors of other layers in the first codebook remain unchanged. By updating only the basis vectors, the first node does not need to replace all basis vectors in the codebook, but only processes the changed parts, which helps reduce the signaling overhead and terminal processing burden of codebook updates.

[0110] Optionally, when the first node belongs to the first terminal equipment group and the first terminal equipment group shares the same first codebook, the second node uniformly sends the first information to the first terminal equipment group via broadcast signaling or multicast signaling. Each terminal in the group receives the broadcast or multicast information and synchronously generates, downloads, or updates the first codebook. The first terminal equipment group consists of first nodes sharing the same codebook. The second node can determine whether the current shared codebook is still applicable to the group's terminals based on statistical analysis of the channel state information or codebook monitoring results reported by the terminals within the group. For example, when a preset proportion of terminals in the group report that the current codebook is inapplicable, or when the average channel quality of the terminals in the group is lower than a preset threshold, the second node determines the codebook content to be updated for the first terminal equipment group. The second node can also comprehensively analyze the requirements for codebook structure, basis vectors, accuracy, etc., in the second information (auxiliary information) reported by each terminal in the group, and select a codebook configuration applicable to most terminals in the group as the update target. Uniformly sending information via broadcast or multicast instead of individually sending it to each terminal significantly reduces the number of signaling interactions.

[0111] Optionally, the first information instructs all terminals in the first terminal device group to update to the first codebook. This method is suitable for scenarios where the current codebook is no longer applicable to all terminals in the group. Alternatively, the first information only instructs terminals in the group that have reported that the current codebook is inapplicable to update to the first codebook, while other terminals that have not reported inapplicability continue to use the original codebook, balancing update efficiency and individual terminal differences. Terminals updated to the first codebook can form a new group and share the updated first codebook. The identifier of this new group is the identifier of the first codebook.

[0112] S302, the first node is generated based on the first information, and the first codebook is downloaded or updated.

[0113] Accordingly, after receiving the first information, the first node parses the codebook update content carried in the first information, and generates, downloads, or updates the first codebook. After generating, downloading, or updating the first codebook, the first node uses the first codebook to calculate and report the precoding matrix indication. When the first information is broadcast or multicast to multiple terminals within the group, each terminal within the group also generates, downloads, or updates its own first codebook based on the first information.

[0114] Depending on the content carried in the first information, the behavior of the first node includes at least one of the following: In Method 1, when the first information includes the identification information of one or more codebooks, or the basis vector index information of a certain basis vector set, the first node retrieves the corresponding basis vectors from the downloaded codebooks or basis vector sets according to the identification, and combines them to form the first codebook. For example, if the second node indicates that the first downloadable codebook is composed of basis vectors from the downloaded first basis vector set, the first node directly retrieves the basis vector set of the codebook from its local machine, without the second node needing to repeatedly transmit these basis vectors.

[0115] Method 2: When the first information includes the basis vector index information of the basis vector set, the first node determines the basis vectors required for the first codebook based on the basis vector index information. In some implementations, after receiving the first information, the first node sends an acknowledgment message to the second node, informing the second node that the first information has been successfully received. After receiving the acknowledgment message, the second node transmits the corresponding basis vectors to the first node, and the first node constructs the first codebook from the received basis vectors. In some implementations, before sending the acknowledgment message, the first node compares the basis vectors indicated by the first information with the basis vectors already stored locally, and only requests the download of basis vectors not stored locally from the second node. That is, the requested basis vectors are a subset of the basis vectors indicated by the first information, avoiding the repeated downloading of existing basis vectors. For example, the first information indicates that the first codebook is composed of the basis vectors in the basis vector set {b1,b2,b3,b4,b5}. If the first node finds that {b1,b2,b3} is already stored locally, then the first node only requests the second node to download {b4,b5}. After the download is completed, {b1,b2,b3,b4,b5} will be combined to form the first codebook.

[0116] Method 3: When the first information includes a first parameter for generating the first basis vector, the first node generates a new basis vector based on the first parameter as the first basis vector of the first codebook. When the first information also includes a set of basis vectors for generating the first basis vector, the first node selects the corresponding basis vector from the set based on the first parameter. For example, if the second node sends a set of basis vectors containing N spatial basis vectors and indicates that the first parameter is index k, the first node selects the k-th basis vector from the set as the basis vector of the first codebook.

[0117] Method 4: When the first information includes the second basis vector of the first codebook itself, the first node directly uses the second basis vector as part of the first codebook's basis vectors. When the first information also includes a set of basis vectors used to generate the second basis vector, the first node selects the second basis vector from that set. When the first information includes both a codebook identifier and a new basis vector, the first node merges the two to form the first codebook: the downloaded basis vector is obtained locally, and the new basis vector directly uses the content carried in the first information.

[0118] Method 5: When the first information includes the basis vector type and structural parameters, the first node determines the type of basis vector used in the first codebook based on the basis vector type, and configures the structure of the first codebook according to parameters such as the number of ports, the number of basis vectors, the layer to which it belongs, the spatial density, the precision, and the maximum number of layers.

[0119] Furthermore, when the first information includes an instruction to delete the second codebook, the first node deletes the second codebook it stores, freeing up storage space. When the first information includes an update method, if the instruction is to update all basis vectors, the first node replaces all basis vectors in the current codebook with the set of basis vectors indicated by the first information; if the instruction is to update only some basis vectors, the first node only replaces the portion of basis vectors indicated by the first information, leaving the remaining basis vectors unchanged. When the first information includes an instruction for cross-codebook multiplexing, the first node retrieves relevant basis vectors from one or more downloaded codebooks and combines them to construct the first codebook. When the first information includes an instruction for codebook subset restriction, the first node only downloads and uses basis vectors within the restricted range, refraining from downloading excluded basis vectors. This not only helps save storage space for the first node but also controls the computational complexity of the codebook through the CBSR mechanism.

[0120] For example, the processing of codebook subset restriction information also includes the following scenarios: In some implementations, after the first node generates or updates the first codebook, some basis vectors in the first codebook are restricted by codebook subset constraint information. For example, such as... Figure 4As shown, the basis vector set of the first codebook is divided into two types after the codebook update: CBSR-restricted basis vectors and unrestricted basis vectors. When the first information does not contain new codebook subset restriction information, the first node uses the previously received codebook subset restriction information to continue applying the same restrictions to the basis vectors in the corresponding spatial or frequency domain directions in the updated first codebook. CBSR-restricted basis vectors correspond to basis vectors that were restricted and unusable in the original codebook subset restriction information; they remain restricted after the update, and the first node does not use these basis vectors to calculate channel state information. Unrestricted basis vectors include unrestricted basis vectors in the original codebook and basis vectors added during the first codebook update. Since the original codebook subset restriction information does not involve these newly added basis vectors, they are in an unrestricted state by default, and the first node can use these basis vectors to calculate channel state information. For example, before the update, the first codebook contains a set of basis vectors {b1, b2, b3, b4}. The original codebook subset restriction information restricts b2 and b4 to be unavailable, and the first node only uses b1 and b3. Based on the first information, the first node updates the first codebook to contain a set of basis vectors {b1, b2, b3, b4, b5, b6}, where b5 and b6 are newly added basis vectors. Since the first information does not contain new codebook subset restriction information, the first node retains the original restriction rules; b2 and b4 remain restricted, b1 and b3 remain available, and the newly added b5 and b6 are available by default. Therefore, after the update, the first node uses the basis vectors {b1, b3, b5, b6} to calculate the channel state information.

[0121] In some implementations, such as Figure 5 The codebook subset constraint shown can also be a soft constraint mechanism. A soft constraint mechanism does not directly exclude a specific basis vector, but rather dynamically determines whether to constrain that basis vector by evaluating the projected energy of the basis vector in the direction to be avoided.

[0122] Specifically, the first node initially selects a basis vector from the set of basis vectors in the downloadable codebook. The first projection corresponding to this basis vector is the projection obtained by the first node projecting the beam of this basis vector onto the restricted direction of the codebook subset to be avoided. The first node calculates the energy P of this first projection. B1 And calculate P B1 With reference energy P A The ratio. When P B1 / P A When the energy exceeds a preset threshold, the first node determines that the projected energy of the basis vector in the direction to be avoided is too high and needs to be restricted. At this point, the first node selects another basis vector from the set of basis vectors, and the energy P of the second projection corresponding to this newly selected basis vector... B2 Satisfy P B2 / P AIf the value is less than a preset threshold, the first node will reselect the basis vector as the available basis vector in the first codebook.

[0123] In some implementations, when the first information does not contain new codebook subset restriction information, the first node considers all basis vectors in the updated first codebook to be usable and no longer applies any restrictions. This approach is suitable for scenarios where the current channel environment has changed significantly and the original restrictions are no longer applicable.

[0124] In some implementations, codebook subset constraint is a soft constraint. When the ratio of the projection capability in the constrained direction to the projection capability in the reference direction exceeds a preset threshold, the first node constrains the basis vectors in that direction and selects new basis vectors from the basis vector sets in other directions to replace the constrained basis vectors. The soft constraint mechanism ensures that codebook subset constraint does not rigidly exclude basis vectors, but rather dynamically determines them based on channel conditions, which helps to achieve a balance between avoiding interference and preserving the diversity of basis vectors.

[0125] In some implementations, when the first information includes a bitmap, the first node determines the corresponding basis vector belonging to the first codebook based on the bits with a value of 1 in the bitmap and downloads and uses them. The basis vectors corresponding to the bits with a value of 0 are restricted from being used. When the codebook is updated, the bits corresponding to the newly added basis vectors change from 0 to 1, and the bits corresponding to the basis vectors that need to be deleted change from 1 to 0. The addition, deletion, and modification operations of the codebook basis vectors can be realized by bit flipping.

[0126] Optionally, after generating, downloading, or updating the first codebook, the first node can revert to the fixed codebook written at the factory (revert to the default codebook), and the first node will automatically exit the shared group of the downloadable codebook.

[0127] Optionally, this method also includes S303, whereby the first node sends second information, which is used to determine the first information.

[0128] Correspondingly, the second node receives the second information sent by the first node.

[0129] Prior to S301, the first node may proactively send second information to the second node as auxiliary information. This second information includes a description of the codebook update by the first node, a suggestion for a codebook update, or a request for a codebook update. The second node determines the specific values ​​of each item in the first information based on this auxiliary information.

[0130] Depending on the content of the second information, the relationship between the second information and the first information includes at least one of the following: In Method 1, the second information includes the identification information of a third codebook, which is the codebook requested by the first node. Based on this, the second node sets the codebook identifier in the first information to the codebook identifier associated with the third codebook, or references the basis vector in the third codebook in the cross-codebook multiplexing instruction, so that the issued codebook update information is consistent with the terminal's expectations.

[0131] Method Two: The second information contains operational requirements for existing codebook basis vectors, including enhancing or restricting basis vectors in a specific direction or layer of the third codebook, activating or deactivating basis vectors, deleting basis vectors, and adding new basis vectors. The second node determines one or more items from the first information accordingly: for requirements to enhance or restrict basis vectors, the second node can use CBSR restrictions or a bitmap to represent this; for requirements to add basis vectors, the second node can issue the corresponding basis vector parameters or the basis vector itself in the first information; for requirements to delete basis vectors, the second node can instruct the deletion of the corresponding second codebook in the first information, or set the corresponding bit to 0 in the bitmap.

[0132] Method 3: The second information includes channel attribute information, reflecting the long-term statistical characteristics of the channel. This channel attribute information includes at least one of time-domain channel characteristics, frequency-domain channel characteristics, or spatial-domain channel characteristics. The second node compares the channel attribute information with the attribute values ​​of the channel environment applicable to the current first codebook. If the difference exceeds a preset threshold, it is determined that the current codebook no longer matches the channel conditions. Based on this, the second node generates the first information, for example, in the update method, indicating the update of all basis vectors, or indicating a switch to another codebook that matches the current channel attributes.

[0133] Method 4: The second information includes one or more of the following: the number of layers in the third codebook, basis vector density, complexity, precision information, suggested basis vectors for updating one or more layers of the codebook, or a request to update a specific basis vector. The second node sets the structural parameters in the first information accordingly: for example, if the first node reports a desired number of layers (4), type-II precision, or high precision, the second node configures the number of layers, precision, and other parameters in the first information to the values ​​desired by the terminal. For requests to update the spatial basis, the second node can issue new basis vector parameters in the first information, causing the first node to update the spatial basis vectors of the first codebook.

[0134] In some implementations, the second node sends a third message to the first node, which is used to activate the first codebook. Correspondingly, the first node receives the third message sent by the second node.

[0135] After the first node generates, downloads, or updates the first codebook, it does not immediately use the first codebook to calculate channel state information (PMI), but instead waits for the activation instruction from the second node. The second node activates the first codebook through third information, and only after receiving the third information does the first node begin using the first codebook to calculate and report PMI. Optionally, the third information can be downlink control information (DCI), MAC CE, or RRC signaling.

[0136] Optionally, when the first node belongs to the first terminal device group, the third information can also be broadcast or multicast information. The second node uniformly distributes the third information via broadcast or multicast to activate the first codebook of each first node in the group. Only after receiving the third information does the first node begin to use the first codebook for PMI calculation and reporting.

[0137] In some implementations, the first information serves to indicate the update of the first codebook. This first information does not directly contain all the information required to generate, download, or update the first codebook. Upon receiving the first information, the first node sends an acknowledgment to the second node, informing it that the first information has been successfully received. After sending the acknowledgment, the first node begins downloading the information required for updating the first codebook according to the instructions in the first information. The first information may contain identification information for one or more codebooks. The first node uses this identification information to determine the difference between the locally stored basis vectors and the basis vectors required for updating the first codebook, requesting only the basis vectors not yet downloaded from the second node to avoid repeatedly downloading existing basis vectors. Furthermore, the information required for updating the first codebook may also include at least one of the following: parameters for generating the first codebook or first basis vectors, a set of basis vectors, a new codebook used to replace the first codebook, and codebook subset restriction information. After the first node completes the download, it generates, downloads, or updates the first codebook based on the downloaded information. For example, the second node indicates in the first information that the first codebook consists of some basis vectors from the already downloaded first downloadable codebook and several newly added basis vectors. After the first node sends an acknowledgment to the second node, it finds that the basis vectors of the first downloadable codebook are already stored locally, and only requests to download the newly added basis vectors. After the download is complete, the existing basis vectors are combined with the newly added basis vectors to form the first codebook. By separating the indication function of the first information from the data transmission function of the subsequent download, the first information only carries lightweight control instructions, and the specific codebook data is obtained through subsequent downloads. This helps to reduce the transmission overhead of the first information and allows the transmission of codebook data to be flexibly scheduled according to wireless channel conditions. In the above two schemes, the request from the first node to the second node to download a specific basis vector is included in the aforementioned acknowledgment information; or the first node transmits the acknowledgment information first, and then transmits the request information to request the download of the specific basis vector.

[0138] In this embodiment, the first node generates, downloads, or updates its codebook based on the update information sent by the second node, and switches to the new codebook upon receiving an activation signaling. For a group of first nodes sharing the same codebook, the second node can uniformly send codebook update information and activation signaling via broadcast or multicast, significantly reducing signaling overhead and resource consumption, which is particularly suitable for scenarios with high terminal density. The terminal-assisted closed-loop codebook update process helps achieve flexible and efficient codebook updates, ensuring that the codebook used by the first node matches the current channel environment and improving the accuracy of channel state information feedback.

[0139] The above text, in conjunction with Figures 1 to 1, Figure 5 The method embodiments of this application are described in detail below, in conjunction with... Figures 6 to 9 The present application provides a detailed description of the apparatus embodiments. It should be understood that the descriptions of the method embodiments correspond to the descriptions of the apparatus embodiments; therefore, any parts not described in detail can be found in the foregoing method embodiments.

[0140] Figure 6 This is a schematic diagram of the structure of a terminal device provided in another embodiment of this application. Figure 6 The terminal device 600 shown can be the terminal described above. The terminal device 600 may include a first transceiver unit 610 and a first processing unit 620.

[0141] In one possible embodiment, the first transceiver unit 610 can be used to receive first information, which is used to generate, download, or update a first codebook.

[0142] In one possible embodiment, the first transceiver unit 610 can also be used to send second information, which is used to determine the first information.

[0143] In one possible embodiment, the first transceiver unit 610 can also be used to receive third information, which is used to activate the first codebook.

[0144] In one possible embodiment, the first processing unit 620 can also be used to generate, download, or update the first codebook based on the first information.

[0145] As one embodiment, the first transceiver unit 610 can be a transceiver 830, the first processing unit 620 can be a processor 810, and the terminal device 600 may further include a storage unit, which can be a memory 820, specifically as follows: Figure 8 As shown.

[0146] Figure 7 This is a schematic diagram of the structure of a network device according to another embodiment of this application. The network device 700 may include a second transceiver unit 710 and a second processing unit 720.

[0147] In one possible embodiment, the second transceiver unit 710 can be used to send first information, which is used to generate, download, or update a codebook.

[0148] As one embodiment, the second transceiver unit 710 can be a transceiver 830, and the second processing unit 720 can be a processor 810. The network device 700 may also include a storage unit, which can be a memory 820, specifically as follows... Figure 8 As shown.

[0149] Figure 8 This is a schematic diagram of the structure of a communication device provided in another embodiment of this application. Figure 8 The dashed lines indicate that the unit or module is optional. The device 800 can be used to implement the methods described in the above method embodiments. The device 800 can be a chip, user equipment, or network device.

[0150] The apparatus 800 may include one or more processors 810. The processor 810 may support the apparatus 800 in implementing the methods described in the preceding method embodiments. The processor 810 may be a general-purpose processor or a special-purpose processor. For example, the processor may be a central processing unit (CPU). Alternatively, the processor may be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor.

[0151] The apparatus 800 may further include one or more memories 820. The memories 820 store a program that can be executed by the processor 810, causing the processor 810 to perform the methods described in the preceding method embodiments. The memories 820 may be independent of the processor 810 or integrated within the processor 810.

[0152] The device 800 may also include a transceiver 830. The processor 810 can communicate with other devices or chips via the transceiver 830. For example, the processor 810 can send and receive data with other devices or chips via the transceiver 830.

[0153] Figure 9 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Specifically, Figure 9 A block diagram of a first communication device 950 and a second communication device 910 communicating with each other in an access network is shown.

[0154] The first communication device 950 includes a controller / processor 959, a memory 960, a data source 967, a transmitter processor 968, a receiver processor 956, a multi-antenna transmitter processor 957, a multi-antenna receiver processor 958, a transmitter / receiver 954, and an antenna 952.

[0155] The second communication device 910 includes a controller / processor 975, a memory 976, a data source 977, a receiver processor 970, a transmitter processor 916, a multi-antenna receiver processor 972, a multi-antenna transmitter processor 971, a transmitter / receiver 918, and an antenna 920.

[0156] In the transmission from the second communication device 910 to the first communication device 950, at the second communication device 910, upper-layer data packets from the core network or from the data source 977 are provided to the controller / processor 975. The core network and data source 977 represent all protocol layers above the L2 layer. The controller / processor 975 implements the functionality of the L2 layer. In the transmission from the second communication device 910 to the first communication device 950, the controller / processor 975 provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and radio resource allocation to the first communication device 950 based on various priority metrics. The controller / processor 975 is also responsible for retransmitting lost packets and signaling to the first communication device 950. The transmit processor 916 and the multi-antenna transmit processor 971 implement various signal processing functions for the L1 layer (i.e., the physical layer). Transmit processor 916 performs encoding and interleaving to facilitate forward error correction at the second communication device 910, and mapping of signal clusters based on various modulation schemes (e.g., binary phase shift keying, quadrature phase shift keying, M-phase shift keying, M-quadrature amplitude modulation). Multi-antenna transmit processor 971 performs digital spatial precoding on the encoded and modulated symbols, including codebook-based and non-codebook-based precoding, and beamforming processing, generating one or more spatial streams. Transmit processor 916 then maps each spatial stream to subcarriers, multiplexes it with a reference signal (e.g., a pilot) in the time and / or frequency domains, and then uses inverse fast Fourier transform to generate a physical channel carrying the time-domain multicarrier symbol stream. Multi-antenna transmit processor 971 then performs transmit analog precoding / beamforming operations on the time-domain multicarrier symbol stream. Each transmitter 918 converts the baseband multicarrier symbol stream provided by multi-antenna transmit processor 971 into an RF stream, which is then provided to different antennas 920.

[0157] In the transmission from the second communication device 910 to the first communication device 950, at the first communication device 950, each receiver 954 receives a signal through its corresponding antenna 952. Each receiver 954 recovers the information modulated onto the radio frequency carrier and converts the radio frequency stream into a baseband multicarrier symbol stream, which is then provided to the receiver processor 956. The receiver processor 956 and the multi-antenna receiver processor 958 implement various signal processing functions of Layer 1. The multi-antenna receiver processor 958 performs receive analog precoding / beamforming operations on the baseband multicarrier symbol stream from the receiver 954. The receiver processor 956 uses a fast Fourier transform to convert the baseband multicarrier symbol stream after the receive analog precoding / beamforming operations from the time domain to the frequency domain. In the frequency domain, the physical layer data signal and the reference signal are demultiplexed by the receiver processor 956, where the reference signal is used for channel estimation, and the data signal is recovered in the multi-antenna receiver processor 958 after multi-antenna detection to recover any spatial stream destined for the first communication device 950. Symbols on each spatial stream are demodulated and recovered in the receiver processor 956, generating soft decisions. The receiver processor 956 then decodes and deinterleaves the soft decisions to recover the upper-layer data and control signals transmitted by the second communication device 910 over the physical channel. The upper-layer data and control signals are then provided to the controller / processor 959. The controller / processor 959 implements the functions of Layer 2. The controller / processor 959 may be associated with a memory 960 storing program code and data. The memory 960 may be referred to as computer-readable media. In the transmission from the second communication device 910 to the first communication device 950, the controller / processor 959 provides multiplexing, packet reassembly, decryption, header decompression, and control signal processing between the transmission and logical channels to recover the upper-layer data packets from the second communication device 910. The upper-layer data packets are then provided to all protocol layers above Layer 2. Various control signals may also be provided to Layer 3 for Layer 3 processing.

[0158] In the transmission from the first communication device 950 to the second communication device 910, at the first communication device 950, upper-layer data packets are provided to the controller / processor 959 using a data source 967. The data source 967 represents all protocol layers above the L2 layer. Similar to the transmission functions at the second communication device 910 described in the transmission from the second communication device 910 to the first communication device 950, the controller / processor 959 implements header compression, encryption, packet segmentation and reordering, and multiplexing between the logical and transport channels, implementing L2 layer functions for the user plane and control plane. The controller / processor 959 is also responsible for retransmitting lost packets and signaling to the second communication device 910. Transmit processor 968 performs modulation mapping and channel coding processing, while multi-antenna transmit processor 957 performs digital multi-antenna spatial precoding, including codebook-based and non-codebook-based precoding, and beamforming processing. Subsequently, transmit processor 968 modulates the generated spatial stream into a multi-carrier / single-carrier symbol stream. After analog precoding / beamforming operations in multi-antenna transmit processor 957, the stream is provided to different antennas 952 via transmitter 954. Each transmitter 954 first converts the baseband symbol stream provided by multi-antenna transmit processor 957 into a radio frequency symbol stream before providing it to antenna 952.

[0159] In the transmission from the first communication device 950 to the second communication device 910, the function at the second communication device 910 is similar to the receiving function at the first communication device 950 described in the transmission from the second communication device 910 to the first communication device 950. Each receiver 918 receives radio frequency signals through its corresponding antenna 920, converts the received radio frequency signals into baseband signals, and provides the baseband signals to the multi-antenna receiving processor 972 and the receiving processor 970. The receiving processor 970 and the multi-antenna receiving processor 972 jointly implement the L1 layer function. The controller / processor 975 implements the L2 layer function. The controller / processor 975 may be associated with a memory 976 storing program code and data. The memory 976 may be referred to as computer-readable media. In the transmission from the first communication device 950 to the second communication device 910, the controller / processor 975 provides multiplexing between the transmission and logical channels, packet reassembly, decryption, header decompression, and control signal processing to recover the upper-layer data packets from the first communication device 950. Upper-layer data packets from the controller / processor 975 can be provided to the core network or all protocol layers above the L2 layer, and various control signals can also be provided to the core network or L3 for L3 processing.

[0160] As an example, the first communication device 950 corresponds to the terminal in this application.

[0161] As an example, the second communication device 910 corresponds to the network device in this application.

[0162] As an example, the first communication device 950 is an NCR.

[0163] As an example, the first communication device 950 is a wireless repeater.

[0164] As an example, the first communication device 950 is a relay.

[0165] As an example, the first communication device 950 is a user equipment that can act as a relay node.

[0166] As an example, the first communication device 950 is a V2X-enabled user equipment that can act as a relay node.

[0167] As an example, the first communication device 950 is a D2D-enabled user equipment that can act as a relay node.

[0168] As one embodiment, the second communication device 910 is a base station.

[0169] As one embodiment, the antenna 952, the receiver 954, the multi-antenna receiving processor 958, the receiving processor 956, and the controller / processor 959 are used to receive the first information in this application, etc.

[0170] As one embodiment, the antenna 920, the transmitter 918, the multi-antenna transmitter processor 971, the transmitter processor 916, and the controller / processor 975 are used to transmit the request signaling in this application.

[0171] This application also provides a computer-readable storage medium for storing a program. This computer-readable storage medium can be applied to a terminal or network device provided in this application, and the program causes a computer to execute the methods performed by the terminal or network device in various embodiments of this application.

[0172] This application also provides a chip including a memory and a processor, which can call and run computer programs from the memory to execute the methods performed by a terminal or network device in various embodiments of this application.

[0173] This application also provides a chip module, including a memory and a processor, which can call and run computer programs from the memory to execute the methods performed by a terminal or network device in various embodiments of this application.

[0174] This application also provides a computer program product. The computer program product includes a program. The computer program product can be applied to a terminal or network device provided in this application embodiment, and the program causes a computer to execute the methods performed by the terminal or network device in various embodiments of this application.

[0175] This application also provides a computer program. This computer program can be applied to the terminal or network device provided in this application, and the computer program causes the computer to execute the methods performed by the terminal or network device in various embodiments of this application.

[0176] It should be understood that the terms "system" and "network" in this application can be used interchangeably. Furthermore, the terminology used in this application is only for explaining specific embodiments of the application and is not intended to limit the application. The terms "first," "second," "third," and "fourth," etc., in the specification, claims, and accompanying drawings of this application are used to distinguish different objects, not to describe a specific order. In addition, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion.

[0177] In the embodiments of this application, the term "instruction" can be a direct instruction, an indirect instruction, or an indication of a relationship. For example, A instructing B can mean that A directly instructs B, such as B being able to obtain information through A; it can also mean that A indirectly instructs B, such as A instructing C, so B can obtain information through C; or it can mean that there is a relationship between A and B.

[0178] In the embodiments of this application, "B corresponding to A" means that B is associated with A, and B can be determined based on A. However, it should also be understood that determining B based on A does not mean that B is determined solely based on A; B can also be determined based on A and / or other information.

[0179] In the embodiments of this application, the term "correspondence" can indicate a direct or indirect correspondence between two things, or an association between two things, or a relationship such as instruction and being instructed, configuration and being configured.

[0180] In this application embodiment, "predefined" or "preconfigured" can be implemented by pre-storing corresponding codes, tables, or other means that can be used to indicate relevant information in the device (e.g., including user equipment and network devices). This application does not limit the specific implementation method. For example, predefined can refer to what is defined in the protocol.

[0181] In this application embodiment, the "protocol" may refer to a standard protocol in the field of communication, such as the LTE protocol, the NR protocol, and related protocols applied to future communication systems. This application does not limit this.

[0182] In the embodiments of this application, the term "and / or" is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / " in this document generally indicates that the preceding and following related objects have an "or" relationship.

[0183] In the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0184] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0185] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0186] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0187] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can read or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., digital video discs (DVDs)), or semiconductor media (e.g., solid-state disks (SSDs)).

[0188] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for a first node in wireless communication, characterized in that, include: Receive first information, which is used to generate, download, or update the first codebook; Generate, download, or update the first codebook based on the first information.

2. The method according to claim 1, characterized in that, The first information also indicates at least one of the following: The first codebook includes the identification information of one or more codebooks, the first codebook, the first parameter used to generate the first basis vector of the first codebook, the basis vector set used to generate the first basis vector of the first codebook, the second basis vector of the first codebook, the basis vector set used to generate the second basis vector of the first codebook, the number of ports applicable to the first codebook, the number of basis vectors of the first codebook, the layer to which the first basis vector and / or the second basis vector belong, the spatial density of the basis vectors of the first codebook, the precision of the first codebook, the maximum number of layers supported by the first codebook, the basis vector type of the first codebook, deleting the second codebook from the first node, or, the update method of the first codebook, the update method including updating all basis vectors or updating some basis vectors, the first codebook containing the basis vectors in the one or more codebooks, and limiting the basis vectors contained in the first codebook; The second codebook is the codebook stored in the first node.

3. The method according to claim 1 or 2, characterized in that, The first information instructs the first node to download and generate or update a portion of the basis vectors of the first codebook; Based on the first information, download and generate or update the portion of the basis vectors of the first codebook.

4. The method according to any one of claims 1 to 3, characterized in that, Before receiving the first information, the method further includes: Send a second message, which is used to determine the first message.

5. The method according to claim 4, characterized in that, The second information includes at least one of the following: The third codebook includes the identification information, the number of layers in the third codebook, the basis vectors of the first direction or the first layer in the third codebook that are enhanced or restricted, the basis vector density of the third codebook, the complexity of the third codebook, the precision information of the third codebook, the activation or deactivation of the basis vectors in the third codebook, the deletion of the basis vectors in the third codebook, the addition of the basis vectors in the third codebook, the updating of the third codebook, the updating of the spatial basis of the third codebook, and the channel attribute information. The third codebook is the codebook requested by the first node.

6. The method according to any one of claims 1 to 5, characterized in that, The method further includes: Receive third information, which is used to activate the first codebook.

7. The method according to any one of claims 1 to 6, characterized in that, The first node belongs to the first terminal device group, and the first terminal device group shares the first codebook; The first information is broadcast information or multicast information, and the first information is used to instruct each first node in the first terminal device group to generate, download or update the first codebook based on the first information; And / or, The third information is broadcast information or multicast information, and the third information is used to activate the first codebook of each first node in the first terminal device group.

8. The method according to any one of claims 1 to 7, characterized in that, When the first information only contains the current identification information of the first codebook, after the first codebook is generated, downloaded, or updated, the identification information of the first codebook is the current identification information of the first codebook. Alternatively, when the first information includes the current identification information and the new identification information of the first codebook, after the first codebook is generated, downloaded, or updated, the identification information of the first codebook is the new identification information.

9. A method for a second node in wireless communication, characterized in that, include: Send a first message, which instructs the first node to generate, download, or update the first codebook based on the first message.

10. The method according to claim 9, characterized in that, The first information also indicates at least one of the following: The first codebook includes the identification information of one or more codebooks, the first codebook, the first parameter used to generate the first basis vector of the first codebook, the basis vector set used to generate the first basis vector of the first codebook, the second basis vector of the first codebook, the basis vector set used to generate the second basis vector of the first codebook, the number of ports applicable to the first codebook, the number of basis vectors of the first codebook, the layer to which the first basis vector and / or the second basis vector belong, the spatial density of the basis vectors of the first codebook, the precision of the first codebook, the maximum number of layers supported by the first codebook, the basis vector type of the first codebook, deleting the second codebook from the first node, or, the update method of the first codebook, the update method including updating all basis vectors or updating some basis vectors, the first codebook containing the basis vectors in the one or more codebooks, and limiting the basis vectors contained in the first codebook; The second codebook is the codebook stored in the first node.

11. The method according to claim 9 or 10, characterized in that, The first information instructs the first node to download and generate or update a portion of the basis vectors of the first codebook; Based on the first information, download and generate or update the portion of the basis vectors of the first codebook.

12. The method according to any one of claims 9 to 11, characterized in that, Before sending the first information, the method further includes: Receive second information sent by the first node, the second information being used to determine the first information.

13. The method according to claim 12, characterized in that, The second information includes at least one of the following: The third codebook includes the identification information, the number of layers in the third codebook, the basis vectors of the first direction or the first layer in the third codebook that are enhanced or restricted, the basis vector density of the third codebook, the complexity of the third codebook, the precision information of the third codebook, the activation or deactivation of the basis vectors in the third codebook, the deletion of the basis vectors in the third codebook, the addition of the basis vectors in the third codebook, the updating of the third codebook, the updating of the spatial basis of the third codebook, and the channel attribute information. The third codebook is the codebook requested by the first node.

14. The method according to any one of claims 9 to 13, characterized in that, The method further includes: Send a third message, which is used to activate the first codebook.

15. The method according to any one of claims 9 to 14, characterized in that, The first node belongs to the first terminal device group, and the first terminal device group shares the first codebook; The first information is broadcast information or multicast information, and the first information is used to instruct each first node in the first terminal device group to generate, download or update the first codebook based on the first information; And / or, The third information is broadcast information or multicast information, and the third information is used to activate the first codebook of each first node in the first terminal device group.

16. The method according to any one of claims 9 to 15, characterized in that, When the first information only contains the current identification information of the first codebook, after the first codebook is generated, downloaded, or updated, the identification information of the first codebook is the current identification information of the first codebook. Alternatively, when the first information includes the current identification information and the new identification information of the first codebook, after the first codebook is generated, downloaded, or updated, the identification information of the first codebook is the new identification information.

17. A communication device, characterized in that, Includes units or modules for performing the method as described in any one of claims 1-8 or 9-16.

18. A first node used for wireless communication, characterized in that, The device includes a transceiver, a memory, and a processor. The memory stores a program, and the processor invokes the program in the memory and controls the transceiver to receive or send signals so that the node performs the method as described in any one of claims 1-8.

19. A second node used for wireless communication, characterized in that, The device includes a transceiver, a memory, and a processor. The memory stores a program, and the processor invokes the program in the memory and controls the transceiver to receive or send signals so that the node performs the method as described in any one of claims 9-16.

20. A communication device, characterized in that, The device includes at least one processor; and one or more non-transitory computer-readable storage media coupled to the at least one processor and storing programming instructions executable by the at least one processor, wherein the programming instructions, when executed, cause the at least one processor to perform the method as described in any one of claims 1-8 or 9-16.

21. A chip, characterized in that, Includes a processor for calling a program from memory, causing a device on which the chip is mounted to perform the method as described in any one of claims 1-8 or 9-16.

22. A chip module, characterized in that, It includes a transceiver component and a chip, said chip being used to perform the method as described in any one of claims 1-8, or to perform the method as described in any one of claims 9-16.

23. A computer-readable storage medium, characterized in that, It contains a program that causes a computer to perform the method as described in any one of claims 1-8 or 9-16.

24. A computer program product, characterized in that, Includes a program that causes a computer to perform the method as described in any one of claims 1-8 or 9-16.

25. A computer program, characterized in that, The computer program causes the computer to perform the method as described in any one of claims 1-8 or 9-16.

Images