CN109150363B - Message transmission method and device - Google Patents
Message transmission method and device Download PDFInfo
- Publication number
- CN109150363B CN109150363B CN201710501576.XA CN201710501576A CN109150363B CN 109150363 B CN109150363 B CN 109150363B CN 201710501576 A CN201710501576 A CN 201710501576A CN 109150363 B CN109150363 B CN 109150363B
- Authority
- CN
- China
- Prior art keywords
- message
- cyclic shift
- cyclic
- shifts
- identifier
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J11/00—Orthogonal multiplex systems, e.g. using WALSH codes
- H04J11/0023—Interference mitigation or co-ordination
- H04J11/005—Interference mitigation or co-ordination of intercell interference
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/002—Transmission of channel access control information
- H04W74/008—Transmission of channel access control information with additional processing of random access related information at receiving side
Abstract
The application provides a message transmission method and a message transmission device, wherein the method comprises the following steps: and sending a first message, wherein the first message is used for indicating a first cyclic shift set, the first cyclic shift set comprises at least two first cyclic shifts of a demodulation reference signal (DMRS), so that the interference among the DMRSs of different UEs in a cell can be effectively reduced, and the method can be flexibly adapted to various scenes.
Description
Technical Field
The present application relates to communications technologies, and in particular, to a method and an apparatus for transmitting a message.
Background
Demodulation Reference Signal (DMRS) is used for related Demodulation of a Physical Uplink Shared Channel (PUSCH) and a Physical Uplink Control Channel (PUCCH) in Long Term Evolution (LTE).
In LTE systems, a DMRS sequence is defined as a base sequence with a cyclic shift α:
wherein the content of the first and second substances,
is the length of the reference signal sequence, m is the number of Resource Blocks (RBs) occupied by the DMRS,
each RB contains the number of subcarriers (fixed to 12 in LTE system), and the base sequence
The method is divided into a plurality of groups, u ∈ {0, 1.. multidot.29 } is a group number, v is an intra-group base sequence number, Identification (ID) of 504 cells is defined in LTE, the 504 cells are divided into clusters, each cluster comprises 30 cells (one cluster comprises 24 cells), and then the values of u and v can be selected to ensure that each cell in the cluster uses different roots, so that good orthogonality in the cluster and interference randomization between clusters are realized.
a) For the
Base sequence
Is defined as:
wherein a ZC (Zadoff-Chu) sequence with root index q is defined as:
wherein q is obtained by:
wherein, the length of ZC sequence
The value is the largest prime number smaller than the reference signal length.
b) For the
And
the base sequence was defined as 30 sets of fixed sequences of respective lengths 12 and 24.
For example, the DMRS sequence in PUSCH can be represented as follows:
wherein the content of the first and second substances,
the DMRS and the PUSCH occupy the same subcarrier, and lambda ∈ {0, 1.,. upsilon-1 } represents a data transmission layer.
For the same cell, DMRSs of different UEs under Multiple users (Multiple Input Multiple Output, MIMO) are distinguished by different cyclic shifts, and the time slot n can be obtained through the analysis of a) and b) abovesCyclic shift α of time DMRSλIs represented as follows:
αλ＝2πncs,λ/12，
wherein the content of the first and second substances,
is cell level cyclic shift, configured by a higher layer protocol, and has a value range of {0,2,3,4,6,8,9,10 }. Since different cells under the same base station may be configured as the same root sequence, the different cells need to be distinguished according to cell-level cyclic shift;
the User Equipment (UE) level cyclic shift is carried by Downlink Control Information (DCI), and has a value range of {0,2,3,4,6,8,9,10}, and 8 values in total; n isPN(ns) Is a cell level parameter for implementing hopping of cyclic shift for randomizing inter-cell interference, where 12 in the above cyclic shift expression indicates that 12 equally spaced effective cyclic shifts are specified.
In the prior art, the protocol prescribes 12 effective cyclic shifts with equal intervals, which is not beneficial to reducing the interference between cells when the number of reusable UEs is small, and the use scene is not flexible.
Disclosure of Invention
The application provides a message transmission method and device, which can effectively reduce the interference between DMRS (demodulation reference signals) between different UEs (user equipments) in a cell and can flexibly adapt to various scenes.
A first aspect of the present application provides a method for transmitting a message, including:
transmitting a first message indicating a first set of cyclic shifts, the first set of cyclic shifts comprising at least two first cyclic shifts of a demodulation reference signal, DMRS.
In the above scheme, the base station sends the first message to the UE, and notifies the UE of the first cyclic shift set through the first message, because the base station can dynamically configure the first cyclic shift set according to the number of UEs, when the number of reusable UEs is small, the cyclic shift of the DMRS determined by the UE from the first cyclic shift set can effectively reduce interference between the DMRSs of different UEs in a cell, and can flexibly adapt to various scenarios.
In one possible implementation, the first message includes an index, and the index corresponds to a number of cyclic shifts one-to-one, and the number of cyclic shifts corresponds to the first cyclic shift set one-to-one.
In one possible implementation, the method further includes:
and sending a second message, wherein the second message comprises a cyclic shift identifier, and the second message is used for instructing the UE to determine a second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set, and determining a third cyclic shift according to the number of cyclic shifts and the second cyclic shift.
In a possible implementation manner, the second message is a random access response message or a radio resource control message.
In the above scheme, a base station sends a first message to a UE, notifies the UE of a first cyclic shift set through the first message, and sends a second message to the UE, the UE determines a second cyclic shift corresponding to a cyclic shift identifier from the first cyclic shift set according to the cyclic shift identifier, and determines a third cyclic shift according to the cyclic shift number and the second cyclic shift.
In one possible implementation, the first message includes a set identifier, and the set identifier corresponds to the first cyclic shift set one to one.
In one possible implementation, the first cyclic shift set is a subset of a second cyclic shift set, the second cyclic shift set includes X equally spaced cyclic shifts, and X is an integer greater than or equal to 4 and less than or equal to 12.
In one possible implementation, the method further includes:
and sending a third message, wherein the third message comprises a cyclic shift identifier, and the third message is used for instructing the User Equipment (UE) to determine a fourth cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set, and determining a fifth cyclic shift according to the fourth cyclic shift and a preset cyclic shift number.
In a possible implementation manner, the third message is a random access response message or a radio resource control message.
In the above scheme, the base station sends the first message to the UE, indicates the first cyclic shift set by the set identifier in the first message, and allocates one cyclic shift to the UE by the third message, so that the UE finally obtains the cyclic shift of the DMRS, which ensures to reduce the crosstalk between the DMRSs between the UEs and to multiplex more UEs.
In a possible implementation manner, the first message is a broadcast message or a paging message, and the first message includes a cyclic redundancy check indication, where the cyclic redundancy check indication is used to check correctness of transmission of the first message.
In one possible implementation, the first message further includes a masking indication, and the masking indication is used to indicate the first set of cyclic shifts.
In one possible implementation, the masking indication is further used to indicate a number of antennas that sent the first message.
In the above scheme, the first message further includes a masking indication, where the masking indication is used to indicate the first cyclic shift set, and the masking indication is also used to indicate the number of antennas for sending the first message, and the first cyclic shift set and the number of antennas are implicitly indicated by a masking manner, so that message bits of the first message are avoided being occupied, and overhead can be effectively reduced.
A second aspect of the present application provides a message transmission method, including:
receiving a first message indicating a first set of cyclic shifts, the first set of cyclic shifts comprising at least two first cyclic shifts of a demodulation reference signal, DMRS.
In the above scheme, the base station sends the first message to the UE, and notifies the UE of the first cyclic shift set through the first message, because the base station can dynamically configure the first cyclic shift set according to the number of UEs, when the number of reusable UEs is small, the cyclic shift of the DMRS determined by the UE from the first cyclic shift set can effectively reduce interference between DMRSs between different UEs in a cell, and can flexibly adapt to various scenarios.
In one possible implementation, the first message includes an index, and the index corresponds to a number of cyclic shifts one-to-one, and the number of cyclic shifts corresponds to the first cyclic shift set one-to-one.
In one possible implementation, the method further includes:
receiving a second message, wherein the second message comprises a cyclic shift identifier;
determining a second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set according to the cyclic shift identifier;
determining a third cyclic shift according to the number of cyclic shifts and the second cyclic shift.
In the above scheme, the UE receives a first message sent by the base station, determines a first cyclic shift set through the first message, and receives a second message, the UE determines a second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set according to the cyclic shift identifier in the second message, and determines a third cyclic shift according to the number of cyclic shifts and the second cyclic shift.
In one possible implementation, the method further includes:
determining a fourth cyclic shift from the first set of cyclic shifts;
determining a fifth cyclic shift according to the number of cyclic shifts and the fourth cyclic shift.
In the above scheme, the UR randomly selects one cyclic shift from the first cyclic shift set as the fourth cyclic shift, and determines the fifth cyclic shift according to the number of cyclic shifts and the fourth cyclic shift, which not only can be flexibly applied to various scenarios of the number of reusable UEs, but also can save overhead.
In a possible implementation manner, the second message is a random access response message or a radio resource control message.
In one possible implementation, the first message includes a set identifier, and the set identifier corresponds to the first cyclic shift set one to one.
In one possible implementation, the first cyclic shift set is a subset of a second cyclic shift set, the second cyclic shift set includes X equally spaced cyclic shifts, and X is an integer greater than or equal to 4 and less than or equal to 12.
In one possible implementation, the method further includes:
receiving a third message, wherein the third message comprises a cyclic shift identifier;
determining a sixth cyclic shift corresponding to the cyclic shift identifier from the first set of cyclic shifts;
and determining a seventh cyclic shift according to the sixth cyclic shift and a preset cyclic shift number.
In a possible implementation manner, the third message is a random access response message or a radio resource control message.
In one possible implementation, the method further includes:
determining an eighth cyclic shift from the first set of cyclic shifts;
and determining a ninth cyclic shift according to the eighth cyclic shift and a preset cyclic shift number.
In the above scheme, the UE receives the first message sent by the base station, determines the first cyclic shift set by the set identifier in the first message, and then determines a cyclic shift from the first cyclic shift set by the third message, or the UE randomly selects a cyclic shift from the first cyclic shift set, and finally obtains the cyclic shift of the DMRS, which not only ensures that the crosstalk of the DMRS between UEs is reduced, but also enables more UEs to be multiplexed.
In a possible implementation manner, the first message is a broadcast message or a paging message, and the first message includes a cyclic redundancy check indication, where the cyclic redundancy check indication is used to check correctness of transmission of the first message.
In one possible implementation, the first message further includes a masking indication, and the masking indication is used to indicate the first set of cyclic shifts.
In one possible implementation, the masking indication is further used to indicate a number of antennas that sent the first message.
In the above scheme, the first message further includes a masking indication, where the masking indication is used to indicate the first cyclic shift set, and the masking indication is also used to indicate the number of antennas for sending the first message, and the first cyclic shift set and the number of antennas are implicitly indicated by a masking manner, so that message bits of the first message are avoided being occupied, and overhead can be effectively reduced.
A third aspect of the present application provides a message transmission apparatus, including: the device comprises a processing module and a sending module;
the processing module is configured to send, by the sending module, a first message indicating a first set of cyclic shifts, where the first set of cyclic shifts includes at least two first cyclic shifts of a demodulation reference signal, DMRS.
In one possible implementation, the first message includes an index, and the index corresponds to a number of cyclic shifts one-to-one, and the number of cyclic shifts corresponds to the first cyclic shift set one-to-one.
In a possible implementation manner, the sending module is further configured to send a second message, where the second message includes a cyclic shift identifier, and the second message is used to instruct the UE to determine a second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set, and determine a third cyclic shift according to the number of cyclic shifts and the second cyclic shift.
In a possible implementation manner, the second message is a random access response message or a radio resource control message.
In one possible implementation, the first message includes a set identifier, and the set identifier corresponds to the first cyclic shift set one to one.
In one possible implementation, the first cyclic shift set is a subset of a second cyclic shift set, the second cyclic shift set includes X equally spaced cyclic shifts, and X is an integer greater than or equal to 4 and less than or equal to 12.
In a possible implementation manner, the sending module is further configured to send a third message, where the third message includes a cyclic shift identifier, and the third message is used to instruct the UE to determine a fourth cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set, and determine a fifth cyclic shift according to the fourth cyclic shift and a preset number of cyclic shifts.
In a possible implementation manner, the third message is a random access response message or a radio resource control message.
In a possible implementation manner, the first message is a broadcast message or a paging message, and the first message includes a cyclic redundancy check indication, where the cyclic redundancy check indication is used to check correctness of transmission of the first message.
In one possible implementation, the first message further includes a masking indication, and the masking indication is used to indicate the first set of cyclic shifts.
In one possible implementation, the masking indication is further used to indicate a number of antennas that sent the first message.
The fourth aspect of the present application further provides a message transmission apparatus, including: the device comprises a processing module and a receiving module;
the processing module is configured to receive, by the receiving module, a first message indicating a first set of cyclic shifts, where the first set of cyclic shifts includes at least two first cyclic shifts of a demodulation reference signal, DMRS.
In one possible implementation, the first message includes an index, and the index corresponds to a number of cyclic shifts one-to-one, and the number of cyclic shifts corresponds to the first cyclic shift set one-to-one.
In a possible implementation manner, the receiving module is further configured to receive a second message, where the second message includes a cyclic shift identifier;
the processing module is further configured to determine a second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set according to the cyclic shift identifier; determining a third cyclic shift according to the number of cyclic shifts and the second cyclic shift.
In a possible implementation, the processing module is further configured to determine a fourth cyclic shift from the first set of cyclic shifts; determining a fifth cyclic shift according to the number of cyclic shifts and the fourth cyclic shift.
In a possible implementation manner, the second message is a random access response message or a radio resource control message.
In one possible implementation, the first message includes a set identifier, and the set identifier corresponds to the first cyclic shift set one to one.
In one possible implementation, the first cyclic shift set is a subset of a second cyclic shift set, the second cyclic shift set includes X equally spaced cyclic shifts, and X is an integer greater than or equal to 4 and less than or equal to 12.
In a possible implementation manner, the receiving module is further configured to receive a third message, where the third message includes a cyclic shift identifier;
the processing module is further configured to determine a sixth cyclic shift corresponding to the cyclic shift identifier from the first set of cyclic shifts; and determining a seventh cyclic shift according to the sixth cyclic shift and a preset cyclic shift number.
In a possible implementation manner, the third message is a random access response message or a radio resource control message.
In a possible implementation, the processing module is further configured to determine an eighth cyclic shift from the first set of cyclic shifts; and determining a ninth cyclic shift according to the eighth cyclic shift and a preset cyclic shift number.
In a possible implementation manner, the first message is a broadcast message or a paging message, and the first message includes a cyclic redundancy check indication, where the cyclic redundancy check indication is used to check correctness of transmission of the first message.
In one possible implementation, the first message further includes a masking indication, and the masking indication is used to indicate the first set of cyclic shifts.
In one possible implementation, the masking indication is further used to indicate a number of antennas that sent the first message.
A fifth aspect of the present application provides a message transmission apparatus, comprising a processor and a memory,
the memory is configured to store instructions, the processor is configured to execute the memory-stored instructions, and when the processor executes the memory-stored instructions, the apparatus is configured to perform the method according to any of the embodiments of the first aspect or the second aspect.
A sixth aspect of the present application provides a base station comprising at least one processing element (or chip) for performing the methods of the first aspect or the various embodiments of the first aspect.
A seventh aspect of the present application provides a UE comprising at least one processing element (or chip) for performing the methods of the second aspect or the various embodiments of the second aspect described above.
An eighth aspect of the present application provides a readable storage medium, where an execution instruction is stored in the readable storage medium, and when the execution instruction is executed by at least one processor of a base station, the base station performs the method for transmitting a message provided in the first aspect or the various embodiments of the first aspect.
A ninth aspect of the present application provides a readable storage medium, which stores therein an execution instruction, and when the execution instruction is executed by at least one processor of the UE, the UE performs the transmission method of the message provided by the second aspect or the various embodiments of the second aspect.
A tenth aspect of the present application provides a program product comprising execution instructions stored in a readable storage medium. The at least one processor of the base station may read the execution instructions from the readable storage medium, and the execution of the execution instructions by the at least one processor causes the base station to implement the first aspect or the transmission method of the message provided by the various embodiments of the first aspect.
An eleventh aspect of the present application provides a program product comprising execution instructions stored in a readable storage medium. The at least one processor of the UE may read the execution instructions from the readable storage medium, and the execution of the execution instructions by the at least one processor causes the UE to implement the transmission method of the message provided by the second aspect or the various embodiments of the second aspect described above.
A twelfth aspect of the present application provides a network system including the base station and the UE in the above aspects.
Drawings
Fig. 1 is a schematic view of an application scenario of a message transmission method according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a wireless communication device provided in the present application;
fig. 3 is a flowchart of a message transmission method according to an embodiment of the present invention;
fig. 4 is a flowchart of a message transmission method according to another embodiment of the present invention;
fig. 5 is a flowchart of a message transmission method according to another embodiment of the present invention;
fig. 6 is a flowchart of a message transmission method according to still another embodiment of the present invention;
FIG. 7 is a schematic diagram of a masking indication provided by an embodiment of the present invention;
fig. 8 is a block diagram of a message transmission apparatus according to an embodiment of the present invention;
fig. 9 is a block diagram of a message transmission apparatus according to another embodiment of the present invention;
fig. 10 is a block diagram of a message transmission apparatus according to another embodiment of the present invention.
Detailed Description
The message transmission method provided by the application is applied to a wireless communication system, and particularly can be applied to a grant-free (grant-free) scene, in which the UE transmits uplink data without obtaining the grant of the base station, and the uplink data is directly transmitted to the base station in a short time after the data arrives.
Fig. 1 is a schematic view of an application scenario of a message transmission method provided in this embodiment, as shown in fig. 1, the scenario includes a base station 1, a terminal 2, a terminal 3, and a terminal 4, and the scenario may further include other base stations and terminals, and is not limited to the base station and the terminal shown in fig. 1. The UE may be a computer, a mobile phone, a tablet computer, or the like. The base station sends data to the UE as downlink transmission, and the UE sends data to the base station as uplink transmission.
Fig. 2 is a schematic structural diagram of a wireless communication device provided in the present application, and a general unit structure of the UE and the base station is as shown in fig. 2, and the wireless communication device may include a processor, a transmitter, a receiver, a memory, and an antenna.
Fig. 3 is a flowchart of a message transmission method according to an embodiment of the present invention. As shown in fig. 3, the method may include the steps of:
step 101, a first message is sent.
The first message is used for indicating a first cyclic shift set, and the first cyclic shift set comprises at least two first cyclic shifts of a demodulation reference signal (DMRS).
In this embodiment, the first cyclic shift set is a set of first cyclic shifts allocated by the base station to the DMRS of the UE, wherein the first cyclic shifts are UE-level cyclic shifts, the base station may configure a plurality of first cyclic shift sets for the DMRS of each UE according to actual conditions, and the number of UE-level cyclic shifts in different first cyclic shift sets is different from each otherλ＝2πncs,λ/nmaxCalculating cyclic shifts α for DMRSλ。
Wherein the content of the first and second substances,
nmaxindicating the number of effective cyclic shifts, is configured semi-statically by the base station,
is cell level cyclic shift, configured by a higher layer protocol, and has a value range of {0,2,3,4,6,8,9,10 }. Since different cells under the same base station may be configured as the same root sequence, the different cells need to be distinguished according to cell-level cyclic shift;
is UE level cyclic shift, configured by the base station; n isPN(ns) Is a cell level parameter used to implement the hopping of cyclic shift.
Optionally, in one case, the first message includes an Index (Index), the Index corresponds to the number of cyclic shifts one-to-one, and the number of cyclic shifts corresponds to the first cyclic shift set one-to-one.
It should be noted that, in this embodiment, the cyclic shift numbers corresponding to different indexes are different, and the first cyclic shift sets corresponding to different cyclic shift numbers are also different. That is, the number of cyclic shifts in the present embodiment is varied, but the first cyclic shift set corresponding to each cyclic shift number is fixed.
In this embodiment, the base station establishes a corresponding relationship among the index, the cyclic shift number, and the first cyclic shift set in advance, where the corresponding relationship may be as shown in table 1, and the cyclic shift number is indicated by a binary index, and each index corresponds to one cyclic shift number. For each Index, the available cyclic shift number is less than or equal to the effective cyclic shift number, and the first cyclic shift set corresponding to each effective cyclic shift number is fixed, for example, Index is 00, the corresponding cyclic shift number is 4, that is, the effective cyclic shift number is 4, the available cyclic shift number is less than or equal to 4, and the first cyclic shift set corresponding to the cyclic shift number 4 is {0,1,2,3 }. As shown in table 1, the base station has four indexes, where the index 00 corresponds to a cyclic shift number of 4, the first cyclic shift set is {0,1,2,3}, the index 01 corresponds to a cyclic shift number of 6, the first cyclic shift set is {0,1,2,3,4,5}, the index 10 corresponds to a cyclic shift number of 8, the first cyclic shift set is {0,1,2,3,4,5,6,7}, the index 11 corresponds to a cyclic shift number of 12, and the first cyclic shift set is {0,1,2,3,4,5,6,7,8,9,10,11 }. Table 1 is only one possible implementation, and other correspondences between the index, the number of cyclic shifts, and the first cyclic shift set similar to table 1 may also be set.
TABLE 1
| |
00 | 01 | 10 | 11 |
| Number of cyclic shifts | 4 | 6 | 8 | 12 |
| First set of cyclic shifts | {……} | {……} | {……} | {……} |
The DMRS cyclic shift numbers of different cells or different services may be configured according to the corresponding OFDM symbol length (without CP) and the maximum cell delay spread.
For example, in the LTE system, the length of each OFDM symbol (excluding CP) under a normal (normal) Cyclic Prefix (CP) is 66.7us, and in order to reduce crosstalk between DMRSs of different UEs, the time interval of Cyclic shift of the DMRSs cannot be smaller than the maximum delay spread, that is:
wherein, TseqIs the DMRS sequence time length, i.e. OFDM symbol length (without CP), NCSIs the number of cyclic shifts. In general, the maximum delay spread is 5us-6us, and the time length T of the DMRS sequence is obtainedseqThe number of cyclic shifts N can be determinedCS。
In a New Radio (NR) communication system, a minimum subcarrier interval may be flexibly configured, and in order to satisfy orthogonality between subcarriers of the OFDM system, an OFDM symbol length and the minimum subcarrier interval need to maintain an inverse relationship, that is, the OFDM symbol length (including no CP) may also be flexibly changed correspondingly, that is, the time length of a DMRS sequence may be changed correspondingly, and thus, the number of obtained cyclic shifts may also be a plurality of different values.
In this embodiment, after receiving the first message, the UE determines the number of cyclic shifts according to the index, and then determines the corresponding first cyclic shift set according to the number of cyclic shifts.
After the base station indicates the first cyclic shift set in the first message, the base station may allocate a cyclic shift in the first cyclic shift set to each UE through the downlink message, or the base station may not allocate a cyclic shift to each UE separately, and at this time, the UE only needs to randomly select one cyclic shift in the first cyclic shift set for use.
Optionally, when the base station allocates one cyclic shift in the first cyclic shift set to each UE through the downlink message, as shown in fig. 3, after step 101, the method may further include the following step:
and step 102, sending a second message.
The second message includes a cyclic shift identifier, and the second message is used for instructing the user equipment UE to determine a second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set, and determine a third cyclic shift according to the number of cyclic shifts and the second cyclic shift.
And 103, determining a second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set according to the cyclic shift identifier.
And 104, determining a third cyclic shift according to the cyclic shift number and the second cyclic shift.
In this embodiment, the base station indicates a specific cyclic shift in the first cyclic shift set through the second message. For example, the base station may allocate a cyclic shift to each UE through the downlink message, if the cyclic shift is performedWhen the bit is 4, then 2 bits are used in the second message to set the cyclic shift identifier, the UE can determine the second cyclic shift from the first cyclic shift set according to the cyclic shift identifier in the second message, and then determine the third cyclic shift according to the number of cyclic shifts and the second cyclic shift, the UE can determine α according to the formulaλ＝2πncs，λ/nmaxTo calculate a third cyclic shift αλWherein, in the step (A),
for the second cyclic shift, that is, the second cyclic shift is a UE-level cyclic shift, the base station configures different UE-level cyclic shifts so that different UEs obtain cyclic shifts of different DMRSs.
Optionally, the second message is a Random Access Response (RAR) message or a Radio Resource Control (RRC) message.
According to the message transmission method provided by the embodiment of the application, the base station sends the first message to the UE, the UE is informed of the first cyclic shift set through the first message, the second message is sent to the UE, the UE determines the second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set according to the cyclic shift identifier, and determines the third cyclic shift according to the cyclic shift number and the second cyclic shift.
The base station does not separately allocate a cyclic shift to each UE, and when the UE only needs to randomly select one cyclic shift from the first cyclic shift set for use, as shown in fig. 4, after step 101, the method may further include the following steps:
step 201, a fourth cyclic shift is determined from the first cyclic shift set.
Step 202, determining a fifth cyclic shift according to the number of cyclic shifts and the fourth cyclic shift.
In this embodiment, the base station does not need to transmit the first message after it has transmitted the first messageAnd indicating the cyclic shift again, the UE randomly selects one cyclic shift from the first cyclic shift set as a fourth cyclic shift, obtains a fifth cyclic shift according to the number of cyclic shifts and the fourth cyclic shift, and may be according to formula αλ＝2πncs，λ/nmaxTo calculate a fifth cyclic shift αλWherein, in the step (A),
is a fourth cyclic shift.
According to the message transmission method provided by the embodiment of the application, the base station sends the first message to the UE, the UE is informed of the first cyclic shift set through the first message, the UE randomly selects one cyclic shift from the first cyclic shift set as the fourth cyclic shift, and the fifth cyclic shift is determined according to the number of the cyclic shifts and the fourth cyclic shift.
Optionally, in another case, the first message includes a set identifier, and the set identifier corresponds to the first cyclic shift set one to one.
Optionally, in this embodiment, the first cyclic shift set is a subset of a second cyclic shift set, the second cyclic shift set includes X equally spaced cyclic shifts, and X is an integer greater than or equal to 4 and less than or equal to 12.
Different from the previous embodiment, in the present embodiment, the number of cyclic shifts is fixed, that is, the number of cyclic shifts is X, and the interval of the X cyclic shifts is fixed, and a fixed number of cyclic shifts is adopted, which not only ensures that the cross talk of DMRS between UEs is reduced, but also enables multiplexing of more UEs. The first cyclic shift set is a subset of the second cyclic shift set, for example, when the number of cyclic shifts is 12, the second cyclic shift set is a subset of {0,1,2,3,4,5,6,7,8,9,10,11}, the first cyclic shift set is a subset of {0,1,2,3,4,5,6,7,8,9,10,11}, for example, two first cyclic shift sets are provided, the first cyclic shift set 1 is {0,3,6,9}, the first cyclic shift set 2 is {0,2,3,4,6,8,9,10}, and different first cyclic shift sets may apply different scenarios, where 1 and 2 are set identifiers.
Similarly, in this embodiment, after the base station indicates the first cyclic shift set through the set identifier in the first message, the base station may allocate a cyclic shift in the first cyclic shift set to each UE through the downlink message, or the base station may not allocate a cyclic shift to each UE separately, and at this time, the UE only needs to randomly select a cyclic shift in the first cyclic shift set for use.
Optionally, if the base station allocates one cyclic shift in the first cyclic shift set to each UE through the downlink message, as shown in fig. 5, after step 101, the method may further include the following steps:
step 301, a third message is sent.
The third message includes a cyclic shift identifier, and the third message is used for instructing the UE to determine a fourth cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set, and determine a fifth cyclic shift according to the fourth cyclic shift and a preset number of cyclic shifts.
Optionally, the third message is a random access response message or a radio resource control message.
Step 302, a sixth cyclic shift corresponding to the cyclic shift identifier is determined from the first cyclic shift set.
And step 303, determining a seventh cyclic shift according to the sixth cyclic shift and a preset cyclic shift number.
In the present embodiment, the implementation principle of steps 301-303 is similar to that of steps 102-104, and is not described herein again.
It should be noted that the fourth cyclic shift in step 301 is the same as the sixth cyclic shift in steps 302 and 303, and the fifth cyclic shift in step 301 is the same as the seventh cyclic shift in step 303, which are different only in language expression.
Optionally, if the base station does not separately allocate a cyclic shift to each UE, at this time, the UE randomly selects a cyclic shift in the first cyclic shift set, as shown in fig. 6, step 101 may further include the following steps:
step 401, an eighth cyclic shift is determined from the first set of cyclic shifts.
And 402, determining a ninth cyclic shift according to the eighth cyclic shift and a preset cyclic shift number.
In this embodiment, the implementation principle of steps 401 and 402 is similar to that of steps 201 and 202, and is not described here again.
In the method for transmitting a message provided in this embodiment, a base station sends a first message to a UE, indicates a first cyclic shift set by a set identifier in the first message, and allocates a cyclic shift to the UE by a third message, or the UE randomly selects a cyclic shift from the first cyclic shift set to finally obtain a cyclic shift of a DMRS, which not only ensures that DMRS crosstalk between UEs is reduced, but also multiplexes more UEs.
Optionally, the first message is a broadcast message or a paging message, and the first message includes a Cyclic Redundancy Check (CRC) indication, which is used to Check correctness of transmission of the first message.
In the existing LTE system, a CRC indication with a length of 16 bits is added after information bits of a broadcast message, and the CRC is calculated according to the information bits, that is, has a fixed mathematical relationship with the information bits. When the information bits and the CRC are transmitted to the UE through the channel, the UE can check the CRC, namely, whether the received information bits and the received CRC meet the mathematical relationship is judged, if the check is passed, the first message is considered to be transmitted correctly, and if the check is failed, the first message is considered to be transmitted wrongly. The format of the first message is shown in table 2.
TABLE 2
| Information bit | CRC |
Optionally, the first message further comprises a masking indication, the masking indication indicating the first set of cyclic shifts.
Optionally, the masking indication is also used to indicate the number of antennas that sent the first message.
In this embodiment, the first message may indicate the first cyclic shift set in a display manner as shown in fig. 4 to 6, and may also indicate the first cyclic shift set in an implicit manner, where the manner of adding the masking indication in this embodiment is an implicit indication manner.
For broadcast messages, the base station also adds a masking indication to the CRC indication. The mask indication may be a 16bit length sequence, the CRC and each bit of the mask are modulo-2 added, in a modulo-2 addition algorithm: 0+0 equals 0, 0+1 equals 1, 1+0 equals 1, and 1+1 equals 0. As shown in fig. 7, the 16bit CRC indication is 1011010011011100, and the 16bit masking indication is 0110101001010010, both of which are modulo-2 added to the respective bits to yield 1101111010001110.
The base station may use 1 antenna or 2 antennas or 4 antennas when sending the broadcast message, and implicitly informs the UE of the antennas by adding different masks to the CRC. The 3 antenna numbers correspond to 3 masks, which are 0000000000000000, 1111111111111, 0101010101010101. When the UE receives the broadcast message, the UE attempts to add the three kinds of masks to the CRC of the received first message, respectively, and then performs a CRC check. If the masking attempted by the UE is the same as the masking used by the base station, the CRC can be recovered to the original CRC (without any masking), the CRC and the information bit at this time satisfy the mathematical relationship, the check can be passed, and the UE can know the number of the base station transmitting antennas according to the masking at this time. For example, the bs transmits with 4 antennas, the mask is 0101010101, if the UE receives the first message and adds the same mask 0101010101010101010101 to the CRC of the received first message, since 0101010101010101+ 0101010101010101010101 ═ 00000000000000000000 is used, the CRC is recovered to the original CRC (having a mathematical relationship with the information bits) rather than without any mask, and the CRC check can pass, so that the UE knows the 4 antennas used by the bs; however, if the masking different from the originating masking is applied to the CRC of the first message after the UE receives the first message, the original CRC cannot be recovered, and the check cannot pass. Therefore, the UE can know the number of the antennas used by the originator when the check is passed by trying different masks one by one.
In this embodiment, the base station adds a mask for indicating the number of antennas after adding a mask for indicating the first cyclic shift set to the CRC of the first message, but may also add a mask for indicating the first cyclic shift set first and then add a mask for indicating the number of antennas, or may directly add a mask formed by combining a mask for indicating the number of antennas and a mask for indicating the first cyclic shift set to the CRC.
For example, the mask in the first message is used to indicate the number of cyclic shifts, the number of cyclic shifts corresponds to the first cyclic shift set, and assuming that there are 2 cyclic shifts, 2 masks are needed for distinguishing, and 3 antennas are used, 3 antenna masks and 2 cyclic shift number masks are needed, there may be 3 × 2 — 6 combinations (modulo 2 plus) results, and these 6 combinations must be different from each other to ensure that each combination result uniquely corresponds to one antenna and cyclic shift number combination. For example, 2 cyclic shift number masks are 00000000000000000000 (or 1111111111111111) and 1111111100000000 (or 0000000011111111111), and when the results of the 6 modulo-2 additions are different, the UE base station can be implicitly informed of the number of antennas and the number of effective cyclic shifts.
For another example, there are 4 cyclic shift numbers, 4 cyclic shift number masks are needed to distinguish, 3 × 4 — 12 combination results (modulo 2 plus) are obtained from 3 antenna masks and 4 effective cyclic shift masks, and these 12 combination results must be different from each other to ensure that each combination result uniquely corresponds to one combination of an antenna and a cyclic shift number. For example, the 4 cyclic shift number masks are 00000000000000000000 (or 1111111111111111), 1111111100000000 (or 0000000011111111), 1111000011110000 (or 0000111100001111), 1100110011001100 (or 0011001100110011), respectively. At this time, the results of the 12 kinds of modulo-2 addition are different, and the UE can be implicitly notified of the number of antennas and the number of cyclic shifts of the base station.
In the transmission method of the message provided in this embodiment, the first message further includes a masking indication, where the masking indication is used to indicate the first cyclic shift set, and the masking indication is also used to indicate the number of antennas for sending the first message, and the first cyclic shift set and the number of antennas are implicitly indicated by a masking manner, so that message bits of the first message are avoided being occupied, and overhead can be effectively reduced.
Fig. 8 is a block diagram of a message transmission apparatus according to an embodiment of the present invention. As shown in fig. 8, the apparatus includes a processing module 11 and a transmitting module 12. The processing module 11 sends a first message indicating a first set of cyclic shifts, which includes at least two first cyclic shifts of a demodulation reference signal, DMRS, through the sending module 12.
Optionally, the first message includes an index, the index corresponds to a number of cyclic shifts one-to-one, and the number of cyclic shifts corresponds to the first set of cyclic shifts one-to-one.
Optionally, the sending module 12 is further configured to send a second message, where the second message includes a cyclic shift identifier, and the second message is used to instruct the UE to determine a second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set, and determine a third cyclic shift according to the number of cyclic shifts and the second cyclic shift.
Optionally, the second message is a random access response message or a radio resource control message.
Optionally, the first message includes a set identifier, and the set identifier corresponds to the first cyclic shift set one to one.
Optionally, the first set of cyclic shifts is a subset of a second set of cyclic shifts, the second set of cyclic shifts including X equally spaced cyclic shifts, X being an integer greater than or equal to 4 and less than or equal to 12.
Optionally, the sending module 12 is further configured to send a third message, where the third message includes a cyclic shift identifier, and the third message is used to instruct the UE to determine a fourth cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set, and determine a fifth cyclic shift according to the fourth cyclic shift and a preset number of cyclic shifts.
Optionally, the third message is a random access response message or a radio resource control message.
Optionally, the first message is a broadcast message or a paging message, and the first message includes a cyclic redundancy check indication, and the cyclic redundancy check indication is used to check correctness of transmission of the first message.
Optionally, the first message further comprises a masking indication, the masking indication indicating the first set of cyclic shifts.
Optionally, the masking indication is also used to indicate the number of antennas that sent the first message.
The message transmission apparatus shown in fig. 8 may be used to execute the message transmission method on the base station side shown in any one of fig. 3 to fig. 7, and the implementation principle and the beneficial effect are similar, which are not described herein again.
Fig. 9 is a block diagram of a message transmission apparatus according to another embodiment of the present invention. As shown in fig. 9, the apparatus includes a processing module 21 and a receiving module 22. The processing module 21 receives a first message through the receiving module 22, where the first message is used to indicate a first set of cyclic shifts, where the first set of cyclic shifts includes at least two first cyclic shifts of a demodulation reference signal DMRS.
Optionally, the first message includes an index, the index corresponds to a number of cyclic shifts one-to-one, and the number of cyclic shifts corresponds to the first set of cyclic shifts one-to-one.
Optionally, the receiving module 22 is further configured to receive a second message, where the second message includes a cyclic shift identifier;
the processing module 21 is further configured to determine, according to the cyclic shift identifier, a second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set; a third cyclic shift is determined based on the number of cyclic shifts and the second cyclic shift.
Optionally, the processing module 21 is further configured to determine a fourth cyclic shift from the first set of cyclic shifts; a fifth cyclic shift is determined based on the number of cyclic shifts and the fourth cyclic shift.
Optionally, the second message is a random access response message or a radio resource control message.
Optionally, the first message includes a set identifier, and the set identifier corresponds to the first cyclic shift set one to one.
Optionally, the first set of cyclic shifts is a subset of a second set of cyclic shifts, the second set of cyclic shifts including X equally spaced cyclic shifts, X being an integer greater than or equal to 4 and less than or equal to 12.
Optionally, the receiving module 22 is further configured to receive a third message, where the third message includes a cyclic shift identifier;
the processing module 21 is further configured to determine a sixth cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set; and determining a seventh cyclic shift according to the sixth cyclic shift and a preset cyclic shift number.
Optionally, the third message is a random access response message or a radio resource control message.
Optionally, the processing module 22 is further configured to determine an eighth cyclic shift from the first set of cyclic shifts; and determining the ninth cyclic shift according to the eighth cyclic shift and the preset cyclic shift number.
Optionally, the first message is a broadcast message or a paging message, and the first message includes a cyclic redundancy check indication, and the cyclic redundancy check indication is used to check correctness of transmission of the first message.
Optionally, the first message further comprises a masking indication, the masking indication indicating the first set of cyclic shifts.
Optionally, the masking indication is also used to indicate the number of antennas that sent the first message.
The apparatus for transmitting a message shown in fig. 9 may be configured to execute the method for transmitting a message on the UE side described in any one of fig. 3 to fig. 7, and the implementation principle and the beneficial effects are similar, which are not described herein again.
Fig. 10 is a block diagram of a message transmission apparatus according to another embodiment of the present invention, as shown in fig. 10, the apparatus includes a processor 31 and a memory 32, the memory 32 is configured to store instructions, the processor 31 is configured to execute the instructions stored in the memory 32, and when the processor 31 executes the instructions stored in the memory 32, the apparatus is configured to perform the method according to any of the embodiments of fig. 3 to fig. 7.
The present application further provides a readable storage medium, in which instructions are stored, and when the instructions are executed by at least one processor of the base station, the base station performs the transmission method of the message provided in any one of the above method embodiments.
The present application further provides a readable storage medium, in which instructions are stored, and when the instructions are executed by at least one processor of the UE, the UE performs the message transmission method provided in any one of the above method embodiments.
The present application also provides a program product comprising instructions stored in a readable storage medium. The at least one processor of the base station may read the instructions from the readable storage medium and execute the instructions to cause the base station to implement the method of transmission of the message provided in any of the method embodiments.
The present application also provides a program product comprising instructions stored in a readable storage medium. The at least one processor of the UE may read the instructions from the readable storage medium and execute the instructions to cause the UE to implement the method of transmitting a message provided in any of the method embodiments described above.
In a Specific implementation of the base station or the UE, it is understood that the processor may be a Central Processing Unit (CPU), other general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present application may be embodied directly in a hardware processor, or in a combination of the hardware and software modules in the processor.
All or a portion of the steps of implementing the above-described method embodiments may be performed by hardware associated with program instructions. The aforementioned program may be stored in a readable memory. When executed, the program performs steps comprising the method embodiments described above; and the aforementioned memory (storage medium) includes: read-only memory (ROM), RAM, flash memory, hard disk, solid state disk, magnetic tape (magnetic tape), floppy disk (optical disk), and any combination thereof.
Claims (23)
1. A method for transmitting a message, comprising:
transmitting a first message, wherein the first message is used for indicating a first cyclic shift set, and the first cyclic shift set comprises at least two first cyclic shifts of a demodulation reference signal (DMRS), and the first cyclic shift set is dynamically configured by a base station according to the number of user equipment;
the method further comprises the following steps:
and sending a second message, wherein the second message comprises a cyclic shift identifier, and the second message is used for instructing the UE to determine a second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set, and determine a third cyclic shift according to a cyclic shift number and the second cyclic shift, wherein the cyclic shift number represents an effective cyclic shift number, and a corresponding relationship exists between the first cyclic shift set and the index.
2. The method of claim 1, wherein the first message comprises the index, wherein the index corresponds to a number of cyclic shifts, and wherein the number of cyclic shifts corresponds to the first set of cyclic shifts.
3. The method of claim 1, wherein the second message is a random access response message or a radio resource control message.
4. The method of claim 1, wherein the first message comprises a set identifier, and wherein the set identifier corresponds to the first set of cyclic shifts one to one.
5. The method of claim 4, wherein the first set of cyclic shifts is a subset of a second set of cyclic shifts, wherein the second set of cyclic shifts comprises X equally spaced cyclic shifts, and wherein X is an integer greater than or equal to 4 and less than or equal to 12.
6. The method according to claim 4 or 5, characterized in that the method further comprises:
and sending a third message, where the third message includes a cyclic shift identifier, and the third message is used to instruct the UE to determine a fourth cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set, and determine a fifth cyclic shift according to the fourth cyclic shift and a preset number of cyclic shifts, where a corresponding relationship exists between the first cyclic shift set and the set identifier.
7. The method of claim 6, wherein the third message is a random access response message or a radio resource control message.
8. The method according to any of claims 1-5, 7, wherein the first message is a broadcast message or a paging message, and wherein the first message comprises a cyclic redundancy check indication, and wherein the cyclic redundancy check indication is used for checking correctness of transmission of the first message.
9. The method of claim 8, wherein the first message further comprises a masking indication indicating the first set of cyclic shifts.
10. The method of claim 9, wherein the masking indication is further used to indicate a number of antennas used to send the first message.
11. A method for transmitting a message, comprising:
receiving a first message, wherein the first message is used for indicating a first cyclic shift set, and the first cyclic shift set comprises at least two first cyclic shifts of a demodulation reference signal (DMRS), and the first cyclic shift set is dynamically configured by a base station according to the number of user equipment;
the method further comprises the following steps:
receiving a second message, wherein the second message comprises a cyclic shift identifier;
determining a second cyclic shift corresponding to the cyclic shift identifier from the first cyclic shift set according to the cyclic shift identifier;
and determining a third cyclic shift according to the number of cyclic shifts and the second cyclic shift, wherein a corresponding relation exists between the first cyclic shift set and the index.
12. The method of claim 11, wherein the first message comprises the index, wherein the index corresponds to a number of cyclic shifts, and wherein the number of cyclic shifts corresponds to the first set of cyclic shifts.
13. The method of claim 12, further comprising:
determining a fourth cyclic shift from the first set of cyclic shifts, wherein the fourth cyclic shift is randomly selected in the first set of cyclic shifts;
determining a fifth cyclic shift according to the number of cyclic shifts and the fourth cyclic shift.
14. The method of claim 12, wherein the second message is a random access response message or a radio resource control message.
15. The method of claim 11, wherein the first message comprises a set identifier, and wherein the set identifier corresponds to the first set of cyclic shifts one to one.
16. The method of claim 15, wherein the first set of cyclic shifts is a subset of a second set of cyclic shifts, wherein the second set of cyclic shifts comprises X equally spaced cyclic shifts, and wherein X is an integer greater than or equal to 4 and less than or equal to 12.
17. The method according to claim 15 or 16, characterized in that the method further comprises:
receiving a third message, wherein the third message comprises a cyclic shift identifier;
determining a sixth cyclic shift corresponding to the cyclic shift identifier from the first set of cyclic shifts;
and determining a seventh cyclic shift according to the sixth cyclic shift and a preset cyclic shift number, wherein a corresponding relation exists between the first cyclic shift set and the set identifier.
18. The method of claim 17, wherein the third message is a random access response message or a radio resource control message.
19. The method according to claim 15 or 16, characterized in that the method further comprises:
determining an eighth cyclic shift from the first set of cyclic shifts, wherein the eighth cyclic shift is randomly selected in the first set of cyclic shifts;
and determining a ninth cyclic shift according to the eighth cyclic shift and a preset cyclic shift number.
20. The method according to any of claims 11-16, 18, wherein the first message is a broadcast message or a paging message, and wherein the first message comprises a cyclic redundancy check indication, and wherein the cyclic redundancy check indication is used for checking the correctness of the transmission of the first message.
21. The method of claim 20, wherein the first message further comprises a masking indication indicating the first set of cyclic shifts.
22. The method of claim 21, wherein the masking indication is further used to indicate a number of antennas used to send the first message.
23. A message transmission device is characterized by comprising a processor and a memory,
the memory is for storing instructions, the processor is for executing the memory-stored instructions, and the apparatus is for performing the method of any one of claims 1 to 22 when the processor executes the memory-stored instructions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710501576.XA CN109150363B (en) | 2017-06-27 | 2017-06-27 | Message transmission method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710501576.XA CN109150363B (en) | 2017-06-27 | 2017-06-27 | Message transmission method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109150363A CN109150363A (en) | 2019-01-04 |
| CN109150363B true CN109150363B (en) | 2020-09-29 |
Family
ID=64805072
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710501576.XA Expired - Fee Related CN109150363B (en) | 2017-06-27 | 2017-06-27 | Message transmission method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109150363B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102754373A (en) * | 2010-01-07 | 2012-10-24 | 三星电子株式会社 | Apparatus and method for enhancing features of uplink reference signals |
| CN103039120A (en) * | 2010-06-10 | 2013-04-10 | 高通股份有限公司 | Peer-to-peer communication with symmetric waveform for downlink and uplink |
| CN103973392A (en) * | 2013-01-24 | 2014-08-06 | 中兴通讯股份有限公司 | Parameter sending method and device and uplink demodulation reference signal emission method and device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102170702B (en) * | 2010-02-25 | 2014-07-30 | 华为技术有限公司 | Method for data transmission, and base station and communication system |
| CN102932921B (en) * | 2011-08-10 | 2016-01-06 | 华为技术有限公司 | A kind of distribution method of physical mixing retransmission indicating chanel, equipment and subscriber equipment |
-
2017
- 2017-06-27 CN CN201710501576.XA patent/CN109150363B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102754373A (en) * | 2010-01-07 | 2012-10-24 | 三星电子株式会社 | Apparatus and method for enhancing features of uplink reference signals |
| CN103039120A (en) * | 2010-06-10 | 2013-04-10 | 高通股份有限公司 | Peer-to-peer communication with symmetric waveform for downlink and uplink |
| CN103973392A (en) * | 2013-01-24 | 2014-08-06 | 中兴通讯股份有限公司 | Parameter sending method and device and uplink demodulation reference signal emission method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109150363A (en) | 2019-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10375678B2 (en) | Communication system, base station apparatus, mobile station apparatus, and communication method | |
| EP3051908B1 (en) | Terminal, base station, and communication method | |
| KR101656159B1 (en) | Method, user equipment and base station for receiving and sending control channel | |
| EP3940984B1 (en) | Reference signal transmission method, device, and system | |
| US10736085B2 (en) | Uplink control information sending method, uplink control information receiving method, apparatus, and system | |
| US10420092B2 (en) | Resource allocation information indication method, base station, and user equipment | |
| EP3621240B1 (en) | Method for learning number of resource units in communication process and related device | |
| US9848438B2 (en) | Terminal, base station, and communication method | |
| CN113162721B (en) | Grouping and use of short sequence signals | |
| EP3051899B1 (en) | Terminal, base station, and communication method | |
| EP3497870B1 (en) | Design of dmrs sequences for mimo communications systems | |
| CN109150363B (en) | Message transmission method and device | |
| CN116746083A (en) | Method and apparatus for downlink control information size alignment | |
| CN107888527B (en) | Reference signal mapping method and device | |
| US20240089060A1 (en) | Reference signal port indication techniques | |
| US11962526B2 (en) | Method for obtaining quantity of resource elements in communication process and related apparatus | |
| CN116391337A (en) | Signal sending and signal detecting method and device | |
| CN111435895A (en) | Signal transmission method and apparatus, waveform determination method and apparatus, and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200929 Termination date: 20210627 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |