CN114124326A

CN114124326A - Method and communication device for transmitting signals

Info

Publication number: CN114124326A
Application number: CN202010899817.2A
Authority: CN
Inventors: 曲秉玉; 李博; 龚名新
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2020-08-31
Filing date: 2020-08-31
Publication date: 2022-03-01
Also published as: WO2022042618A1

Abstract

In the technical scheme of the application, a communication device can determine a first parameter for determining a first sequence according to the length of the first sequence, a group identifier and a preset mapping relation, so that the first parameter is a numerical value related to both the length of the first sequence and the group identifier, and is not related to the length of the first sequence, and a more appropriate first parameter can be determined.

Description

Method and communication device for transmitting signals

Technical Field

The present application relates to the field of communications, and more particularly, to a method and a communication apparatus for transmitting a signal.

Background

The terminal device needs to send an uplink reference signal (e.g., Sounding Reference Signal (SRS) or demodulation reference signal (DMRS)) to the network device, so that the network device obtains uplink channel information from the terminal device to the network device by using the uplink reference signal sent by the terminal device. In a Time Division Duplex (TDD) system, an uplink channel and a downlink channel are reciprocal, so downlink channel information can also be obtained through an uplink reference signal, and the downlink channel state information is used for precoding, modulation coding mode determination and the like during downlink data transmission. Thus, the quality of the channel estimation based on the uplink reference signal may affect the downlink throughput.

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

Generally, the higher the PAPR of a signal, the lower the maximum transmit power available to the communication device, in order to ensure that the signal is not distorted. Too high PAPR may result in low uplink reference signal transmit power of edge users in a coverage scenario, resulting in a relatively low signal to noise ratio (SNR) of the uplink reference signal, which may seriously affect the quality of channel estimation.

Disclosure of Invention

The application provides a method and a communication device for transmitting signals, which are beneficial to reducing the PAPR of uplink reference signals and further improving the quality of channel estimation.

In a first aspect, the present application provides a method of transmitting a signal, the method comprising: acquiring a first length and a first group of identifications of a first sequence; determining a first parameter according to the first length, the first group of identifiers and a preset mapping relation; determining the first sequence based on the first parameter, wherein the first sequence satisfies

r (n) is the first sequence,

is a first base sequence, each item in the first base sequence belonging to a sequence defined by e^-j2πk/NA determined set of values, N being said first parameter, α beingCyclic shift values and a is a real number, a is a complex constant, j is an imaginary unit, N is 0, 1, …, M-1, M is the first length, k is 0, 1, …, N-1; and mapping the first sequence to M subcarriers, generating a first signal and transmitting the first signal.

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

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

Alternatively, the group identification may be a group number or a group ID, etc.

Compared with the fixed maximum prime number smaller than or equal to the first length or the minimum prime number larger than or equal to the first length, in the technical solution of the embodiment of the present application, the communication apparatus may determine the first parameter for determining the first sequence according to the length of the first sequence, the group identifier, and the preset mapping relationship, so that the first parameter is a value related to both the length of the first sequence and the group identifier, and is not related to only the length of the first sequence. Therefore, the first sequence generated by the scheme of the embodiment of the 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 lower.

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

With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the mapping the first sequence onto M subcarriers includes: mapping M items in the first sequence to continuous M subcarriers respectively; or mapping the M items in the first sequence to M subcarriers with equal intervals respectively.

With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the first parameter is greater than or equal to a first prime number, where the first prime number is a maximum prime number less than or equal to the first length, or the first prime number is a minimum prime number greater than or equal to the first length.

Optionally, the first parameter belongs to one of an existing set of values that can be taken. Thus, from the implementation point of view, the complexity of implementation is not increased.

For example, the conventional set of possible values of M is M ═ 36, 42, 48, 54, 60, 66, 72, 78, …, 1632, and for the set of possible values of M, the set of possible values of N obtained by taking the maximum prime number smaller than or equal to M is N ═ 31, 41, 47, 53, 59, 61, 71, 73, …, 1627. Assuming that M is 36, u is 0, N is 73, and N is 73, which is a value obtained in the prior art, M is 78, the prior art can be multiplexed, and thus the complexity of implementation can not be increased.

Compared with the fixed maximum prime number which is less than or equal to the first length or the minimum prime number which is greater than or equal to the first length, the method and the device determine the value of the first parameter according to the group identifier and the first length, so that the PAPR of the determined first signal is reduced.

With reference to the first aspect or any one of the foregoing possible implementations, in another possible implementation, the first motif sequence is a sequence determined based on a Zadoff-chu (zc) sequence or a Wiener sequence,

the Zadoff-Chu sequence satisfies:

wherein x is_q(m) is the Zadoff-Chu sequence; n is the length of the Zadoff-Chu sequence and is an integer greater than 1; q is a natural number which is prime to N, and q is more than 0 and less than N; m is 0, 1, …, N-1;

the Wiener sequence satisfies:

wherein x is_q(m) is the Wiener sequence, N is the length of the Wiener sequence, and is an integer greater than 1; q is a natural number coprime to N, and q is greater than 0 and less thanN；m＝0，1，…，N-1；

The first base sequence satisfies:

wherein q is determined from the first group identification and the first parameter.

With reference to the first aspect or any one of the foregoing possible implementations, in another possible implementation, the first base sequence satisfies:

or, the first base sequence satisfies:

wherein u is the first group identifier, 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, and X is_q(m), q and

to determine the intermediate values in the first base sequence, q is an integer greater than 0 and less than N.

Alternatively, when X is 31, u is 0, 1, 2, …, 29.

Alternatively, when X is 61, u is 0, 1, 2, …, 59.

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

With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, in the preset mapping relationship, for a same value of the first length, values of first parameters corresponding to values of at least two different first group identifiers are different.

With reference to the first aspect or any one of the foregoing possible implementations, in another possible implementation, the preset mapping relationship includes some or all of the multiple (u, M, N) triples shown in table 1 of the detailed description, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M.

With reference to the first aspect or any one of the foregoing possible implementations, in another possible implementation, the preset mapping relationship includes some or all of the multiple (u, M, N) triples shown in table 2 of the detailed description, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M.

