WO2021143529A1 - 信号处理方法、装置、第一通信节点、第二通信节点及存储介质 - Google Patents

信号处理方法、装置、第一通信节点、第二通信节点及存储介质 Download PDF

Info

Publication number
WO2021143529A1
WO2021143529A1 PCT/CN2020/141212 CN2020141212W WO2021143529A1 WO 2021143529 A1 WO2021143529 A1 WO 2021143529A1 CN 2020141212 W CN2020141212 W CN 2020141212W WO 2021143529 A1 WO2021143529 A1 WO 2021143529A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequences
sequence
pilot
signal
sequence set
Prior art date
Application number
PCT/CN2020/141212
Other languages
English (en)
French (fr)
Inventor
李卫敏
袁志锋
李志岗
马一华
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to BR112022014086A priority Critical patent/BR112022014086A2/pt
Priority to EP20914086.2A priority patent/EP4092944A4/en
Priority to US17/792,992 priority patent/US20230063566A1/en
Priority to KR1020227028016A priority patent/KR20220125738A/ko
Publication of WO2021143529A1 publication Critical patent/WO2021143529A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
    • H04L5/0051—Allocation of pilot signals, i.e. of signals known to the receiver of dedicated pilots, i.e. pilots destined for a single user or terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0007—Code type
    • H04J13/004—Orthogonal
    • H04J13/0048—Walsh
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0007—Code type
    • H04J13/0055—ZCZ [zero correlation zone]
    • H04J13/0059—CAZAC [constant-amplitude and zero auto-correlation]
    • H04J13/0062—Zadoff-Chu
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/10—Code generation
    • H04J13/102—Combining codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0078—Avoidance of errors by organising the transmitted data in a format specifically designed to deal with errors, e.g. location
    • H04L1/0083—Formatting with frames or packets; Protocol or part of protocol for error control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2602—Signal structure
    • H04L27/261—Details of reference signals
    • H04L27/2613—Structure of the reference signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0014—Three-dimensional division
    • H04L5/0016—Time-frequency-code
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
    • H04W74/085—Random access procedures, e.g. with 4-step access with collision treatment collision avoidance
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J11/00—Orthogonal multiplex systems, e.g. using WALSH codes
    • H04J11/0023—Interference mitigation or co-ordination
    • H04J11/0026—Interference mitigation or co-ordination of multi-user interference
    • H04J11/0036—Interference mitigation or co-ordination of multi-user interference at the receiver
    • H04J11/004—Interference mitigation or co-ordination of multi-user interference at the receiver using regenerative subtractive interference cancellation
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • This application relates to the field of communications, such as signal processing methods, devices, first communication nodes, second communication nodes, and storage media.
  • the dispatch-free transmission terminal can send data autonomously, without sending dispatch requests and waiting for dynamic dispatch. Therefore, scheduling-free transmission can reduce signaling overhead and transmission delay, and can also reduce terminal power consumption. In addition, scheduling-free transmission can also be combined with non-orthogonal transmission to increase the number of access users.
  • Dispatch-free transmission includes two schemes, which are pre-configured dispatch-free and contention-free dispatch.
  • This application provides signal processing methods, devices, first communication nodes, second communication nodes, and storage media.
  • the embodiment of the present application provides a signal processing method applied to a first communication node, including:
  • N first sequences combine the N first sequences to obtain a second sequence; generate a signal according to the second sequence; where N is an integer greater than or equal to 2.
  • An embodiment of the present application also provides a signal processing method applied to a second communication node, including:
  • Receive a signal from a transmission resource the signal is generated based on a second sequence; detect the signal, and obtain M sequences that generate the signal; wherein, the second sequence is obtained by combining N first sequences , M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.
  • An embodiment of the present application also provides a signal processing device, which is configured in a first communication node, and includes:
  • the obtaining module is set to obtain N first sequences; the merging module is set to merge the N first sequences to obtain a second sequence; the generating module is set to generate a signal according to the second sequence; where N is greater than Or an integer equal to 2.
  • An embodiment of the present application also provides a signal processing device, which is configured in a second communication node, and includes:
  • the receiving module is configured to receive a signal from the transmission resource, and the signal is generated based on a second sequence; the detection module is configured to detect the signal to obtain M sequences that generate the signal; wherein, the second sequence It is obtained by combining N first sequences, where M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.
  • the embodiment of the present application also provides a first communication node, including:
  • One or more processors a storage device for storing one or more programs; when the one or more programs are executed by the one or more processors, the one or more processors are implemented as Any signal processing method applied to the first communication node in the application embodiment.
  • the embodiment of the present application also provides a second communication node, including:
  • One or more processors a storage device for storing one or more programs; when the one or more programs are executed by the one or more processors, the one or more processors are implemented as Any signal processing method applied to the second communication node in the application embodiment.
  • the embodiments of the present application also provide a storage medium, where the storage medium stores a computer program, and the computer program implements any signal processing method in the embodiments of the present application when the computer program is executed by a processor.
  • FIG. 1 is a schematic flowchart of a signal processing method provided by an embodiment of this application
  • Figure 1a is a schematic diagram of the transmission frame structure of a traditional "pilot + data" based contention-free scheduling scheme
  • Figure 1b is a schematic diagram of a transmission frame structure based on a "multi-pilot + data" competition-free scheduling scheme
  • FIG. 1c is a schematic diagram of a time-frequency resource occupied by two pilots according to an embodiment of the application
  • FIG. 1d is a schematic diagram of another time-frequency resource occupied by two pilots according to an embodiment of the application
  • FIG. 1e is a schematic diagram of a time-division multi-pilot provided by an embodiment of this application.
  • FIG. 1f is a schematic diagram of another time-division multi-pilot provided by an embodiment of this application.
  • FIG. 1g is a schematic diagram of frequency division multiple pilots provided by an embodiment of this application.
  • FIG. 1h is a schematic diagram of a time-frequency division multiple pilot frequency provided by an embodiment of this application.
  • FIG. 1i is a schematic diagram of a code division multiple pilot provided by an embodiment of this application.
  • FIG. 1j is a schematic diagram of another code division multiple pilot provided by an embodiment of this application.
  • FIG. 1k is a schematic diagram of generating a non-orthogonal sequence set according to an embodiment of the application
  • FIG. 11 is a schematic diagram of a CDF distribution of sequence cross-correlation values according to an embodiment of the application.
  • FIG. 1m is a schematic diagram of generating another non-orthogonal sequence set according to an embodiment of the application.
  • FIG. 1n is a schematic diagram of generating another non-orthogonal sequence set according to an embodiment of the application.
  • Fig. 1o is a schematic diagram of CDF distribution of another sequence cross-correlation value provided by an embodiment of the application;
  • FIG. 2 is a schematic flowchart of another signal processing method provided by an embodiment of the application.
  • FIG. 3 is a schematic structural diagram of a signal processing device provided by an embodiment of the application.
  • FIG. 4 is a schematic structural diagram of another signal processing device provided by an embodiment of the application.
  • FIG. 5 is a schematic structural diagram of a first communication node provided by an embodiment of this application.
  • Fig. 6 is a schematic structural diagram of a second communication node provided by an embodiment of the application.
  • FIG. 1 is a schematic flowchart of a signal processing method provided by an embodiment of this application.
  • the method can be executed by the signal processing device provided in the present application, which can be implemented by software and/or hardware and integrated on the first communication node, which can be any type of wireless user equipment.
  • a signal processing method provided by the present application includes S110, S120, and S130.
  • N is an integer greater than or equal to 2.
  • Each first sequence may be obtained from the same sequence set, or may be obtained from a different sequence set. Any two sequences in the N first sequences may be different, or T sequences may be the same, where T is an integer greater than or equal to 2, and T is less than or equal to N.
  • Each first sequence may be obtained randomly.
  • N is not limited here. In an example, the value of N includes 2 or 3.
  • the length of the N first sequences is L, and L is an integer greater than or equal to 2.
  • the N first sequences can be combined in this step to obtain the second sequence.
  • the second sequence may be a sequence in the set of non-orthogonal sequences.
  • the method of merging is not limited here.
  • the method of merging includes, but is not limited to, superposition processing or serial combination.
  • the superposition process can be regarded as superimposing the N first sequences, that is, adding them.
  • the series combination includes directly connecting each first sequence in series, that is, the sequence series, or connecting each element in each first sequence in a certain order, that is, the element series, such as extracting the first element of each first sequence when connecting in series, Then extract the second element of each first sequence, and so on, to complete the series combination.
  • this step can process the second sequence to generate a signal.
  • the processing means are not limited, including but not limited to designated processing and mapping to time-frequency resources.
  • the signal can be a reference signal.
  • the signal may be a random access signal.
  • the present application may also transmit the signal on the transmission resource for the second communication node to receive and detect.
  • a signal processing method provided by this application, applied to a first communication node includes: obtaining N first sequences; combining the N first sequences to obtain a second sequence; generating a signal according to the second sequence; wherein , N is an integer greater than or equal to 2. Using this method can effectively reduce the probability of pilot collision, thereby improving the performance of contention-free scheduling.
  • a signal processing method provided in this application can be used to implement multi-pilot transmission.
  • This method first obtains N first sequences, N first sequences can indicate or correspond to N pilots, and then N first sequences are combined to obtain a second sequence, and a signal is generated according to the second sequence, which can realize code division multiple pilot frequency.
  • This method uses N pilots, so that the probability of collisions on all N pilots is low; by using code division multiple pilots, each first sequence can be obtained from a relatively large sequence set, so that each first sequence can be obtained from a relatively large sequence set.
  • the selection space of a sequence is larger, which can reduce the probability of collision on N pilots.
  • a signal processing method provided in this application can be used to implement non-orthogonal pilot transmission.
  • This method first obtains N first sequences, then combines N first sequences to obtain a second sequence, which corresponds to a pilot, and finally generates a signal according to the second sequence.
  • the second sequence can be a sequence in the set of non-orthogonal sequences, so that non-orthogonal pilots can be realized.
  • this method by using non-orthogonal pilots, there are more available pilots, which can reduce the probability of pilot collisions.
  • the combining the N first sequences includes:
  • the N first sequences are superimposed; or, the N first sequences are respectively subjected to designated processing and then superimposed.
  • the combining the N first sequences includes:
  • the N first sequences are combined in series; or, the N first sequences are respectively subjected to designated processing and then combined in series.
  • the combining the N first sequences includes:
  • the N first sequences are respectively mapped to different time-frequency resources; or, the N first sequences are respectively designated and mapped to different time-frequency resources.
  • the generating a signal according to the second sequence includes:
  • the second sequence is mapped to the time-frequency resource and a signal is generated after the specified processing is performed on the second sequence.
  • the designated processing includes one or more of the following:
  • Mask processing scrambling processing, precoding processing, energy adjustment, power adjustment, amplitude adjustment, phase adjustment.
  • the second sequence is a sequence in a non-orthogonal sequence set, and the second sequence corresponds to a pilot.
  • one first sequence corresponds to one pilot.
  • obtaining N first sequences includes one of the following:
  • N first sequences from a sequence set, any two of the N first sequences are different, or there are T sequences that are the same in the N first sequences, where T is greater than or equal to 2 An integer of, and T is less than or equal to N; N first sequences are obtained from different sequence sets; N first sequences are obtained from different subsets of the same sequence set.
  • the sequence set includes one or more of the following: a Hada code sequence set; a sequence set obtained from the Hada code sequence set; a ZC sequence set; and a four-phase sequence set.
  • the N first sequences are obtained randomly.
  • the method further includes: generating data, carrying information in the data, and the information includes one or more of the following:
  • the identification information of the N first sequences The identification information of the N first sequences; the energy information of at least one of the N first sequences; the identification information of the second sequence; the energy information of the second sequence; the first The identification information of the communication node.
  • the identification information of the N first sequences is used to identify the corresponding first sequence
  • the identification information of the second sequence is used to identify the second sequence.
  • the identification information of the first communication node is used to identify the first communication node.
  • the content of each identification information is not limited here, as long as the corresponding content can be identified.
  • the aforementioned identification information includes an index, a serial number, or an identification code.
  • the energy information may be information identifying the energy of the corresponding sequence (such as the first sequence or the second sequence).
  • the content of the energy information is not limited here, as long as the energy of the corresponding sequence can be identified.
  • the aforementioned energy information includes an energy level or an energy ratio.
  • the signal processing method provided in this application can be considered as a reference signal generation method.
  • the signal processing method can be considered as a random access signal generation method.
  • scheduling-free transmission that is, Grant-free transmission
  • the terminal can independently send data without sending scheduling requests and waiting for dynamic scheduling. Therefore, scheduling-free transmission can reduce signaling overhead and transmission delay, and can also reduce terminal power consumption. In addition, scheduling-free transmission can also be combined with non-orthogonal transmission to increase the number of access users.
  • Scheduling-free transmission includes two schemes, namely, pre-configuration (semi-persistent scheduling, or configured grant) scheduling-free and contention-based (contention-based) scheduling-free.
  • pre-configuration and scheduling-free the base station can pre-configure or semi-statically configure time-frequency resources and pilot sequences for each terminal; configuration can ensure that multiple terminals use different time-frequency resources and/or pilot sequences. Therefore, collisions can be avoided to facilitate user identification and detection; the available time-frequency resources are usually periodic, which is more suitable for periodic services. For random burst services, the transmission efficiency is lower and the delay is longer.
  • contention-free scheduling when a terminal has services, it can randomly select time-frequency resources and pilot sequences for competitive access and transmission. Time-frequency resources and pilot sequences used by multiple terminals may collide, and the receiver Need to achieve user identification and detection through more complex or advanced blind detection algorithms; competition-free scheduling is more suitable for random burst services, with better transmission efficiency and lower delay.
  • the contention-free scheduling can be implemented based on the "pilot + data" channel structure, and the base station implements multi-user detection through the pilot.
  • the pilot frequency includes at least a preamble, a reference signal, and so on.
  • Figure 1a is a schematic diagram of the transmission frame structure of a traditional "pilot + data" based contention-free scheduling scheme.
  • one pilot is used in the traditional scheme, and the pilot can be composed of a sequence.
  • the receiver performs user identification and detection through pilots. If two users select different pilots, then both users may be correctly received and detected. When two users select the same pilot frequency, a collision occurs. At this time, the receiver can only identify one user, and only one channel estimation result can be obtained, and the channel estimation result is the sum of the channels of the two users. In this case, if the powers of two user equipment (User Equipment, UE) are equal, it is likely that neither user can be decoded correctly. Due to the limited number of pilots, as the number of users increases, the collision situation will quickly deteriorate, which will affect the number of access users supported by the system.
  • User Equipment User Equipment
  • the present application provides a method for generating a reference signal, which is beneficial to reduce pilot collisions, thereby improving the performance of contention-free scheduling.
  • Fig. 1b is a schematic diagram of the transmission frame structure of a competition-free scheduling scheme based on "multi-pilot + data".
  • the main idea of the multi-pilot scheme is to spend the same resources Design multiple independent or randomly selected pilots.
  • the receiver uses multiple pilots to identify and detect users. If two users collide on pilot 1 and no collision on pilot 2, user identification and detection can still be achieved through pilot 2, and then interference cancellation is performed to improve the detection performance of other users.
  • the collision rate is 1/N.
  • the collision rate of the latter when N is greater than 4, the collision rate of the latter is lower, and as N increases, the collision rate of the latter becomes lower and lower relative to the former.
  • one situation is that multiple pilots occupy different time-frequency resources.
  • Figure 1c is a schematic diagram of a time-frequency resource occupied by two pilots according to an embodiment of the application.
  • the time-frequency resources occupied by the two pilots P1 and P2 occupy the same frequency domain resource position in the frequency domain, and occupy different symbols in the time domain, and the different symbols can be continuous or discontinuous.
  • This situation can be called time division multiple pilot.
  • Figure 1d is a schematic diagram of another time-frequency resource occupied by two pilots according to an embodiment of the application.
  • the time-frequency resources occupied by the two pilots P1 and P2 occupy the same symbol position in the time domain (the two symbols can be continuous or discontinuous), and occupy different frequencies in the frequency domain. Domain resources, and different frequency domain resources can be continuous or discontinuous. This situation can be called frequency division multiple pilots.
  • Fig. 1e is a schematic diagram of time division multiple pilots provided by an embodiment of the application.
  • FIG. 1f is a schematic diagram of another time division multiple pilot frequency provided by an embodiment of the application.
  • the time-frequency resources occupied by the two pilots P1 and P2 occupy different symbols in the time domain, and are randomly selected from the available frequency domain resources in the frequency domain.
  • the same or different frequency domain resource locations may be used.
  • the frequency domain resource contains 12 resource elements (Resource Element, RE), divided into three groups, each group contains 4 REs, and the pilot P1 is randomly selected from the three groups of frequency domain resources in the first symbol.
  • RE resource elements
  • a group of resources is selected, and the pilot P2 randomly selects a group of resources from the three groups of frequency domain resources of the second symbol.
  • the 12 REs in the frequency domain are divided into six groups, each group contains 2 REs, the pilot P1 randomly selects a group of resources from the six groups of frequency domain resources in the first symbol, and the pilot P2 is from the second
  • One group of resources is randomly selected from the six groups of frequency domain resources of each symbol.
  • This structure can also be called a comb structure, and each group of resources is called a comb. Therefore, it can also be considered that a comb is randomly selected for each pilot.
  • FIG. 1g is a schematic diagram of a frequency division multiple pilots provided by an embodiment of the application.
  • the time-frequency resources occupied by the two pilots P1 and P2 occupy the same symbol position in the time domain, and are randomly selected from the available frequency domain resources in the frequency domain.
  • the 12 REs in the frequency domain can be divided into two groups. Each group contains 6 REs, which are used by pilot P1 and pilot P2 respectively. Each group of resources is divided into three subgroups, and each subgroup contains 2 REs.
  • the pilot P1 randomly selects a sub-group resource from the three sub-groups of the first group of resources
  • the pilot P2 randomly selects a sub-group resource from the three sub-groups of the second group of resources.
  • FIG. 1h is a schematic diagram of a time-frequency division multi-pilot provided in an embodiment of the application.
  • the time-frequency resources containing 12 REs in the frequency domain and 2 symbols in the time domain are divided into two groups in the frequency domain, each group containing 6 REs, which are used by pilot P1 and pilot P2 respectively.
  • Each group of resources is divided into time and frequency to obtain six subgroups.
  • Each subframe contains 2 REs in the frequency domain and 1 symbol in the time domain.
  • the pilot P1 is from the six subgroups of the first group of resources.
  • a sub-group resource is randomly selected, and the pilot P2 randomly selects a sub-group resource from the six sub-groups of the second group of resources.
  • the frequency domain resource finally used by each pilot is continuous, but in fact, it may also be discontinuous.
  • the set of pilot sequences may be a set of orthogonal sequences.
  • the set of pilot sequences can be a set of 12 orthogonal Hada code sequences with a length of 12. Choose a pilot sequence with a length of 12.
  • the pilot sequence set can contain 12 REs with a length of A set of 12 orthogonal Hada code sequences.
  • Each pilot selects a pilot sequence with a length of 12 from the set, and then maps it to the corresponding 6 REs in the frequency domain and 2 symbols in the time domain.
  • the pilots of multiple users are code-divided, and collisions will occur when multiple users select the same pilot sequence.
  • each pilot occupies 4 REs in the frequency domain.
  • the pilot sequence set can be a set of 4 orthogonal Hada code sequences with a length of 4.
  • One pilot sequence with a length of 4 is selected from this set.
  • each pilot occupies 2 REs in the frequency domain.
  • the pilot sequence set can be a set of two orthogonal Hada code sequences of length 2, each The pilot selects a pilot sequence of length 2 from this set.
  • each pilot occupies 2 REs in the frequency domain and 2 symbols in the time domain.
  • the pilot sequence set can include 4 orthogonal Hada codes of length 4 Sequence set, each pilot selects a pilot sequence of length 4 from the set, and then maps it to the corresponding 2 REs in the frequency domain and 2 symbols in the time domain.
  • the pilot sequence set may also include a sequence set A and an orthogonal mask set B, where the sequence set A may include two orthogonal Hada code sequence sets of length 2, and the orthogonal mask set B may include two A set of orthogonal Hada code sequences of length 2, randomly select 1 column from sequence set A to get a 2*1 sequence, and randomly select 1 row from orthogonal mask set B to get a 1*2 sequence, then Perform matrix multiplication on the two sequences to obtain a 2*2 matrix, which is used as a pilot and mapped to the corresponding 2 REs in the frequency domain and 2 symbols in the time domain.
  • each pilot occupies 2 REs in the frequency domain and 1 symbol in the time domain.
  • the pilot sequence set can include 2 with a length of A set of 2 orthogonal Hada code sequences, each pilot selects a pilot sequence of length 2 from the set, and then maps it to the corresponding 2 REs in the frequency domain and 1 symbol in the time domain.
  • the pilot set includes candidate (comb) pilot resources and a set of shorter-length orthogonal pilot sequences.
  • This situation can also be equivalent to a long-length sparse orthogonal pilot sequence set, that is, the pilot sequence element at the position corresponding to the pilot resource is the element of the shorter-length orthogonal pilot sequence, and other resources
  • the pilot sequence element at the position is 0, and finally 12 sparse orthogonal sequences with a length of 12 can be obtained.
  • the pilots of multiple users are frequency-divided, or time-frequency-divided, or code-divided.
  • the frequency sequence can be considered as code division.
  • the available pilots in the above examples may also correspond to antenna ports, and each available pilot corresponds to a port.
  • the UE can use multiple sets of pilots (or consider any one of the above-mentioned pilots Px as a set of pilots), and each set of pilots contains multiple pilots, corresponding to multiple pilots. Ports, and these multiple pilots can be randomly selected.
  • a UE can transmit multiple layers of data or multiple data streams.
  • the UE can use multiple sets of pilots.
  • Each set of pilots contains multiple pilots, corresponding to multiple layers of data or multiple data streams, and these multiple pilots
  • the frequency can be randomly selected.
  • each layer of data or each data stream of the UE may be regarded as a virtual UE, and each virtual UE uses multiple pilots according to the above example.
  • the UE may also perform power allocation, or adjust the amplitude of transmitted symbols, and may also perform operations such as phase adjustment and precoding processing.
  • the technical means of merging the N first sequences may be superposition processing.
  • Fig. 1i is a schematic diagram of a code division multiple pilot provided by an embodiment of this application. See Fig. 1i.
  • the time-frequency resources occupied by the two pilots P1 and P2 are the same, and certain distinctions can be made in the code domain. , Which is distinguished by the pilot sequence, this situation can be called code division multiple pilot.
  • Code division multiple pilot frequency can be divided into the following three situations:
  • pilot sequences of multiple pilots respectively come from different pilot sequence sets (ie, sequence sets).
  • the pilot sequences used by the two pilots P1 and P2 are randomly selected from the pilot sequence sets S1 and S2, respectively.
  • pilot sequences of multiple pilots come from the same pilot sequence set, and it is guaranteed that multiple pilot sequences are different. For example, two different pilot sequences are randomly selected from the pilot sequence set S and used as the pilot sequences for the two pilots P1 and P2, respectively.
  • pilot sequences of multiple pilots are from the same pilot sequence set, and the same pilot sequence is allowed to be selected, that is, there may be two or more pilot sequences that are the same.
  • the pilot sequences used by the two pilots P1 and P2 are randomly selected from the pilot sequence set S, and the same pilot sequence may be selected. When two pilots use the same pilot sequence, they can be equivalent to one pilot.
  • Fig. 1j is a schematic diagram of another code division multiple pilot provided by an embodiment of the application. Referring to Figure 1j, assuming that the available pilot resources include 12 REs in the frequency domain and 2 symbols in the time domain, the resources are divided into six groups in the frequency domain, that is, each group of pilot resources (or Each comb resource includes 2 REs in the frequency domain and 2 symbols in the time domain.
  • the set S of pilot sequences used on each set of pilot resources may be a set of four orthogonal Hada code sequences with a length of 4.
  • the pilot sequence set may also include a sequence set A and an orthogonal mask set B, where the sequence set A may include two orthogonal Hada code sequence sets of length 2, and the orthogonal mask set B may include two A set of orthogonal Hada code sequences of length 2.
  • pilot set includes candidate pilot resources and a shorter-length orthogonal pilot sequence set.
  • this situation can also be equivalent to its pilot set being a long-length sparse orthogonal pilot sequence set.
  • pilots may come from different pilot sets, or multiple pilots may come from the same pilot set and ensure that multiple pilots are different, or multiple pilots may come from the same pilot set. Pilot set and any two pilots may be the same.
  • the pilot sequence set S used on each set of pilot resources is divided into two subsets S1 and S2, and the pilot P1 randomly selects a set of pilot resources from the six sets of pilot resources, and then selects from the subset S1 Pilot sequence, pilot P2 randomly selects one set of pilot resources from the six sets of pilot resources, and then selects the pilot sequence from the subset S2.
  • pilot P1 and pilot P2 may be the same. If they are the same, you can wait The price is then a pilot.
  • the total energy is evenly distributed among multiple pilots, that is, the energy of multiple pilots is the same.
  • the total energy is non-uniformly distributed on multiple pilots, that is, the energy of multiple pilots can be different.
  • the total energy is divided into multiple energy levels, the energy indicated by each energy level is equal or unequal, multiple pilots randomly select one of the energy levels, and the energy level indexes of multiple pilots are different from each other to ensure that the total energy is not the same. Change, or equal to or not exceed the preset total energy.
  • one of the multiple energy levels can be 0, which is equivalent to not sending the pilot, and the saved energy can be used to send other pilots. For the case where the UE uses 2 pilots, if the energy of one pilot is not 0 and the energy of 1 pilot is 0, it is equivalent to that the UE actually uses 1 pilot.
  • the UE may carry the energy distribution related information of multiple pilots in the data payload (Payload) sent by the UE. For example, carrying the energy allocation indication of each pilot among multiple pilots; or carrying the energy level index of one of the multiple pilots.
  • the multiple energy levels can be in sequence among the multiple pilots. Recycling, then, after determining the energy level index of one of the pilots, the energy levels of the other pilots can be determined in sequence.
  • energy can also be allocated among multiple pilots, and the total energy is evenly allocated or non-uniformly allocated on the multiple pilots.
  • time division multiple pilots due to power control, in some cases (for example, the UE reaches the maximum transmit power), the energy of multiple pilots should be the same.
  • the energy distribution described here can be implemented through operations such as power distribution, power control, amplitude adjustment, and energy normalization.
  • the UE first obtains multiple pilot sequences, and then superimposes the multiple pilot sequences. After the superposition processing is obtained, Then, the pilot or reference signal is generated according to the sequence after the superposition processing for transmission.
  • the UE can first The energies of the two pilot sequences C1 and C2 are adjusted, and then the superposition processing is performed to obtain the sequence C after the superposition processing. For example, assuming that the lengths of the pilot sequences C1 and C2 are both L, and the element energy is normalized to 1, then the total energy of the two sequences is L. After adjusting the energy of the two pilot sequences C1 and C2 Can be obtained separately and Then, the sequence C after superposition processing can be The total energy of sequence C obtained after such superposition processing is still L.
  • the total target energy of each pilot sequence can be E/2, After adjusting the energy of the two pilot sequences C1 and C2, they can be obtained respectively and Then, the sequence C after superposition processing can be The total energy of sequence C obtained after such superposition processing is E.
  • the sequence C can be normalized to obtain the sequence D, and then the pilot or reference signal can be generated according to the sequence D, for example Among them, assuming that C is a sequence of L*1, () * represents a conjugate transpose. According to C * C, the total energy of sequence C can be obtained. The purpose of this processing is to ensure that the total energy of the pilot is unchanged, or equal or not exceeding The preset total energy E is especially for the case where the two pilot sequences of a UE are the same.
  • the UE for code division multiple pilots, from a UE's transmitting end, the UE first obtains multiple pilots, and then superimposes the multiple pilots to obtain the superimposed pilots. Then, the reference signal is generated according to the pilot frequency after superposition processing for transmission.
  • the UE may first adjust the energy of the two pilots P1 and P2, and then perform superposition processing to obtain the pilot P after the superposition processing. For example, suppose that the pilot sequence used by pilot P1 is C1, the pilot sequence used by pilot P2 is C2, the length of both sequences is L, and the element energy is normalized to 1, the total energy of the pilot target Is E, then the total target energy of each pilot can be E/2, and the energy of the pilot sequence used by the two pilots P1 and P2 can be adjusted respectively.
  • the energy-adjusted pilot sequences used by the pilots P1 and P2 can be mapped to their respective time-frequency resources. Since the pilot sequence used by a pilot will be mapped to the time-frequency resource used by the pilot, and the position of other time-frequency resources not used by the pilot can be equivalently regarded as carrying 0 elements, when two pilots When the time-frequency resources used are different, the pilot sequences are respectively mapped to their respective time-frequency resources, which is equivalent to performing superposition processing.
  • the pilot sequences used by the two pilots P1 and P2 can be adjusted for energy and then superimposed to obtain Then the sequence C is mapped to the corresponding time-frequency resource for generating the reference signal.
  • any two pilots may be the same.
  • the two pilots P1 and P2 of the UE are the same, the time-frequency resources and pilot sequences used by the UE are the same.
  • the sequence obtained after superposition of this pair can also be used.
  • C The method of energy adjustment.
  • the set can be a set S containing 24 orthogonal Haada code sequences with a length of 24. Take the use of 2 pilots as an example. If the pilot sequences of the two pilots of a UE come from two sets S1 and S2, for example, set S1 contains half of the sequence of set S, and set S2 contains the other half of the sequence of set S, that is, sets S1 and S2 S2 respectively contains 12 sequences with a length of 24.
  • the probability of collision of the two pilots of the two UEs is 1/144.
  • the collision probability is the same as that of the time division/frequency division multiple pilot frequency.
  • the energy normalization factor is When the pilot sequences used by the two pilots are the same, the energy normalization factor is 1/2. It can be seen that the energy normalization factor is not unique. This has a certain impact on the receiver's reception detection. When the receiver performs blind detection through two pilots, it does not know the pilot sequence selected by the UE and cannot use the corresponding energy normalization factor.
  • the energy normalization factor can be used uniformly
  • the pilot sequences of the two pilots are from two sets S1 and S2 respectively, or the pilot sequences of the two pilots are both from the set S and it is guaranteed that the two pilot sequences are different, then There is no such problem, the energy normalization factor can be used uniformly
  • the pilot set contains candidate pilot resources and a shorter-length orthogonal pilot sequence set.
  • the collision situation and energy normalization problem can be similarly analyzed.
  • the energy normalization factor may be It is different, but the principle is similar.
  • the technical means of merging the N first sequences may be combined processing.
  • the terminal first obtains two sequences (ie, the first sequence). Including, the terminal randomly selects two sequences C1 and C2 from the sequence set A, where the sequence set A includes 12 orthogonal sequences with a length of 12. Then, the sequences C1 and C2 are a sequence of length 12 respectively.
  • the terminal combines (for example, concatenates) the two sequences C1 and C2 to obtain a sequence C (that is, the second sequence) with a length of 24.
  • a sequence set A includes 12 orthogonal sequences of length 12, two sequences are arbitrarily selected from them, and then combined to obtain a sequence of length 24, then a total of 144 sequences of length 24 can be obtained.
  • a sequence set B can be obtained, and the sequence set B includes 144 sequences with a length of 24.
  • the sequence set B is a non-orthogonal sequence set.
  • Fig. 1k is a schematic diagram of generating a non-orthogonal sequence set provided by an embodiment of the application. As shown in Figure 1k. Then, it can be considered that the sequence C (ie, the second sequence) obtained by the combination comes from the set B of non-orthogonal sequences.
  • the terminal generates the reference signal according to the obtained sequence C, including: mapping the sequence C to the time-frequency resource used by the pilot to generate the reference signal; or, after performing the designated processing, the sequence C is mapped to the time-frequency resource for the pilot.
  • the specified processing includes at least one of the following: energy normalization, energy adjustment, power adjustment, amplitude adjustment, phase adjustment, precoding processing, scrambling processing, etc.
  • Table 1 is a set table of a sequence set A, and the sequence set A may be a set of 12 orthogonal Hada code sequences, as shown in Table 1. According to the above description of this embodiment, for the sequence set A shown in Table 1, a set B containing 144 non-orthogonal sequences with a length of 24 can be constructed.
  • Table 1 A collection table of sequence collection A
  • Figure 11 is a schematic diagram of the CDF distribution of a sequence cross-correlation value provided by an embodiment of the application. Referring to Figure 11, based on the cumulative distribution function (Cumulative Distribution Function, CDF) and the cross-correlation value, it can be seen that about 85% of the sequence cross-correlation The value is 0, and the cross-correlation value of about 15% of the sequence is 0.5.
  • CDF Cumulative Distribution Function
  • Table 2 is a set table of another sequence set A.
  • the sequence set A can also be the sequence set shown in Table 2.
  • the sequence set also contains 12 orthogonal sequences of length 12. Each sequence is sparse and can be regarded as a comb resource containing 3 combs.
  • the structure and the combination of 4 sets of orthogonal Haada codes with length 4 are included.
  • a non-orthogonal sequence set B with a length of 24 can also be constructed, and the cross-correlation characteristics between the respective sequences are the same as those shown in Figure 11 above.
  • the characteristics shown are the same, that is, the cross-correlation characteristics of the non-orthogonal sequence set B formed based on the sequence set A shown in Table 1 are the same.
  • the sequence set A can also be other orthogonal sequence sets or non-orthogonal sequence sets, for example, it is composed of a comb-like resource structure including 6 combs and a combination of 2 orthogonal Hada code sequence sets of length 2
  • the sequence set of; or, the ZC (Zadoff-Chu) sequence set; or, the four-phase sequence set for example, the sequence elements come from the set ⁇ 1+1i,-1+1i,-1-1i,1-1i ⁇ or ⁇ 1,1i,-1,-1i ⁇ , you can see that the candidate sequence element has 4 phase values, so it can be called a four-phase sequence set.
  • a non-orthogonal sequence set with a larger number of sequences can be obtained, and the non-orthogonal sequence set has good sequence structure characteristics and cross-correlation characteristics.
  • the pilot sequence used by each UE is equivalent to the non-orthogonal sequence set, that is to say, the pilot sequence used by each UE is non-orthogonal, and the collision probability is Lower.
  • the receiver can use the non-orthogonal sequence set and its sequence structure characteristics for receiving detection.
  • the total time-frequency resource overhead occupied by the pilot is 24 REs.
  • the terminal first obtains two sequences (ie, the first sequence). Including, the terminal randomly selects a sequence C1 from the sequence set A1, and the terminal randomly selects a sequence C2 from the sequence set A2.
  • sequence set A1 and the sequence set A2 are from the sequence set A, and contain half of the sequence and the other half of the sequence set A, respectively.
  • sequence set A includes 24 orthogonal sequences with a length of 24
  • sequence set A1 is a sequence set composed of the first 12 sequences in sequence set A
  • sequence set A2 is composed of the last 12 sequences in sequence set A The sequence collection.
  • the sequence set A1 includes 12 orthogonal sequences with a length of 24
  • the sequence set A2 also includes 12 orthogonal sequences with a length of 24.
  • the sequences C1 and C2 are each a sequence of length 24.
  • sequence set A1 and the sequence set A2 respectively contain one half of the sequence and the other half of the sequence set A, and are not limited to the first half of the sequence and the second half of the sequence of the sequence set A, and can be any half of the sequence and the other half of the sequence. sequence.
  • sequence set A1 and the sequence set A2 are from the sequence set A, and the sequence set A1 and the sequence set A2 may also be two independent sequence sets.
  • the terminal superimposes the two sequences C1 and C2 to obtain a sequence C (that is, the second sequence) with a length of 24. Since the sequence set A1 includes 12 orthogonal sequences with a length of 24, the sequence set A2 also contains 12 orthogonal sequences with a length of 24. Choose 1 sequence randomly from the sequence set A1 and the sequence set A2, and then add them together to get A sequence of length 24, then a total of 144 sequences of length 24 can be obtained. In other words, a sequence set B can be obtained, and the sequence set B includes 144 sequences with a length of 24. Moreover, the sequence set B is a non-orthogonal sequence set.
  • Fig. 1m is a schematic diagram of generating another non-orthogonal sequence set provided by an embodiment of the application. As shown in Figure 1m, it can be considered that the sequence C comes from the sequence set B.
  • the terminal generates a reference signal according to the obtained sequence C (ie, the second sequence), including: mapping sequence C to time-frequency resources for pilots to generate reference signals; or, mapping sequence C to the The time-frequency resources used by the pilot are used to generate reference signals, where the specified processing includes at least one of the following: energy normalization, energy adjustment, power adjustment, amplitude adjustment, phase adjustment, precoding processing, scrambling code Processing etc.
  • Table 3 is a set table of another sequence set A provided by this application.
  • the sequence set A may be a set of 24 orthogonal Hada code sequences with a length of 24.
  • the sequence set A1 may include the first 12 sequences in the sequence set A
  • the sequence set A2 may include the last 12 sequences in the sequence set A.
  • it can be constructed A set B containing 144 non-orthogonal sequences with a length of 24 is generated, and the cross-correlation characteristics between the sequences in the sequence set B are the same as the characteristics shown in FIG. 11 above.
  • Table 4 is another set of sequence set A provided by this application.
  • Sequence set A can also be a sequence set as shown in Table 4.
  • the sequence set also contains 24 positives with a length of 24.
  • the intersection sequence, each sequence is sparse, and can be regarded as a comb-like resource structure containing 3 combs and a combination of 8 orthogonal Hada code sequence sets with a length of 8.
  • the sequence set A1 may include the first 12 sequences in the sequence set A
  • the sequence set A2 may include the last 12 sequences in the sequence set A.
  • sequence set A1 and the sequence set A2 it can be constructed A set B of 144 non-orthogonal sequences with a length of 24 is obtained, and the cross-correlation characteristics between the sequences in the sequence set B are also the same as the characteristics shown in FIG. 11 above.
  • a non-orthogonal sequence set with a larger number of sequences can be obtained, and the non-orthogonal sequence set has good sequence structure characteristics and cross-correlation characteristics.
  • the pilot sequence used by each UE is equivalent to the non-orthogonal sequence set, that is to say, the pilot sequence used by each UE is non-orthogonal, and the collision probability is Lower.
  • the receiver can use the non-orthogonal sequence set and its sequence structure characteristics for receiving detection.
  • any sequence in the sequence set A1 can be combined with any sequence in the sequence set A2 to obtain a sequence set B
  • the sequence set B includes 144 sequences with a length of 48.
  • the sequence set B is a non-orthogonal sequence set.
  • FIG. 1n is a schematic diagram of generating another non-orthogonal sequence set provided by an embodiment of the application. Referring to Figure 1n, non-orthogonal sequence set B can be obtained by combining sequence set A1 and sequence combination A2.
  • the sequence set A may be a set of 24 orthogonal Hada code sequences with a length of 24, as shown in Table 3.
  • the sequence set A1 can contain the first 12 sequences in the sequence set A
  • the sequence set A2 can contain the last 12 sequences in the sequence set A.
  • a sequence containing 144 lengths can be constructed. It is a non-orthogonal sequence set B of 48, and the cross-correlation characteristics between the sequences in the sequence set B are the same as the characteristics shown in FIG. 11 above.
  • the sequence set A may also be a sequence set as shown in Table 4, and the sequence set also includes 24 orthogonal sequences with a length of 24. Then, the sequence set A1 can contain the first 12 sequences in the sequence set A, and the sequence set A2 can contain the last 12 sequences in the sequence set A. According to the sequence set A1 and the sequence set A2, a sequence containing 144 lengths can be constructed. It is a set B of 48 non-orthogonal sequences, and the cross-correlation characteristics between the sequences in the sequence set B are also the same as the characteristics shown in FIG. 11 above.
  • the total time-frequency resource overhead occupied by the pilot is 24 REs.
  • the terminal (UE) first obtains two sequences (ie, the first sequence) C1 and C2.
  • the sequence C1 is composed of a sequence X1 and a sequence Y1
  • the sequence C2 is composed of a sequence X2 and a sequence Y2.
  • the sequence X1 and the sequence X2 are from the sequence collection X
  • the sequence Y1 and the sequence Y2 are from the sequence collection Y.
  • sequence set X includes 12 orthogonal sequences of length 12
  • sequence set Y includes 2 orthogonal sequences of length 2
  • the first sequence in sequence set Y is used as sequence Y1 to obtain sequence C1
  • the second sequence in the sequence set Y is used as the sequence Y2 to obtain the sequence C2.
  • the terminal obtains two sequences C1 and C2, including: randomly selecting a sequence from the sequence set X as the sequence X1, obtaining the first sequence Y1 in the sequence set Y, and obtaining the sequence C1 according to the sequence X1 and the sequence Y1.
  • the sequence X1 is a sequence of length 12, which can be expressed as a vector of 12*
  • the sequence Y1 is a sequence of length 2, which can be expressed as a vector of 1*2.
  • the sequence X1 and the sequence Y1 are subjected to matrix multiplication operations to obtain A 12*2 matrix can be converted into a sequence of length 24 as sequence C1.
  • the sequence C2 can be obtained.
  • the sequences C1 and C2 are a sequence of length 24 respectively.
  • sequence Y1 and the sequence Y2 may be referred to as orthogonal masks, and the sequence set Y may be referred to as an orthogonal mask set.
  • a new sequence set A1 can be obtained, which is equivalent to 12 sequences with a length of 24 Orthogonal sequence, in the same way, operate each sequence in the sequence set X with the second sequence Y2 in the sequence set Y, and a new sequence set A2 can be obtained.
  • the sequence set also contains 12 sequences with a length of 24. Orthogonal sequence. Then, it can be equivalently considered that the sequence C1 comes from the sequence set A1, and the sequence C2 comes from the sequence set A2.
  • sequence set A by performing operations on any sequence in the sequence set X and any sequence in the sequence set Y, a sequence with a length of 24 can be obtained, and a total of 24 orthogonal sequences with a length of 24 can be obtained.
  • These 24 sequences can constitute sequence set A.
  • sequence set A1 and sequence set A2 can be regarded as derived from the sequence set A, and contain half of the sequence and the other half of the sequence set A, respectively.
  • the terminal when the terminal obtains two sequences C1 and C2, it can also randomly select a sequence from half of the sequence set X as sequence X1, and randomly select a sequence from sequence set Y as sequence Y1, according to the sequence X1 and Sequence Y1 obtains sequence C1; in the same way, randomly select a sequence from the other half of sequence set X as sequence X2, randomly select a sequence from sequence set Y as sequence Y2, and obtain sequence C2 according to sequence X2 and sequence Y2.
  • the terminal superimposes the two sequences C1 and C2 to obtain a sequence C (that is, the second sequence) with a length of 24.
  • a sequence set B can be obtained, and the sequence set B includes 144 sequences with a length of 24.
  • the sequence set B is a non-orthogonal sequence set. Then, it can be considered that the sequence C comes from the sequence set B.
  • the terminal generates the reference signal according to the obtained sequence C, including: mapping the sequence C to the time-frequency resource used by the pilot to generate the reference signal; or, after performing the designated processing, the sequence C is mapped to the time-frequency resource for the pilot.
  • the specified processing includes at least one of the following: energy normalization, energy adjustment, power adjustment, amplitude adjustment, phase adjustment, precoding processing, scrambling processing, etc.
  • sequence set X may be a set of 12 orthogonal Haada codes with a length of 12 as shown in Table 1, or may be a set of 12 orthogonal sequences with a length of 12 as shown in Table 2.
  • Table 5 is a collection table of sequence collection Y, and sequence collection Y is shown in Table 5.
  • sequence set A1 and sequence set A2 respectively contain 12 sequences of length 24. Then, according to sequence set A1 and sequence set A2, a non-orthogonal sequence containing 144 lengths of 24 can be constructed.
  • Set B, and the cross-correlation characteristics between the sequences in the sequence set B are the same as the characteristics of FIG. 11 described above.
  • any sequence in the sequence set A1 and any sequence in the sequence set A2 can be combined to obtain a sequence set B,
  • the sequence set B includes 144 sequences with a length of 48.
  • the sequence set B is a non-orthogonal sequence set.
  • the sequence set X may be a set of 12 orthogonal Haada codes with a length of 12 as shown in Table 1, or may be a set of 12 orthogonal sequences with a length of 12 as shown in Table 2.
  • the sequence set Y is shown in Table 5.
  • the equivalent sequence set A1 and sequence set A2 can be obtained according to the sequence set X and the sequence set Y, which respectively contain 12 sequences with a length of 24.
  • the sequence sets A1 and The sequence set A2 can construct a set B containing 144 non-orthogonal sequences with a length of 48, and the cross-correlation characteristics between the sequences in the sequence set B are the same as those shown in FIG. 11 above.
  • the total time-frequency resource overhead occupied by the pilot is 48 REs.
  • the terminal first obtains two sequences (ie, the first sequence). Including, the terminal randomly selects two sequences C1 and C2 from the sequence set A, where the sequence set A includes 24 orthogonal sequences with a length of 24. Then, the sequences C1 and C2 are a sequence of length 24 respectively.
  • the terminal combines (for example, concatenates) the two sequences C1 and C2 to obtain a sequence C with a length of 48. Since the sequence set A includes 24 orthogonal sequences with a length of 24, two sequences are arbitrarily selected from them, and then combined to obtain a sequence with a length of 48, then a total of 576 sequences with a length of 48 can be obtained. In other words, a sequence set B can be obtained, and the sequence set B includes 576 sequences with a length of 48. Moreover, the sequence set B is a non-orthogonal sequence set. Then, it can be considered that the sequence C comes from the sequence set B.
  • the terminal generates a reference signal according to the obtained sequence C (ie, the second sequence), including: mapping sequence C to time-frequency resources for pilots to generate reference signals; or, mapping sequence C to the The time-frequency resources used by the pilot are used to generate reference signals, where the specified processing includes at least one of the following: energy normalization, energy adjustment, power adjustment, amplitude adjustment, phase adjustment, precoding processing, scrambling code Processing etc.
  • the sequence set A may be a set of 24 orthogonal Hada code sequences with a length of 24, as shown in Table 3.
  • the sequence set A shown in Table 3 can be constructed A set B containing 576 non-orthogonal sequences with a length of 48 is drawn.
  • Fig. 1o is a schematic diagram of the CDF distribution of another sequence cross-correlation value provided in an embodiment of the application.
  • the CDF distribution of the cross-correlation value between each sequence is as As shown in Figure 1o, it can be seen that 92% of the sequences have a cross-correlation value of 0, and 8% of the sequences have a cross-correlation value of 0.5.
  • the sequence set A may also be the sequence set shown in Table 4, and the sequence set also includes 24 orthogonal sequences with a length of 24.
  • the sequence set A shown in Table 4 a set B containing 576 non-orthogonal sequences with a length of 48 can also be constructed, and the sequence set B has an interval between each sequence.
  • the cross-correlation feature is the same as that shown in Figure 1o.
  • the signal processing method provided in this application may include the following steps:
  • Acquiring multiple sequences ie acquiring N first sequences); performing superposition processing or combining processing on the multiple sequences to obtain a processed sequence (ie, a second sequence); generating a reference signal according to the processed sequence; Sending the reference signal.
  • the multiple sequences represent multiple pilots; or, the multiple sequences are sequences used by multiple pilots, respectively.
  • the multiple sequences are from a sequence set, and any two of the sequences are allowed to be the same; or, the multiple sequences are from a sequence set, and the multiple sequences are different from each other; or, the multiple sequences are respectively Come from multiple sequence sets; or, the multiple sequences are from multiple sub-sequence sets of a sequence set, or multiple sequences are generated according to a preset rule.
  • the multiple sequences are randomly selected or randomly generated.
  • Performing superposition processing on the multiple sequences includes:
  • the multiple sequences are superimposed, or the multiple sequences are respectively subjected to designated processing and then superimposed; or, the multiple sequences are mapped to different time-frequency resources, or the multiple sequences are separately performed After designated processing, it is mapped to different time-frequency resources to realize equivalent superposition processing.
  • Combining the multiple sequences includes:
  • the multiple sequences are combined in series, or the multiple sequences are respectively subjected to specified processing and then combined in series; or, the elements of the multiple sequences are combined in a specified order, or the multiple sequences are combined separately Specify the processed elements to be combined in the specified order.
  • the order of designation is not limited.
  • Generating a reference signal according to the processed sequence includes:
  • the specified processing includes at least one of the following: mask processing, scrambling processing, precoding processing, energy normalization, energy adjustment, power adjustment, amplitude adjustment, and phase adjustment.
  • the energy of the multiple sequences is the same, or the multiple sequences adopt different energy levels or energy ratios.
  • the signal processing method further includes: generating data, carrying information in the data, and the information includes one or more of the following: identification information of the plurality of sequences or pilots; Energy information, or energy information of one of the multiple sequences or pilots or pilots; identification information of the processed sequence; energy information of the processed sequence; identity of the first communication node Identification information, or part of the identification information of the first communication node.
  • FIG. 2 is a schematic flowchart of another signal processing method provided by an embodiment of the present application.
  • the method may be executed by the signal processing device provided in the present application, and the signal processing device may be implemented by software and/or hardware and integrated on the second communication node, which may be a base station.
  • the signal processing method provided by this application includes S210 and S220.
  • S210 Receive a signal from a transmission resource, where the signal is generated based on the second sequence.
  • the signal is generated based on the method shown in FIG. 1.
  • This application receives signals from transmission resources to detect the signals.
  • S220 Detect the signal to obtain M sequences that generate the signal, where the second sequence is obtained by combining N first sequences, where M is an integer greater than or equal to 1, and N is greater than or equal to 2. Integer.
  • the step of detecting the signal may include acquiring the received pilot symbols from the transmission resource of the signal, and then detecting the acquired pilot symbols, and identifying M sequences used by the first communication node.
  • M first sequences may be obtained.
  • the M sequences may be one second sequence.
  • the non-orthogonal sequence set to which the second sequence belongs can be determined based on the sequence set to which the N first sequences belong.
  • determination method refer to the technical method for determining the sequence set B on the side of the first communication node, which will not be repeated here.
  • M first sequences can be obtained.
  • the size relationship between M and N is not limited here, and it can be determined based on the number of first communication nodes.
  • the N first sequences it uses may all be detected, or part of the first sequences may be detected, that is, M is less than or equal to N.
  • the first sequence detected by the receiver includes multiple UEs, that is to say, M sequences corresponding to each UE can be obtained, then, on the whole, the first sequence detected by the receiver
  • the number of sequences can be greater than N. In the case of multiple UEs, the number of sequences corresponding to each UE detected by the receiver may be different.
  • the M sequences may be one second sequence. This is for each UE. If there are multiple UEs, the second sequence obtained by the receiver through detection includes multiple UEs, that is to say, the second sequence corresponding to each UE can be obtained. Then, as a whole, the receiver can detect multiple first sequences. Two sequence.
  • This application provides a signal processing method applied to a second communication node, including: receiving a signal from a transmission resource, the signal being generated based on a second sequence; detecting the signal, and obtaining M signals that generate the signal Sequence; wherein, the second sequence is obtained by combining N first sequences, M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.
  • This method performs reception detection according to the characteristics of multiple pilots or non-orthogonal pilots, and better transmission performance can be obtained.
  • the detecting the signal to obtain M sequences for generating the signal includes:
  • the signal is detected based on the sequence set to which the N first sequences belong, and M sequences for generating the signal are obtained, and the M sequences include M first sequences.
  • the second communication node may pre-store N sequence sets described in the first sequence, and when detecting a signal, the signal may be blindly detected based on the sequence sets described in the N first sequence.
  • the first communication node and the second communication node may pre-appoint a manner for acquiring the first sequence, so that the second communication node can detect the signal based on the sequence set to which the N first sequences belong.
  • the detecting the signal to obtain M sequences for generating the signal includes:
  • the signal is detected based on the non-orthogonal sequence set to which the second sequence belongs, and M sequences that generate the signal are obtained.
  • the M sequences include a second sequence, and the non-orthogonal sequence set is based on all The sequence set to which the N first sequences belong is determined.
  • the second communication node may perform blind detection on the signal based on the non-orthogonal sequence set to which the second sequence belongs to obtain a second sequence.
  • the technical means for determining the set of non-orthogonal sequences can be referred to the technical means for determining the sequence set B by the first communication node, which will not be repeated here.
  • the method further includes:
  • This application may perform channel estimation based on M sequences, so as to perform reception detection on the received data symbols.
  • the method further includes: obtaining information from the detection result, the information including one or more of the following:
  • the identification information of the N first sequences The identification information of the N first sequences; the energy information of at least one of the N first sequences; the identification information of the second sequence; the energy information of the second sequence; the first communication node Identification information.
  • the receiver first obtains the received pilot symbols from the reference signal transmission resource, and then detects the obtained pilot symbols to identify multiple pilot sequences used by the transmitter ( That is, all or part of the N first sequences).
  • the receiver detects the pilot P1 and recognizes that the transmitter uses the pilot P1 And perform channel estimation, and then detect the received data symbols; the receiver also detects the pilot P2, identifies the pilot sequence used by the transmitter on the pilot P2, and performs channel estimation, Then the received data symbols are detected.
  • the receiver's detection process for the pilot P1 and the pilot P2 can be executed in parallel or serially. In an embodiment, the reception detection can be combined with interference cancellation. When parallel processing is used, it is possible to detect the successful decoding of the same UE through pilot P1 and pilot P2.
  • the pilot symbols and data of the UE is subjected to interference cancellation, and then the next round of iterative detection is performed, that is, the received symbol updated after interference cancellation is used to perform reception detection again through the pilot P1 and the pilot P2.
  • the pilot symbols and data symbols of the UE can be reconstructed and interference eliminated, and then pilot P2 can continue to be performed on other UEs Receiving detection and interference cancellation, and then starting the next round of iterative detection, that is, re-receiving detection through pilot P1 and pilot P2 in turn. Iterate in this way until the user cannot be identified and detected, or until the specified number of iterations is reached.
  • the identification information of the first communication node can be carried in the data payload, such as UE identifier (ID) information or partial information of the UE ID. After the UE's data is successfully detected and decoded, it can be known which UE's data was successfully received. In addition, in order to ensure the identification and detection performance of other UEs, it is also necessary to eliminate the interference of the pilot symbols. Since each transmitter uses multiple independent or random pilots, the receiver does not know which UE transmitter uses. The information of multiple pilots can carry multiple pilot information in the data payload, including identification information used to identify pilots such as pilot composition information or pilot index information, and pilot energy information.
  • the channel estimation results based on pilots can be used for interference cancellation.
  • all users with correct decoding can also be used
  • the reconstructed transmitted symbols are based on the least square algorithm for channel estimation to obtain an updated channel estimation result, and interference cancellation is performed based on the updated channel estimation result.
  • the receiver processing procedure can be the same as the above Describe a similar process. If the two pilots of a UE come from the same set, then when the receiver detects the received pilot symbols, it may recognize the two pilots of a UE at the same time, and cannot distinguish between pilot P1 and pilot. Frequency P2. At this time, the receiver processing process is actually similar to the receiver processing process of the traditional solution. The difference is that in this solution, one UE uses 2 pilots. Although the pilots of different UEs may collide, the collision probability is reduced. , The receiver will detect and identify relatively more pilots, and the receiver will receive and detect the data symbols based on these pilots to obtain better transmission performance.
  • the M sequences obtained by detecting the signal may be a second sequence, that is, a joint pilot sequence.
  • the receiver first obtains the received pilot symbols from the reference signal transmission resources, and then detects the obtained pilot symbols to identify the joint pilot sequence used by the transmitter.
  • the receiver can construct a non-orthogonal sequence set B in a similar manner to the transmitter, use each sequence in the sequence set B to perform blind detection on the obtained pilot symbols, identify the joint pilot sequence used by the transmitter, and then The received data symbols are detected according to the identified joint pilot sequence.
  • joint pilot sequence When performing joint pilot identification or user identification, use the constructed non-orthogonal pilot sequence set B to perform blind detection, and through correlation detection, obtain the joint pilot sequences whose correlation value is greater than the specified threshold and/or several joint pilot sequences with larger correlation values The joint pilot sequence is used as the identified joint pilot sequence.
  • the receiver can use the identified joint pilot sequences to perform channel estimation based on the least squares algorithm to obtain the channel estimation result, which is used for receiving and detecting the received data symbols.
  • the receiver can use the identified joint pilot sequence
  • the sequence determines its component sequence or constituent sequence, for example, according to the joint pilot sequence index and the component sequence set size, through division or remainder operation, multiple component sequences that constitute the joint pilot sequence are determined.
  • the receiver can also directly use the component sequence set to detect and identify multiple component sequences used by the transmitter to form a joint pilot sequence.
  • the receiver may use the determined multiple component sequences used by the transmitter to perform channel estimation for receiving and detecting the received data symbols.
  • the receiver can use interference cancellation technology to reconstruct the transmitted symbols of users that have been correctly demodulated and decoded, and perform interference cancellation, and then continue to detect other users. Iterate in this way until the user cannot be identified and detected, or until the specified number of iterations is reached. Among them, the receiver can determine whether the decoding is correct according to the decoded cyclic redundancy check (Cyclic Redundancy Check, CRC) result.
  • CRC Cyclic Redundancy Check
  • the data payload part can carry the UE ID information or part of the UE ID information. After the receiver decodes the data correctly, the UE ID and the transmitted data can be obtained. In order to ensure the identification and detection performance of other UEs, it is also necessary to eliminate the interference of the pilot symbols. Since the pilot used by each UE transmitter is not known, the joint pilot sequence information (that is, the second sequence of the data) can be carried in the data payload. Identification information) or information of multiple component sequences (that is, identification information of N first sequences), including sequence composition information or sequence index information and other identification information used to identify the sequence, and sequence energy information.
  • the channel estimation value used in interference cancellation considering that the joint pilot sequence is non-orthogonal, and the pilots of multiple UEs may collide, in order to improve the performance of competition-free scheduling, all users with correct decoding can be used.
  • the reconstructed transmitted symbols are used for channel estimation based on the least squares algorithm to obtain an updated channel estimation result, and interference cancellation is performed based on the updated channel estimation result.
  • the pilot sequence used comes from a non-orthogonal sequence set with a larger number of sequences, and the non-orthogonal sequence set has good sequence structure characteristics and mutual interaction.
  • the pilot sequences used by each UE are non-orthogonal, and the collision probability is low.
  • the receiver can obtain better transmission performance by using the non-orthogonal sequence set and its sequence structure characteristics for receiving detection.
  • the signal processing method may include the following steps:
  • Obtain symbols from the transmission resource detect the acquired symbols to obtain M sequences used by the first communication node; wherein, the symbols are the symbols received by the second communication node and sent by the first communication node, And it is generated based on the second sequence; the second sequence is obtained by combining N first sequences, where M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.
  • FIG. 3 is a schematic structural diagram of a signal processing device provided by an embodiment of the application.
  • the signal processing device may be configured in a first communication node.
  • the signal processing device It includes: an acquisition module 31, configured to acquire N first sequences; a merging module 32, configured to merge the N first sequences to obtain a second sequence; a generating module 33, configured to generate a signal according to the second sequence; Wherein, N is an integer greater than or equal to 2.
  • the signal processing device provided in this embodiment is used to implement the signal processing method of the embodiment shown in FIG. 1.
  • the implementation principles and effects of the signal processing device provided in this embodiment are similar to the signal processing method of the embodiment shown in FIG. No longer.
  • the merging module 32 is specifically set as follows:
  • the N first sequences are superimposed; or, the N first sequences are respectively subjected to designated processing and then superimposed.
  • the merging module 32 is specifically set as follows:
  • the N first sequences are combined in series; or, the N first sequences are respectively subjected to designated processing and then combined in series.
  • the merging module 32 is specifically set as follows:
  • the N first sequences are respectively mapped to different time-frequency resources; or, the N first sequences are respectively designated and mapped to different time-frequency resources.
  • the generating module 33 is specifically configured as follows:
  • the second sequence is mapped to the time-frequency resource and a signal is generated after the specified processing is performed on the second sequence.
  • the specified processing includes one or more of the following:
  • Mask processing scrambling processing, precoding processing, energy adjustment, power adjustment, amplitude adjustment, phase adjustment.
  • the second sequence is a sequence in a non-orthogonal sequence set, and the second sequence corresponds to a pilot.
  • one first sequence corresponds to one pilot.
  • the acquiring module 31 is specifically configured to include one of the following:
  • N first sequences from a sequence set, any two of the N first sequences are different, or there are T sequences that are the same in the N first sequences, where T is greater than or equal to 2 An integer of, and T is less than or equal to N; N first sequences are obtained from different sequence sets; N first sequences are obtained from different subsets of the same sequence set.
  • the sequence set includes one or more of the following: a Hada code sequence set; a sequence set obtained from the Hada code sequence set; a ZC sequence set; and a four-phase sequence set.
  • the N first sequences are obtained randomly.
  • the device further includes: a data generation module configured to generate data, and carry information in the data, and the information includes one or more of the following:
  • the identification information of the N first sequences The identification information of the N first sequences; the energy information of at least one of the N first sequences; the identification information of the second sequence; the energy information of the second sequence; the first The identification information of the communication node.
  • FIG. 4 is a schematic structural diagram of another signal processing device provided by an embodiment of the application.
  • the signal processing device may be configured in a second communication node, as shown in FIG. 4,
  • the signal processing device includes: a receiving module 41 configured to receive a signal from a transmission resource, and the signal is generated based on a second sequence; a detecting module 42 configured to detect the signal to obtain M sequences that generate the signal ; Wherein, the second sequence is obtained by combining N first sequences, M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.
  • the signal processing device provided in this embodiment is used to implement the signal processing method of the embodiment shown in FIG. 2.
  • the implementation principles and effects of the signal processing device provided in this embodiment are similar to the signal processing method of the embodiment shown in FIG. No longer.
  • the detection module 42 is specifically configured as follows:
  • the signal is detected based on the sequence set to which the N first sequences belong, and M sequences for generating the signal are obtained, and the M sequences include M first sequences.
  • the detection module 42 is specifically configured as follows:
  • the signal is detected based on the non-orthogonal sequence set to which the second sequence belongs, and M sequences that generate the signal are obtained.
  • the M sequences include a second sequence, and the non-orthogonal sequence set is based on all The sequence set to which the N first sequences belong is determined.
  • the device further includes: a data acquisition module configured to:
  • the device further includes: an information acquisition module configured to acquire information from the detection result, the information including one or more of the following:
  • the identification information of the N first sequences The identification information of the N first sequences; the energy information of at least one of the N first sequences; the identification information of the second sequence; the energy information of the second sequence; the first communication node Identification information.
  • FIG. 5 is a schematic structural diagram of a first communication node provided by an embodiment of this application.
  • the first communication node provided by this application includes one or more The processor 51 and the storage device 52; there may be one or more processors 51 in the first communication node.
  • one processor 51 is taken as an example; the storage device 52 is used to store one or more programs; One or more programs are executed by the one or more processors 51, so that the one or more processors 51 implement the method described in FIG. 1 in the embodiment of the present application.
  • the first communication node further includes: a communication device 53, an input device 54 and an output device 55.
  • the processor 51, the storage device 52, the communication device 53, the input device 54 and the output device 55 in the first communication node may be connected by a bus or other means.
  • the connection by a bus is taken as an example.
  • the input device 54 can be used to receive inputted numeric or character information, and generate key signal input related to user settings and function control of the first communication node.
  • the output device 55 may include a display device such as a display screen.
  • the communication device 53 may include a receiver and a transmitter.
  • the communication device 53 is configured to perform information transceiving and communication under the control of the processor 51.
  • Information includes but is not limited to signals and data.
  • the storage device 52 can be configured to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the method described in FIG. 1 in the embodiment of the present application (for example, in a signal processing device).
  • the storage device 52 may include a storage program area and a storage data area.
  • the storage program area may store an operating system and an application program required by at least one function; the storage data area may store data created according to the use of the first communication node and the like.
  • the storage device 52 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices.
  • the storage device 52 may include memories remotely provided with respect to the processor 51, and these remote memories may be connected to the first communication node through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.
  • FIG. 6 is a schematic structural diagram of a second communication node provided by an embodiment of the application.
  • the second communication node provided by the present application includes one or more processors 61 and a storage device 62; there may be one or more processors 61 in the second communication node.
  • the processor 61 is taken as an example; the storage device 62 is used to store one or more programs; the one or more programs are executed by the one or more processors 61, so that the one or more processors 61 implement the same Apply the method described in Figure 2 of the embodiment.
  • the second communication node further includes: a communication device 63, an input device 64, and an output device 65.
  • the processor 61, the storage device 62, the communication device 63, the input device 64, and the output device 65 in the second communication node may be connected by a bus or other methods.
  • the connection by a bus is taken as an example.
  • the input device 64 can be used to receive inputted digital or character information, and generate key signal input related to user settings and function control of the second communication node.
  • the output device 65 may include a display device such as a display screen.
  • the communication device 63 may include a receiver and a transmitter.
  • the communication device 63 is configured to perform information transceiving and communication under the control of the processor 61.
  • the storage device 62 can be configured to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the signal processing method described in FIG. 2 of the embodiment of the present application (for example, a signal processing device).
  • the storage device 62 may include a storage program area and a storage data area, where the storage program area may store an operating system and an application program required by at least one function; the storage data area may store data created according to the use of the second communication node, and the like.
  • the storage device 62 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices.
  • the storage device 62 may include memories remotely provided with respect to the processor 61, and these remote memories may be connected to the second communication node through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.
  • the embodiments of the present application also provide a storage medium, where the storage medium stores a computer program, and the computer program implements the signal processing method described in any of the embodiments of the present application when the computer program is executed by a processor.
  • the signal processing method applied to the first communication node and the signal processing method applied to the second communication node wherein the signal processing method applied to the first communication node includes: obtaining N first sequences; and combining the N first sequences A sequence is used to obtain a second sequence; a signal is generated according to the second sequence; where N is an integer greater than or equal to 2.
  • the signal processing method applied to the second communication node includes: receiving a signal from a transmission resource, the signal being generated based on a second sequence; detecting the signal to obtain M sequences for generating the signal; wherein, the first The second sequence is obtained by combining N first sequences, where M is an integer greater than or equal to 1, and N is an integer greater than or equal to 2.
  • the computer storage medium of the embodiment of the present application may adopt any combination of one or more computer-readable media.
  • the computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium.
  • the computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or a combination of any of the above.
  • Examples of computer-readable storage media include: electrical connections with one or more wires, portable computer disks, hard disks, random access memory (Random Access Memory, RAM), read-only memory (Read Only) Memory, ROM), Erasable Programmable Read Only Memory (EPROM), flash memory, optical fiber, compact Disk-ROM (CD-ROM), optical storage device, magnetic storage device , Or any suitable combination of the above.
  • the computer-readable storage medium may be any tangible medium that contains or stores a program, and the program may be used by or in combination with an instruction execution system, apparatus, or device.
  • the computer-readable signal medium may include a data signal propagated in baseband or as a part of a carrier wave, and computer-readable program code is carried therein. This propagated data signal can take many forms, including but not limited to: electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • the computer-readable signal medium may also be any computer-readable medium other than the computer-readable storage medium.
  • the computer-readable medium may send, propagate, or transmit the program for use by or in combination with the instruction execution system, apparatus, or device .
  • the program code contained on the computer-readable medium can be transmitted by any suitable medium, including but not limited to: wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the foregoing.
  • suitable medium including but not limited to: wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the foregoing.
  • the computer program code used to perform the operations of this application can be written in one or more programming languages or a combination thereof.
  • the programming languages include object-oriented programming languages—such as Java, Smalltalk, C++, and also conventional Procedural programming language-such as "C" language or similar programming language.
  • the program code can be executed entirely on the user's computer, partly on the user's computer, executed as an independent software package, partly on the user's computer and partly executed on a remote computer, or entirely executed on the remote computer or server.
  • the remote computer can be connected to the user's computer through any kind of network-including Local Area Network (LAN) or Wide Area Network (WAN)-or, it can be connected to an external computer (For example, use an Internet service provider to connect via the Internet).
  • LAN Local Area Network
  • WAN Wide Area Network
  • user equipment covers any suitable type of wireless user equipment, such as mobile phones, portable data processing devices, portable web browsers, or vehicular mobile stations.
  • the various embodiments of the present application can be implemented in hardware or dedicated circuits, software, logic or any combination thereof.
  • some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that may be executed by a controller, microprocessor, or other computing device, although the present application is not limited thereto.
  • Computer program instructions can be assembly instructions, Instruction Set Architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, state setting data, or written in any combination of one or more programming languages Source code or object code.
  • ISA Instruction Set Architecture
  • the block diagram of any logic flow in the drawings of the present application may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions.
  • the computer program can be stored on the memory.
  • the memory can be of any type suitable for the local technical environment and can be implemented using any suitable data storage technology, such as but not limited to ROM, RAM, optical storage devices and systems (Digital Video Disc (DVD) or CD) Wait.
  • Computer-readable media may include non-transitory storage media.
  • the data processor can be any type suitable for the local technical environment, such as but not limited to general-purpose computers, special-purpose computers, microprocessors, digital signal processors (Digital Signal Processing, DSP), application specific integrated circuits (ASICs) ), programmable logic devices (Field-Programmable Gate Array, FPGA), and processors based on multi-core processor architecture.
  • DSP Digital Signal Processing
  • ASICs application specific integrated circuits
  • FPGA Field-Programmable Gate Array
  • FPGA Field-Programmable Gate Array

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Power Engineering (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Transceivers (AREA)
  • Reduction Or Emphasis Of Bandwidth Of Signals (AREA)
  • Time-Division Multiplex Systems (AREA)
  • Communication Control (AREA)

Abstract

本文公开信号处理方法、装置、第一通信节点、第二通信节点及存储介质。该信号处理方法包括：获取N个第一序列；合并所述N个第一序列，得到第二序列；根据所述第二序列生成信号；其中，N为大于或等于2的整数。

Description

信号处理方法、装置、第一通信节点、第二通信节点及存储介质
本申请要求在2020年01月16日提交中国专利局、申请号为202010049572.4的中国专利申请的优先权，该申请的全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信领域，例如涉及信号处理方法、装置、第一通信节点、第二通信节点及存储介质。
背景技术
免调度传输终端可以自主发送数据，不需要发送调度请求和等待动态调度。因此，免调度传输可以降低信令开销和传输时延，还可以降低终端功耗。此外，免调度传输还可以和非正交传输结合，提升接入用户数量。
免调度传输包括两种方案，分别为预配置免调度和竞争免调度。对于基于导频(包括参考信号或前导等)的竞争免调度传输，由于导频数量有限，当接入用户数量较多时，导频碰撞比较严重，会影响免调度传输性能。
发明内容
本申请提供信号处理方法、装置、第一通信节点、第二通信节点及存储介质。
本申请实施例提供一种信号处理方法，应用于第一通信节点，包括：
获取N个第一序列；合并所述N个第一序列，得到第二序列；根据所述第二序列生成信号；其中，N为大于或等于2的整数。
本申请实施例还提供一种信号处理方法，应用于第二通信节点，包括：
从传输资源上接收信号，所述信号是基于第二序列生成的；检测所述信号，得到生成所述信号的M个序列；其中，所述第二序列是由N个第一序列合并得到的，M为大于或等于1的整数，N为大于或等于2的整数。
本申请实施例还提供一种信号处理装置，配置于第一通信节点，包括：
获取模块，设置为获取N个第一序列；合并模块，设置为合并所述N个第一序列，得到第二序列；生成模块，设置为根据所述第二序列生成信号；其中，N为大于或等于2的整数。
本申请实施例还提供一种信号处理装置，配置于第二通信节点，包括：
接收模块，设置为从传输资源上接收信号，所述信号是基于第二序列生成的；检测模块，设置为检测所述信号，得到生成所述信号的M个序列；其中，所述第二序列是由N个第一序列合并得到的，M为大于或等于1的整数，N为大于或等于2的整数。
本申请实施例还提供了一种第一通信节点，包括：
一个或多个处理器；存储装置，用于存储一个或多个程序；当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如本申请实施例中应用于第一通信节点的任意一种信号处理方法。
本申请实施例还提供了一种第二通信节点，包括：
一个或多个处理器；存储装置，用于存储一个或多个程序；当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如本申请实施例中应用于第二通信节点的任意一种信号处理方法。
本申请实施例还提供了一种存储介质，所述存储介质存储有计算机程序，所述计算机程序被处理器执行时实现本申请实施例中的任意一种信号处理方法。
附图说明
图1为本申请实施例提供的一种信号处理方法的流程示意图；
图1a为一种传统的基于“导频+数据”的竞争免调度方案的传输帧结构的示意图；
图1b为一种基于“多导频+数据”的竞争免调度方案的传输帧结构的示意图；
图1c为本申请实施例提供的一种2个导频占用的时频资源的示意图；
图1d为本申请实施例提供的另一种2个导频占用的时频资源的示意图；
图1e为本申请实施例提供的一种时分多导频的示意图；
图1f为本申请实施例提供的另一种时分多导频的示意图；
图1g为本申请实施例提供的一种频分多导频的示意图；
图1h为本申请实施例提供的一种时频分多导频的示意图；
图1i为本申请实施例提供的一种码分多导频的示意图；
图1j为本申请实施例提供的另一种码分多导频的示意图；
图1k为本申请实施例提供的一种非正交序列集合的生成示意图；
图1l为本申请实施例提供的一种序列互相关值的CDF分布示意图；
图1m为本申请实施例提供的另一种非正交序列集合的生成示意图；
图1n为本申请实施例提供的又一种非正交序列集合的生成示意图；
图1o为本申请实施例提供的另一种序列互相关值的CDF分布示意图；
图2为本申请实施例提供的另一种信号处理方法的流程示意图；
图3为本申请实施例提供的一种信号处理装置的结构示意图；
图4为本申请实施例提供的另一种信号处理装置的结构示意图；
图5为本申请实施例提供的一种第一通信节点的结构示意图；
图6为本申请实施例提供的一种第二通信节点的结构示意图。
具体实施方式
下文中将结合附图对本申请的实施例进行说明。
在附图的流程图示出的步骤可以在诸如一组计算机可执行指令的计算机系统中执行。并且，虽然在流程图中示出了逻辑顺序，但是在一些情况下，可以以不同于此处的顺序执行所示出或描述的步骤。
在一个示例性实施方式中，图1为本申请实施例提供的一种信号处理方法的流程示意图。该方法可以由本申请提供的信号处理装置执行，该信号处理装置可以由软件和/或硬件实现，并集成在第一通信节点上，第一通信节点可以为任何类型的无线用户设备。
由于传统的基于导频的竞争免调度传输方案中，导频数量有限，当接入用户数量较多时，导频碰撞比较严重，会影响免调度传输性能。因此，可以考虑增强的导频(包括参考信号或前导等)设计，降低导频碰撞情况，从而改善竞争免调度传输的性能。
如图1所示，本申请提供的一种信号处理方法，包括S110、S120和S130。
S110、获取N个第一序列。
N为大于或等于2的整数。
各第一序列可以从相同的序列集合获取，也可以从不同的序列集合获取。N个第一序列中任意两个序列可以不同，也可以存在T个序列相同，其中，T为大于或等于2的整数，且T小于或等于N。
各第一序列可以是随机获取的。
此处不对N的取值进行限定，在一个示例中，N的取值包括2或3。
在一个示例中，N个第一序列的长度均为L，L为大于或等于2的整数。
S120、合并所述N个第一序列，得到第二序列。
在获取N个第一序列后，本步骤可以合并N个第一序列，得到第二序列。
第二序列可以为非正交序列集合中的一个序列。
此处不对合并的手段进行限定，在一个示例中，合并的手段包括但不限于叠加处理或串联组合。
叠加处理可以认为将N个第一序列叠加，即相加。串联组合包括直接将各第一序列串联，即序列串联，或将各第一序列中各个元素按照一定的顺序串联，即元素串联，如在串联时先提取各第一序列的第1个元素，然后提取各第一序列的第2个元素，依次类推，完成串联组合。
S130、根据所述第二序列生成信号。
在得到第二序列后，本步骤可以对第二序列处理以生成信号。处理的手段不作限定，包括但不限于指定处理和映射到时频资源上。
在免调度场景下，信号可以为参考信号。在随机接入场景下，信号可以为随机接入信号。
生成信号后，本申请还可以在传输资源上传输该信号，以供第二通信节点接收检测。
本申请提供的一种信号处理方法，应用于第一通信节点，包括：获取N个第一序列；合并所述N个第一序列，得到第二序列；根据所述第二序列生成信号；其中，N为大于或等于2的整数。利用该方法可以有效降低导频碰撞概率，从而可以改善竞争免调度传输的性能。
在一个示例中，本申请提供的一种信号处理方法，可以用于实现多导频传输。该方法首先获取N个第一序列，N个第一序列可以指示或对应N个导频，然后合并N个第一序列得到第二序列，并根据第二序列生成信号，可以实现码分多导频。该方法通过使用N个导频，使得在N个导频上均发生碰撞的概率较低；通过使用码分多导频，可以从相对较大的序列集合中获取各个第一序列，使得各个第一序列的选择空间更大，从而可以降低在N个导频上发生碰撞的概率。
在一个示例中，本申请提供的一种信号处理方法，可以用于实现非正交导频传输。该方法首先获取N个第一序列，然后合并N个第一序列得到第二序列，该第二序列对应一个导频，最后根据第二序列生成信号。第二序列可以是非正 交序列集合中的一个序列，从而可以实现非正交导频。该方法通过使用非正交导频，可用导频数量更多，从而可以降低导频碰撞概率。
在上述实施例的基础上，提出了上述实施例的延伸实施例，为了使描述简要，在延伸实施例中仅描述与上述实施例的不同之处。
在一个实施例中，所述合并所述N个第一序列，包括：
将所述N个第一序列进行叠加；或者，将所述N个第一序列分别进行指定处理后进行叠加。
在一个实施例中，所述合并所述N个第一序列，包括：
将所述N个第一序列进行串联组合；或者，将所述N个第一序列分别进行指定处理后进行串联组合。
在一个实施例中，所述合并所述N个第一序列，包括：
将所述N个第一序列分别映射到不同的时频资源上；或者，将所述N个第一序列分别进行指定处理后映射到不同的时频资源上。
在一个实施例中，所述根据所述第二序列生成信号，包括：
对所述第二序列进行指定处理后映射到时频资源上并生成信号。
在一个实施例中，所述指定处理包括以下一个或多个：
掩码处理、加扰处理、预编码处理、能量调整、功率调整、幅值调整、相位调整。
在一个实施例中，所述第二序列为非正交序列集合中的一个序列，所述第二序列对应一个导频。
在一个实施例中，一个第一序列对应一个导频。
在一个实施例中，获取N个第一序列，包括如下之一：
从一个序列集合中获取N个第一序列，所述N个第一序列中任意两个序列不同，或者，所述N个第一序列中存在T个序列相同，其中，T为大于或等于2的整数，且T小于或等于N；从不同的序列集合中获取N个第一序列；从同一个序列集合的不同子集中获取N个第一序列。
在一个实施例中，所述序列集合包括如下一个或多个：哈达码序列集合；根据哈达码序列集合得到的序列集合；ZC序列集合；四相序列集合。
在一个实施例中，所述N个第一序列为随机获取的。
在一个实施例中，该方法，还包括：生成数据，在所述数据中携带信息， 所述信息包括以下一个或多个：
所述N个第一序列的识别信息；所述N个第一序列中至少一个第一序列的能量信息；所述第二序列的识别信息；所述第二序列的能量信息；所述第一通信节点的身份识别信息。
N个第一序列的识别信息用于标识对应的第一序列，第二序列的识别信息用于标识第二序列。第一通信节点的身份识别信息用于标识第一通信节点。此处不对各识别信息的内容进行限定，只要能够标识对应的内容即可。在一个示例中，上述识别信息包括索引、编号或识别码。
能量信息可以为标识对应序列(如第一序列或第二序列)能量的信息，此处不对能量信息的内容进行限定，只要能够标识对应序列的能量即可。在一个示例中，上述能量信息包括能量等级或能量比例。
以下对本申请进行示例性的描述。本申请提供的信号处理方法，可以认为是一种参考信号生成方法。在随机接入场景中，该信号处理方法，可以认为是一种随机接入信号生成方法。
对于免调度传输(即Grant-free transmission)，终端可以自主发送数据，不需要发送调度请求和等待动态调度。因此，免调度传输可以降低信令开销和传输时延，还可以降低终端功耗。此外，免调度传输还可以和非正交传输结合，提升接入用户数量。
免调度传输包括两种方案，分别为预配置(即半静态调度(semi-persistent scheduling)，或者配置授予(configured grant))免调度和竞争(即基于竞争的(contention-based))免调度。其中，对于预配置免调度，基站可以为每个终端预配置或半静态配置时频资源和导频序列等；通过配置可以保证多个终端使用的时频资源和/或导频序列等不同，从而可以避免发生碰撞，以便进行用户识别与检测；可用时频资源通常是周期的，比较适合周期性业务，用于随机突发业务则传输效率较低、时延较大。对于竞争免调度，当终端有业务到达时，可以随机选择时频资源和导频序列等进行竞争接入和传输，多个终端使用的时频资源、导频序列等可能会发生碰撞，接收机需要通过更复杂或高级的盲检测算法实现用户识别与检测；竞争免调度更适合随机突发业务，具有更好的传输效率和更低的时延。
竞争免调度可以基于“导频+数据”的信道结构去实现，基站通过导频实现多用户检测。其中，导频至少包括前导、参考信号等。
图1a为一种传统的基于“导频+数据”的竞争免调度方案的传输帧结构的示意图。如图1a所示，传统方案中使用一个导频，该导频可以由一条序列构成。 接收机通过导频进行用户识别与检测。如果两个用户选择了不同的导频，那么，两个用户可能都可以被正确接收检测。当两个用户选择相同的导频时，即发生了碰撞，此时接收机仅能识别到一个用户，并且仅能得到一个信道估计结果，而且该信道估计结果为两个用户的信道之和。这种情况下，如果两个用户设备(User Equipment，UE)的功率相当，很可能任何一个用户都无法被正确译码。由于导频数量有限，随着用户数量的增加，碰撞情况会快速恶化，从而会影响系统支持的接入用户数量。
因此，对于基于导频的竞争免调度传输，由于导频数量有限，当接入用户数量较多时，导频碰撞比较严重，会影响免调度传输的性能。本申请提供了一种参考信号生成方法，有利于降低导频碰撞情况，从而可以改善竞争免调度传输的性能。
在一个实施例中，图1b为一种基于“多导频+数据”的竞争免调度方案的传输帧结构的示意图，如图1b所示，多导频方案的主要思想是在相同的资源开销下设计多个独立的或随机选择的导频。接收机分别利用多个导频进行用户识别与检测。若两个用户在导频1上发生碰撞，在导频2上没有发生碰撞，则仍可通过导频2实现用户识别与检测，然后进行干扰消除，进而改善其他用户的检测性能。
对于图1a所示的方案，假设候选导频集合中包含N个正交导频序列，以两个用户竞争接入为例，其碰撞率为1/N。对于图1b所示的方案，假设有2个独立导频，即w＝2，并且假设导频开销不变，那么，每个导频可以从包含N/2个正交导频序列的候选导频集合中随机选择，则两个用户竞争接入的碰撞率为(2/N)^2＝4/N^2。可以看到，后者的碰撞率是前者的4/N。也就是说，当N大于4时，后者的碰撞率更低，而且随着N的增加，后者的碰撞率相对于前者越来越低。例如，当N＝24时，后者的碰撞率为前者的1/6；当N＝48时，后者的碰撞率为前者的1/12。因此，基于“多导频+数据”的竞争免调度方案可以降低碰撞率，有利于提升接入用户的数量。
对于多个导频的配置或结构，一种情况是，多个导频占用不同的时频资源。
以采用两个导频为例。图1c为本申请实施例提供的一种2个导频占用的时频资源的示意图。参见图1c，2个导频P1、P2占用的时频资源，在频域上占用相同的频域资源位置，在时域上分别占用不同的符号，而且不同符号可以是连续的或不连续的，这种情况可以称为时分多导频。
图1d为本申请实施例提供的另一种2个导频占用的时频资源的示意图。如图1d所示，2个导频P1、P2占用的时频资源，在时域上占用相同的符号位置(两个符号可以是连续或不连续的)，在频域上分别占用不同的频域资源，而且不 同的频域资源可以是连续的或不连续的，这种情况可以称为频分多导频。
在实施时，可以有不同的实施方式。图1e为本申请实施例提供的一种时分多导频的示意图。图1f为本申请实施例提供的另一种时分多导频的示意图。如图1e和1f所示，对于时分多导频，2个导频P1、P2占用的时频资源，在时域上占用不同的符号，在频域上从可用的频域资源中随机选择，可能使用相同或不同的频域资源位置。其中，对于图1e，假设频域资源包含12个资源元素(Resource Element，RE)，分为三组，每组包含4个RE，导频P1从第一个符号的三组频域资源中随机选择一组资源，导频P2从第二个符号的三组频域资源中随机选择一组资源。对于图1f，则将频域12个RE分为六组，每组包含2个RE，导频P1从第一个符号的六组频域资源中随机选择一组资源，导频P2从第二个符号的六组频域资源中随机选择一组资源。这种结构也可以称为梳状结构，每组资源称为一个梳。因此，也可以认为为每个导频随机选择一个梳。
对于频分多导频，也可以类似实施，例如，图1g为本申请实施例提供的一种频分多导频的示意图。如图1g所示，2个导频P1、P2占用的时频资源，在时域上占用相同的符号位置，在频域上从可用的频域资源中随机选择。这里可以将频域12个RE分为两组，每组包含6个RE，分别供导频P1和导频P2使用，每组资源划分为三个子组，每个子组包含2个RE，对于一个UE来说，导频P1从第一组资源的三个子组中随机选择一个子组资源，导频P2从第二组资源的三个子组中随机选择一个子组资源。
还可以采用时频分多导频的实施方式，图1h为本申请实施例提供的一种时频分多导频的示意图。如图1h所示，将包含频域12个RE、时域2个符号的时频资源，从频域上分为两组，每组包含6个RE，分别供导频P1和导频P2使用，对每组资源进行时频划分，得到六个子组，每个子帧包含频域2个RE、时域1个符号，对于一个UE来说，导频P1从第一组资源的六个子组中随机选择一个子组资源，导频P2从第二组资源的六个子组中随机选择一个子组资源。
上述示例中每个导频最终使用的频域资源是连续的，实际上也可以是不连续的。
当一个用户的多个导频占用不同的时频资源时，对于不同的导频Px,x＝1,...,w，可以使用相同的导频序列集合，例如，P1、P2、...、Pw均是从导频序列集合S中随机选择的。
导频序列集合可以是正交序列集合。例如，对于图1c所示的时分多导频，假设频域包含12个RE，那么，导频序列集合可以为包含12个长度为12的正交哈达码序列集合，每个导频从该集合中选择1个长度为12的导频序列。对于图1d所示的频分多导频，假设频域包含12个RE，2个导频分别占用6个RE， 时域占用2个符号，那么，导频序列集合可以为包含12个长度为12的正交哈达码序列集合，每个导频从该集合中选择1个长度为12的导频序列，然后映射到相应的频域6个RE和时域2个符号上。此时，对于任意一个导频Px，多个用户的导频之间是码分的，当多个用户选择了相同的导频序列时会发生碰撞。如上文所示，两个UE的2个导频均发生碰撞的概率为(1/12)^2＝1/144。
对于图1e所示的时分多导频，每个导频在频域占用4个RE，那么，导频序列集合可以为包含4个长度为4的正交哈达码序列集合，每个导频从该集合中选择1个长度为4的导频序列。同理，对于图1f所示的时分多导频，每个导频在频域占用2个RE，那么，导频序列集合可以为包含2个长度为2的正交哈达码序列集合，每个导频从该集合中选择1个长度为2的导频序列。
对于图1g所示的频分多导频，每个导频在频域占用2个RE，时域占用2个符号，那么，导频序列集合可以为包含4个长度为4的正交哈达码序列集合，每个导频从该集合中选择1个长度为4的导频序列，然后映射到相应的频域2个RE和时域2个符号上。导频序列集合也可以包含序列集合A和正交掩码集合B，其中，序列集合A可以为包含2个长度为2的正交哈达码序列集合，正交掩码集合B可以为包含2个长度为2的正交哈达码序列集合，从序列集合A中随机选择1列得到1个2*1的序列，从正交掩码集合B中随机选择1行得到一个1*2的序列，然后将两个序列进行矩阵乘法运算得到2*2的矩阵，作为导频映射到相应的频域2个RE和时域2个符号上。
对于图1h所示的时频分多导频，与图1f相似，每个导频在频域占用2个RE，时域占用1个符号，那么，导频序列集合可以为包含2个长度为2的正交哈达码序列集合，每个导频从该集合中选择1个长度为2的导频序列，然后映射到相应的频域2个RE和时域1个符号上。
对于图1e-图1h所示的情况，可以认为其导频集合包含候选(梳状)导频资源和长度较短的正交导频序列集合。这种情况也可以等效为长度较长的稀疏正交导频序列集合，即，与导频资源对应的位置上的导频序列元素为长度较短的正交导频序列的元素，其他资源位置上的导频序列元素为0，最终可以得到12个长度为12的稀疏正交序列。
对于图1e-图1h所示的情况，对于其中任意一个导频Px，多个用户的导频之间是频分的、或时频分的、或码分的，当然如果等效为稀疏导频序列时可以认为均是码分的。
上述示例中的可用导频(包含时频资源和/或导频序列)，也可以对应到天线端口上，每个可用导频对应于一个端口。当一个UE使用多个天线端口时，该UE可以使用多组导频(或者将上述任意一个导频Px看作一组导频)，每组导 频中包含多个导频，分别对应于多个端口，而且这多个导频可以是随机选择的。
一个UE可以传输多层数据或多个数据流，该UE可以使用多组导频，每组导频中包含多个导频，分别对应于多层数据或多个数据流，而且这多个导频可以是随机选择的。或者，可以将该UE的每层数据或每个数据流看作一个虚拟UE，每个虚拟UE按照上述示例分别使用多个导频。
UE针对多个天线端口、或多层数据、或多个数据流，还可以进行功率分配，或者对传输的符号进行幅值调整，另外还可以进行相位调整、预编码处理等操作。
在一个实施例中，合并N个第一序列的技术手段可以为叠加处理。
对于多个导频的配置或结构，还有一种情况是，多个导频占用相同的时频资源。
以采用两个导频为例。图1i为本申请实施例提供的一种码分多导频的示意图，参见图1i，2个导频P1、P2占用的时频资源是相同的，而在码域上则可以进行一定的区分，即通过导频序列进行区分，这种情况可以称为码分多导频。
码分多导频可以分为以下三种情况：
(1)多个导频的导频序列(即N个第一序列)分别来自于不同的导频序列集合(即序列集合)。例如，2个导频P1、P2使用的导频序列分别是从导频序列集合S1、S2中随机选择的。
(2)多个导频的导频序列来自于同一个导频序列集合，并且保证多个导频序列不同。例如，从导频序列集合S中随机选择2个不同的导频序列，分别作为2个导频P1、P2使用的导频序列。
(3)多个导频的导频序列来自于同一个导频序列集合，允许选择相同的导频序列，即可能存在两个或两个以上导频序列是相同的。例如，2个导频P1、P2使用的导频序列是分别从导频序列集合S中随机选择的，可能会选择相同的导频序列。当2个导频使用相同的导频序列时可以等价于是一个导频。
图1j为本申请实施例提供的另一种码分多导频的示意图。参见图1j，假设可用的导频资源在频域上包含12个RE，在时域上包含2个符号，从频域上将资源分为六组，也就是说，每组导频资源(或每个梳状资源)在频域上包含2个RE、在时域上包含2个符号。
在每组导频资源上使用的导频序列集合S可以为包含4个长度为4的正交哈达码序列集合。导频序列集合也可以包含序列集合A和正交掩码集合B，其中，序列集合A可以为包含2个长度为2的正交哈达码序列集合，正交掩码集 合B可以为包含2个长度为2的正交哈达码序列集合。
这种情况下，可以认为其导频集合包含候选导频资源和长度较短的正交导频序列集合。当然，这种情况也可以等效为其导频集合为长度较长的稀疏正交导频序列集合。
在该示例中，多个导频可以分别来自于不同的导频集合，或者，多个导频来自于同一个导频集合并且保证多个导频不同，或者，多个导频来自于同一个导频集合并且其中任意两个导频可能相同。以采用两个导频为例。例如，将每组导频资源上使用的导频序列集合S分为两个子集S1和S2，导频P1从六组导频资源中随机选择一组导频资源，然后从子集S1中选择导频序列，导频P2从六组导频资源中随机选择一组导频资源，然后从子集S2中选择导频序列。或者，从候选导频资源和候选导频序列的所有组合中随机选择2个不同的组合，作为导频P1和导频P2。或者，从候选导频资源和候选导频序列的所有组合中随机选择2个组合，作为导频P1和导频P2，此时导频P1和导频P2可能是相同的，如果相同则可以等价于是一个导频。
在总能量受限条件下，采用多个导频时，每个导频的能量会降低，从而会影响信道估计，影响对噪声的抑制能力。
对于码分多导频，其多个导频的能量分配可以考虑以下两种情况：
(1)总能量在多个导频上平均分配，即多个导频的能量是相同的。
(2)总能量在多个导频上非均匀分配，即多个导频的能量可以是不同的。例如，将总能量划分为多个能量等级，各个能量等级指示的能量相等或不等，多个导频随机选择其中一个能量等级，多个导频的能量等级索引互不相同，保证总能量不变，或者等于或不超过预设的总能量。在一种示例中，多个能量等级的其中一个能力等级可以为0，这相当于不发送该导频，节省下来的能量可以用于其他导频的发送。对于UE采用2个导频的情况，如果其中1个导频的能量不为0、1个导频的能量为0，则相当于该UE实际上采用了1个导频。
对于能量非均匀分配，为了对导频符号进行重构和干扰消除，UE可以在其发送的数据有效载荷(Payload)中携带多个导频的能量分配相关信息。例如，携带多个导频中各个导频的能量分配指示；或者，携带多个导频的其中一个导频的能量等级索引，此时，多个能量等级可以在多个导频之间依次、循环使用，那么，确定了其中一个导频的能量等级索引后，其他导频的能量等级可以依次确定。
对于多个导频占用不同的时频资源，也可以在多个导频之间进行能量分配，总能量在多个导频上平均分配或非均匀分配。其中，对于时分多导频，由于功 率控制的原因，一些情况下(例如UE达到最大发射功率)，多个导频的能量应当是相同的。
这里所述的能量分配，可以通过功率分配、功率控制、幅值调整、能量归一化等操作实现。
在一种示例中，例如图1i，对于码分多导频，从一个UE的发射端来看，UE首先获取多个导频序列，然后对多个导频序列进行叠加处理，得到叠加处理之后的序列，然后根据叠加处理之后的序列生成导频或参考信号，用于发送。
以采用两个导频为例，则UE首先获取2个导频序列(即第一序列)C1和C2，然后，UE对2个导频序列C1和C2进行叠加处理，得到叠加处理之后的序列C：C＝C1+C2，然后，UE根据叠加处理之后的序列C生成导频或参考信号。
如果多个导频的导频序列分别来自于不同的导频序列集合，或者，多个导频的导频序列来自于同一个导频序列集合并且保证多个导频序列不同，UE可以先对2个导频序列C1和C2的能量进行调整，然后再进行叠加处理，得到叠加处理之后的序列C。例如，假设导频序列C1和C2的长度均为L，元素能量均是归一化为1的，那么两个序列的总能量均为L，对2个导频序列C1和C2进行能量调整后可以分别得到
Figure PCTCN2020141212-appb-000001
和
Figure PCTCN2020141212-appb-000002
那么，叠加处理之后的序列C可以为
Figure PCTCN2020141212-appb-000003
这样叠加处理之后得到的序列C的总能量仍然为L。
或者，假设导频序列C1和C2的长度均为L，元素能量均是归一化为1的，导频目标总能量为E，则每个导频序列的目标总能量可以为E/2，对2个导频序列C1和C2进行能量调整后可以分别得到
Figure PCTCN2020141212-appb-000004
和
Figure PCTCN2020141212-appb-000005
那么，叠加处理之后的序列C可以为
Figure PCTCN2020141212-appb-000006
这样叠加处理之后得到的序列C的总能量为E。
如果多个导频的导频序列来自于同一个导频序列集合，并且其中任意两个导频序列可能相同。那么，在根据序列C生成导频或参考信号之前，可以对序列C进行能量归一化处理得到序列D，然后再根据序列D生成导频或参考信号，例如
Figure PCTCN2020141212-appb-000007
其中，假设C为L*1的序列，() *表示共轭转置，根据C *C可以得到序列C的总能量，这样处理的目的是保证导频总能量不变、或者等于或不超过预设的总能量E，尤其是针对一个UE的两个导频序列相同的情况。当然，对于多个导频的导频序列分别来自于不同的导频序列集合，或者，多个导频的导频序列来自于同一个导频序列集合并且保证多个导频序列不同的情况，也可以采用这种对叠加之后得到的序列C进行能量调整的方法。
在一种示例中，例如图1j，对于码分多导频，从一个UE的发射端来看，UE首先获取多个导频，然后对多个导频进行叠加处理，得到叠加处理之后的导频，然后根据叠加处理之后的导频生成参考信号，用于发送。
以采用两个导频为例，则UE(即第一通信节点)首先获取2个导频P1和P2，然后，UE对2个导频P1和P2进行叠加处理，得到叠加处理之后的导频P：P＝P1+P2，然后，UE根据叠加处理之后的导频P生成参考信号。
如果多个导频(对应N个第一序列)分别来自于不同的导频集合，或者，多个导频来自于同一个导频集合并且保证多个导频不同。这种情况下，UE可以先对2个导频P1和P2的能量进行调整，然后再进行叠加处理，得到叠加处理之后的导频P。例如，假设导频P1使用的导频序列为C1，导频P2使用的导频序列为C2，两个序列的长度均为L，元素能量均是归一化为1的，导频目标总能量为E，则每个导频的目标总能量可以为E/2，对2个导频P1和P2使用的导频序列进行能量调整后可以分别得到
Figure PCTCN2020141212-appb-000008
和
Figure PCTCN2020141212-appb-000009
如果2个导频使用的梳状时频资源不同，那么，可以将导频P1和P2使用的进行了能量调整之后的导频序列分别映射到各自的时频资源即可。由于一个导频使用的导频序列将映射到该导频使用的时频资源上，而该导频没有使用的其他时频资源位置上可以等效认为携带的是0元素，当两个导频使用的时频资源不同时，分别将导频序列映射到各自的时频资源上，等效于进行了叠加处理。而如果2个导频使用的梳状时频资源相同，则可以将2个导频P1和P2使用的导频序列进行能量调整后进行叠加处理，得到
Figure PCTCN2020141212-appb-000010
然后将序列C映射到相应的时频资源上用于生成参考信号。
如果多个导频来自于同一个导频集合，并且其中任意两个导频可能相同。这种情况下，当UE的2个导频P1和P2相同时，其使用的时频资源和导频序列均是相同的。与上文类似，可以将2个导频使用的导频序列进行叠加处理，得到叠加之后的序列C＝C1+C2，然后可以对序列C进行能量归一化处理得到序列
Figure PCTCN2020141212-appb-000011
保证导频总能量不变、或者等于或不超过预设的总能量E，然后将序列D映射到相应的时频资源上用于生成参考信号。当然，对于多个导频分别来自于不同的导频集合，或者，多个导频来自于同一个导频集合并且保证多个导频不同的情况，也可以采用这种对叠加之后得到的序列C进行能量调整的方法。
关于码分多导频的碰撞情况，对于图1i所示的情况，假设导频资源在频域包含12个RE，在时域包含2个符号，那么，如果采用正交导频序列集合，则该集合可以为包含24个长度为24的正交哈达码序列集合S。以采用2个导频为 例。如果一个UE的2个导频的导频序列分别来自于两个集合S1和S2，例如，集合S1包含集合S的一半序列，集合S2包含集合S的另一半序列，也就是说，集合S1和S2分别包含12个长度为24的序列，这种情况下，两个UE的两个导频均发生碰撞的概率为1/144。该碰撞概率与时分/频分多导频的碰撞率相同。而如果一个UE的2个导频的导频序列均来自于集合S，则两个UE的两个导频均发生碰撞的概率(1/24)^2＝1/576。可以看到，采用码分多导频，可以从相对较大的序列集合中获取各个第一序列，使得各个第一序列的选择空间更大，从而可以降低在多个导频上发生碰撞的概率。
不过，对于一个UE的2个导频的导频序列均来自于集合S并且允许选择相同序列的情况，存在的一个问题是，当2个导频使用的导频序列不同或正交时，能量归一化因子为
Figure PCTCN2020141212-appb-000012
而当2个导频使用的导频序列相同时，能量归一化因子为1/2。可以看到，能量归一化因子不是唯一的。这对接收机的接收检测存在一定影响。接收机通过2个导频进行盲检测时，不知道UE选择的导频序列，无法使用对应的能量归一化因子。一种方式是，考虑到2个导频使用相同的导频序列的比例更低，可以统一使用能量归一化因子
Figure PCTCN2020141212-appb-000013
而对于一个UE的2个导频的导频序列分别来自于两个集合S1和S2，或者，2个导频的导频序列均来自于集合S并且保证2个导频序列不同的情况，则不存在这一问题，可以统一使用能量归一化因子
Figure PCTCN2020141212-appb-000014
对于图1j所示的情况，导频集合包含候选导频资源和长度较短的正交导频序列集合，其碰撞情况和能量归一化问题可以进行类似分析，其中，能量归一化因子可能是不同的，不过原理是相似的。
在一个实施例中，合并N个第一序列的技术手段可以为组合处理。
本实施例中，假设导频占用的时频资源总开销为24个资源元素。本实施例中，终端(UE)首先获取两个序列(即第一序列)。包括，终端从序列集合A中随机选择两个序列C1和C2，其中，序列集合A包括12个长度为12的正交序列。那么，序列C1和C2分别为一个长度为12的序列。
终端将2个序列C1和C2组合(例如串联)起来可以得到一个长度为24的序列C(即第二序列)。由于序列集合A包括12个长度为12的正交序列，从中任意选择2个序列，然后组合起来得到一个长度为24的序列，那么，总共可以得到144个长度为24的序列。也就是说，可以得到一个序列集合B，该序列集合B包括144个长度为24的序列。而且，该序列集合B为一个非正交序列集合。图1k为本申请实施例提供的一种非正交序列集合的生成示意图。如图1k所示。那么，可以认为组合得到的序列C(即第二序列)来自于非正交序列集合B。
终端根据得到的序列C生成参考信号，包括：将序列C映射到供导频使用的时频资源上，用于生成参考信号；或者，将序列C进行指定处理后映射到供导频使用的时频资源上，用于生成参考信号，其中，指定处理包括以下至少之一：能量归一化、能量调整、功率调整、幅值调整、相位调整、预编码处理、扰码处理等。
本实施例中，表1为一种序列集合A的集合表，序列集合A可以为包含12个长度为12的正交哈达码序列集合，如表1所示。根据本实施例的上述描述，对于表1所示的序列集合A，可以构造出一个包含144个长度为24的非正交序列集合B。
表1一种序列集合A的集合表
Figure PCTCN2020141212-appb-000015
图1l为本申请实施例提供的一种序列互相关值的CDF分布示意图，参见图1l，基于累积分布函数(Cumulative Distribution Function，CDF)与互相关值可以看出，大约85％的序列互相关值为0，大约15％的序列互相关值为0.5。
本实施例中，表2为另一种序列集合A的集合表。序列集合A还可以为如表2所示的序列集合，该序列集合中同样包含12个长度为12的正交序列，各个序列是稀疏的，而且可以看作由包含3个梳的梳状资源结构以及包含4个长度为4的正交哈达码序列集合组合构成。根据本实施例的上述描述，对于表2所示的序列集合A，也可以构造出一个包含144个长度为24的非正交序列集合B，其各个序列之间的互相关特征与上述图1l所示的特征相同，也就是说，与 基于表1所示的序列集合A构成的非正交序列集合B的互相关特征相同。
表2另一种序列集合A的集合表
Figure PCTCN2020141212-appb-000016
本实施例中，序列集合A还可以为其他正交序列集合或非正交序列集合，例如由包含6个梳的梳状资源结构以及包含2个长度为2的正交哈达码序列集合组合构成的序列集合；或者，ZC(Zadoff-Chu)序列集合；或者，四相序列集合，例如，序列元素来自于集合{1+1i,-1+1i,-1-1i,1-1i}或{1,1i,-1,-1i}，可以看到候选序列元素有4种相位取值，因此可以称为四相序列集合。
本实施例中，通过获取多个序列并进行组合处理，可以得到一个具有更多序列数量的非正交序列集合，而且该非正交序列集合具有良好的序列结构特征和互相关特征。当多个UE使用相同的时频资源进行传输时，各个UE使用的导频序列相当于来自于该非正交序列集合，也就是说各个UE使用的导频序列是非正交的，而且碰撞概率较低。接收机则可以利用该非正交序列集合及其序列结构特征进行接收检测。
在一个实施例中，假设导频占用的时频资源总开销为24个RE。
本实施例中，终端(UE)首先获取两个序列(即第一序列)。包括，终端从序列集合A1中随机选择一个序列C1，终端从序列集合A2中随机选择一个序列C2。
本实施例中，序列集合A1和序列集合A2来自于序列集合A，分别包含序 列集合A中的一半序列和另一半序列。例如，序列集合A包括24个长度为24的正交序列，序列集合A1是由序列集合A中的前12个序列构成的序列集合，序列集合A2是由序列集合A中的后12个序列构成的序列集合。那么，序列集合A1包含12个长度为24的正交序列，序列集合A2也包含12个长度为24的正交序列。而序列C1和C2则分别为一个长度为24的序列。
本实施例中，序列集合A1和序列集合A2分别包含序列集合A中的一半序列和另一半序列，不局限于是序列集合A中的前一半序列和后一半序列，可以是任意一半序列和另一半序列。
本实施例中，不限制序列集合A1和序列集合A2均来自于序列集合A，序列集合A1和序列集合A2也可以是两个独立的序列集合。
终端将2个序列C1和C2进行叠加处理可以得到一个长度为24的序列C(即第二序列)。由于序列集合A1包括12个长度为24的正交序列，序列集合A2也包含12个长度为24的正交序列，分别从序列集合A1和序列集合A2中任意选择1个序列，然后叠加起来得到一个长度为24的序列，那么，总共可以得到144个长度为24的序列。也就是说，可以得到一个序列集合B，该序列集合B包括144个长度为24的序列。而且，该序列集合B为一个非正交序列集合。图1m为本申请实施例提供的另一种非正交序列集合的生成示意图。如图1m所示，可以认为序列C来自于该序列集合B。
终端根据得到的序列C(即第二序列)生成参考信号，包括：将序列C映射到供导频使用的时频资源上，用于生成参考信号；或者，将序列C进行指定处理后映射到供导频使用的时频资源上，用于生成参考信号，其中，指定处理包括以下至少之一：能量归一化、能量调整、功率调整、幅值调整、相位调整、预编码处理、扰码处理等。
本实施例中，表3为本申请提供的又一种序列集合A的集合表，序列集合A可以为包含24个长度为24的正交哈达码序列集合。
如表3所示。根据本实施例的上述描述，序列集合A1可以包含该序列集合A中的前12个序列，序列集合A2可以包含该序列集合A中的后12个序列，根据序列集合A1和序列集合A2可以构造出一个包含144个长度为24的非正交序列集合B，并且，该序列集合B中的各个序列之间的互相关特征与上述图1l所示的特征是相同的。
表3又一种序列集合A的集合表
Figure PCTCN2020141212-appb-000017
Figure PCTCN2020141212-appb-000018
本实施例中，表4为本申请提供的又一种序列集合A的集合表，序列集合A还可以为如表4所示的序列集合，该序列集合中同样包含24个长度为24的正交序列，各个序列是稀疏的，而且可以看作由包含3个梳的梳状资源结构以及包含8个长度为8的正交哈达码序列集合组合构成。根据本实施例的上述描述，序列集合A1可以包含该序列集合A中的前12个序列，序列集合A2可以包含该序列集合A中的后12个序列，根据序列集合A1和序列集合A2可以构造出一个包含144个长度为24的非正交序列集合B，并且，该序列集合B中的各个序列之间的互相关特征与上述图1l所示的特征也是相同的。
表4又一种序列集合A的集合表
Figure PCTCN2020141212-appb-000019
Figure PCTCN2020141212-appb-000020
本实施例中，通过获取多个序列并进行叠加处理，可以得到一个具有更多序列数量的非正交序列集合，而且该非正交序列集合具有良好的序列结构特征和互相关特征。当多个UE使用相同的时频资源进行传输时，各个UE使用的导频序列相当于来自于该非正交序列集合，也就是说各个UE使用的导频序列是非正交的，而且碰撞概率较低。接收机则可以利用该非正交序列集合及其序列结构特征进行接收检测。
本实施例中，如果导频占用的时频资源总开销为48个RE，那么，可以将序列集合A1中的任意一个序列和序列集合A2中的任意一个序列进行组合，得到一个序列集合B，该序列集合B包括144个长度为48的序列。而且，该序列集合B为一个非正交序列集合。图1n为本申请实施例提供的又一种非正交序列集合的生成示意图。参见图1n，非正交序列集合B可以为序列集合A1和序列结合A2进行组合得到。
这种情况下，序列集合A可以为包含24个长度为24的正交哈达码序列集合，如表3所示。那么，序列集合A1可以包含该序列集合A中的前12个序列，序列集合A2可以包含该序列集合A中的后12个序列，根据序列集合A1和序列集合A2可以构造出一个包含144个长度为48的非正交序列集合B，并且，该序列集合B中的各个序列之间的互相关特征与上述图1l所示的特征是相同的。
这种情况下，序列集合A也可以为如表4所示的序列集合，该序列集合中同样包含24个长度为24的正交序列。那么，序列集合A1可以包含该序列集合 A中的前12个序列，序列集合A2可以包含该序列集合A中的后12个序列，根据序列集合A1和序列集合A2可以构造出一个包含144个长度为48的非正交序列集合B，并且，该序列集合B中的各个序列之间的互相关特征与上述图1l所示的特征也是相同的。
在一个实施例中，假设导频占用的时频资源总开销为24个RE。
本实施例中，终端(UE)首先获取两个序列(即第一序列)C1和C2。其中，序列C1由一个序列X1和一个序列Y1构成，序列C2由一个序列X2和一个序列Y2构成。序列X1和序列X2来自于序列集合X，序列Y1和序列Y2来自于序列集合Y。例如，序列集合X包括12个长度为12的正交序列，序列集合Y包括2个长度为2的正交序列，并且，将序列集合Y中的第一个序列作为序列Y1用于获取序列C1，将序列集合Y中的第二个序列作为序列Y2用于获取序列C2。
那么，终端获取两个序列C1和C2，包括：从序列集合X中随机选择一个序列作为序列X1，获取序列集合Y中的第一个序列Y1，根据序列X1和序列Y1可以得到序列C1。序列X1是一个长度为12的序列，可以表示为12*1的矢量，序列Y1是一个长度为2的序列，可以表示为1*2的矢量，将序列X1和序列Y1进行矩阵乘法运算，得到一个12*2的矩阵，可以将该矩阵转换为一个长度为24的序列，作为序列C1。同理，可以得到序列C2。那么，序列C1和C2分别为一个长度为24的序列。
本实施例中，可以将序列Y1和序列Y2称为正交掩码，将序列集合Y称为正交掩码集合。
根据上述描述可以看到，将序列集合X中的各个序列与序列集合Y中的第一个序列Y1进行运算，可以得到一个新的序列集合A1，该序列集合等效包含12个长度为24的正交序列，同理，将序列集合X中的各个序列与序列集合Y中的第二个序列Y2进行运算，可以得到一个新的序列集合A2，该序列集合同样等效包含12个长度为24的正交序列。那么，可以等效认为，序列C1来自于序列集合A1，序列C2来自于序列集合A2。
事实上，本实施例中，将序列集合X中的任意一个序列和序列集合Y中的任意一个序列进行运算可以得到一个长度为24的序列，总共可以得到24个长度为24的正交序列，这24个序列可以构成序列集合A，那么，上述序列集合A1和序列集合A2可以看作是来自于该序列集合A，分别包含该序列集合A中的一半序列和另一半序列。
本实施例中，终端获取两个序列C1和C2时，还可以从序列集合X的一半序列中随机选择一个序列作为序列X1，从序列集合Y中随机选择一个序列作为序列Y1，根据序列X1和序列Y1获取序列C1；同理，从序列集合X的另一半序列中随机选择一个序列作为序列X2，从序列集合Y中随机选择一个序列作为序列Y2，根据序列X2和序列Y2获取序列C2。
终端将2个序列C1和C2进行叠加处理可以得到一个长度为24的序列C(即第二序列)。将序列集合A1中的任意一个序列和序列集合A2中的任意一个序列进行叠加处理，可以得到一个序列集合B，该序列集合B包括144个长度为24的序列。而且，该序列集合B为一个非正交序列集合。那么，可以认为序列C来自于该序列集合B。
终端根据得到的序列C生成参考信号，包括：将序列C映射到供导频使用的时频资源上，用于生成参考信号；或者，将序列C进行指定处理后映射到供导频使用的时频资源上，用于生成参考信号，其中，指定处理包括以下至少之一：能量归一化、能量调整、功率调整、幅值调整、相位调整、预编码处理、加扰处理等。
本实施例中，序列集合X可以为表1所示的包含12个长度为12的正交哈达码序列集合，也可以为表2所示的包含12个长度为12的正交序列集合。表5为序列集合Y的集合表，序列集合Y如表5所示。
表5序列集合Y的集合表
Figure PCTCN2020141212-appb-000021
根据本实施例的上述描述，序列集合A1和序列集合A2分别包含12个长度为24的序列，那么，根据序列集合A1和序列集合A2可以构造出一个包含144个长度为24的非正交序列集合B，并且，该序列集合B中的各个序列之间的互相关特征与上述图1l的特征相同。
本实施例中，如果导频占用的时频资源总开销为48个RE，那么，将序列集合A1中的任意一个序列和序列集合A2中的任意一个序列进行组合，可以得到一个序列集合B，该序列集合B包括144个长度为48的序列。而且，该序列集合B为一个非正交序列集合。
这种情况下，序列集合X可以为表1所示的包含12个长度为12的正交哈达码序列集合，也可以为表2所示的包含12个长度为12的正交序列集合。序 列集合Y如表5所示。那么，根据本实施例的上述描述，根据序列集合X和序列集合Y可以得到等效的序列集合A1和序列集合A2，二者分别包含12个长度为24的序列，那么，根据序列集合A1和序列集合A2可以构造出一个包含144个长度为48的非正交序列集合B，并且，该序列集合B中的各个序列之间的互相关特征与上述图1l所示的特征相同。
在一个实施例中，假设导频占用的时频资源总开销为48个RE。
本实施例中，终端(UE)首先获取两个序列(即第一序列)。包括，终端从序列集合A中随机选择两个序列C1和C2，其中，序列集合A包括24个长度为24的正交序列。那么，序列C1和C2分别为一个长度为24的序列。
终端将2个序列C1和C2组合(例如串联)起来可以得到一个长度为48的序列C。由于序列集合A包括24个长度为24的正交序列，从中任意选择2个序列，然后组合起来得到一个长度为48的序列，那么，总共可以得到576个长度为48的序列。也就是说，可以得到一个序列集合B，该序列集合B包括576个长度为48的序列。而且，该序列集合B为一个非正交序列集合。那么，可以认为序列C来自于该序列集合B。
终端根据得到的序列C(即第二序列)生成参考信号，包括：将序列C映射到供导频使用的时频资源上，用于生成参考信号；或者，将序列C进行指定处理后映射到供导频使用的时频资源上，用于生成参考信号，其中，指定处理包括以下至少之一：能量归一化、能量调整、功率调整、幅值调整、相位调整、预编码处理、扰码处理等。
本实施例中，序列集合A可以为包含24个长度为24的正交哈达码序列集合，如表3所示，根据本实施例的上述描述，对于表3所示的序列集合A，可以构造出一个包含576个长度为48的非正交序列集合B，图1o为本申请实施例提供的另一种序列互相关值的CDF分布示意图，其各个序列之间的互相关值的CDF分布如图1o所示，可以看到，92％的序列互相关值为0，8％的序列互相关值为0.5。
本实施例中，序列集合A还可以为表4所示的序列集合，该序列集合中同样包含24个长度为24的正交序列。根据本实施例的上述描述，对于表4所示的序列集合A，同样可以构造出一个包含576个长度为48的非正交序列集合B，并且，该序列集合B中的各个序列之间的互相关特征与图1o所示特征相同。
基于本实施例及上述实施例可以得到其他延伸实施例，此处不作限定。
在一个实施例中，本申请提供的信号处理方法可以包括如下步骤：
获取多个序列(即获取N个第一序列)；对所述多个序列进行叠加处理或 组合处理，得到处理后的序列(即第二序列)；根据所述处理后的序列生成参考信号；发送所述参考信号。
所述多个序列代表多个导频；或者，所述多个序列分别为多个导频使用的序列。
所述多个序列来自于一个序列集合，允许其中任意两个序列相同；或者，所述多个序列来自于一个序列集合，并且所述多个序列互不相同；或者，所述多个序列分别来自于多个序列集合；或者，所述多个序列分别来自于一个序列集合的多个子序列集合，或者多个序列按照预设规则生成。
所述多个序列为随机选择或随机生成的。
对所述多个序列进行叠加处理包括：
将所述多个序列进行叠加，或将所述多个序列分别进行指定处理后进行叠加；或者，将所述多个序列映射到不同的时频资源上，或将所述多个序列分别进行指定处理后映射到不同的时频资源上，实现等效的叠加处理。
对所述多个序列进行组合处理包括：
将所述多个序列进行串联组合，或将所述多个序列分别进行指定处理后进行串联组合；或者，将所述多个序列的元素按照指定顺序组合，或将所述多个序列分别进行指定处理后的元素按照指定顺序组合。指定顺序不作限定。
根据所述处理后的序列生成参考信号，包括：
对所述处理后的序列进行指定处理，映射到指定的传输资源上，用于生成参考信号。
所述指定处理包括以下至少之一：掩码处理、扰码处理、预编码处理、能量归一化、能量调整、功率调整、幅值调整、相位调整。
所述多个序列的能量相同，或者，所述多个序列采用不同的能量等级或能量比例。
所述信号处理方法还包括：生成数据，在所述数据中携带信息，所述信息包括以下一个或多个：所述多个序列或导频的识别信息；所述多个序列或导频的能量信息，或所述多个序列或导频中的其中一个序列或导频的能量信息；所述处理后的序列的识别信息；所述处理后的序列的能量信息；第一通信节点的身份识别信息，或第一通信节点的身份识别信息的部分信息。
本申请实施例还提供了一种信号处理方法，图2为本申请实施例提供的另一种信号处理方法的流程示意图。该方法可以由本申请提供的信号处理装置执行，该信号处理装置可以由软件和/或硬件实现，并集成在第二通信节点上，第 二通信节点可以为基站。
如图2所示，本申请提供的信号处理方法，包括S210和S220。
S210、从传输资源上接收信号，所述信号是基于第二序列生成的。
所述信号为基于图1所示方式生成的。本申请从传输资源上接收信号，以对信号进行检测。
S220、检测所述信号，得到生成所述信号的M个序列，其中，所述第二序列是由N个第一序列合并得到的，M为大于或等于1的整数，N为大于或等于2的整数。
检测信号的步骤可以包括从信号的传输资源上获取接收到的导频符号，然后对获取的导频符号进行检测，识别出第一通信节点使用的M个序列。
检测手段不同，对应的M个序列的内容不同。示例性的，在基于第一序列所属的序列集合检测信号时，可以得到M个第一序列。在基于第二序列所属的非正交序列集合检测所述信号时，M个序列可以为一个第二序列。
第二序列所属的非正交序列集合可以基于N个第一序列所属的序列集合确定，确定手段参见第一通信节点侧确定序列集合B的技术手段，此处不作赘述。
得到生成所述信号的M个序列后，可以基于M个序列进行数据检测，以及干扰消除。
在基于第一序列所属的序列集合检测信号时，可以得到M个第一序列。此处不限定M和N的大小关系，可以基于第一通信节点的个数确定。对于一个UE来说，其使用的N个第一序列，可能均可以被检测到，也可能其中一部分第一序列被检测到，也就是说，M小于或等于N。如果有多个UE，接收机检测得到的第一序列包括多个UE的，也就是说，可以得到与每个UE对应的M个序列，那么，从整体上看，接收机检测得到的第一序列的数量可以大于N。在多个UE的情况下，接收机检测得到的与各个UE分别对应的序列的数量可以是不同的。
在基于第二序列所属的非正交序列集合检测所述信号时，M个序列可以为一个第二序列。这是针对每个UE而言的。如果有多个UE，接收机通过检测得到的第二序列包括多个UE的，也就是说可以得到与每个UE对应的第二序列，那么，从整体上，接收机可以检测得到多个第二序列。
本申请提供了一种信号处理方法，应用于第二通信节点，包括：从传输资源上接收信号，所述信号是基于第二序列生成的；检测所述信号，得到生成所述信号的M个序列；其中，所述第二序列是由N个第一序列合并得到的，M为 大于或等于1的整数，N为大于或等于2的整数。该方法针对多导频或非正交导频的特点进行接收检测，可以获得更好的传输性能。
在上述实施例的基础上，提出了上述实施例的延伸实施例，为了使描述简要，在延伸实施例中仅描述与上述实施例的不同之处。
在一个实施例中，所述检测所述信号，得到生成所述信号的M个序列，包括：
基于所述N个第一序列所属的序列集合检测所述信号，得到生成所述信号的M个序列，所述M个序列包括M个第一序列。
第二通信节点可以预先存储N个第一序列所述的序列集合，在检测信号时，可以基于N个第一序列所述的序列集合对所述信号进行盲检测。第一通信节点和第二通信节点可以预先约定获取第一序列的方式，以便第二通信节点能够基于N个第一序列所属的序列集合检测所述信号。
在一个实施例中，所述检测所述信号，得到生成所述信号的M个序列，包括：
基于所述第二序列所属的非正交序列集合检测所述信号，得到生成所述信号的M个序列，所述M个序列包括一个第二序列，其中，所述非正交序列集合基于所述N个第一序列所属的序列集合确定。
第二通信节点可以基于第二序列所属的非正交序列集合对所述信号进行盲检测，以得到一个第二序列。确定非正交序列集合的技术手段可以参见第一通信节点确定序列集合B的技术手段，此处不作赘述。
在一个实施例中，该方法，还包括：
获取数据符号；基于生成所述信号的M个序列对所述数据符号进行检测，获取检测结果。
本申请可以基于M个序列进行信道估计，以用于对接收到的数据符号进行接收检测。
在一个实施例中，该方法还包括：从所述检测结果中获取信息，所述信息包括以下一个或多个：
所述N个第一序列的识别信息；所述N个第一序列中至少一个第一序列的能量信息；所述第二序列的识别信息；所述第二序列的能量信息；第一通信节点的身份识别信息。
以下对本申请进行示例性的描述。在一个实施例中，在接收端，接收机首先从参考信号传输资源上获取接收到的导频符号，然后对所获取的导频符号进 行检测，识别出来发射机使用的多个导频序列(即N个第一序列的全部或部分)。
对于上述示例所述的多个导频使用不同的时频资源的参考信号生成方法，以采用2个导频为例，接收机对导频P1进行检测，识别出来发射机在导频P1上使用的导频序列，并进行信道估计，然后对接收到的数据符号进行检测；接收机还对导频P2进行检测，识别出来发射机在导频P2上使用的导频序列，并进行信道估计，然后对接收到的数据符号进行检测。接收机针对导频P1和导频P2的检测过程可以并行执行，也可以串行执行。一实施例中，可以结合干扰消除进行接收检测。当采用并行处理时，通过导频P1和导频P2可能对同一个UE均检测译码成功，此时保留该UE的任意一个正确译码结果即可，并对该UE的导频符号和数据符号进行干扰消除，然后进行下一轮迭代检测，即根据干扰消除后更新的接收符号重新通过导频P1和导频P2进行接收检测。当采用串行处理时，如果通过导频P1对一个UE检测译码成功，可以对该UE的导频符号和数据符号进行重构和干扰消除，然后可以再通过导频P2继续对其他UE进行接收检测和干扰消除，然后开始下一轮迭代检测，即重新依次通过导频P1、导频P2进行接收检测。如此迭代，直到无法识别检测到用户为止，或者，直到达到指定迭代次数为止。
对于竞争免调度传输，由于不知道接入UE的信息，可以在数据Payload中携带第一通信节点的身份识别信息，如UE标识(Identifier，ID)信息或UE ID的部分信息，如此，当一个UE的数据被成功检测译码后，即可得知哪一个UE的数据被成功接收。此外，为了保证其他UE的识别检测性能，还需要对导频符号进行干扰消除，由于每个发射机使用了独立的或随机的多个导频，接收机并不知道每个UE发射机使用的多个导频的信息，可以在数据Payload中携带多个导频的信息，包括导频构成信息或导频索引信息等用于识别导频的识别信息，以及导频能量信息等。
干扰消除时，可以利用基于导频得到的信道估计结果进行干扰消除，不过，考虑到多个UE的导频可能发生碰撞，为了改善竞争免调度传输的性能，还可以利用所有译码正确的用户的重构的发送符号基于最小二乘算法进行信道估计，得到更新的信道估计结果，基于该更新的信道估计结果进行干扰消除。
对于多个导频使用相同的时频资源的参考信号生成方法，以采用2个导频为例，如果一个UE的2个导频来自于不同的集合，那么，接收机处理过程可以采用与上述描述类似的过程。如果一个UE的2个导频来自于同一个集合，那么，接收机对接收到的导频符号进行检测时，可能会同时识别出一个UE的2个导频，而无法区分导频P1和导频P2，此时，接收机处理过程其实与传统方案的接收机处理过程类似，不同的是，该方案中一个UE使用2个导频，尽管不同UE的导 频可能发生碰撞，但是碰撞概率降低，接收机则会检测识别出相对更多的导频，接收机基于这些导频对数据符号进行接收检测，可以获得更好的传输性能。
在一个实施例中，检测信号得到的M个序列可以为一个第二序列，即联合导频序列。
在接收端，接收机首先从参考信号传输资源上获取接收到的导频符号，然后对所获取的导频符号进行检测，识别出来发射机使用的联合导频序列。
接收机可以按照与发射机类似的方式构造非正交序列集合B，使用该序列集合B中的每个序列对所获取的导频符号进行盲检测，识别发射机使用的联合导频序列，然后根据识别出来的联合导频序列对接收到的数据符号进行检测。
进行联合导频识别或用户识别时，利用构造的非正交导频序列集合B进行盲检测，通过相关检测，获取相关值大于指定门限的联合导频序列和/或相关值较大的若干个联合导频序列，作为识别出来的联合导频序列。
接收机可以利用识别出来的各个联合导频序列基于最小二乘算法进行信道估计，得到信道估计结果，用于对接收到的数据符号进行接收检测。
由于联合导频序列是由多个分量序列组合或叠加之后得到的，而多个分量序列可以分别来自于正交或非正交的分量序列集合，那么，接收机可以根据识别出来的联合导频序列来确定其分量序列或构成序列，例如，根据联合导频序列索引和分量序列集合大小，通过除法运算或取余运算，确定构成该联合导频序列的多个分量序列。接收机也可以直接利用分量序列集合对发射机使用的用于构成联合导频序列的多个分量序列进行检测识别。一实施例中，接收机可以利用所确定的发射机使用的多个分量序列进行信道估计，用于对接收到的数据符号进行接收检测。
对于竞争免调度传输，接收机可以采用干扰消除技术，对已经被正确解调译码的用户的发送符号进行重构，并进行干扰消除，然后继续对其他用户进行检测。如此迭代，直到无法识别检测到用户为止，或者，直到达到指定迭代次数为止。其中，接收机可以根据译码后的循环冗余校验(Cyclic Redundancy Check，CRC)结果确定译码是否正确。
由于不知道接入UE的信息，数据Payload部分可以携带UE ID信息或UE ID的部分信息，接收机将数据正确译码后，即可获得UE的ID及其传输的数据。为了保证其他UE的识别检测性能，还需要对导频符号进行干扰消除，由于不知道每个UE发射机使用的导频，可以在数据Payload中携带联合导频序列的信息(即第二序列的识别信息)或多个分量序列的信息(即N个第一序列的识别信 息)，包括序列构成信息或序列索引信息等用于识别序列的识别信息，以及序列能量信息等。
对于干扰消除时采用的信道估计值，考虑到联合导频序列是非正交的，以及多个UE的导频可能发生碰撞，为了改善竞争免调度传输的性能，可以利用所有译码正确的用户的重构的发送符号基于最小二乘算法进行信道估计，得到更新的信道估计结果，基于该更新的信道估计结果进行干扰消除。
本实施例中，多个UE进行竞争免调度传输时，使用的导频序列来自于一个具有更多序列数量的非正交序列集合，而且该非正交序列集合具有良好的序列结构特征和互相关特征，各个UE使用的导频序列是非正交的，而且碰撞概率较低，接收机通过利用该非正交序列集合及其序列结构特征进行接收检测，可以获得更好的传输性能。
在一个实施例中，该信号处理方法可以包括如下步骤：
从传输资源上获取符号；对所获取的符号进行检测，得到第一通信节点使用的M个序列；其中，所述符号为第二通信节点接收到的由所述第一通信节点发送的符号，并且是基于第二序列生成的；所述第二序列是由N个第一序列合并得到的，M为大于或等于1的整数，N为大于或等于2的整数。
本申请提供了一种信号处理装置，图3为本申请实施例提供的一种信号处理装置的结构示意图，该信号处理装置可以配置于第一通信节点，如图3所示，该信号处理装置包括：获取模块31，设置为获取N个第一序列；合并模块32，设置为合并所述N个第一序列，得到第二序列；生成模块33，设置为根据所述第二序列生成信号；其中，N为大于或等于2的整数。
本实施例提供的信号处理装置用于实现如图1所示实施例的信号处理方法，本实施例提供的信号处理装置实现原理和效果与图1所示实施例的信号处理方法类似，此处不再赘述。
在上述实施例的基础上，提出了上述实施例的延伸实施例，为了使描述简要，在延伸实施例中仅描述与上述实施例的不同之处。
在一个实施例中，合并模块32，具体设置为：
将所述N个第一序列进行叠加；或者，将所述N个第一序列分别进行指定处理后进行叠加。
在一个实施例中，合并模块32，具体设置为：
将所述N个第一序列进行串联组合；或者，将所述N个第一序列分别进行 指定处理后进行串联组合。
在一个实施例中，合并模块32，具体设置为：
将所述N个第一序列分别映射到不同的时频资源上；或者，将所述N个第一序列分别进行指定处理后映射到不同的时频资源上。
在一个实施例中，生成模块33，具体设置为：
对所述第二序列进行指定处理后映射到时频资源上并生成信号。
在一实施例中，所述指定处理包括以下一个或多个：
掩码处理、加扰处理、预编码处理、能量调整、功率调整、幅值调整、相位调整。
在一个实施例中，所述第二序列为非正交序列集合中的一个序列，所述第二序列对应一个导频。
在一个实施例中，一个第一序列对应一个导频。
在一个实施例中，获取模块31，具体设置为包括如下之一：
从一个序列集合中获取N个第一序列，所述N个第一序列中任意两个序列不同，或者，所述N个第一序列中存在T个序列相同，其中，T为大于或等于2的整数，且T小于或等于N；从不同的序列集合中获取N个第一序列；从同一个序列集合的不同子集中获取N个第一序列。
在一个实施例中，所述序列集合包括如下一个或多个：哈达码序列集合；根据哈达码序列集合得到的序列集合；ZC序列集合；四相序列集合。
在一个实施例中，所述N个第一序列为随机获取的。
在一个实施例中，该装置，还包括：数据生成模块，设置为：生成数据，在所述数据中携带信息，所述信息包括以下一个或多个：
所述N个第一序列的识别信息；所述N个第一序列中至少一个第一序列的能量信息；所述第二序列的识别信息；所述第二序列的能量信息；所述第一通信节点的身份识别信息。
本申请实施例还提供了一种信号处理装置，图4为本申请实施例提供的另一种信号处理装置的结构示意图，该信号处理装置可以配置于第二通信节点，如图4所示，该信号处理装置包括：接收模块41，设置为从传输资源上接收信号，所述信号是基于第二序列生成的；检测模块42，设置为检测所述信号，得到生成所述信号的M个序列；其中，所述第二序列是由N个第一序列合并得到的，M为大于或等于1的整数，N为大于或等于2的整数。
本实施例提供的信号处理装置用于实现如图2所示实施例的信号处理方法，本实施例提供的信号处理装置实现原理和效果与图2所示实施例的信号处理方法类似，此处不再赘述。
在上述实施例的基础上，提出了上述实施例的延伸实施例，为了使描述简要，在延伸实施例中仅描述与上述实施例的不同之处。
在一个实施例中，检测模块42，具体设置为：
基于所述N个第一序列所属的序列集合检测所述信号，得到生成所述信号的M个序列，所述M个序列包括M个第一序列。
在一个实施例中，检测模块42，具体设置为：
基于所述第二序列所属的非正交序列集合检测所述信号，得到生成所述信号的M个序列，所述M个序列包括一个第二序列，其中，所述非正交序列集合基于所述N个第一序列所属的序列集合确定。
在一实施例中，该装置还包括：数据获取模块，设置为：
获取数据符号；基于生成所述信号的M个序列对所述数据符号进行检测，获取检测结果。
在一个实施例中，该装置，还包括：信息获取模块，设置为：从所述检测结果中获取信息，所述信息包括以下一个或多个：
所述N个第一序列的识别信息；所述N个第一序列中至少一个第一序列的能量信息；所述第二序列的识别信息；所述第二序列的能量信息；第一通信节点的身份识别信息。
本申请提供了一种第一通信节点，图5为本申请实施例提供的一种第一通信节点的结构示意图，如图5所示，本申请提供的第一通信节点，包括一个或多个处理器51和存储装置52；该第一通信节点中的处理器51可以是一个或多个，图5中以一个处理器51为例；存储装置52用于存储一个或多个程序；所述一个或多个程序被所述一个或多个处理器51执行，使得所述一个或多个处理器51实现如本申请实施例中图1所述的方法。
第一通信节点还包括：通信装置53、输入装置54和输出装置55。
第一通信节点中的处理器51、存储装置52、通信装置53、输入装置54和输出装置55可以通过总线或其他方式连接，图5中以通过总线连接为例。
输入装置54可用于接收输入的数字或字符信息，以及产生与第一通信节点的用户设置以及功能控制有关的按键信号输入。输出装置55可包括显示屏等显示设备。
通信装置53可以包括接收器和发送器。通信装置53设置为根据处理器51的控制进行信息收发通信。信息包括但不限于信号和数据。
存储装置52作为一种计算机可读存储介质，可设置为存储软件程序、计算机可执行程序以及模块，如本申请实施例中图1所述方法对应的程序指令/模块(例如，信号处理装置中的获取模块31、合并模块32和生成模块33)。存储装置52可包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据第一通信节点的使用所创建的数据等。此外，存储装置52可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。在一些实例中，存储装置52可包括相对于处理器51远程设置的存储器，这些远程存储器可以通过网络连接至第一通信节点。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
本申请实施例还提供一种第二通信节点，图6为本申请实施例提供的一种第二通信节点的结构示意图。如图6所示，本申请提供的第二通信节点，包括一个或多个处理器61和存储装置62；该第二通信节点中的处理器61可以是一个或多个，图6中以一个处理器61为例；存储装置62用于存储一个或多个程序；所述一个或多个程序被所述一个或多个处理器61执行，使得所述一个或多个处理器61实现如本申请实施例图2中所述的方法。
第二通信节点还包括：通信装置63、输入装置64和输出装置65。
第二通信节点中的处理器61、存储装置62、通信装置63、输入装置64和输出装置65可以通过总线或其他方式连接，图6中以通过总线连接为例。
输入装置64可用于接收输入的数字或字符信息，以及产生与第二通信节点的用户设置以及功能控制有关的按键信号输入。输出装置65可包括显示屏等显示设备。
通信装置63可以包括接收器和发送器。通信装置63设置为根据处理器61的控制进行信息收发通信。
存储装置62作为一种计算机可读存储介质，可设置为存储软件程序、计算机可执行程序以及模块，如本申请实施例图2所述信号处理方法对应的程序指令/模块(例如，信号处理装置中的接收模块41和检测模块42)。存储装置62可包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据第二通信节点的使用所创建的数据等。此外，存储装置62可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储 器件。在一些实例中，存储装置62可包括相对于处理器61远程设置的存储器，这些远程存储器可以通过网络连接至第二通信节点。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
本申请实施例还提供一种存储介质，所述存储介质存储有计算机程序，所述计算机程序被处理器执行时实现本申请实施例中任一所述的信号处理方法。如应用于第一通信节点的信号处理方法和应用于第二通信节点的信号处理方法，其中，应用于第一通信节点的信号处理方法包括：获取N个第一序列；合并所述N个第一序列，得到第二序列；根据所述第二序列生成信号；其中，N为大于或等于2的整数。
应用于第二通信节点的信号处理方法包括：从传输资源上接收信号，所述信号是基于第二序列生成的；检测所述信号，得到生成所述信号的M个序列；其中，所述第二序列是由N个第一序列合并得到的，M为大于或等于1的整数，N为大于或等于2的整数。
本申请实施例的计算机存储介质，可以采用一个或多个计算机可读的介质的任意组合。计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的系统、装置或器件，或者任意以上的组合。计算机可读存储介质的例子(非穷举的列表)包括：具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机存取存储器(Random Access Memory，RAM)、只读存储器(Read Only Memory，ROM)、可擦式可编程只读存储器(Erasable Programmable Read Only Memory，EPROM)、闪存、光纤、便携式光盘只读存储器(Compact Disk-ROM，CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。计算机可读存储介质可以是任何包含或存储程序的有形介质，该程序可以被指令执行系统、装置或者器件使用或者与其结合使用。
计算机可读的信号介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了计算机可读的程序代码。这种传播的数据信号可以采用多种形式，包括但不限于：电磁信号、光信号或上述的任意合适的组合。计算机可读的信号介质还可以是计算机可读存储介质以外的任何计算机可读介质，该计算机可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。
计算机可读介质上包含的程序代码可以用任何适当的介质传输，包括但不限于：无线、电线、光缆、无线电频率(Radio Frequency，RF)等等，或者上述的任意合适的组合。
可以以一种或多种程序设计语言或其组合来编写用于执行本申请操作的计 算机程序代码，所述程序设计语言包括面向对象的程序设计语言—诸如Java、Smalltalk、C++，还包括常规的过程式程序设计语言—诸如“C”语言或类似的程序设计语言。程序代码可以完全地在用户计算机上执行、部分地在用户计算机上执行、作为一个独立的软件包执行、部分在用户计算机上部分在远程计算机上执行、或者完全在远程计算机或服务器上执行。在涉及远程计算机的情形中，远程计算机可以通过任意种类的网络——包括局域网(Local Area Network，LAN)或广域网(Wide Area Network，WAN)——连接到用户计算机，或者，可以连接到外部计算机(例如利用因特网服务提供商来通过因特网连接)。
以上所述，仅为本申请的示例性实施例而已，并非用于限定本申请的保护范围。
术语用户设备涵盖任何适合类型的无线用户设备，例如移动电话、便携数据处理装置、便携网络浏览器或车载移动台。
一般来说，本申请的多种实施例可以在硬件或专用电路、软件、逻辑或其任何组合中实现。例如，一些方面可以被实现在硬件中，而其它方面可以被实现在可以被控制器、微处理器或其它计算装置执行的固件或软件中，尽管本申请不限于此。
本申请的实施例可以通过移动装置的数据处理器执行计算机程序指令来实现，例如在处理器实体中，或者通过硬件，或者通过软件和硬件的组合。计算机程序指令可以是汇编指令、指令集架构(Instruction Set Architecture，ISA)指令、机器指令、机器相关指令、微代码、固件指令、状态设置数据、或者以一种或多种编程语言的任意组合编写的源代码或目标代码。
本申请附图中的任何逻辑流程的框图可以表示程序步骤，或者可以表示相互连接的逻辑电路、模块和功能，或者可以表示程序步骤与逻辑电路、模块和功能的组合。计算机程序可以存储在存储器上。存储器可以具有任何适合于本地技术环境的类型并且可以使用任何适合的数据存储技术实现，例如但不限于ROM、RAM、光存储器装置和系统(数码多功能光碟(Digital Video Disc，DVD)或CD)等。计算机可读介质可以包括非瞬时性存储介质。数据处理器可以是任何适合于本地技术环境的类型，例如但不限于通用计算机、专用计算机、微处理器、数字信号处理器(Digital Signal Processing，DSP)、专用集成电路(Application Specific Integrated Circuit，ASIC)、可编程逻辑器件(Field-Programmable Gate Array，FPGA)以及基于多核处理器架构的处理器。

Claims (22)

  1. 一种信号处理方法，应用于第一通信节点，包括：
    获取N个第一序列；
    合并所述N个第一序列，得到第二序列；
    根据所述第二序列生成信号；
    其中，N为大于或等于2的整数。
  2. 根据权利要求1所述的方法，其中，所述合并所述N个第一序列，包括：
    将所述N个第一序列进行叠加；或者，
    将所述N个第一序列分别进行指定处理后进行叠加。
  3. 根据权利要求1所述的方法，其中，所述合并所述N个第一序列，包括：
    将所述N个第一序列进行串联组合；或者，
    将所述N个第一序列分别进行指定处理后进行串联组合。
  4. 根据权利要求1所述的方法，其中，所述合并所述N个第一序列，包括：
    将所述N个第一序列分别映射到不同的时频资源上；或者，
    将所述N个第一序列分别进行指定处理后映射到不同的时频资源上。
  5. 根据权利要求1所述的方法，其中，所述根据所述第二序列生成信号，包括：
    对所述第二序列进行指定处理后映射到时频资源上并生成信号。
  6. 根据权利要求2-5任一项所述的方法，其中，所述指定处理包括以下至少之一：
    掩码处理；加扰处理；预编码处理；能量调整；功率调整；幅值调整；相位调整。
  7. 根据权利要求1所述的方法，其中，所述第二序列为非正交序列集合中的一个序列，所述第二序列对应一个导频。
  8. 根据权利要求1所述的方法，其中，一个第一序列对应一个导频。
  9. 根据权利要求1所述的方法，其中，所述获取N个第一序列，包括如下之一：
    从一个序列集合中获取所述N个第一序列，所述N个第一序列中任意两个序列不同，或者，所述N个第一序列中存在T个序列相同，其中，T为大于或等于2的整数，且T小于或等于N；
    从不同的序列集合中获取所述N个第一序列；
    从同一个序列集合的不同子集中获取所述N个第一序列。
  10. 根据权利要求9所述的方法，其中，所述序列集合包括如下至少之一：哈达码序列集合；根据哈达码序列集合得到的序列集合；ZC序列集合；四相序列集合。
  11. 根据权利要求1所述的方法，其中，所述N个第一序列为随机获取的。
  12. 根据权利要求1所述的方法，还包括：
    生成数据，在所述数据中携带信息，所述信息包括以下至少之一：
    所述N个第一序列的识别信息；所述N个第一序列中至少一个第一序列的能量信息；所述第二序列的识别信息；所述第二序列的能量信息；所述第一通信节点的身份识别信息。
  13. 一种信号处理方法，应用于第二通信节点，包括：
    从传输资源上接收信号，所述信号是基于第二序列生成的；
    检测所述信号，得到生成所述信号的M个序列；
    其中，所述第二序列是由N个第一序列合并得到的，M为大于或等于1的整数，N为大于或等于2的整数。
  14. 根据权利要求13所述的方法，其中，所述检测所述信号，得到生成所述信号的M个序列，包括：
    基于所述N个第一序列所属的序列集合检测所述信号，得到生成所述信号的M个序列，所述M个序列包括M个第一序列。
  15. 根据权利要求13所述的方法，其中，所述检测所述信号，得到生成所述信号的M个序列，包括：
    基于所述第二序列所属的非正交序列集合检测所述信号，得到生成所述信号的M个序列，所述M个序列包括一个第二序列，其中，所述非正交序列集合基于所述N个第一序列所属的序列集合确定。
  16. 根据权利要求13所述的方法，还包括：
    获取数据符号；
    基于生成所述信号的M个序列对所述数据符号进行检测，获取检测结果。
  17. 根据权利要求16所述的方法，还包括：
    从所述检测结果中获取信息，所述信息包括以下至少之一：
    所述N个第一序列的识别信息；所述N个第一序列中至少一个第一序列的能量信息；所述第二序列的识别信息；所述第二序列的能量信息；第一通信节点的身份识别信息。
  18. 一种信号处理装置，配置于第一通信节点，包括：
    获取模块，设置为获取N个第一序列；
    合并模块，设置为合并所述N个第一序列，得到第二序列；
    生成模块，设置为根据所述第二序列生成信号；
    其中，N为大于或等于2的整数。
  19. 一种信号处理装置，配置于第二通信节点，包括：
    接收模块，设置为从传输资源上接收信号，所述信号是基于第二序列生成的；
    检测模块，设置为检测所述信号，得到生成所述信号的M个序列；
    其中，所述第二序列是由N个第一序列合并得到的，M为大于或等于1的整数，N为大于或等于2的整数。
  20. 一种第一通信节点，包括：
    至少一个处理器；
    存储装置，设置为存储至少一个程序；
    当所述至少一个程序被所述至少一个处理器执行，使得所述至少一个处理器实现如权利要求1-12任一项所述的信号处理方法。
  21. 一种第二通信节点，包括：
    至少一个处理器；
    存储装置，设置为存储至少一个程序；
    当所述至少一个程序被所述至少一个处理器执行，使得所述至少一个处理器实现如权利要求13-17任一项所述的信号处理方法。
  22. 一种存储介质，存储有计算机程序，所述计算机程序被处理器执行时实现权利要求1-17任一项所述的信号处理方法。
PCT/CN2020/141212 2020-01-16 2020-12-30 信号处理方法、装置、第一通信节点、第二通信节点及存储介质 WO2021143529A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
BR112022014086A BR112022014086A2 (pt) 2020-01-16 2020-12-30 Método e aparelho de processamento de sinal, primeiro nó de comunicação, segundo nó de comunicação e meio de armazenamento
EP20914086.2A EP4092944A4 (en) 2020-01-16 2020-12-30 SIGNAL PROCESSING METHOD AND APPARATUS, FIRST COMMUNICATIONS NODE, SECOND COMMUNICATIONS NODE AND STORAGE MEDIUM
US17/792,992 US20230063566A1 (en) 2020-01-16 2020-12-30 Signal processing method and apparatus, first communication node, second communication node, and storage medium
KR1020227028016A KR20220125738A (ko) 2020-01-16 2020-12-30 신호 처리 방법, 장치, 제1 통신 노드, 제2 통신 노드 및 저장 매체

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010049572.4 2020-01-16
CN202010049572.4A CN111901082A (zh) 2020-01-16 2020-01-16 信号处理方法、装置、第一通信节点和第二通信节点

Publications (1)

Publication Number Publication Date
WO2021143529A1 true WO2021143529A1 (zh) 2021-07-22

Family

ID=73169739

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/141212 WO2021143529A1 (zh) 2020-01-16 2020-12-30 信号处理方法、装置、第一通信节点、第二通信节点及存储介质

Country Status (6)

Country Link
US (1) US20230063566A1 (zh)
EP (1) EP4092944A4 (zh)
KR (1) KR20220125738A (zh)
CN (1) CN111901082A (zh)
BR (1) BR112022014086A2 (zh)
WO (1) WO2021143529A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111901082A (zh) * 2020-01-16 2020-11-06 中兴通讯股份有限公司 信号处理方法、装置、第一通信节点和第二通信节点

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1171662A (zh) * 1996-07-19 1998-01-28 日本电气株式会社 能在出现故障时避免中断的发射机
CN1951077A (zh) * 2004-03-05 2007-04-18 高通股份有限公司 Miso和mimo系统的导频传输和信道估计
CN101064528A (zh) * 2006-04-30 2007-10-31 鼎桥通信技术有限公司 导频序列生成方法、装置及小区初始搜索方法和系统
WO2007126280A2 (en) * 2006-05-01 2007-11-08 Lg Electronics Inc. Method and apparatus for generating code sequence in a communication system
CN111901082A (zh) * 2020-01-16 2020-11-06 中兴通讯股份有限公司 信号处理方法、装置、第一通信节点和第二通信节点
CN111901891A (zh) * 2020-01-16 2020-11-06 中兴通讯股份有限公司 数据处理方法、装置、第一通信节点和第二通信节点

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106161299B (zh) * 2015-03-24 2019-02-15 中兴通讯股份有限公司 一种数据传输方法及装置
EP4117247A1 (en) * 2015-06-30 2023-01-11 Huawei Technologies Co., Ltd. Pilot sequence transmission method and apparatus

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1171662A (zh) * 1996-07-19 1998-01-28 日本电气株式会社 能在出现故障时避免中断的发射机
CN1951077A (zh) * 2004-03-05 2007-04-18 高通股份有限公司 Miso和mimo系统的导频传输和信道估计
CN101064528A (zh) * 2006-04-30 2007-10-31 鼎桥通信技术有限公司 导频序列生成方法、装置及小区初始搜索方法和系统
WO2007126280A2 (en) * 2006-05-01 2007-11-08 Lg Electronics Inc. Method and apparatus for generating code sequence in a communication system
CN111901082A (zh) * 2020-01-16 2020-11-06 中兴通讯股份有限公司 信号处理方法、装置、第一通信节点和第二通信节点
CN111901891A (zh) * 2020-01-16 2020-11-06 中兴通讯股份有限公司 数据处理方法、装置、第一通信节点和第二通信节点

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4092944A4

Also Published As

Publication number Publication date
EP4092944A1 (en) 2022-11-23
CN111901082A (zh) 2020-11-06
KR20220125738A (ko) 2022-09-14
BR112022014086A2 (pt) 2022-09-13
EP4092944A4 (en) 2024-02-28
US20230063566A1 (en) 2023-03-02

Similar Documents

Publication Publication Date Title
Mohammadkarimi et al. Signature-based nonorthogonal massive multiple access for future wireless networks: Uplink massive connectivity for machine-type communications
US11658772B2 (en) Electronic device and communication method for non-orthogonal-resource based multiple access
US10700838B2 (en) System and method for increasing low density signature space
WO2014067101A1 (zh) 扰码序列的配置方法、装置、用户设备与基站
US11381340B2 (en) Data transmission method and apparatus and storage medium
CN107710853B (zh) 传输信息的方法和设备
WO2021143528A1 (zh) 数据处理方法、装置、第一通信节点、第二通信节点及存储介质
WO2017076102A1 (zh) 数据处理方法及装置
US11785628B2 (en) Device and method for associating resource information with channel metric information in wireless networks
WO2021143529A1 (zh) 信号处理方法、装置、第一通信节点、第二通信节点及存储介质
WO2021143632A1 (zh) 数据传输方法、装置、第一通信节点和第二通信节点
US10979263B2 (en) Data processing method and device
WO2022002005A1 (zh) 一种序列生成方法及相关设备
WO2021143470A1 (zh) 参考信号处理方法、装置、第一通信节点和第二通信节点
US20230224110A1 (en) Data transmission method and apparatus, transmitter, receiver, and storage medium
WO2021031874A1 (zh) 信号传输方法和通信装置
CN109565811B (zh) 一种数据调度方法及装置、计算机存储介质
CN112753257A (zh) 由用户设备、基站执行的方法以及用户设备和基站
CN110719152A (zh) 一种上行发送方法和发送端

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20914086

Country of ref document: EP

Kind code of ref document: A1

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112022014086

Country of ref document: BR

ENP Entry into the national phase

Ref document number: 20227028016

Country of ref document: KR

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2020914086

Country of ref document: EP

Effective date: 20220816

ENP Entry into the national phase

Ref document number: 112022014086

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20220715