Codebook hierarchical processing method and apparatus, and communication device

Abstract

The invention provides a codebook hierarchical processing method, a codebook hierarchical processing device and communication equipment. The method comprises the following steps: dividing a spatial domain space for M times according to a first granularity to obtain M layers of subspaces; wherein each time of division is to divide the subspace obtained by the last time of division; based on the initial codeword contained in the basic codebook corresponding to each layer of subspace, synthesizing the codeword of the layered codebook; wherein the initial code words contained in the basic codebook corresponding to each layer of subspace are continuous or discrete; m is greater than or equal to 1. According to the codebook hierarchical processing method provided by the invention, the beams can be isolated from one another, so that the codebook performance is improved, and the codebook hierarchical processing method has higher reliability and robustness. When the layered codebook generated by the method is used for communication transmission, the time complexity can be effectively reduced, and the pilot frequency overhead is reduced.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a codebook layered processing method, device and communication equipment. Background Art

[0002] In order to adapt to future high-frequency band communications, future multi-antenna systems, including traditional multi-antennas and antennas based on the leaky wave principle represented by reconfigurable holographic surfaces (RHS), generally adopt large-scale or even ultra-large-scale architectures to combat the path loss problem caused by high-frequency bands. However, high-gain narrow beams significantly increase the size of the codebook, resulting in large overhead and time complexity during beam search and beam training, which seriously affects the overall communication rate. Summary of the invention

[0003] The purpose of the present application is to provide a codebook layered processing method, device and communication equipment to solve the problem that large-scale codebooks affect the communication rate.

[0004] An embodiment of the present application provides a codebook layering processing method, including:

[0005] The spatial space is divided M times according to the first granularity to obtain M layers of subspaces; wherein each division is performed on the subspace obtained by the previous division;

[0006] Based on the initial codewords contained in the basic codebook corresponding to each layer of subspace, synthesize the codewords of the hierarchical codebook;

[0007] The initial codewords contained in the basic codebook corresponding to each layer of subspace are continuous or discrete; M is greater than or equal to 1.

[0008] Optionally, the method further includes:

[0009] Determine the number of divisions of the spatial domain space according to the number of initial codewords included in the basic codebook;

[0010] The number of subspaces obtained by the last division is equal to the number of initial codewords included in the basic codebook, and each subspace obtained by the last division corresponds to a coverage space of the initial codeword.

[0011] Optionally, synthesizing the codewords of the hierarchical codebook based on the initial codewords included in the basic codebook corresponding to each layer of subspace includes:

[0012] For each layer of subspace, the initial codewords are divided in order according to the number of subspaces included, so as to obtain a plurality of continuous initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of continuous initial codewords;

[0013] or,

[0014] For each layer of subspace, the initial codewords are divided according to a first rule according to the number of subspaces included, so as to obtain a plurality of discrete initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of non-continuous initial codewords.

[0015] Optionally, dividing the initial codeword according to a first rule based on the number of included subspaces includes:

[0016] Dividing the initial codeword into codeword intervals equal in number to the subspaces, each subspace corresponding to a codeword interval;

[0017] The multiple initial codewords included in each codeword interval are arranged according to a first rule, and the multiple initial codewords included in each codeword interval are discrete.

[0018] Optionally, the method further includes:

[0019] Based on each layer of codewords in the hierarchical codebook, sending a first signal to a signal receiving device;

[0020] receiving a response message sent by the signal receiving device, wherein the response message includes a number corresponding to the optimal codeword;

[0021] If there are at least two signal receiving devices that feedback the same optimal codeword number, the codeword of the hierarchical codebook is resynthesized, and based on the codeword of each layer of the resynthesized hierarchical codebook, a second signal is sent to the signal receiving device until the numbers corresponding to the optimal codewords in the response messages sent by all signal receiving devices are different.

[0022] Optionally, if the initial codeword corresponding to the first signal is continuous, the initial codeword corresponding to the second signal is discrete;

[0023] or,

[0024] If the initial codeword corresponding to the first signal is discrete, the initial codeword corresponding to the second signal is continuous.

[0025] Optionally, the sending a first signal to a signal receiving device based on the codeword of each layer of the hierarchical codebook includes:

[0026] For a layered codebook of the i-th layer, sending a first signal to a signal receiving device based on a target codeword in the layered codebook of the i-th layer;

[0027] The target codeword is a codeword corresponding to a next-layer subspace of an optimal codeword in the i-1th layer hierarchical codebook.

[0028] Optionally, the method further includes:

[0029] The optimal codeword in the basic codebook is determined according to a response message of a transmitted signal corresponding to each layer of the hierarchical codebook.

[0030] An embodiment of the present application provides a communication device, including: a memory, a transceiver, and a processor:

[0031] A memory for storing a computer program; a transceiver for receiving and sending data under the control of the processor; and a processor for reading the computer program in the memory and performing the following operations:

[0032] The spatial space is divided M times according to the first granularity to obtain M layers of subspaces; wherein each division is performed on the subspace obtained by the previous division;

[0033] Based on the initial codewords contained in the basic codebook corresponding to each layer of subspace, synthesize the codewords of the hierarchical codebook;

[0034] The initial codewords contained in the basic codebook corresponding to each layer of subspace are continuous or discrete; M is greater than or equal to 1.

[0035] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0036] Determine the number of divisions of the spatial domain space according to the number of initial codewords included in the basic codebook;

[0037] The number of subspaces obtained by the last division is equal to the number of initial codewords included in the basic codebook, and each subspace obtained by the last division corresponds to a coverage space of the initial codeword.

[0038] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0039] For each layer of subspace, the initial codewords are divided in order according to the number of subspaces included, so as to obtain a plurality of continuous initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of continuous initial codewords;

[0040] or,

[0041] For each layer of subspace, the initial codewords are divided according to a first rule according to the number of subspaces included, so as to obtain a plurality of discrete initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of non-continuous initial codewords.

[0042] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0043] Dividing the initial codeword into codeword intervals equal in number to the subspaces, each subspace corresponding to a codeword interval;

[0044] The multiple initial codewords included in each codeword interval are arranged according to a first rule, and the multiple initial codewords included in each codeword interval are discrete.

[0045] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0046] Based on each layer of codewords in the hierarchical codebook, sending a first signal to a signal receiving device;

[0047] receiving a response message sent by the signal receiving device, wherein the response message includes a number corresponding to the optimal codeword;

[0048] If there are at least two signal receiving devices that feedback the same optimal codeword number, the codeword of the hierarchical codebook is resynthesized, and based on the codeword of each layer of the resynthesized hierarchical codebook, a second signal is sent to the signal receiving device until the numbers corresponding to the optimal codewords in the response messages sent by all signal receiving devices are different.

