Communication method and related apparatus

Abstract

Provided in the embodiments of the present application are a communication method and a related apparatus. The communication method comprises: a network-side device sending a demodulation reference signal to a user equipment, wherein the demodulation reference signal is generated on the basis of first sequences, the first sequences are periodic sequences, the period of each of the first sequences is 2p-1, p being an integer greater than 1 and less than 31, and the demodulation reference signal is used for downlink data demodulation. By reducing the period of each first sequence, a length of the first sequence that is truncated when the first sequence is used is reduced, and by reducing the length of the first sequence that is truncated when the first sequence is used, a cross-correlation value between first sequences is reduced, thereby improving cross-correlation performance of the demodulation reference signal and further reducing inter-cell interference.

Description

Communication method and related apparatus

[0001] The present application claims priority to the Chinese patent application No. 202410869442.3, filed on June 28, 2024, and entitled "Communication method and related apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of mobile communication technology, and in particular to a communication method and related apparatus. BACKGROUND

[0003] Before communicating with the network side, a user equipment (UE) needs to perform cell search, find a cell to which a location where the user equipment is located belongs, and synchronize with the cell, receive and decode necessary information for communicating with and normally working with the cell. Specifically, the user equipment obtains downlink synchronization and a physical layer cell identity (Cell ID) of the cell by detecting a primary synchronization signal (PSS) and a secondary synchronization signal (SSS) at a specific location, and then obtains necessary cell system information by receiving a physical broadcast channel (PBCH) signal. The PBCH contains a demodulation reference signal (DMRS).

[0004] After obtaining the downlink synchronization and the physical cell identity based on the PSS and the SSS, the PBCH needs to be demodulated based on the DMRS, and the DMRS is an important reference signal for detection by a user receiving end. The DMRS is transmitted together with the PBCH data. The DMRS reference signal sequence can be a gold sequence, and the complete period of the gold sequence is 2 31 -1. The value range of the physical cell identity is [0, 1, 2, …, 1007], and if the physical cell identities of adjacent cells are the same modulo 4, then different beams or different cells need to be distinguished according to the correlation between DMRS sequences. The existing correlation performance between DMRS sequences is poor, resulting in large inter-cell interference. Reducing the correlation between the DMRS of the PBCH is a problem that needs to be solved urgently. SUMMARY

[0005] The present application provides a communication method and related apparatus, which reduces the period of the DMRS sequence to improve the correlation performance of the DMRS sequence and reduce inter-cell interference.

[0006] To achieve the above-mentioned purpose, the present application adopts the following technical solutions:

[0007] In a first aspect, a communication method is provided, applied to a network-side device, the method comprising:

[0008] transmitting a demodulation reference signal, the demodulation reference signal being generated based on a first sequence, the first sequence being a periodic sequence, a period of the first sequence being 2 p -1, p being an integer greater than 1 and less than 31, the demodulation reference signal being used for downlink data demodulation. In this way, by reducing the period of the first sequence, the length of the first sequence that is truncated when used is reduced; by reducing the length of the first sequence that is truncated when used, the cross-correlation value between the first sequences is reduced, thereby improving the cross-correlation performance of the demodulation reference signal, and thus reducing the interference between cells.

[0009] In some implementations of the first aspect, the first sequence is a Z4 sequence, a Z6 sequence, or a Z8 sequence, and the period of the first sequence is 2 7 -1 or 2 8 -1. Wherein generating the demodulation reference signal based on the Z4 sequence, the Z6 sequence, or the Z8 sequence can improve the capacity of the demodulation reference signal to carry more information, and reducing the period of the first sequence by 2 7 -1 or 2 8 -1, thereby reducing the length of the first sequence that is truncated during use, so that the first sequence has a lower cross-correlation.

[0010] In some implementations of the first aspect, the period of the first sequence is 2 13 -1, and the initialization c init satisfies the following formula:

[0011] or

[0012] wherein, is a beam identifier, carried based on 3 bits, is a cell identifier, carried based on 10 bits, and the c init is used to determine the first sequence. In this way, the period of the first sequence is reduced to reduce the length of the demodulation reference signal that is truncated, reduce the cross-correlation value between the first sequences, improve the cross-correlation performance of the demodulation reference signal, and reduce the interference between cells.

[0013] In some implementations of the first aspect, if the first sequence is a Z4 sequence, the period of the first sequence is 2 13 -1, then the primitive polynomial of the first sequence is f(x) = x 13 + 2x 8 + 2x 7 + x 4 + x 3+x+1. The primitive polynomial has less taps and lower implementation complexity.

[0014] Further, if the first sequence is a Z4 sequence, and the period of the first sequence is 2 13 -1, the recursive formula of the first sequence is: c(t) = (2c(t-5) + 2c(t-6) + 3c(t-9) + 3c(t-10) + 3c(t-12) + 3c(t-13)) mod 4.

[0015] In some implementations of the first aspect, if the period of the first sequence is 2 16 -1, the initialization c init of the first sequence satisfies the following formula:

[0016] wherein, is a beam identifier, is a cell identifier, and the c init is used to determine the first sequence. The above initialization c init multiplexes the framework of the existing protocol by optimizing the coefficients of the existing architecture. For example the maximum value of is 3; by multiplying 2 2 to ensure that different and c init are generated. The period of the first sequence is reduced, thereby reducing the cross-correlation value between the first sequences, improving the cross-correlation performance of the demodulation reference signal, and reducing the interference between cells.

[0017] In some implementations of the first aspect, the first sequence is a Z4 sequence, and the period of the first sequence is 2 16 -1, the primitive polynomial of the first sequence is f(x) = x 16 +x 9 +3x 7 +x 2 +2x+1. The primitive polynomial has less taps and lower implementation complexity.

[0018] Further, the first sequence is a Z4 sequence, and the period of the first sequence is 2 16 -1, the recursive formula of the first sequence is: c(t) = (3c(t-7) + c(t-9) + 3c(t-14) + 2c(t-15) + c(t-16)) mod 4.

[0019] In some implementations of the first aspect, if the period of the first sequence is 2 22 -1, the initialization c init of the first sequence satisfies the following formula:

[0020] wherein, is a beam identity, is a cell identity, the initialization c init is used to determine the first sequence. The above initialization c init The formula reuses the framework of the existing protocol by reducing the period of the first sequence to 2 22 -1; to reduce the length of the first sequence that needs to be truncated in practical applications, thereby reducing the cross-correlation values between the first sequences, improving the cross-correlation performance of the demodulation reference signal, and reducing the interference between cells. In some implementations of the first aspect, the first sequence is a Z4 sequence, and the period of the first sequence is 2 22 -1, then the primitive polynomial of the first sequence is f(x) = x 22 + 2x 14 + x 5 + 3. The primitive polynomial has fewer taps and has lower implementation complexity.

[0021] Further, if the first sequence is a Z4 sequence and the period of the first sequence is 2 22 -1, then the primitive polynomial of the first sequence is f(x) = x 22 + 2x 14 + x 5 + 3, and the recursive formula corresponding to the first sequence is: c(t) = (2c(t-8) + 3c(t-17) + c(t-22)) mod 4 。