With reference to the first aspect or any one of the foregoing possible implementations, in another possible implementation, the preset mapping relationship includes some or all of the multiple (u, M, N) triples shown in table 3 of the detailed description, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M.

With reference to the first aspect or any one of the foregoing possible implementations, in another possible implementation, the preset mapping relationship includes some or all of the multiple (u, M, N) triples shown in table 4 of the detailed description, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M.

As can be seen from tables 1-4, the values of N may be different when the values of u are different, corresponding to the same values of M. For example, the value of the first length is 36, the value of the first group identifier is 0, and the value of the first parameter is 73, which can be obtained from table 1; the value of the first length is 36, the value of the first group identifier is 1, and the value of the first parameter is 131 as can be obtained from table 1.

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

Wherein r (n) is the first sequence,

is a first base sequence, each item in the first base sequence belonging to a sequence defined by e^-j2πk/NA determined set of values, where a first parameter N is determined according to a first length of the first sequence, a first group identifier, and a preset mapping relationship, a is a cyclic shift value and a is a real number, a is a complex constant, j is an imaginary unit, N is 0, 1, …, M-1, M is the first length, k is 0, 1, …, N-1; processing the first signal according to the first sequence.

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

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

Compared with a fixed maximum prime number which is less than or equal to the first length or a fixed minimum prime number which is greater than or equal to the first length, in the technical scheme of the embodiment of the application, the first parameter for determining the first sequence is determined according to the length of the first sequence, the group identifier and a preset mapping relation, so that the first parameter is a value which is related to both the length of the first sequence and the group identifier, and not only the length of the first sequence, and a more appropriate first parameter can be determined.

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

With reference to the first aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the receiving a first signal carried on M subcarriers includes: acquiring the first signal on continuous M subcarriers; alternatively, the first signal is acquired on M subcarriers of equal spacing.

With reference to the second aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, the first parameter is greater than or equal to a first prime number, where the first prime number is a maximum prime number less than or equal to the first length, or the first prime number is a minimum prime number greater than or equal to the first length.

Compared with the fixed maximum prime number which is less than or equal to the first length or the minimum prime number which is greater than or equal to the first length, the method and the device determine the value of the first parameter according to the first group of identifiers and the first length, so that the PAPR of the determined first signal is reduced.

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

the Zadoff-Chu sequence satisfies:

the Wiener sequence satisfies:

wherein x is_q(m) is the Wiener sequence, N is the length of the Wiener sequence, and is an integer greater than 1; q is a natural number which is prime to N, and q is more than 0 and less than N; m is 0, 1, …, N-1;

the first base sequence satisfies:

With reference to the second aspect or any one of the foregoing possible implementations, in another possible implementation, the first base sequence satisfies:

or, the first base sequence satisfies:

Alternatively, when X is 31, u is 0, 1, 2, …, 29.

Alternatively, when X is 61, u is 0, 1, 2, …, 59.

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

With reference to the second aspect or any one of the foregoing possible implementation manners, in another possible implementation manner, in the preset mapping relationship, for a same value of the first length, values of first parameters corresponding to values of at least two different first group identifiers are different.

With reference to the second aspect or any one of the foregoing possible implementations, in another possible implementation, the preset mapping relationship includes some or all of the multiple ((u, M, N) triples shown in table 1 of the detailed description, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M.

With reference to the second aspect or any one of the foregoing possible implementations, in another possible implementation, the preset mapping relationship includes some or all of the multiple (u, M, N) triples shown in table 2 of the detailed description, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M.

With reference to the second aspect or any one of the foregoing possible implementations, in another possible implementation, the preset mapping relationship includes some or all of the multiple (u, M, N) triples shown in table 3 of the detailed description, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M.

With reference to the second aspect or any one of the foregoing possible implementations, in another possible implementation, the preset mapping relationship includes some or all of the multiple (u, M, N) triples shown in table 4 of the detailed description, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M.

In a third aspect, the present application provides a communication device having the functionality to implement the method of the first aspect or any possible implementation thereof, or having the functionality to implement the method of the second aspect or any possible implementation thereof. The functions can be realized by hardware, and the functions can also be realized by executing corresponding software by hardware. 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 comprising a processor, a memory, and a transceiver. Wherein the memory is used for storing a computer program, and the processor is used for calling and running the computer program stored in the memory, and controlling the transceiver to transmit and receive signals, so as to make the communication device execute the method as in the first aspect or any possible implementation manner thereof, or execute the method as in the second aspect or any possible implementation manner thereof.

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

Alternatively, the 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 device comprising at least one processor and at least one memory, the at least one processor being coupled with the at least one memory, the at least one processor being configured to execute computer programs or instructions stored in the at least one memory to cause the communication device 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, at least some of the triples in the mapping relationship table in tables 1-4 as described in the detailed description section are stored in the at least one memory.

In a seventh aspect, the present application provides a chip, including a logic circuit and a communication interface, where the logic circuit is configured to obtain the first length and the first group identifier described in the first aspect or any possible implementation manner thereof, and to perform the determination processing described in the first aspect or any possible implementation manner thereof to obtain the first sequence described in the first aspect or any possible implementation manner thereof, and the communication interface is configured to output the first sequence.

In an eighth aspect, the present application provides a chip comprising a logic circuit and a communication interface, wherein 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 perform the determination processing in the second aspect or any possible implementation manner thereof.

Optionally, the communication interface may comprise 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 having stored thereon computer instructions which, when run on a computer, cause a method as in the first aspect or any possible implementation thereof to be performed, or a method as in the second aspect or any possible implementation thereof to be performed.

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

In an eleventh aspect, the present application provides a wireless communication system comprising the communication apparatus of any one of the above aspects and any possible implementation thereof.

Drawings

Fig. 1 is a schematic architecture diagram of a communication system to which embodiments of the present application may be applied.

Fig. 2 is a schematic flow chart of a method for transmitting a signal according to an embodiment of the present application.

Fig. 3 is a schematic diagram of a relationship between a ZC sequence and a base sequence generated based on the ZC sequence within a sequence group according to the present invention.

Fig. 4 is a schematic flow chart of generating a first signal in an embodiment of the present application.

Fig. 5 is a schematic diagram of mapping a first sequence onto M subcarriers in the embodiment of the present application.

Fig. 6 is another schematic diagram of mapping the first sequence onto M subcarriers in the embodiment of the present application.

Fig. 7 is a diagram illustrating PAPR cumulative distribution of 30 groups 408 of long uplink reference signal sequences.

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

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

Fig. 10 is a schematic structural diagram of a communication apparatus according to another embodiment of the present application.

Fig. 11 is a schematic structural diagram of a communication device according to another embodiment of the present application.

Fig. 12 is a schematic structural diagram of a communication apparatus according to another embodiment of the present application.

Detailed Description

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

The technical scheme of the embodiment of the application can be applied to various communication systems, for example: long Term Evolution (LTE) system, LTE Frequency Division Duplex (FDD) system, LTE TDD system, Universal Mobile Telecommunications System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) communication system, fifth generation (5)^thgeneration, 5G) system or New Radio (NR), satellite communication system, and future mobile communication system, etc.