[0049] Optionally, if the initial codeword corresponding to the first signal is continuous, the initial codeword corresponding to the second signal is discrete;

[0050] or,

[0051] If the initial codeword corresponding to the first signal is discrete, the initial codeword corresponding to the second signal is continuous.

[0052] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0053] For a layered codebook of the i-th layer, sending a first signal to a signal receiving device based on a target codeword in the layered codebook of the i-th layer;

[0054] The target codeword is a codeword corresponding to a next-layer subspace of an optimal codeword in the i-1th layer hierarchical codebook.

[0055] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0056] The optimal codeword in the basic codebook is determined according to a response message of a transmitted signal corresponding to each layer of the hierarchical codebook.

[0057] An embodiment of the present application provides a codebook hierarchical processing device, including:

[0058] A partitioning unit is used to partition the spatial space M times according to the first granularity to obtain M layers of subspaces; wherein each partition is performed on the subspace obtained by the previous partition;

[0059] A first processing unit, configured to synthesize codewords of a hierarchical codebook based on initial codewords included in a basic codebook corresponding to each layer of subspace;

[0060] The initial codewords contained in the basic codebook corresponding to each layer of subspace are continuous or discrete; M is greater than or equal to 1.

[0061] An embodiment of the present application provides a processor-readable storage medium on which a computer program is stored. When the computer program is executed by a processor, the steps of the above-mentioned codebook hierarchical processing method are implemented.

[0062] The beneficial effects of the above technical solution of the present application are:

[0063] In the embodiment of the present application, the communication device divides the spatial space M times according to the first granularity to obtain M layers of subspaces; based on the initial codewords contained in the basic codebook corresponding to each layer of subspace, the codewords of the hierarchical codebook are synthesized, so that the beams can be isolated from each other, thereby improving the codebook performance and having stronger reliability and robustness. Using the hierarchical codebook generated in this way for communication transmission can effectively reduce time complexity and reduce pilot overhead. BRIEF DESCRIPTION OF THE DRAWINGS

[0064] Figure 1 A schematic diagram showing a flow chart of a codebook layering processing method according to an embodiment of the present application;

[0065] Figure 2 A schematic diagram showing the structure of a codebook hierarchical processing device according to an embodiment of the present application;

[0066] Figure 3 A schematic diagram showing the structure of a communication device according to an embodiment of the present application. DETAILED DESCRIPTION

[0067] In order to make the technical problems, technical solutions and advantages to be solved by the application clearer, the following will be described in detail in conjunction with the accompanying drawings and specific embodiments. In the following description, specific details such as specific configurations and components are provided only to help fully understand the embodiments of the application. Therefore, it should be clear to those skilled in the art that various changes and modifications can be made to the embodiments described herein without departing from the scope and spirit of the application. In addition, for clarity and brevity, the description of known functions and structures has been omitted.

[0068] It should be understood that the references to "one embodiment" or "an embodiment" throughout the specification mean that the specific features, structures, or characteristics associated with the embodiment are included in at least one embodiment of the present application. Therefore, the references to "in one embodiment" or "in an embodiment" appearing throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

[0069] In the various embodiments of the present application, it should be understood that the size of the serial numbers of the following processes does not mean 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 the present application.

[0070] In the embodiments of the present application, the term "and / or" describes the association relationship of the associated objects, indicating that three relationships may exist. For example, A and / or B may represent: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the associated objects before and after are in an "or" relationship.

[0071] In the embodiments of the present application, the term "plurality" refers to two or more than two, and other quantifiers are similar.

[0072] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0073] The embodiments of the present application provide a codebook layered processing method, apparatus and communication device to solve the problem that a large-scale codebook affects the communication rate.

[0074] Among them, the method and the device are based on the same application concept. Since the method and the device solve the problem in a similar principle, the implementation of the device and the method can refer to each other, and the repeated parts will not be repeated.

[0075] like Figure 1As shown, an embodiment of the present application provides a codebook layered processing method, which is applied to a communication device, where the communication device is a signal sending device, which can be a network device (such as a base station) or a terminal.

[0076] The method specifically comprises the following steps:

[0077] Step 101: divide the spatial space M times according to the first granularity to obtain M layers of subspaces; wherein each division is performed on the subspace obtained by the previous division;

[0078] The first granularity K may be pre-set, for example: K=2 or K=3, and the present application does not limit the specific value of the first granularity. The value of the first granularity corresponds to the number of next-layer subspaces obtained after each subspace is divided. The spatial space is the entire spatial space of the antenna array. The number of divisions M of the spatial space may be pre-set, and the number of divisions M is determined according to the number of codewords contained in the basic codebook. The subspace obtained by each division is a layer of subspace, and M layers of subspace are obtained after M divisions.

[0079] Step 102: synthesize codewords of a hierarchical codebook based on initial codewords contained in a basic codebook corresponding to each layer of subspace; wherein the initial codewords contained in the basic codebook corresponding to each layer of subspace are continuous or discrete; and M is greater than or equal to 1.

[0080] The basic codebook is generated using a codebook generation algorithm, and includes multiple initial codewords. The spatial domain space is all the spatial domain spaces corresponding to the entire basic codebook. After the spatial domain space is divided M times, the number of subspaces obtained is the same as the number of initial codewords included in the basic codebook, and each subspace corresponds to an initial codeword.

[0081] In the first to Mth divisions, each subspace may correspond to multiple initial codewords, and the initial codewords corresponding to the same layer of subspaces may be discrete or continuous. For each layer of subspaces, the communication device may synthesize the codewords of the hierarchical codebook according to the initial codewords corresponding to the layer of subspaces.

[0082] Taking the first granularity K=2 as an example, that is, taking a hierarchical codebook similar to a binary tree as an example, as shown in Table 1 below, assuming that the entire spatial space is denoted as C, the first division divides the entire spatial space C into two subspaces, denoted as C1 and C2. C1 and C2 are the first layer subspaces, covering the two intervals [-90°, 0°] and [0°, 90°] respectively; C1 is divided to obtain two subspaces C11 and C12 corresponding to C1, corresponding to the two intervals of [-90°, -45°] and [-45°, 0°] respectively; C2 is divided to obtain two subspaces C21 corresponding to C2 and C22, corresponding to the coverage range of [0°, 45°] and [45°, 90°] respectively; C11, C12, C21, C22 are the second-level subspaces; C11 is divided to obtain the two subspaces C111 and C112 corresponding to C11, corresponding to the coverage range of [-90°, -67.5°] and [-67.5°, -45°] respectively; C12 is divided to obtain the two subspaces C121 and C122 corresponding to C12, corresponding to the coverage range of [-45°, -22.5°] and [-22.5°, 0°] respectively. And so on, until M divisions are performed.

