WO2022042618A1 - Method for transmitting signals and communication apparatus - Google Patents

Abstract

Provided in the present application are a method for transmitting signals and apparatus. In the technical solution of the present application, a communication apparatus can determine, according to the length of a first sequence, a group identifier, and a preset mapping, a first parameter for determining the first sequence. As such, the first parameter is a value related to both the length of the first sequence and the group identifier and not just to the length of the first sequence, so that a more suitable first parameter can be determined. As such, the first sequence determined by means of the solution of the present application is more suitable, so that a first signal has a lower PAPR while ensuring a lower cross-correlation between the first signal and other uplink reference signals.

Description

Method and communication device for transmitting signals

This application claims the priority of the Chinese patent application with the application number of 202010899817.2 and the application title of "Method and Communication Device for Transmitting Signals" filed with the China Patent Office on August 31, 2020, the entire contents of which are incorporated into this application by reference .

technical field

The present application relates to the field of communications, and more particularly, to methods and communication apparatuses for transmitting signals.

Background technique

The terminal device needs to send an uplink reference signal (for example, a sounding reference signal (SRS) or a demodulation reference signal (DMRS)) to the network device, so that the network device can obtain the terminal by using the uplink reference signal sent by the terminal device. Device-to-network device uplink channel information. In a time division duplex (TDD) system, the uplink channel and the downlink channel are reciprocal, so the downlink channel information can also be obtained through the uplink reference signal, and the downlink channel state information is used for precoding during downlink data transmission , Modulation and coding mode is determined, etc. In this way, the quality of the channel estimation based on the uplink reference signal will affect the downlink throughput.

However, the peak-to-average power ratio (PAPR) of the uplink reference signal sequence obtained by the existing method is relatively high. Taking an uplink reference signal sequence with a length of 408 as an example, its PAPR is up to 5.8dB.

Generally, in order to ensure that the signal is not distorted, the higher the PAPR of the signal, the lower the maximum transmit power available to the communication device. If the PAPR is too high, the transmission power of the uplink reference signal of the edge users will be low in the coverage scenario, resulting in a low received signal-to-noise ratio (SNR) of the uplink reference signal, which seriously affects the quality of channel estimation.

SUMMARY OF THE INVENTION

The present application provides a method and a communication device for transmitting a signal, which are beneficial to reduce the PAPR of an uplink reference signal, thereby improving the quality of channel estimation.

In a first aspect, the present application provides a method for transmitting a signal, the method comprising: acquiring a first length of a first sequence and a first group of identifiers; according to the first length, the first group of identifiers and a preset The mapping relationship of , the first parameter is determined; based on the first parameter, the first sequence is determined, wherein the first sequence satisfies

r(n) is the first sequence,

is the first base sequence, each item in the first base sequence belongs to the numerical set determined by e ^-j2πk/N , N is the first parameter, α is the cyclic shift value and α is a real number, A is complex constant, j is an imaginary unit, n=0, 1, ..., M-1, M is the first length, k=0, 1, ..., N-1; map the first sequence to M subsections On the carrier, the first signal is generated and transmitted.

Optionally, the first sequence may be an uplink reference signal sequence.

For example, the first sequence may be an SRS sequence or a DMRS sequence.

Optionally, the group identifier may be a group number or a group ID or the like.

Compared with the fixed maximum prime number less than or equal to the first length or the smallest prime number greater than or equal to the first length, in the technical solutions of the embodiments of the present application, the communication device Set the mapping relationship to determine the first parameter used to determine the first sequence. In this way, the first parameter is a value related to both the length of the first sequence and the group identifier, not just the length of the first sequence. In this way, the first sequence generated by the solution in this embodiment of the present application is more suitable, and the first signal can have a lower PAPR on the premise of ensuring that the cross-correlation between the first signal and other uplink reference signals is low.

With reference to the first aspect, in a possible implementation manner, u is a group identifier, and the value of N is associated with the value of u.

With reference to the first aspect or any of the above possible implementation manners, in another possible implementation manner, the mapping the first sequence to M subcarriers includes: mapping the M subcarriers in the first sequence The items are respectively mapped to the consecutive M subcarriers; or, the M items in the first sequence are respectively mapped to the M subcarriers at equal intervals.

With reference to the first aspect or any of the above possible implementation manners, in another possible implementation manner, the first parameter is greater than or equal to a first prime number, and the first prime number is less than or equal to the first length or the first prime number is the smallest prime number greater than or equal to the first length.

Optionally, the first parameter belongs to one of an existing set of possible values. In this way, from the perspective of implementation, the complexity of the implementation is not increased.

For example, the existing set of possible values of M is M={36, 42, 48, 54, 60, 66, 72, 78, . Or taking the largest prime number equal to M as an example, the set of possible values of N obtained is N={31, 41, 47, 53, 59, 61, 71, 73, . . . , 1627}. It is assumed that when M=36 and u=0, N=73, and N=73 is the value of M=78 in the prior art, and the prior art can be reused, so the complexity of implementation can be not increased.

Compared with the fixed maximum prime number less than or equal to the first length or the smallest prime number greater than or equal to the first length, the present application jointly determines the value of the first parameter according to the group identifier and the first length, thereby helping to reduce the determination of PAPR of the first signal.

In conjunction with the first aspect or any of the above possible implementations, in another possible implementation, the first base sequence is a sequence determined based on a Zadoff-Chu (ZC) sequence or a Wiener sequence,

The Zadoff-Chu sequence satisfies:

Wherein, x _q (m) is the Zadoff-Chu sequence; N is the length of the Zadoff-Chu sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m =0,1,...,N-1;

The Wiener sequence satisfies:

Wherein, x _q (m) is the Wiener sequence, N is the length of the Wiener sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m=0, 1 ,...,N-1;

The first base sequence satisfies:

Wherein, q is determined according to the first group identifier and the first parameter.

In combination with the first aspect or any of the above possible implementations, in another possible implementation, the first base sequence satisfies:

x _q (m)=e ^{-jπqm(m+1)/N} , m=0,1,...,N-1

Alternatively, the first base sequence satisfies:

Wherein, u is the first set of identifiers, u is an integer greater than or equal to 0 and less than X-1, X is a prime number, v is equal to 0 or 1, x _q (m), q and

To determine the intermediate value in the first base sequence process, q is an integer greater than 0 and less than N.

Optionally, when X=31, u=0, 1, 2, . . . , 29.

Optionally, when X=61, u=0, 1, 2, . . . , 59.

With reference to the first aspect or any of the foregoing possible implementations, in another possible implementation, the first signal is an uplink reference signal.

In combination with the first aspect or any of the above possible implementations, in another possible implementation, in the preset mapping relationship, for the same value of the first length, there are at least two different The value of the first parameter corresponding to the value of the first group of flags is different.

With reference to the first aspect or any of the above possible implementation manners, in another possible implementation manner, the preset mapping relationship includes multiple (u, M as shown in Table 1 in the detailed description section) , N) some or all of the triples in the triples, and the preset mapping relationship includes at least one (u, M, N) triples in the (u, M, N) triples N is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M.

With reference to the first aspect or any of the above possible implementation manners, in another possible implementation manner, the preset mapping relationship includes multiple (u, M as shown in Table 2 in the detailed description section) , N) some or all of the triples in the triples, and the preset mapping relationship includes at least one (u, M, N) triples in the (u, M, N) triples N is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M.

With reference to the first aspect or any of the above possible implementation manners, in another possible implementation manner, the preset mapping relationship includes multiple (u, M as shown in Table 3 in the detailed description section) , N) some or all of the triples in the triples, and the preset mapping relationship includes at least one (u, M, N) triples in the (u, M, N) triples N is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M.

With reference to the first aspect or any of the above possible implementation manners, in another possible implementation manner, the preset mapping relationship includes multiple (u, M as shown in Table 4 in the detailed description section) , N) some or all of the triples in the triples, and the preset mapping relationship includes at least one (u, M, N) triples in the (u, M, N) triples N is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M.

It can be seen from Table 1-Table 4 that, corresponding to the same value of M, when the value of u is different, the value of N can be different. For example, the value of the first length is 36, the value of the first group of identifiers is 0, and the value of the first parameter can be obtained from Table 1 as 73; the value of the first length is 36, and the value of the first group of identifiers is The value is 1, and it can be obtained from Table 1 that the value of the first parameter is 131.

In a second aspect, the present application provides a method for transmitting a signal, the method comprising: acquiring a first signal carried on M subcarriers; determining a first sequence, where the first sequence satisfies

where r(n) is the first sequence,

