WO2014023031A1

WO2014023031A1 - Scheduling method and device for sending sensing pilot

Info

Publication number: WO2014023031A1
Application number: PCT/CN2012/079983
Authority: WO
Inventors: 刘建琴; 闫志宇; 吴强; 李强
Original assignee: 华为技术有限公司
Priority date: 2012-08-10
Filing date: 2012-08-10
Publication date: 2014-02-13
Also published as: CN104170440A; CN104170440B

Abstract

Disclosed are a scheduling method and device for sending a sensing pilot. The method comprises: mapping communication nodes to a time-frequency resource used for sending a sensing pilot; conducting at least one frequency hopping operation on the communication nodes in a first matrix, so that each communication node located in the same column of the first matrix and each of the other communication nodes in the same column are located in different columns after the at least one frequency hopping; and in each transmission time slot in each transmission cycle, scheduling the communication nodes in the column corresponding to the transmission time slot so as to send a sensing pilot. The embodiments of the present invention conduct a frequency hopping operation through the communication nodes mapped in the first matrix so as to enable more than one communication node to obtain the sensing pilot in each transmission time slot in each transmission cycle and ensure that each communication node can obtain the sensing pilots of all communication nodes through small transmission time slots, thereby improving the scheduling efficiency of the sensing pilot.

Description

Scheduling method and device for transmitting listening pilot

TECHNICAL FIELD The present invention relates to the field of communications technologies, and in particular, to a scheduling method and apparatus for transmitting a listening pilot. Background technique

With the development of mobile communication technologies and the large-scale deployment of third generation (Third Generation, 3G) networks, end users are provided with high-speed and large-bandwidth data services. Since most data services occur in indoor environments, communication nodes need to be widely deployed indoors. With the extensive deployment of indoor communication nodes and the introduction of direct communication between terminals, the complexity of the network interference environment is increased, in order to better manage the interference within the network and detect the interference sources in the network. The communication node in the communication network needs to obtain interference information between the communication node and other communication nodes by acquiring the interception pilots of other communication nodes.

In a communication network including a plurality of communication nodes, in order for each communication node to obtain the listening pilots transmitted by other communication nodes, it is necessary to ensure that each communication node transmits a listening pilot once, and each communication node can Acquire a listening pilot sent by at least one other communication node. In the prior art, when a communication node sends a listening pilot, the communication node cannot detect the pilots sent by other communication nodes and the communication node at the same time, so that each communication node can acquire the detection of other nodes. To listen to the pilot, only one communication node needs to receive the listening pilot in each time slot, and the other communication nodes send the listening pilot. Taking a communication network including N communication nodes as an example, in each time slot, one communication node receives the interception pilot, and the other N-1 communication nodes transmit the interception pilot, so it is necessary to pass N time slots. After that, it can be guaranteed that each communication node acquires the listening pilots of other communication nodes.

In the prior art, in the process of scheduling the listening pilot, only one communication node in each time slot receives the listening pilot, and the other communication nodes send the listening pilot, so the N communication nodes in the network need The acquisition of the interception pilot can be completed after N time slots. When the number of communication nodes included in the network is large, it takes a long time to acquire the interception pilot, so the scheduling efficiency of the interception pilot is low. SUMMARY OF THE INVENTION In view of this, an embodiment of the present invention provides a scheduling method and apparatus for transmitting a listening pilot to solve the problem of low scheduling efficiency of a listening pilot in the prior art. In one aspect, a scheduling method for transmitting a listening pilot is provided, where the method includes: mapping a communication node to a time-frequency resource for transmitting a listening pilot, where the mapped communication node is configured on a time-frequency resource. a matrix, the first matrix corresponding to a first transmission period;

Performing at least one frequency hopping operation on the communication nodes in the first matrix such that each communication node located in the same column in the first matrix communicates with each of the other communication nodes on the same column The node is located on different columns after at least one frequency hopping, wherein the matrix formed after each frequency hopping operation corresponds to a new transmission period;

Dispatching a communication pilot on a column corresponding to the one transmission time slot on each of the transmission time slots in each transmission period, wherein each column in the matrix corresponding to each transmission period corresponds to A transmission time slot within the transmission period.

In a possible implementation, the performing the at least one frequency hopping operation on the communication node in the first matrix includes:

The communication nodes in the matrix performing each frequency hopping operation are divided to obtain sub-matrices, and the communication nodes in at least one of the sub-matrices are rearranged.

In combination with one of the foregoing possible implementation manners, in one embodiment, the communication node in a matrix performing each frequency hopping operation is divided to obtain a sub-matrix, and in at least one sub-matrix in the sub-matrix The communication nodes are rearranged, including:

When the first matrix is a matrix of the number of rows m and the number of columns n, in a frequency hopping operation, the communication node in the first matrix is divided into a sub-matrix, and in the sub-matrix Communication node performs a transposition operation; or,

When the first matrix is a matrix of the number of rows m and the number of columns n, in a frequency hopping operation, the communication node in the first matrix is divided into a sub-matrix, and in the sub-matrix The communication nodes on different lines perform misalignment operations of varying numbers of times.

In combination with the foregoing possible implementation manner, in another embodiment, the communication node in the matrix performing each frequency hopping operation is divided to obtain a sub-matrix, and in at least one sub-matrix in the sub-matrix The communication nodes are rearranged, including:

When the first matrix is a matrix whose row number m is smaller than the column number n, in a frequency hopping operation, the communication node in the first matrix is divided into one sub-matrix, and different rows in the sub-matrix The upper communication node performs a misalignment operation of unequal times.

When the first matrix is a matrix whose number of rows m is greater than the number of columns n, in a frequency hopping operation, the first matrix is divided into at least one sub-matrix of n rows, and a sub-matrix of less than n rows, Performing a misalignment operation of unequal times of communication nodes on different rows in the sub-matrices smaller than n rows;

In the next frequency hopping operation, in the sub-matrix of the at least one n rows, the communication node of each sub-matrix performs a transposition operation;

In the next frequency hopping operation, the communication nodes on the same row in each of the sub-matrices of the at least one n-row are respectively extracted to form n second matrices, when the number of rows of the second matrix is not greater than the column a number of times, performing a misalignment operation of unequal times on the communication nodes in the second matrix, and when the number of rows of the second matrix is greater than the number of columns, each of the second matrices is used as a new first matrix The foregoing steps are repeated until the number of rows of the second matrix is not greater than the number of columns.

In the next frequency hopping operation, among the sub-matrices of the at least one n rows, the communication nodes on different rows of each sub-matrix perform misalignment operations of unequal times;

In another aspect, a scheduling apparatus for transmitting a listening pilot is provided, the apparatus comprising:

a mapping unit, configured to map the communication node to a time-frequency resource for transmitting a listening pilot, where the mapped communication node forms a first matrix on the time-frequency resource, where the first matrix corresponds to the first transmission period;

a frequency hopping unit, configured to perform at least one frequency hopping operation on the communication node in the first matrix, so that each communication node located in the same column in the first matrix communicates with other communications on the same column Each communication node in the node is located on a different column after at least one frequency hopping, wherein a matrix formed after each frequency hopping operation corresponds to a new transmission period; a scheduling unit, configured to, on each of the transmission time slots in each transmission period, schedule a communication node on a column corresponding to the one transmission time slot to send a listening pilot, where each of the transmission periods corresponds to a matrix Each column corresponds to one transmission slot in the transmission period.