[0083] It should be noted that the above division obtains a codeword of the hierarchical codebook corresponding to each subspace, so the representation of the above subspace can also be considered as a codeword.

[0084] Each codeword of the layered codebook may correspond to one or more initial codewords of the basic codebook. Taking the number of initial codewords contained in the basic codebook as 64 as an example, as shown in Table 1, the subspaces C1 and C2 of the first layer of the layered codebook correspond to the coverage space of 32 initial codewords, which may be continuous or discrete; the subspaces C11, C12, C21, and C22 of the second layer of the layered codebook correspond to the coverage space of 18 initial codewords, which may be continuous or discrete. Until the last layer of the layered codebook contains a total of 64 codewords, the subspace of each layered codebook corresponds one-to-one to the coverage space of each initial codeword.

[0085] Table 1: Logical thinking of layered codebook

[0086]

[0087] For this hierarchical method, between the previous layer of subspace before division and the next layer of subspace after division, if user feedback is needed to guide the codewords to be scanned in the next layer, the two subspaces obtained after each subspace division only need user feedback once. For example, after the entire spatial space C is divided into two subspaces C1 and C2, the user only needs to provide feedback once for C1 and C2, indicating the best codeword; based on the user's feedback, the best codeword C1 can be selected from the two codewords. Corresponding to the best codeword C1, it is divided into two subspaces C11 and C12 in the next layer; the next layer of codewords covering these two subspaces are used for search, and the user feedbacks the best codeword C11, and the cycle continues until the codebook with the highest precision at the bottom layer is reached, which is the corresponding basic codebook.

[0088] Taking the number of initial codewords contained in the basic codebook as 64 as an example, if the user needs to feedback the beam signal quality corresponding to each initial codeword, the required pilot overhead is 64+1, where 1 is the time slot required for the signal receiving end to feedback the optimal codeword number to the signal transmitting end. If the codebook layered processing method of the embodiment of the present application is used, assuming that the first granularity is 2, the entire spatial space needs to be divided 6 times, and the required time complexity (i.e., pilot overhead) is: 2×6+6=13, which is significantly reduced compared to the prior art.

[0089] In the embodiment of the present application, the communication device divides the spatial space M times according to the first granularity to obtain M layers of subspaces; based on the initial codewords contained in the basic codebook corresponding to each layer of subspace, the codewords of the hierarchical codebook are synthesized, so that the beams can be isolated from each other, thereby improving the codebook performance and having stronger reliability and robustness. Using the hierarchical codebook generated in this way for communication transmission can effectively reduce time complexity and reduce pilot overhead.

[0090] Optionally, the method further includes:

[0091] Determine the number of divisions of the spatial domain space according to the number of initial codewords included in the basic codebook;

[0092] The number of subspaces obtained by the last division is equal to the number of initial codewords included in the basic codebook, and each subspace obtained by the last division corresponds to a coverage space of the initial codeword.

[0093] In this embodiment, the initial codeword is a codebook generated before stratification. The method of generating the basic codebook is, for example: the signal transmitting end determines the edge value of the angular domain set corresponding to each codeword; when the edge value of the angular domain set is less than or equal to the scanning target area of ​​the antenna array, the beam width, beam pointing angle and edge value of the angular domain set of the beam are iteratively updated until the edge value of the updated angular domain set is greater than the scanning target area; at this time, the output angular domain set is the angular domain set corresponding to the final basic codebook. In addition, when iteratively updating the beam width, beam pointing angle and edge value of the angular domain set, the number of updates can be counted, and the codebook scale can be calculated based on the counting result of the iterative update, thereby determining the number of initial codewords contained in the basic codebook.

[0094] The generation algorithm of the basic codebook is, for example:

[0095] Input: wavelength λ, antenna array aperture Len, scanning target area θ target ; The wavelength, RHS aperture and scanning target area can be preset;

[0096] Output: angular domain set AS and codebook size M.

[0097] Among them, 1) initialize the counter c=0, the area edge edg=0 of the angular domain set AS, and add θ=0 to the AS set.

[0098] 2) Calculate the initial value of the beam width Δθ according to the beam width function;

[0099] 3) Update

[0100] 4) Iteratively update the beam width, beam pointing angle, and edge of the angular domain set according to the following steps until the edge value of the obtained angular domain set is greater than the scan target area, then output the angular domain set and count value:

[0101] If edg≤θ target , then update the beam pointing angle θ and beam width Δθ by solving problem P.1 and execute step 5); if edg>θ target , then stop the operation;

[0102] Add θ and -θ to AS;

[0103] renew

[0104] Update c = c + 1;

[0105] 5) Updated edg>θ target , stop the operation, calculate the codebook size M=2c+1; output M and AS.

[0106] The problem P.1 can be expressed as follows:

[0107] (P.1.)

[0108] Among them, edg represents the edge value of the angular domain set, θ represents the beam pointing angle, Δθ represents the beam width; k0 represents the transmission coefficient of the beam in the free space of the antenna array; Len represents the aperture of the antenna array. It is a function related to the edge values ​​of the angular domain set.

[0109] The number of initial codewords contained in the basic codebook obtained in the above manner is the number of subspaces obtained after the spatial space is divided. For example, if the number of initial codewords is 64 and the division granularity is 2, 6 divisions are required to obtain 64 subspaces, each of which corresponds to an initial codeword.

[0110] As an optional embodiment, the synthesizing codewords of the hierarchical codebook based on the initial codewords included in the basic codebook corresponding to each layer of subspace includes:

[0111] Method 1: For each layer of subspace, the initial codeword is divided in order according to the number of subspaces included, so as to obtain a plurality of continuous initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of continuous initial codewords;

[0112] or,

[0113] Method 2: For each layer of subspace, the initial codeword is divided according to the first rule according to the number of subspaces included, so as to obtain a plurality of discrete initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of non-continuous initial codewords.

[0114] In this embodiment, after the spatial domain space is divided once, multiple subspaces are obtained, each subspace corresponds to multiple initial codewords, and the codewords of the hierarchical codebook corresponding to the subspace can be synthesized based on the multiple initial codewords. The multiple initial codewords corresponding to each subspace can be continuous or discretely arranged according to a first rule. The first rule is, for example: multiple initial codewords of a cardinality are arranged in sequence, multiple initial codewords of an even number are arranged in sequence, or multiple initial codewords are arranged at intervals of a preset value. The specific arrangement of the first rule is not limited in this application, but it is necessary to ensure that the initial codewords corresponding to each subspace are discrete.

[0115] The following is an example of the above two ways of synthesizing code words of the hierarchical codebook.