is the first base sequence, each item in the first base sequence belongs to the numerical value set determined by e ^-j2πk/N , and the first parameter N is based on the first length of the first sequence, the first group identifier, And the preset mapping relationship is determined, α is a cyclic shift value and α is a real number, A is a complex constant, j is an imaginary unit, n=0, 1, ..., M-1, M is the first length, k=0, 1, ..., N-1; according to the first sequence, the first signal is processed.

Optionally, the first sequence may be an uplink reference signal sequence.

For example, the first sequence may be an SRS sequence or a DMRS sequence.

Optionally, the group identifier may be a group number or a group ID or the like.

Compared with the fixed maximum prime number less than or equal to the first length or the smallest prime number greater than or equal to the first length, in the technical solution of the embodiment of the present application, according to the length of the first sequence, the group identifier and the preset mapping relationship, determine the first parameter used to determine the first sequence, in this way, the first parameter is a value related to the length of the first sequence and the group identifier, not only related to the length of the first sequence, so that a A more suitable first parameter, so that the first sequence determined by the solution in this embodiment of the present application is more suitable, and can make the first The signal has a lower PAPR.

With reference to the second aspect, in a possible implementation manner, u is a group identifier, and the value of N is associated with the value of u.

With reference to the first aspect or any of the above possible implementation manners, in another possible implementation manner, the receiving the first signal carried on M subcarriers includes: acquiring the first signal on consecutive M subcarriers the first signal; or, acquiring the first signal on M subcarriers at equal intervals.

With reference to the second aspect or any of the above possible implementation manners, in another possible implementation manner, the first parameter is greater than or equal to a first prime number, and the first prime number is less than or equal to the first length or the first prime number is the smallest prime number greater than or equal to the first length.

Optionally, the first parameter belongs to one of an existing set of possible values. In this way, from the perspective of implementation, the complexity of the implementation is not increased.

For example, the existing set of possible values of M is M={36, 42, 48, 54, 60, 66, 72, 78, . Or taking the largest prime number equal to M as an example, the set of possible values of N obtained is N={31, 41, 47, 53, 59, 61, 71, 73, . . . , 1627}. It is assumed that when M=36 and u=0, N=73, and N=73 is the value of M=78 in the prior art, and the prior art can be reused, so the complexity of implementation can be not increased.

Compared with the fixed maximum prime number less than or equal to the first length or the smallest prime number greater than or equal to the first length, the present application jointly determines the value of the first parameter according to the first set of identifiers and the first length, thereby helping Decrease the PAPR of the determined first signal.

In combination with the second aspect or any of the above possible implementations, in another possible implementation, the first base sequence is a sequence determined based on a Zadoff-Chu sequence or a Wiener sequence,

The Zadoff-Chu sequence satisfies:

Wherein, x _q (m) is the Zadoff-Chu sequence; N is the length of the Zadoff-Chu sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m =0,1,...,N-1;

The Wiener sequence satisfies:

Wherein, x _q (m) is the Wiener sequence, N is the length of the Wiener sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m=0, 1 ,...,N-1;

The first base sequence satisfies:

Wherein, q is determined according to the first group identifier and the first parameter.

In combination with the second aspect or any of the above possible implementations, in another possible implementation, the first base sequence satisfies:

x _q (m)=e ^{-jπqm(m+1)/N} , m=0,1,...,N-1

Alternatively, the first base sequence satisfies:

Wherein, u is the first set of identifiers, u is an integer greater than or equal to 0 and less than X-1, X is a prime number, v is equal to 0 or 1, x _q (m), q and

To determine the intermediate value in the first base sequence process, q is an integer greater than 0 and less than N.

Optionally, when X=31, u=0, 1, 2, . . . , 29.

Optionally, when X=61, u=0, 1, 2, . . . , 59.

With reference to the second aspect or any of the above possible implementation manners, in another possible implementation manner, the first signal is an uplink reference signal.

In combination with the second aspect or any of the above possible implementation manners, in another possible implementation manner, in the preset mapping relationship, for the same value of the first length, there are at least two different The value of the first parameter corresponding to the value of the first group of flags is different.

With reference to the second aspect or any of the above possible implementations, in another possible implementation, the preset mapping relationship includes multiple ((u, M, N) part or all of the triples, and the preset mapping relationship includes at least one (u, M, N) triple in the (u, M, N) triples N of is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M.

With reference to the second aspect or any of the above possible implementation manners, in another possible implementation manner, the preset mapping relationship includes multiple (u, M as shown in Table 2 in the detailed description section) , N) some or all of the triples in the triples, and the preset mapping relationship includes at least one (u, M, N) triples in the (u, M, N) triples N is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M.

With reference to the second aspect or any of the above possible implementation manners, in another possible implementation manner, the preset mapping relationship includes multiple (u, M as shown in Table 3 in the detailed description section) , N) some or all of the triples in the triples, and the preset mapping relationship includes at least one (u, M, N) triples in the (u, M, N) triples N is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M.

With reference to the second aspect or any of the above possible implementation manners, in another possible implementation manner, the preset mapping relationship includes multiple (u, M as shown in Table 4 in the detailed description section) , N) some or all of the triples in the triples, and the preset mapping relationship includes at least one (u, M, N) triples in the (u, M, N) triples N is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M.

It can be seen from Table 1-Table 4 that, corresponding to the same value of M, when the value of u is different, the value of N can be different. For example, the value of the first length is 36, the value of the first group of identifiers is 0, and the value of the first parameter can be obtained from Table 1 as 73; the value of the first length is 36, and the value of the first group of identifiers is The value is 1, and it can be obtained from Table 1 that the value of the first parameter is 131.

In a third aspect, the present application provides a communication device, the communication device having the function of implementing the method in the first aspect or any possible implementation manner thereof, or having the function of implementing the method in the second aspect or any possible implementation manner thereof function of the method. The functions can be implemented by hardware, or can be implemented by hardware executing corresponding software. The hardware or software includes one or more units corresponding to the above functions.

In a fourth aspect, the present application provides a communication device including a processor, a memory and a transceiver. Wherein, the memory is used to store the computer program, and the processor is used to call and run the computer program stored in the memory, and control the transceiver to send and receive signals, so that the communication device executes the method in the first aspect or any possible implementation manner thereof, or A method as in the second aspect or any possible implementation thereof is performed.

In a fifth aspect, the present application provides a communication device, comprising a processor and a communication interface, the communication interface being used for receiving a signal and transmitting the received signal to the processor, the processor processing the signal such that The method is performed as in the first aspect or any possible implementation thereof, or as in the second aspect or any possible implementation thereof.

Optionally, the above-mentioned communication interface may be an interface circuit, and the processor may be a processing circuit.

In a sixth aspect, the present application provides a communication apparatus, the apparatus includes at least one processor and at least one memory, the at least one processor is coupled to the at least one memory, and the at least one processor is configured to execute the at least one memory A computer program or instructions stored in a memory to cause the communication apparatus to perform a method as in the first aspect or any possible implementation thereof, or to perform a method as in the second aspect or any possible implementation thereof.

Optionally, the at least one memory stores at least part of the triples in the mapping relationship table as in Table 1 to Table 4 in the detailed description section.

In a seventh aspect, the present application provides a chip, including a logic circuit and a communication interface, the logic circuit is used to obtain the first length and the first set of identifiers described in the first aspect or any possible implementation manner thereof, and For performing the determination process as described in the first aspect or any possible implementations thereof to obtain the first sequence described in the above-mentioned first aspect or any possible implementations thereof, the communication interface is configured to output the first sequence.

In an eighth aspect, the present application provides a chip including a logic circuit and a communication interface, where the communication interface is configured to receive the first signal in the second aspect or any possible implementation manner thereof, and the logic circuit is configured to execute The determination process as described in the second aspect or any possible implementations thereof.

Optionally, the communication interface may include an input interface and an output interface. The input interface is used for receiving the first signal.

In a ninth aspect, the present application provides a computer-readable storage medium, where computer instructions are stored in the computer-readable storage medium. The method is performed, or as in the second aspect or any possible implementation thereof.

In a tenth aspect, the present application provides a computer program product comprising computer program code that, when the computer program code is run on a computer, enables the method of the first aspect or any possible implementation thereof is performed, or the method as in the second aspect or any possible implementation thereof is performed.

In an eleventh aspect, the present application provides a wireless communication system, including the communication device according to any one of the above aspects and any possible implementations thereof.

Description of drawings

FIG. 1 is a schematic structural diagram of a communication system to which an embodiment of the present application can be applied.

FIG. 2 is a schematic flowchart of a method for transmitting a signal provided by an embodiment of the present application.

