CN110912660B - Method and device for generating reference signal - Google Patents

Method and device for generating reference signal Download PDF

Info

Publication number
CN110912660B
CN110912660B CN201811075982.5A CN201811075982A CN110912660B CN 110912660 B CN110912660 B CN 110912660B CN 201811075982 A CN201811075982 A CN 201811075982A CN 110912660 B CN110912660 B CN 110912660B
Authority
CN
China
Prior art keywords
binary
reference signal
order
determining
symmetric matrix
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.)
Active
Application number
CN201811075982.5A
Other languages
Chinese (zh)
Other versions
CN110912660A (en
Inventor
张蕾
王磊
陈雁
王珏
张朝阳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201811075982.5A priority Critical patent/CN110912660B/en
Priority to PCT/CN2019/105676 priority patent/WO2020052646A1/en
Publication of CN110912660A publication Critical patent/CN110912660A/en
Application granted granted Critical
Publication of CN110912660B publication Critical patent/CN110912660B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048Allocation of pilot signals, i.e. of signals known to the receiver
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/24Radio transmission systems, i.e. using radiation field for communication between two or more posts
    • H04B7/26Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path

Abstract

The embodiment of the invention provides a method and a device for generating a reference signal sequence, which can improve the oversized reference signal sequence space. The method comprises the following steps: determining the order number m of a binary symmetric matrix for generating a second-order Reed-Muller sequence; determining a binary symmetric matrix P of m orders and a binary vector b of m x 1; generating a second-order Reed-Muller sequence according to the determined binary symmetric matrix P, the binary vector b and a second-order Reed-Muller sequence generating formula; and expanding or truncating the second-order Reed-Muller sequence into a reference signal sequence with the length L.

Description

Method and device for generating reference signal
Technical Field
The present application relates to the field of communications, and more particularly, to a method and apparatus for generating a reference signal sequence.
Background
In a typical wireless communication network (e.g., a Long Term Evolution (LTE) network), selection of an uplink Data channel (Shared Data Channels) is completely controlled by a Base Station (BS) based on a Scheduling/Grant (Scheduling/Grant) mechanism.
Large-scale user access is one of the typical application scenarios for next generation communication networks. For a 5G massive connection scene, the number of potential access user equipment is huge, the number of actually active user equipment is dynamically changed, and the access method has the characteristics of high capacity, low time delay and low cost. The base station allocates uplink resources for each user equipment, which brings great signaling overhead, and the 5G design of a Grant free access system is a necessary choice in the future, and has important practical significance. In the authorization-free access system, before sending data, the user equipment does not need to obtain dynamic authorization of the base station for the data sending, but directly uses pre-configured resources and transmission parameters to send uplink data. For uplink communication, the network device needs to configure demodulation reference signals (DMRSs) or preambles for different ue. The base station identifies the user equipment by receiving a reference signal of the user equipment and performs channel estimation. One bottleneck problem of Grant Free access is the number of reference signals (DMRS or preambles), which is very limited in the prior art. Due to the excessive number of user equipments, the insufficient number of available reference signals will be a bottleneck for the network capacity.
Disclosure of Invention
The application provides a method and a device for generating a reference signal sequence, which can improve the oversized reference signal sequence space, thereby improving the network capacity.
In a first aspect, the present application provides a method of generating a reference signal sequence, comprising:
determining the order number m of a binary symmetric matrix for generating a second-order Reed-Muller sequence;
determining a binary symmetric matrix P of m orders and a binary vector b of m x 1;
generating a second-order Reed-Muller sequence according to the determined binary symmetric matrix P, the binary vector b and a second-order Reed-Muller sequence generating formula;
and expanding or truncating the second-order Reed-Muller sequence into a reference signal sequence with the length L.
In a second aspect, the present application provides an apparatus for generating a reference signal sequence, comprising:
the first determining module is used for determining the order number m of a binary symmetric matrix used for generating a second-order Reed-Muller sequence;
a second determining module, configured to determine an m-order binary symmetric matrix P and a m × 1 binary vector b;
a Reed-Muller sequence generation module, configured to generate a second-order Reed-Muller sequence according to the determined binary symmetric matrix P, the binary vector b, and a second-order Reed-Muller sequence generation formula;
and the reference signal sequence generating module is used for expanding or truncating the second-order Reed-Muller sequence into a reference signal sequence with the length of L.
In a third aspect, the present application provides an apparatus for generating a reference signal sequence, the apparatus comprising a processor and a transceiver, wherein the processor is configured to support the apparatus to perform the method of the first aspect, and the transceiver is specifically configured to transmit the generated reference signal sequence.
In a fourth aspect, the present application provides a computer-readable storage medium having stored thereon computer program code, which, when executed by a processing unit or a processor, causes the processing unit or an apparatus in which the processor is located to perform the method of the first aspect.
In a fifth aspect, a communication chip having instructions stored therein, which when run on a communication device, cause the communication device to perform the method of the first aspect.
In a sixth aspect, a computer program product, the computer program product comprising: computer program code which, when run by a communication unit or transceiver and a processing unit or processor of a communication apparatus, causes a terminal device to perform the method of the first aspect of the claims.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a diagram of an application scenario according to an embodiment of the present application.
Fig. 2 is a schematic flow chart diagram of a method of generating a reference signal sequence according to an embodiment of the present application.
Fig. 3 is schematic structural diagram information of an apparatus for generating a reference signal sequence according to an embodiment of the present application.
Fig. 4 is a schematic structural diagram of an apparatus for generating a reference signal sequence according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As used in this specification, the terms "component," "module," "system," and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device can be a component. One or more components can reside within a process and/or thread of execution and a component can be localized on one computer and/or distributed between 2 or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from two components interacting with another component in a local system, distributed system, and/or across a network such as the internet with other systems by way of the signal).
It should be understood that the technical solutions of the embodiments of the present invention can be applied to various communication systems, for example: a Global System for Mobile communications (GSM) System, a Code Division Multiple Access (CDMA) System, a Wideband Code Division Multiple Access (WCDMA) System, a Long Term Evolution (LTE) System, a Frequency Division Duplex (FDD) System, a Time Division Duplex (TDD) System, a Universal Mobile Telecommunications System (UMTS), a 5G Communication System, and a future wireless Communication System.
Various embodiments are described herein in connection with user equipment. User Equipment (UE) may also refer to terminal Equipment, access terminals, subscriber units, subscriber stations, mobile stations, remote terminals, mobile devices, User terminals, wireless communication devices, User agents, or User devices. An access terminal may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device with Wireless communication capability, a computing device or other processing device connected to a Wireless modem, a vehicle mounted device, a wearable device, a terminal device in a future 5G network or a terminal device in a future evolved PLMN network, etc.
Various embodiments are described herein in connection with a network device. The network device may be a device for communicating with the user equipment, and for example, may be a Base Transceiver Station (BTS) in a GSM system or a CDMA system, a Base Station (NodeB, NB) in a WCDMA system, an evolved Node B (eNB) in an LTE system, or an eNodeB, or may be a relay Station, an access point, a vehicle-mounted device, a wearable device, and a network-side device in a future 5G network or a network device in a future evolved PLMN network.
Fig. 1 shows a schematic architecture diagram of a communication system to which an embodiment of the invention is applied. As shown in FIG. 1, the communication system 100 may include a network device 102 and user equipments 104-114 (abbreviated as UEs in the figure) connected by wireless connection or wired connection or other means.
The Network in the embodiment of the present invention may refer to a Public Land Mobile Network (PLMN, which is simply referred to as "PLMN"), a D2D Network, an M2M Network, or other networks, and fig. 1 is a simplified schematic diagram of an example, and the Network may further include other Network devices, which are not shown in fig. 1.
When there are too many ues and the number of available reference signals cannot guarantee that the reference signals used by different ues are different, it is necessary for the ue to share the reference signals with other ues. When a ue using a shared reference signal accesses a network, the network device may not be able to identify which ue is accessed through the reference signal, and when a collision of the reference signal occurs, the network device may not perform accurate user detection and channel estimation, and may not successfully demodulate the ue data.
Aiming at the problem of insufficient reference signal quantity in the prior art, a second-order Reed-Muller (RM) sequence can be adopted to generate a reference signal sequence. Because a large number of sequences can be generated by the generation mode of the second-order Reed-Muller sequence, the number of the reference signal sequences is far larger than that of the existing available reference signal sequences, so that different user equipment can use different reference signal sequences, the success rate of the network equipment for identifying (or detecting) the user equipment based on the reference signal sequences is improved, and the probability of collision of the reference signals of different user equipment is reduced. In addition, because the sequence space of different second-order RM sequences is large, the sequence elements are simple and only consist of real numbers or real numbers and pure imaginary numbers, and when a reference signal sequence generated based on the second-order RM sequences is detected, the complexity of detecting the reference signal sequence can be greatly reduced by using a quick reconstruction algorithm.
The first generation method of the second order RM sequence comprises the following steps:
the order function used to generate the second order RM sequence may be defined as:
Figure BDA0001800763110000051
where P is a binary symmetric matrix of m rows and m columns, x and b are each a binary vector of length m, i2Is-1. Here all elements of P, x, b are 0 or 1. x is an m-bit binary vector with the sequence number q of the elements in the sequence, q is 1, … 2mBin (q-1) represents the conversion of the integer q-1 into an m-bit binary vector, which may be understood as representing the integer q as an m-bit binary vector with the value of each bit in the string as one of the primaries in the binary vector. For example, if the element number is 5 and m also takes a value of 4, a is (00100). Given any P and b, a value of 2 can be generatedmA codeword of an element is a sequence. Co-exist 2m (m-1)/2A different P and 2mB are different and can generate 2m(m+1)/2The sequence, in turn, is based on the generated 2m(m+1)/2The second order RM sequence generates a reference signal sequence. The generation mode of the reference signal sequence can provide a large number of reference signal sequences and is suitable for the requirement of large-scale (mass) access.
Second order RM sequence generation method
Figure BDA0001800763110000052
Wherein, weight (b) represents the number of elements '1' in the binary vector b, and the meaning of other parameters is the same as that in formula 1. The length of the second order RM sequence generated by equation 2 is 2m. All lengths being 2mRM sequence ofCan generate a 2m(r+2)Determines the maximum available sequence number to be 2m(r+2). r is a value having a minimum of 0 and a maximum of
Figure BDA0001800763110000061
Wherein
Figure BDA0001800763110000062
Indicating a rounding down. As can be seen from the above equation 2, for each fixed P matrix, arbitrarily changing the value of the vector b, 2 can be generatedmA space of orthogonal RM sequences. When r is 0, the RM sequence correlations generated from different P matrices are
Figure BDA0001800763110000063
When r is further increased, the maximum correlation of the sequences generated by the two different P matrixes is
Figure BDA0001800763110000064
That is, as r becomes larger, the correlation of the correspondingly generated sequences becomes larger.
In the two second-order RM sequence methods, the P matrix and the b vector are selected independently, and the cross correlation difference of the corresponding generated RM sequences is extremely large, which is not beneficial to user detection. When the reference signal sequence is detected, the detection precision is low and the complexity is high. Since the second order RM sequence is not a completely orthogonal sequence, the detection performance is affected after the second order RM sequence passes through a noise channel due to the non-completely orthogonal characteristic.
The application provides a method for generating a reference signal sequence, which can be applied to a UE to generate a reference signal to be sent to a network device, and can also be applied to the network device to generate the reference signal to be sent to a user equipment. The following describes the method by taking the application of the method to a UE as an example.
As shown in fig. 2, the method for generating a reference signal sequence includes:
step S20, determining the order number m of a binary symmetric matrix for generating a second-order RM sequence;
step S22, determining a binary symmetric matrix P of m orders and a binary vector b of m x 1;
step S24, generating a second-order RM sequence according to the determined binary symmetric matrix P, the binary vector b and a second-order RM sequence generation formula;
and step S26, expanding or truncating the second-order Reed-Muller sequence into a reference signal sequence with the length L.
In an embodiment, step S20 specifically includes: and determining the order m according to the length L of the reference signal sequence. From the foregoing, it can be seen that the length of the second order RM sequence is 2m. If an integer g makes the length of the second order RM sequence 2gClosest to the length L of the reference signal sequence, the integer g is determined as the order m determined in step 20.
In an embodiment, the network device may directly configure the length L of the reference signal sequence for the UE. In another embodiment, the network device configures, instead of directly configuring the length L of the reference signal sequence for the UE, a generation parameter of the reference signal for the UE, where the generation parameter of the reference signal includes one or more of the following parameters: the resource pattern of the reference signal (or the mapping rule from the reference signal sequence to the time-frequency resource), the number of OFDM symbols occupied by the reference signal, and the number of frequency domain resources used for transmitting the reference signal. The parameters may be calculated from one or more of the parameters. For example, if the resource pattern of the reference signal is a comb pattern, the length L of the reference signal sequence is calculated according to the number of positions where the reference signal sequence elements can be mapped in the comb pattern, the number of OFDM symbols occupied by the reference signal, and the number of frequency domain resources used for transmitting the reference signal. In some embodiments, the length L of the reference signal sequence may be determined by only one of the above parameters, for example, each element of the reference signal sequence is on each allocated frequency domain resource by default, and the number of OFDM symbols occupied by the reference signal is also default, and at this time, the length of the reference signal sequence may be determined by only knowing the number of frequency domain resources used for transmitting the reference signal.
In an embodiment, step S20 specifically includes: and acquiring the order m from the received configuration message from the network equipment. In this embodiment, the network device may assign a value of m to the UE and notify the UE of the value through the configuration message. The configuration message may be downlink Control information (dci), radio resource Control (rrc) signaling, or Media Access Control (MAC CE) Control Element.
In an embodiment, step S20 specifically includes: the order m is determined according to the number of Resource Elements (REs) used to transmit the reference signal sequence. The number of resource elements used to transmit the reference signal sequence is actually the length L of the reference signal sequence. In this embodiment, the process of determining the order m and the number of resource elements may refer to a corresponding part of determining the order m according to the length L of the reference signal sequence, and is not described herein again.
In an embodiment, step S20 specifically includes: and determining the order m according to the time-frequency resource used for sending the reference signal sequence. And determining the number of resource particles for transmitting the reference signal sequence according to the time-frequency resource for the reference signal sequence, and then determining the order m according to the determined number of the resource particles. The specific process of determining the order m according to the number of resource particles is described in the foregoing, and is not described herein again.
In an embodiment, step S20 specifically includes: and determining the order m according to the resource pattern of the reference signal and the time-frequency resource used for sending the reference signal sequence. And determining the number of resource particles for transmitting the reference signal sequence according to the resource pattern of the reference signal and the time-frequency resource for transmitting the reference signal sequence, and then determining the order m according to the determined number of the resource particles. The specific process of determining the order m according to the number of resource particles is described in the foregoing, and is not described herein again.
In one embodiment, the binary symmetric matrix P and the binary vector b determined in step S22 satisfy a preset correspondence relationship. For example, a binary symmetric matrix P may correspond to one or more binary vectors b, and when a specific binary symmetric matrix P is determined, only one binary vector b in step S22 can be determined from the binary vectors corresponding to the binary symmetric matrix P. The corresponding relation between the binary symmetric matrix P and the binary vector b can enable different finally generated second-order RM sequences to have good sequence cross correlation, and the detection performance of the sequences is improved.
In one embodiment, the elements in the binary vector b determined in step S22 and the elements in the binary symmetric matrix P satisfy a predetermined operation relationship. In this embodiment, each element in the binary vector b is obtained by performing an operation on part or all of the elements in the binary symmetric matrix P according to a preset operation relationship. Once the binary symmetric matrix P is determined, the binary vector b is no longer any binary vector, but is constrained by the binary symmetric matrix P. The constraint relation can enable different finally generated second-order RM sequences to have good sequence cross correlation and improve the detection performance of the sequences.
In one embodiment, the binary vector b may be represented as [ b [ ]m,bm-1,...,b1]Wherein, the element b in the binary vector bqThe value of (d) is the result of modulo-two addition of all elements in the (m +1-q) th row in the upper triangular matrix of the binary symmetric matrix, q is 2, … m; element b in binary vector b1The value of (d) is the result of the modulo-two addition of all other elements in the vector b.
For example, a binary symmetric matrix can be represented as follows:
Figure BDA0001800763110000081
defining a vector alphas=[p(s,1),...,p(s,s-1)]TAnd 2 ≦ s ≦ m, then the binary vector b ≦ m may be determined according to the following operational relationshipm,bm-1,...,b1]According to the value of each element as follows:
Figure BDA0001800763110000082
wherein the content of the first and second substances,
Figure BDA0001800763110000083
representing a modulo two addition (or exclusive or),
Figure BDA0001800763110000084
is a vector alphasThe value of the nth element is 1, … s-1; bmThe value of (a) is the modulo-two addition of all the elements in the first row in the upper triangular matrix of the binary symmetric matrix P matrix, and so on, b1The value is the modulo two addition of the remaining m-1 elements in the binary vector b.
The binary vector b determined in the above manner can be such that (-1)weight(b)≡1,
Figure BDA0001800763110000085
The number of the detection signals is constant even, so that the complexity of an algorithm for detecting the activity of the user by using the reference signals is reduced, and the detection precision is improved. User detection performance is improved at the expense of the sequence space of the second order RM sequence. Meanwhile, the sequence space is still far larger than the NR DMRS design, and a large connection scene is strongly supported.
There are various ways to determine the binary symmetric matrix P in step S22. For example, the network device may select one binary symmetric matrix from a preset m-order set of binary symmetric matrices, notify the UE of an index of the binary symmetric matrix through a configuration message, and the UE determines the binary symmetric matrix P according to the index and the preset m-order set of binary symmetric matrices. This set of preset m-th order binary symmetric matrices may be specified by the communication protocol followed by the network device and the UE, or determined by the network device and signaled to the UE.
In another embodiment, the symmetric matrix P may be binary according to the following: determining that UE determines an initial value according to a preset function and parameters, determining an index of a binary symmetric matrix corresponding to the initial value according to the initial value and a mapping relation between the preset initial value and the index of the binary symmetric matrix, and determining that parameters of the binary symmetric matrix P include at least one of a user equipment Identifier (ID), a system frame number, a time slot number, a symbol number of a reference signal, a cell ID and a user ID according to the determined index and a set of a preset m-order binary symmetric matrix.
In one specific example, the function for determining the initial value cinit is as follows:
Figure BDA0001800763110000091
wherein n issIndicates the slot number in 1 system frame, l indicates the number of symbol where the reference signal in the slot is located,
Figure BDA0001800763110000092
is a user ID value, which may be configured by the network equipment for the UE through higher layer signaling (e.g., rrc signaling), nSCIDE {0, 1} represents an index of a user ID value, and X<Y may be any integer greater than 1. It is to be understood that the above function for determining the initial value is only an example, and may be other functions, and the application is not limited thereto.
In one specific example, the function for determining the initial value cinit is as follows:
Figure BDA0001800763110000093
f (-) can be any function, Z is the value assigned to the user equipment by the network equipment, nsIndicates the slot number in 1 systematic frame,
Figure BDA0001800763110000094
indicating the cell ID. The scheme can be applied to generation of preamble sequences in the random access process.
In one embodiment, this may be by f (c), for exampleinit) And mapping the initial value into an index of a binary symmetric matrix by a preset function, and determining the binary symmetric matrix corresponding to the index according to the index and a preset m-order binary symmetric matrix set.
In one embodiment of the present invention, the substrate is,the above initial value c may be setinitConverting into a binary vector with length Y; each element in the binary vector is filled into an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P in formula 3, so that the binary symmetric matrix P can be constructed.
In one embodiment, the padding of each element in the binary vector to the upper triangular matrix and/or the lower triangular matrix in the binary symmetric matrix P in equation 3 comprises:
expanding the binary vector into a binary vector with the length of m (m-1)/2;
and filling rules preset by each element in the m (m-1)/2 long vector into an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P. The preset rule may be, for example, to fill each position in the upper triangular matrix or the lower triangular matrix from left to right and from top to bottom in sequence. It is understood that there may be other predetermined rules, and the present application is not limited thereto.
There are various methods of expanding the binary vector of length Y into a binary vector of length m (m-1)/2, for example, expanding the length Y of the binary vector into length m (m-1)/2 by filling in "0" or by encoding.
In the present embodiment, all diagonal elements of the binary symmetric matrix P are 0, for example, as shown in equation 3.
In another embodiment, padding each element in the binary vector to an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P in equation 3 comprises:
expanding the binary vector into a binary vector with the length of m (m + 1)/2;
and filling rules preset by each element in the m (m +1)/2 long vector into an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P.
In the present embodiment, the diagonal elements of the binary symmetric matrix P may not be 0.
In one embodiment, the second order RM sequence generating formula in step S24 includes:
Figure BDA0001800763110000101
or
Figure BDA0001800763110000102
Wherein the content of the first and second substances,
φP,b(j) weight (b) represents the number of "1" in binary vector b, i is the value of the jth element in the second order Reed-Muller sequence2P is said binary symmetric matrix, aj-1Is a binary vector of length m, which is converted from the integer value j-1.
As can be known from the foregoing description, the value of m is not necessarily such that the length 2m of the generated second-order RM sequence is exactly equal to the length L of the reference signal sequence, and therefore, when the lengths of the two sequences are constant, the second-order RM sequence needs to be extended or truncated, so as to form the final reference signal sequence.
For example, when the length of the second order RM sequence is smaller than L, the length matching needs to be performed by padding (a method such as cyclic extension) or zero padding.
For another example, when the length of the second order RM sequence is greater than L, the second order RM sequence needs to be truncated into a sequence with a length of L.
And the UE maps each element in the generated reference signal sequence to a time-frequency resource for sending the reference signal to generate the reference signal and sends the reference signal to the network equipment. The time-frequency resource for transmitting the reference signal may be configured for the UE by the network device, or may be preset, for example, as specified by a protocol.
The Reference Signal sequence generated by the method in the present application can be used as a Demodulation Reference Signal (dmrs) sequence, and can also be used as a preamble sequence in a random access procedure.
By using the method for generating the reference signal sequence, the detection performance of the reference signal sequence can be improved, and the method is mainly embodied in that: by using the method for determining the binary symmetric matrix P and the vector b in the application and combining the nested characteristic of the second-order RM sequence to perform detection and channel estimation, the phase reversal of the related peak value is eliminated, so that the related peak values of different users can be added in phase, and meanwhile, the interference variance is reduced; the channel estimation is simpler and more accurate; for a scene that a sequence is randomly extracted from a large sequence space for access, the orthogonality of the local subspace of the sequence space has little influence on the system performance.
Corresponding to the method, the present application also provides an apparatus for generating a reference signal sequence, which is used for executing the method in the foregoing embodiment. As shown in fig. 3, the apparatus includes:
a first determining module 30, configured to determine an order m of a binary symmetric matrix used for generating a second-order Reed-Muller sequence;
a second determining module 32, configured to determine a binary symmetric matrix P of order m and a binary vector b of m × 1;
a Reed-Muller sequence generating module 34, configured to generate a second-order Reed-Muller sequence according to the determined binary symmetric matrix P, the binary vector b, and a second-order Reed-Muller sequence generating formula;
a reference signal sequence generating module 36, configured to extend or truncate the second-order Reed-Muller sequence into a reference signal sequence with a length L.
In an embodiment, the first determining module 30 is specifically configured to:
determining the order m according to the length L of the reference signal sequence; or
Acquiring the parameter m from a received configuration message from network equipment; or
Determining the order m according to the number of resource particles for transmitting the reference signal sequence; or;
determining the order m according to a time-frequency resource used for sending a reference signal sequence; or
And determining the order m according to the resource pattern of the reference signal and the time-frequency resource used for sending the reference signal sequence.
In an embodiment, the middle elements of the binary vector b and the elements of the binary symmetric matrix P satisfy a predetermined operation relationship.
In one embodiment, the twoThe element vector b is [ b ]m,bm-1,...,b1]Wherein, the element b in the binary vector bqThe value of (d) is the result of modulo-two addition of all elements in the (m +1-q) th row in the upper triangular matrix of the binary symmetric matrix, q is 2, … m; element b in the binary vector b1The value of (b) is the result of modulo-two addition of all other elements in the binary vector b.
In an embodiment, the second determining module 32 is specifically configured to:
determining a binary symmetric matrix P according to an index of a binary symmetric matrix carried by a configuration message from network equipment and a set of preset m-order binary symmetric matrices; or
Determining an initial value according to a preset function and parameters, wherein the parameters comprise at least one of a user equipment Identification (ID), a system frame number, a time slot number, a symbol number of a reference signal and a cell ID; determining the index of the binary symmetric matrix corresponding to the initial value according to the initial value and the mapping relation between the preset initial value and the index of the binary symmetric matrix; determining the binary symmetric matrix P according to the determined index and a preset set of m-order binary symmetric matrices; or
Determining an initial value according to a preset function and parameters, wherein the parameters comprise at least one of a user equipment Identification (ID), a system frame number, a time slot number, a symbol number of a reference signal and a cell ID; converting the initial values into binary vectors; and filling the numerical value of each bit of the binary vector into an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P.
In an embodiment, the second determining module 32 is specifically configured to:
expanding the binary vector into a binary vector of m (m-1)/2 length;
filling the numerical value of each bit in the binary vector with the length of m (m-1)/2 into an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P according to a preset rule.
In one embodiment, the second order Reed-Muller sequence generation formula includes:
Figure BDA0001800763110000121
or
Figure BDA0001800763110000122
Wherein the content of the first and second substances,
φP,b(j) weight (b) represents the number of "1" in binary vector b, i is the value of the jth element in the second order Reed-Muller sequence2P is said binary symmetric matrix, aj-1Is a binary vector of length m, which is converted from the integer value j-1.
For the specific processing procedures of the above modules, reference may be made to the corresponding descriptions in the foregoing embodiments, and details are not described here.
Fig. 4 is a schematic block diagram of an apparatus 400 for generating a reference signal according to an embodiment of the present application. As shown in fig. 4, the apparatus 400 includes a processor 410, a transceiver 430, and a bus system 940. Optionally, the apparatus 400 may further include a memory 920, and the memory 920 is used for storing program instructions. Processor 910 may call program instructions stored in memory 920. The processor 910, memory 920, and transceiver 930 are coupled by a bus system 940.
The processor 910 is configured to call the program instructions stored in the memory 920, and perform the following operations: determining the order number m of a binary symmetric matrix for generating a second-order Reed-Muller sequence;
determining a binary symmetric matrix P of m orders and a binary vector b of m x 1;
generating a second-order Reed-Muller sequence according to the determined binary symmetric matrix P, the binary vector b and a second-order Reed-Muller sequence generating formula;
and expanding or truncating the second-order Reed-Muller sequence into a reference signal sequence with the length L.
In an embodiment, the determining the order number m of the binary symmetric matrix used for generating the second-order Reed-Muller sequence comprises:
determining the order m according to the length L of the reference signal sequence; or
Acquiring the parameter m from a received configuration message from network equipment; or
Determining the order m according to the number of resource particles for transmitting the reference signal sequence; or;
determining the order m according to a time-frequency resource used for sending a reference signal sequence; or
And determining the order m according to the resource pattern of the reference signal and the time-frequency resource used for sending the reference signal sequence.
In an embodiment, the middle elements of the binary vector b and the elements of the binary symmetric matrix satisfy a predetermined operation relationship.
In one embodiment, the binary vector b is [ b ]m,bm-1,...,b1]Wherein, the element b in the binary vector bqIs the result of modulo-two addition of all elements of the (m +1-q) th row in the upper triangular matrix of the binary symmetric matrix P, q being 2, … m; element b in the binary vector b1The value of (b) is the result of modulo-two addition of all other elements in the binary vector b.
In one embodiment, the determining a m-th order binary symmetric matrix P includes:
determining a binary symmetric matrix P according to an index of a binary symmetric matrix carried by a configuration message from network equipment and a set of preset m-order binary symmetric matrices; or
Determining an initial value according to a preset function and parameters, wherein the parameters comprise at least one of a user equipment Identification (ID), a system frame number, a time slot number, a symbol number of a reference signal and a cell ID; determining the index of the binary symmetric matrix corresponding to the initial value according to the initial value and the mapping relation between the preset initial value and the index of the binary symmetric matrix; determining the binary symmetric matrix P according to the determined index and a preset set of m-order binary symmetric matrices; or
Determining an initial value according to a preset function and parameters, wherein the parameters comprise at least one of a user equipment Identification (ID), a system frame number, a time slot number, a symbol number of a reference signal and a cell ID; converting the initial values into binary vectors; and filling the numerical value of each bit of the binary vector into an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P.
In one embodiment, padding the values of the bits of the binary vector to the upper triangular matrix and/or the lower triangular matrix in the binary symmetric matrix P comprises:
expanding the binary vector into a binary vector of m (m-1)/2 length;
filling the numerical value of each bit in the binary vector with the length of m (m-1)/2 into an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P according to a preset rule.
In an embodiment, the second-order Reed-Muller sequence generation formula includes:
Figure BDA0001800763110000141
or
Figure BDA0001800763110000142
Wherein the content of the first and second substances,
φP,b(j) weight (b) represents the number of "1" in binary vector b, i is the value of the jth element in the second order Reed-Muller sequence2P is said binary symmetric matrix, aj-1Is a binary vector of length m, which is converted from the integer value j-1.
The transceiver 430 is configured to transmit the generated reference signal sequence.
It should be understood that the apparatus 400 may correspond to the UE device in the method embodiment shown in fig. 2, and may have corresponding functions, which are not described herein again for brevity.
In an embodiment, the apparatus 400 is embodied as a chip, and the transceiver 400 may be embodied as a communication interface of the chip.
In an embodiment, the apparatus 400 is specifically a user equipment, and the transceiver 400 may specifically be a radio frequency transceiver circuit of the user equipment.
The Device according to the embodiment of the present Application may be a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), a System Chip (System on Chip, SoC), a Central Processing Unit (CPU), a Network Processor (NP), a Digital Signal processing Circuit (DSP), a microcontroller (Micro Controller Unit, MCU), a Programmable Logic Device (PLD) or other Integrated chips.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U disk, a removable hard disk, a read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims (15)