[0022] In some implementations of the first aspect, the first sequence is a gold sequence, and the nth element c(n) of the first sequence satisfies: c(n) = (x1(n+N c ) + x2(n+N c ) mod 2, where n is an integer taking a value from 0 to M pn -1, M pn is the length of the first sequence, x1(n+N c ) is the (n+N c )th element of the second sequence, x2(n+N c ) is the (n+N c )th element of the third sequence, and N c is an integer. The periods of the second sequence and the third sequence are the same as that of the first sequence. Wherein x1(0) = 1, x1(n) = 0, n = 1, 2,..., p-1,

[0023] It should be understood that N c represents the cyclic shift value of the sequences x1 and x2. represents the truncation of cinit The initial value of sequence x2 can be obtained by converting it into binary representation.

[0024] In some implementations of the first aspect, if the first sequence is any one of the Z4 sequence, Z6 sequence, or Z8 sequence, then the c init Used to determine the initial value of the first sequence and / or the value of the cyclic shift.

[0025] In some implementations of the first aspect, if the first sequence is a Z4 sequence and the period of the first sequence is 2... 7 -1, the recursive formula corresponding to the first sequence satisfies:

[0026] c(n+7) = (2c(n+4) + 3c(n+1) + c(n)) mod 4. This recursive formula corresponds to a primitive polynomial with fewer taps, resulting in lower implementation complexity.

[0027] In some implementations of the first aspect, if the first sequence is a Z4 sequence and the period of the first sequence is 2... 8 -1, the recurrence relation of the first sequence satisfies: c(n+8)=(3c(n+5)+c(n+3)+3c(n+2)+2c(n+1)+3c(n))mod4. The primitive polynomial corresponding to this recurrence relation has a small number of taps and low implementation complexity.

[0028] In some implementations of the first aspect, if the first sequence is a Z4 sequence, then natural mapping is used to modulate the first sequence. Modulating the first sequence through natural mapping reduces the length that the first sequence needs to be truncated in practical applications, thereby reducing the cross-correlation value between the first sequences, improving the cross-correlation performance of the demodulated reference signal, and reducing inter-cell interference.

[0029] In some embodiments, the mapping rules of the natural mapping satisfy... or By adopting the above mapping rules, the cross-correlation values ​​between the first sequences can be reduced, the cross-correlation performance of the demodulated reference signal can be improved, and the interference between cells can be reduced.

[0030] Secondly, a communication method is provided, applied to a user equipment (UE), the method comprising:

[0031] A demodulation reference signal is received, the demodulation reference signal being generated based on a first sequence, the first sequence being a periodic sequence with a period less than 2. 31 -1; The demodulation reference signal is used for downlink data demodulation.

[0032] In some implementations of the second aspect, the first sequence is a Z4 sequence, a Z6 sequence, or a Z8 sequence, and a period of the first sequence is 2 7 -1 or 2 8 -1.

[0033] In some implementations of the second aspect, if the first sequence is a Z4 sequence, a period of the first sequence is 2 13 -1, a primitive polynomial of the first sequence is f(x) = x 13 + 2x 8 + 2x 7 + x 4 + x 3 + x + 1.

[0034] In some implementations of the second aspect, if a period of the first sequence is 2 16 -1, an initialization c init of the first sequence satisfies the following equation:

[0035] wherein, is a beam identifier, is a cell identifier, and the initialization c init is used to determine the first sequence.

[0036] Further, if the first sequence is a Z4 sequence, a period of the first sequence is 2 16 -1, a recursive formula of the first sequence is c(t) = (3c(t-7) + c(t-9) + 3c(t-14) + 2c(t-15) + c(t-16)) mod 4.

[0037] In some implementations of the second aspect, the first sequence is a Z4 sequence, a period of the first sequence is 2 16 -1, a primitive polynomial of the first sequence is f(x) = x 16 + x 9 + 3x 7 + x 2 + 2x + 1.

[0038] In some implementations of the second aspect, if a period of the first sequence is 2 22 -1, an initialization c init of the first sequence satisfies the following equation:

[0039] wherein, is a beam identifier, is a cell identifier, and the initialization c init is used to determine the first sequence.

[0040] Further, if the first sequence is a Z4 sequence, and the period of the first sequence is 2 22 -1, the primitive polynomial of the first sequence is f(x) = x 22 + 2x 14 + x 5 + 3.

[0041] In some implementations of the second aspect, the first sequence is a Z4 sequence, and the period of the first sequence is 2 22 -1, the primitive polynomial of the first sequence is f(x) = x 22 + 2x 14 + x 5 + 3.

[0042] In some implementations of the second aspect, the first sequence is a gold sequence, and an nth element c(n) of the first sequence satisfies: c(n) = (x1(n+N c ) + x2(n+N c ) mod 2, where n is an integer ranging from 0 to M pn -1, M pn is the length of the first sequence, x1(n+N c ) is an (n+N c )th element of a second sequence, x2(n+N c ) is an (n+N c )th element of a third sequence, and N c is an integer. The second sequence and the third sequence have the same period as the first sequence. In some implementations, x1(0) = 1, and x1(n) = 0, n = 1, 2,..., p-1,

[0043] In some implementations of the second aspect, the first sequence is any one of a Z4 sequence, a Z6 sequence, or a Z8 sequence, and the c init are used to determine the initial value and / or the cyclic shift of the first sequence.

[0044] In some implementations of the second aspect, if the first sequence is a Z4 sequence, and the period of the first sequence is 2 7 -1, the recursive formula corresponding to the first sequence satisfies:

[0045] c(n+7) = (2c(n+4) + 3c(n+1) + c(n)) mod 4

[0046] In some implementations of the second aspect, if the first sequence is a Z4 sequence, and the period of the first sequence is 2 8-1, the recursive formula of the first sequence satisfies: c(n+8) = (3c(n+5) + c(n+3) + 3c(n+2) + 2c(n+1) + 3c(n)) mod 4.

[0047] In some implementations of the second aspect, if the first sequence is a Z4 sequence, the first sequence is modulated by using a natural mapping.

[0048] In some embodiments, the mapping rule of the natural mapping satisfies Or

[0049] In a third aspect, a network-side device is provided, comprising: a memory comprising computer-readable instructions; and a processor in communication with the memory, the processor configured to execute the computer-readable instructions to cause the network-side device to perform the communication method of any of the first aspect.

[0050] In a fourth aspect, a user device is provided, comprising: a memory comprising computer-readable instructions; and a processor in communication with the memory, the processor configured to execute the computer-readable instructions to cause the user device to perform the communication method of any of the second aspect.

[0051] In a fifth aspect, a computer-readable storage medium is provided, comprising a program or instructions, which, when executed by a processor, implement the communication method of any of the first aspect.

[0052] In a sixth aspect, a chip is provided, comprising a processor configured to invoke and run instructions stored in a memory, so that a user device or a network-side device installed with the chip performs the communication method of any of the first aspect.

[0053] The beneficial effects brought by each possible implementation of the communication method provided by the second aspect, the network-side device provided by the third aspect, the user device provided by the fourth aspect, the computer-readable storage medium provided by the fifth aspect, and the chip provided by the sixth aspect of the embodiments of the present application can be referred to the description in the various possible implementations of the first aspect, which will not be repeated here. BRIEF DESCRIPTION OF DRAWINGS

[0054] FIG. 1 is a structural schematic diagram of a feedback shift register;

[0055] FIG. 2 is a schematic diagram of a frequency domain pattern of a DMRS;

[0056] FIG. 3 is a flowchart of a communication method provided by the embodiments of the present application;

[0057] FIG. 4 is a schematic diagram of a Z4 sequence generated by a register;

[0058] FIG. 5 is a comparison diagram of cross-correlation of a demodulation reference signal according to an embodiment of the present application;

[0059] FIG. 6 is a structural diagram of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0060] The technical solutions in the present application will be described below with reference to the drawings. Obviously, the described embodiments are only some of the embodiments of the present specification, not all the embodiments.

[0061] In order to facilitate the understanding of the solutions of the embodiments of the present application, the terms that may be involved in the embodiments of the present application are explained below.

[0062] 1. Physical Cell Identifier (PCI):

[0063] The cell of each communication system corresponds to a physical cell identifier (PCI). The PCI is a number used to uniquely identify a cell, which ensures that the user equipment can identify the cell it is in and establish and maintain a communication connection with it. The PCI is used to distinguish the cells on the wireless side. The PCI consists of two parts: the primary synchronization signal (PSS) and the secondary synchronization signal (SSS). In actual deployment, in order to reduce interference between adjacent cells, it is necessary to ensure that adjacent or overlapping coverage area cells have non-repeating PCIs.

[0064] 2. m-sequence

[0065] The m-sequence is a maximum length linear feedback shift register sequence, which is a kind of digital sequence generated by a linear feedback shift register (LFSR). The m-sequence is the longest periodic sequence generated by a shift register with linear feedback. Generally, the longest period of an n-level linear feedback shift register is equal to 2 n -1.

[0066] FIG. 1 is a structural diagram of a feedback shift register, in which the bit data for initialization is stored in a memory, and a new value is generated by a feedback function and supplemented to the memory. The m-sequence is a short name for the maximum length linear feedback shift register sequence. Here, we assume that the feedback function is an exclusive-OR operation on all the bits in the memory, that is, and the output sequence is

[0067] The m-sequence is determined by the initial bit values ​​stored in the register and the primitive polynomial, where the order of the primitive polynomial is the highest power of the polynomial. For example, f(x) = x 7 The recursive formula corresponding to +x+1 is c(t)+c(t-6)+c(t-7)=0. For binary addition, it is defined as modulo 2 addition, that is, -1=1, 1+1=0, 1+0=1, 0+0=0. Therefore, the above formula can be transformed into the recursive formula c(t)=c(t-6)+c(t-7).

[0068] Generally, for multivariate or binary sequences, consider the primitive polynomial: a i For any ∈{0,1,2,…M}, if it is a binary sequence, M=1; if it is a quaternion sequence, M=3, and so on. The recursive formula is: For a quaternion sequence, addition is defined on {0,1,2,3}, meaning the result of addition must be modulo 4, i.e., -1 = 3, -2 = 2, -3 = 1.

[0069] 3. Gold sequence

[0070] Gold sequences are pseudo-random sequences. They are obtained by performing an element-wise XOR operation on two sequences with different primitive polynomials. Gold sequences have good autocorrelation and cross-correlation properties; moreover, the number of gold sequences is large, making them easy to carry information.

[0071] 4. Z4 sequence

[0072] The Z4 sequence has the same period as the binary gold sequence of the same length, with a value set of {0,1,2,3}. It can be modulated into a complex signal using quadrature phase shift keying (QPSK). Similar to the gold sequence, the Z4 sequence can be generated using a circular shift register. The generation of the Z4 sequence is similar to that of the m-sequence, except that the Z4 sequence is defined on a four-element ring of {0,1,2,3}. Therefore, addition and subtraction must be modulo 4. The specific recursive formula for the sequence can be found above.

[0073] It is easy to understand that the mobile communication NR downlink broadcast signal is composed of a primary synchronization signal (PSS), a secondary synchronization signal (SSS) and a physical broadcast channel (PBCH), wherein the PSS and the SSS are used for downlink synchronization and determining a physical cell identifier (PCI), the PBCH contains a Demodulation Reference Signal (DMRS) and a PBCH payload, the PBCH payload contains a 24-bit Master Indication Block (MIB) and an 8-bit physical layer additional bit as a source bit, the PBCH payload carries a system frame number, a PBCH subcarrier offset and SIB1 (system information block 1) related configuration parameters, etc.; the DMRS is used to carry beam information and for channel estimation. The total number of subcarriers occupied by the PBCH is 576, a total of 48 Resource Blocks (RBs), wherein the DMRS occupies 144 Resource Elements (REs) and the data occupies 432 REs. One DMRS symbol can be placed in every four REs.

[0074] The DMRS pilot in each RB of the PBCH channel contains 3 REs, in order to avoid inter-cell PBCH DMRS interference, the 3rd Generation Partnership Project (3GPP) defines that the DMRS of the PBCH is staggered in the frequency domain according to PCI mod4, wherein mod is a remainder function, mod represents a remainder, and PCI mod4 is the remainder of PCI divided by 4.

[0075] After obtaining the downlink synchronization and the PCI based on the PSS and the SSS, the PBCH needs to be demodulated, and the DMRS is an important reference signal for detection by the user receiving end. The DMRS is sent together with the PBCH data. Taking the generation of the DMRS based on a gold sequence as an example, the nth element in the DMRS can be generated by the following formula:

[0076] Wherein, c(n) is a pseudo-random sequence, c(n) is a gold sequence with a period of 2 31 -1, for a sequence c(n) with an output length of M PN , n = 0, 1,..., M PN-1; the recurrence formula of the gold sequence satisfies:

[0077] c(n) = (x1(n+N C )+x2(n+N C ))mod2

[0078] x1(n+31) = (x1(n+3)+x1(n))mod2

[0079] x2(n+31) = (x2(n+3)+x2(n+2)+x2(n+1)+x2(n))mod2.

[0080] where N C = 1600. The first m-sequence x1(n) can be initialized as x1(0) = 1, x1(n) = 0, n = 1, 2, …, 30. The second m-sequence x2(n) is initialized by a parameter c init . The c init satisfies:

[0081] The above c init is determined by a beam identity and a cell identity , where if the number of SS / PBCH blocks within a half frame is equal to 4, then where n hf = 0 indicates that the PBCH is transmitted in the first half subframe, otherwise n hf = 1 indicates that the PBCH is transmitted in the second half subframe, i SSB denotes the two least significant bits in the index of the SS / PBCH block; if the number of SS / PBCH blocks within a half frame is greater than 4, then i SSB denotes the three least significant bits in the index of the SS / PBCH block.

[0082] According to the above, the PBCH DMRS adopts a gold sequence mapped in the frequency domain, and the complete period of the gold sequence is 2 31 -1. After QPSK modulation, it is mapped on the physical resource in the order of frequency domain first and time domain second, and is transmitted to the user equipment using a Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM) waveform.

[0083] Wherein, the value range of PCI is [0, 1, 2, … 1007], if the value of PCI mod 4 of adjacent cells is the same, then the correlation between DMRS sequences is needed to distinguish different beams or different cells. The existing correlation performance between DMRS sequences is poor, resulting in large inter-cell interference. For example, if the actual length of DMRS is only 144 characters, and the period is 2 31 -1, the gold sequence needs to be truncated to a large length, so that the correlation performance between the truncated gold sequences is poor, resulting in large inter-cell interference.