[0116] For method 1, the multiple initial codewords corresponding to each subspace are continuous. For each layer of individual codewords, the amplitude control (holographic principle) characteristics of the antenna array can be used to generate them. The design method of the layered codebook in method 1 is a continuous synthetic codebook. For example, taking the basic codebook of 64 initial codewords as an example, the basic codebook is represented in the form of a matrix B∈C 64×P , where P is the number of radiating elements of the antenna array, then C1 and C2 in the two codewords of the first layer in Table 1 can be generated by the following strategy:

[0117]

[0118]

[0119] Then the codeword C11 of the next layer obtained after stratifying C1 can be expressed as:

[0120]

[0121] From the above representations of C1, C2 and C11, it can be seen that C1 is composed of initial codewords numbered 1-32, C2 is composed of initial codewords numbered 33-64; C11 is obtained by dividing C1, and C11 is composed of initial codewords numbered 1-16. The initial codewords corresponding to the codewords of each hierarchical codebook are continuous.

[0122] Take the antenna array as an example, for example: for the RHS with a spacing of one tenth of a wavelength at 30 GHz, the waveguide transmission coefficient is set to a constant greater than 1, the RHS has 280 units (total length 28 wavelengths) at the maximum aperture, and the initial configuration is 64 beams. At this time, the coverage space of the first layer codebook is 2 subspaces, corresponding to the synthesis of 1 to 32 and 33 to 64 initial codewords, and the second layer corresponds to 1 to 16, 17 to 32, 33 to 48, 49 to 64. In this way, continuous beams are synthesized to achieve coverage of continuous spatial domains.

[0123] Since the RHS device and the traditional phased array antenna are completely different in the principle of realizing beamforming, this embodiment specifically proposes a method for generating a hierarchical codebook suitable for the continuous coverage interval of the RHS according to the characteristics of the RHS, so that the RHS can realize the function of the hierarchical codebook of the existing phased array, and provide a method for replacing future devices and functions.

[0124] The codewords of the hierarchical codebook synthesized in the above manner can isolate the beams from each other and stabilize the gain, thereby further improving the codebook performance.

[0125] For the second method, that is, the multiple initial codewords corresponding to each subspace are discrete. According to the electromagnetic principle, the synthesis of equivalent wide beams is mainly caused by the mutual interference or coupling between adjacent beams. Then, the generation of codewords at each layer through non-continuous intervals can greatly reduce the problems caused by distortion. Therefore, the embodiment of this application describes another codeword synthesis method.

[0126] Optionally, dividing the initial codeword according to a first rule based on the number of included subspaces includes:

[0127] The initial codeword is divided into codeword intervals equal in number to the subspaces, and each subspace corresponds to a codeword interval; wherein the multiple initial codewords contained in each codeword interval are arranged according to a first rule, and the multiple initial codewords contained in each codeword interval are discrete.

[0128] For example, taking the basic codebook of 64 initial codewords as an example, the basic codebook is represented as a matrix in the form of B∈C 64 ×P , where P is the number of radiating elements of the antenna array, then C1 and C2 in the two codewords of the first layer in Table 1 can be generated by the following strategy:

[0129]

[0130]

[0131] From the above representation of C1 and C2, it can be seen that C1 is composed of 32 initial code words, and the numbering of the 32 initial code words is 32 odd numbers such as 1, 3, 5...63; C2 is composed of 32 initial code words, and the numbering of the 32 initial code words is 32 even numbers such as 2, 4, 6...64. That is, the layering is to divide the spatial space into two code word intervals, one of which is the odd code words from 1 to 64 code words, and the other is the even code words from 1 to 64 code words. In this example, the first rule is to arrange in order of odd numbers and even numbers. Therefore, the initial code words corresponding to the code words of each layered code book are discrete.

[0132] The codeword C11 of the next layer obtained after stratifying C1 can be expressed as:

[0133]

[0134] It can be seen from the above representation of C11 that C11 is composed of 16 initial code words, and the 16 initial code words are numbered in 16 cardinality numbers such as 1, 5, 9, ..., 61.

[0135] Taking the antenna array as an RHS array as an example, for example: for an RHS with a spacing of 30 GHz being one tenth of a wavelength, its waveguide transmission coefficient is set to a constant greater than 1, and the RHS has 280 units (a total length of 28 wavelengths) at the maximum aperture, and the initial configuration is 64 beams. At this time, the two subspaces of the first layer codebook are synthesized by [1,3,5,7,…,63] and [2,4,6,8,…,64], and the four codewords of the second layer are synthesized by [1,5,9,…,61], [3,7,11,…,63], [2,6,10,…,62], [4,8,12,…,64], respectively, and so on, and the layered codebook corresponding to the basic codebook can be obtained.

[0136] By synthesizing the codewords of each layer of the hierarchical codebook non-continuously (i.e. discretely), consistency and stability can be achieved, thereby improving the practical performance of the hierarchical codebook. Since there is mutual coupling interference within the same codeword, the discretized coverage interval can effectively reduce the coupling interference, thereby achieving a hierarchical codebook with better performance.

[0137] The codewords of the hierarchical codebook synthesized by the above method 2 can maximize the spatial isolation between the initial codewords required when synthesizing the codewords of the hierarchical codebook, thereby achieving the purpose of reducing distortion. The hierarchical codebook synthesized by the method 2 has an overall effect similar to that of the basic codebook, with accurate beam pointing and controllable distortion.

[0138] It should be noted that the codebook layered processing method of this embodiment can be applied to array antennas based on the leaky wave principle, and can also be applied to ordinary array antennas, and both can achieve high-precision codebook design and layered codebook performance.

[0139] As an optional embodiment, the method further includes:

[0140] Based on each layer of codewords in the hierarchical codebook, sending a first signal to a signal receiving device;

[0141] receiving a response message sent by the signal receiving device, wherein the response message includes a number corresponding to the optimal codeword;

[0142] If there are at least two signal receiving devices that feedback the same optimal codeword number, the codeword of the hierarchical codebook is resynthesized, and based on the codeword of each layer of the resynthesized hierarchical codebook, a second signal is sent to the signal receiving device until the numbers corresponding to the optimal codewords in the response messages sent by all signal receiving devices are different.

[0143] Optionally, if the initial codeword corresponding to the first signal is continuous, the initial codeword corresponding to the second signal is discrete;

[0144] or,

[0145] If the initial codeword corresponding to the first signal is discrete, the initial codeword corresponding to the second signal is continuous.