In a possible implementation, the frequency hopping unit is specifically configured to divide a communication node in a matrix that performs each frequency hopping operation, obtain a sub-matrix, and at least one sub-matrix in the sub-matrix The communication nodes in the middle are rearranged.

In combination with the foregoing possible implementation manner, in an embodiment, the frequency hopping unit includes: a first frequency hopping subunit, configured to: when the first matrix is a matrix of the number of rows m and the number of columns n And dividing, in a frequency hopping operation, the communication node in the first matrix into a sub-matrix, and performing a transposition operation on the communication node in the sub-matrix; or, when the first matrix is a row When the number m is equal to the number of columns n, in a frequency hopping operation, the communication node in the first matrix is divided into a sub-matrix, and the number of communication nodes on different rows in the sub-matrix is performed. Unequal misalignment operations.

In combination with the foregoing possible implementation manner, in another embodiment, the frequency hopping unit includes: a second frequency hopping subunit, configured to: when the first matrix is a matrix whose number of rows m is smaller than the number of columns n In a frequency hopping operation, the communication node in the first matrix is divided into a sub-matrix, and the communication nodes on different rows in the sub-matrix are subjected to misalignment operations of unequal times.

In combination with the foregoing possible implementation manner, in another embodiment, the frequency hopping unit includes: a third frequency hopping subunit, configured to: when the first matrix is a matrix whose number of rows m is greater than the number of columns n In a frequency hopping operation, dividing the first matrix into at least one sub-matrix of n rows, and a sub-matrix of less than n rows, performing communication nodes on different rows in the sub-matrices smaller than n rows a misalignment operation in which the number of times is different; in the next frequency hopping operation, a transposition operation is performed on each of the sub-matrices of the at least one sub-matrix, and in the next frequency hopping operation, respectively a communication node on the same row in each of the sub-matrices of the at least one n-row, forming n second matrices, and when the number of rows of the second matrix is not greater than the number of columns, in the second matrix The communication node performs a misalignment operation of unequal times. When the number of rows of the second matrix is greater than the number of columns, each of the second matrices is used as a new first matrix, and the foregoing steps are repeatedly performed until The number of rows of said second matrix is no greater than the number of columns.

In combination with the foregoing possible implementation manner, in another embodiment, the frequency hopping unit includes: a fourth frequency hopping subunit, configured to: when the first matrix is a matrix whose number of rows m is greater than the number of columns n In a frequency hopping operation, dividing the first matrix into at least one sub-matrix of n rows, and a sub-matrix smaller than n rows, performing communication nodes on different rows in the sub-matrices smaller than n rows Unequal shifts or different misalignment operations; in the next frequency hopping operation, each sub-matrix of the at least one n-row The communication nodes on different rows of the matrix perform unequal shifts or different misalignment operations; in the next frequency hopping operation, extract the same row in each of the sub-matrices of the at least one n-row a communication node, comprising n second matrices, when the number of rows of the second matrix is not greater than the number of columns, performing a misalignment operation of unequal times on the communication nodes in the second matrix, when the second When the number of rows of the matrix is greater than the number of columns, each of the second matrices is used as a new first matrix, and the foregoing steps are repeatedly performed until the number of rows of the second matrix is not greater than the number of columns.

In the embodiment of the present invention, the communication node is mapped to the time-frequency resource for transmitting the interception pilot, and the mapped communication node forms a first matrix on the time-frequency resource, where the first matrix corresponds to the first transmission period. Performing at least one frequency hopping operation on the communication nodes in the first matrix such that each communication node located in the same column in the first matrix communicates with each of the other communication nodes on the same column The nodes are located on different columns at least after one frequency hopping, wherein the matrix formed after each frequency hopping operation corresponds to a new transmission period, and each of the transmission slots in each transmission period is scheduled and the one transmission is performed. The communication node on the column corresponding to the time slot sends a listening pilot, wherein each column in the matrix corresponding to each transmission period corresponds to one transmission time slot in the transmission period. In the embodiment of the present invention, the frequency hopping operation is performed by the communication node mapped in the first matrix, so that at each of the transmission time slots of each transmission period, more than one communication node can acquire the interception pilot, and the implementation of the present invention is applied. For example, by subdividing the sub-matrix into the matrix and performing successive iterations of transposing or shifting the sub-matrix, it is ensured that each communication node can acquire the interception guide of all other communication nodes through fewer transmission slots. Frequency, thereby improving the scheduling efficiency of the interception pilot. DRAWINGS

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings to be used in the embodiments or the description of the prior art will be briefly described below. Obviously, the drawings in the following description are only It is a certain embodiment of the present invention, and other drawings can be obtained from those skilled in the art without any inventive labor.

1 is a flowchart of an embodiment of a scheduling method for transmitting a listening pilot according to the present invention;

2A is a flowchart of another embodiment of a scheduling method for transmitting a listening pilot according to the present invention:

2B is a schematic diagram of an application example of a frequency hopping process in FIG. 2A;

2C is a schematic diagram of an application example of another frequency hopping process in FIG. 2A;

2D is a schematic diagram of an application example of another frequency hopping process in FIG. 2A;

2E is a schematic diagram of an application example of another frequency hopping process in FIG. 2A;

2F is a schematic diagram of an application example of another frequency hopping process in FIG. 2A; 2G is a schematic diagram of an application example of another frequency hopping process in FIG. 2A;

FIG. 3 is a block diagram of an embodiment of a scheduling apparatus for transmitting a listening pilot according to the present invention. detailed description

The following embodiments of the present invention provide a scheduling method and apparatus for transmitting a listening pilot.

The above-mentioned objects, features, and advantages of the embodiments of the present invention will become more apparent and understood. Give further details. Referring to FIG. 1, which is a flowchart of an embodiment of a scheduling method for transmitting a listening pilot according to the present invention:

Step 101: Map the communication node to the time-frequency resource for transmitting the interception pilot, and the mapped communication node forms a first matrix on the time-frequency resource, where the first matrix corresponds to the first transmission period.

Step 102: Perform at least one frequency hopping operation on the communication node in the first matrix, so that each communication node located in the same column in the first matrix, and each communication node in the other communication node on the same column After at least one frequency hopping, they are located on different columns, and the matrix formed after each frequency hopping operation corresponds to a new transmission period.

Step 103: On each transmission time slot in each transmission period, scheduling a communication node on a column corresponding to the one transmission time slot to send a interception pilot, where each column in the matrix corresponding to each transmission period Corresponding to one transmission time slot in the transmission period.

It can be seen from the above embodiment that the frequency hopping operation is performed by the communication node mapped in the first matrix, so that more than one communication node can acquire the interception pilot on each of the transmission slots of each transmission period, and the present invention is applied. Embodiments, by dividing a sub-matrix into a matrix and performing a iterative operation of transposing or shifting the sub-matrix, ensuring that each communication node can obtain a listening guide of all communication nodes by using fewer transmission slots. Frequency, thereby improving the scheduling efficiency of the interception pilot. 2A is a flowchart of another embodiment of a scheduling method for transmitting a listening pilot according to the present invention: Step 201: mapping a communication node to a time-frequency resource for transmitting a listening pilot, where the mapped communication node is The first matrix is formed on the time-frequency resource, and the first matrix corresponds to the first transmission period.