[0084] Wherein, after determining the specific length of DMRS, a complete period of gold sequence can be generated, and then the sequence of the specific length is truncated at the determined starting point, and the remaining part of the gold sequence is discarded as a truncated part; or after determining the specific length of DMRS, a sequence of the specific length is generated, and then the generation of subsequent sequences is stopped, that is, the other part of the gold sequence is discarded as a truncated part. Since the period of the gold sequence is much larger than the actual length of the DMRS, when the DMRS is generated based on the gold sequence with a period of 2 31 -1, the length of the truncated gold sequence is long, so that the correlation performance between the truncated gold sequences is poor.

[0085] Based on the above problems, the present application provides a communication method, a network side device sends a demodulation reference signal to a user equipment, the demodulation reference signal is generated based on a first sequence, the first sequence is a periodic sequence, the period of the first sequence is 2 p -1, p is an integer greater than 1 and less than 31, the demodulation reference signal is used for downlink data demodulation, by reducing the period of the first sequence, the length of the truncated first sequence is smaller when the first sequence is used, the correlation value between the first sequences is reduced, thereby improving the correlation performance between the first sequences, and by distinguishing different cells through the correlation of the demodulation reference signal, the inter-cell interference can be reduced.

[0086] Please refer to FIG. 2, which is a scene schematic diagram of a communication system provided by the present application, the communication system in FIG. 2 includes a user equipment and a network side device, and the network side device can provide communication services for the user equipment.

[0087] The communication systems mentioned in the present application include but are not limited to: narrow band-Internet of things (NB-IoT), global system for mobile communications (GSM), enhanced data rate for GSM evolution (EDGE), wideband code division multiple access (WCDMA), code division multiple access 2000 (CDMA2000), time division synchronization code division multiple access (TD-SCDMA), long term evolution (LTE) and three application scenarios of 5G mobile communication system: enhanced mobility broad band (eMBB), ultra-reliable and low latency communications (URLLC) and enhanced machine-type communication (eMTC), as well as future communication systems (such as 6G / 7G, etc.).

[0088] The network-side device can be a device capable of communicating with the user equipment. The network-side device can be a base station, a relay station, or an access point. The base station can be a base transceiver station (BTS) in a global system for mobile communication (GSM) system or a code division multiple access (CDMA) network, a 3G base station NodeB in a wide band code division multiple access (WCDMA) system, an evolutional NodeB (eNB or eNodeB) in a long term evolution (LTE) system, a satellite in a satellite communication system, a radio controller in a cloud radio access network (CRAN) scenario, a network-side device in a 5G network or a future evolved PLMN network (e.g., a gNodeB), a wearable device, a UAV, a V2X device, a D2D device, or a network-side device in a future communication system.

[0089] The user equipment can be a user equipment (UE), an access terminal, a terminal unit, a terminal station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a terminal, a wireless communication device, a terminal agent, or a terminal apparatus. The access terminal can 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 functions, a computing device, or other processing devices connected to a wireless modem, a wearable device, a UAV, a V2X device, a D2D device, a user equipment in a 5G network, a user equipment in a future evolved PLMN network, or a user equipment in a future communication system.

[0090] Please refer to FIG. 3, which is a flow diagram of a communication method provided by an embodiment of the present application. The communication method in FIG. 3 includes S301-S302.

[0091] S301, a user equipment is sent a demodulation reference signal, the demodulation reference signal is generated based on a first sequence, the first sequence is a periodic sequence.

[0092] Wherein, the period of the first sequence is 2 p -1, p is an integer greater than 1 and less than 31, and the demodulation reference signal is used for downlink data demodulation.

[0093] Optionally, the downlink data can be a broadcast signal, and the broadcast signal can be paging information, a physical broadcast channel (PBCH), or system information. For example, the downlink data can be a PBCH or a physical downlink shared channel (PDSCH).

[0094] Optionally, the first sequence is a modulated sequence. Further, if the sequence before modulation is a second sequence, the second sequence can be a gold sequence or a Z4 sequence.

[0095] Optionally, the first sequence has 4 different elements.

[0096] S302, the user equipment receives the demodulation reference signal and performs downlink data demodulation according to the demodulation reference signal.

[0097] In this way, compared with the period of the sequence corresponding to the demodulation reference signal being set to 2 31 -1, the period of the first sequence used to generate the demodulation reference signal in the present application is less than 2 31 -1; by reducing the period of the first sequence, and the actual length of the demodulation reference signal remains unchanged, when the first sequence is used, the length of the first sequence required for shortening becomes smaller, thereby reducing the cross-correlation between different first sequences, and when different cells are distinguished by the correlation of the demodulation reference sequence, the interference between cells can be reduced.

[0098] The following describes an example in which the downlink data is a PBCH, based on the following initialization c init The number of bits required for PBCH DMRS initialization is analyzed:

[0099] Wherein, C init is used to determine the first sequence, is a beam identifier, is a cell identifier.

[0100] The formula of the above C init , wherein is 3 bits, 10 bits, 8 bits, so 3+8=11 bits are needed, 3 bits are needed, 2 bits are needed. The C init The maximum value of the value of PBCH DMRS initialization needs a 22-bit register. If the period of the first sequence is 2 31 -1, the truncation length of the first sequence is longer, which affects the cross-correlation performance between the first sequences. The present application reduces the period of the first sequence, reduces the length of the first sequence when used, and further improves the cross-correlation performance between the first sequences.

[0101] Optionally, the first sequence can be a Z4 sequence. Using a Z4 sequence as an SSS sequence, the Z4 sequence carries different cell identities based on different initial values and cyclic shifts, wherein the cyclic shifts are selected at equal intervals. The Z4 sequence with a length of 2 n -1 is projected onto a binary field, and the resulting sequence period is still 2 n -1. The binary sequence is an m-sequence corresponding to the primitive polynomial generated by projecting the corresponding Z4 sequence onto the binary field. For a Z4 sequence with a length of L=2 r -1, the maximum cross-correlation value is That is, compared with a gold sequence, the cross-correlation value is larger, that is, the PBCH DMRS is generated by a Z4 sequence, which can improve the cross-correlation performance of the PBCH DMRS and reduce inter-cell interference.

[0102] The Z4 sequence can also be generated by a register. The period of the Z4 sequence is the same as that of the binary gold sequence, and the value set is {0, 1, 2, 3}. Figure 4 is a schematic diagram of a Z4 sequence generated by a register. The Z4 sequence in Figure 4 corresponds to a primitive polynomial: f(x)=x 3 +2x 2 +x+3.

[0103] As can be easily understood, the Z4 sequence has the following characteristics: unlike the m sequence, the initial value of the Z4 sequence with a length of 2 n -1 has 4 n different cases. The Z4 sequences generated under different initial values are mostly cyclic shift versions of each other. For example, for a sequence with a length of 63, 4095 sequences are obtained by traversing the initial value. The 65 sequences obtained by screening the 4095 sequences are sequences whose values are different after cyclic shift. Therefore, the Z4 sequence can carry information based on two dimensions of initial value and cyclic shift, and has a larger capacity than the m sequence.

[0104] The following gives a flow using Z4 sequence to carry cell identification:

[0105] In one embodiment, the number of cell identifications is 1134, the SSS length is 127, the PSS carries 3 cell identifications, the SSS uses 6 initial values, and 63 cyclic shifts are selected under each initial value (to avoid false detection caused by decimal frequency offset), and the SSS carries 378 cell identifications in total.

[0106] In another embodiment, the number of cell identifications is 2016, the SSS length is 127, the PSS carries 1 cell identification, the SSS uses 32 initial values, and 63 cyclic shifts are selected under each initial value, and the SSS carries 2016 cell identifications in total.

[0107] More cell identifications can be used in this way. It should be noted that the interval of the cyclic shifts can also be larger, such as 3, 4, 5, etc.

[0108] It is easy to understand that the above embodiments are described by taking Z4 as an example, and in other embodiments, the first sequence can also be a Z6 sequence or a Z8 sequence. The Z6 sequence is a sequence based on modulo 6, and the element value set of the Z6 sequence is {0, 1, 2, 3, 4, 5}. Correspondingly, the Z8 sequence is a sequence based on modulo 8, that is, the element value set of the Z8 sequence is {0, 1, 2, 3, 4, 5, 6, 7}.

[0109] It is easy to understand that the first sequence can also be a gold sequence. In some implementations, the period of the gold sequence is 2 31 -1. In the embodiments of the present application, the period of the gold sequence is less than 2 31 -1. By reducing the period of the gold sequence, the truncation length of the gold sequence is reduced, and the cross-correlation performance is also improved.

[0110] In some embodiments, the period of the first sequence is 2 22 -1, the initialization c init of the first sequence satisfies the following formula:

[0111] wherein, is a beam identification, is a cell identification, and the initialization c init is used to determine the first sequence.

[0112] The initialization c init of the above formula reuses the framework of the existing protocol, and by reducing the period of the first sequence to 2 22 -1, the length of the first sequence that needs to be truncated in actual application is reduced, the cross-correlation value between the first sequences is reduced, the cross-correlation performance is improved, and the interference between cells is reduced.

[0113] In some embodiments, if the period of the first sequence is 2... 16 -1, then the initialization c of the first sequence init Satisfy the following formula:

[0114] Initialize c init Used to determine the first sequence.

[0115] The above initialization c init Reuse the framework of existing protocols by optimizing the coefficients of the existing architecture. For example... The maximum value is 3; through Multiply by 2 2 To ensure different and The generated c init The difference is that the period of the first sequence is shortened, thereby reducing the cross-correlation value between the first sequences, improving the cross-correlation performance, and reducing interference between cells.

[0116] In some embodiments, the period of the first sequence is 2. 13 -1, initialization of the first sequence c init Satisfy the following formula:

[0117] or Initialize c init Used to determine the first sequence.

[0118] in, 10 bits Since it is 3 bits, only 2 cycles are needed in total. 13 A sequence of -1 can carry all the information, thereby reducing the length of the first sequence that is truncated when used, reducing the cross-correlation value between the first sequences, improving cross-correlation performance, and reducing interference between cells.

[0119] Optionally, if the period of the first sequence is 2... 13 -1, 2 16 -1 or 2 21 -1; then the first sequence can be a gold sequence, and the nth element c(n) of the first sequence satisfies:

[0120] c(n)=(x1(n+N c )+x2(n+N c ))mod2;

[0121] Where n is a value ranging from 0 to M pn Integers of -1, M pn x1(n+N) is the length of the first sequence. c) is the (n+N c )th element of the second sequence, x2(n+N c ) is the (n+N c )th element of the second sequence, N c is an integer. The period of the second sequence and the third sequence is the same as the first sequence. Wherein x1(0) = 1, x1(n) = 0, n = 1, 2,..., p-1,

[0122] It should be understood that N c represents the cyclic shift value of the sequences x1 and x2. The initial value of the sequence x2 can be obtained by converting c init into a binary representation.

[0123] Optionally, since the gold sequence is a kind of pseudo-random sequence, the gold sequence is composed of two m sequences with equal code length and same code clock rate by modulo 2 addition, then the second sequence and the third sequence are both m sequences, and the code length and the code clock rate of the second sequence and the third sequence are equal.