Fig. 1 is a schematic architecture diagram of a communication system to which embodiments of the present application may be applied. As shown in fig. 1, the communication system 100 may include a network device 110 and at least one terminal device (e.g., terminal device 120 in fig. 1). The terminal device 120 is connected to the network device 110 in a wireless manner. The terminal equipment may be fixed or mobile. Fig. 1 is a schematic diagram, and other network devices, such as a wireless relay device and a wireless backhaul device, may also be included in the communication system, 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 device in the embodiments of the present application may also be referred to as a User Equipment (UE), a user, an access terminal, a subscriber unit, a subscriber station, a mobile station, a remote terminal, a mobile device, a user terminal, a wireless communication device, a user agent, a user equipment, or the like. The terminal device may be a cellular phone, a smart watch, a wireless data card, a mobile 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, a computer with wireless transceiving function, a virtual reality terminal device, an augmented reality terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in tele-surgery, a wireless terminal in smart grid, a wireless terminal in transportation security, a wireless terminal in smart city, a wireless terminal in smart home, a wireless terminal in satellite communication (e.g., a satellite phone or a satellite terminal, etc.), and the like. The embodiment of the present application does not limit the specific technology and the specific device form adopted by the terminal device.

The network device in this embodiment may be a device for communicating with a terminal device, the network device may be a Base Transceiver Station (BTS) in a global system for mobile communications (GSM) system or a Code Division Multiple Access (CDMA) system, may also be a base station (nodeB, NB) in a Wideband Code Division Multiple Access (WCDMA) system, may also be an evolved node b (eNB or eNodeB) in an LTE system, may also be a wireless controller in a Cloud Radio Access Network (CRAN) scenario, or the network device may be a relay station, an access point, a vehicle-mounted device or a wearable device, or the network device may be a terminal that assumes a 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 the future such as a PLMN network device, the embodiments of the present application are not limited. In addition, the network device in the embodiment of the present application may also be a module or a unit that completes a function of a base station part, for example, may be a Central Unit (CU) or a Distributed Unit (DU). The embodiments of the present application do not limit the specific technologies and the specific device forms used by the network devices.

The terminal equipment and the network equipment of the embodiment of the application can be deployed on land, including indoor or outdoor, handheld or vehicle-mounted; can also be deployed on the water surface; it may also be deployed on airborne airplanes, balloons and satellite vehicles. The embodiment of the application does not limit the application scenarios of the network device and the terminal device.

The terminal device and the network device of the embodiment of the application can communicate through the authorized spectrum, can communicate through the unlicensed spectrum, and can communicate through the authorized spectrum and the unlicensed spectrum at the same time. The terminal device and the network device may communicate with each other through a frequency spectrum of 6 gigahertz (GHz) or less, through a frequency spectrum of 6GHz or more, or through both a frequency spectrum of 6GHz or less and a frequency spectrum of 6GHz or more. 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 obtains 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 state information can also be obtained through the uplink reference signal, and the downlink channel state information is used for precoding, modulation coding mode determination, and the like during downlink data transmission. Thus, the quality of the channel estimation based on the uplink reference signal may affect the downlink throughput.

Currently, the sequence of the uplink reference signal adopts the parameter generated by cyclic shift of the base sequenceReference signal sequence, e.g. sequence of M-length motifs

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

where, 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 is 0, 1, …, M-1.

In the 3rd generation partnership project (3 GPP) 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 an uplink reference signal sequence, wherein the base sequence group identifier u is 0, 1, …, 29, and the root sequence number v in each group is 0; for M values greater than or equal to 72, 60 base sequences are defined for generating uplink reference signal sequences, wherein the base sequence group identifiers u are 0, 1, …, and 29, and the root sequence number v in each group is 0 and 1.

Base sequences of length M

Satisfies the following conditions:

wherein x is_q(m), q and

the intermediate value in the generation process of the base sequence is q is an integer which is 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, N is the maximum prime number which is less than or equal to M, or N is the minimum prime number which is greater than or equal to M.

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

Generally, in order to ensure that a signal is not distorted, the higher the PAPR of the signal, the lower the maximum transmission power available to the communication device, so that the higher the PAPR leads to the lower transmission power of the uplink reference signal of the edge user in the coverage scenario, and further the lower the received SNR of the uplink reference signal seriously affects the quality of channel estimation.

In view of the above problems, the present application provides a method and a communication apparatus for transmitting a signal, which are beneficial to reducing PAPR of an uplink reference signal, and further improve quality of channel estimation.

Fig. 2 is a schematic flow chart of a method for transmitting a signal according to an embodiment of the present application. The method shown in fig. 2 may be executed by the terminal device and the network device, and may also be executed by a module or a unit (e.g., a circuit, a chip, or a system on a chip (SOC), etc.) in the terminal device and the network device. Fig. 2 illustrates a terminal device and a network device as an execution subject, and describes a method for transmitting a signal according to an embodiment of the present application. The method illustrated in fig. 2 includes at least some of the following.

In step 210, the terminal device obtains a first length and a first group identification of the first sequence.

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

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

The 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 resource configured for the terminal device by the network device and/or whether to frequency hop.

As an example, the terminal device is according to

Determining a first length, wherein M^RBIs the number of Resource Blocks (RB), K_TCThe number of the comb teeth is the value of the comb teeth,