1. A method of generating a reference signal sequence, comprising:
determining the order number m of a binary symmetric matrix for generating a second-order Reed-Muller sequence;
determining a binary symmetric matrix P of m orders and a binary vector b of m x 1; the middle element of the binary vector b and the element of the binary symmetric matrix meet a preset operational relationship;
generating a second-order Reed-Muller sequence according to the determined binary symmetric matrix P, the binary vector b and a second-order Reed-Muller sequence generating formula;
and expanding or truncating the second-order Reed-Muller sequence into a reference signal sequence with the length L.
2. The method of claim 1, wherein the determining the order m of the binary symmetric matrix used to generate the second order Reed-Muller sequence comprises:
determining the order m according to the length L of the reference signal sequence; or
Acquiring the order m from a received configuration message from network equipment; or
Determining the order m according to the number of resource particles for transmitting the reference signal sequence; or;
determining the order m according to a time-frequency resource used for sending a reference signal sequence; or
And determining the order m according to the resource pattern of the reference signal and the time-frequency resource used for sending the reference signal sequence.
3. The method of claim 1, wherein the binary vector b is [ b [ ]m,bm-1,…,b1]Wherein, the element b in the binary vector bqIs the result of modulo-two addition of all elements of the (m +1-q) th row in the upper triangular matrix of the binary symmetric matrix P, q being 2, … m; element b in the binary vector b1The value of (b) is the result of modulo-two addition of all other elements in the binary vector b.
4. The method of claim 1, wherein determining a m-th order binary symmetric matrix P comprises:
determining a binary symmetric matrix P according to an index of a binary symmetric matrix carried by a configuration message from network equipment and a set of preset m-order binary symmetric matrices; or
Determining an initial value according to a preset function and parameters, wherein the parameters comprise at least one of a user equipment Identification (ID), a system frame number, a time slot number, a symbol number of a reference signal and a cell ID; determining the index of the binary symmetric matrix corresponding to the initial value according to the initial value and the mapping relation between the preset initial value and the index of the binary symmetric matrix; determining the binary symmetric matrix P according to the determined index and a preset set of m-order binary symmetric matrices; or
Determining an initial value according to a preset function and parameters, wherein the parameters comprise at least one of a user equipment Identification (ID), a system frame number, a time slot number, a symbol number of a reference signal and a cell ID; converting the initial values into binary vectors; and filling the numerical value of each bit of the binary vector into an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P.
5. The method of claim 4, wherein padding values of bits of the binary vector to an upper triangular matrix and/or a lower triangular matrix of the binary symmetric matrix P comprises:
expanding the binary vector into a binary vector of m (m-1)/2 length;
filling the numerical value of each bit in the binary vector with the length of m (m-1)/2 into an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P according to a preset rule.
6. The method of any of claims 1 to 5, wherein the second order Reed-Muller sequence generation formula comprises:
Figure FDA0003111303560000021
or
Figure FDA0003111303560000022
Wherein the content of the first and second substances,
φP,b(j) weight (b) represents the number of "1" in binary vector b, i is the value of the jth element in the second order Reed-Muller sequence2P is said binary symmetric matrix, aj-1Is a binary vector of length m, which is converted from the integer value j-1.
7. An apparatus for generating a reference signal sequence, the apparatus comprising:
the first determining module is used for determining the order number m of a binary symmetric matrix used for generating a second-order Reed-Muller sequence;
a second determining module, configured to determine an m-order binary symmetric matrix P and a m × 1 binary vector b; the middle element of the binary vector b and the element of the binary symmetric matrix P meet a preset operational relationship;
a Reed-Muller sequence generation module, configured to generate a second-order Reed-Muller sequence according to the determined binary symmetric matrix P, the binary vector b, and a second-order Reed-Muller sequence generation formula;
and the reference signal sequence generating module is used for expanding or truncating the second-order Reed-Muller sequence into a reference signal sequence with the length of L.
8. The apparatus of claim 7, wherein the first determining module is specifically configured to:
determining the order m according to the length L of the reference signal sequence; or
Acquiring the order m from a received configuration message from network equipment; or
Determining the order m according to the number of resource particles for transmitting the reference signal sequence; or;
determining the order m according to a time-frequency resource used for sending a reference signal sequence; or
And determining the order m according to the resource pattern of the reference signal and the time-frequency resource used for sending the reference signal sequence.
9. The apparatus of claim 7, wherein the binary vector b is [ b [ ]m,bm-1,...,b1]Wherein, the element b in the binary vector bqIs the result of modulo-two addition of all elements of the (m +1-q) th row in the upper triangular matrix of the binary symmetric matrix, q being 2.. m; element b in the binary vector b1The value of (b) is the result of modulo-two addition of all other elements in the binary vector b.
10. The apparatus of claim 7, wherein the second determining module is specifically configured to:
determining a binary symmetric matrix P according to an index of a binary symmetric matrix carried by a configuration message from network equipment and a set of preset m-order binary symmetric matrices; or
Determining an initial value according to a preset function and parameters, wherein the parameters comprise at least one of a user equipment Identification (ID), a system frame number, a time slot number, a symbol number of a reference signal and a cell ID; determining the index of the binary symmetric matrix corresponding to the initial value according to the initial value and the mapping relation between the preset initial value and the index of the binary symmetric matrix; determining the binary symmetric matrix P according to the determined index and a preset set of m-order binary symmetric matrices; or
Determining an initial value according to a preset function and parameters, wherein the parameters comprise at least one of a user equipment Identification (ID), a system frame number, a time slot number, a symbol number of a reference signal and a cell ID; converting the initial values into binary vectors; and filling the numerical value of each bit of the binary vector into an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P.
11. The apparatus of claim 10, wherein the second determining module is specifically configured to:
expanding the binary vector into a binary vector of m (m-1)/2 length;
filling the numerical value of each bit in the binary vector with the length of m (m-1)/2 into an upper triangular matrix and/or a lower triangular matrix in the binary symmetric matrix P according to a preset rule.
12. The apparatus of any of claims 7 to 11, wherein the second order Reed-Muller sequence generation formula comprises:
Figure FDA0003111303560000031
or
Figure FDA0003111303560000032
Wherein the content of the first and second substances,
φP,b(j) weight (b) represents the number of "1" in binary vector b, i is the value of the jth element in the second order Reed-Muller sequence2P is said binary symmetric matrix, aj-1Is a binary vector of length m, which is converted from the integer value j-1.
13. An apparatus for generating a reference signal sequence, the apparatus comprising a processor configured to enable the apparatus to perform the method of any of claims 1-6 and a transceiver, the transceiver being specifically configured to transmit the generated reference signal sequence.
14. A computer-readable storage medium, in which a computer program code is stored, which, when executed by a processing unit or a processor, causes the processing unit or an apparatus on which the processor is located to perform the method of any of claims 1 to 6.
15. A communication chip having instructions stored therein which, when run on a communication device, cause the communication device to perform the method of any one of claims 1 to 6.
CN201811075982.5A 2018-09-14 2018-09-14 Method and device for generating reference signal Active CN110912660B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201811075982.5A CN110912660B (en) 2018-09-14 2018-09-14 Method and device for generating reference signal
PCT/CN2019/105676 WO2020052646A1 (en) 2018-09-14 2019-09-12 Method and device for generating reference signal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811075982.5A CN110912660B (en) 2018-09-14 2018-09-14 Method and device for generating reference signal