FIG. 3 is a schematic diagram of the relationship between the base sequence generated based on the ZC sequence and the ZC sequence in a sequence group of the present application.

FIG. 4 is a schematic flowchart of generating a first signal in an embodiment of the present application.

FIG. 5 is a schematic diagram of mapping the first sequence to M subcarriers in an embodiment of the present application.

FIG. 6 is another schematic diagram of mapping the first sequence to M subcarriers in an embodiment of the present application.

FIG. 7 is a schematic diagram of cumulative PAPR distributions of 30 groups 408 long uplink reference signal sequences.

Figure 8 is the cumulative distribution of the cross-correlation (CORR) of the 408 long uplink reference signal sequences in each of the 30 groups and the uplink reference signal sequences of 5 lengths (408, 864, 912, 1152, 1104, respectively) in other groups schematic diagram.

FIG. 9 is a schematic structural diagram of a communication device according to an embodiment of the present application.

FIG. 10 is a schematic structural diagram of a communication apparatus provided by another embodiment of the present application.

FIG. 11 is a schematic structural diagram of a communication apparatus provided by another embodiment of the present application.

FIG. 12 is a schematic structural diagram of a communication apparatus provided by another embodiment of the present application.

detailed description

The technical solutions in the present application will be described below with reference to the accompanying drawings.

The technical solutions of the embodiments of the present application can be applied to various communication systems, such as: long term evolution (long term evolution, LTE) system, LTE frequency division duplex (frequency division duplex, FDD) system, LTE TDD system, universal mobile communication system Universal mobile telecommunication system (UMTS), worldwide interoperability for microwave access (WiMAX) communication system, ^5th generation (5G) system or new radio (NR), satellite communication system , and future mobile communication systems.

FIG. 1 is a schematic structural diagram of a communication system to which an embodiment of the present application can be applied. As shown in FIG. 1 , the communication system 100 may include a network device 110 and at least one terminal device (such as the terminal device 120 in FIG. 1 ). The terminal device 120 is connected to the network device 110 in a wireless manner. Terminal equipment can be fixed or movable. FIG. 1 is just a schematic diagram, and the communication system may also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in FIG. 1 . The embodiments of the present application do not limit the number of network devices and terminal devices included in the communication system.

The terminal equipment in the embodiments of the present application may also be referred to as user equipment (user equipment, UE), user, access terminal, subscriber unit, subscriber station, mobile station, mobile station, remote station, remote terminal, mobile device, and user terminal , terminal, wireless communication equipment, user agent or user equipment, etc. The terminal device may be a cellular phone, a smart watch, a wireless data card, a cell phone, a tablet computer, a personal digital assistant (PDA) computer, a wireless modem, a handheld device, a laptop computer, a machine type communication, MTC) terminal, computer with wireless transceiver function, virtual reality terminal equipment, augmented reality terminal equipment, wireless terminal in industrial control, wireless terminal in unmanned driving, wireless terminal in remote surgery, wireless terminal in smart grid, Wireless terminals in transportation security, wireless terminals in smart cities, wireless terminals in smart homes, wireless terminals in satellite communications (eg, satellite phones or satellite terminals, etc.), and so on. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal device.

The network device in this embodiment of the present application may be a device for communicating with a terminal device, and the network device may be a global system of mobile communication (GSM) system or a code division multiple access (CDMA) The base station (base transceiver station, BTS) in the LTE system can also be the base station (nodeB, NB) in the wideband code division multiple access (WCDMA) system, or the evolutionary base station (evolutional base station) in the LTE system. nodeB, eNB or eNodeB), it can also be a wireless controller in a cloud radio access network (CRAN) scenario, or the network device can be a relay station, an access point, a vehicle-mounted device or a wearable device, or The network device may be a terminal that performs the function of a base station in D2D communication or machine communication, or the network device may be a network device in a 5G network or a network device in a future evolved PLMN network, etc., which are not limited in the embodiments of the present application. In addition, the network device in this embodiment of the present application may also be a module or unit that completes some functions of the base station, for example, may be a centralized unit (central unit, CU), or may be a distributed unit (distributed unit, DU). The embodiments of the present application do not limit the specific technology and specific device form adopted by the network device.

The terminal equipment and network equipment in the embodiments of the present application can be deployed on land, including indoor or outdoor, handheld or vehicle-mounted; can also be deployed on water; and can also be deployed on aircraft, balloons, and artificial satellites in the air. The embodiments of the present application do not limit the application scenarios of the network device and the terminal device.

The terminal device and the network device in the embodiments of the present application may communicate through licensed spectrum, may also communicate through unlicensed spectrum, or may communicate through licensed spectrum and unlicensed spectrum at the same time. The terminal device and the network device can communicate through the frequency spectrum below 6 GHz (gigahertz, GHz), and can also communicate through the frequency spectrum above 6 GHz, and can also use the frequency spectrum below 6 GHz and the frequency spectrum above 6 GHz to communicate simultaneously. The embodiments of the present application do not limit the spectrum resources used between the terminal device and the network device.

The terminal device needs to send an uplink reference signal (for example, SRS or DMRS) to the network device, so that the network device can obtain uplink channel information from the terminal device to the network device by using the uplink reference signal sent by the terminal device. In the TDD system, since the uplink channel and the downlink channel are reciprocal, the downlink channel information can also be obtained through the uplink reference signal, and the downlink channel state information is used for precoding, modulation and coding mode determination during downlink data transmission, etc. In this way, the quality of the channel estimation based on the uplink reference signal will affect the downlink throughput.

At present, the sequence of the uplink reference signal adopts the reference signal sequence generated by the cyclic shift of the base sequence. For example, the base sequence of length M is

Then the uplink reference signal sequence generated by the base sequence satisfies:

Among them, r(n) is an uplink reference signal sequence, A is a complex constant, α is a cyclic shift value, j is an imaginary unit, and n=0, 1, ..., M-1.

In the 3rd generation partnership project (3GPP) standard, each sequence group contains sequences of different lengths, and each sequence group is indicated by a group identifier. For the value of M greater than or equal to 36 and less than 72, 30 base sequences are defined for generating uplink reference signal sequences, the base sequence group identifiers u=0, 1, . . . , 29, and the root sequence number in each group v=0 ; For the value of M greater than or equal to 72, 60 base sequences are respectively defined for generating the uplink reference signal sequence, the base sequence group identification u=0, 1, . . . , 29, the root sequence number v=0 in each group, 1.

base sequence of length M

satisfy:

x _q (m)=e ^{-jπqm(m+1)/N} , m=0,1,...,N-1

where x _q (m), q and

is the intermediate value in the base sequence generation process, q is an integer greater than 0 and less than N, M is the length of the uplink reference signal sequence, u is the group identifier of the base sequence, v is equal to 0 or 1, j is an imaginary unit, and N is The largest prime number less than or equal to M, or N the smallest prime number greater than or equal to M.

However, the PAPR of the uplink reference signal sequence obtained in the above manner is relatively high. Taking a base sequence with a length of 408 as an example, the PAPR of the obtained uplink reference signal sequence is up to 5.8dB.

Generally, in order to ensure that the signal is not distorted, the higher the PAPR of the signal, the lower the maximum transmission power available to the communication device. Therefore, if the PAPR is too high, the transmission power of the uplink reference signal of the edge user in the coverage scenario will be low, which will make the uplink The received SNR of the reference signal is relatively low, which seriously affects the quality of channel estimation.

In view of the above problems, the present application provides a signal transmission method and a communication device, which are beneficial to reduce the PAPR of the uplink reference signal, thereby improving the quality of channel estimation.

FIG. 2 is a schematic flowchart of a method for transmitting a signal provided by an embodiment of the present application. The method shown in FIG. 2 can be executed by the terminal device and the network device, and can also be executed by a module or unit (eg, a circuit, a chip, or a system on a chip (SOC), etc.) in the terminal device and the network device. In FIG. 2 , a method for transmitting a signal according to an embodiment of the present application is described by taking a terminal device and a network device as an execution subject as an example. The method shown in FIG. 2 includes at least part of the following.

In step 210, the terminal device acquires the first length of the first sequence and the first set of identifiers.

Optionally, the first sequence may be an uplink reference signal sequence.

For example, the first sequence may be an SRS sequence or a DMRS sequence.

This embodiment of the present application does not specifically limit the manner in which the terminal device obtains the first length.

In some implementations, the terminal device determines the first length of the first sequence according to the radio resources configured for it by the network device and/or whether frequency hopping is performed.

As an example, the terminal device according to

Determine the first length, where M ^RB is the number of resource blocks (resource block, RB), K _TC is the comb value,