the number of subcarriers included for each RB. M^RBAnd K_TCMay be configured by the network device. For example each RB may contain 12 subcarriers,

i.e. the total number of subcarriers allocated to the terminal equipment, e.g. K _TC2, the reference sequence is mapped to 1 subcarrier per interval. As an alternative to this example, the terminal device may also determine the first length M according to other manners, where M satisfies the requirement

The method for acquiring the first group identifier by the terminal device is not particularly limited in the embodiment of the present application.

In some implementations, the terminal device receives a first set of identities u for which the network device is configured.

In other implementations, the terminal device determines the first set of identities based on an ID configured by the network device and/or an identity of the time cell. The identifier of the time unit may be a slot (slot) number or a symbol (symbol) number of the slot.

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

wherein the content of the first and second substances,

for the number of OFDM symbols per slot,

is a time slot index,/₀Is a starting position in the time domain,

the symbols for OFDM in one SRS resource are numbered,

the number of consecutive OFDM that can be configured for the high level signaling;

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

c(n)＝(x₁(n+N_C)+x₂(n+N_C))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

wherein N is_CThe initial value of c (n) may be 1600 ═ c

When a group hop (group hopping based) is turned on, the ID and the time unit identifier are used in this example, so that the determined u varies with the ID and time variation, and the interference between adjacent cells can be more randomized in a period of time, thereby improving the system performance. The enabling of the group hop may be signaled, for example, configured by high-layer signaling groupOrSequenceHopping: when the configuration indicates 'neither', the group hop is not turned on; when the configuration indicates 'grouppoping', the group hop is on.

In step 220, the terminal device determines a first parameter according to the first length, the first group identifier, and a preset mapping relationship. Wherein the first parameter is one of parameters for determining a first base sequence for determining the first sequence, and each item in the first base sequenceBelong to e^-j2πk/NAnd determining a value set, wherein N is a first parameter.

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

Optionally, the first parameter belongs to one of an existing set of values that can be taken. Thus, from the implementation point of view, the hardware complexity is not increased.

Compared with the fixed maximum prime number which is less than or equal to the first length or the minimum prime number which is greater than or equal to the first length, the method and the device determine the value of the first parameter according to the group identifier and the first length, and therefore the PAPR of the determined first sequence is reduced.

The implementation manner of the mapping relationship in the embodiment of the present application is not particularly limited. For example, the mapping relationship may be implemented by a formula, a table, or the like.

In one possible implementation, the mapping relationship includes some or all of the (u, M, N) triples shown in table 1, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the mapping relationship is not a maximum prime number less than or equal to M, or N in at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M.

For example, when M is 36, the maximum prime number smaller than or equal to M is 31, and the minimum prime number larger than or equal to M is 37, the (u, M, N) triplet (0, 36, 73) satisfies that N does not take on the value of 31 or 37.

It should be noted that the mapping relationship includes a triple (u, M, N) that means that the mapping relationship maps (u, M) to N. In the embodiments of the present application, a plurality of (u, M, N) triplets are defined. For example, in table 1, when u is 0 and M is 36, N is 73, and the triplet (u, M, N) is (0, 36, 73), and the mapping relationship including the triplet (0, 36, 73) means that the mapping relationship maps u is 0 and M is 36 to N is 73. For another example, in table 1, when u is 1 and M is 42, N is 1627, and the triplet (u, M, N) is (1, 42, 1627), and the mapping relationship including the triplet (1, 42, 1627) means that the mapping relationship maps u is 1 and M is 42 to N is 1627.

TABLE 1

Wherein M is a first length, N is a first parameter, and u is a first group identifier.

In another possible implementation manner, the mapping relationship includes some or all of the (u, M, N) triples shown in table 2, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the mapping relationship is not a maximum prime number smaller than or equal to M, or N in at least one (u, M, N) triplet is not a minimum prime number larger than or 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 is satisfied

The mapping relationship may include some or all of the triples as shown in table 1 or table 2, wherein,

is a first base sequence, M is a first length, N is a first parameter, x_q(m), q and

for determining intermediate values in the course of the first base sequence, q is an integer greater than 0 and less than N,alpha is a cyclic shift value, A is a complex constant, u is a first group identifier, u is an integer greater than or equal to 0 and less than X-1, X is a prime number, v is a root sequence number in the group, v is equal to 0 or 1, and j is an imaginary number unit. Where q may be referred to as the root index of the base sequence.

Alternatively, when X is 31, u is 0, 1, 2, …, 29.

Alternatively, when X is 61, u is 0, 1, 2, …, 59.

Optionally, when X is 31, the mapping relationship includes the triples shown in table 1 or table 2.

In another possible implementation manner, the mapping relationship includes some or all of the (u, M, N) triples shown in table 3, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the mapping relationship is not a maximum prime number smaller than or equal to M, or N in at least one (u, M, N) triplet is not a minimum prime number larger than or equal to M.

TABLE 3

In another possible implementation manner, the mapping relationship includes some or all of the (u, M, N) triples shown in table 4, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the mapping relationship is not a maximum prime number smaller than or equal to M, or N in at least one (u, M, N) triplet is not a minimum prime number larger than or equal to M.

TABLE 4

Optionally, when the first base sequence is satisfied

The mapping includes some or all of the triples as shown in table 3 or table 4, wherein,

to determine the intermediate value in 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 a first group identifier, u is an integer greater than or equal to 0 and less than X-1, X is a prime number, v is a root number in the group, v is equal to 0 or 1, and j is an imaginary unit. Where q may be referred to as the root index of the base sequence.

Alternatively, when X is 31, u is 0, 1, 2, …, 29.

Alternatively, when X is 61, u is 0, 1, 2, …, 59.

Optionally, when X is 31, the mapping relationship includes the triples shown in table 3 or table 4.

As can be seen from tables 1 to 4, when u has different values, N has different values corresponding to the same value of M. For example, the value of the first length is 36, the value of the first group identifier is 0, and the value of the first parameter is 73, which can be obtained from table 1; the value of the first length is 36, the value of the first group identifier is 1, and the value of the first parameter is 131 as can be obtained from table 1.

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

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

The first sequence is not specifically limited in the embodiment of the present application, for example, the first sequence may satisfy:

wherein r (n) is a first sequence,

for the first base sequence, a is a complex constant, e.g., a is a power control factor, where a is a real number, α is a cyclic shift value, j is an imaginary unit, n is 0, 1, …, M-1, and M is a first length.

The first base sequence is not particularly limited in the embodiments of the present application.

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

the Zadoff-Chu sequence satisfies:

the Wiener sequence satisfies:

the first base sequence satisfies:

For example, as shown in fig. 3, one sequence group includes a plurality of base sequences of different lengths M, where M is {36, …, 78, …, 1632} which is a set of possible values of the length M of the base sequences, and based on the prior art, when the group identifier u is 0, the base sequences are sequences generated based on Zadoff-chu (zc) sequences of N ═ {31, …, 73, …, 1627} by taking the maximum prime number smaller than or equal to M as an example. According to the present invention, a plurality of base sequences of different lengths M are included in one sequence group, the set of the lengths M of the base sequences that can be taken is M ═ {36, … }, for example, the base sequence is a sequence generated based on a ZC sequence, and when the group identifier u is 0, the base sequence of M ═ 36 is a sequence generated based on a ZC sequence of N ═ 73.

In other implementations, the first base sequence may satisfy:

wherein the content of the first and second substances,

Alternatively, when X is 31, u is 0, 1, 2, …, 29.

Alternatively, when X is 61, u is 0, 1, 2, …, 59.

In other implementations, the first base sequence may satisfy:

wherein the content of the first and second substances,

is a first base sequence, M is a first length, N is a first parameterNumber, x_q(m), q and

Alternatively, when X is 31, u is 0, 1, 2, …, 29.

Alternatively, when X is 61, u is 0, 1, 2, …, 59.

For the convenience of understanding, the embodiment of the present application describes the determination process of the first sequence in a step-by-step manner, and it should be understood that the actual determination process of the first sequence is not necessarily performed in a step-by-step manner, for example, no step is performed or other step-by-step manners are adopted. For example, the terminal device may directly determine the first sequence according to the obtained first length M, the first group identifier u, the cyclic shift value, and the root sequence number v.

It should be understood that in some embodiments, the parameters in the above formulas may have other expressions. For example, where u, v are involved in the calculation, r (n) may be represented as r_u,v(n)，

Can be expressed as

In connection with embodiments in the present application, the first sequence may satisfy

It should also be understood that in some embodiments, some parameters in the formula may be determined by other parameters, and the invention is not limited in particular. For example, for some signals, such as SRS, the value of u may be determined from, or otherwise associated with, other parameters.For example, there may be correspondingly different SRS sequences for different values of l ', where l' is an Orthogonal Frequency Division Multiplexing (OFDM) symbol index of SRS resources, and in one embodiment,

the number of consecutive OFDM symbols that can be configured for higher layer signaling. In yet another embodiment, for different ports p_iThere may be an associated cyclic shift α_iValue (alpha)_iMay refer to the alpha value in embodiments of the present invention). In addition, the cyclic shift α is calculated_iWhen the value is equal, some other parameters may be introduced by signaling, e.g. higher layer signaling, or alpha may be determined by receiving different higher layer signaling configurations_iThe value is obtained. For example with alpha_iValue-related δ log₂(K_TC) In which K is_TCThe Comb Value associated with the parameter Comb for Transmission Comb (Transmission Comb). According to the relationship among the above parameters, in combination with the embodiments in the present application, the reference signal sequence for one SRS resource may satisfy:

wherein

Is referred to as r_u,v(n) is α ═ α_iAnd α is_iValue and δ log₂(K_TC) In connection with this, the present invention is,

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

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

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

In some implementations, the first signal may be generated by

steps

2401 and 2402 as shown in fig. 4.

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

The embodiment of the present application does 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 M entries in the first sequence onto consecutive M subcarriers, respectively. As shown in fig. 5, M items included in the first sequence are r (0) -r (M-1), respectively, the terminal device sequentially maps r (0) -r (M-1) to subcarriers s +0 to s + M-1 which are continuously distributed according to the sequence from small to large (or from large to small) of the subcarriers, and one item is mapped to one subcarrier. Wherein s +0 and s + M-1 are the numbers of the subcarriers.

As another example, the terminal device maps M entries in the first sequence to M subcarriers at equal intervals, which may be greater than or equal to 1 subcarrier. Taking the interval as 1 in fig. 6 as an example, as shown in fig. 6, M entries included in the first sequence are r (0) -r (M-1), the terminal device sequentially maps r (0) -r (M-1) to subcarriers s +0, s +2, …, and s +2(M-1) distributed at equal intervals according to the order from small to large (or from large to small), and one entry is mapped to one subcarrier. Wherein 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 of the M point into a time domain signal, and adds a Cyclic Prefix (CP) to the time domain signal to generate a first signal.

Optionally, in step 2402, the terminal device performs Inverse Discrete Fourier Transform (IDFT) on the frequency domain signal of the M point to obtain a corresponding time domain signal.

In step 250, the terminal device transmits a first signal to the network device. Accordingly, the network device receives the first signal transmitted by the terminal device.

Specifically, the terminal device sends the first signal through radio frequency, that is, the terminal device sends the first signal carrying the first sequence on the M subcarriers. The network device receives a first signal sent by the terminal device through radio frequency, that is, the network device receives the first signal carried on the M subcarriers. Optionally, the process of the network device receiving the first signal carried on the M subcarriers is as follows: acquiring a time domain signal and removing a cyclic prefix; then, Discrete Fourier Transform (DFT) is performed on the signal with the cyclic prefix removed, and a frequency domain signal is obtained.

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

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

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

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

Specifically, the signal r' (n) received by the network device on the nth subcarrier of the M subcarriers may be represented as:

r'(n)＝h(n)r(n)+n(n)

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

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

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

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

Compared with the fixed maximum prime number which is less than or equal to the first length or the minimum prime number which is greater than or equal to the first length, in the technical scheme of the embodiment of the application, the communication device can determine the first parameter for determining the first sequence according to the length of the first sequence and the group identifier, so that the first parameter is a value which is related to both the length of the first sequence and the group identifier, not only the length of the first sequence, and thus a more appropriate first parameter can be determined.