Step 202: Perform a division on a communication node in a matrix for performing each frequency hopping operation, obtain a sub-matrix, and rearrange communication nodes in at least one sub-matrix in the sub-matrix so that the first matrix is located Each communication node on the same column, with each of the other communication nodes on the same column to Less on a different column after a frequency hopping, wherein the matrix formed after each frequency hopping operation corresponds to a new transmission period.

When the first matrix is a matrix of the number of rows m and the number of columns n:

In a frequency hopping operation, the communication node in the first matrix is divided into a sub-matrix, and a transposition operation is performed on the communication node in the sub-matrix; or, when the first matrix is a row number When a matrix of m is consistent with the number of columns n, in a frequency hopping operation, the communication nodes in the first matrix are divided into one sub-matrix, and the number of communication nodes on different rows in the sub-matrix is varied. The misalignment operation.

When the first matrix is a matrix whose number of rows m is smaller than the number of columns n:

In a frequency hopping operation, the communication node in the first matrix is divided into a sub-matrix, and the communication nodes on different rows in the sub-matrix are subjected to misalignment operations of unequal times.

When the first matrix is a matrix whose number of rows m is greater than the number of columns n:

In a frequency hopping operation, dividing the first matrix into at least one sub-matrix of n rows, and a sub-matrix smaller than n rows, performing communication nodes on different rows in the sub-matrices smaller than n rows a misalignment operation in which the number of times is different; in the next frequency hopping operation, a transposition operation is performed on each of the sub-matrices of the at least one sub-matrix, and in the next frequency hopping operation, respectively a communication node on the same row in each sub-matrix of at least one n-row sub-matrix, forming n second matrices, when the number of rows of the second matrix is not greater than the number of columns, for the second matrix The communication node performs a misalignment operation of unequal times. When the number of rows of the second matrix is greater than the number of columns, each of the second matrices is used as a new first matrix, and the foregoing steps are repeatedly performed until the second The number of rows in the matrix is not greater than the number of columns.

In a frequency hopping operation, dividing the first matrix into at least one sub-matrix of n rows, and a sub-matrix smaller than n rows, performing communication nodes on different rows in the sub-matrices smaller than n rows In the next frequency hopping operation, in the sub-matrix of the at least one n-row, the communication nodes on different rows of each sub-matrix perform misalignment operations of different times; the next frequency hopping In operation, the communication nodes on the same row in each of the sub-matrices of the at least one n-row are respectively extracted to form n second matrices, and when the number of rows of the second matrix is not greater than the number of columns, The communication nodes in the second matrix are misaligned. When the number of rows of the second matrix is greater than the number of columns, each of the second matrices is used as a new first matrix, and the foregoing steps are repeatedly performed until the The number of rows of the second matrix is not greater than the number of columns.

Step 203: On each transmission time slot in each transmission period, scheduling a communication node on a column corresponding to the one transmission time slot to send a interception pilot, where each column in the matrix corresponding to each transmission period Corresponding to one transmission time slot in the transmission period. It can be seen from the above embodiment that the frequency hopping operation is performed by the communication node mapped in the first matrix, so that at each of the transmission time slots of each transmission period, more than one communication node can acquire the interception pilot application and implement the present invention. For example, by subdividing the submatrix into the matrix and performing successive iterations of transposing or shifting the submatrix, it is ensured that each communication node can acquire the interception pilot of all the communication nodes by using fewer transmission slots. , thereby improving the scheduling efficiency of the interception pilot. When applying the above embodiment, it is assumed that the initial first matrix is represented as a matrix A (mX n), where m represents the number of rows, n represents the number of columns, and each element in the matrix A represents a communication node through which The Beacon ID of the communication node is represented, where i is 1 to m, and j is 1 to ^. Matrix A represents a transmission period of the listening pilot, where each column represents a transmission. For all time-slots, all communication nodes within the same transmission time slot (ie, within the same column of the matrix) cannot hear the listening pilots of other communication nodes in the same column because they simultaneously transmit the listening pilots. The communication nodes on the other columns can obtain the listening pilots sent by the communication nodes on the column. When the communication nodes on each column in the matrix A send a listening pilot, it is equivalent to completing the pilot transmission in one transmission period on the matrix A, and the number of transmission slots included in the transmission period is the same as n. . After the communication nodes on the matrix A are transmitted through the pilot of one transmission period, the communication nodes located in the same column cannot acquire the interception pilots of each other, so that each communication node can acquire the detection of other communication nodes. Listening to the pilot, it is necessary to adjust the position of each communication node in the matrix A, and perform the transmission of the interception pilot according to the transmission slot corresponding to the adjusted matrix, so as to ensure each in as few transmission periods as possible. The communication node can acquire the listening pilots of other communication nodes. The position of the communication node in the matrix A corresponds to different transmission periods each time, and the transition from one transmission period to another is equivalent to completing one frequency hopping.

The following combines matrix A with different number of rows m and number of columns n to describe several application examples of frequency hopping processes. The application example of the first frequency hopping process:

When the number of rows and the number of columns of matrix A are equal, that is, n=m, matrix A is a standard square matrix. When frequency hopping is performed, matrix A can be transposed, and each element in matrix A ^^. After the frequency hopping, the corresponding position is ^. When the matrix A is equal in number of rows and columns, only one frequency hopping is required. After two transmission periods, each communication node can acquire the interception sent by all other communication nodes. Pilot.

In addition, when the matrix A is a standard square matrix, when performing frequency hopping, each row element in the matrix A may be separately arranged with a different number of misalignment operations. For example, the element position of the first row in the matrix A is unchanged. Each row from the second row to the mth row is sequentially subjected to different cyclic shifts or other misalignment arrangements to achieve each Frequency hopping of communication nodes. Referring to FIG. 2B, a Beacon matrix including 3×3 communication nodes is taken as an example to describe a process of mapping a communication node in a network into a matrix in which the number of row and column elements is consistent, and performing interception pilot acquisition: In 2B, all communication nodes are represented by their Beacon IDs as 0, 1, 2, ～6, 7, and 8, respectively. These communication nodes form a 3×3 matrix, and each column represents a transmission time slot, where three transmissions are performed. The time slots constitute one transmission period.

For the first transmission period, on the first transmission time slot, the communication node 0, the communication node 1 and the communication node 2 simultaneously transmit the interception pilots, and the above three communication nodes transmit and listen in the same transmission time slot. Pilots, so they cannot acquire the other party's listening pilots, and the communication node 3 to the communication node 8 can acquire the listening pilots of the communication nodes 0 to 2; similarly, on the second transmitting time slot, The communication nodes 0 to 2, and 6 to 8 can acquire the listening pilots of the communication nodes 3 to 5, and on the third transmission time slot, the communication nodes 0 to 5 can acquire the listening guides of the communication nodes 6 to 8. frequency. It can be seen that, in the first transmission period, each communication node can acquire the listening pilot of the communication node at other locations than the same as itself, with the communication node 0 as an example, the communication node 0 can obtain the communication. The nodes 3 to 8 listen for pilots, but the intercept pilots of the communication nodes 1 and 2 are not acquired. Therefore, after the first transmission period, the embodiment of the present invention needs to perform a frequency hopping operation on the communication node at different time-frequency resource locations. In this embodiment, a transposition operation is performed on the communication node in the matrix, so that The communication nodes in the same column in the original matrix may be located on different columns, such as the transmission period of the corresponding second listening pilot in FIG. 2B.