[0146] In this embodiment, the codebook generated by the present application can be optimized. Specifically: the signal transmitting end generates a basic codebook required for scanning according to the scanning range and coverage requirements, and further synthesizes a layered codebook according to the method of the present application. The signal transmitting end trains the hierarchical codebook. The signal transmitting end (which can be a base station or a terminal) uses the codeword of the same layer to send signals in one round of search. The signal receiving end evaluates multiple codewords of the layer by using the reference signal received power (RSRP) or other indicators, and feeds back the number of the best codeword to the signal transmitting end. If there is no obvious difference in performance between the codewords of the layer (that is, the number of the best codewords fed back by multiple signal receiving ends is the same), the signal transmitting end can use another beamforming strategy to generate a new hierarchical codebook to avoid extreme situations and achieve good performance. For example, if the signal transmitting end uses the continuous codebook strategy to generate a codebook, and the generated codebook cannot distinguish the performance between multiple codewords, the signal transmitting end re-synthesizes the hierarchical codebook based on the discrete codebook strategy, re-trains the hierarchical codebook, uses the codeword of the same layer to send signals, and determines the performance of each codeword according to the number of the best codeword fed back by the signal receiving end.

[0147] Optionally, the sending a first signal to a signal receiving device based on the codeword of each layer of the hierarchical codebook includes:

[0148] For a layered codebook of the i-th layer, sending a first signal to a signal receiving device based on a target codeword in the layered codebook of the i-th layer;

[0149] The target codeword is a codeword corresponding to a next-layer subspace of an optimal codeword in the i-1th layer hierarchical codebook.

[0150] Optionally, the method further includes:

[0151] The optimal codeword in the basic codebook is determined according to a response message of a transmitted signal corresponding to each layer of the hierarchical codebook.

[0152] In this embodiment, the entire spatial space is first searched at a coarse granularity, then at a finer granularity, and then at an even finer granularity. The granularity here refers to the coverage of the codeword in the spatial domain. For example: the division strength is 2, first the spatial space is divided into 2 subspaces, and two codewords are used to cover the two subspaces; then, based on user feedback, the relatively better of the two codewords is selected; the space covered by the corresponding optimal codeword is divided into 2 subspaces, and then the next layer of codewords that just cover the two subspaces are searched, and the user feedbacks the best codeword, and this cycle continues until the lowest level of codebook with the highest precision is reached, which is the corresponding basic codebook.

[0153] Among them, for the layered codebook with continuous coverage intervals, that is, the initial codewords corresponding to each codeword of the layered codebook are continuous, the search process is: codeword 1 of the first layer corresponds to codeword 1 and codeword 2 of the second layer, and codeword 2 of the first layer corresponds to codeword 3 and codeword 4 of the second layer. That is: if it is found that codeword 1 of the first layer is better than codeword 2 of the first layer in performance after training the first layer, then codeword 1 and codeword 2 of the second layer are trained in the next layer; if it is found that codeword 2 of the first layer is better than codeword 1 of the first layer in performance after training the first layer, then codeword 3 and codeword 4 of the second layer are trained in the next layer.

[0154] For a layered codebook with discrete coverage intervals, that is, the initial codeword corresponding to each codeword in the layered codebook is discrete, the search process is: codeword 1 of the first layer corresponds to codeword 1 and codeword 3 of the second layer, and codeword 2 of the first layer corresponds to codeword 2 and codeword 4 of the second layer. Codeword 3 of the second layer corresponds to codeword 3 and codeword 7 of the third layer, and the codeword representation formula of the above-mentioned method 2 can be referred to. If it is found that codeword 1 of the first layer is better than codeword 2 of the first layer in performance after training the first layer, then codeword 1 and codeword 3 of the second layer are trained in the next layer; if it is found that codeword 2 of the first layer is better than codeword 1 of the first layer in performance after training the first layer, then codeword 2 and codeword 4 of the second layer are trained in the next layer.

[0155] In this embodiment, after generating a hierarchical codebook, beamforming can be performed based on the hierarchical codebook. Specifically, first, according to the aperture size of the antenna array and the required coverage range, the hierarchical codebook generated by this application is used to obtain the pointing angle and coverage range corresponding to the required codeword; according to the inherent waveguide transmission constant of the antenna array itself, the pointing angle and coverage range corresponding to the codeword, and based on the beamforming formula, the amplitude modulation coefficient α corresponding to the codeword is obtained. n ; Then the signal transmitter modulates the amplitude coefficient α n Stored in the local memory, and α n A one-to-one association is made with the corresponding beam pointing angle and coverage range.

[0156] At the signal transmitting end, when the carrier signal (reference wave) is transmitted inside the antenna array, it is only necessary to call the codeword corresponding to the spatial information according to the required coverage (i.e., coverage range) so that the amplitude of each radiating unit on the antenna array satisfies the α in the codebook. n The corresponding state can get the beam in the corresponding direction.

[0157] Optionally, taking the antenna array as an RHS array as an example, the beamforming formula is, for example:

[0158] For the RHS linearly arranged on the x-axis, the spacing is set to dx, and the position of the nth unit is x n =x0+nd x , x0 is the reference position; N is the number of radiating elements on the RHS; its adjustable amplitude modulation coefficient is α n , so the resulting array factor can be shown as:

[0159]

[0160] Where, for a two-dimensional RHS, θ is the beam pointing angle of one dimension of the RHS; φ is the pointing angle of another dimension on the two-dimensional RHS, which is simplified to an arbitrary fixed value in the one-dimensional case, and is set to Φ = π / 2 here, k f =n eff k0 represents the transmission coefficient of electromagnetic waves in the waveguide structure of RHS, n eff is a constant greater than 1; k0 is the transmission coefficient of electromagnetic waves in free space. For the RHS waveguide, its transmission characteristics can be expressed as:

[0161]

[0162] Its gain in the far field is proportional to the absolute value of AF, which (based on the Fraunhofer approximation) is:

[0163]

[0164] For the target pointing θ t , only the amplitude modulation coefficient α needs to be adjusted n To satisfy:

[0165]

[0166] For some RHS, the amplitude cannot be negative. In this case, the amplitude can be set to the range that the RHS can reach, as follows:

[0167]

[0168] Among them, D n is the average of the angular range that the antenna array can cover, A n It is half the value of the boundary difference of the angular range that the antenna array can cover.

[0169] It should be noted that the amplitude modulation coefficient can be equivalent to spatial modulation, so the AF with the above amplitude design can be rewritten as:

[0170]

[0171] The three spatial harmonics appearing above are due to n eff When it is greater than 1, the first and third terms in the above equation become evanescent waves, so that only the second term in the target direction forms a directional beam in the far field.

[0172] According to the waveguide transmission constant of the antenna array itself, the pointing angle and coverage range corresponding to the codeword, and based on the above beamforming formula, the amplitude modulation coefficient α corresponding to the codeword can be determined n , and α can be n When the carrier signal is transmitted inside the antenna array, it is only necessary to call the codeword corresponding to the spatial information according to the coverage range so that the amplitude of each radiating unit on the antenna array satisfies the codebook α n The corresponding state can get the beam in the corresponding direction.