[0124] Optionally, if the period of the first sequence is 2 13 -1, 2 16 -1 or 2 22 -1, the first sequence is any one of Z4 sequence, Z6 sequence, Z8 sequence, then c init is used to determine the initial value and / or the value of the cyclic shift of the first sequence. If the first sequence is a Z4 sequence, the Z4 sequence carries the cell ID based on different initial values and cyclic shifts when the first sequence is used, then c init can be used to determine the initial value of the first sequence, and each different initial value will produce a different starting point within the period, thereby resulting in a unique sequence. By determining the initial value of the first sequence through c init , the corresponding first sequence is determined. c init can also be used to determine the value of the cyclic shift of the first sequence, and by determining the value of the cyclic shift of the first sequence, the starting element of the first sequence can be changed. Of course, c init can also be used to determine the initial value and the value of the cyclic shift of the first sequence, and by limiting the initial value and / or the value of the cyclic shift of the first sequence, the first sequence can carry more information, the period of the first sequence is reduced, the length of the first sequence is shortened when used, the cross-correlation value between the first sequences is reduced, the cross-correlation performance is improved, and the interference between cells is reduced.

[0125] Optionally, if the first sequence is a Z4 sequence and the period of the first sequence is 2 22 -1, the primitive polynomial of the first sequence is f(x) = x 22+2x 14 +x 5 +3. The recurrence relation for the first sequence is: c(t) = (2c(t-8) + 3c(t-17) + c(t-22)) mod 4. This primitive polynomial has a small number of taps and low implementation complexity.

[0126] Optionally, if the first sequence is a Z4 sequence, the period of the first sequence is 2. 22 -1, then the primitive polynomial of the first sequence is f(x) = x 22 +2x 14 +x 5 +3, then the initial value of the first sequence can be any of the following values:

[0127] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1]

[0128] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2]

[0129] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3]

[0130] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1]

[0131] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2]

[0132] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,3]

[0133] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,1]

[0134] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3]

[0135] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,1]

[0136] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,2]

[0137] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,3]

[0138] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1]

[0139] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,2]

[0140] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,3]

[0141] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1]

[0142] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,2]

[0143] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,3]

[0144] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,2]

[0145] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,3]

[0146] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,3,1]

[0147] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,3,2]

[0148] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,3,3]

[0149] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,1]

[0150] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,3]

[0151] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,1,1]

[0152] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,1,2]

[0153] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,1,3]

[0154] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,1]

[0155] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,3]

[0156] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,1]

[0157] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,3]

[0158] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,1]

[0159] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,2]

[0160] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,3]

[0161] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,1,1]

[0162] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,1,2]

[0163] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,1,3]

[0164] [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,1]

[0165] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 2, 2]

[0166] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 2]

[0167] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3]

[0168] It is easy to understand that the sequences obtained after a number of cyclic shifts based on the above initial values are all different. Or, the sequence obtained after cyclic shift of any initial value above is different from the sequence generated by other initial values above.

[0169] It is easy to understand that if the first sequence is a Z4 sequence, the period of the first sequence is 2 22 -1, the primitive polynomial of the first sequence is f(x) = x 22 +2x 14 +x 5 +3, and the recursive formula corresponding to the first sequence is: c(t) = (2c(t-8) + 3c(t-17) + c(t-22)) mod 4. The number of taps of the primitive polynomial is small, and the implementation complexity is low. The initial value of the first sequence can also be other numerical values, which is not limited by the present application.

[0170] Alternatively, if the first sequence is a Z4 sequence, the period of the first sequence is 2 16 -1, the primitive polynomial of the first sequence is f(x) = x 16 +x 9 +3x 7 +x 2 +2x+1. The recursive formula corresponding to the first sequence is: c(t) = (3c(t-7) + c(t-9) + 3c(t-14) + 2c(t-15) + c(t-16)) mod 4. The number of taps of the primitive polynomial is small, and the implementation complexity is low.

[0171] Alternatively, if the first sequence is a Z4 sequence, the period of the first sequence is 2 16 -1, the primitive polynomial of the first sequence is f(x) = x 16 +x 9 +3x 7 +x 2+2x+1, the recursive formula of the first sequence is: c(t) = (3c(t-7) + c(t-9 + 3c(t-14) + 2c(t-15) + c(t-16)) mod 4 The primitive polynomial has fewer taps and has lower implementation complexity. The initial value of the first sequence can be any one of the following values:

[0172] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]

[0173] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2]

[0174] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3]

[0175] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1]

[0176] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2]

[0177] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 3]

[0178] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1]

[0179] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3]

[0180] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 1]

[0181] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 2]

[0182] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3]

[0183] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1]

[0184] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2]

[0185] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 3]

[0186] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1]

[0187] [0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,2]

[0188] [0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,3]

[0189] [0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,2]

[0190] [0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,3]

[0191] [0,0,0,0,0,0,0,0,0,0,0,0,0,1,3,1]

[0192] [0,0,0,0,0,0,0,0,0,0,0,0,0,1,3,2]

[0193] [0,0,0,0,0,0,0,0,0,0,0,0,0,1,3,3]

[0194] [0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,1]

[0195] [0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,3]

[0196] [0,0,0,0,0,0,0,0,0,0,0,0,0,2,1,1]

[0197] [0,0,0,0,0,0,0,0,0,0,0,0,0,2,1,2]

[0198] [0,0,0,0,0,0,0,0,0,0,0,0,0,2,1,3]

[0199] [0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,1]

[0200] [0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,3]

[0201] [0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,1]

[0202] [0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,3]

[0203] [0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,1]

[0204] [0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,2]

[0205] [0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,3]

[0206] [0,0,0,0,0,0,0,0,0,0,0,0,0,3,1,1]

[0207] [0,0,0,0,0,0,0,0,0,0,0,0,0,3,1,2]

[0208] [0,0,0,0,0,0,0,0,0,0,0,0,0,3,1,3]

[0209] [0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,1]

[0210] [0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,2]

[0211] [0,0,0,0,0,0,0,0,0,0,0,0,0,3,3,2]

[0212] [0,0,0,0,0,0,0,0,0,0,0,0,0,3,3,3]

[0213] It is easy to understand that after performing several cyclic shifts on the sequences obtained based on the above initial values, the resulting sequences are all different. In other words, after performing a cyclic shift on the sequence obtained from any of the above initial values, the resulting sequence is different from the sequences generated by the other initial values.

[0214] It's easy to understand that if the first sequence is a Z4 sequence, then the period of the first sequence is 2. 16 -1, then the primitive polynomial of the first sequence is f(x) = x 16 +x 9 +3x 7 +x 2 +2x+1, the initial value of the first sequence can also be other values, and this application does not impose any restrictions.

[0215] Optionally, if the first sequence is a Z4 sequence, the period of the first sequence is 2. 13 -1, then the primitive polynomial of the first sequence is f(x) = x 13 +2x 8 +2x 7 +x 4 +x 3+x+1. The recursive formula corresponding to the first sequence is: c(t) = (2c(t-5) + 2c(t-6) + 3c(t-9) + 3c(t-10) + 3c(t-12) + 3c(t-13)) mod 4. The primitive polynomial has a small number of taps and has a low implementation complexity.

[0216] Optionally, if the first sequence is a Z4 sequence, the period of the first sequence is 2 13 -1, the primitive polynomial of the first sequence is f(x) = x 13 +2x 8 +2x 7 +x 4 +x 3 +x+1, the initial value of the first sequence can be any one of the following values:

[0217] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]

[0218] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2]

[0219] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3]

[0220] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1]

[0221] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2]

[0222] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 3]

[0223] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1]

[0224] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3]

[0225] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 1]

[0226] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 2]

[0227] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3]

[0228] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1]

[0229] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 2]

[0230] [0,0,0,0,0,0,0,0,0,0,1,0,3]

[0231] [0,0,0,0,0,0,0,0,0,0,1,1,1]

[0232] [0,0,0,0,0,0,0,0,0,0,1,1,2]

[0233] [0,0,0,0,0,0,0,0,0,0,1,1,3]

[0234] [0,0,0,0,0,0,0,0,0,0,1,2,2]

[0235] [0,0,0,0,0,0,0,0,0,0,1,2,3]

[0236] [0,0,0,0,0,0,0,0,0,0,1,3,1]

[0237] [0,0,0,0,0,0,0,0,0,0,1,3,2]

[0238] [0,0,0,0,0,0,0,0,0,0,1,3,3]

[0239] [0,0,0,0,0,0,0,0,0,0,2,0,1]

[0240] [0,0,0,0,0,0,0,0,0,0,2,0,3]

[0241] [0,0,0,0,0,0,0,0,0,0,2,1,1]

[0242] [0,0,0,0,0,0,0,0,0,0,2,1,2]

[0243] [0,0,0,0,0,0,0,0,0,0,2,1,3]

[0244] [0,0,0,0,0,0,0,0,0,0,2,2,1]

[0245] [0,0,0,0,0,0,0,0,0,0,2,2,3]

[0246] [0,0,0,0,0,0,0,0,0,0,2,3,1]

[0247] [0,0,0,0,0,0,0,0,0,0,2,3,3]

[0248] [0,0,0,0,0,0,0,0,0,0,3,0,1]

[0249] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 2]

[0250] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 3]

[0251] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 1, 1]

[0252] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 1, 2]

[0253] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 1, 3]

[0254] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 2, 1]

[0255] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 2, 2]

[0256] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 2]

[0257] [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 3]

[0258] It is easy to understand that after a certain number of cyclic shifts are performed on the sequence obtained based on the initial value, the obtained sequences are all different. Or, after a cyclic shift is performed on the sequence obtained based on any initial value, the obtained sequence is different from the sequence generated based on other initial values.

[0259] It is easy to understand that if the first sequence is a Z4 sequence, the period of the first sequence is 2 13 -1, the primitive polynomial of the first sequence is f(x) = x 13 + 2x 8 + 2x 7 + x 4 + x 3 + x + 1, and the initial value of the first sequence can also be other numerical values, which are not limited by the present application.

[0260] In some embodiments, the first sequence is a Z4 sequence, a Z6 sequence or a Z8 sequence, and the period of the first sequence is 2 7 -1 or 2 8 -1. In the case where the length of the demodulation reference signal is fixed, compared with the gold sequence, the Z4 sequence, the Z6 sequence or the Z8 sequence can improve the capacity of the demodulation reference signal to carry more information, and reduce the period of the first sequence by 2 7 -1 or 2 8-1, so that the length of the first sequence can be reduced during use, the cross-correlation value between the first sequences can be reduced, the cross-correlation performance of the first sequence can be improved, and the interference between cells can be reduced.