For the second transmission period, on the first transmission time slot, the communication node 0, the communication node 3, and the communication node 6 simultaneously transmit the interception pilot, and the communication nodes 1, 4, 7, 2, 5, 8 can acquire The interception pilots to the communication nodes 0, 3, 6; similarly, on the second transmission time slot, the communication nodes 0, 3, 6, 2, 5, 8 can acquire the detection of the communication nodes 1, 4, and 7. Listening to the pilot, on three transmit time slots, the communication nodes 0, 3, 6, 1, 4, 7 can acquire the listening pilots of the communication nodes 2, 5, 8. It can be seen that after the transmission period of the second interception pilot, each communication node can acquire the interception pilots of all other communication nodes, taking the communication node 0 as an example, in the first transmission period, The communication node 0 does not acquire the interception pilots of the communication nodes 1 and 2, and after the second transmission period, the communication node 0 can acquire the interception pilots of the communication nodes 1 and 2.

It can be seen from the above embodiment that for a matrix in which row and column elements are consistent, wherein the mapped communication node passes through two transmission periods, that is, after one frequency hopping operation, each communication node can acquire all other communication nodes. Listen for pilots. Referring to FIG. 2C, still taking a Beacon matrix including 3×3 communication nodes as an example, another method is described in which a communication node in a network is mapped into a matrix with the same number of row and column elements for interception pilot acquisition. process:

For the first transmission period, it is consistent with the process of acquiring the interception pilot described in FIG. 2B, and will not be described again here.

For the second transmission period, the communication node position on the first line is unchanged, and the communication node on the second line is sequentially shifted forward (in FIG. 2C to the left) by one bit (jump one step), and the communication on the third line The node sequentially shifts forward (in FIG. 2C to the left) by two bits (two steps), so that the communication nodes in the same column in the original matrix can be located on different columns, as shown in FIG. 2C. Listen to the pilot's transmission period. Taking the communication node 0 as an example, in the first transmission period, the communication node 0 does not acquire the listening pilots of the communication nodes 1 and 2, and after the second transmission period, the communication node 0 can acquire the communication node 1 And 2 listen to the pilot.

It can be seen from the above embodiment that for a matrix in which row and column elements are consistent, wherein the mapped communication node passes through two transmission periods, that is, after one frequency hopping operation, each communication node can obtain detection of other communication nodes. Listen to the pilot.

With reference to the description of the frequency hopping process in FIG. 2B and FIG. 2C above, the embodiment of the present invention can be used to ensure that all communication nodes acquire the interception sent by all other communication nodes. Pilot, when the number of communication nodes included in the network is large, that is, when mX n is large, applying the implementation of the present invention can greatly improve the efficiency of acquiring the interception pilot. An application example of the second frequency hopping process:

When the number of rows of the matrix A is smaller than the number of columns, that is, n > m, the matrix A is a non-square matrix, and when the frequency hopping is performed, the position of the element on any row in the matrix can be kept unchanged, except for the row. The elements on each line are misaligned by different frequency hopping; for example, the position of the element on the first line in the matrix A is unchanged, and each line from the second line to the mth line is sequentially arranged with different misalignment to realize each communication node. Frequency hopping, preferably, a misalignment arrangement includes shifting each row element in the (m-1) row in the order of forward hopping or backward hopping i bits (i=L . . m - 1 ).

Wherein, for the backward jump, that is, to the right, the position p after each element in the matrix A is offset

For a forward jump, that is, to the left, the position P of each element in the matrix A "^ offset can be expressed as: Equation 2)

Referring to FIG. 2D, a Beacon matrix including 3×5 communication nodes is taken as an example to describe a process of mapping a communication node in a network into a matrix with fewer rows than the number of columns for interception pilot acquisition:

As shown in Figure 2D, all communication nodes are represented by their BeaconID as 0, 1, 2, - 12, 13, 14. These communication nodes form a 3 X 5 matrix, and each column represents a transmission time slot, where five The transmission slots form a transmission period.

For the first transmission period, on the first transmission time slot, the communication node 0, the communication node 1 and the communication node 2 simultaneously transmit the interception pilots, and the above three communication nodes transmit and listen in the same transmission time slot. Pilots, so they cannot acquire each other's listening pilots, and communication node 3 to communication node 8 can acquire the listening pilots of communication nodes 0 to 2; similarly in the subsequent second transmitting time slots to On each of the fifth transmission time slots, the one of the communication nodes transmitting the interception pilot cannot acquire the interception pilots of other communication nodes in the same column, and the communication nodes on the other columns can obtain The listening pilot sent by the column of communication nodes. It can be seen that in the first transmission period, each communication node can acquire the listening pilot of the communication node at other locations than the same as itself, with the communication node 0 as an example, the communication node 0 can obtain the communication. The nodes 3 to 14 listen for pilots, but the intercept pilots of the communication nodes 1 and 2 are not acquired. Therefore, after the first transmission period, the embodiment of the present invention needs to perform frequency hopping operations on the communication nodes at different time-frequency resource locations. In this embodiment, different frequency hopping is performed on the communication nodes on different rows in the matrix. Operation, specifically, the position of the communication node on the first line is unchanged, and the communication node on the second line is sequentially shifted forward (in FIG. 2D to the left) by one bit (jump one step), and the communication nodes on the third line are sequentially Forward (in Figure 2D to the left) two bits (two steps), so that the communication nodes in the same column in the original matrix can be located on different columns, as shown in Figure 2C. The launch cycle.

For the second transmission period, on the first transmission time slot, the communication node 0, the communication node 4, and the communication node 8 simultaneously transmit the interception pilots, and the communication nodes 3, 7, 11, 6, 10, 14, 9, 13, 2, 12, 1, 5 can obtain the listening pilots of the communication nodes 0, 4, 8; the same in each of the subsequent second to fifth transmission slots to the fifth transmission slot The one of the communication nodes transmitting the interception pilot cannot acquire the interception pilots of other communication nodes in the same column, and the communication nodes on the other columns can obtain the interception pilots sent by the communication nodes of the column. It can be seen that after the second listening pilot's transmission period, each communication node can obtain all other The interception pilot of the communication node takes the communication node 0 as an example. In the first transmission period, the communication node 0 does not acquire the interception pilots of the communication nodes 1 and 2, and after the second transmission period, the communication node 0, the interception pilots of the communication nodes 1 and 2 can be acquired, thereby realizing the acquisition of the interception pilots of all the communication nodes.

With reference to the description of the frequency hopping process in FIG. 2D, the embodiment of the present invention can only ensure that all communication nodes acquire the interception pilots sent by all other communication nodes when the transmission period of the two interception pilots is required. The number of communication nodes included is large, that is, when mX n is large, the application of the present invention can greatly improve the efficiency of acquiring the interception pilot. An application example of the third frequency hopping process:

When the number of rows of the matrix A is greater than the number of columns, that is, n < m, the matrix A is a non-square matrix. When performing frequency hopping, the first step is to divide the matrix A into sub-matrices, and for the matrix A after sub-matrix partitioning The rest. /^ row elements, which can be reconstructed into a submatrix whose number of rows is smaller than the number of columns. The submatrix whose number of rows is smaller than the number of columns can be in the manner shown in Figure 2C above, during the second hopping period. , the row elements in the submatrix whose number of rows is smaller than the number of columns are misaligned, and each element in the submatrix whose number of rows is smaller than the number of columns can be represented as a _{i }} (i = m - m%n, ... , m - VJ = 0, ..., n - \) , preferably, the position after hopping of each element in the submatrix whose number of rows is less than the number of columns is consistent with the description of the aforementioned formula 1) and formula 2) ;