[0173] This application describes the design and training process of a hierarchical codebook from the perspectives of continuous generation and discrete generation, which can isolate the beams from each other (quasi-orthogonal), thereby further improving the codebook performance. The embodiment of this application also describes the process of searching (i.e., training) the hierarchical codebook, so that the entire solution has stronger reliability and robustness.

[0174] In an embodiment of the present application, a communication device divides the spatial space M times according to a first granularity to obtain M layers of subspaces; based on the initial codewords contained in the basic codebook corresponding to each layer of subspace, the codewords of the layered codebook are synthesized, so that the beams can be isolated from each other, thereby improving the codebook performance; the present application takes into account the information feedback time of the user to the signal transmitting end after each layer of codebook, which can effectively reduce the time complexity, and can avoid the performance error caused by waveform distortion in the traditional layered codebook, and effectively improves the performance of the layered codebook.

[0175] The above embodiments introduce the codebook layering processing method of the present application. The following embodiments will further illustrate the corresponding device in conjunction with the accompanying drawings.

[0176] Specifically, Figure 2As shown, an embodiment of the present application provides a codebook layered processing device 200, which is applied to a communication device, wherein the communication device is a signal sending device, which may be a network device (such as a base station) or a terminal, and the device includes:

[0177] The division unit 210 divides the spatial space M times according to the first granularity to obtain M layers of subspaces; wherein each division is performed on the subspace obtained by the previous division;

[0178] A first processing unit 220, configured to synthesize codewords of a hierarchical codebook based on initial codewords included in a basic codebook corresponding to each layer of subspace;

[0179] The initial codewords contained in the basic codebook corresponding to each layer of subspace are continuous or discrete; M is greater than or equal to 1.

[0180] Optionally, the device further comprises:

[0181] A first determining unit, configured to determine the number of divisions of the spatial domain space according to the number of initial codewords included in the basic codebook;

[0182] The number of subspaces obtained by the last division is equal to the number of initial codewords included in the basic codebook, and each subspace obtained by the last division corresponds to a coverage space of the initial codeword.

[0183] Optionally, the first processing unit is specifically configured to:

[0184] For each layer of subspace, the initial codewords are divided in order according to the number of subspaces included, so as to obtain a plurality of continuous initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of continuous initial codewords;

[0185] or,

[0186] For each layer of subspace, the initial codewords are divided according to a first rule according to the number of subspaces included, so as to obtain a plurality of discrete initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of non-continuous initial codewords.

[0187] Optionally, the first processing unit is specifically configured to:

[0188] Dividing the initial codeword into codeword intervals equal in number to the subspaces, each subspace corresponding to a codeword interval;

[0189] The multiple initial codewords included in each codeword interval are arranged according to a first rule, and the multiple initial codewords included in each codeword interval are discrete.

[0190] Optionally, the device further comprises:

[0191] A sending unit, configured to send a first signal to a signal receiving device based on a codeword of each layer of the hierarchical codebook;

[0192] A receiving unit, configured to receive a response message sent by the signal receiving device, wherein the response message includes a number corresponding to the optimal codeword;

[0193] The second processing unit is configured to resynthesize the codewords of the hierarchical codebook if there are at least two signal receiving devices that have the same number of optimal codewords fed back, and send a second signal to the signal receiving device based on the codewords of each layer of the resynthesized hierarchical codebook until the numbers corresponding to the optimal codewords in the response messages sent by all signal receiving devices are different.

[0194] Optionally, if the initial codeword corresponding to the first signal is continuous, the initial codeword corresponding to the second signal is discrete;

[0195] or,

[0196] If the initial codeword corresponding to the first signal is discrete, the initial codeword corresponding to the second signal is continuous.

[0197] Optionally, the sending unit is specifically used for:

[0198] For a layered codebook of the i-th layer, sending a first signal to a signal receiving device based on a target codeword in the layered codebook of the i-th layer;

[0199] The target codeword is a codeword corresponding to a next-layer subspace of an optimal codeword in the i-1th layer hierarchical codebook.

[0200] Optionally, the device further comprises:

[0201] The second determining unit is configured to determine the optimal codeword in the basic codebook according to a response message of a sending signal corresponding to each layer of the hierarchical codebook.

[0202] It should be noted here that the above-mentioned device provided in the embodiment of the present application can implement all the method steps implemented by the above-mentioned method embodiment applied to the communication device, and can achieve the same technical effect. The parts and beneficial effects of this embodiment that are the same as the method embodiment will not be described in detail here.

[0203] It should be noted that the division of units in the embodiments of the present application is schematic and is only a logical function division. There may be other division methods in actual implementation. In addition, each functional unit in each embodiment of the present application may be integrated into a first processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of a software functional unit.

[0204] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a processor-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, server, or network device, etc.) or a processor (processor) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), disk or optical disk and other media that can store program codes.

[0205] like Figure 3 As shown, an embodiment of the present application further provides a communication device, including: a memory 320, a transceiver 300, and a processor 310; wherein the memory 320 is used to store a computer program; the transceiver 300 is used to receive and send data under the control of the processor 310; the processor 310 is used to read the computer program in the memory and perform the following operations:

[0206] The spatial space is divided M times according to the first granularity to obtain M layers of subspaces; wherein each division is performed on the subspace obtained by the previous division;

[0207] Based on the initial codewords contained in the basic codebook corresponding to each layer of subspace, synthesize the codewords of the hierarchical codebook;

[0208] The initial codewords contained in the basic codebook corresponding to each layer of subspace are continuous or discrete; M is greater than or equal to 1.

[0209] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0210] Determine the number of divisions of the spatial domain space according to the number of initial codewords included in the basic codebook;

[0211] The number of subspaces obtained by the last division is equal to the number of initial codewords included in the basic codebook, and each subspace obtained by the last division corresponds to a coverage space of the initial codeword.

[0212] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0213] For each layer of subspace, the initial codewords are divided in order according to the number of subspaces included, so as to obtain a plurality of continuous initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of continuous initial codewords;

[0214] or,

[0215] For each layer of subspace, the initial codewords are divided according to a first rule according to the number of subspaces included, so as to obtain a plurality of discrete initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of non-continuous initial codewords.

[0216] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0217] Dividing the initial codeword into codeword intervals equal in number to the subspaces, each subspace corresponding to a codeword interval;

[0218] The multiple initial codewords included in each codeword interval are arranged according to a first rule, and the multiple initial codewords included in each codeword interval are discrete.

[0219] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0220] Based on each layer of codewords in the hierarchical codebook, sending a first signal to a signal receiving device;

[0221] receiving a response message sent by the signal receiving device, wherein the response message includes a number corresponding to the optimal codeword;

[0222] If there are at least two signal receiving devices that feedback the same optimal codeword number, the codeword of the hierarchical codebook is resynthesized, and based on the codeword of each layer of the resynthesized hierarchical codebook, a second signal is sent to the signal receiving device until the numbers corresponding to the optimal codewords in the response messages sent by all signal receiving devices are different.