is the number of subcarriers included in each RB. M ^RB and K _TC can be configured by network equipment. For example, each RB may contain 12 subcarriers,

That is, the total number of sub-carriers configured for the terminal device, for example, K _TC =2, which means that the reference sequence is mapped every 1 sub-carrier. As an alternative to this example, the terminal device may also determine the first length M according to other methods, and M satisfies

This embodiment of the present application does not specifically limit the manner in which the terminal device acquires the first group of identifiers.

In some implementations, the terminal device receives the first set of identifiers u configured for it by the network device.

In other implementation manners, the terminal device determines the first group of identifiers based on the ID configured by the network device and/or the identifier of the time unit. Wherein, the identifier of the time unit may be a slot label or a symbol label.

For example, the first set of identifiers u satisfies the following relationship:

in,

is the number of OFDM symbols per slot,

is the time slot label, l ₀ is the starting position of the time domain,

is the symbol number of OFDM in an SRS resource,

The number of consecutive OFDMs that can be configured for higher layer signaling;

is the ID configured by the network device, c(n) can satisfy:

c(n)=(x ₁ (n+ _NC )+x ₂ (n+ _NC ))mod 2

x ₁ (n+31)=(x ₁ (n+3)+x ₁ (n))mod 2

x ₂ (n+31)=(x ₂ (n+3)+x ₂ (n+2)+x ₂ (n+1)+x ₂ (n))mod 2

Among them, N _C =1600, the initial value of c(n) can be

When group hopping enbaled is enabled, in this example, by using the ID and the time unit identifier, the determined u can be changed with the ID and time, so that the inter-neighboring cells can be changed within a period of time. The interference is more randomized, which in turn improves system performance. The enabling of the above-mentioned group hopping can be notified through signaling, for example, through the high-level signaling groupOrSequenceHopping configuration: when the configuration indicates 'neither', group hopping is not enabled; when the configuration indicates 'groupHopping', group hopping is enabled.

In step 220, the terminal device determines the first parameter according to the first length, the first group identifier and the preset mapping relationship. Wherein, the first parameter is one of the parameters used to determine the first base sequence, the first base sequence is used to determine the above-mentioned first sequence, and each item in the first base sequence belongs to the parameter determined by e ^-j2πk/N A set of values, where N is the first parameter.

Optionally, the first parameter is greater than or equal to a first prime number, where the first prime number is the largest prime number less than or equal to the first length, or the first prime number is the smallest prime number greater than or equal to the first length.

Optionally, the first parameter belongs to one of an existing set of possible values. In this way, from the perspective of implementation, the hardware complexity is not increased.

For example, the existing set of possible values of M is M={36, 42, 48, 54, 60, 66, 72, 78, . Or taking the largest prime number equal to M as an example, the set of possible values of N obtained is N={31, 41, 47, 53, 59, 61, 71, 73, . . . , 1627}. It is assumed that when M=36 and u=0, N=73, and N=73 is the value of M=78 in the prior art, and the prior art can be reused, so the complexity of implementation can be not increased.

Compared with the fixed maximum prime number less than or equal to the first length or the smallest prime number greater than or equal to the first length, the present application jointly determines the value of the first parameter according to the group identifier and the first length, thereby helping to reduce the determination of The first sequence of PAPRs.

The implementation manner of the mapping relationship is not specifically limited in this embodiment of the present application. For example, the mapping relationship can be implemented through formulas, tables, and the like.

In a possible implementation manner, the mapping relationship includes some or all of the multiple (u, M, N) triples shown in Table 1, and the mapping relationship includes (u, M, N) N in at least one (u, M, N) triple of triples is not the largest prime number less than or equal to M, or N in at least one (u, M, N) triple is not greater than or equal to The smallest prime number of M.

For example, when M=36, the largest prime number less than or equal to M is 31, the smallest prime number greater than or equal to M is 37, and the (u, M, N) triplet (0, 36, 73) satisfies the value of N Not 31 or 37.

It should be noted that the mapping relationship includes a triple (u, M, N), which means that the mapping relationship maps (u, M) to N. In the embodiments of the present application, multiple (u, M, N) triples are defined. For example, when u=0 and M=36 in Table 1, N=73, the (u, M, N) triple is (0, 36, 73), and the mapping relationship includes the triple (0, 36, 73) It means that this mapping relationship maps u=0, M=36 to N=73. For another example, when u=1 and M=42 in Table 1, N=1627, the (u, M, N) triple is (1, 42, 1627), and the mapping relationship includes the triple (1, 42, 1627 ) means that this mapping relationship maps u=1, M=42 to N=1627.

Table 1

Wherein, M is the first length, N is the first parameter, and u is the first group of identifiers.

In another possible implementation manner, the mapping relationship includes some or all of the multiple (u, M, N) triples shown in Table 2, and the mapping relationship includes (u, M, N) ) N in at least one (u, M, N) triple of triples is not the largest prime number less than or equal to M, or N in at least one (u, M, N) triple is not greater than or The smallest prime number equal to M.

Table 2

Wherein, M is the length of the first sequence, u is the group identifier, and N is the first parameter.

Optionally, when the first base sequence satisfies

, the mapping relationship includes some or all triples as shown in Table 1 or Table 2, where,

is the first base sequence, M is the first length, N is the first parameter, x _q (m), q and

In order to determine the intermediate value in the process of the first base sequence, q is an integer greater than 0 and less than N, α is a cyclic shift value, A is a complex constant, u is the first set of identifiers, and u is greater than or equal to 0 and less than X An integer of -1, X is a prime number, v is the root number in the group, v is equal to 0 or 1, and j is an imaginary unit. Among them, q can be called the root index of the base sequence.

Optionally, when X=31, u=0, 1, 2, . . . , 29.

Optionally, when X=61, u=0, 1, 2, . . . , 59.

Optionally, when X=31, the triples included in the mapping relationship are shown in Table 1 or Table 2.

In another possible implementation manner, the mapping relationship includes some or all of the multiple (u, M, N) triples shown in Table 3, and the mapping relationship includes (u, M, N) ) N in at least one (u, M, N) triple of triples is not the largest prime number less than or equal to M, or N in at least one (u, M, N) triple is not greater than or The smallest prime number equal to M.

table 3

Wherein, M is the first length, N is the first parameter, and u is the first group of identifiers.

In another possible implementation manner, the mapping relationship includes some or all of the multiple (u, M, N) triples shown in Table 4, and the mapping relationship includes (u, M, N) ) N in at least one (u, M, N) triple of triples is not the largest prime number less than or equal to M, or N in at least one (u, M, N) triple is not greater than or The smallest prime number equal to M.

Table 4

Wherein, M is the first length, N is the first parameter, and u is the first group of identifiers.

Optionally, when the first base sequence satisfies

, the mapping relationship includes some or all triples as shown in Table 3 or Table 4, where,

is the first base sequence, M is the first length, N is the first parameter, x _q (m), q and

In order to determine the intermediate value in the process of the first base sequence, q is an integer greater than 0 and less than N, α is a cyclic shift value, A is a complex constant, u is the first set of identifiers, and u is greater than or equal to 0 and less than X An integer of -1, X is a prime number, v is the root number in the group, v is equal to 0 or 1, and j is an imaginary unit. Among them, q can be called the root index of the base sequence.

Optionally, when X=31, u=0, 1, 2, . . . , 29.

Optionally, when X=61, u=0, 1, 2, . . . , 59.

Optionally, when X=31, the triples included in the mapping relationship are shown in Table 3 or Table 4.

It can be seen from the above-mentioned Tables 1 to 4 that, corresponding to the same value of M, when the value of u is different, the value of N can be different. For example, the value of the first length is 36, the value of the first group of identifiers is 0, and the value of the first parameter can be obtained from Table 1 as 73; the value of the first length is 36, and the value of the first group of identifiers is The value is 1, and it can be obtained from Table 1 that the value of the first parameter is 131.

In step 230, the terminal device determines the first sequence based on the first parameter.

In some implementations, the terminal device determines the first sequence base sequence based on the first parameter, and further determines the first sequence based on the first base sequence.

This embodiment of the present application does not specifically limit the first sequence. For example, the first sequence may satisfy:

Among them, r(n) is the first sequence,

is the first base sequence, A is a complex constant, for example A is a power control factor, then A is a real number, α is a cyclic shift value, j is an imaginary unit, n=0, 1, ..., M-1, M is first length.

The embodiments of the present application do not specifically limit the first base sequence.

In some implementations, the first base sequence is a sequence generated based on a Zadoff-Chu sequence or a Wiener sequence, wherein:

The Zadoff-Chu sequence satisfies:

Wherein, x _q (m) is the Zadoff-Chu sequence; N is the length of the Zadoff-Chu sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m =0,1,...,N-1;

The Wiener sequence satisfies:

Wherein, x _q (m) is the Wiener sequence, N is the length of the Wiener sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m=0, 1 ,...,N-1;

The first base sequence satisfies:

Wherein, q is determined according to the first group identifier and the first parameter.

For example, as shown in Figure 3, a sequence group contains multiple base sequences of different lengths M, and the set of possible values of the length M of the base sequence is M={36,...,78,...,1632}. In the prior art, when the group identifier u=0, taking the largest prime number less than or equal to M as an example, the base sequence is generated based on the Zadoff-Chu (ZC) sequence of N={31,...,73,...,1627}, respectively. the sequence of. Based on the technical solution of the present application, a sequence group contains multiple base sequences of different lengths M, and the set of possible values of the length M of the base sequence is M={36,...}, for example, the base sequence is generated based on the ZC sequence sequence, when the group identifier u=0, the base sequence of M=36 is the sequence generated based on the ZC sequence of N=73.

In other implementations, the first base sequence may satisfy:

x _q (m)=e ^{-jπqm(m+1)/N} , m=0,1,...,N-1

in,

is the first base sequence, M is the first length, N is the first parameter, x _q (m), q and

In order to determine the intermediate value in the process of the first base sequence, q is an integer greater than 0 and less than N, α is a cyclic shift value, A is a complex constant, u is the first set of identifiers, and u is greater than or equal to 0 and less than X An integer of -1, X is a prime number, v is the root number in the group, v is equal to 0 or 1, and j is an imaginary unit. Among them, q can be called the root index of the base sequence.

Optionally, when X=31, u=0, 1, 2, . . . , 29.

Optionally, when X=61, u=0, 1, 2, . . . , 59.

In other implementations, the first base sequence may satisfy:

in,

is the first base sequence, M is the first length, N is the first parameter, x _q (m), q and

In order to determine the intermediate value in the process of the first base sequence, q is an integer greater than 0 and less than N, α is a cyclic shift value, A is a complex constant, u is the first set of identifiers, and u is greater than or equal to 0 and less than X An integer of -1, X is a prime number, v is the root number in the group, v is equal to 0 or 1, and j is an imaginary unit. Among them, q can be called the root index of the base sequence.

Optionally, when X=31, u=0, 1, 2, . . . , 29.

Optionally, when X=61, u=0, 1, 2, . . . , 59.

For ease of understanding, the embodiments of the present application describe the process of determining the first sequence in a step-by-step manner. It should be understood that the actual determination process of the first sequence is not necessarily step-by-step according to the above-mentioned step-by-step manner, for example, no steps or Use other step-by-step methods, etc. For example, the terminal device can directly determine the first sequence according to the acquired first length M, the first group identifier u, the cyclic shift value, and the above-mentioned root sequence number v.

It should be understood that, in some embodiments, the parameters in the above formulas may have other representations. For example, when it comes to the computation of u, v, r(n) can be expressed as r _u,v (n),

It can be expressed as

Combined with the embodiments in this application, the first sequence can satisfy

It should also be understood that, in some embodiments, some parameters in the formula may also be determined by other parameters, which are not specifically limited in the present invention. For example, for some signals, such as SRS, the value of u may be determined according to other parameters, or may be associated with other parameters. For example, for different l' values, there may be correspondingly different SRS sequences, where l' is an orthogonal frequency division multiplexing (orthogonal frequency division multiplexing, OFDM) symbol label of the SRS resource. In one embodiment,

The number of consecutive OFDMs that can be configured for higher layer signaling. In yet another embodiment, for different ports p _i , there may be associated cyclic shift α _i values (α _i may refer to the α value in this embodiment of the present invention). In addition, when calculating the cyclic shift α _i value, some other parameters can also be introduced through signaling, for example, high-layer signaling, or the α _i value can be determined through different received high-layer signaling configurations. For example, δ=log ₂ (K _TC ) associated with the α _i value, where K _TC is the parameter Comb Value associated with the transmission comb. According to the relationship of the above parameters, combined with the embodiments in this application, the reference signal sequence for one SRS resource can satisfy:

in

It means that r _u,v (n) takes α=α _i , and the value of α _i is related to δ=log ₂ (K _TC ),

It may refer to M in the embodiments of the present application.

The first sequence may be stored by the terminal device or calculated by the terminal device according to a predefined formula.

In step 240, the terminal device maps the first sequence to the M subcarriers to generate a first signal.

In some implementations, the first signal may be generated through steps 2401 and 2402 as shown in FIG. 4 .

Specifically, in step 2401, the terminal device maps the M items in the first sequence to the M subcarriers, respectively, to obtain the frequency domain signal of M points.

The embodiments of the present application do not specifically limit the manner in which the terminal device maps the M items in the first sequence to the M subcarriers respectively.

As an example, the terminal device maps the M items in the first sequence to M consecutive subcarriers, respectively. As shown in Fig. 5, the M items included in the first sequence are r(0)-r(M-1) respectively, and the terminal device sequentially converts r(0) in the order of subcarriers from small to large (or from large to small). )-r(M-1) is mapped to continuously distributed sub-carriers s+0 to sub-carriers s+M-1, one item is mapped to one sub-carrier. Among them, s+0 and s+M-1 are the numbers of the subcarriers.

As another example, the terminal device maps the M items in the first sequence to M subcarriers at equal intervals, and the interval may be greater than or equal to 1 subcarrier. In Fig. 6, the interval is 1 as an example. As shown in Fig. 6, the M items included in the first sequence are r(0)-r(M-1) respectively. Map r(0)-r(M-1) to the equally spaced subcarriers s+0, subcarriers s+2,..., subcarriers s+2(M-1) in the order of small), One item is mapped to one subcarrier. Among them, s+0 and s+M-1 are the numbers of the subcarriers.

It should be noted that, mapping an item in the first sequence to a subcarrier is to carry the item on the subcarrier.

In step 2402, the terminal device converts the frequency domain signal at point M into a time domain signal, and adds a cyclic prefix (cyclic prefix, CP) to the time domain signal to generate a first signal.

Optionally, in step 2402, the terminal device performs an inverse discrete Fourier transform (inverse discrete fourier transform, IDFT) on the frequency domain signal at point M to obtain a corresponding time domain signal.

In step 250, the terminal device sends a first signal to the network device. Correspondingly, the network device receives the first signal sent by the terminal device.

Specifically, the terminal device sends the first signal through radio frequency, that is, the terminal device sends the first signal bearing the first sequence on the above-mentioned M subcarriers. The network device receives the first signal sent by the terminal device through the radio frequency, that is, the network device receives the first signal carried on the above-mentioned M subcarriers. Optionally, the process for the network device to receive the first signal carried on the M subcarriers is: acquiring the time domain signal and removing the cyclic prefix; then performing discrete Fourier transform (discrete fourier transform, DFT) on the signal from which the cyclic prefix has been removed , to obtain the frequency domain signal.

In step 260, the network device determines a first sequence.

Optionally, the network device may store the first sequence locally, the network device may read the locally stored first sequence, or the network device may generate the first sequence according to a formula.

In step 270, the network device processes the first signal according to the first sequence.

In some implementations, the network device performs channel estimation according to the first sequence and the received first signal.

Specifically, the signal r'(n) received by the network device on the nth subcarrier among the M subcarriers can be expressed as:

r'(n)=h(n)r(n)+n(n)

Among them, h(n) is the uplink channel state information on the nth subcarrier, r(n) is the nth item of the first sequence stored locally by the network device, n(n) is the noise signal, n=0, 1, …, M-1.

The network device knows the time-frequency resources occupied by the first signal, and can perform the following operations on the received r'(n) and r(n) to obtain h(n):

r'(n)·(r(n)) ^* =h(n)+n'(n)

Among them, (r(n)) ^* is the conjugate of r(n), and n'(n) is the interference term.

Compared with the fixed maximum prime number less than or equal to the first length or the smallest prime number greater than or equal to the first length, in the technical solutions of the embodiments of the present application, the communication device can determine the length of the first sequence and the group identifier. Used to determine the first parameter of the first sequence, in this way, the first parameter is a value related to the length of the first sequence and the group identifier, not only related to the length of the first sequence, so that a more suitable value can be determined. first parameter.