[0261] Optionally, since the cell identifier is 10 bits and the beam identifier is 3 bits, the number of bits required for the initialization of the demodulation reference signal is 13, and if the period of the first sequence is 2 7 -1, the implementation is performed by a linear feedback shift register, the linear feedback shift register has seven decision bits (or contains seven memories), and of the 13 bits: 6 bits are used to carry an initial value of the first sequence, the seven decision bits are used for cyclic shift, and then the first sequence is generated. Of course, in other embodiments, of the 13 bits: 5 bits are used to carry the initial value of the first sequence, and 8 decision bits are used for cyclic shift, and then the first sequence is generated.

[0262] Optionally, if the first sequence is a Z4 sequence, a Z6 sequence, or a Z8 sequence, the period of the first sequence is 2 7 -1 or 2 8 -1, the first sequence can be determined by table lookup. The following takes the Z4 sequence as an example for description. Please refer to Table 1, which shows the initial value index and the cyclic shift index corresponding to each index. The Z4 sequence is determined based on the initial value and the cyclic shift. After the corresponding index is determined, the initial value index and the cyclic shift index corresponding to the index can be determined by table lookup. Each initial value index has a corresponding initial value. For example, if the period of the Z4 sequence is 2 7 -1, the initial value index 0 corresponds to the initial value [0, 0, 0, 0, 0, 1, 1]; each cyclic shift index has a corresponding cyclic shift value. For example, the cyclic shift index 1 corresponds to the cyclic shift value 2. Then, the corresponding Z4 sequence is determined according to the initial value and the cyclic shift value. For example, if the Z4 sequence is generated by a linear feedback shift register, the initial state of the linear feedback shift register is determined according to the initial value, and the linear feedback shift register is cyclically shifted according to the cyclic shift value. For example, if the cyclic shift value is 2, the linear feedback shift register is cyclically left-shifted by 2 bits, and then the required Z4 sequence is obtained. Of course, in other embodiments, the initial value index and the initial value are of the same size. For example, if the period of the Z4 sequence is 2 7 -1, the initial value index 3 corresponds to the initial value [0, 0, 0, 0, 0, 1, 1]. Correspondingly, the cyclic shift index and the cyclic shift value are the same. For example, if the period of the Z4 sequence is 2 7 -1, the cyclic shift index 124 corresponds to the cyclic shift value 124; of course, in other embodiments, the initial value index and the initial value satisfy a first relationship, and the cyclic shift index and the cyclic shift value satisfy a second relationship. The first relationship and the second relationship can be a value equality relationship or other linear or nonlinear relationships.

[0263] Table 1

[0264] Further, when determining the first sequence, the number of available initial values is at least 2 7 -1, each initial value can generate 2 7 -1 available cyclic shifts, i.e., each initial value has 2 7 -1 available cyclic shifts, the first sequence can carry at least (2 7 -1)*(2 7 -1) values, and the number of carried information is greater than 2 13 , i.e., the determined first sequence satisfies the required number of bits for demodulation reference signal initialization.

[0265] Optionally, if the first sequence is a Z4 sequence, a Z6 sequence, or a Z8 sequence, the period of the first sequence is 2 7 -1 or 2 8 -1, the first sequence can be determined by a function formula, for example, determining the initial value and the cyclic shift corresponding to a plurality of index pairs by the above-mentioned identification, and then determining the function formula by a plurality of value fitting or the like. The function formula can be a machine model or other types of functions, which are not limited by the present application.

[0266] Optionally, the first sequence is a Z4 sequence, and the period of the first sequence is 2 7 -1, the recursive formula corresponding to the first sequence satisfies:

[0267] c(n+7) = (2c(n+4) + 3c(n+1) + c(n)) mod 4;

[0268] Wherein, c(n+7) is the n+7th element of the first sequence, c(n+4) is the n+4th element of the first sequence; c(n+1) is the n+1th element of the first sequence; c(n) is the nth element of the first sequence.

[0269] Optionally, the first sequence is a Z4 sequence, and the period of the first sequence is 2 7 -1, the primitive polynomial of the first sequence is f(x) = x 7 + 2x 4 + x + 3.

[0270] Optionally, if the first sequence is a Z4 sequence, the period of the first sequence is 2 7 -1, the primitive polynomial of the first sequence is f(x) = x 7 + 2x 4 + x + 3, and the initial value of the first sequence can be any one of the following values:

[0271] [0,0,0,0,0,0,1]

[0272] [0,0,0,0,0,0,2]

[0273] [0,0,0,0,0,0,3]

[0274] [0,0,0,0,0,1,1]

[0275] [0,0,0,0,0,1,2]

[0276] [0,0,0,0,0,1,3]

[0277] [0,0,0,0,0,2,1]

[0278] [0,0,0,0,0,2,3]

[0279] [0,0,0,0,0,3,1]

[0280] [0,0,0,0,0,3,2]

[0281] [0,0,0,0,0,3,3]

[0282] [0,0,0,0,1,0,1]

[0283] [0,0,0,0,1,0,2]

[0284] [0,0,0,0,1,0,3]

[0285] [0,0,0,0,1,1,1]

[0286] [0,0,0,0,1,1,2]

[0287] [0,0,0,0,1,1,3]

[0288] [0,0,0,0,1,2,2]

[0289] [0,0,0,0,1,2,3]

[0290] [0,0,0,0,1,3,1]

[0291] [0,0,0,0,1,3,2]

[0292] [0,0,0,0,1,3,3]

[0293] [0,0,0,0,2,0,1]

[0294] [0,0,0,0,2,0,3]

[0295] [0,0,0,0,2,1,1]

[0296] [0,0,0,0,2,1,2]

[0297] [0,0,0,0,2,1,3]

[0298] [0,0,0,0,2,2,1]

[0299] [0,0,0,0,2,2,3]

[0300] [0,0,0,0,2,3,1]

[0301] [0,0,0,0,2,3,2]

[0302] [0,0,0,0,2,3,3]

[0303] [0,0,0,0,3,0,1]

[0304] [0,0,0,0,3,0,2]

[0305] [0,0,0,0,3,0,3]

[0306] [0,0,0,0,3,1,1]

[0307] [0,0,0,0,3,1,2]

[0308] [0,0,0,0,3,1,3]

[0309] [0,0,0,0,3,2,1]

[0310] [0,0,0,0,3,2,2]

[0311] [0,0,0,0,3,3,1]

[0312] [0,0,0,0,3,3,2]

[0313] [0,0,0,0,3,3,3]

[0314] [0,0,0,1,0,0,1]

[0315] [0,0,0,1,0,1,1]

[0316] [0,0,0,1,0,1,3]

[0317] [0,0,0,1,0,2,1]

[0318] [0,0,0,1,0,3,0]

[0319] [0,0,0,1,0,3,3]

[0320] [0,0,0,1,1,0,3]

[0321] [0,0,0,1,1,1,0]

[0322] [0,0,0,1,1,2,0]

[0323] [0,0,0,1,1,3,0]

[0324] [0,0,0,1,1,3,3]

[0325] [0,0,0,1,2,0,1]

[0326] [0,0,0,1,2,0,3]

[0327] [0,0,0,1,2,1,0]

[0328] [0,0,0,1,2,1,1]

[0329] [0,0,0,1,2,1,3]

[0330] [0,0,0,1,2,2,1]

[0331] [0,0,0,1,2,2,3]

[0332] [0,0,0,1,2,3,0]

[0333] [0,0,0,1,2,3,1]

[0334] [0,0,0,1,2,3,3]

[0335] [0,0,0,1,3,0,0]

[0336] [0,0,0,1,3,1,0]

[0337] [0,0,0,1,3,1,1]

[0338] [0,0,0,1,3,2,1]

[0339] [0,0,0,1,3,2,3]

[0340] [0,0,0,1,3,3,0]

[0341] [0,0,0,1,3,3,1]

[0342] [0,0,0,2,0,0,3]

[0343] [0,0,0,2,0,1,1]

[0344] [0,0,0,2,0,1,2]

[0345] [0,0,0,2,0,3,2]

[0346] [0,0,0,2,0,3,3]

[0347] [0,0,0,2,1,0,3]

[0348] [0,0,0,2,1,1,1]

[0349] [0,0,0,2,1,1,3]

[0350] [0,0,0,2,1,2,1]

[0351] [0,0,0,2,1,2,2]

[0352] [0,0,0,2,1,2,3]

[0353] [0,0,0,2,2,3,1]

[0354] [0,0,0,2,2,3,2]

[0355] [0,0,0,2,3,0,2]

[0356] [0,0,0,2,3,1,2]

[0357] [0,0,0,2,3,2,2]

[0358] [0,0,0,2,3,2,3]

[0359] [0,0,0,2,3,3,1]

[0360] [0,0,0,2,3,3,3]

[0361] [0,0,0,3,0,1,0]

[0362] [0,0,0,3,0,3,1]

[0363] [0,0,0,3,1,0,1]

[0364] [0,0,0,3,1,1,0]

[0365] [0,0,0,3,1,3,3]

[0366] [0,0,0,3,2,0,3]

[0367] [0,0,0,3,2,2,3]

[0368] [0,0,0,3,3,1,0]

[0369] [0,0,0,3,3,2,0]

[0370] [0,0,1,0,0,1,2]

[0371] [0,0,1,0,0,2,2]

[0372] [0,0,1,0,1,0,1]

[0373] [0,0,1,0,1,1,2]

[0374] [0,0,1,0,1,2,1]

[0375] [0,0,1,0,1,3,3]

[0376] [0,0,1,0,2,0,1]

[0377] [0,0,1,0,2,2,2]

[0378] [0,0,1,0,2,2,3]

[0379] [0,0,1,0,3,3,1]

[0380] [0,0,1,1,1,0,1]

[0381] [0,0,1,1,1,2,1]

[0382] [0,0,1,1,1,2,3]

[0383] [0,0,1,1,3,2,0]

[0384] [0,0,1,2,0,2,1]

[0385] [0,0,1,2,0,2,2]

[0386] [0,0,1,2,1,2,3]

[0387] [0,0,1,2,2,3,1]

[0388] [0,0,1,2,3,3,1]

[0389] [0,0,1,3,1,0,0]

[0390] [0,0,1,3,1,2,3]

[0391] [0,0,2,0,0,2,1]

[0392] [0,0,2,0,0,3,2]

[0393] [0,0,2,0,1,1,3]

[0394] [0,0,2,1,1,0,0]

[0395] [0,0,2,1,2,3,3]

[0396] [0,0,2,1,3,2,1]

[0397] [0,0,2,2,0,2,1]

[0398] [0,0,2,2,2,0,3]

[0399] [0,0,2,2,3,3,2]

[0400] It is easy to understand that after performing several cyclic shifts on the sequences obtained based on the above initial values, the resulting sequences are all different. In other words, after performing a cyclic shift on the sequence obtained from any of the above initial values, the resulting sequence is different from the sequences generated by the other initial values.

[0401] Optionally, the first sequence is a Z4 sequence, and the period of the first sequence is 2. 8 -1, the recurrence formula corresponding to the first sequence satisfies:

[0402] c(n+8)=(3c(n+5)+c(n+3)+3c(n+2)+2c(n+1)+3c(n))mod4;