[0223] Optionally, if the initial codeword corresponding to the first signal is continuous, the initial codeword corresponding to the second signal is discrete;

[0224] or,

[0225] If the initial codeword corresponding to the first signal is discrete, the initial codeword corresponding to the second signal is continuous.

[0226] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0227] For a layered codebook of the i-th layer, sending a first signal to a signal receiving device based on a target codeword in the layered codebook of the i-th layer;

[0228] The target codeword is a codeword corresponding to a next-layer subspace of an optimal codeword in the i-1th layer hierarchical codebook.

[0229] Optionally, the processor is configured to read the computer program in the memory and perform the following operations:

[0230] The optimal codeword in the basic codebook is determined according to a response message of a transmitted signal corresponding to each layer of the hierarchical codebook.

[0231] Among them, Figure 3 In the embodiment, the bus architecture may include any number of interconnected buses and bridges, specifically linking together various circuits of one or more processors represented by processor 310 and memory represented by memory 320. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, and power management circuits, which are well known in the art and are therefore not further described herein. The bus interface provides an interface. The transceiver 300 may be a plurality of components, namely including a transmitter and a transceiver, providing a unit for communicating with various other devices on a transmission medium. The processor 310 is responsible for managing the bus architecture and general processing, and the memory 320 may store data used by the processor 310 when performing operations.

[0232] The processor 310 may be a central processing unit (CPU), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or a complex programmable logic device (CPLD). The processor may also adopt a multi-core architecture.

[0233] It should be noted here that the above-mentioned device provided in the embodiment of the present application can implement all the method steps implemented by the above-mentioned method embodiment applied to the communication device, and can achieve the same technical effect. The parts and beneficial effects of this embodiment that are the same as the method embodiment will not be described in detail here.

[0234] In addition, a specific embodiment of the present application further provides a processor-readable storage medium on which a computer program is stored, wherein the program, when executed by the processor, implements the steps of the above-mentioned codebook layering processing method, and can achieve the same technical effect. To avoid repetition, it is not repeated here. Among them, the readable storage medium can be any available medium or data storage device that can be accessed by the processor, including but not limited to magnetic storage (such as floppy disk, hard disk, tape, magneto-optical disk (MO), etc.), optical storage (such as CD, DVD, BD, HVD, etc.), and semiconductor storage (such as ROM, EPROM, EEPROM, non-volatile memory (NAND FLASH), solid-state drive (SSD)), etc.

[0235] It should be noted that the technical solution provided in the embodiment of the present application can be applicable to a variety of systems, especially 5G systems. For example, the applicable system can be a global system of mobile communication (GSM) system, a code division multiple access (CDMA) system, a wideband code division multiple access (WCDMA) general packet radio service (GPRS) system, a long term evolution (LTE) system, a LTE frequency division duplex (FDD) system, a LTE time division duplex (TDD) system, an advanced long term evolution (LTE-A) system, a universal mobile telecommunication system (UMTS), a world-wide interoperability for microwave access (WiMAX) system, a 5G new radio (NR) system, etc. These various systems include terminal equipment and network equipment. The system may also include a core network part, such as an evolved packet system (EPS), a 5G system (5GS), etc.

[0236] The terminal device involved in the embodiment of the present application may be a device that provides voice and / or data connectivity to a user, a handheld device with a wireless connection function, or other processing devices connected to a wireless modem. In different systems, the name of the terminal device may also be different. For example, in a 5G system, the terminal device may be called a user equipment (UE). A wireless terminal device can communicate with one or more core networks (CN) via a radio access network (RAN). The wireless terminal device may be a mobile terminal device, such as a mobile phone (or a "cellular" phone) and a computer with a mobile terminal device. For example, it may be a portable, pocket-sized, handheld, computer-built-in or vehicle-mounted mobile device that exchanges language and / or data with a wireless access network. For example, personal communication service (PCS) phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs) and other devices. The wireless terminal device may also be referred to as a system, a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, an access point, a remote terminal device, an access terminal device, a user terminal device, a user agent, and a user device, but is not limited in the embodiments of the present application.

[0237] The network device involved in the embodiment of the present application may be a base station, which may include multiple cells providing services for the terminal. Depending on the specific application scenario, the base station may also be called an access point, or may be a device in the access network that communicates with the wireless terminal device through one or more sectors on the air interface, or other names. The network device may be used to interchange received air frames with Internet Protocol (IP) packets, and serve as a router between the wireless terminal device and the rest of the access network, wherein the rest of the access network may include an Internet Protocol (IP) communication network. The network device may also coordinate the attribute management of the air interface. For example, the network device involved in the embodiments of the present application may be a network device (Base Transceiver Station, BTS) in the Global System for Mobile communications (Global System for Mobile communications, GSM) or Code Division Multiple Access (Code Division Multiple Access, CDMA), or a network device (NodeB) in Wide-band Code Division Multiple Access (WCDMA), or an evolutionary network device (evolutional Node B, eNB or e-NodeB) in the long term evolution (long term evolution, LTE) system, a 5G base station (gNB) in the 5G network architecture (next generation system), or a home evolved Node B (Home evolved Node B, HeNB), a relay node, a home base station (femto), a pico base station (pico), etc., which is not limited in the embodiments of the present application. In some network structures, the network device may include a centralized unit (CU) node and a distributed unit (DU) node, and the centralized unit and the distributed unit may also be arranged geographically separately.

[0238] Network devices and terminal devices can each use one or more antennas for multiple-input multiple-output (MIMO) transmission. MIMO transmission can be single-user MIMO (SU-MIMO) or multi-user MIMO (MU-MIMO). Depending on the form and number of antenna combinations, MIMO transmission can be 2D-MIMO, 3D-MIMO, FD-MIMO or massive-MIMO, or it can be diversity transmission, precoded transmission or beamforming transmission, etc.

[0239] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) that contain computer-usable program code.

[0240] The present application is described with reference to the flowchart and / or block diagram of the method, device (system) and computer program product according to the embodiment of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, and the combination of the process and / or box in the flowchart and / or block diagram can be implemented by computer executable instructions. These computer executable instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce a device for implementing a process or multiple processes in the flowchart and / or a box or multiple boxes in the block diagram.

[0241] These processor-executable instructions may also be stored in a processor-readable memory that can direct a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the processor-readable memory produce a product including an instruction device that implements the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0242] These processor-executable instructions may also be loaded onto a computer or other programmable data processing device so that a series of operational steps are performed on the computer or other programmable device to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and / or one or more boxes in the block diagram.