In the second step, for the c sub-matrices, the sub-matrices may be transposed in turn according to the manner shown in FIG. 2B, and the position after each transposition of each element a in each sub-matrix is represented as ^+^w, After the operation (column-to-row), for each sub-matrix, nodes located in the same transmission slot can be replaced into different time slots, so that each communication node in each sub-matrix can be guaranteed in the third transmission period. Obtaining a listening pilot transmitted by other communication nodes in the matrix;

Finally, since the elements in the c sub-matrices are transposed, the elements of the same position in each sub-matrix are still located on the same transmission time slot, so the elements of the same row are extracted from each of the c sub-matrices and recomposed. n independent new matrices A', the first step and the second step are successively recursively performed on the elements in these new matrices A' until the number of rows of the finally obtained sub-matrix is less than or equal to the number of columns. Referring to FIG. 2E, a Beacon matrix including 8×3 communication nodes is taken as an example to describe a process of mapping a communication node in a network into a matrix with a number of rows greater than the number of columns, and performing interception pilot acquisition:

As shown in Figure 2E, all communication nodes are represented by their BeaconID as 1, 2, 3, ... 22, 23, respectively. 24. These communication nodes form an 8 x 3 matrix, with each column representing a transmission time slot, where the three transmission time slots form a transmission period.

For the first transmission period, on the first transmission time slot, the communication node 1 to the communication node 8 simultaneously transmit the interception pilots, and the above eight communication nodes transmit the interception pilots in the same transmission time slot, They cannot acquire each other's listening pilots, and the communication node 9 to the communication node 24 can acquire the listening pilots of the communication nodes 1 to 8; similarly in the subsequent second transmitting time slot and the third transmitting In the time slot, the one of the communication nodes transmitting the interception pilot cannot acquire the interception pilots of the other communication nodes in the same column, and the communication nodes on the other columns can obtain the interception pilots sent by the communication nodes of the column. It can be seen that in the first transmission period, each communication node can acquire the interception pilot of the communication node at other locations than the same as itself, with the communication node 1 as an example, the communication node 1 can obtain the communication. The nodes 9 to 24 listen for pilots, but the intercepting pilots of the communication nodes 2 to 8 are not acquired.

For the second transmission period, the matrix A is divided into two 3 X 3 sub-matrices (submatrix 1 and submatrix 2), and a 2 X 3 submatrix (submatrix 3). Wherein, the sub-matrix 1 includes the first to third row elements in the original 8 X 3 matrix, the sub-matrix 2 includes the fourth to sixth row elements in the original 8 X 3 matrix, and the sub-matrix 2 includes the original 8 X 3 The seventh and eighth row elements in the matrix. In the second transmission period, the positions of the elements in the sub-matrix 1 and the sub-matrix 2 are unchanged, and the sub-matrix 3 is used as a matrix whose number of rows is smaller than the number of columns, and the frequency hopping mode as shown in FIG. 2C, that is, the sub-matrix 3 can be used. The communication node on the first line in the first direction is shifted forward (in FIG. 2E, ie to the left) by one bit (jump one step), and the communication node on the second line in the sub-matrix 3 is forwarded in turn (left in FIG. 2E) The two bits are shifted (two steps) so that the communication nodes in the same column in the sub-matrix 3 can be located on different columns. It can be seen that after the second transmission period, the respective communication nodes mapped in the sub-matrix 3 can acquire the interception pilots transmitted to each other.

For the third transmission period, the elements in the sub-matrix 1 and the sub-matrix 2 are respectively subjected to a transposition operation, so that the communication nodes in the same column in the sub-matrix 1 can be located on different columns, and the sub-matrix 2 is in the same The communication nodes on the column can be on different columns. At this time, for the communication nodes in the sub-matrix 1 and the sub-matrix 2, after three transmission slots of the third transmission period, the communication nodes in the sub-matrix 1 can acquire the interception pilots transmitted from each other. The individual communication nodes in the matrix 2 can also acquire the listening pilots transmitted to each other.

For the fourth transmission period, since the sub-matrix 1 and the sub-matrix 2 are respectively transposed in the third transmission period, the elements in the same position in the two matrices are still located on the same transmission slot, as shown in FIG. 2D. "1" in submatrix 1 and "4" in submatrix 2, "10" in submatrix 1 and "13" in submatrix 2, "19" in submatrix 1 and "22" in submatrix 2 , that is to say, after the third launch cycle, the communication node 1 and the communication node 4 cannot obtain the listening pilots of each other, the communication node 10 and the communication node 13 cannot acquire the listening pilots of each other, and the communication node 19 and the communication node 22 cannot acquire the listening pilots of each other. Therefore, in the fourth transmission period, the elements on the same row in the sub-matrix 1 and the sub-matrix 2 are respectively extracted to form three 2×3 sub-matrices, which are respectively represented as a sub-matrix, a sub-matrix 2, and a sub-matrix 3'. Where the submatrix is "

For the above three

Submatrix, the elements on the first row in each submatrix are unchanged, and the elements on the second row are sequentially shifted forward (in FIG. 2D to the left) by one bit (jump one step), thereby making the above three submatrices In each submatrix, the communication nodes on the same column can be on different columns. Therefore, on the fourth transmission period, after three transmission slots, the communication node 1 and the communication node 4 can obtain the mutual listening pilots, and the communication node 10 and the communication node 13 can obtain the mutual listening pilots, and The communication node 19 and the communication node 22 can obtain the listening pilots of each other. It can be seen that after the fourth transmission period, the communication node 1 to the communication node 24 can acquire the listening pilots transmitted by all other communication nodes.

According to the description of the frequency hopping process in FIG. 2E, the embodiment of the present invention can only ensure that each communication node can acquire the interception pilots sent by all other communication nodes by using only four transmit pilots. When the number of communication nodes included in the network is large, that is, when mX n is large, applying the implementation of the present invention can greatly improve the efficiency of acquiring the interception pilot. Referring to FIG. 2F, a Beacon matrix including 10×2 communication nodes is taken as an example to describe another process of mapping a communication node in a network to a matrix whose number of rows is greater than the number of columns, and performing interception pilot acquisition: In Figure 2F, all communication nodes are represented by their BeaconIDs as 0 1 2 - 17, 18 19 These communication nodes form a 10 X 2 matrix, and each column represents a transmission time slot, where two transmission time slots form a Launch cycle.

For the first transmission period, on the first transmission time slot, the communication node 0 to the communication node 9 simultaneously transmit the interception pilots, and the above 10 communication nodes transmit the interception pilots in the same transmission time slot, They are unable to acquire each other's listening pilots, and the communication node 10 to the communication node 19 can acquire the listening pilots of the communication nodes 0 to 9; in the second transmitting time slot, the communication node 10 to the communication node 19 Simultaneous transmission of the interception pilot, the above 10 communication nodes cannot acquire each other's listening pilots, and the communication node 0 to the communication node 9 can acquire the listening pilots of the communication nodes 10 to 19. It can be seen that each communication node can acquire the listening pilot of the communication node at other locations than the one in the first transmission period. Taking the communication node 0 as an example, after the first transmission period, the communication node 0 cannot acquire the interception pilot of the communication node 1 to the communication node 9. For the second transmission period, the matrix A is divided into five 2×2 first-level sub-matrices, and the elements in the five first-level sub-matrices are respectively transposed, so that each sub-matrix is in the same column. The communication nodes on are located on different columns. After two transmission slots of the second transmission period, for the communication node 0, the interception pilots of the communication nodes 1, 3, 5, 7, and 9 can be acquired, but the communication node 2 cannot be obtained yet. 4, 6, 8 listening pilots.