[0403] Where c(n+8) is the (n+8)th element of the first sequence, c(n+5) is the (n+5)th element of the first sequence, c(n+3) is the (n+3)th element of the first sequence, and c(n) is the (n)th element of the first sequence.

[0404] Optionally, the first sequence is a Z4 sequence, and the period of the first sequence is 2. 8 -1, the primitive polynomial of the first sequence is f(x) = x 8 +x 5 +3x 3 +x 2 +2x+1.

[0405] Optionally, if the first sequence is a Z4 sequence, the period of the first sequence is 2. 8 -1, then the primitive polynomial of the first sequence is f(x) = x 8 +x 5 +3x 3 +x 2 If we add 2x + 1, then the initial value of the first sequence can be any of the following values:

[0406] [0,0,0,0,0,0,0,1]

[0407] [0,0,0,0,0,0,0,2]

[0408] [0,0,0,0,0,0,0,3]

[0409] [0,0,0,0,0,0,1,1]

[0410] [0,0,0,0,0,0,1,2]

[0411] [0,0,0,0,0,0,1,3]

[0412] [0,0,0,0,0,0,2,1]

[0413] [0,0,0,0,0,0,2,3]

[0414] [0,0,0,0,0,0,3,1]

[0415] [0,0,0,0,0,0,3,2]

[0416] [0,0,0,0,0,0,3,3]

[0417] [0,0,0,0,0,1,0,1]

[0418] [0,0,0,0,0,1,0,2]

[0419] [0,0,0,0,0,1,0,3]

[0420] [0,0,0,0,0,1,1,1]

[0421] [0,0,0,0,0,1,1,2]

[0422] [0,0,0,0,0,1,1,3]

[0423] [0,0,0,0,0,1,2,2]

[0424] [0,0,0,0,0,1,2,3]

[0425] [0,0,0,0,0,1,3,1]

[0426] [0,0,0,0,0,1,3,2]

[0427] [0,0,0,0,0,1,3,3]

[0428] [0,0,0,0,0,2,0,1]

[0429] [0,0,0,0,0,2,0,3]

[0430] [0,0,0,0,0,2,1,1]

[0431] [0,0,0,0,0,2,1,2]

[0432] [0,0,0,0,0,2,1,3]

[0433] [0,0,0,0,0,2,2,1]

[0434] [0,0,0,0,0,2,2,3]

[0435] [0,0,0,0,0,2,3,1]

[0436] [0,0,0,0,0,2,3,3]

[0437] [0,0,0,0,0,3,0,1]

[0438] [0,0,0,0,0,3,0,2]

[0439] [0,0,0,0,0,3,0,3]

[0440] [0,0,0,0,0,3,1,1]

[0441] [0,0,0,0,0,3,1,2]

[0442] [0,0,0,0,0,3,1,3]

[0443] [0,0,0,0,0,3,2,1]

[0444] [0,0,0,0,0,3,2,2]

[0445] [0,0,0,0,0,3,3,2]

[0446] [0,0,0,0,0,3,3,3]

[0447] [0,0,0,0,1,0,0,0]

[0448] [0,0,0,0,1,0,0,1]

[0449] [0,0,0,0,1,0,0,2]

[0450] [0,0,0,0,1,0,1,0]

[0451] [0,0,0,0,1,0,1,2]

[0452] [0,0,0,0,1,0,2,1]

[0453] [0,0,0,0,1,0,2,2]

[0454] [0,0,0,0,1,0,3,0]

[0455] [0,0,0,0,1,1,0,0]

[0456] [0,0,0,0,1,1,0,1]

[0457] [0,0,0,0,1,1,0,2]

[0458] [0,0,0,0,1,1,1,0]

[0459] [0,0,0,0,1,1,1,1]

[0460] [0,0,0,0,1,1,1,2]

[0461] [0,0,0,0,1,1,2,0]

[0462] [0,0,0,0,1,1,2,1]

[0463] [0,0,0,0,1,1,2,2]

[0464] [0,0,0,0,1,1,3,0]

[0465] [0,0,0,0,1,1,3,1]

[0466] [0,0,0,0,1,2,0,0]

[0467] [0,0,0,0,1,2,0,1]

[0468] [0,0,0,0,1,2,1,0]

[0469] [0,0,0,0,1,2,1,2]

[0470] [0,0,0,0,1,2,2,0]

[0471] [0,0,0,0,1,2,2,1]

[0472] [0,0,0,0,1,2,2,2]

[0473] [0,0,0,0,1,2,3,0]

[0474] [0,0,0,0,1,2,3,1]

[0475] [0,0,0,0,1,2,3,2]

[0476] [0,0,0,0,1,3,0,0]

[0477] [0,0,0,0,1,3,0,1]

[0478] [0,0,0,0,1,3,0,2]

[0479] [0,0,0,0,1,3,1,0]

[0480] [0,0,0,0,1,3,2,1]

[0481] [0,0,0,0,1,3,3,1]

[0482] [0,0,0,0,1,3,3,2]

[0483] [0,0,0,0,2,0,0,1]

[0484] [0,0,0,0,2,0,0,3]

[0485] [0,0,0,0,2,0,1,0]

[0486] [0,0,0,0,2,0,1,3]

[0487] [0,0,0,0,2,0,2,1]

[0488] [0,0,0,0,2,0,2,3]

[0489] [0,0,0,0,2,0,3,0]

[0490] [0,0,0,0,2,0,3,1]

[0491] [0,0,0,0,2,0,3,3]

[0492] [0,0,0,0,2,1,0,0]

[0493] [0,0,0,0,2,1,1,1]

[0494] [0,0,0,0,2,1,2,0]

[0495] [0,0,0,0,2,1,2,1]

[0496] [0,0,0,0,2,1,3,1]

[0497] [0,0,0,0,2,1,3,3]

[0498] [0,0,0,0,2,2,0,1]

[0499] [0,0,0,0,2,2,0,3]

[0500] [0,0,0,0,2,2,1,0]

[0501] [0,0,0,0,2,2,1,1]

[0502] [0,0,0,0,2,2,1,3]

[0503] [0,0,0,0,2,2,2,1]

[0504] [0,0,0,0,2,2,2,3]

[0505] [0,0,0,0,2,2,3,0]

[0506] [0,0,0,0,2,2,3,1]

[0507] [0,0,0,0,2,2,3,3]

[0508] [0,0,0,0,2,3,0,0]

[0509] [0,0,0,0,2,3,1,1]

[0510] [0,0,0,0,2,3,1,3]

[0511] [0,0,0,0,2,3,2,0]

[0512] [0,0,0,0,2,3,2,3]

[0513] [0,0,0,0,2,3,3,3]

[0514] [0,0,0,0,3,0,0,2]

[0515] [0,0,0,0,3,0,0,3]

[0516] [0,0,0,0,3,0,1,0]

[0517] [0,0,0,0,3,0,2,2]

[0518] [0,0,0,0,3,0,2,3]

[0519] [0,0,0,0,3,0,3,0]

[0520] [0,0,0,0,3,0,3,2]

[0521] [0,0,0,0,3,1,0,0]

[0522] [0,0,0,0,3,1,0,2]

[0523] [0,0,0,0,3,1,1,2]

[0524] [0,0,0,0,3,1,1,3]

[0525] [0,0,0,0,3,1,2,3]

[0526] [0,0,0,0,3,1,3,0]

[0527] [0,0,0,0,3,2,0,0]

[0528] [0,0,0,0,3,2,0,3]

[0529] [0,0,0,0,3,2,1,0]

[0530] [0,0,0,0,3,2,1,3]

[0531] [0,0,0,0,3,2,2,0]

[0532] [0,0,0,0,3,2,2,2]

[0533] [0,0,0,0,3,2,2,3]

[0534] [0,0,0,0,3,2,3,2]

[0535] [0,0,0,0,3,3,0,0]

[0536] [0,0,0,0,3,3,0,2]

[0537] [0,0,0,0,3,3,0,3]

[0538] [0,0,0,0,3,3,1,0]

[0539] [0,0,0,0,3,3,1,3]

[0540] [0,0,0,0,3,3,2,0]

[0541] [0,0,0,0,3,3,2,3]

[0542] [0,0,0,0,3,3,3,0]

[0543] [0,0,0,0,3,3,3,2]

[0544] [0,0,0,0,3,3,3,3]

[0545] [0,0,0,1,0,0,0,2]

[0546] [0,0,0,1,0,0,0,3]

[0547] [0,0,0,1,0,0,1,1]

[0548] [0,0,0,1,0,0,1,3]

[0549] [0,0,0,1,0,0,2,1]

[0550] [0,0,0,1,0,0,3,1]

[0551] [0,0,0,1,0,1,0,1]

[0552] [0,0,0,1,0,1,0,2]

[0553] [0,0,0,1,0,1,1,1]

[0554] [0,0,0,1,0,1,1,2]

[0555] [0,0,0,1,0,1,1,3]

[0556] [0,0,0,1,0,1,2,2]

[0557] [0,0,0,1,0,1,3,1]

[0558] [0,0,0,1,0,1,3,2]

[0559] [0,0,0,1,0,1,3,3]

[0560] [0,0,0,1,0,2,1,2]

[0561] [0,0,0,1,0,2,1,3]

[0562] [0,0,0,1,0,2,2,2]

[0563] [0,0,0,1,0,2,2,3]

[0564] [0,0,0,1,0,2,3,2]

[0565] [0,0,0,1,0,3,1,3]

[0566] [0,0,0,1,0,3,2,1]

[0567] [0,0,0,1,0,3,2,2]

[0568] [0,0,0,1,0,3,2,3]

[0569] [0,0,0,1,0,3,3,1]

[0570] [0,0,0,1,0,3,3,3]

[0571] [0,0,0,1,1,0,2,1]

[0572] [0,0,0,1,1,0,2,2]

[0573] [0,0,0,1,1,0,3,1]

[0574] [0,0,0,1,1,1,1,0]

[0575] [0,0,0,1,1,1,1,2]

[0576] [0,0,0,1,1,1,2,0]

[0577] [0,0,0,1,1,1,3,0]

[0578] [0,0,0,1,1,2,0,1]

[0579] [0,0,0,1,1,2,1,2]

[0580] [0,0,0,1,1,2,2,1]

[0581] [0,0,0,1,1,2,3,2]

[0582] [0,0,0,1,1,3,0,0]

[0583] [0,0,0,1,1,3,1,0]

[0584] [0,0,0,1,1,3,1,1]

[0585] [0,0,0,1,1,3,2,0]

[0586] [0,0,0,1,1,3,2,1]

[0587] [0,0,0,1,1,3,3,0]

[0588] [0,0,0,1,1,3,3,2]

[0589] [0,0,0,1,2,0,0,1]

[0590] [0,0,0,1,2,0,0,3]

[0591] [0,0,0,1,2,0,1,0]

[0592] [0,0,0,1,2,0,1,3]