The first sequence determined by the solution in this embodiment of the present application enables the first signal to have a lower PAPR on the premise that the cross-correlation between the first signal and other uplink reference signals is low. For example, as shown in FIG. 7 and FIG. 8 , compared with the 30 groups of 408-long uplink reference signal sequences determined according to the solution of the embodiment of the present application and the 30 groups of 408-long uplink reference signal sequences determined based on the prior art, compared with other The cross-correlation between uplink reference signal sequences does not change much, but the PAPR is significantly reduced.

Therefore, compared with the prior art, the first sequence determined in the embodiment of the present application is more suitable, thereby helping to reduce the PAPR of the first sequence, thereby improving the quality of channel estimation.

It can be understood that the above-mentioned method embodiments can be implemented independently or in combination, and the comparison is not limited in this application.

It can be understood that, in order to realize the functions in the foregoing embodiments, the communication apparatus includes corresponding hardware structures and/or software modules for performing each function. Those skilled in the art should easily realize that the units and method steps of each example described in conjunction with the embodiments disclosed in the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is performed by hardware or computer software-driven hardware depends on the specific application scenarios and design constraints of the technical solution.

The device embodiments of the present application will be described below with reference to FIGS. 9 to 12 . These apparatuses can be used to implement the functions of the terminal device or the network device in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. In the embodiments of the present application, the communication apparatus may be a terminal device or a network device, and may also be a module (eg, a chip) applied to the terminal device or the network device.

FIG. 9 is a schematic structural diagram of a communication device according to an embodiment of the present application. The communication apparatus 900 shown in FIG. 9 may correspond to the above terminal equipment. As shown in FIG. 9 , the communication apparatus 900 includes a processing unit 910 and a transceiver unit 920 .

The processing unit 910 is configured to obtain a first length and a first group of identifiers of the first sequence; determine a first parameter according to the first length, the first group of identifiers and a preset mapping relationship; based on the first parameters to determine the first sequence, wherein the first sequence satisfies

r(n) is the first sequence,

is the first base sequence, each item in the first base sequence belongs to the set of values determined by e ^-j2πk/N , N is the first parameter, α is the cyclic shift value and α is a real number, A is complex constant, j is an imaginary unit, n=0, 1,..., M-1, M is the first length, k=0, 1,..., N-1;

The processing unit 910 is further configured to map the first sequence to the M subcarriers to generate a first signal;

The transceiver unit 920 is configured to send the first signal.

Optionally, the processing unit 910 is specifically configured to: map the M items in the first sequence to consecutive M subcarriers; or map the M items in the first sequence to on M subcarriers at equal intervals.

Optionally, the first parameter is greater than or equal to a first prime number, the first prime number is the largest prime number less than or equal to the first length, or the first prime number is greater than or equal to the first length. smallest prime number.

Optionally, the first base sequence is a sequence generated based on Zadoff-Chu sequence or Wiener sequence, wherein:

The Zadoff-Chu sequence satisfies:

Wherein, x _q (m) is the Zadoff-Chu sequence; N is the length of the Zadoff-Chu sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m =0,1,...,N-1;

The Wiener sequence satisfies:

Wherein, x _q (m) is the Wiener sequence, N is the length of the Wiener sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m=0, 1 ,...,N-1;

The first base sequence satisfies:

Wherein, q is determined according to the first group identifier and the first parameter.

Optionally, the first base sequence satisfies:

x _q (m)=e ^{-jπqm(m+1)/N} , m=0,1,...,N-1

Alternatively, the first base sequence satisfies:

Wherein, u is the first set of identifiers, u is an integer greater than or equal to 0 and less than X-1, X is a prime number, v is equal to 0 or 1, x _q (m), q and

To determine the intermediate value in the first base sequence process, q is an integer greater than 0 and less than N.

Optionally, in the preset mapping relationship, for the same value of the first length, there are at least two different values of the first group identifier corresponding to different values of the first parameter.

Optionally, the preset mapping relationship includes some or all of the multiple (u, M, N) triples shown in Table 1, Table 2, Table 3 or Table 4, and all triples are included. N in at least one (u, M, N) triple of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or the at least one ( u, M, N) N in the triplet is not the smallest prime number greater than or equal to M.

Optionally, the first signal is an uplink reference signal.

Alternatively, the processing unit 910 may be implemented by a processor. The transceiving unit 920 may be implemented by a transceiver. For the specific functions and beneficial effects of the processing unit 910 and the transceiver unit 920, reference may be made to the relevant descriptions of the method embodiments, and details are not repeated here.

FIG. 10 is a schematic structural diagram of a communication apparatus according to another embodiment of the present application. The communication apparatus 1000 shown in FIG. 10 may correspond to the above network device. As shown in FIG. 10 , the communication apparatus 1000 includes a processing unit 1010 and a transceiver unit 1020 .

The transceiver unit 1020 is configured to receive the first signal carried on the M subcarriers.

A processing unit 1010, configured to determine a first sequence, the first sequence satisfies

where r(n) is the first sequence,

is the first base sequence, each item in the first base sequence belongs to the numerical value set determined by e ^-j2πk/N , and the first parameter N is based on the first length of the first sequence, the first group identifier, And the preset mapping relationship is determined, α is a cyclic shift value and α is a real number, A is a complex constant, j is an imaginary unit, n=0, 1, ..., M-1, M is the first length, k=0,1,...,N-1.

The processing unit 1010 is further configured to process the first signal according to the first sequence.

Optionally, the transceiver unit 1010 is specifically configured to: acquire the first signal on consecutive M subcarriers; or acquire the first signal on M equally spaced subcarriers.

Optionally, the first parameter is greater than or equal to a first prime number, the first prime number is the largest prime number less than or equal to the first length, or the first prime number is greater than or equal to the first length. smallest prime number.

Optionally, the first base sequence is a sequence generated based on Zadoff-Chu sequence or Wiener sequence, wherein,

The Zadoff-Chu sequence satisfies:

Wherein, x _q (m) is the Zadoff-Chu sequence; N is the length of the Zadoff-Chu sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m =0,1,...,N-1;

The Wiener sequence satisfies:

Wherein, x _q (m) is the Wiener sequence, N is the length of the Wiener sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m=0, 1 ,...,N-1;

The first base sequence satisfies:

Wherein, q is determined according to the first group identifier and the first parameter.

Optionally, the first base sequence satisfies:

x _q (m)=e ^{-jπqm(m+1)/N} , m=0,1,...,N-1

Alternatively, the first base sequence satisfies:

Wherein, u is the first set of identifiers, u is an integer greater than or equal to 0 and less than X-1, X is a prime number, v is equal to 0 or 1, x _q (m), q and

To determine the intermediate value in the first base sequence process, q is an integer greater than 0 and less than N.

Optionally, in the preset mapping relationship, for the same value of the first length, there are at least two different values of the first group identifier corresponding to different values of the first parameter.

Optionally, the preset mapping relationship includes some or all of the multiple (u, M, N) triples shown in Table 1, Table 2, Table 3 or Table 4, and all triples are included. N in at least one (u, M, N) triple of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or the at least one ( u, M, N) N in the triplet is not the smallest prime number greater than or equal to M.

Optionally, the first signal is an uplink reference signal.

Alternatively, the processing unit 1010 may be implemented by a processor. The transceiving unit 1020 may be implemented by a transceiver. For the specific functions and beneficial effects of the processing unit 1010 and the transceiver unit 1020, reference may be made to the relevant descriptions of the method embodiments, which will not be repeated here.

FIG. 11 is a schematic structural diagram of a communication apparatus provided by another embodiment of the present application. As shown in FIG. 11 , the communication device 1100 includes a processor 1110 and an interface circuit 1120 . The processor 1110 and the interface circuit 1120 are coupled to each other. It can be understood that the interface circuit 1120 can be a transceiver or an input-output interface. Optionally, the communication apparatus 1100 may further include a memory 1130 for storing instructions executed by the processor 1110 or input data required by the processor 1110 to execute the instructions or data generated after the processor 1110 executes the instructions.

When the communication apparatus 1100 is used to implement the above method embodiments, the processor 1110 is used to perform the functions of the above processing unit 910 , and the interface circuit 1120 is used to perform the functions of the above mentioned transceiver unit 920 .

When the above communication device is a chip applied to a terminal device, the chip implements the functions of the terminal device in the above method embodiments. The chip receives information from other modules (such as radio frequency modules or antennas) in the terminal device, and the information is sent to the terminal device by other network elements; or, the chip sends information to other modules in the terminal device (such as radio frequency modules or antennas) information, which is sent by the terminal device to other network elements.