The first sequence determined by the scheme of the embodiment of the application ensures that the first signal has a lower PAPR on the premise of ensuring that the cross correlation between the first signal and other uplink reference signals is lower. For example, as shown in fig. 7 and fig. 8, the 30 groups 408 of uplink reference signal sequences determined by the scheme according to the embodiment of the present application have a relatively small cross-correlation change with other uplink reference signal sequences, but the PAPR is significantly reduced, compared to the 30 groups 408 of uplink reference signal sequences determined based on the prior art.

Therefore, compared with the prior art, the first sequence determined in the embodiment of the present application is more suitable, which is helpful for reducing the PAPR of the first sequence, and further can improve the quality of channel estimation.

It is understood that the above method embodiments can be implemented individually or in combination, and the present application is not limited thereto.

It is to be understood that, in order to implement the functions of the above-described embodiments, the communication apparatus includes a corresponding hardware structure and/or software module that performs each function. Those of skill in the art will readily appreciate that the various illustrative elements and method steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is performed as hardware or computer software driven hardware depends on the particular application scenario and design constraints imposed on the solution.

Embodiments of the apparatus of the present application are described below with reference to fig. 9 to 12. The apparatuses may be configured to implement the functions of the terminal device or the network device in the foregoing method embodiment, and therefore, the advantageous effects of the foregoing method embodiment may also be implemented. In the embodiment of the present application, the communication apparatus may be a terminal device or a network device, and may also be a module (e.g., a chip) applied to the terminal device or the network device.

Fig. 9 is a schematic configuration 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 device, and as shown in fig. 9, the communication apparatus 900 includes a processing unit 910 and a transceiving unit 920.

A processing unit 910, configured to obtain a first length of a first sequence and a first group identifier; determining a first parameter according to the first length, the first group of identifiers and a preset mapping relation; determining the first sequence based on the first parameter, wherein the first sequence satisfies

r (n) is the first sequence,

is a first base sequence, each item in the first base sequence belonging to a sequence defined by e^-j2πk/NA determined set of values, N being said first parameter, α being a cyclic shift value and α being a real number, a being a complex constant, j being an imaginary unit, N being 0, 1, …, M-1, M being said first length, k being 0, 1, …, N-1;

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

a transceiving unit 920, configured to transmit the first signal.

Optionally, the processing unit 910 is specifically configured to: mapping M items in the first sequence to continuous M subcarriers respectively; or mapping the M items in the first sequence to M subcarriers with equal intervals respectively.

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

the Zadoff-Chu sequence satisfies:

the Wiener sequence satisfies:

the first base sequence satisfies:

Optionally, the first base sequence satisfies:

or, the first base sequence satisfies:

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

Optionally, the preset mapping relationship includes some or all of the (u, M, N) triples shown in table 1, table 2, table 3, or table 4, and N in at least one (u, M, N) triplet of the (u, M, N) triples included in the preset mapping relationship is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum 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 specific functions and advantages of the processing unit 910 and the transceiver 920, reference may be made to the related description of the method embodiment, and details are not described herein again.

Fig. 10 is a schematic configuration 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 transceiving unit 1020.

A transceiver unit 1020 configured to receive a first signal carried on M subcarriers.

A processing unit 1010 for determining a first sequence, the first sequence satisfying

Wherein r (n) is the first sequence,

is a first base sequence, each item in the first base sequence belonging to a sequence defined by e^-j2πk/NAnd determining a set of values, where a first parameter N is determined according to the first length of the first sequence, the first group identifier, and a preset mapping relationship, a is a cyclic shift value and a is a real number, a is a complex constant, j is an imaginary unit, N is 0, 1, …, M-1, M is the first length, and k is 0, 1, …, N-1.

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

Optionally, the transceiver 1010 is specifically configured to: acquiring the first signal on continuous M subcarriers; alternatively, the first signal is acquired on M subcarriers of equal spacing.

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

the Zadoff-Chu sequence satisfies:

the Wiener sequence satisfies:

wherein x is_q(m) is the Wiener sequence, N is the Wiener sequenceLength, an integer greater than 1; q is a natural number which is prime to N, and q is more than 0 and less than N; m is 0, 1, …, N-1;

the first base sequence satisfies:

Optionally, the first base sequence satisfies:

or, the first base sequence satisfies:

Optionally, the first signal is an uplink reference signal.

Alternatively, the processing unit 1010 may be implemented by a processor. The transceiver unit 1020 may be implemented by a transceiver. For specific functions and advantages of the processing unit 1010 and the transceiver unit 1020, reference may be made to the related description of the method embodiment, and details are not described herein again.

Fig. 11 is a schematic structural diagram of a communication device according to 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 is understood that the interface circuit 1120 may be a transceiver or an input-output interface. Optionally, the communication device 1100 may further include a memory 1130 for storing instructions to be executed by the processor 1110 or for storing input data required by the processor 1110 to execute the instructions or for storing data generated by the processor 1110 after executing the instructions.

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

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

Fig. 12 is a schematic structural diagram of a communication apparatus according to 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 is understood that the interface circuit 1220 may be a transceiver or an input-output interface. Optionally, the communication device 1200 may further include a memory 1230 for storing instructions to be executed by the processor 1210 or for storing input data required by the processor 1210 to execute the instructions or for storing data generated by the processor 1210 after executing the instructions.

When the communication apparatus 1200 is configured to implement the method embodiments, the processor 1210 is configured to perform the functions of the processing unit 1010, and the interface circuit 1220 is configured to perform the functions of the transceiver unit 1020.

When the 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 a radio frequency module or an antenna) in the network equipment, and the information is sent to the network equipment by other network elements; alternatively, the chip sends information to other modules (such as a radio frequency module or an antenna) in the network device, and the information is sent by the network device to other network elements.

Furthermore, an embodiment of the present application also provides a communication apparatus, which includes at least one processor and at least one memory, where the at least one processor is coupled with the at least one memory, and the at least one processor is configured to execute a computer program or instructions stored in the at least one memory, so as to cause the communication apparatus to perform the method in the above-mentioned method embodiments.