[0593] [0,0,0,1,2,0,2,3]

[0594] [0,0,0,1,2,0,3,0]

[0595] [0,0,0,1,2,0,3,1]

[0596] [0,0,0,1,2,1,0,1]

[0597] [0,0,0,1,2,1,0,3]

[0598] [0,0,0,1,2,1,1,0]

[0599] [0,0,0,1,2,1,1,1]

[0600] [0,0,0,1,2,1,1,3]

[0601] [0,0,0,1,2,1,3,0]

[0602] [0,0,0,1,2,2,2,0]

[0603] [0,0,0,1,2,2,3,1]

[0604] [0,0,0,1,2,3,1,0]

[0605] [0,0,0,1,2,3,3,1]

[0606] [0,0,0,1,2,3,3,3]

[0607] [0,0,0,1,3,0,3,3]

[0608] [0,0,0,1,3,1,0,0]

[0609] [0,0,0,1,3,1,1,3]

[0610] [0,0,0,1,3,1,2,3]

[0611] [0,0,0,1,3,1,3,2]

[0612] [0,0,0,1,3,1,3,3]

[0613] [0,0,0,1,3,2,0,3]

[0614] [0,0,0,1,3,2,1,0]

[0615] [0,0,0,1,3,3,0,3]

[0616] [0,0,0,2,0,0,2,1]

[0617] [0,0,0,2,0,0,2,3]

[0618] [0,0,0,2,0,0,3,1]

[0619] [0,0,0,2,0,0,3,2]

[0620] [0,0,0,2,0,1,0,2]

[0621] [0,0,0,2,0,1,1,1]

[0622] [0,0,0,2,0,1,2,1]

[0623] [0,0,0,2,0,2,3,1]

[0624] [0,0,0,2,0,2,3,2]

[0625] [0,0,0,2,0,2,3,3]

[0626] [0,0,0,2,0,3,0,2]

[0627] [0,0,0,2,0,3,1,1]

[0628] [0,0,0,2,0,3,2,3]

[0629] [0,0,0,2,1,0,0,0]

[0630] [0,0,0,2,1,0,0,2]

[0631] [0,0,0,2,1,0,1,0]

[0632] [0,0,0,2,1,0,3,0]

[0633] [0,0,0,2,1,1,0,1]

[0634] [0,0,0,2,1,1,0,2]

[0635] [0,0,0,2,1,2,0,0]

[0636] [0,0,0,2,1,2,1,0]

[0637] [0,0,0,2,1,3,0,1]

[0638] [0,0,0,2,1,3,3,2]

[0639] [0,0,0,2,2,0,0,3]

[0640] [0,0,0,2,2,0,3,3]

[0641] [0,0,0,2,2,1,1,0]

[0642] [0,0,0,2,2,1,2,3]

[0643] [0,0,0,2,2,1,3,0]

[0644] [0,0,0,2,2,2,1,1]

[0645] [0,0,0,2,2,3,2,0]

[0646] [0,0,0,2,3,0,2,3]

[0647] [0,0,0,2,3,1,0,0]

[0648] [0,0,0,2,3,1,0,2]

[0649] [0,0,0,2,3,1,3,0]

[0650] [0,0,0,2,3,2,1,0]

[0651] [0,0,0,2,3,3,1,3]

[0652] [0,0,0,3,0,0,1,3]

[0653] [0,0,0,3,0,2,1,2]

[0654] [0,0,0,3,0,3,1,2]

[0655] [0,0,0,3,1,2,0,2]

[0656] [0,0,0,3,1,2,1,1]

[0657] [0,0,0,3,1,2,1,2]

[0658] [0,0,0,3,3,1,1,3]

[0659] [0, 0, 1, 0, 1, 3, 3, 2]

[0660] [0, 0, 1, 0, 3, 0, 0, 3]

[0661] [0, 0, 1, 0, 3, 0, 3, 0]

[0662] [0, 0, 1, 1, 3, 3, 1, 1]

[0663] It is easy to understand that the sequences obtained after a plurality of cyclic shifts based on the above initial values are all different. Or, the sequence obtained after a cyclic shift of any initial value is different from the sequence generated by other initial values.

[0664] In some embodiments, if the first sequence is a Z4 sequence, the first sequence is modulated by using a natural mapping. Modulating the first sequence by using the natural mapping can reduce the cross-correlation value between the first sequences, improve the cross-correlation performance of the first sequences, and reduce the interference between cells.

[0665] In some embodiments, the mapping rule of the natural mapping satisfies or In this way, by using the above mapping rule, the cross-correlation value between the first sequences can be reduced, the cross-correlation performance of the first sequences can be improved, and the interference between cells can be reduced.

[0666] Please refer to Table 2, which is a schematic diagram of a mapping table of a natural mapping.

[0667] Table 2

[0668] Table 2 represents a mapping rule by mapping. When modulating the first sequence, the mapping rule shown in Table 2 can be used.

[0669] Please refer to FIG. 5, which is a comparison diagram of the cross-correlation of demodulation reference signals according to an embodiment of the present application. In FIG. 5, the horizontal axis is correlation, and the vertical axis is cumulative distribution function (CDF). FIG. 5 is used to describe a comparison diagram of demodulation reference signals of two mapping modes. The first sequence corresponding to the demodulation reference signal is a Z4 sequence, and the primitive polynomial of the Z4 sequence is f(x) = x 13 + 2x 8 + 2x 7 + x 4 + x 3+x+1; Figure 5 is a diagram of a curve of modulating the first sequence by using natural mapping and Gray mapping respectively, and it can be seen from Figure 5 that, compared with Gray mapping, the demodulation reference signal modulated by using natural mapping has better cross-correlation performance.

[0670] Optionally, the network-side device can send the demodulation reference signal by using a cyclic prefix orthogonal frequency division multiplexing (CP-OFDM) waveform.

[0671] It should be understood that the above merely serves to help those skilled in the art better understand the embodiments of the present application, and is not intended to limit the scope of the embodiments of the present application. Those skilled in the art can obviously make various equivalent modifications or changes to the above examples, for example, some steps in each of the above methods can not be necessary, or some steps can be newly added, etc. Or a combination of any two or more of the above embodiments. Such modifications, changes or combinations also fall within the scope of the embodiments of the present application.

[0672] It should also be understood that the ways, cases, categories and divisions of embodiments in the embodiments of the present application are only for the convenience of description, and should not be considered as specific limitations. The features in various ways, categories, cases and embodiments can be combined without contradiction.

[0673] It should also be understood that the various numerical numbers involved in the embodiments of the present application are only for the convenience of division, and are not intended to limit the scope of the embodiments of the present application. The size of the serial numbers of the above processes does not mean the order of execution, and the execution order of the processes should be determined according to their functions and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0674] It should also be understood that the above description of the embodiments of the present application focuses on the differences between the various embodiments, and the same or similar parts not mentioned can be referred to each other. For the sake of brevity, they will not be repeated here.

[0675] The above describes an embodiment of the method provided by the embodiments of the present application in combination with Figure 3, and the following describes an electronic device provided by the embodiments of the present application.

[0676] The embodiments can divide the electronic device into functional modules according to the above method. For example, each function can be divided into a functional module, or two or more functions can be integrated into a processing module. The integrated module can be realized in the form of hardware. It should be noted that the division of the modules in the embodiments is illustrative, and is only a logical functional division. Actual implementation can have another division manner.

[0677] It should be noted that the related content of each step involved in the above method embodiments can be cited to the function description of the corresponding function module, and will not be repeated here.

[0678] The communication system provided by the embodiments of the present application is used to execute the communication method provided by the above method embodiments, and thus can achieve the same effects as the above implementation methods.

[0679] In other embodiments, in the case of using integrated units, the electronic device of the communication system can include a processing module, a storage module and a communication module. Among them, the processing module can be used to control and manage the actions of the electronic device. For example, it can be used to support the electronic device to execute the steps executed by the processing unit. The storage module can be used to support the storage of program codes and data, etc. The communication module can be used to support the communication between the electronic device and other network side devices, user devices.

[0680] Among them, the processing module can be a processor or a controller. It can be various exemplary logic blocks, modules and circuits described in combination with the disclosure of the present application. The processor can also be a combination of computing functions, such as one or more microprocessor combinations, digital signal processing (digital signal processing, DSP) and microprocessor combinations, etc. The storage module can be a memory. The communication module can be a device for interacting with other electronic devices, such as radio frequency circuit, Bluetooth chip, Wi-Fi chip, etc.

[0681] Based on the same concept, the embodiments of the present application also provide an electronic device, see Figure 6, which shows a structural schematic diagram of an exemplary electronic device of the present application. The electronic device shown in Figure 6 can execute the steps in the communication method executed by any one of the user devices or network side devices provided by the embodiments of the present application.

[0682] The electronic device 600 includes at least one processor 601, a memory 603, and at least one network interface 604.

[0683] The processor 601 is, for example, a general-purpose CPU, a digital signal processor (DSP), a network processor (NP), a GPU, a neural network processing unit (NPU), a data processing unit (DPU), a microprocessor, or one or more integrated circuits or application specific integrated circuits (ASICs) for implementing the schemes of the present application, a programmable logic device (PLD) or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. The PLD is, for example, a complex programmable logic device (CPLD), a field programmable gate array (FPGA), a generic array logic (GAL), or any combination thereof. It can implement or execute various logical blocks, modules, and circuits described in connection with the disclosure of the present application. The processor can also be a combination of computing functions, such as one or more microprocessor combinations, combinations of DSP and microprocessor, and the like.

[0684] Optionally, the electronic device 600 further includes a bus 602. The bus 602 is used to transmit information between the components of the electronic device 600. The bus 602 can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. The bus 602 can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one thick line is shown in FIG. 6, but it does not mean that there is only one bus or only one type of bus.

[0685] The memory 603 is, for example, a read only memory (ROM) or other type of storage device that can store static information and instructions, a random access memory (RAM), or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read only memory (EEPROM), a compact disc read only memory (CD ROM) or other optical disk storage, a magnetic disk storage or other magnetic storage devices, or any other medium capable of storing desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto. The memory 603 is, for example, independent and connected to the processor 601 through the bus 602. The memory 603 can also be integrated with the processor 601.

[0686] The network interface 604 uses any transceiver-like mechanism for communicating with other devices or a communications network, which can be an Ethernet, a radio access network (RAN), a wireless local area network (WLAN), etc. The network interface 604 can include a wired network interface and can also include a wireless network interface. Specifically, the network interface 604 can be an Ethernet interface, such as a fast Ethernet (FE) interface, a gigabit Ethernet (GE) interface, an asynchronous transfer mode (ATM) interface, a WLAN interface, a cellular network interface, or a combination thereof. The Ethernet interface can be an optical interface, an electrical interface, or a combination thereof. In some embodiments of the present application, the network interface 604 can be used for the electronic device 600 to communicate with other devices.