FIG. 12 is a schematic structural diagram of a communication apparatus provided by another embodiment of the present application. As shown in FIG. 12 , the communication device 1200 includes a processor 1210 and an interface circuit 1220 . The processor 1210 and the interface circuit 1220 are coupled to each other. It can be understood that the interface circuit 1220 can be a transceiver or an input-output interface. Optionally, the communication apparatus 1200 may further include a memory 1230 for storing instructions executed by the processor 1210 or input data required by the processor 1210 to execute the instructions or data generated after the processor 1210 executes the instructions.

When the communication apparatus 1200 is used to implement the above-mentioned method embodiments, the processor 1210 is used to execute the function of the above-mentioned processing unit 1010 , and the interface circuit 1220 is used to implement the function of the above-mentioned transceiver unit 1020 .

When the above communication device is a chip applied to a network device, the chip implements the functions of the network device in the above method embodiments. The chip receives information from other modules (such as radio frequency modules or antennas) in the network equipment, and the information is sent to the network equipment by other network elements; or, the chip sends information to other modules (such as radio frequency modules or antennas) in the network equipment information, which is sent by the network device to other network elements.

In addition, an embodiment of the present application also provides a communication apparatus, the apparatus includes at least one processor and at least one memory, the at least one processor is coupled to the at least one memory, and the at least one processor is configured to execute the A computer program or instruction stored in at least one memory, so that the communication apparatus executes the method in each of the above method embodiments.

Optionally, the at least one memory stores at least part of the triples in the mapping relationship table as in Table 1 to Table 4 in the detailed description section.