Publications (2)

Publication Number Publication Date
CN110912660A CN110912660A (en) 2020-03-24
CN110912660B true CN110912660B (en) 2021-09-14

Family

ID=69776716

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811075982.5A Active CN110912660B (en) 2018-09-14 2018-09-14 Method and device for generating reference signal

Country Status (2)

Country Link
CN (1) CN110912660B (en)
WO (1) WO2020052646A1 (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114095137A (en) * 2020-08-24 2022-02-25 华为技术有限公司 Wireless communication method and device
CN114126053A (en) * 2020-08-28 2022-03-01 华为技术有限公司 Data transmission method and device
CN114157405A (en) * 2020-09-08 2022-03-08 华为技术有限公司 Reference signal sequence generation method and communication device
CN115189732A (en) * 2022-04-08 2022-10-14 网络通信与安全紫金山实验室 Method and device for estimating precoding matrix

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101379710A (en) * 2006-02-06 2009-03-04 高通股份有限公司 Message remapping and encoding
CN101488823A (en) * 2008-01-14 2009-07-22 三星电子株式会社 Reed-Muller decoding method and decoder using the method
CN106972914A (en) * 2010-04-01 2017-07-21 瑞典爱立信有限公司 It is used for the system and method that control information is transmitted by signal in mobile communications network
CN107437984A (en) * 2016-05-27 2017-12-05 华为技术有限公司 Information transferring method and device

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090031195A1 (en) * 2007-07-25 2009-01-29 Digital Prospect Sdn.Bhd. Method and apparatus for encoding and decoding Reed-Muller codes
CN102088309B (en) * 2009-12-04 2014-09-10 重庆无线绿洲通信技术有限公司 Method and device for generating reference signal used for estimating channel quality
CN107548094B (en) * 2016-06-23 2020-08-25 华为技术有限公司 Method for transmitting user sequence, network equipment and terminal equipment
CN107566081B (en) * 2016-06-30 2020-04-03 华为技术有限公司 RM sequence generation and application method and device

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101379710A (en) * 2006-02-06 2009-03-04 高通股份有限公司 Message remapping and encoding
CN101488823A (en) * 2008-01-14 2009-07-22 三星电子株式会社 Reed-Muller decoding method and decoder using the method
CN106972914A (en) * 2010-04-01 2017-07-21 瑞典爱立信有限公司 It is used for the system and method that control information is transmitted by signal in mobile communications network
CN107437984A (en) * 2016-05-27 2017-12-05 华为技术有限公司 Information transferring method and device

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"LTE系统中Reed-Muller码的编译码算法";陈发堂; 何坚龙;《重庆邮电大学学报(自然科学版)》;20100815;全文 *
"Projected subcodes of the second order binary Reed-Muller code";Matthieu Legeay;Pierre Loidreau;《2012 IEEE International Symposium on Information Theory Proceedings》;20121230;全文 *
"一种改进的二阶Reed-Muller译码算法";李效坡; 陈发堂;《通信技术》;20070610;全文 *

Also Published As

Publication number Publication date
CN110912660A (en) 2020-03-24
WO2020052646A1 (en) 2020-03-19

Similar Documents

Publication Publication Date Title
CN110912660B (en) Method and device for generating reference signal
EP3606242B1 (en) Data transmission method and apparatus
CN109802796B (en) Reference signal transmission method and reference signal transmission device
US10797827B2 (en) Grant-free transmission method and apparatus
CN109150777B (en) Reference signal transmission method and reference signal transmission device
JP6430981B2 (en) Method for receiving and transmitting control channel, user equipment and base station
CN108462556B (en) Method and device for transmitting data
US20190052502A1 (en) Data transmission method, user equipment, and network side device
EP3457735B1 (en) Method for transmitting user sequence, network device, and terminal device
RU2726155C1 (en) Method and device for transmitting uplink demodulation reference signal
CN106817210B (en) Transmission method and device of reference signal sequence
EP3606236B1 (en) Method and apparatus for determining transport block size
EP3589048B1 (en) Data sending method and apparatus, and data receiving method and apparatus
CN107437984B (en) Information transmission method and device
US10819487B2 (en) Pilot transmission method, terminal device, and network device
US20220377744A1 (en) Communication method, apparatus, and system
CN109995492B (en) Communication method, device and system
US10764915B2 (en) Sequence-based signal processing method and apparatus
EP2991283A1 (en) Data transmission method and apparatus
CN107710853A (en) The method and apparatus for transmitting information
KR20190102260A (en) Message sending method and device
WO2022002005A1 (en) Sequence generation method and related device
CN107733596B (en) Information transmission method and equipment
KR20190075128A (en) Data transfer method and apparatus
CN117856989A (en) Reference signal configuration method for delay Doppler domain, communication device 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