[0687] In a specific implementation, as some embodiments, the processor 601 can include one or more CPUs. Each of these processors can be a single core processor or a multiple core processor. The processor herein can refer to one or more devices, circuits, and / or processing cores for processing data (e.g., computer program instructions).

[0688] In a specific implementation, as some embodiments, the electronic device 600 can include multiple processors. Each of the processors can be a single-core processor or a multi-core processor. The processor herein can refer to one or more devices, circuits, and / or processing cores for processing data (such as computer program instructions).

[0689] In some embodiments, the memory 603 is configured to store program instructions for implementing the solutions of the present application, and the processor 601 can execute the program instructions stored in the memory 603. That is, the electronic device 600 can implement the method provided by the method embodiments shown in the above embodiments by the processor 601 and the program instructions in the memory 603. The program instructions can include one or more software modules. Alternatively, the processor 601 itself can also store program instructions for implementing the solutions of the present application.

[0690] In the implementation process, the processor 601 in the electronic device 600 of the present application reads the instructions in the memory 603, so that the electronic device 600 shown in FIG. 6 can execute all or part of the steps of the communication method executed by the user equipment or the network side equipment in the above embodiments.

[0691] Wherein, the steps of the method described in the above embodiments are completed by the integrated logic circuit of the hardware in the processor of the electronic device 600 or the instructions in the form of software. The steps of the method embodiments disclosed in the present application can be directly embodied as the execution completed by the hardware processor, or executed by the combination of the hardware and software modules in the processor. The software module can be located in the random access memory, the flash memory, the read-only memory, the programmable read-only memory, the electrically erasable programmable memory, the register, or other mature storage mediums in the art. The storage medium is located in the memory, and the processor reads the information in the memory, and combines the hardware to complete the steps of the above method embodiments. To avoid repetition, they will not be described in detail here.

[0692] It is to be understood that the above-described processor can be a central processing unit (CPU), but can also be other general purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs) or other programmable logic devices, discrete gates or transistor logic components, discrete hardware components, etc. The general purpose processor can be a microprocessor or any conventional processor, etc. It is to be noted that the processor can be an advanced RISC machine (ARM) architecture processor.

[0693] Further, in an optional embodiment, the above-described memory can include a read-only memory and a random access memory, and provide instructions and data to the processor. The memory can also include a non-volatile random access memory. For example, the memory can also store device type information.

[0694] The memory can be a volatile memory or a non-volatile memory, or can include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read only memory (ROM), a programmable ROM (PROM), an erasable PROM (EPROM), an electrically EPROM (EEPROM) or a flash memory. The volatile memory can be a random access memory (RAM) used as an external cache. By way of example but not limitation, many forms of RAM are available. For example, static random access memory (SRAM), dynamic random access memory (DRAM), synchronous DRAM (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced SDRAM (ESDRAM), synchlink DRAM (SLDRAM) and direct rambus RAM (DR RAM).

[0695] The user equipment and the network side device provided by the embodiments can execute the method embodiments described above, and the implementation principles and technical effects are similar, which will not be repeated here.

[0696] The embodiments of the present application further provide a computer readable storage medium, which stores a computer program. The computer program is executed by a processor to implement the method described in the above method embodiments.

[0697] The embodiments of the present application further provide a computer program product, which, when running on a user equipment, enables the user equipment to implement the method described in the above method embodiments.

[0698] The embodiments of the present application further provide a computer program product, which, when running on a network side device, enables the network side device to implement the method described in the above method embodiments.

[0699] The embodiments of the present application provide a chip, which includes a processor, and is used to call and run instructions stored in a memory, so that a communication device installed with the chip executes the method described in the above method embodiments executed by any one of the user equipment provided by the embodiments of the present application.

[0700] The embodiments of the present application provide a chip, which includes a processor, and is used to call and run instructions stored in a memory, so that a communication device installed with the chip executes the method described in the above method embodiments executed by any one of the network side devices provided by the embodiments of the present application.

[0701] The embodiments of the present application further provide a chip system, which includes a processor coupled with a memory. The processor executes a computer program stored in the memory to implement the method described in the above method embodiments. The chip system can be a single chip or a chip module composed of multiple chips.

[0702] In the above embodiments, all or part of the methods can be implemented by software, hardware, firmware, or any combination thereof. When implemented by software, all or part of the methods can be implemented in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of the present application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium or transmitted by the computer-readable storage medium. The computer instructions can be transmitted from one website, computer, server or data center to another website, computer, server or data center by wire (such as coaxial cable, optical fiber, digital subscriber line) or wireless (such as infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that includes one or more available media sets. The available media can be magnetic media (such as floppy disk, hard disk or magnetic tape), optical media (such as DVD), or semiconductor media (such as solid state disk (SSD)), etc.

[0703] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by a computer program to instruct the relevant hardware, which can be stored in a computer-readable storage medium. When the program is executed, it can include the processes of the above-mentioned embodiments. The storage medium can include ROM or random access memory (RAM), magnetic disk or optical disk, and various media that can store program codes.

[0704] The naming or numbering of the steps in the present application does not mean that the steps in the method process must be executed in the time / logical order indicated by the naming or numbering. The execution order of the named or numbered process steps can be changed according to the technical purpose to be achieved, as long as the same or similar technical effects can be achieved.

[0705] In the above embodiments, the description of each embodiment has its own focus. The parts not described or recorded in detail in a certain embodiment can be referred to the relevant description of other embodiments.

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

[0707] It should be understood that in the description of this application and the appended claims, the terms "comprising," "including," "having," and any variations thereof are intended to cover a non-exclusive inclusion and mean "including but not limited to," unless otherwise specifically emphasized. For example, a process, method, system, product, or apparatus that includes a series of steps or modules is not necessarily limited to those steps or modules that are explicitly listed, but may include other steps or modules that are not explicitly listed or that are inherent to such process, method, product, or apparatus.

[0708] In the description of this application, unless otherwise stated, " / " indicates that the objects before and after are in an "or" relationship. For example, A / B can mean A or B. "And / or" in this application is used to describe the relationship between the related objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. A and B can be singular or plural.

[0709] Furthermore, in the description of this application, unless otherwise stated, "multiple" means two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, where a, b, and c can be single or multiple.

[0710] As used in this application specification and the appended claims, the term "if" may be interpreted, depending on the context, as "when," "once," "in response to determination," or "in response to detection." Similarly, the phrase "if determined" or "if detected [the described condition or event]" may be interpreted, depending on the context, as meaning "once determined," "in response to determination," "once detected [the described condition or event]," or "in response to detection [the described condition or event]."

[0711] In addition, in the description of the present application and the appended claims, the terms "first", "second", and the like are used merely to distinguish similar objects from each other, and do not necessarily indicate a particular order or sequence, nor do they necessarily indicate relative importance of, or a preference for, the identified technical features. It is to be understood that data used in this way can be interchanged, where appropriate, so that the embodiments described herein can be carried out in other than the order shown or described herein; features defined with "first", "second" can explicitly or implicitly include at least one of the features.

[0712] In the present application, the words "exemplary" and "for example" are used to mean serving as an example, instance, or illustration. Any implementation described herein as "exemplary" or as an "example" is not necessarily to be construed as preferred or advantageous over other implementations. Rather, the use of terms such as "exemplary" or "example" is intended to present concepts in a concrete manner.

[0713] In the present application, the words "exemplary" and "for example" are used to mean serving as an example, instance, or illustration. Any implementation described herein as "exemplary" or as an "example" is not necessarily to be construed as preferred or advantageous over other implementations. Rather, the use of terms such as "exemplary" or "example" is intended to present concepts in a concrete manner.

[0714] Finally, it should be noted that the above-described embodiments are merely intended for describing the technical solutions of the present application, but not to limit the present application; although the present application has been described in detail with reference to the above embodiments, those skilled in the art should understand that: they can still modify the technical solutions recorded in the above embodiments, or make equivalent replacements to some or all of the technical features; and these modifications or replacements do not make the corresponding technical solutions deviate from the scope of the technical solutions of the embodiments of the present application.

Claims

1. A communication method characterized by comprising: Applied to a network side device, the method comprises: transmitting a demodulation reference signal to a user equipment, the demodulation reference signal being generated based on a first sequence, the first sequence being a periodic sequence, a period of the first sequence being 2 p -1, p being an integer greater than 1 and less than 31; the demodulation reference signal being used for downlink data demodulation.

2. The method of claim 1, wherein, The first sequence is a Z4 sequence, a Z6 sequence or a Z8 sequence, the period of the first sequence is 2 7 -1 or 2 8 -1.

3. The method of claim 1, wherein, The period of the first sequence is 2 13 -1, the initialization c of the first sequence init satisfies the following equation: or wherein for beam identification, For a cell identity, the c init for determining the first sequence.

4. The method of claim 1, wherein, if the period of the first sequence is 2 16 -1, the initialization c init of the first sequence satisfies the following equation: wherein for the beam identification, For a cell identity, the c init for determining the first sequence.

5. The method of claim 1, wherein, if the period of the first sequence is 2 22 -1, the initialization c init of the first sequence satisfies the following equation: wherein for beam identification, For a cell identity, the initialization c init for determining the first sequence.

6. The method according to any one of claims 3 to 5, characterized in that, The first sequence is a gold sequence, and an nth element c(n) of the first sequence satisfies: c(n) = (xl(n+N c )+x2(n+N c )) mod 2; where n is an integer from 0 to M pn -1, M pn is the length of the first sequence, x1(n+N c ) is the n+N c th element of the second sequence, x2(n+N c ) is the n+N c th element of the third sequence, and N c is an integer; the second and third sequences have the same period as the first sequence. where x1(0) = 1, x1(n) = 0, n = 1, 2,..., p - 1, 7. The method according to any one of claims 3 to 5, characterized in that, If the first sequence is any one of Z4 sequence, Z6 sequence, Z8 sequence, the c init For determining the value of the initial value and / or the cyclic shift of the first sequence.

8. A communication method characterized by comprising: Applied to a user equipment UE, the method comprises: receive a demodulation reference signal, the demodulation reference signal being generated based on a first sequence, the first sequence being a periodic sequence, a period of the first sequence being 2 p -1, p being an integer greater than 1 and less than 31; the demodulation reference signal being used for downlink data demodulation.

9. The method of claim 8, wherein, The first sequence is a Z4 sequence, a Z6 sequence or a Z8 sequence, the period of the first sequence is 2 7 -1 or 2 8 -1.

10. A network-side device, comprising: Comprising: a memory comprising computer readable instructions; a processor in communication with the memory, the processor to execute the computer readable instructions causing the network side device to perform the communication method of any of claims 1-7.

11. A terminal, characterized by comprising: Comprising: a memory comprising computer readable instructions; a processor in communication with the memory, the processor to execute the computer readable instructions causing the terminal to perform the communication method of claim 8 or 9.

12. A computer-readable storage medium, characterized in that, A program or instructions, when executed by a processor, implement the communication method of any of claims 1-7 or the communication method of claim 8 or 9.

Images