It can be understood that the processor in the embodiments of the present application may be a central processing unit (Central Processing Unit, CPU), and may also be other general-purpose processors, digital signal processors (Digital Signal Processor, DSP), application-specific integrated circuits (Application Specific Integrated Circuit, ASIC), Field Programmable Gate Array (Field Programmable Gate Array, FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. A general-purpose processor may be a microprocessor or any conventional processor.

The method steps in the embodiments of the present application may be implemented in a hardware manner, or may be implemented in a manner in which a processor executes software instructions. Software instructions can be composed of corresponding software modules, and software modules can be stored in random access memory (Random Access Memory, RAM), flash memory, read-only memory (Read-Only Memory, ROM), programmable read-only memory (Programmable ROM) , PROM), Erasable Programmable Read-Only Memory (Erasable PROM, EPROM), Electrically Erasable Programmable Read-Only Memory (Electrically Erasable Programmable Read-Only Memory (Electrically EPROM, EEPROM), registers, hard disks, removable hard disks, CD-ROMs or known in the art in any other form of storage medium. An exemplary storage medium is coupled to the processor, such that the processor can read information from, and write information to, the storage medium. Of course, the storage medium can also be an integral part of the processor. The processor and storage medium may reside in an ASIC. Alternatively, the ASIC may be located in the end device. Of course, the processor and the storage medium may also exist in the terminal device as discrete components.

In the above-mentioned embodiments, it may be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented in software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of the present application are executed in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable device. The computer program or instructions may be stored in or transmitted over a computer-readable storage medium. The computer-readable storage medium can be any available media that can be accessed by a computer or a data storage device such as a server that integrates one or more available media. The usable media can be magnetic media, such as floppy disks, hard disks, magnetic tapes; optical media, such as DVD; and semiconductor media, such as solid state disks (SSD).

In the various embodiments of the present application, if there is no special description or logical conflict, the terms and/or descriptions between different embodiments are consistent and can be referred to each other, and the technical features in different embodiments are based on their inherent Logical relationships can be combined to form new embodiments.

In this application, "at least one" means one or more, and "plurality" means two or more. "And/or", which describes the association relationship of the associated objects, indicates that there can be three kinds of relationships, for example, A and/or B, which can indicate: the existence of A alone, the existence of A and B at the same time, and the existence of B alone, where A, B can be singular or plural. In the text description of this application, the character "/" generally indicates that the related objects are a kind of "or" relationship; in the formula of this application, the character "/" indicates that the related objects are a kind of "division" Relationship.

It can be understood that, the various numbers and numbers involved in the embodiments of the present application are only for the convenience of description, and are not used to limit the scope of the embodiments of the present application. The size of the sequence numbers of the above processes does not imply the sequence of execution, and the execution sequence of each process should be determined by its function and internal logic.

Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each particular application, but such implementations should not be considered beyond the scope of this application.

Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the above-described systems, devices and units may refer to the corresponding processes in the foregoing method embodiments, which will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented. On the other hand, the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.

The functions, if implemented in the form of software functional units and sold or used as independent products, may be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application can be embodied in the form of a software product in essence, or the part that contributes to the prior art or the part of the technical solution. The computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk and other media that can store program codes .

The above are only specific embodiments of the present application, but the protection scope of the present application is not limited to this. should be covered within the scope of protection of this application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims (49)

1. A method of transmitting a signal, comprising:

   Obtain the first length and the first set of identifiers of the first sequence;

   determining the first parameter according to the first length, the first group of identifiers and a preset mapping relationship;

   determining the first sequence based on the first parameter,

   wherein the first sequence satisfies

   

   r(n) is the first sequence,

   

   is the first base sequence, each item in the first base sequence belongs to the set of values determined by e ^-j2πk/N , N is the first parameter, α is the cyclic shift value, and α is a real number, A is a complex constant, j is an imaginary unit, n=0, 1, ..., M-1, M is the first length, k=0, 1, ..., N-1;

   The first sequence is mapped onto M subcarriers, and a first signal is generated and sent.
2. The method according to claim 1, wherein the mapping the first sequence to the M subcarriers comprises:

   Mapping the M items in the first sequence to consecutive M subcarriers; or,

   The M items in the first sequence are respectively mapped to M subcarriers at equal intervals.
3. The method according to claim 1 or 2, wherein the first parameter is greater than or equal to a first prime number, the first prime number is the largest prime number less than or equal to the first length, or the first prime number The prime number is the smallest prime number greater than or equal to the first length.
4. The method according to any one of claims 1 to 3, wherein the first base sequence is a sequence generated based on a Zadoff-Chu sequence or a Wiener sequence,

   The Zadoff-Chu sequence satisfies:

   

   Wherein, x _q (m) is the Zadoff-Chu sequence; N is the length of the Zadoff-Chu sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m =0,1,...,N-1;

   The Wiener sequence satisfies:

   

   Wherein, x _q (m) is the Wiener sequence, N is the length of the Wiener sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m=0, 1 ,...,N-1;

   The first base sequence satisfies:

   

   Wherein, q is determined according to the first group identifier and the first parameter.
5. The method according to any one of claims 1 to 4, characterized in that,

   The first base sequence satisfies:

   

   x _q (m)=e ^{-jπqm(m+1)/N} , m=0,1,...,N-1

   

   

   Alternatively, the first base sequence satisfies:

   

   

   

   Wherein, u is the first set of identifiers, u is an integer greater than or equal to 0 and less than X-1, X is a prime number, v is equal to 0 or 1, x _q (m), q and

   

   To determine the intermediate value in the first base sequence process, q is an integer greater than 0 and less than N.
6. The method according to any one of claims 1 to 5, wherein in the preset mapping relationship, for the same value of the first length, there are at least two different first group identifiers The value of the first parameter corresponding to the value is different.
7. The method according to any one of claims 1 to 6, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

   

   

   

   

   

   

   

   

   

   

   Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
8. The method according to any one of claims 1 to 6, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

   

   

   

   

   

   

   

   

   

   

   

   

   Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
9. The method according to any one of claims 1 to 6, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

   

   

   

   

   

   

   

   

   

   

   

   Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
10. The method according to any one of claims 1 to 6, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
11. The method according to any one of claims 1 to 10, wherein the first signal is an uplink reference signal.
12. A method of transmitting a signal, comprising:

    receiving the first signal carried on the M subcarriers;

    determine a first sequence that satisfies

    

    where r(n) is the first sequence,

    

    is the first base sequence, each item in the first base sequence belongs to the numerical value set determined by e ^-j2πk/N , and the first parameter N is based on the first length of the first sequence, the first group identifier, And the preset mapping relationship is determined, α is a cyclic shift value and α is a real number, A is a complex constant, j is an imaginary unit, n=0, 1, ..., M-1, M is the first length, k=0,1,...,N-1;

    The first signal is processed according to the first sequence.
13. The method according to claim 12, wherein the receiving the first signal carried on the M subcarriers comprises:

    acquiring the first signal on consecutive M subcarriers; or,

    The first signal is acquired on equally spaced M subcarriers.
14. The method according to claim 12 or 13, wherein the first parameter is greater than or equal to a first prime number, the first prime number is the largest prime number less than or equal to the first length, or the first prime number The prime number is the smallest prime number greater than or equal to the first length.
15. The method according to any one of claims 12 to 14, wherein the first base sequence is a sequence generated based on a Zadoff-Chu sequence or a Wiener sequence,

    The Zadoff-Chu sequence satisfies:

    

    Wherein, x _q (m) is the Zadoff-Chu sequence; N is the length of the Zadoff-Chu sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m =0,1,...,N-1;

    The Wiener sequence satisfies:

    

    Wherein, x _q (m) is the Wiener sequence, N is the length of the Wiener sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m=0, 1 ,...,N-1;

    The first base sequence satisfies:

    

    Wherein, q is determined according to the first group identifier and the first parameter.
16. The method according to any one of claims 12 to 15, wherein,

    The first base sequence satisfies:

    

    x _q (m)=e ^{-jπqm(m+1)/N} , m=0,1,...,N-1

    

    

    Alternatively, the first base sequence satisfies:

    

    

    

    Wherein, u is the first set of identifiers, u is an integer greater than or equal to 0 and less than X-1, X is a prime number, v is equal to 0 or 1, x _q (m), q and

    

    To determine the intermediate value in the first base sequence process, q is an integer greater than 0 and less than N.
17. The method according to any one of claims 12 to 16, wherein, in the preset mapping relationship, for the same value of the first length, there are at least two different first group identifiers The value of the first parameter corresponding to the value is different.
18. The method according to any one of claims 12 to 17, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
19. The method according to any one of claims 12 to 17, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
20. The method according to any one of claims 12 to 17, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
21. The method according to any one of claims 12 to 17, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
22. The method according to any one of claims 12 to 21, wherein the first signal is an uplink reference signal.
23. A communication device, comprising:

    a processing unit, configured to obtain a first length of a first sequence and a first group of identifiers; determine a first parameter according to the first length, the first group of identifiers and a preset mapping relationship; based on the first parameter , determine the first sequence, wherein the first sequence satisfies

    

    r(n) is the first sequence,

    

    is the first base sequence, each item in the first base sequence belongs to the set of values determined by e ^-j2πk/N , N is the first parameter, α is the cyclic shift value and α is a real number, A is complex constant, j is an imaginary unit, m=0, 1,..., M-1, M is the first length, k=0, 1,..., N-1;

    The processing unit is further configured to map the first sequence to the M subcarriers to generate a first signal;

    A transceiver unit, configured to send the first signal.
24. The apparatus according to claim 23, wherein the processing unit is specifically configured to:

    Mapping the M items in the first sequence to consecutive M subcarriers; or,

    The M items in the first sequence are respectively mapped to M subcarriers at equal intervals.
25. The device according to claim 23 or 24, wherein the first parameter is greater than or equal to a first prime number, and the first prime number is the largest prime number less than or equal to the first length, or the first prime number is The prime number is the smallest prime number greater than or equal to the first length.
26. The device according to any one of claims 23 to 25, wherein the first base sequence is a sequence generated based on a Zadoff-Chu sequence or a Wiener sequence,

    The Zadoff-Chu sequence satisfies:

    

    Wherein, x _q (m) is the Zadoff-Chu sequence; N is the length of the Zadoff-Chu sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m =0,1,...,N-1;

    The Wiener sequence satisfies:

    

    Wherein, x _q (m) is the Wiener sequence, N is the length of the Wiener sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m=0, 1 ,...,N-1;

    The first base sequence satisfies:

    

    Wherein, q is determined according to the first group identifier and the first parameter.
27. The device according to any one of claims 23 to 26, characterized in that,

    The first base sequence satisfies:

    

    x _q (m)=e ^{-jπqm(m+1)/N} , m=0,1,...,N-1

    

    

    Alternatively, the first base sequence satisfies:

    

    

    

    Wherein, u is the first set of identifiers, u is an integer greater than or equal to 0 and less than X-1, X is a prime number, v is equal to 0 or 1, x _q (m), q and

    

    To determine the intermediate value in the first base sequence process, q is an integer greater than 0 and less than N.
28. The apparatus according to any one of claims 23 to 27, wherein, in the preset mapping relationship, for the same value of the first length, there are at least two different first group identifiers The value of the first parameter corresponding to the value is different.
29. The device according to any one of claims 23 to 28, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
30. The device according to any one of claims 23 to 28, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
31. The device according to any one of claims 23 to 28, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
32. The device according to any one of claims 23 to 28, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
33. The apparatus according to any one of claims 23 to 32, wherein the first signal is an uplink reference signal.
34. A communication device, comprising:

    a transceiver unit, configured to receive the first signal carried on the M subcarriers;

    a processing unit for determining a first sequence that satisfies

    

    where r(n) is the first sequence,

    

    is the first base sequence, each item in the first base sequence belongs to the numerical value set determined by e ^-j2πk/N , and the first parameter N is based on the first length of the first sequence, the first group identifier, And the preset mapping relationship is determined, α is a cyclic shift value and α is a real number, A is a complex constant, j is an imaginary unit, n=0, 1, ..., M-1, M is the first length, k=0,1,...,N-1;

    The processing unit is further configured to process the first signal according to the first sequence.
35. The device according to claim 34, wherein the transceiver unit is specifically configured to:

    acquiring the first signal on consecutive M subcarriers; or,

    The first signal is acquired on equally spaced M subcarriers.
36. The device according to claim 34 or 35, wherein the first parameter is greater than or equal to a first prime number, the first prime number is the largest prime number less than or equal to the first length, or the first prime number The prime number is the smallest prime number greater than or equal to the first length.
37. The device according to any one of claims 34 to 36, wherein the first base sequence is a sequence generated based on a Zadoff-Chu sequence or a Wiener sequence,

    The Zadoff-Chu sequence satisfies:

    

    Wherein, x _q (m) is the Zadoff-Chu sequence; N is the length of the Zadoff-Chu sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m =0,1,...,N-1;

    The Wiener sequence satisfies:

    

    Wherein, x _q (m) is the Wiener sequence, N is the length of the Wiener sequence, which is an integer greater than 1; q is a natural number relatively prime to N, and q is greater than 0 and less than N; m=0, 1 ,...,N-1;

    The first base sequence satisfies:

    

    Wherein, q is determined according to the first group identifier and the first parameter.
38. The device according to any one of claims 34 to 37, characterized in that,

    The first base sequence satisfies:

    

    x _q (m)=e ^{-jπqm(m+1)/N} , m=0,1,...,N-1

    

    

    Alternatively, the first base sequence satisfies:

    

    

    

    Wherein, u is the first set of identifiers, u is an integer greater than or equal to 0 and less than X-1, X is a prime number, v is equal to 0 or 1, x _q (m), q and

    

    To determine the intermediate value in the first base sequence process, q is an integer greater than 0 and less than N.
39. The device according to any one of claims 34 to 38, wherein in the preset mapping relationship, for the same value of the first length, there are at least two different first group identifiers The value of the first parameter corresponding to the value is different.
40. The device according to any one of claims 34 to 39, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
41. The device according to any one of claims 34 to 39, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
42. The device according to any one of claims 34 to 39, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
43. The device according to any one of claims 34 to 39, wherein the preset mapping relationship includes part or all of the multiple (u, M, N) triples shown in the following table tuples, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not the largest prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not the smallest prime number greater than or equal to M:

    

    

    

    

    

    

    

    

    

    

    Wherein, M is the first length, u is the first group identifier, and N is the first parameter.
44. The apparatus according to any one of claims 34 to 43, wherein the first signal is an uplink reference signal.
45. A communication device, characterized in that it includes at least one processor coupled to at least one memory, and the at least one processor is configured to execute computer programs or instructions stored in the at least one memory to cause The communication device performs the method of any one of claims 1 to 22.
46. A communication device, characterized by comprising at least one processor and at least one memory, the at least one processor being coupled to the at least one memory, the at least one processor for executing a computer stored in the at least one memory Programs or instructions to cause the communication device to perform a method as claimed in any one of claims 1 to 22.
47. The apparatus according to claim 46, wherein at least part of the mapping relationship in the mapping relationship table according to any one of claims 7 to 10 or 18 to 21 is stored in the at least one memory.
48. A chip, characterized in that it comprises a logic circuit and a communication interface, the communication interface is used to receive data and/or information to be processed, and the logic circuit is used to perform the process as claimed in any one of claims 1 to 22. The data and/or information processing described above, and the communication interface is also used for outputting the processing result obtained by the logic circuit.
49. A computer-readable storage medium, characterized in that the computer-readable storage medium stores computer instructions, and when the computer instructions are executed on a computer, the method according to any one of claims 1 to 22 is implemented .

Images