For the third transmission period, the elements of the first row are respectively extracted from the foregoing five 2×2 sub-matrices to form a second-level sub-matrix 1 of 5×2, and the elements of the second row are respectively extracted to form a 5 X The second level of 2

Matrix 2, wherein the second sub-matrix 1 is, the above two second sub-moments

The number of rows of the array is still larger than the number of columns, so the two second sub-matrices are separately divided again, wherein the second-level sub-matrix 1 is divided into two 2 X 2 three-level sub-matrices, that is, three-level sub-matrices 11

The last row of elements 8 and 9, the second sub-matrix 2 is also divided into two 2 X 2 three-level sub-matrices, namely

"10 11, "14 15λ

The third-order sub-matrix 21 and the third-level sub-matrix 22 have the last row of elements 18 and 19. On

12 13 16 17

The two sub-matrix elements of the second-level sub-matrix 1 and the second-level sub-matrix 2 are arranged in a misaligned manner, that is, sequentially shifted forward (in FIG. 2F to the left) by one bit (jump one step). It can be seen that after two transmission slots of the third transmission period, still taking the communication node 0 as an example, the communication node 0 can already acquire the interception pilot sent by the communication node 8, but still cannot obtain the communication node. 2, 4, 6 sent the interception pilot.

For the fourth transmission period, the aforementioned three-level submatrix 11

"10 11, "14 15λ

Level sub-matrix 21 and third-level sub-matrix 22 are transposed separately to make each of the above

12 13 16 17

Communication nodes on the same column in the matrix can be on different columns. Still taking the communication node 0 as an example, after the fourth transmission period, the communication node 0 can acquire the interception pilots sent by the communication nodes 2 and 6, and at this time, the communication node 0 only does not acquire the interception sent by the communication node 4. Pilot.

For the fifth transmission period, from the above three-level submatrix 11

Do not extract the elements in the same row to form two new four-level sub-matrices, which are respectively four-level sub-matrix 1 And four-level sub-matrix 12' and three-level sub-matrices

"14 16,

In 22, the elements in the same row are extracted to form two new four-level sub-matrices, which are respectively four-level sub-moments.

15 17

ί\0 \2 in 13,

Array 21, and a four-level submatrix 22' due to the reconstituted new four-level submatrix

14 16 15 17

1. The number of rows and the number of columns of the submatrix 12', the submatrix 2, and the submatrix 2Γ are already equal, so there is no need to divide the four sub-matrices directly, and directly to the above-described four-level sub-matrix 1, sub-matrix 12', and sub-matrix 2 and sub-matrix 2 can be transposed. Still taking the communication node 0 as an example, after the fifth transmission period, the communication node 0 can acquire the interception pilot transmitted by the communication node 4. So far, after five transmission periods, each communication node in matrix A can acquire the interception pilots sent by all other communication nodes.

With reference to the description of the frequency hopping process in FIG. 2F, the embodiment of the present invention can only ensure that each communication node obtains the interception pilots sent by all other communication nodes when the transmission period of the five listening pilots is required. The number of communication nodes included is large, that is, when mXn is large, applying the implementation of the present invention can greatly improve the efficiency of acquiring the interception pilot.

When applying the above frequency hopping process, its complexity and iterative convergence depend on the relationship between the number of rows m and the number of columns n. When log _n m is an integer, the required number of hops is log _n m+l, otherwise, the maximum number of hops required to complete pilot sensing for each other communication node for each other communication node is 2*log _n m+l. An application example of the fourth frequency hopping process:

When the number of rows of the matrix A is greater than the number of columns, that is, n < m, the matrix A is a non-square matrix, and in the first step, the matrix A is divided into c = | m / « I sub-matrices, for the matrix A The /^/^ row elements remaining after the submatrix partitioning are reconstructed into a submatrix whose number of rows is smaller than the number of columns, and the submatrix whose number of rows is smaller than the number of columns may be in the manner shown in the foregoing FIG. 2C. In the second hopping period, each row element in the sub-matrix whose number of rows is smaller than the number of columns is misaligned, and each element in the sub-matrix whose number of rows is smaller than the number of columns can be expressed as a _u (i = mm% n,...,m-VJ = 0,...,n-\), preferably, the position of each element in the sub-matrix whose number of rows is smaller than the number of columns is hopped with the aforementioned formula 1) and formula 2 The description is consistent; in the second step, for each of the c sub-matrices, each row element in each sub-matrix is misaligned, and the position after hopping of the elements in each sub-matrix is the same as the above formula 1) and formula 2) The description is consistent; the third step is to extract the elements on the same row from the above c sub-matrices and reconstitute n new matrices A'. Matrix A 'in the element sequentially recursively The first step and the second step, until the number of rows of the finally obtained sub-matrix is less than or equal to the number of columns.

When applying the above frequency hopping process, its complexity and iterative convergence depend on the relationship between the number of rows m and the number of columns n. When log _n m is an integer, the required number of hops is log _n m+l, otherwise, the maximum number of hops required to complete pilot sensing for each other communication node for each other communication node is 2 * log _n m+l. Referring to FIG. 2G, a Beacon matrix including 8×3 communication nodes is taken as an example to describe a process of mapping a communication node in a network into a matrix with a number of rows greater than the number of columns, and performing interception pilot acquisition:

As shown in FIG. 2G, all communication nodes are represented by their Beacon IDs as 1, 2, 3, -22, 23, and 24, and these communication nodes form an 8×3 matrix, and each column represents a transmission time slot, where The three transmit time slots constitute one transmission period.

For the first transmission period, the communication node 1 to the communication node 8 simultaneously transmit the interception pilots, and the above-mentioned eight communication nodes cannot acquire each other's detection because they transmit the interception pilots in the same transmission slot. Listening to the pilot, and the communication node 9 to the communication node 24 can acquire the listening pilots of the communication nodes 1 to 8; similarly, in the subsequent second and third transmission time slots, the column of communication for transmitting the listening pilot The nodes cannot acquire the listening pilots of each other, and the communication nodes on the other columns can obtain the listening pilots sent by the column communication nodes. It can be seen that, in the first transmission period, each communication node can acquire the interception pilot of the communication node at other locations than the same as itself. Taking the communication node 1 as an example, the communication node 1 can obtain the communication. The pilots of the nodes 9 to 14 are listening, and the listening pilots of the communication nodes 2 to 8 are not acquired.