It is understood that the Processor in the embodiments of the present Application may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a transistor logic device, a hardware component, or any combination thereof. The general purpose processor may be a microprocessor, but may be any conventional processor.

The method steps in the embodiments of the present application may be implemented by hardware, or may be implemented by software instructions executed by a processor. The software instructions may be comprised of corresponding software modules that may be stored in Random Access Memory (RAM), flash Memory, Read-Only Memory (ROM), Programmable ROM (PROM), Erasable PROM (EPROM), Electrically EPROM (EEPROM), registers, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an ASIC. In addition, the ASIC may reside in a terminal device. Of course, the processor and the storage medium may reside as discrete components in a terminal device.

In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may 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 performed in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, 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 medium 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 medium may be a magnetic medium, such as a floppy disk, a hard disk, a magnetic tape; or an optical medium, such as a DVD; it may also be a semiconductor medium, such as a Solid State Disk (SSD).

In the embodiments of the present application, unless otherwise specified or conflicting with respect to logic, the terms and/or descriptions in different embodiments have consistency and may be mutually cited, and technical features in different embodiments may be combined to form a new embodiment according to their inherent logic relationship.

In the present application, "at least one" means one or more, "a plurality" means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone, wherein A and B can be singular or plural. In the description of the text of the present application, the character "/" generally indicates that the former and latter associated objects are in an "or" relationship; in the formula of the present application, the character "/" indicates that the preceding and following related objects are in a relationship of "division".

It is to be understood that the various numerical references referred to in the embodiments of the present application are merely for descriptive convenience and are not intended to limit the scope of the embodiments of the present application. The sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of the processes should be determined by their functions and inherent logic.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions when actually implementing, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

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

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.

The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A method of transmitting a signal, comprising:

acquiring a first length and a first group of identifications of a first sequence;

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

determining the first sequence based on the first parameter,

wherein the first sequence satisfies

r (n) is the first sequence,

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

and mapping the first sequence to M subcarriers, generating a first signal and transmitting the first signal.

2. The method of claim 1, wherein the mapping the first sequence onto M subcarriers comprises:

mapping M items in the first sequence to continuous M subcarriers respectively; alternatively, the first and second electrodes may be,

and mapping M items in the first sequence to M subcarriers with equal intervals respectively.

3. The method of claim 1 or 2, wherein the first parameter is greater than or equal to a first prime number, wherein the first prime number is a largest prime number that is less than or equal to the first length, or wherein the first prime number is a smallest prime number that is greater than or equal to the first length.

4. The method according to any one of claims 1 to 3, wherein the first motif sequence is a sequence generated based on a Zadoff-Chu sequence or a Wiener sequence,

the Zadoff-Chu sequence satisfies:

the Wiener sequence satisfies:

the first base sequence satisfies:

5. The method according to any one of claims 1 to 4,

the first base sequence satisfies:

x_q(m)＝e^{-jπqm(m+1)/N},m＝0,1,...,N-1

or, the first base sequence satisfies:

6. The method according to any one of claims 1 to 5, wherein in the preset mapping relationship, for a same value of the first length, there are at least two different values of the first parameter corresponding to the values of the first group identifier that are different.

7. The method according to any one of claims 1 to 6, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes that N in at least one (u, M, N) triplet of the (u, M, N) triples is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum 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 some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes that N in at least one (u, M, N) triplet of the (u, M, N) triples is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M:

9. The method according to any one of claims 1 to 6, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes that N in at least one (u, M, N) triplet of the (u, M, N) triples is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M:

10. The method according to any one of claims 1 to 6, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes that N in at least one (u, M, N) triplet of the (u, M, N) triples is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M:

11. The method according to any of claims 1 to 10, wherein the first signal is an uplink reference signal.

12. A method of transmitting a signal, comprising:

receiving a first signal carried on M subcarriers;

determining a first sequence, the first sequence satisfying

Wherein r (n) is the first sequence,

is a first base sequence, each item in the first base sequence belonging to a sequence defined by e^-j2πk/NA determined set of values, where a first parameter N is determined according to a first length of the first sequence, a first group identifier, and a preset mapping relationship, a is a cyclic shift value and a is a real number, a is a complex constant, j is an imaginary unit, N is 0, 1, …, M-1, M is the first length, k is 0, 1, …, N-1;

processing the first signal according to the first sequence.

13. The method of claim 12, wherein receiving the first signal carried on M subcarriers comprises:

acquiring the first signal on continuous M subcarriers; alternatively, the first and second electrodes may be,

the first signal is acquired on M subcarriers at equal intervals.

14. The method of claim 12 or 13, wherein the first parameter is greater than or equal to a first prime number, wherein the first prime number is a largest prime number that is less than or equal to the first length, or wherein the first prime number is a smallest prime number that is greater than or equal to the first length.

15. The method according to any one of claims 12 to 14, wherein the first motif sequence is a sequence generated based on a Zadoff-Chu sequence or a Wiener sequence,

the Zadoff-Chu sequence satisfies:

wherein x is_q(m) is said Zadoff-CA hu sequence; n is the length of the Zadoff-Chu sequence and is an integer greater than 1; q is a natural number which is prime to N, and q is more than 0 and less than N; m is 0, 1, …, N-1;

the Wiener sequence satisfies:

the first base sequence satisfies:

16. The method according to any one of claims 12 to 15,

the first base sequence satisfies:

x_q(m)＝e^{-jπqm(m+1)/N},m＝0,1,...,N-1

or, the first base sequence satisfies:

17. The method according to any one of claims 12 to 16, wherein in the preset mapping relationship, for a same value of the first length, there are at least two different values of the first parameter corresponding to the values of the first group identifier that are different.

18. The method according to any one of claims 12 to 17, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes that N in at least one (u, M, N) triplet of the (u, M, N) triples is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M:

19. The method according to any one of claims 12 to 17, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes that N in at least one (u, M, N) triplet of the (u, M, N) triples is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M:

20. The method according to any one of claims 12 to 17, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes that N in at least one (u, M, N) triplet of the (u, M, N) triples is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M:

21. The method according to any one of claims 12 to 17, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes that N in at least one (u, M, N) triplet of the (u, M, N) triples is not a maximum prime number less than or equal to M, or N in the at least one (u, M, N) triplet is not a minimum prime number greater than or equal to M:

22. The method according to any of claims 12-21, wherein the first signal is an uplink reference signal.

23. A communications apparatus, comprising:

the processing unit is used for acquiring a first length and a first group identification of the first sequence; determining a first parameter according to the first length, the first group of identifiers and a preset mapping relation; determining the first sequence based on the first parameter, wherein the first sequence satisfies

r (n) is the first sequence,

is a first base sequence, each item in the first base sequence belonging to a sequence defined by e^-j2πk/NA determined set of values, N being said first parameter, α being a cyclic shift value and α being a real valueA, a is a complex constant, j is an imaginary unit, M is 0, 1, …, M-1, M is said first length, k is 0, 1, …, N-1;

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

and the transceiving unit is used for transmitting the first signal.

24. The apparatus according to claim 23, wherein the processing unit is specifically configured to:

25. The apparatus of claim 23 or 24, wherein the first parameter is greater than or equal to a first prime number, wherein the first prime number is a largest prime number that is less than or equal to the first length, or wherein the first prime number is a smallest prime number that is greater than or equal to the first length.

26. The apparatus according to any one of claims 23 to 25, wherein the first motif sequence is a sequence generated based on a Zadoff-Chu sequence or a Wiener sequence,

the Zadoff-Chu sequence satisfies:

the Wiener sequence satisfies:

the first base sequence satisfies:

27. The apparatus of any one of claims 23 to 26,

the first base sequence satisfies:

x_q(m)＝e^{-jπqm(m+1)/N},m＝0,1,...,N-1

or, the first base sequence satisfies:

28. The apparatus according to any one of claims 23 to 27, wherein in the preset mapping relationship, for a same value of the first length, there are at least two different values of the first parameter corresponding to the values of the first group identifier that are different.

29. The apparatus according to any one of claims 23 to 28, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes at least one (u, M, N) triplet of the (u, M, N) triples where N is not a maximum prime number less than or equal to M or N is not a minimum prime number greater than or equal to M:

30. The apparatus according to any one of claims 23 to 28, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes at least one (u, M, N) triplet of the (u, M, N) triples where N is not a maximum prime number less than or equal to M or N is not a minimum prime number greater than or equal to M:

31. The apparatus according to any one of claims 23 to 28, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes at least one (u, M, N) triplet of the (u, M, N) triples where N is not a maximum prime number less than or equal to M or N is not a minimum prime number greater than or equal to M:

32. The apparatus according to any one of claims 23 to 28, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes at least one (u, M, N) triplet of the (u, M, N) triples where N is not a maximum prime number less than or equal to M or N is not a minimum prime number greater than or equal to M:

33. The apparatus according to any of claims 23-32, wherein the first signal is an uplink reference signal.

34. A communications apparatus, comprising:

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

a processing unit for determining a first sequence, the first sequence satisfying

Wherein r (n) is the first sequence,

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

35. The apparatus according to claim 34, wherein the transceiver unit is specifically configured to:

the first signal is acquired on M subcarriers at equal intervals.

36. The apparatus of claim 34 or 35, wherein the first parameter is greater than or equal to a first prime number, wherein the first prime number is a largest prime number that is less than or equal to the first length, or wherein the first prime number is a smallest prime number that is greater than or equal to the first length.

37. The apparatus according to any one of claims 34 to 36, wherein the first motif sequence is a sequence generated based on a Zadoff-Chu sequence or a Wiener sequence,

the Zadoff-Chu sequence satisfies:

the Wiener sequence satisfies:

wherein x is_q(m) is the Wiener sequence, N is the length of the Wiener sequence, and is an integer greater than 1; q is a natural number which is prime to N, and q is more than 0 and less than N; m is＝0，1，…，N-1；

The first base sequence satisfies:

38. The apparatus of any one of claims 34 to 37,

the first base sequence satisfies:

x_q(m)＝e^{-jπqm(m+1)/N},m＝0,1,...,N-1

or, the first base sequence satisfies:

39. The apparatus according to any one of claims 34 to 38, wherein in the preset mapping relationship, for a same value of the first length, there are at least two different values of the first parameter corresponding to the values of the first group identifier that are different.

40. The apparatus according to any one of claims 34 to 39, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes at least one (u, M, N) triplet of the (u, M, N) triples in which N is not a maximum prime number less than or equal to M or is not a minimum prime number greater than or equal to M:

41. The apparatus according to any one of claims 34 to 39, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes at least one (u, M, N) triplet of the (u, M, N) triples in which N is not a maximum prime number less than or equal to M or is not a minimum prime number greater than or equal to M:

42. The apparatus according to any one of claims 34 to 39, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes at least one (u, M, N) triplet of the (u, M, N) triples in which N is not a maximum prime number less than or equal to M or is not a minimum prime number greater than or equal to M:

43. The apparatus according to any one of claims 34 to 39, wherein the preset mapping relationship includes some or all of a plurality of (u, M, N) triples shown in the following table, and the preset mapping relationship includes at least one (u, M, N) triplet of the (u, M, N) triples in which N is not a maximum prime number less than or equal to M or is not a minimum prime number greater than or equal to M:

44. The apparatus according to any of claims 34-43, wherein the first signal is an uplink reference signal.

45. A communications apparatus, comprising at least one processor coupled with at least one memory, the at least one processor configured to execute a computer program or instructions stored in the at least one memory to cause the communications apparatus to perform the method of any of claims 1-22.

46. A communications apparatus comprising at least one processor and at least one memory, the at least one processor coupled with the at least one memory, the at least one processor configured to execute computer programs or instructions stored in the at least one memory to cause the communications apparatus to perform the method of any of claims 1-22.

47. The apparatus according to claim 46, wherein at least some of the mappings in the mapping table of any of claims 7 to 10 or 18 to 21 are stored in the at least one memory.

48. A chip comprising logic circuitry and a communication interface, the communication interface being arranged to receive data and/or information to be processed, the logic circuitry being arranged to perform the data and/or information processing of any of claims 1 to 22, and the communication interface being further arranged to output the result of the processing by the logic circuitry.

49. A computer-readable storage medium having stored thereon computer instructions which, when run on a computer, implement the method of any one of claims 1 to 22.