[0243] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A codebook layering processing method, characterized in that: include: The spatial space is divided M times according to the first granularity to obtain M layers of subspaces; wherein each division is performed on the subspace obtained by the previous division; Based on the initial codewords contained in the basic codebook corresponding to each layer of subspace, synthesize the codewords of the hierarchical codebook; The initial codewords contained in the basic codebook corresponding to each layer of subspace are continuous or discrete; M is greater than or equal to 1.

2. The method according to claim 1, characterized in that The method further comprises: Determine the number of divisions of the spatial domain space according to the number of initial codewords included in the basic codebook; The number of subspaces obtained by the last division is equal to the number of initial codewords included in the basic codebook, and each subspace obtained by the last division corresponds to a coverage space of the initial codeword.

3. The method according to claim 1, characterized in that The step of synthesizing the codewords of the hierarchical codebook based on the initial codewords contained in the basic codebook corresponding to each layer of subspace includes: For each layer of subspace, the initial codewords are divided in order according to the number of subspaces included, so as to obtain a plurality of continuous initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of continuous initial codewords; or, For each layer of subspace, the initial codewords are divided according to a first rule according to the number of subspaces included, so as to obtain a plurality of discrete initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of non-continuous initial codewords.

4. The method according to claim 3, characterized in that The dividing the initial codeword according to the number of subspaces included according to a first rule includes: Dividing the initial codeword into codeword intervals equal in number to the subspaces, each subspace corresponding to a codeword interval; The multiple initial codewords included in each codeword interval are arranged according to a first rule, and the multiple initial codewords included in each codeword interval are discrete.

5. The method according to claim 1, characterized in that The method further comprises: Based on each layer of codewords in the hierarchical codebook, sending a first signal to a signal receiving device; receiving a response message sent by the signal receiving device, wherein the response message includes a number corresponding to the optimal codeword; If there are at least two signal receiving devices that feedback the same optimal codeword number, the codeword of the hierarchical codebook is resynthesized, and based on the codeword of each layer of the resynthesized hierarchical codebook, a second signal is sent to the signal receiving device until the numbers corresponding to the optimal codewords in the response messages sent by all signal receiving devices are different.

6. The method according to claim 5, characterized in that If the initial codeword corresponding to the first signal is continuous, the initial codeword corresponding to the second signal is discrete; or, If the initial codeword corresponding to the first signal is discrete, the initial codeword corresponding to the second signal is continuous.

7. The method according to claim 5, characterized in that The sending a first signal to a signal receiving device based on each layer of codewords in the hierarchical codebook includes: For a layered codebook of the i-th layer, sending a first signal to a signal receiving device based on a target codeword in the layered codebook of the i-th layer; The target codeword is a codeword corresponding to a next-layer subspace of an optimal codeword in the i-1th layer hierarchical codebook.

8. The method according to claim 5 or 7, characterized in that: The method further comprises: The optimal codeword in the basic codebook is determined according to a response message of a transmitted signal corresponding to each layer of the hierarchical codebook.

9. A communication device, characterized in that: include: Memory, transceiver, processor: Memory for storing computer programs; a transceiver for receiving and sending data under the control of the processor; A processor is configured to read the computer program in the memory and perform the following operations: The spatial space is divided M times according to the first granularity to obtain M layers of subspaces; wherein each division is performed on the subspace obtained by the previous division; Based on the initial codewords contained in the basic codebook corresponding to each layer of subspace, synthesize the codewords of the hierarchical codebook; The initial codewords contained in the basic codebook corresponding to each layer of subspace are continuous or discrete; M is greater than or equal to 1.

10. The communication device according to claim 9, characterized in that The processor is configured to read the computer program in the memory and perform the following operations: Determine the number of divisions of the spatial domain space according to the number of initial codewords included in the basic codebook; The number of subspaces obtained by the last division is equal to the number of initial codewords included in the basic codebook, and each subspace obtained by the last division corresponds to a coverage space of the initial codeword.

11. The communication device according to claim 9, characterized in that The processor is configured to read the computer program in the memory and perform the following operations: For each layer of subspace, the initial codewords are divided in order according to the number of subspaces included, so as to obtain a plurality of continuous initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of continuous initial codewords; or, For each layer of subspace, the initial codewords are divided according to a first rule according to the number of subspaces included, so as to obtain a plurality of discrete initial codewords corresponding to each subspace; and a codeword of a hierarchical codebook corresponding to the subspace is generated according to the plurality of non-continuous initial codewords.

12. The communication device according to claim 11, characterized in that The processor is configured to read the computer program in the memory and perform the following operations: Dividing the initial codeword into codeword intervals equal in number to the subspaces, each subspace corresponding to a codeword interval; The multiple initial codewords included in each codeword interval are arranged according to a first rule, and the multiple initial codewords included in each codeword interval are discrete.

13. The communication device according to claim 9, characterized in that The processor is configured to read the computer program in the memory and perform the following operations: Based on each layer of codewords in the hierarchical codebook, sending a first signal to a signal receiving device; receiving a response message sent by the signal receiving device, wherein the response message includes a number corresponding to the optimal codeword; If there are at least two signal receiving devices that feedback the same optimal codeword number, the codeword of the hierarchical codebook is resynthesized, and based on the codeword of each layer of the resynthesized hierarchical codebook, a second signal is sent to the signal receiving device until the numbers corresponding to the optimal codewords in the response messages sent by all signal receiving devices are different.

14. The communication device according to claim 13, characterized in that If the initial codeword corresponding to the first signal is continuous, the initial codeword corresponding to the second signal is discrete; or, If the initial codeword corresponding to the first signal is discrete, the initial codeword corresponding to the second signal is continuous.

15. The communication device according to claim 13, characterized in that The processor is configured to read the computer program in the memory and perform the following operations: For a layered codebook of the i-th layer, sending a first signal to a signal receiving device based on a target codeword in the layered codebook of the i-th layer; The target codeword is a codeword corresponding to a next-layer subspace of an optimal codeword in the i-1th layer hierarchical codebook.

16. The communication device according to claim 13 or 15, characterized in that: The processor is configured to read the computer program in the memory and perform the following operations: The optimal codeword in the basic codebook is determined according to a response message of a transmitted signal corresponding to each layer of the hierarchical codebook.

17. A codebook hierarchical processing device, characterized in that: include: A partitioning unit is used to partition the spatial space M times according to the first granularity to obtain M layers of subspaces; wherein each partition is performed on the subspace obtained by the previous partition; A first processing unit, configured to synthesize codewords of a hierarchical codebook based on initial codewords included in a basic codebook corresponding to each layer of subspace; The initial codewords contained in the basic codebook corresponding to each layer of subspace are continuous or discrete; M is greater than or equal to 1.

18. A processor-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the codebook layering processing method according to any one of claims 1 to 8 are implemented.

Images