For the second transmission period, the matrix A is divided into two 3×3 sub-matrices (level one sub-matrix 1 and first-level sub-matrix 2), and one 2×3 sub-matrix (level one sub-matrix 3) . The first sub-matrix 1 includes the first to third row elements in the original 8×3 matrix, and the first sub-matrix 2 includes the fourth to sixth row elements in the original 8×3 matrix, and the first-level sub-matrix 3 includes the seventh and eighth row elements in the original 8 X 3 matrix. In the second transmission period, the positions of the elements in the first-level sub-matrix 1 and the first-level sub-matrix 2 are unchanged, and the first-level sub-matrix 3 is used as a matrix whose number of rows is smaller than the number of columns, and the jump as shown in FIG. 2C can be used. The frequency mode, that is, the communication node on the first line in the sub-matrix 3 is sequentially shifted forward (in FIG. 2G, that is, to the left) by one bit (jump one step), and the communication nodes on the second line in the sub-matrix 3 are sequentially forwarded. (Left to the left in Figure 2G) Translate two bits (two steps) so that the communication nodes on the same column in sub-matrix 3 can be on different columns. It can be seen that after the second transmission period, the respective communication nodes mapped in the primary sub-matrix 3 can acquire the interception pilots transmitted from each other. Still taking the communication node 1 as an example, after the second transmission period, the communication node 1 can acquire the listening pilots of the communication node 7 and the communication node 8, and still does not acquire the interception sent by the communication node 2 to the communication node 6. Pilot.

For the third transmission period, each row element in the first-level sub-matrix 1 is separately misaligned, that is, The position of the communication node on the first line in the matrix 1 is unchanged, and the communication node on the second line in the sub-matrix 1 is sequentially shifted forward (in FIG. 2F to the left) by one bit (jump one step), in the sub-matrix 1 The communication node on the third row sequentially shifts two bits (two steps) forward (in FIG. 2F to the left), so that the communication nodes in the same column in the primary sub-matrix 1 can be located on different columns; Similarly, the first sub-matrix 2 is subjected to the same misalignment arrangement as the first-level sub-matrix 1. Still taking the communication node 1 as an example, after the above-mentioned misalignment arrangement, after the third transmission period, the communication node 1 can acquire the interception pilots of the communication nodes 2, 3, 5, 6 and still not acquire the communication node. 4 listening pilots.

For the fourth transmission period, the elements on the same row are extracted from the first-level sub-matrix 1 and the first-level sub-matrix 2, respectively.

( 1 9 17

The prime consists of three new secondary sub-matrices, which are second-level sub-matrices and second-order sub-matrices.

4 12 20

"

2, . For each of the above three secondary sub-matrices, each sub-

The position of the first row element in the matrix is unchanged, and the second row of elements is shifted forward (one step to the left in Figure 2F) one bit (jump). Still taking the communication node 1 as an example, after the above-mentioned misalignment arrangement, after the fourth transmission period, the communication node 1 can acquire the interception pilot of the communication node 4. So far, after four transmission periods, each communication node in matrix A can acquire the listening pilots sent by all other communication nodes.

With reference to the description of the frequency hopping process in FIG. 2G, it can be seen that, in the embodiment of the present invention, only four listening pilot transmission periods are required to ensure that each communication node can acquire the listening pilots sent by all other communication nodes. When the number of communication nodes included in the network is large, that is, when mX n is large, applying the implementation of the present invention can greatly improve the efficiency of acquiring the interception pilot. Corresponding to an embodiment of the scheduling method for transmitting a listening pilot of the present invention, the present invention also provides an embodiment of a scheduling apparatus for transmitting a listening pilot.

Referring to FIG. 3, it is a block diagram of an embodiment of a scheduling apparatus for transmitting a listening pilot according to the present invention:

The apparatus includes: a mapping unit 310, a frequency hopping unit 320, and a scheduling unit 330.

The mapping unit 310 is configured to map the communication node to the time-frequency resource used for sending the interception pilot, where the mapped communication node forms a first matrix on the time-frequency resource, where the first matrix corresponds to the first transmission. a frequency hopping unit 320, configured to perform at least one frequency hopping operation on the communication node in the first matrix, so that each communication node located in the same column in the first matrix is on the same column Each of the other communication nodes is located on a different column after at least one frequency hopping, wherein the matrix formed after each frequency hopping operation corresponds to a new transmission period;

a scheduling unit 330, configured to schedule and the one on each of the transmission time slots in each transmission period The communication node on the column corresponding to the transmission slot sends a listening pilot, and each column in the matrix corresponding to each transmission period corresponds to one transmission slot in the transmission period.

The frequency hopping unit 320 may be specifically configured to divide a communication node in a matrix that performs each frequency hopping operation, obtain a sub-matrix, and perform communication nodes in at least one sub-matrix in the sub-matrix rearrange.

In a specific embodiment, the frequency hopping unit 320 may include (not shown in FIG. 3): a first frequency hopping subunit, configured to: when the first matrix is the number of rows m and the number of columns n a matrix, in a frequency hopping operation, dividing the communication node in the first matrix into a sub-matrix, and performing a transposition operation on the communication node in the sub-matrix; or, when the first When the matrix is a matrix of the number of rows m and the number of columns n, in a frequency hopping operation, the communication nodes in the first matrix are divided into one sub-matrix, and communication on different rows in the sub-matrix The node performs misalignment operations with unequal times.

In another specific embodiment, the frequency hopping unit 320 may include (not shown in FIG. 3): a second frequency hopping subunit, configured to: when the first matrix is a row number m smaller than a column number n In the matrix, in a frequency hopping operation, the communication nodes in the first matrix are divided into one sub-matrix, and the communication nodes on different rows in the sub-matrix are subjected to misalignment operations of unequal times.

In another specific embodiment, the frequency hopping unit 320 may include (not shown in FIG. 3): a third frequency hopping subunit, configured to: when the first matrix is the number of rows m is greater than the number of columns n a matrix, in a frequency hopping operation, dividing the first matrix into at least one sub-matrix of n rows, and a sub-matrix of less than n rows, on different rows in the sub-matrix less than n rows The communication node performs a misalignment operation of unequal times; in the next frequency hopping operation, each sub-matrix of the at least one n-row sub-matrix performs a transposition operation; in the next frequency hopping operation, respectively extracts the a communication node on the same row in each sub-matrix of at least one n-row sub-matrix, forming n second matrices, when the number of rows of the second matrix is not greater than the number of columns, for the second matrix The communication node performs misalignment. When the number of rows of the second matrix is greater than the number of columns, each of the second matrices is used as a new first matrix, and the foregoing steps are repeatedly performed until the number of rows of the second matrix is not more than the Number.

In another specific embodiment, the frequency hopping unit 320 may include (not shown in FIG. 3): a fourth frequency hopping subunit, configured to: when the first matrix is a row number m greater than a column number n a matrix, in a frequency hopping operation, dividing the first matrix into at least one sub-matrix of n rows, and a sub-matrix of less than n rows, on different rows in the sub-matrix less than n rows The communication node performs a misalignment operation of unequal times; in the next frequency hopping operation, the communication nodes on different rows of each of the sub-matrices of the at least one n-row sub-matrix perform misalignment operations of different times; In a frequency hopping operation, extracting the at least a communication node on the same row in each sub-matrix of an n-row, forming n second matrices, and when the number of rows of the second matrix is not greater than the number of columns, communication in the second matrix The node performs misalignment. When the number of rows of the second matrix is greater than the number of columns, each of the second matrices is used as a new first matrix, and the foregoing steps are repeatedly performed until the number of rows of the second matrix is not greater than The number of columns. As shown in the foregoing embodiment, in the embodiment of the present invention, the communication node is mapped to a time-frequency resource for transmitting a listening pilot, and the mapped communication node forms a first matrix on the time-frequency resource, where the first matrix Corresponding to the first transmission period, performing at least one frequency hopping operation on the communication node in the first matrix, so that each communication node located in the same column in the first matrix communicates with other communication on the same column Each communication node in the node is located on a different column after at least one frequency hopping, wherein the matrix formed after each frequency hopping operation corresponds to a new transmission period, on each of the transmission time slots in each transmission period, The communication node on the column corresponding to the one transmission time slot is scheduled to send a listening pilot, wherein each column in the matrix corresponding to each transmission period corresponds to one transmission time slot in the transmission period. In the embodiment of the present invention, the frequency hopping operation is performed by the communication node mapped in the first matrix, so that at each transmitting time slot of each transmission period, more than one communication node can acquire the listening pilot, and the implementation of the present invention is implemented. For example, by subdividing the submatrix into the matrix and performing successive iterations of transposing or shifting the submatrix, it is ensured that each communication node can acquire the interception pilot of all the communication nodes by using fewer transmission slots. , thereby improving the scheduling efficiency of the interception pilot.

It will be apparent to those skilled in the art that the techniques in the embodiments of the present invention can be implemented by means of software plus a necessary general hardware platform. Based on such understanding, the technical solution in the embodiments of the present invention may be embodied in the form of a software product in essence or in the form of a software product, which may be stored in a storage medium such as a ROM/RAM. , a diskette, an optical disk, etc., includes instructions for causing a computer device (which may be a personal computer, server, or network device, etc.) to perform the methods described in various embodiments of the present invention or in some portions of the embodiments.

The various embodiments in the present specification are described in a progressive manner, and the same or similar portions between the various embodiments may be referred to each other, and each embodiment focuses on differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant part can be referred to the description of the method embodiment.

The embodiments of the present invention described above are not intended to limit the scope of the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and scope of the invention are intended to be included within the scope of the invention.

Claims

Rights request

A scheduling method for transmitting a listening pilot, the method comprising: mapping a communication node to a time-frequency resource for transmitting a listening pilot, where the mapped communication node is on a time-frequency resource Forming a first matrix, the first matrix corresponding to a first transmission period;

Dispatching a communication pilot on a column corresponding to the one transmission time slot on each of the transmission time slots in each transmission period, where each column in the matrix corresponding to each transmission period corresponds to A transmission time slot within the transmission period.

2. The method according to claim 1, wherein the performing at least one frequency hopping operation on the communication node in the first matrix comprises:

The method according to claim 2, wherein the dividing a communication node in a matrix for performing each frequency hopping operation, obtaining a sub-matrix, and at least one sub-matrix in the sub-matrix The communication nodes are rearranged, including:

When the first matrix is a matrix having a row number m smaller than a column number n, in a frequency hopping operation, the The communication node in the first matrix is divided into one sub-matrix, and the communication nodes on different rows in the sub-matrix perform misalignment operations of unequal times.

When the first matrix is a matrix whose number of rows m is greater than the number of columns n, in a frequency hopping operation, the first matrix is divided into at least one sub-matrix of n rows, and a sub-matrix of less than n rows. Performing a misalignment operation of unequal times of communication nodes on different rows in the sub-matrices smaller than n rows;

In the next frequency hopping operation, a transposition operation is performed on the communication node of each sub-matrix in the sub-matrix of the at least one n-line;

In the next frequency hopping operation, the communication nodes on the same row in each of the sub-matrices of the at least one n-row are respectively extracted to form n second matrices, when the number of rows of the second matrix is not greater than the column And performing a misalignment operation on the communication nodes in the second matrix. When the number of rows of the second matrix is greater than the number of columns, each of the second matrices is used as a new first matrix, and the foregoing Steps, until the number of rows of the second matrix is not greater than the number of columns.

A scheduling apparatus for transmitting a listening pilot, wherein the apparatus comprises: a mapping unit, configured to map a communication node to a time-frequency resource for transmitting a listening pilot, where the mapped communication node forms a first matrix on a time-frequency resource, where the first matrix corresponds to a first transmission period; a frequency unit, configured to perform at least one frequency hopping operation on the communication node in the first matrix, so that each communication node located in the same column in the first matrix, and other communication nodes on the same column Each of the communication nodes is located on a different column after at least one frequency hopping, wherein a matrix formed after each frequency hopping operation corresponds to a new transmission period;

a scheduling unit, configured to, on each of the transmission time slots in each transmission period, schedule a communication node on a column corresponding to the one transmission time slot to send a interception pilot, where each of the transmission periods corresponds to a matrix Each column corresponds to one transmission slot in the transmission period.

The apparatus according to claim 7, wherein the frequency hopping unit is specifically configured to divide a communication node in a matrix for performing each frequency hopping operation, obtain a sub-matrix, and compare the sub-matrix The communication nodes in at least one of the sub-matrices are rearranged.

The apparatus according to claim 8, wherein the frequency hopping unit comprises: a first frequency hopping subunit, configured to: when the first matrix is a matrix of the number of rows m and the number of columns n And dividing, in a frequency hopping operation, the communication node in the first matrix into a sub-matrix, and performing a transposition operation on the communication node in the sub-matrix; or, when the first matrix is a row When the number m is the same as the number of columns n, in a frequency hopping operation, the communication node in the first matrix is divided into one sub-matrix, and the number of communication nodes on different rows in the sub-matrix is not The misalignment operation of the equals.

The apparatus according to claim 8, wherein the frequency hopping unit comprises: a second frequency hopping subunit, configured to: when the first matrix is a matrix whose number of rows m is smaller than the number of columns n, In a frequency hopping operation, the communication node in the first matrix is divided into a sub-matrix, and the communication nodes on different rows in the sub-matrix perform misalignment operations of unequal times.

The apparatus according to claim 8, wherein the frequency hopping unit comprises: a third frequency hopping subunit, configured to: when the first matrix is a matrix whose number of rows m is greater than the number of columns n, In a frequency hopping operation, the first matrix is divided into at least one sub-matrix of n rows, and a sub-matrix of less than n rows, and the number of communication nodes on different rows in the sub-matrices smaller than n rows is performed. Unequal misalignment operation; in the next frequency hopping operation, performing a transposition operation on the communication nodes of each sub-matrix in the sub-matrix of the at least one n-row sub-matrix; in the next frequency hopping operation, extracting the at least One a communication node on the same row in each of the sub-matrices of the n rows, forming n second matrices, and when the number of rows of the second matrix is not greater than the number of columns, communication in the second matrix The node performs a misalignment operation. When the number of rows of the second matrix is greater than the number of columns, each of the second matrices is used as a new first matrix, and the foregoing steps are repeatedly performed until the number of rows of the second matrix is not Greater than the number of columns.

The apparatus according to claim 8, wherein the frequency hopping unit comprises: a fourth frequency hopping subunit, configured to: when the first matrix is a matrix whose number of rows m is greater than the number of columns n, In a frequency hopping operation, the first matrix is divided into at least one sub-matrix of n rows, and a sub-matrix of less than n rows, and the number of communication nodes on different rows in the sub-matrices smaller than n rows is performed. Unequal misalignment operation; in the next frequency hopping operation, among the sub-matrices of the at least one n-row, the communication nodes on different rows of each sub-matrix perform misalignment operations of different times; in the next frequency hopping operation The communication nodes on the same row in each of the sub-matrices of the at least one n-row are respectively extracted to form n second matrices, and when the number of rows of the second matrix is not greater than the number of columns, The communication node in the second matrix performs a misalignment operation. When the number of rows of the second matrix is greater than the number of columns, each of the second matrices is used as a new first matrix, and the foregoing steps are repeatedly performed. Until the number of rows in the second matrix is no greater than the number of columns.