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

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

Info

Publication number
WO2021143528A1
WO2021143528A1 PCT/CN2020/141211 CN2020141211W WO2021143528A1 WO 2021143528 A1 WO2021143528 A1 WO 2021143528A1 CN 2020141211 W CN2020141211 W CN 2020141211W WO 2021143528 A1 WO2021143528 A1 WO 2021143528A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
sequences
pilot
sequence set
data
Prior art date
Application number
PCT/CN2020/141211
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 CA3164179A priority Critical patent/CA3164179A1/en
Priority to US17/792,374 priority patent/US20230056333A1/en
Priority to EP20913723.1A priority patent/EP4093138A4/en
Publication of WO2021143528A1 publication Critical patent/WO2021143528A1/zh

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/10Code generation
    • H04J13/102Combining codes
    • H04J13/107Combining codes by concatenation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B1/00Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69Spread spectrum techniques
    • H04B1/707Spread spectrum techniques using direct sequence modulation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0077Multicode, e.g. multiple codes assigned to one user
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0006Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/0001Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0023Systems modifying transmission characteristics according to link quality, e.g. power backoff characterised by the signalling
    • H04L1/0027Scheduling of signalling, e.g. occurrence thereof
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048Allocation of pilot signals, i.e. of signals known to the receiver
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B2201/00Indexing scheme relating to details of transmission systems not covered by a single group of H04B3/00 - H04B13/00
    • H04B2201/69Orthogonal indexing scheme relating to spread spectrum techniques in general
    • H04B2201/707Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation
    • H04B2201/70701Orthogonal indexing scheme relating to spread spectrum techniques in general relating to direct sequence modulation featuring pilot assisted reception
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J11/00Orthogonal multiplex systems, e.g. using WALSH codes
    • H04J11/0023Interference mitigation or co-ordination
    • H04J11/0026Interference mitigation or co-ordination of multi-user interference
    • H04J11/0036Interference mitigation or co-ordination of multi-user interference at the receiver
    • H04J11/004Interference mitigation or co-ordination of multi-user interference at the receiver using regenerative subtractive interference cancellation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0007Code type
    • H04J13/004Orthogonal
    • H04J13/0048Walsh
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J13/00Code division multiplex systems
    • H04J13/0007Code type
    • H04J13/0055ZCZ [zero correlation zone]
    • H04J13/0059CAZAC [constant-amplitude and zero auto-correlation]
    • H04J13/0062Zadoff-Chu
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0833Random access procedures, e.g. with 4-step access
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE 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/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • This application relates to the field of communications, such as data 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.
  • the transmitter randomly selects multiple pilot sequences, and the receiver uses multiple pilots to identify and detect users.
  • the digitally modulated symbols can be expanded with a spread sequence before resource mapping and transmission are performed.
  • how to perform data processing so that the two communication parties can communicate is a technical problem to be solved urgently.
  • This application provides data processing methods, devices, first communication nodes, second communication nodes, and storage media.
  • the embodiment of the present application provides a data processing method, which is applied to a first communication node, and includes:
  • N is an integer greater than or equal to 2.
  • An embodiment of the present application also provides a data processing method applied to a second communication node, including:
  • N is an integer greater than or equal to 2
  • M is an integer greater than or equal to 1.
  • An embodiment of the present application also provides a data processing device, which is configured in a first communication node, and includes:
  • the obtaining module is configured to obtain N first sequences; the determining module is configured to determine a second sequence based on at least one first sequence in the N first sequences; and the processing module is configured to determine a second sequence based on the second sequence
  • the data is processed to obtain data symbols; the sending module is configured to send the N first sequences and the data symbols, where N is an integer greater than or equal to 2.
  • An embodiment of the present application also provides a data processing device, which is configured in a second communication node, and includes:
  • the receiving module is set to receive signals and data symbols, the signal is generated based on N first sequences, where N is an integer greater than or equal to 2; the detection module is set to detect the signal to obtain the generated signal The M sequences of the signal, and according to the M sequences, a second sequence corresponding to the data symbol is determined, where M is an integer greater than or equal to 1; The said data symbol is tested and the test result is obtained.
  • 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 data 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 data processing method applied to the second communication node in the application embodiment.
  • the embodiments of the present application also provide a storage medium that stores a computer program, and when the computer program is executed by a processor, any one of the data processing methods in the embodiments of the present application is implemented.
  • Figure 1 is a schematic flow chart of a data processing method provided by 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
  • Figure 1c is a schematic diagram of the CDF distribution of sequence cross-correlation values provided by this application.
  • Figure 1d is a schematic diagram of the CDF distribution of another sequence cross-correlation value provided by this application.
  • FIG. 2 is a schematic flowchart of another data processing method provided by this application.
  • FIG. 3 is a schematic structural diagram of a data processing device provided by this application.
  • FIG. 4 is a schematic structural diagram of another data processing device provided by this application.
  • FIG. 5 is a schematic structural diagram of a first communication node provided by this application.
  • Fig. 6 is a schematic structural diagram of a second communication node provided by this application.
  • FIG. 1 is a schematic flow chart of a data processing method provided by this application, and the method may be suitable for data processing in the case of multi-pilot-based free-scheduled transmission and extended combination.
  • the method can be executed by the data processing device provided by the present application, and the data processing device can be implemented by software and/or hardware, and is generally integrated on the first communication node, which can be any type of wireless user equipment.
  • pilot sequences For the multi-pilot-based competition-free scheduling transmission scheme, multiple independent or randomly selected pilot sequences will be designed on the transmitting side (such as the first communication node side), and the receiving side (such as the second communication node side) will use multiple A pilot frequency for user identification and detection. Then, when combined with expansion, when using a spreading sequence to spread the data modulation symbol and then send it, it is necessary to solve how to design the pilot sequence, and establish the correlation between the pilot sequence and the spreading sequence, and how the receiver is based on it.
  • the identified pilot sequence determines the spreading sequence used by the transmitter, thereby realizing data detection.
  • This application realizes the competition-free scheduling transmission based on the combination of multiple pilots and extensions.
  • the data processing method provided by this application includes S110, S120, S130, and S140.
  • one first sequence may correspond to one pilot, or may be a pilot sequence used by one pilot.
  • 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.
  • S120 Determine a second sequence according to at least one first sequence in the N first sequences.
  • N relationships between the first sequence and the second sequence can be constructed, and the second sequence is used to process the data.
  • the second sequence may be a sequence determined according to at least one sequence among the N first sequences.
  • this step may determine the combined sequence based on the N first sequences, and then determine the second sequence based on the combined sequence.
  • the merging sequence is a sequence obtained after merging N first sequences, and the merging processing includes superimposition processing or serial combination processing. Among them, the superposition processing can be regarded as superimposing the N first sequences, that is, adding them. Concatenation includes directly concatenating each first sequence, that is, concatenating the sequence, or concatenating each element in each first sequence in a certain order, that is, concatenating the elements, such as extracting the first of each first sequence when concatenating Element, and then extract the second element of each first sequence, and so on, to complete the series combination.
  • this step may determine the second sequence according to one first sequence among the N sequences.
  • the second sequence When the second sequence is determined according to a first sequence among the N first sequences, the second sequence may be determined based on the first sequence and the corresponding relationship between the first sequence and the second sequence.
  • the first sequence can be considered as the first sequence used to determine the second sequence among the N first sequences.
  • the correspondence between the first sequence and the second sequence may be pre-built. For example, based on the first sequence set to which the first sequence belongs and the second sequence set to which the second sequence belongs, the correspondence between the first sequence and the second sequence is determined.
  • the first sequence in the first sequence set and the second sequence in the second sequence set may be a one-to-one relationship or a many-to-one relationship.
  • this step may determine the second sequence according to multiple first sequences among the N first sequences.
  • the combined sequence may be determined based on the multiple first sequences, and then the second sequence may be determined based on the combined sequence and the correspondence between the combined sequence and the second sequence.
  • the combined sequence may be a sequence obtained by combining multiple first sequences.
  • the correspondence between the combined sequence and the second sequence may be pre-built, for example, determined based on the correspondence between the combined sequence set and the second sequence set.
  • the combined sequence set may be determined based on the sequence set to which the plurality of first sequences belong. For example, traversing and extracting multiple first sequences in the sequence set to which the multiple first sequences belong, and performing merging processing to obtain a merged sequence set.
  • the length of the second sequence may be T, and T is an integer greater than or equal to 2.
  • the data is processed based on the second sequence to obtain data symbols.
  • the processing method is not limited, and it can be determined based on the role of the second sequence.
  • the data may be expanded, modulated, or mapped based on the second sequence.
  • N first sequences and data symbols can be sent for the second communication node to receive and process.
  • the N first sequences can be directly mapped on different transmission resources; the N sequences can also be merged and mapped on the transmission resources.
  • a data processing method provided by this application, applied to a first communication node includes: acquiring N first sequences; determining a second sequence based on at least one first sequence among the N first sequences; The second sequence processes the data to obtain data symbols; sends the N first sequences and the data symbols; where N is an integer greater than or equal to 2.
  • the method can realize the combination of multi-pilot and extended transmission, which is beneficial to improve user transmission performance and system performance.
  • the N first sequences are obtained randomly.
  • the acquiring 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 determining the second sequence according to at least one first sequence among the N first sequences includes:
  • the N first sequences when the combined sequence is determined, the N first sequences may be combined to obtain the combined sequence.
  • the combination processing includes superimposition processing or serial combination processing.
  • the combined sequence can also be obtained by other combined processing methods. For example, assuming there are two first sequences, the elements of the two first sequences can be used as the real part and the imaginary part, respectively, to obtain a combined sequence.
  • the determining a merge sequence according to the N first sequences includes:
  • the length of the combined sequence is L or N*L.
  • the length of the combined sequence is L; when using series combination processing, the length of the combined sequence is N*L.
  • the determining the second sequence according to at least one first sequence among the N first sequences includes:
  • the second sequence is determined according to a first sequence among the N first sequences and the corresponding relationship between the first sequence and the second sequence.
  • the processing performed on the data based on the second sequence includes one of the following: expansion processing; modulation processing; and mapping processing.
  • sending the N first sequences includes one of the following:
  • the N first sequences are mapped to different transmission resources to generate a signal and sent; the N first sequences are merged and then mapped to the transmission resource to generate a signal and send; wherein, the merging process Including series combination processing or superposition processing.
  • one first sequence corresponds to one pilot.
  • the transmission resources used by the pilots corresponding to the N first sequences include one of the following: time-division resources; frequency-division resources; time-frequency division resources; code-division resources; randomly selected resource.
  • the pilots respectively corresponding to the N first sequences include N pilots.
  • the data carries information, 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 first sequence of the N first sequences; the identification information of the second sequence; the identification information of the first 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 that identifies the energy of the corresponding sequence (for example, at least one first 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 data processing method described in the present application can be regarded as a data transmission method.
  • scheduling-free transmission can reduce signaling overhead and transmission delay, and can also reduce terminal power consumption.
  • 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
  • Figure 1b is a schematic diagram of the transmission frame structure of a contention-free scheduling scheme based on "multi-pilot + data".
  • the main idea of the multi-pilot scheme is to design multiple independents under the same resource overhead. Or a randomly selected pilot.
  • 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 competition-free scheduling scheme based on "multi-pilot + data" can reduce the collision rate, thereby increasing the number of access users.
  • the "data" part can still use the traditional processing procedures, including channel coding, digital modulation, resource mapping and transmission, etc. It is also possible to consider combining with extension, and use the extension sequence to extend the digitally modulated symbols before performing resource mapping and transmission. This is similar to extended-based multiple access or code division multiple access.
  • the spreading sequence used can be from an orthogonal or non-orthogonal spreading sequence set. Using the spreading sequence to expand the symbols can obtain diversity gain to improve user transmission performance, and can also increase the number of access users through code domain multiplexing, and it is also conducive to inter-cell interference suppression to improve system performance.
  • the traditional competition-free scheduling scheme based on single pilot is easier to combine with extension. For example, a one-to-one relationship or a many-to-one relationship can be established between the pilot sequence and the spreading sequence.
  • Each terminal determines the corresponding spreading sequence according to the selected pilot sequence, and then uses the spreading sequence to expand the modulation symbol handle.
  • the spreading sequences used by the two terminals are also the same.
  • the receiver performs pilot identification, and determines the spreading sequence used by the terminal according to the identified pilot sequence for data detection.
  • the transmitter randomly selects multiple pilot sequences, and the receiver uses multiple pilots to perform user identification and detection. Then, when combined with the extension, due to multiple independent Or the randomly selected pilot and the spreading sequence cannot directly establish an association relationship like the above-mentioned traditional scheme. Therefore, it is necessary to solve how to design the pilot sequence and establish the association relationship between the pilot sequence and the spreading sequence, and how the receiver The spreading sequence is determined according to the recognized pilot sequence.
  • a data processing method includes: obtaining two pilot sequences (ie, the first sequence); and jointly determining the spread sequence to be used (ie, the second sequence) according to the two pilot sequences. ); use the spread sequence to process the data to generate the data symbol to be sent; send the two pilot sequences and the data symbol.
  • the data processing method may further include: obtaining two pilot sequences P1 and P2 (ie the first sequence); determining the extended sequence to be used (ie the second sequence) according to the pilot sequence P1 or the pilot sequence P2; using The spread sequence processes the data to generate data symbols to be sent; and sends two pilot sequences and the data symbols.
  • the total time-frequency resource overhead occupied by the pilot is 24 Resource Elements (RE).
  • RE Resource Elements
  • the pilot sequences of the two pilots all come from a sequence set A, which includes 12 orthogonal sequences with a length of 12.
  • the resources occupied by the two pilots can be time-division, frequency-division, or time-frequency division.
  • the terminal first obtains two pilot sequences (that is, the first sequence). Including, the terminal randomly selects two sequences from the sequence set A as the pilot sequence P1 and the pilot sequence P2, respectively. Then, the pilot sequences P1 and P2 are a sequence of length 12 respectively.
  • Combining two pilot sequences can be equivalent to a sequence with a length of 24. Since the 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. 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. Among them, combining the two sequences includes: combining the two sequences in series, or combining the elements of the two sequences in a specified order.
  • the extension sequence (ie, the second sequence) used by the terminal comes from an extension sequence set C.
  • the 144 sequences in the sequence set B can correspond to the 144 extended sequences in the extended sequence set C in a one-to-one correspondence.
  • sequences in the sequence set B there may be a many-to-one relationship between the sequences in the sequence set B and the sequences in the extended sequence set C.
  • the extended sequence set C contains 36 sequences
  • four sequences in the sequence set B can be made to correspond to one sequence in the extended sequence set C.
  • a mixed correspondence can also be considered.
  • MN(X-1) there are (MN(X-1))*X sequences in sequence set B and MN(X-1) sequences in sequence set C are X to 1
  • the relationship between the (N*XM)*(X-1) sequences in the sequence set B and the N*XM sequences in the sequence set C is (X-1) to 1 relationship.
  • the extended sequence set C contains 12 extended sequences
  • 12 sequences in the sequence set B can be made to correspond to 1 sequence in the extended sequence set C.
  • the sequence set A also contains 12 sequences
  • a specified sequence can be obtained from the sequence set A as the pilot sequence P1, and then any sequence from the sequence set A as the pilot sequence P2, then the pilot sequence P2 has 12
  • the combination of the two can generate 12 sequences in sequence set B, and the generated 12 sequences can correspond to one sequence in extended sequence set C. Then, you can see that this is actually The above is equivalent to the pilot sequence P1 corresponding to one sequence in the extended sequence set C.
  • the number of sequences in the extended sequence set C is the same as the number of sequences in the sequence set A, and the corresponding relationship can be established between the sequences in the sequence set A and the sequences in the extended sequence set C, or in the guide A corresponding relationship is established between the frequency sequence P1 or the pilot sequence P2 and the sequences in the spread sequence set C.
  • the terminal performs the following operations: the terminal jointly determines the extended sequence to be used (that is, the second sequence) according to the acquired two pilot sequences, and the terminal according to the long sequence formed by the two pilot sequences and the extended sequence in the extended sequence set C The relationship or correspondence between the two pilot sequences to determine the extended sequence to be used; the terminal can determine the long sequence composed of the two pilot sequences in the sequence set B according to the indexes of the two pilot sequences obtained from the sequence set A Index, and then, according to the index and the association relationship or correspondence between the sequence in the sequence set B and the sequence in the extended sequence set C, the index of the corresponding extended sequence is determined, so as to determine the extended sequence to be used.
  • the terminal jointly determines the extended sequence to be used (that is, the second sequence) according to the acquired two pilot sequences, and the terminal according to the long sequence formed by the two pilot sequences and the extended sequence in the extended sequence set C The relationship or correspondence between the two pilot sequences to determine the extended sequence to be used; the terminal can determine the long sequence composed
  • the spreading sequences used by the two terminals are also the same.
  • the terminal performs the following operation: the terminal determines the spreading sequence to be used according to the acquired pilot sequence P1 or the pilot sequence P2.
  • the terminal determines the spreading sequence to be used according to the pilot sequence P1; when the two terminals randomly select the pilot sequence P1 When the same, the extended sequence used by the two terminals is also the same.
  • the terminal determines the spreading sequence to be used according to the pilot sequence P2; when the two terminals randomly select the pilot When the sequence P2 is the same, the extended sequences used by the two terminals are also the same.
  • the sequences contained in the aforementioned extended sequence set C may be mutually orthogonal or non-orthogonal; they may be real or complex sequences; they may be non-sparse sequences or sparse sequences; and so on.
  • an extended sequence with a shorter length such as a length of 4, can be used.
  • the terminal uses the determined spreading sequence to process the data to generate data symbols to be sent.
  • the terminal uses the determined spreading sequence to perform spreading processing on the modulation symbol, that is, the data symbol, to generate the data symbol to be sent.
  • the determined spreading sequence is a sequence pattern, and the sequence pattern is used to indicate the position where the modulation symbol is mapped onto the transmission resource.
  • the determined spreading sequence is a sequence pattern, and the terminal determines or generates a sequence set or codebook according to the sequence pattern, and then the terminal uses the sequence set or codebook to modulate or map the data bits to generate The data symbol to be sent.
  • the terminal sends the obtained two pilot sequences and the generated data symbols to be sent.
  • the terminal maps the two acquired pilot sequences and the generated data symbols to be sent to transmission resources, and then generates a transmission signal for transmission.
  • 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.
  • a set B containing 144 non-orthogonal sequences with a length of 24 can be constructed.
  • Figure 1c is a kind of sequence cross-correlation value provided by this application. Schematic diagram of CDF distribution. Referring to Figure 1c, about 85% of the sequences have a cross-correlation value of 0, and about 15% of the sequences have a cross-correlation value of 0.5.
  • Table 1 A collection table of sequence collection A
  • Table 2 is another set table of sequence set A.
  • the pilot sequence set that is, the sequence set A may also be the sequence set shown in Table 2.
  • the sequence set also contains 12 sequences with a length of 12 Each sequence is sparse, and can be regarded as a combination of a comb-like structure containing 3 combs and a set of 4 orthogonal Hada code sequences with a length of 4.
  • 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 1c.
  • 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.
  • the non-orthogonal sequence set B is obtained by combining two (same) orthogonal sequence sets, and most of the sequences are still orthogonal to each other, and the sequence cross-correlation value is generally low.
  • Non-orthogonal sequence set B has good sequence structure characteristics and cross-correlation characteristics.
  • the candidate pilot set can be considered to include candidate pilot resources and sequences in the orthogonal sequence set. Therefore, in this embodiment, the pilot sequence and the pilot frequency can generally be regarded as equivalent.
  • the description of the pilot sequence in the above description can usually be replaced with the description of the pilot, which is not limited in this embodiment. .
  • the sequence set A may also be other orthogonal sequence sets or non-orthogonal sequence sets, for example, a comb-like resource structure including 6 combs and a combination of 2 orthogonal Hada code sequence sets of length 2
  • the UE uses multiple pilot sequences, and when multiple UEs use the same time-frequency resource for transmission, the pilot collision rate is lower.
  • the UE can determine the spreading sequence it uses according to the multiple pilots it uses. Support the UE to use the spread sequence to spread and transmit the data symbols, so that diversity gain can be obtained, which is beneficial to improve the transmission performance of the user.
  • the receiver can realize data reception detection by identifying and detecting the joint pilot sequence used by the UE, and correspondingly determining the extended sequence used by the UE.
  • a joint pilot sequence ie, a combined sequence
  • the joint pilot sequence comes from a non-orthogonal sequence set with a larger number of sequences, and the non-orthogonal sequence
  • the sequence set has good sequence structure characteristics and cross-correlation characteristics. That is to say, the joint pilot sequence used by each UE comes from the non-orthogonal sequence set, which is non-orthogonal and has a low collision probability, so the receiver can use it
  • the non-orthogonal sequence set and its good sequence structure characteristics and cross-correlation characteristics are used for reception detection, and better reception detection performance is obtained.
  • the expanded data symbols of multiple UEs can be transmitted on the same time-frequency resource, which can realize code-domain multiplexing, which is beneficial to increase the number of access users and is also beneficial to inter-cell interference.
  • Inhibit which can improve system performance.
  • the total time-frequency resource overhead occupied by the pilot is 24 resource elements.
  • the pilot sequences P1 and P2 ie, the first sequence
  • the sequence set A1 includes 12 orthogonal sequences with a length of 12
  • the sequence set A2 includes 12 orthogonal sequences with a length of 12.
  • the resources occupied by the two pilots can be time-division, frequency-division, or time-frequency division.
  • the terminal first obtains two pilot sequences (that is, the first sequence). Including, the terminal randomly selects a sequence from the sequence set A1 as the pilot sequence P1, and randomly selects a sequence from the sequence set A2 as the pilot sequence P2. Then, the pilot sequences P1 and P2 are a sequence of length 12 respectively.
  • 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.
  • the extension sequence (ie, the second sequence) used by the terminal comes from an extension sequence set C. It is possible to make the sequences in the sequence set B correspond to the sequences in the extended sequence set C on a one-to-one basis, or there is a many-to-one relationship between the sequences in the sequence set B and the sequences in the extended sequence set C. It is also possible to establish a corresponding relationship between the sequence in the sequence set A1 or A2 and the sequence in the extended sequence set C, or establish a corresponding relationship between the pilot sequence P1 or the pilot sequence P2 and the sequence in the extended sequence set C.
  • the terminal performs the following operations: the terminal jointly determines the spreading sequence to be used according to the acquired two pilot sequences; or the terminal determines the spreading sequence to be used according to the acquired pilot sequence P1 or the pilot sequence P2.
  • the terminal uses the determined spreading sequence to process the data to generate data symbols to be sent. Finally, the terminal sends the obtained two pilot sequences and the generated data symbols to be sent.
  • the total time-frequency resource overhead occupied by the pilot is 24 resource elements.
  • the pilot sequence P1 comes from the sequence set A1
  • the pilot sequence P2 comes from the sequence set A2.
  • the sequence set A1 and the sequence set A2 are derived 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.
  • 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.
  • the length of the two pilot sequences is 24. Then, the two pilots can occupy the same time-frequency resources, and the two pilots are code-divided.
  • the terminal first obtains two pilot sequences (that is, the first sequence). Including, the terminal randomly selects a sequence from the sequence set A1 as the pilot sequence P1, and randomly selects a sequence from the sequence set A2 as the pilot sequence P2. Then, the pilot sequences P1 and P2 are a sequence with a length of 24, respectively.
  • the two pilot sequences can be superimposed and then mapped to the corresponding time-frequency resources for transmission, that is to say ,
  • the final transmission is the sum of the pilot sequences P1 and P2, and the sum of the two is also a sequence of length 24.
  • the two pilot sequences can be specified before the superposition processing, or the obtained sequence can be specified after the superposition processing.
  • the specified processing includes energy adjustment, energy normalization, power adjustment, amplitude adjustment, and phase Adjustment, precoding processing, scrambling processing, etc.
  • sequence set A1 includes 12 orthogonal sequences with a length of 24
  • 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.
  • 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.
  • the extension sequence used by the terminal comes from an extension sequence set C. It is possible to make the sequences in the sequence set B correspond to the sequences in the extended sequence set C on a one-to-one basis, or there is a many-to-one relationship between the sequences in the sequence set B and the sequences in the extended sequence set C. It is also possible to establish a corresponding relationship between the sequence in the sequence set A1 or A2 and the sequence in the extended sequence set C, or establish a corresponding relationship between the pilot sequence P1 or the pilot sequence P2 and the sequence in the extended sequence set C.
  • the terminal performs the following operations: the terminal jointly determines the spreading sequence to be used (that is, the second sequence) according to the acquired two pilot sequences (that is, the first sequence); or, the terminal according to the acquired pilot sequence P1 or The pilot sequence P2 determines the spreading sequence to be used.
  • the terminal uses the determined spreading sequence to process the data to generate data symbols to be sent. Finally, the terminal sends the obtained two pilot sequences and the generated data symbols to be sent.
  • Table 3 is a set table of another sequence set A, and 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 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 obtained, and the cross-correlation characteristics between the sequences in the sequence set B are the same as the characteristics shown in FIG. 1c.
  • Table 4 is another set table of sequence set A.
  • Sequence set A can also be a sequence set as shown in Table 4.
  • the sequence set also contains 24 orthogonal sequences of length 24, each The sequence is sparse, and can be seen as a combination of a comb-like structure containing 3 combs and a set of 8 orthogonal Hada code sequences 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 containing 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. 1c.
  • the resources occupied by the two pilots can be time-division , Or frequency division, or time frequency division.
  • sequence set B includes 144 sequences with a length of 48. Moreover, the sequence set B is a non-orthogonal sequence set.
  • the extension sequence (ie, the second sequence) used by the terminal comes from an extension sequence set C. It is possible to make the sequences in the sequence set B correspond to the sequences in the extended sequence set C on a one-to-one basis, or there is a many-to-one relationship between the sequences in the sequence set B and the sequences in the extended sequence set C. It is also possible to establish a corresponding relationship between the sequence in the sequence set A1 or A2 and the sequence in the extended sequence set C, or establish a corresponding relationship between the pilot sequence P1 or the pilot sequence P2 and the sequence in the extended sequence set C.
  • the terminal performs the following operations: the terminal jointly determines the spreading sequence to be used (that is, the second sequence) according to the acquired two pilot sequences (that is, the first sequence); or, the terminal according to the acquired pilot sequence P1 or The pilot sequence P2 determines the spreading sequence to be used.
  • the terminal uses the determined spreading sequence to process the data to generate data symbols to be sent. Finally, the terminal sends the obtained two pilot sequences and the generated data symbols to be sent.
  • 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 set B of 48 non-orthogonal sequences, and the cross-correlation characteristics between the sequences in the sequence set B are the same as the characteristics shown in FIG. 1c.
  • 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 non-orthogonal sequence set B of 48, and the cross-correlation characteristics between the sequences in the sequence set B are also the same as the characteristics shown in FIG. 1c.
  • the total time-frequency resource overhead occupied by the pilot is 24 resource elements.
  • the pilot P1 is composed of a sequence S1 and a sequence Y1
  • the pilot P2 is composed of a sequence S2 and a sequence Y2.
  • the sequence S1 and the sequence S2 are from the sequence collection S
  • the sequence Y1 and the sequence Y2 are from the sequence collection Y.
  • sequence set S 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 for pilot P1
  • the second sequence in sequence set Y is used as sequence Y2 for pilot P2.
  • the terminal first obtains two pilots P1 and P2. Including: randomly select a sequence from the sequence set S as the sequence S1, obtain the first sequence Y1 in the sequence set Y, and obtain the pilot P1 according to the sequence S1 and the sequence Y1.
  • the sequence S1 is a sequence of length 12, which can be expressed as a vector of 12*1
  • the sequence Y1 is a sequence of length 2, which can be expressed as a vector of 1*2.
  • the sequence S1 and the sequence Y1 are subjected to matrix multiplication operations to obtain A 12*2 matrix is used as the pilot P1, and the matrix can be converted into a sequence with a length of 24, which is used as the pilot sequence for the pilot P1 (that is, the first sequence).
  • the pilot P2 and the pilot sequence used by the pilot P2 can also be obtained.
  • the pilot sequences P1 and P2 are a sequence with a length of 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.
  • the length of the two pilot sequences is 24. Then, the two pilots can occupy the same time-frequency resources, and the two pilots are code-divided. The two pilot sequences can be superimposed, and then mapped to the corresponding time-frequency resources for transmission.
  • each sequence in the sequence set S can be operated with the first sequence Y1 in the sequence set Y to obtain a new sequence set A1, which is equivalent to 12 sequences with a length of 24 Orthogonal sequence, in the same way, each sequence in the sequence set S can be operated with the second sequence Y2 in the sequence set Y to obtain a new sequence set A2, which also contains 12 sequences of length 24. Orthogonal sequence. Then, it can be equivalently considered that the pilot sequence P1 comes from the sequence set A1, and the pilot sequence P2 comes from the sequence set A2.
  • sequences in the sequence set S and any sequence in the sequence set Y can be obtained, and a total of 24 orthogonal sequences of length 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 the two pilots P1 and P2, it can also randomly select a sequence from the half of the sequence set S as the sequence S1, and randomly select a sequence from the sequence set Y as the sequence Y1, according to the sequence S1 Get pilot P1 with sequence Y1; in the same way, randomly select a sequence from the other half of the sequence set S as sequence S2, randomly select a sequence from sequence set Y as sequence Y2, and obtain pilots according to sequence S2 and sequence Y2 P2.
  • sequence set B By superposing any sequence in the sequence set A1 and any sequence in the sequence set A2, 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.
  • the extension sequence used by the terminal comes from an extension sequence set C. It is possible to make the sequences in the sequence set B correspond to the sequences in the extended sequence set C on a one-to-one basis, or there is a many-to-one relationship between the sequences in the sequence set B and the sequences in the extended sequence set C. It is also possible to establish a corresponding relationship between the sequence in the sequence set A1 or A2 and the sequence in the extended sequence set C, or establish a corresponding relationship between the pilot sequence P1 or the pilot sequence P2 and the sequence in the extended sequence set C.
  • the terminal performs the following operations: the terminal jointly determines the spreading sequence to be used according to the acquired two pilot sequences; or the terminal determines the spreading sequence to be used according to the acquired pilot sequence P1 or the pilot sequence P2.
  • the terminal uses the determined spreading sequence to process the data to generate data symbols to be sent. Finally, the terminal sends the obtained two pilot sequences and the generated data symbols to be sent.
  • the sequence set S may be a set of 12 orthogonal Hada code sequences of length 12 shown in Table 1, or a set of 12 orthogonal sequences of 12 length shown in Table 2.
  • Table 5 is a collection table of sequence collection Y, and sequence collection Y is shown in Table 5.
  • the sequence set A1 and the sequence set A2 respectively contain 12 sequences with a length of 24; according to the sequence set A1 and the sequence set A2, a non-orthogonal sequence set B with a length of 24 can be constructed. And, the cross-correlation feature between the sequences in the sequence set B is the same as the feature shown in FIG. 1c.
  • the resources occupied by the two pilots can be time-division , Or frequency division, or time frequency division.
  • sequence set B includes 144 sequences with a length of 48. Moreover, the sequence set B is a non-orthogonal sequence set.
  • the extension sequence used by the terminal comes from an extension sequence set C. It is possible to make the sequences in the sequence set B correspond to the sequences in the extended sequence set C on a one-to-one basis, or there is a many-to-one relationship between the sequences in the sequence set B and the sequences in the extended sequence set C. It is also possible to establish a corresponding relationship between the sequence in the sequence set A1 or A2 and the sequence in the extended sequence set C, or establish a corresponding relationship between the pilot sequence P1 or the pilot sequence P2 and the sequence in the extended sequence set C.
  • the terminal performs the following operations: the terminal jointly determines the spreading sequence to be used (that is, the second sequence) according to the acquired two pilot sequences (that is, the first sequence); or, the terminal according to the acquired pilot sequence P1 or The pilot sequence P2 determines the spreading sequence to be used.
  • the terminal uses the determined spreading sequence to process the data to generate data symbols to be sent. Finally, the terminal sends the obtained two pilot sequences and the generated data symbols to be sent.
  • the sequence set S 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 S and the sequence set Y, which respectively contain 12 sequences with a length of 24; according to the sequence set A1 and the sequence set A2 can construct a set B of 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 the characteristics shown in FIG. 1c.
  • the total time-frequency resource overhead occupied by the pilot is 48 resource elements.
  • the pilot sequences (ie, the first sequence) of the two pilots are all from a sequence set A, and the sequence set A includes 24 orthogonal sequences with a length of 24.
  • the resources occupied by the two pilots may be time-division, frequency-division, or time-frequency division.
  • the terminal first obtains two pilot sequences. Including, the terminal randomly selects two sequences from the sequence set A as the pilot sequence P1 and the pilot sequence P2, respectively. Then, the pilot sequences P1 and P2 are a sequence with a length of 24 respectively.
  • 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.
  • the extension sequence used by the terminal comes from an extension sequence set C. It is possible to make the sequences in the sequence set B correspond to the sequences in the extended sequence set C on a one-to-one basis, or there is a many-to-one relationship between the sequences in the sequence set B and the sequences in the extended sequence set C. It is also possible to establish a corresponding relationship between the sequences in the sequence set A and the sequences in the extended sequence set C, or establish a corresponding relationship between the pilot sequence P1 or the pilot sequence P2 and the sequences in the extended sequence set C.
  • the terminal performs the following operations: the terminal jointly determines the spreading sequence to be used according to the acquired two pilot sequences; or the terminal determines the spreading sequence to be used according to the acquired pilot sequence P1 or the pilot sequence P2.
  • the terminal uses the determined spreading sequence to process the data to generate data symbols to be sent.
  • the terminal sends the obtained two pilot sequences and the generated data symbols to be sent.
  • the sequence set A may be a set of 24 orthogonal Hada code sequences with a length of 24, as shown in Table 3.
  • a set B containing 576 non-orthogonal sequences of length 48 can be constructed.
  • Figure 1d is another sequence cross-correlation value provided by this application.
  • the CDF distribution diagram of the CDF, the CDF distribution of the cross-correlation value between each sequence is shown in Figure 1d, based on the cumulative distribution function (Cumulative Distribution Function, CDF) and the cross-correlation value, it can be seen that 92% of the sequence cross-correlation value The 0,8% sequence cross-correlation value is 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 be constructed, and the interaction between each sequence in the sequence set B
  • the relevant features are the same as those shown in Figure 1d above.
  • the data processing method provided in this application includes the following steps:
  • Obtain multiple pilot sequences (ie N first sequences); determine the second sequence according to multiple pilot sequences, or determine the second sequence according to one of the pilot sequences; use the second sequence to process the data to generate the data to be sent Data symbols; sending multiple pilot sequences, as well as data symbols.
  • the multiple pilot sequences are pilot sequences used by multiple pilots.
  • Randomly select or randomly generate multiple pilot sequences randomly select or randomly generate multiple sequences, and perform designated processing on the multiple sequences to obtain multiple pilot sequences.
  • the multiple pilot sequences are from one sequence set, or from multiple sequence sets, or from multiple subsequence sets of one sequence set, or are generated according to a preset rule.
  • the sequence set includes: a Hada code sequence set; or a sequence set obtained according to a Hada code sequence set; or a ZC sequence set; or a four-phase sequence set.
  • Determining the second sequence according to the multiple pilot sequences includes: obtaining a joint pilot sequence (ie, combined sequence) according to the multiple pilot sequences, and according to the association relationship or correspondence between the joint pilot sequence set and the second sequence set, The second sequence is determined by the obtained joint pilot sequence.
  • a joint pilot sequence ie, combined sequence
  • Obtaining the joint pilot sequence according to the multiple pilot sequences includes: performing serial combination processing or superposition processing on the multiple pilot sequences to obtain the joint pilot sequence.
  • Performing serial combination processing of multiple pilot sequences includes: serializing multiple pilot sequences, or combining elements of multiple pilot sequences in series in a specified order.
  • Determining the second sequence according to one of the pilot sequences includes: determining the second sequence through the pilot sequence according to the association or correspondence between the sequence set to which one of the pilot sequences belongs and the second sequence set; or, according to The association or correspondence between one of the pilot sequences and the sequences in the second sequence set determines the second sequence.
  • Using the second sequence to process the data to generate the data symbols to be sent includes: using the second sequence to perform expansion processing, or modulation processing, or mapping processing on the data bits or data symbols to generate the data symbols to be sent.
  • Send multiple pilot sequences including:
  • the designated processing is mapped to the transmission resource for transmission; wherein, the combining processing includes at least series combination processing or superimposing processing; wherein, the designated processing includes at least one of the following: scrambling processing, energy adjustment, power adjustment , Amplitude adjustment, phase adjustment, pre-coding processing.
  • the transmission resources used by the multiple pilot sequences are time-division, or frequency-division, or time-frequency-division, or code-division.
  • the transmission resources used by the multiple pilots are randomly selected or preset.
  • Send data symbols including:
  • the data symbol is mapped to a transmission resource for transmission; or the data symbol is subjected to designated processing and then mapped to the transmission resource for transmission; wherein the designated processing includes at least one of the following: scrambling Processing, energy adjustment, power adjustment, amplitude adjustment, phase adjustment, precoding processing.
  • the method further includes carrying information in the data, the information including identification information of a plurality of pilot sequences, such as generation information, index information, etc.; also including identification information of the second sequence; and further including identification information of the first communication node Identification information; it may also include: energy information of multiple pilot sequences or energy information of at least one pilot sequence.
  • FIG. 2 is a schematic flow diagram of another data processing method provided by this application.
  • the method can be integrated in a data processing device, which can be implemented by software and/or hardware, and Generally integrated on the second communication node, the second communication node may be a base station.
  • the data processing device provided by this application includes S210, S220, and S230.
  • S210 Receive a signal and a data symbol, where the signal is generated based on the N first sequences.
  • the signal may be a signal generated by mapping the N first sequences to different transmission resources; or a signal generated by mapping the N first sequences to the transmission resource after merging processing.
  • the signal and data symbols may be sent by the first communication node.
  • S220 Detect the signal to obtain M sequences for generating the signal, and determine a second sequence corresponding to the data symbol according to the M sequences.
  • the signal When the signal is detected in this step, the signal may be detected based on the combined sequence set or the sequence set to which at least one first sequence of the N first sequence sets belongs, to obtain M sequences that generate the signal.
  • the M sequences may be a combined sequence obtained from N first sequences; it may also be a first sequence; it may also be M first sequences.
  • the second sequence may be determined based on the correspondence between the M sequences and the second sequence.
  • the data symbols are detected, and the identity of the first communication node is determined based on the detection result, and interference cancellation is performed.
  • a data processing method provided by the present application includes: receiving a signal and data symbols, where the signal is generated based on N first sequences; detecting the signal to obtain M sequences for generating the signal, and according to The M sequences determine a second sequence corresponding to the data symbol; detect the data symbol according to the second sequence to obtain a detection result; where N is an integer greater than or equal to 2, and M is greater than or An integer equal to 1.
  • the method can realize the combination of multi-pilot and extended transmission, which is beneficial to improve user transmission performance and system performance.
  • the detecting the signal to obtain M sequences for generating the signal, and determining the second sequence corresponding to the data symbol according to the M sequences includes:
  • the signal is detected based on the combined sequence set to obtain M sequences that generate the signal, wherein the combined sequence set is determined based on the sequence set to which the N first sequences belong, and the M sequences include A combined sequence obtained from the N first sequences; and a second sequence corresponding to the data symbol is determined according to the combined sequence and the corresponding relationship between the combined sequence and the second sequence.
  • the method for determining the combined sequence set may refer to the technical method for determining the sequence set B by the first communication node, which is not limited here.
  • the M sequences may be one combined sequence. This is for each UE. If there are multiple UEs, the combined sequence obtained by the receiver through detection includes multiple UEs, that is to say, a combined sequence corresponding to each UE can be obtained. Then, as a whole, the receiver can detect multiple combined sequences.
  • the detecting the signal to obtain M sequences for generating the signal, and determining the second sequence corresponding to the data symbol according to the M sequences includes:
  • the signal is detected based on the combined sequence set to obtain M sequences that generate the signal, wherein the combined sequence set is determined based on the sequence set to which the N first sequences belong, and the M sequences include A combined sequence obtained from the N first sequences; determine the N first sequences according to the combined sequence; according to a first sequence among the N first sequences, and the first sequence and the second sequence The corresponding relationship of the sequence determines the second sequence corresponding to the data symbol.
  • the combined sequence set is determined based on the sequence set described in the N first sequences. Correspondingly, the corresponding relationship between the combined sequence and the N first sequences can be determined. After the combined sequence is determined, the N first sequences corresponding to the combined sequence can be directly determined. Sequence, the combined sequence can be generated for the N first sequences.
  • the second sequence may be determined based on a first sequence among the N first sequences and the corresponding relationship between the first sequence and the second sequence.
  • the detecting the signal to obtain M sequences for generating the signal, and determining the second sequence corresponding to the data symbol according to the M sequences includes:
  • the signal is detected based on the sequence set to which a first sequence of the N first sequences belongs, and M sequences that generate the signal are obtained, where the M sequences include the first sequence;
  • the first sequence and the corresponding relationship between the first sequence and the second sequence determine the second sequence corresponding to the data symbol.
  • the first sequence may be understood as a first sequence in a set of sequences for signal detection. Due to the influence of the channel, the first sequence may be different from the first sequence actually used by the transmitting end.
  • the M sequences may be the first sequence. This is for each UE. If there are multiple UEs, the receiver can obtain the first sequences respectively corresponding to the multiple UEs through a similar detection method. Then, as a whole, the receiver can detect multiple first sequences.
  • the detecting the signal to obtain M sequences for generating the signal, and determining the second sequence corresponding to the data symbol according to the M sequences 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, where the M sequences include M first sequences; according to the M first sequences Sequence, determine a combined sequence; determine the second sequence corresponding to the data symbol according to the combined sequence and the corresponding relationship between the combined sequence and the second sequence.
  • M is equal to N, that is, N sequences for generating the signal are obtained, and the combined sequence is determined according to the N sequences, which is similar to the above description; in another case, M is less than N ,
  • the method for determining the combined sequence according to the N sequences may be referred to, and all possible combined sequences can be obtained by using the M first sequences. If there are multiple UEs, the receiver can obtain M first sequences corresponding to each UE through a similar detection method.
  • the method further includes:
  • the M sequences Use at least one of the M sequences to perform channel estimation; or, in the case that the M sequences include a combined sequence obtained from the N first sequences, determine the N according to the combined sequence Using at least one first sequence among the N first sequences for channel estimation.
  • the combined sequence may be used for channel estimation; in the case where the M sequences include a first sequence, it may be used Channel estimation is performed on the first sequence; in the case that the M sequences include M first sequences, at least one of the M first sequences may be used for channel estimation, or the M first sequences may be used to obtain The combined sequence is used for channel estimation.
  • the method further includes:
  • the information includes one or more of the following: identification information of the N first sequences; energy information of at least one first sequence among the N first sequences; The identification information of the second sequence; the identification information of the first communication node.
  • the receiver obtains the symbols of the received 2 pilots, and obtains the received data symbols.
  • the receiver constructs a non-orthogonal sequence set B in a similar way to the transmitter, and uses each sequence in the sequence set B to detect the symbols of the acquired 2 pilots and identify the joint pilot sequence used by the transmitter ( That is, the combined sequence), and then determine the spreading sequence (that is, the second sequence) used by the transmitter according to the identified joint pilot sequence, which is used to detect the received data symbols.
  • the receiver jointly uses two pilots for user identification and detection, determines the spreading sequence used by the user, and then uses the pilot sequence identified on the two pilots for channel estimation, or uses the joint pilot sequence for channel estimation , And according to the channel estimation result and the determined spreading sequence, the received data symbols are detected, and then demodulated and decoded.
  • the receiver When multiple users are competing for scheduling-free access and transmission, the receiver also uses interference cancellation technology to reconstruct the transmitted symbols of the users that have been correctly demodulated and decoded, and perform interference cancellation, and then continue to perform operations on other users. Detection.
  • the implementation steps of the receiver include:
  • Pilot identification can also be called active user identification.
  • the constructed non-orthogonal pilot sequence set B is used for blind detection. Through correlation detection, a joint pilot sequence with a correlation value greater than a specified threshold and/or several joint pilot sequences with a larger correlation value are obtained as the identified joint Pilot sequence. Then, according to the association relationship or correspondence between the joint pilot sequence and the spreading sequence, the identified joint pilot sequence is used to determine the spreading sequence used by the user.
  • the pilot sequence P1 and/or the sequence set to which the pilot sequence P2 belongs is used for blind detection, and through correlation detection, a pilot sequence with a correlation value greater than a specified threshold and/or several pilot sequences with a larger correlation value are obtained, As the recognized pilot sequence P1 and/or the pilot sequence P2. Then, according to the correlation or correspondence between the pilot sequence P1 or the pilot sequence P2 and the spreading sequence, the spreading sequence used by the user is determined.
  • the spreading sequence used by the user can be determined according to the pilot sequence P1
  • the extended sequence used by the user can be determined according to the joint pilot sequence, or the extended sequence used by the user can be determined according to the combination or superposition of the pilot sequence P1 and the pilot sequence P2.
  • Channel estimation Determine the pilot sequence P1 and/or the pilot sequence P2 according to the identified joint pilot sequence, and use the pilot sequence P1 and/or the pilot sequence P2 for channel estimation; it can also be used directly in the pilot sequence. Pilot identification is performed on P1/pilot P2, and channel estimation is performed using the pilot sequence identified on pilot P1/pilot P2; the identified joint pilot sequence can also be used for channel estimation.
  • the receiver can identify The joint pilot sequence is used to determine the two pilot sequences, for example, according to the joint pilot sequence index and the pilot sequence set size, the two pilot sequences constituting the joint pilot sequence are determined through division operation or remainder operation.
  • Detect the received data symbols According to the channel estimation results of the identified users and the corresponding extended sequence, perform detection according to, for example, the Minimum Mean Square Error (MMSE) detection method to obtain the data detection results .
  • MMSE Minimum Mean Square Error
  • symbol reconstruction and interference cancellation For users with correct decoding, the decoded output bits are re-encoded, modulated, and expanded to obtain the user's transmitted symbols, and the received symbols are reconstructed using the channel estimation results, and then Subtract from the received signal to achieve interference cancellation.
  • symbol reconstruction and interference cancellation include reconstruction and interference cancellation on data symbols and 2 pilot symbols. Therefore, the information of 2 pilots can be carried in the data part, such as index information and energy information of 2 pilots. Wait. In addition, the extended sequence information can also be carried in the data part.
  • the channel estimation result obtained based on the pilot in the above step (2) can be used, or the reconstructed transmitted symbols of all users with correct decoding can be used for Least Square (LS).
  • LS Least Square
  • step (1) Perform the next round of identification and detection: return to step (1), and perform the next round of identification and detection again. Iterate in this way until the user cannot be identified and detected, or until the specified number of iterations is reached.
  • pilot P1/pilot P2 For two pilots, that is, pilot P1/pilot P2, some processing procedures in the above steps can be executed on the two pilots separately, and can be executed in parallel or serially. Among them, if it is executed in parallel, then by using pilot P1 and pilot P2 to perform pilot identification, channel estimation, and data detection, respectively, the users with the correct decoding can be obtained, and then the decoding is performed on the two pilots. All users correctly perform interference cancellation. Among them, it is possible that one user has been correctly decoded on both pilots, and interference cancellation can be performed once.
  • pilot P1 for pilot identification, channel estimation, and data detection to obtain users with correct decoding, and perform interference cancellation on all users with correct decoding
  • pilot P2 Perform pilot identification, channel estimation, and data detection to obtain users with correct decoding, and perform interference cancellation on all users with correct decoding
  • pilot P1 and pilot P2 for reception detection and interference cancellation in turn, so Iterative execution can be done.
  • the data processing method provided in this application includes the following steps:
  • the method also includes:
  • Detect the symbols on the obtained multiple pilots and identify the joint pilot sequence used by the transmitter including:
  • a combined sequence set is obtained, and the symbols of the obtained multiple pilots are detected by combining the combined sequences to identify the joint pilot sequence used by the first communication node.
  • the combined sequence set is obtained, including:
  • a sequence is arbitrarily selected from the sequence sets used by multiple pilots to obtain multiple sequences, and the multiple sequences are subjected to serial combination processing or superposition processing to obtain a combined sequence set.
  • Determining the second sequence used by the transmitter according to the joint pilot sequence includes:
  • the extended sequence that is, the second sequence
  • the extended sequence is determined through the identified joint pilot sequence.
  • the method also includes:
  • the second sequence used by the transmitter is determined according to the pilot sequence used on one of the pilots; or the second sequence used by the transmitter is determined according to the pilot sequence used by the transmitter on multiple pilots; or, when one of them is used When a pilot is detected, the second sequence used by the transmitter is determined according to the pilot sequence used on the pilot, and when other pilots are used for detection, the second sequence used by the transmitter is determined according to the joint pilot sequence.
  • the method also includes:
  • the transmitter uses the pilot sequence on at least one of the pilots to perform channel estimation for detecting the received data symbols; or, according to the determined
  • the joint pilot sequence used by the transmitter performs channel estimation and is used to detect the received data symbols.
  • the method also includes:
  • the detection result is demodulated and decoded to obtain the data sent by the transmitter.
  • the method also includes:
  • the identification information of the transmitter that is, the identification information of the first communication node
  • the information of the pilot sequence used by the transmitter on multiple pilots that is, the identification information of the N first sequences
  • the information of the second sequence used by the transmitter that is, the identification information of the second sequence.
  • FIG. 3 is a schematic structural diagram of a data processing device provided by this application.
  • the device is configured at a first communication node.
  • the determining module 32 is configured to determine a second sequence according to at least one of the N first sequences
  • the processing module 33 is configured to perform data processing based on the second sequence Process to obtain the data symbol
  • the sending module 34 is configured to send the N first sequences and the data symbol, where N is an integer greater than or equal to 2.
  • the data processing device provided in this embodiment is used to implement the data processing method of the embodiment shown in FIG. 1.
  • the implementation principle and technical effect of the data processing device provided in this embodiment are similar to the data processing method of the embodiment shown in FIG. I won't repeat it here.
  • the N first sequences are obtained randomly.
  • the acquisition module 31 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 determining module 32 is specifically configured to:
  • the determining module 32 is specifically configured to:
  • the determining module 32 is specifically set as:
  • the second sequence is determined according to a first sequence among the N first sequences and the corresponding relationship between the first sequence and the second sequence.
  • the processing performed on the data based on the second sequence includes one of the following: expansion processing; modulation processing; and mapping processing.
  • the sending module 34 includes one of the following:
  • the N first sequences are mapped to different transmission resources to generate a signal and sent; the N first sequences are merged and then mapped to the transmission resource to generate a signal and send; wherein, the merging process Including series combination processing or superposition processing.
  • one first sequence corresponds to one pilot.
  • the transmission resources used by the pilots corresponding to the N first sequences include one of the following: time-division resources; frequency-division resources; time-frequency division resources; code-division resources; randomly selected resource.
  • the data carries information, 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 first sequence of the N first sequences; the identification information of the second sequence; the identification information of the first communication node.
  • FIG. 4 is a schematic structural diagram of another data processing device provided by this application.
  • the device is configured at a second communication node.
  • the device includes: a receiving module 41 , Set to receive a signal and a data symbol, the signal is generated based on N first sequences, where N is an integer greater than or equal to 2; the detection module 42 is set to detect the signal to obtain the M sequences of signals, and according to the M sequences, determine the second sequence corresponding to the data symbol, where M is an integer greater than or equal to 1; the acquisition module 43 is configured to compare all data symbols according to the second sequence The said data symbol is tested and the test result is obtained.
  • the data processing device provided in this embodiment is used to implement the data processing method of the embodiment shown in FIG. 2.
  • the implementation principle and technical effect of the data processing device provided in this embodiment are similar to the data processing method of the embodiment shown in FIG. I won't repeat it here.
  • the detection module 42 is specifically configured as follows:
  • the signal is detected based on the combined sequence set to obtain M sequences that generate the signal, wherein the combined sequence set is determined based on the sequence set to which the N first sequences belong, and the M sequences include A combined sequence obtained from the N first sequences; and a second sequence corresponding to the data symbol is determined according to the combined sequence and the corresponding relationship between the combined sequence and the second sequence.
  • the detection module 42 is specifically configured as follows:
  • the signal is detected based on the combined sequence set to obtain M sequences that generate the signal, wherein the combined sequence set is determined based on the sequence set to which the N first sequences belong, and the M sequences include A combined sequence obtained from the N first sequences; determine the N first sequences according to the combined sequence; according to a first sequence among the N first sequences, and the first sequence and the second sequence The corresponding relationship of the sequence determines the second sequence corresponding to the data symbol.
  • the detection module 42 is specifically configured as follows:
  • the signal is detected based on the sequence set to which a first sequence of the N first sequences belongs, and M sequences that generate the signal are obtained, where the M sequences include the first sequence;
  • the first sequence and the corresponding relationship between the first sequence and the second sequence determine the second sequence corresponding to the data symbol.
  • 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, where the M sequences include M first sequences; according to the M first sequences Sequence, determine a combined sequence; determine the second sequence corresponding to the data symbol according to the combined sequence and the corresponding relationship between the combined sequence and the second sequence.
  • the device further includes: a channel estimation module, configured to:
  • the M sequences Use at least one of the M sequences to perform channel estimation; or, in the case that the M sequences include a combined sequence obtained from the N first sequences, determine the N according to the combined sequence Using at least one first sequence among the N first sequences for channel estimation.
  • the device further includes: an information acquisition module configured to:
  • the information includes one or more of the following: identification information of the N first sequences; energy information of at least one first sequence among the N first sequences; The identification information of the second sequence; the identification information of the first communication node.
  • FIG. 5 is a schematic structural diagram of a first communication node provided by this application.
  • the first communication node provided by this application includes one or more processors. 51 and a 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; the one or Multiple 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.
  • the information includes but is not limited to N first sequences and data symbols.
  • 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 data 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 this 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 data processing method described in FIG. 2 of the embodiment of the present application (for example, a data 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.
  • An embodiment of the present application further provides a storage medium, the storage medium stores a computer program, and the computer program implements the data processing method described in any of the embodiments of the present application when the computer program is executed by a processor.
  • the data processing method applied to the first communication node and the data processing method applied to the second communication node wherein the data processing method applied to the first communication node includes: obtaining N first sequences; Determine the second sequence for at least one first sequence in a sequence; process data based on the second sequence to obtain data symbols; send the N first sequences and the data symbols; where N is greater than or An integer equal to 2.
  • the data processing method applied to the second communication node includes: receiving signals and data symbols, where the signals are generated based on N first sequences; detecting the signals to obtain M sequences for generating the signals, and according to The M sequences determine a second sequence corresponding to the data symbol; detect the data symbol according to the second sequence to obtain a detection result; where N is an integer greater than or equal to 2, and M is greater than or An integer equal to 1.
  • 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 above.
  • 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)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Information Transfer Systems (AREA)
  • Communication Control (AREA)

Abstract

本文公开数据处理方法、装置、第一通信节点、第二通信节点及存储介质。该数据处理方法包括获取N个第一序列;根据所述N个第一序列中的至少一个第一序列,确定第二序列;基于所述第二序列对数据进行处理,得到数据符号;发送所述N个第一序列和所述数据符号;其中,N为大于或等于2的整数。

Description

数据处理方法、装置、第一通信节点、第二通信节点及存储介质
本申请要求在2020年01月16日提交中国专利局、申请号为202010048797.8的中国专利申请的优先权,该申请的全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信领域,例如涉及数据处理方法、装置、第一通信节点、第二通信节点及存储介质。
背景技术
免调度传输终端可以自主发送数据,不需要发送调度请求和等待动态调度。因此,免调度传输可以降低信令开销和传输时延,还可以降低终端功耗。此外,免调度传输还可以和非正交传输结合,提升接入用户数量。
免调度传输包括两种方案,分别为预配置免调度和竞争免调度。对于基于多导频的竞争免调度传输方案,发射机随机选择多个导频序列,接收机分别利用多个导频进行用户识别与检测。在基于多导频的竞争免调度传输方案中,可以将数字调制后的符号使用扩展序列扩展后再进行资源映射和发送。然而,在基于多导频的免调度传输和扩展结合时,如何进行数据处理,以使通信双方进行通信是亟待解决的技术问题。
发明内容
本申请提供数据处理方法、装置、第一通信节点、第二通信节点及存储介质。
本申请实施例提供一种数据处理方法,应用于第一通信节点,包括:
获取N个第一序列;根据所述N个第一序列中的至少一个第一序列,确定第二序列;基于所述第二序列对数据进行处理,得到数据符号;发送所述N个第一序列和所述数据符号;其中,N为大于或等于2的整数。
本申请实施例还提供一种数据处理方法,应用于第二通信节点,包括:
接收信号和数据符号,所述信号是基于N个第一序列生成的;对所述信号进行检测,得到生成所述信号的M个序列,并根据所述M个序列,确定对应所述数据符号的第二序列;根据所述第二序列对所述数据符号进行检测,获取检测结果;其中,N为大于或等于2的整数,M为大于或等于1的整数。
本申请实施例还提供了一种数据处理装置,配置于第一通信节点,包括:
获取模块,设置为获取N个第一序列;确定模块,设置为根据所述N个第一序列中的至少一个第一序列,确定第二序列;处理模块,设置为基于所述第二序列对数据进行处理,得到数据符号;发送模块,设置为发送所述N个第一序列和所述数据符号,其中,N为大于或等于2的整数。
本申请实施例还提供了一种数据处理装置,配置于第二通信节点,包括:
接收模块,设置为接收信号和数据符号,所述信号是基于N个第一序列生成的,其中,N为大于或等于2的整数;检测模块,设置为对所述信号进行检测,得到生成所述信号的M个序列,并根据所述M个序列,确定对应所述数据符号的第二序列,其中,M为大于或等于1的整数;获取模块,设置为根据所述第二序列对所述数据符号进行检测,获取检测结果。
本申请实施例还提供了一种第一通信节点,包括:
一个或多个处理器;存储装置,用于存储一个或多个程序;当所述一个或多个程序被所述一个或多个处理器执行,使得所述一个或多个处理器实现如本申请实施例中应用于第一通信节点的任意一种数据处理方法。
本申请实施例还提供了一种第二通信节点,包括:
一个或多个处理器;存储装置,用于存储一个或多个程序;当所述一个或多个程序被所述一个或多个处理器执行,使得所述一个或多个处理器实现如本申请实施例中应用于第二通信节点的任意一种数据处理方法。
本申请实施例还提供了一种存储介质,所述存储介质存储有计算机程序,所述计算机程序被处理器执行时实现本申请实施例中的任意一种数据处理方法。
附图说明
图1为本申请提供的一种数据处理方法的流程示意图;
图1a为一种传统的基于“导频+数据”的竞争免调度方案的传输帧结构的示意图;
图1b为一种基于“多导频+数据”的竞争免调度方案的传输帧结构的示意图;
图1c为本申请提供的一种序列互相关值的CDF分布示意图;
图1d为本申请提供的另一种序列互相关值的CDF分布示意图;
图2为本申请提供的又一种数据处理方法的流程示意图;
图3为本申请提供的一种数据处理装置的结构示意图;
图4为本申请提供的又一种数据处理装置的结构示意图;
图5为本申请提供的一种第一通信节点的结构示意图;
图6为本申请提供的一种第二通信节点的结构示意图。
具体实施方式
下文中将结合附图对本申请的实施例进行说明。
在附图的流程图示出的步骤可以在诸如一组计算机可执行指令的计算机系统中执行。并且,虽然在流程图中示出了逻辑顺序,但是在一些情况下,可以以不同于此处的顺序执行所示出或描述的步骤。
在一个示例性实施方式中,图1为本申请提供的一种数据处理方法的流程示意图,该方法可以适用于在基于多导频的免调度传输和扩展结合时进行数据处理的情况。该方法可以由本申请提供的数据处理装置执行,数据处理装置可以由软件和/或硬件实现,并一般集成在第一通信节点上,第一通信节点可以为任何类型的无线用户设备。
对于基于多导频的竞争免调度传输方案,在发射侧(如第一通信节点侧)会设计多个独立的或随机选择的导频序列,接收侧(如第二通信节点侧)分别利用多个导频进行用户识别与检测。那么,当和扩展结合,使用一个扩展序列对数据调制符号进行扩展处理然后进行发送时,需要解决如何设计导频序列、并建立导频序列和扩展序列之间的关联关系,以及接收机如何根据识别到的导频序列来确定发射机使用的扩展序列,从而实现数据检测。
本申请实现了基于多导频和扩展结合的竞争免调度传输。
如图1所示,本申请提供的数据处理方法包括S110、S120、S130和S140。
S110、获取N个第一序列。
在进行多导频传输时,一个第一序列可以对应一个导频,或者可以为一个导频使用的导频序列。N为大于或等于2的整数。
各第一序列可以从相同的序列集合获取,也可以从不同的序列集合获取。N个第一序列中任意两个序列可以不同,也可以存在T个序列相同,其中,T为大于或等于2的整数,且T小于或等于N。
各第一序列可以是随机获取的。
此处不对N的取值进行限定,在一个示例中,N的取值包括2或3。
在一个示例中,N个第一序列的长度均为L,L为大于或等于2的整数。
S120、根据所述N个第一序列中的至少一个第一序列,确定第二序列。
在对数据进行处理,如扩展处理时,可以构建N个第一序列和第二序列的关系,第二序列用于对数据进行处理。第二序列可以为根据N个第一序列中的至少一个序列确定的序列。
在获取N个第一序列后,本步骤可以基于N个第一序列,确定合并序列,然后基于合并序列确定第二序列。合并序列为将N个第一序列进行合并处理后得到的序列,合并处理包括叠加处理或串联组合处理。其中,叠加处理可以认为将N个第一序列叠加,即相加。串联组合包括直接将各第一序列串联,即序列串联,或者,将各第一序列中的各个元素按照一定的顺序串联,即元素串联,如在串联时先提取各第一序列的第1个元素,然后提取各第一序列的第2个元素,依次类推,完成串联组合。
在获取N个第一序列后,本步骤可以根据N个序列中的一个第一序列确定第二序列。在根据N个第一序列中的一个第一序列确定第二序列时,可以基于该第一序列和该第一序列与第二序列的对应关系,确定第二序列。其中,该第一序列可以认为是N个第一序列中用于确定第二序列的第一序列。该第一序列与第二序列的对应关系可以为预先构建的。如基于该第一序列所属的第一序列集合和第二序列所属的第二序列集合,确定该第一序列和第二序列的对应关系。第一序列集合中的第一序列和第二序列集合中的第二序列可以为一对一的关系或多对一的关系。
在获取N个第一序列后,本步骤可以根据N个第一序列中的多个第一序列确定第二序列。在根据N个第一序列中的多个第一序列确定第二序列时,可以基于多个第一序列确定合并序列,然后基于合并序列,以及合并序列与第二序列的对应关系,确定第二序列。合并序列可以为将多个第一序列进行合并后得到的序列。合并序列与第二序列的对应关系可以为预先构建的,如基于合并序列集合与第二序列集合的对应关系确定。合并序列集合可以基于所述多个第一序列所属的序列集合确定。如在所述多个第一序列所属的序列集合中遍历提取多个第一序列,进行合并处理,得到合并序列集合。
在一个示例中,为了实现对数据的扩展传输、或等效扩展传输、或分集传输,第二序列的长度可以为T,且T为大于或等于2的整数。
S130、基于所述第二序列对数据进行处理,得到数据符号。
在确定第二序列后,基于第二序列对数据进行处理,得到数据符号,对处理的手段不作限定,可以基于第二序列的作用确定。在一个示例中,可以基于 第二序列对数据进行扩展处理、或调制处理、或映射处理。这些处理可以实现对数据的扩展传输、或等效扩展传输、或分集传输。
S140、发送所述N个第一序列和所述数据符号。
获得数据符号后,本步骤可以发送N个第一序列和数据符号,以供第二通信节点接收处理。
在发送N个第一序列时,可以直接将N个第一序列映射在不同的传输资源上;也可以将N个序列进行合并处理后映射到传输资源上。
本申请提供的一种数据处理方法,应用于第一通信节点,包括:获取N个第一序列;根据所述N个第一序列中的至少一个第一序列,确定第二序列;基于所述第二序列对数据进行处理,得到数据符号;发送所述N个第一序列和所述数据符号;其中,N为大于或等于2的整数。利用该方法可以实现多导频和扩展传输的结合,有利于提升用户传输性能和系统性能。
在上述实施例的基础上,提出了上述实施例的延伸实施例,为了使描述简要,在延伸实施例中仅描述与上述实施例的不同之处。
在一个实施例中,所述N个第一序列为随机获取的。
在一个实施例中,所述获取N个第一序列,包括如下之一:
从一个序列集合中获取N个第一序列,所述N个第一序列中任意两个序列不同,或者,所述N个第一序列中存在T个序列相同,其中,T为大于或等于2的整数,且T小于或等于N;从不同的序列集合中获取N个第一序列;从同一个序列集合的不同子集中获取N个第一序列。
在一个实施例中,所述序列集合包括如下一个或多个:哈达码序列集合;根据哈达码序列集合得到的序列集合;ZC序列集合;四相序列集合。
在一个实施例中,所述根据所述N个第一序列中的至少一个第一序列,确定第二序列,包括:
根据所述N个第一序列,确定合并序列;根据所述合并序列、以及所述合并序列与第二序列的对应关系,确定第二序列。
根据N个第一序列,确定合并序列时,可以将N个第一序列进行合并处理,以得到合并序列。合并处理包括叠加处理或串联组合处理。也可以通过其他合并处理的手段得到合并序列。例如,假设有两个第一序列,可以将这两个第一序列的元素分别作为实部和虚部,得到合并序列。
在一个实施例中,所述根据所述N个第一序列,确定合并序列,包括:
将所述N个第一序列进行串联组合处理或叠加处理,得到合并序列。
在一个示例中,合并序列的长度为L或者N*L。例如,采用叠加处理时,合并序列的长度为L;采用串联组合处理时,合并序列的长度为N*L。
在一个实施例中,所述根据所述N个第一序列中的至少一个第一序列,确定第二序列,包括:
根据所述N个第一序列中的一个第一序列、以及该第一序列与第二序列的对应关系,确定第二序列。
在一个实施例中,基于所述第二序列对数据进行的处理包括如下之一:扩展处理;调制处理;映射处理。
在一个实施例中,发送所述N个第一序列,包括以下一个:
将所述N个第一序列映射到不同的传输资源上,生成信号并发送;将所述N个第一序列进行合并处理后映射到传输资源上,生成信号并发送;其中,所述合并处理包括串联组合处理或叠加处理。
在一个实施例中,一个第一序列对应一个导频。
在一个实施例中,所述N个第一序列分别对应的导频使用的传输资源包括如下之一:时分的资源;频分的资源;时频分的资源;码分的资源;随机选择的资源。在一个第一序列对应一个导频的情况下,所述N个第一序列分别对应的导频包括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。因此,基于“多导频+数据”的竞争免调度方案可以降低碰撞率,从而可以提升接入用户的数量。
对于竞争免调度传输,“数据”部分可以仍然沿用传统的处理过程,包括信道编码、数字调制、资源映射与发送等。也可以考虑和扩展结合,将数字调制后的符号使用扩展序列扩展后再进行资源映射和发送。这类似于基于扩展的多址接入或码分多址接入。其中,使用的扩展序列可以来自正交或非正交的扩展序列集合。使用扩展序列对符号进行扩展,可以获取分集增益来提升用户传输性能,也可以通过码域复用提升接入用户数量,还有利于小区间干扰抑制从而提升系统性能。
传统的基于单导频的竞争免调度方案比较容易和扩展结合。例如,可以在导频序列与扩展序列之间建立一对一的关系或多对一的关系,每个终端根据选择的导频序列确定相应的扩展序列,然后使用该扩展序列对调制符号进行扩展处理。当两个终端选择相同的导频序列时,这两个终端使用的扩展序列也是相同的。接收机进行导频识别,根据识别到的导频序列确定终端使用的扩展序列,用于数据检测。
而对于基于多导频的竞争免调度传输方案,发射机随机选择多个导频序列,接收机分别利用多个导频进行用户识别与检测,那么,当和扩展结合时,由于多个独立的或随机选择的导频和扩展序列之间无法像上述传统方案那样直接建立关联关系,因此,需要解决如何设计导频序列、并建立导频序列和扩展序列之间的关联关系,以及接收机如何根据识别到的导频序列来确定扩展序列。
在一个实施例中,本申请提供的一种数据处理方法,包括:获取两个导频序列(即第一序列);根据两个导频序列来联合确定将要使用的扩展序列(即第二序列);使用扩展序列对数据进行处理生成待发送的数据符号;发送所述两个导频序列和所述数据符号。该数据处理方法还可以包括:获取两个导频序列P1和P2(即第一序列);根据导频序列P1或导频序列P2,来确定将要使用的扩展序列(即第二序列);使用扩展序列对数据进行处理生成待发送的数据符号;发送两个导频序列和所述数据符号。
本实施例中,导频占用的时频资源总开销为24个资源元素(Resource Element,RE)。以采用2个导频P1和P2为例。2个导频的导频序列均来自于一个序列集合A,该序列集合A包括12个长度为12的正交序列。2个导频占用的资源可以是时分的、或频分的、或时频分的。
本实施例中,终端首先获取两个导频序列(即第一序列)。包括,终端从序列集合A中随机选择两个序列分别作为导频序列P1和导频序列P2。那么, 导频序列P1和P2分别为一个长度为12的序列。
将2个导频序列组合起来可以等价为一个长度为24的序列。由于序列集合A包括12个长度为12的正交序列,从中任意选择2个序列,然后组合起来得到一个长度为24的序列,那么,总共可以得到144个长度为24的序列。也就是说,可以得到一个序列集合B,该序列集合B包括144个长度为24的序列。而且,该序列集合B为一个非正交序列集合。其中,将2个序列组合,包括:将2个序列进行串联组合,或者,将2个序列的元素按照指定顺序组合。
终端使用的扩展序列(即第二序列)来自于一个扩展序列集合C。
一种情况下,假设扩展序列集合C包括144个扩展序列,那么,可以令序列集合B中的144个序列与扩展序列集合C中的144个扩展序列一一对应。
另一种情况下,序列集合B中的序列和扩展序列集合C中的序列之间可以是多对一的关系。例如,假设扩展序列集合C中包含36个序列,则可以令序列集合B中的4个序列与扩展序列集合C中1个序列对应。
因此,假设序列集合B包含M条序列,扩展序列集合C中包含N个序列,则可以令序列集合B中的X个序列与扩展序列集合C中1个序列对应,其中,X=ceil(M/N),ceil()表示向上取整,M、N、X为正整数,N小于或等于M。那么,X是大于或等于1的,也就是说序列集合B中的序列和扩展序列集合C中的序列之间是一对一的关系或多对一的关系。
此外,还可以考虑混合的对应关系,例如,序列集合B中有(M-N(X-1))*X个序列和序列集合C中的M-N(X-1)个序列之间是X对1的关系,序列集合B中有(N*X-M)*(X-1)个序列和序列集合C中的N*X-M个序列之间是(X-1)对1的关系。
在一种情况下,假设扩展序列集合C中包含12个扩展序列,那么,可以令序列集合B中的12个序列与扩展序列集合C中1个序列对应。由于序列集合A也包含12个序列,可以从序列集合A中获取一个指定的序列作为导频序列P1,然后从序列集合A中获取任意一个序列作为导频序列P2,则导频序列P2有12种可能,二者之间组合,可以产生序列集合B中的12个序列,并且,可以令产生的这12个序列与扩展序列集合C中的1个序列对应,那么,可以看到,这实际上等效于导频序列P1与扩展序列集合C中的1个序列是对应的。因此,这种情况下,扩展序列集合C中的序列数量和序列集合A中的序列数量相同,可以在序列集合A中的序列和扩展序列集合C中的序列之间建立对应关系,或者在导频序列P1或导频序列P2与扩展序列集合C中的序列之间建立对应关系。
终端执行如下操作:终端根据所获取的两个导频序列来联合确定将要使用 的扩展序列(即第二序列),终端根据两个导频序列构成的长序列与扩展序列集合C中的扩展序列之间的关联关系或对应关系,确定将要使用的扩展序列;终端可以根据从序列集合A获取的两个导频序列的索引,确定这两个导频序列构成的长序列在序列集合B中的索引,然后,根据该索引、以及序列集合B中的序列与扩展序列集合C中的序列的关联关系或对应关系,确定相应的扩展序列的索引,从而确定将要使用的扩展序列。
当两个终端分别随机选择的两个导频序列均相同时,这两个终端使用的扩展序列也是相同的。
或者,终端执行如下操作:终端根据所获取的导频序列P1或导频序列P2来确定将要使用的扩展序列。
当导频序列P1与扩展序列集合C中的扩展序列之间存在关联关系或对应关系时,终端根据导频序列P1来确定将要使用的扩展序列;当两个终端分别随机选择的导频序列P1相同时,这两个终端使用的扩展序列也是相同的。
或者,当导频序列P2与扩展序列集合C中的扩展序列之间存在关联关系或对应关系时,终端根据导频序列P2来确定将要使用的扩展序列;当两个终端分别随机选择的导频序列P2相同时,这两个终端使用的扩展序列也是相同的。
上述扩展序列集合C中包含的序列可以是相互正交的,也可以是非正交的;可以是实数序列,也可以是复数序列;可以是非稀疏序列,也可以是稀疏序列;等。此外,为了提升传输效率、降低接收机复杂度,可以采用长度较短的扩展序列,例如长度为4等。
然后,终端使用所确定的扩展序列对数据进行处理生成待发送的数据符号。
一种情况下,终端使用所确定的扩展序列对调制符号即数据符号进行扩展处理,生成待发送的数据符号。另一种情况下,所确定的扩展序列为一个序列图样,该序列图样用于指示调制符号映射到传输资源上的位置。还有一种情况下,所确定的扩展序列为一个序列图样,终端根据该序列图样确定或生成一个序列集合或码本,然后终端使用该序列集合或码本对数据比特进行调制或映射处理,生成待发送的数据符号。
最后,终端发送所获取的两个导频序列以及所生成的待发送的数据符号。
终端将所获取的两个导频序列以及所生成的待发送的数据符号映射到传输资源上,然后生成发射信号进行发送。
本实施例中,表1为一种序列集合A的集合表,序列集合A可以为包含12个长度为12的正交哈达码序列集合,如表1所示。根据本实施例的上述描述,对于表1所示的序列集合A,可以构造出一个包含144个长度为24的非正交序 列集合B,图1c为本申请提供的一种序列互相关值的CDF分布示意图。参见图1c,大约85%的序列互相关值为0,大约15%的序列互相关值为0.5。
表1一种序列集合A的集合表
Figure PCTCN2020141211-appb-000001
本实施例中,表2为又一种序列集合A的集合表,导频序列集合,即序列集合A还可以为如表2所示的序列集合,该序列集合中同样包含12个长度为12的正交序列,各个序列是稀疏的,而且可以看作由包含3个梳的梳状结构以及包含4个长度为4的正交哈达码序列集合组合构成。根据本实施例的上述描述,对于表2所示的序列集合A,也可以构造出一个包含144个长度为24的非正交序列集合B,其各个序列之间的互相关特征与上述图1c所示的特征相同,也就是说,与基于表1所示的序列集合A构成的非正交序列集合B的互相关特征相同。
表2又一种序列集合A的集合表
Figure PCTCN2020141211-appb-000002
Figure PCTCN2020141211-appb-000003
本实施例中,非正交序列集合B由两个(相同的)正交序列集合组合得到,其中大部分序列相互之间仍然具有正交性,序列互相关值整体上较低,总体上看非正交序列集合B具有良好的序列结构特征和互相关特征。
对于表2所示的导频序列集合A,可以认为候选导频集合包含候选的导频资源和正交序列集合中的序列。因此,本实施例中,导频序列和导频之间通常可以认为是等价的,上述描述中针对导频序列的描述通常也可以替换为针对导频的描述,本实施例中不做限制。
本实施例中,序列集合A还可以为其他正交序列集合或非正交序列集合,例如,由包含6个梳的梳状资源结构以及包含2个长度为2的正交哈达码序列集合组合构成的序列集合;或者ZC(Zadoff-Chu)序列集合;或者四相序列集合,例如,序列元素来自于集合{1+1i,-1+1i,-1-1i,1-1i}或{1,1i,-1,-1i},可以看到候选序列元素有4种相位取值,因此可以称为四相序列集合。
本实施例中,UE使用多个导频序列,当多个UE使用相同的时频资源进行传输时,具有较低的导频碰撞率。本实施例通过多个导频序列的设计,以及多个导频序列与扩展序列之间的关联关系或对应关系的设计,使得UE可以根据其使用的多个导频确定其使用的扩展序列,支持UE使用扩展序列对数据符号进行扩展并传输,从而可以获取分集增益,有利于提升用户传输性能。接收机可以通过识别检测UE使用的联合导频序列,并相应的确定UE使用的扩展序列,来实现数据的接收检测。而且,本实施例中,由多个导频序列构成联合导频序列(即合并序列),可以认为联合导频序列来自于一个具有更多序列数量的非正交序列集合,而且该非正交序列集合具有良好的序列结构特征和互相关特征,也就是说,各个UE使用的联合导频序列来自于该非正交序列集合,是非正交的,并且碰撞概率较低,接收机则可以利用该非正交序列集合及其良好的序列结构特征和互相关特征进行接收检测,获取较好的接收检测性能。从系统角度来看,本实施例中,多个UE扩展后的数据符号可以在相同的时频资源进行传输,可以实现码域复用,有利于提升接入用户数量,还有利于小区间干扰抑制,从而可以提升系统性能。
在一个实施例中,导频占用的时频资源总开销为24个资源元素。以采用2个导频P1和P2为例。2个导频的导频序列P1和P2(即第一序列)分别来自于序列集合A1和序列集合A2。其中,序列集合A1包括12个长度为12的正交序列,序列集合A2包括12个长度为12的正交序列。2个导频占用的资源可以是时分的、或频分的、或时频分的。
本实施例中,终端首先获取两个导频序列(即第一序列)。包括,终端从 序列集合A1中随机选择一个序列作为导频序列P1,从序列集合A2中随机选择一个序列作为导频序列P2。那么,导频序列P1和P2分别为一个长度为12的序列。
将序列集合A1中的任意一个序列和序列集合A2中的任意一个序列进行组合,可以得到一个序列集合B,该序列集合B包括144个长度为24的序列。而且,该序列集合B为一个非正交序列集合。
终端使用的扩展序列(即第二序列)来自于一个扩展序列集合C。可以令序列集合B中的序列与扩展序列集合C中的序列一一对应,或者,序列集合B中的序列和扩展序列集合C中的序列之间是多对一的关系。还可以在序列集合A1或A2中的序列与扩展序列集合C中的序列之间建立对应关系,或者在导频序列P1或导频序列P2与扩展序列集合C中的序列之间建立对应关系。
然后,终端执行如下操作:终端根据所获取的两个导频序列来联合确定将要使用的扩展序列;或者,终端根据所获取的导频序列P1或导频序列P2来确定将要使用的扩展序列。
然后,终端使用所确定的扩展序列对数据进行处理生成待发送的数据符号。最后,终端发送所获取的两个导频序列以及所生成的待发送的数据符号。
在一个实施例中,导频占用的时频资源总开销为24个资源元素。以采用2个导频P1和P2为例。其中,导频序列P1来自于序列集合A1,导频序列P2来自于序列集合A2。并且,序列集合A1和序列集合A2来自于序列集合A,分别包含序列集合A中的一半序列和另一半序列。例如,序列集合A包括24个长度为24的正交序列,序列集合A1是由序列集合A中的前12个序列构成的序列集合,序列集合A2是由序列集合A中的后12个序列构成的序列集合。那么,序列集合A1包含12个长度为24的正交序列,序列集合A2也包含12个长度为24的正交序列。
本实施例中,序列集合A1和序列集合A2分别包含序列集合A中的一半序列和另一半序列,不局限于是序列集合A中的前一半序列和后一半序列,可以是任意一半序列和另一半序列。
本实施例中,2个导频序列的长度均为24,那么,2个导频可以占用相同的时频资源,二者之间是码分的。
本实施例中,终端首先获取两个导频序列(即第一序列)。包括,终端从序列集合A1中随机选择一个序列作为导频序列P1,从序列集合A2中随机选择一个序列作为导频序列P2。那么,导频序列P1和P2分别为一个长度为24的 序列。
由于2个导频之间是码分的,二者使用相同的时频资源,那么,可以将2个导频序列进行叠加处理,然后映射到相应的时频资源上用于传输,也就是说,最终传输的是导频序列P1和P2的和,而且二者之和也是一个长度为24的序列。在叠加处理之前可以对2个导频序列进行指定处理,或者,在叠加处理之后对得到的序列进行指定处理,其中,指定处理包括能量调整、能量归一化、功率调整、幅值调整、相位调整、预编码处理、加扰处理等。
由于序列集合A1包括12个长度为24的正交序列,序列集合A2也包含12个长度为24的正交序列,分别从序列集合A1和序列集合A2中任意选择1个序列,然后叠加起来得到一个长度为24的序列,那么,总共可以得到144个长度为24的序列。也就是说,可以得到一个序列集合B,该序列集合B包括144个长度为24的序列。而且,该序列集合B为一个非正交序列集合。
终端使用的扩展序列来自于一个扩展序列集合C。可以令序列集合B中的序列与扩展序列集合C中的序列一一对应,或者,序列集合B中的序列和扩展序列集合C中的序列之间是多对一的关系。还可以在序列集合A1或A2中的序列与扩展序列集合C中的序列之间建立对应关系,或者在导频序列P1或导频序列P2与扩展序列集合C中的序列之间建立对应关系。
然后,终端执行如下操作:终端根据所获取的两个导频序列(即第一序列)来联合确定将要使用的扩展序列(即第二序列);或者,终端根据所获取的导频序列P1或导频序列P2来确定将要使用的扩展序列。
然后,终端使用所确定的扩展序列对数据进行处理生成待发送的数据符号。最后,终端发送所获取的两个导频序列以及所生成的待发送的数据符号。
本实施例中,表3为又一种序列集合A的集合表,序列集合A可以为包含24个长度为24的正交哈达码序列集合,如表3所示。根据本实施例的上述描述,序列集合A1可以包含该序列集合A中的前12个序列,序列集合A2可以包含该序列集合A中的后12个序列,根据序列集合A1和序列集合A2可以构造出一个包含144个长度为24的非正交序列集合B,并且,该序列集合B中的各个序列之间的互相关特征与上述图1c所示的特征是相同的。
表3又一种序列集合A的集合表
Figure PCTCN2020141211-appb-000004
Figure PCTCN2020141211-appb-000005
本实施例中,表4为又一种序列集合A的集合表,序列集合A还可以为如表4所示的序列集合,该序列集合中同样包含24个长度为24的正交序列,各个序列是稀疏的,而且可以看作由包含3个梳的梳状结构以及包含8个长度为8的正交哈达码序列集合组合构成。根据本实施例的上述描述,序列集合A1可以包含该序列集合A中的前12个序列,序列集合A2可以包含该序列集合A中的后12个序列,根据序列集合A1和序列集合A2可以构造出一个包含144个长度为24的非正交序列集合B,并且,该序列集合B中的各个序列之间的互相关特征与上述图1c所示的特征也是相同的。
表4又一种序列集合A的集合表
Figure PCTCN2020141211-appb-000006
Figure PCTCN2020141211-appb-000007
本实施例中,如果导频占用的时频资源总开销为48个资源元素,而终端所获取的2个导频序列的长度均为24,那么,2个导频占用的资源可以是时分的、或频分的、或时频分的。
可以将序列集合A1中的任意一个序列和序列集合A2中的任意一个序列进行组合,可以得到一个序列集合B,该序列集合B包括144个长度为48的序列。而且,该序列集合B为一个非正交序列集合。
终端使用的扩展序列(即第二序列)来自于一个扩展序列集合C。可以令序列集合B中的序列与扩展序列集合C中的序列一一对应,或者,序列集合B中的序列和扩展序列集合C中的序列之间是多对一的关系。还可以在序列集合A1或A2中的序列与扩展序列集合C中的序列之间建立对应关系,或者在导频序列P1或导频序列P2与扩展序列集合C中的序列之间建立对应关系。
然后,终端执行如下操作:终端根据所获取的两个导频序列(即第一序列)来联合确定将要使用的扩展序列(即第二序列);或者,终端根据所获取的导频序列P1或导频序列P2来确定将要使用的扩展序列。
然后,终端使用所确定的扩展序列对数据进行处理生成待发送的数据符号。最后,终端发送所获取的两个导频序列以及所生成的待发送的数据符号。
这种情况下,序列集合A可以为包含24个长度为24的正交哈达码序列集合,如表3所示。那么,序列集合A1可以包含该序列集合A中的前12个序列,序列集合A2可以包含该序列集合A中的后12个序列,根据序列集合A1和序列集合A2可以构造出一个包含144个长度为48的非正交序列集合B,并且, 该序列集合B中的各个序列之间的互相关特征与上述图1c所示的特征是相同的。
这种情况下,序列集合A也可以为如表4所示的序列集合,该序列集合中同样包含24个长度为24的正交序列。那么,序列集合A1可以包含该序列集合A中的前12个序列,序列集合A2可以包含该序列集合A中的后12个序列,根据序列集合A1和序列集合A2可以构造出一个包含144个长度为48的非正交序列集合B,并且,该序列集合B中的各个序列之间的互相关特征与上述图1c所示的特征也是相同的。
在一个实施例中,导频占用的时频资源总开销为24个资源元素。以采用2个导频P1和P2为例。其中,导频P1由一个序列S1和一个序列Y1构成,导频P2由一个序列S2和一个序列Y2构成。序列S1和序列S2来自于序列集合S,序列Y1和序列Y2来自于序列集合Y。例如,序列集合S包括12个长度为12的正交序列,序列集合Y包括2个长度为2的正交序列,并且,将序列集合Y中的第一个序列作为序列Y1供导频P1使用,将序列集合Y中的第二个序列作为序列Y2供导频P2使用。
本实施例中,终端首先获取两个导频P1和P2。包括:从序列集合S中随机选择一个序列作为序列S1,获取序列集合Y中的第一个序列Y1,根据序列S1和序列Y1可以得到导频P1。序列S1是一个长度为12的序列,可以表示为12*1的矢量,序列Y1是一个长度为2的序列,可以表示为1*2的矢量,将序列S1和序列Y1进行矩阵乘法运算,得到一个12*2的矩阵,作为导频P1,可以将该矩阵转换为一个长度为24的序列,作为导频P1使用的导频序列(即第一序列)。同理,也可以得到导频P2,以及导频P2使用的导频序列。那么,导频序列P1和P2分别为一个长度为24的序列。
本实施例中,可以将序列Y1和序列Y2称为正交掩码,将序列集合Y称为正交掩码集合。
本实施例中,2个导频序列的长度均为24,那么,2个导频可以占用相同的时频资源,二者之间是码分的。可以将2个导频序列进行叠加处理,然后映射到相应的时频资源上用于传输。
根据上述描述可以看到,可以将序列集合S中的各个序列与序列集合Y中的第一个序列Y1进行运算,得到一个新的序列集合A1,该序列集合等效包含12个长度为24的正交序列,同理可以将序列集合S中的各个序列与序列集合Y中的第二个序列Y2进行运算,得到一个新的序列集合A2,该序列集合同样等效包含12个长度为24的正交序列。那么,可以等效认为,导频序列P1来自于序列集合A1,导频序列P2来自于序列集合A2。
事实上,本实施例中,将序列集合S中的任意一个序列和序列集合Y中的任意一个序列进行运算可以得到一个长度为24的序列,总共可以得到24个长度为24的正交序列,这24个序列可以构成序列集合A,那么,上述序列集合A1和序列集合A2可以看作是来自于该序列集合A,分别包含该序列集合A中的一半序列和另一半序列。
本实施例中,终端获取两个导频P1和P2时,还可以从序列集合S的一半序列中随机选择一个序列作为序列S1,从序列集合Y中随机选择一个序列作为序列Y1,根据序列S1和序列Y1获取导频P1;同理,从序列集合S的另一半序列中随机选择一个序列作为序列S2,从序列集合Y中随机选择一个序列作为序列Y2,根据序列S2和序列Y2获取导频P2。
将序列集合A1中的任意一个序列和序列集合A2中的任意一个序列进行叠加处理,可以得到一个序列集合B,该序列集合B包括144个长度为24的序列。而且,该序列集合B为一个非正交序列集合。
终端使用的扩展序列来自于一个扩展序列集合C。可以令序列集合B中的序列与扩展序列集合C中的序列一一对应,或者,序列集合B中的序列和扩展序列集合C中的序列之间是多对一的关系。还可以在序列集合A1或A2中的序列与扩展序列集合C中的序列之间建立对应关系,或者在导频序列P1或导频序列P2与扩展序列集合C中的序列之间建立对应关系。
然后,终端执行如下操作:终端根据所获取的两个导频序列来联合确定将要使用的扩展序列;或者,终端根据所获取的导频序列P1或导频序列P2来确定将要使用的扩展序列。
然后,终端使用所确定的扩展序列对数据进行处理生成待发送的数据符号。最后,终端发送所获取的两个导频序列以及所生成的待发送的数据符号。
本实施例中,序列集合S可以为表1所示的包含12个长度为12的正交哈达码序列集合,也可以为表2所示的包含12个长度为12的正交序列集合。表5为序列集合Y的集合表,序列集合Y如表5所示。
根据本实施例的上述描述,序列集合A1和序列集合A2分别包含12个长度为24的序列;根据序列集合A1和序列集合A2可以构造出一个包含144个长度为24的非正交序列集合B,并且,该序列集合B中的各个序列之间的互相关特征与上述图1c所示的特征相同。
表5序列集合Y的集合表
Figure PCTCN2020141211-appb-000008
Figure PCTCN2020141211-appb-000009
本实施例中,如果导频占用的时频资源总开销为48个资源元素,而终端所获取的2个导频序列的长度均为24,那么,2个导频占用的资源可以是时分的、或频分的、或时频分的。
可以将序列集合A1中的任意一个序列和序列集合A2中的任意一个序列进行组合,可以得到一个序列集合B,该序列集合B包括144个长度为48的序列。而且,该序列集合B为一个非正交序列集合。
终端使用的扩展序列来自于一个扩展序列集合C。可以令序列集合B中的序列与扩展序列集合C中的序列一一对应,或者,序列集合B中的序列和扩展序列集合C中的序列之间是多对一的关系。还可以在序列集合A1或A2中的序列与扩展序列集合C中的序列之间建立对应关系,或者在导频序列P1或导频序列P2与扩展序列集合C中的序列之间建立对应关系。
然后,终端执行如下操作:终端根据所获取的两个导频序列(即第一序列)来联合确定将要使用的扩展序列(即第二序列);或者,终端根据所获取的导频序列P1或导频序列P2来确定将要使用的扩展序列。
然后,终端使用所确定的扩展序列对数据进行处理生成待发送的数据符号。最后,终端发送所获取的两个导频序列以及所生成的待发送的数据符号。
这种情况下,序列集合S可以为表1所示的包含12个长度为12的正交哈达码序列集合,也可以为表2所示的包含12个长度为12的正交序列集合。序列集合Y如表5所示。那么,根据本实施例的上述描述,根据序列集合S和序列集合Y可以得到等效的序列集合A1和序列集合A2,二者分别包含12个长度为24的序列;根据序列集合A1和序列集合A2可以构造出一个包含144个长度为48的非正交序列集合B,并且,该序列集合B中的各个序列之间的互相关特征与上述图1c所示的特征是相同的。
在一个实施例中,导频占用的时频资源总开销为48个资源元素。以采用2个导频P1和P2为例。其中,2个导频的导频序列(即第一序列)均来自于一个序列集合A,该序列集合A包括24个长度为24的正交序列。
本实施例中,2个导频占用的资源可以是时分的、或频分的、或时频分的。
本实施例中,终端首先获取两个导频序列。包括,终端从序列集合A中随机选择两个序列分别作为导频序列P1和导频序列P2。那么,导频序列P1和P2分别为一个长度为24的序列。
将序列集合A中的任意两个序列进行组合,可以得到一个序列集合B,该序列集合B包括576个长度为48的序列。而且,该序列集合B为一个非正交序列集合。
终端使用的扩展序列来自于一个扩展序列集合C。可以令序列集合B中的序列与扩展序列集合C中的序列一一对应,或者,序列集合B中的序列和扩展序列集合C中的序列之间是多对一的关系。还可以在序列集合A中的序列与扩展序列集合C中的序列之间建立对应关系,或者在导频序列P1或导频序列P2与扩展序列集合C中的序列之间建立对应关系。
然后,终端执行如下操作:终端根据所获取的两个导频序列来联合确定将要使用的扩展序列;或者,终端根据所获取的导频序列P1或导频序列P2来确定将要使用的扩展序列。
然后,终端使用所确定的扩展序列对数据进行处理生成待发送的数据符号。
最后,终端发送所获取的两个导频序列以及所生成的待发送的数据符号。
本实施例中,序列集合A可以为包含24个长度为24的正交哈达码序列集合,如表3所示。根据本实施例的上述描述,对于表3所示的序列集合A,可以构造出一个包含576个长度为48的非正交序列集合B,图1d为本申请提供的另一种序列互相关值的CDF分布示意图,其各个序列之间的互相关值的CDF分布如图1d所示,基于累积分布函数(Cumulative Distribution Function,CDF)与互相关值可以看出,92%的序列互相关值为0,8%的序列互相关值为0.5。
本实施例中,序列集合A还可以为表4所示的序列集合,该序列集合中同样包含24个长度为24的正交序列。根据本实施例的上述描述,对于表4所示的序列集合A,可以构造出一个包含576个长度为48的非正交序列集合B,并且,该序列集合B中的各个序列之间的互相关特征与上述图1d所示的特征是相同的。
基于本实施例和上述实施例可以得到其他延伸实施例,此处不作限定。
在一个实施例中,本申请提供的数据处理方法,包括如下步骤:
获取多个导频序列(即N个第一序列);根据多个导频序列确定第二序列,或者根据其中一个导频序列确定第二序列;使用第二序列对数据进行处理生成待发送的数据符号;发送多个导频序列,以及数据符号。
多个导频序列为多个导频使用的导频序列。
获取多个导频序列,包括以下之一:
随机选择或随机生成多个导频序列;随机选择或随机生成多个序列,对所 述多个序列进行指定处理,得到多个导频序列。
所述多个导频序列来自于一个序列集合,或者分别来自于多个序列集合,或者分别来自于一个序列集合的多个子序列集合,或者是按照预设规则生成的。
所述序列集合包括:哈达码序列集合;或者,根据哈达码序列集合得到的序列集合;或者,ZC序列集合;或者,四相序列集合。
根据多个导频序列确定第二序列,包括:根据多个导频序列获取联合导频序列(即合并序列),根据联合导频序列集合和第二序列集合之间的关联关系或对应关系,通过所获取的联合导频序列确定第二序列。
根据多个导频序列获取联合导频序列,包括:将多个导频序列进行串联组合处理或叠加处理,得到联合导频序列。
将多个导频序列进行串联组合处理,包括:将多个导频序列进行序列串联,或者,将多个导频序列的元素按照指定顺序串联组合。
根据其中一个导频序列确定第二序列,包括:根据其中一个导频序列所属的序列集合和第二序列集合之间的关联关系或对应关系,通过该导频序列确定第二序列;或者,根据其中一个导频序列与第二序列集合中的序列之间的关联关系或对应关系确定第二序列。
使用第二序列对数据进行处理生成待发送的数据符号,包括:使用第二序列对数据比特或数据符号进行扩展处理、或调制处理、或映射处理,生成待发送的数据符号。
发送多个导频序列,包括:
将所述多个导频序列映射到传输资源上,进行发送;或者,将所述多个导频序列进行合并处理后映射到所述传输资源上;或者,将所述多个导频序列进行指定处理后映射到所述传输资源上,进行发送;其中,所述合并处理至少包括串联组合处理或叠加处理;其中,所述指定处理包括以下至少之一:加扰处理、能量调整、功率调整、幅值调整、相位调整、预编码处理。
所述多个导频序列使用的传输资源是时分的、或频分的、或时频分的、或码分的。
所述多个导频使用的传输资源是随机选择的或预设的。
发送数据符号,包括:
将所述数据符号映射到传输资源上,进行发送;或者,将所述数据符号进行指定处理后映射到所述传输资源上,进行发送;其中,所述指定处理包括以下至少之一:加扰处理、能量调整、功率调整、幅值调整、相位调整、预编码 处理。
所述方法还包括在所述数据中携带信息,所述信息包括多个导频序列的识别信息,如生成信息,索引信息等;还包括第二序列的识别信息;还包括第一通信节点的身份识别信息;还可以包括:多个导频序列的能量信息或至少一个导频序列的能量信息。
本申请提供了一种数据处理方法,图2为本申请提供的又一种数据处理方法的流程示意图,该方法可以集成在数据处理装置中,数据处理装置可以由软件和/或硬件实现,并一般集成在第二通信节点上,第二通信节点可以为基站。
如图2所示,本申请提供的数据处理装置,包括S210、S220和S230。
S210、接收信号和数据符号,所述信号是基于N个第一序列生成的。
所述信号可以为N个第一序列映射到不同的传输资源上生成的信号;或将N个第一序列进行合并处理后映射到传输资源上生成的信号。
信号和数据符号可以为第一通信节点发送的。
S220、对所述信号进行检测,得到生成所述信号的M个序列,并根据所述M个序列,确定对应所述数据符号的第二序列。
本步骤在对信号进行检测时,可以基于合并序列集合或N个第一序列集合中至少一个第一序列所属的序列集合对信号进行检测,得到生成所述信号的M个序列。M个序列可以为由N个第一序列得到的合并序列;也可以为一个第一序列;还可以为M个第一序列。
确定第二序列时,可以基于M个序列与第二序列的对应关系,确定第二序列。
S230、根据所述第二序列对所述数据符号进行检测,获取检测结果。
在确定第二序列后,对数据符号进行检测,并基于检测结果确定第一通信节点的身份,以及进行干扰消除。
本实施例尚未详尽的内容可以参见上述实施例,此处不作赘述。
本申请提供的一种数据处理方法,包括:接收信号和数据符号,所述信号是基于N个第一序列生成的;对所述信号进行检测,得到生成所述信号的M个序列,并根据所述M个序列,确定对应所述数据符号的第二序列;根据所述第二序列对所述数据符号进行检测,获取检测结果;其中,N为大于或等于2的整数,M为大于或等于1的整数。利用该方法可以实现多导频和扩展传输的结合,有利于提升用户传输性能和系统性能。
在上述实施例的基础上,提出了上述实施例的延伸实施例,为了使描述简 要,在延伸实施例中仅描述与上述实施例的不同之处。
在一个实施例中,所述对所述信号进行检测,得到生成所述信号的M个序列,并根据所述M个序列,确定对应所述数据符号的第二序列,包括:
基于合并序列集合对所述信号进行检测,得到生成所述信号的M个序列,其中,所述合并序列集合基于所述N个第一序列所属的序列集合确定,所述M个序列包括由所述N个第一序列得到的一个合并序列;根据所述合并序列、以及所述合并序列与第二序列的对应关系,确定对应所述数据符号的第二序列。
合并序列集合的确定手段可以参见第一通信节点确定序列集合B的技术手段,此处不作限定。
在基于合并序列集合对所述信号进行检测时,M个序列可以为一个合并序列。这是针对每个UE而言的。如果有多个UE,接收机通过检测得到的合并序列包括多个UE的,也就是说可以得到与每个UE对应的合并序列,那么,从整体上,接收机可以检测得到多个合并序列。
在一个实施例中,所述对所述信号进行检测,得到生成所述信号的M个序列,并根据所述M个序列,确定对应所述数据符号的第二序列,包括:
基于合并序列集合对所述信号进行检测,得到生成所述信号的M个序列,其中,所述合并序列集合基于所述N个第一序列所属的序列集合确定,所述M个序列包括由所述N个第一序列得到的一个合并序列;根据所述合并序列,确定所述N个第一序列;根据所述N个第一序列中的一个第一序列、以及该第一序列与第二序列的对应关系,确定对应所述数据符号的第二序列。
合并序列集合基于N个第一序列所述的序列集合确定,相应的,可以确定合并序列和N个第一序列的对应关系,在确定合并序列后,可以直接确定对应合并序列的N个第一序列,该合并序列可以为该N个第一序列生成。
在确定N个第一序列后,可以基于该N个第一序列中一个第一序列,以及该第一序列与第二序列的对应关系,确定第二序列。
在一个实施例中,所述对所述信号进行检测,得到生成所述信号的M个序列,并根据所述M个序列,确定对应所述数据符号的第二序列,包括:
基于所述N个第一序列中的一个第一序列所属的序列集合对所述信号进行检测,得到生成所述信号的M个序列,其中,所述M个序列包括该第一序列;根据该第一序列、以及该第一序列与第二序列的对应关系,确定对应所述数据符号的第二序列。其中该第一序列可以理解为对信号进行检测的序列集合中的一个第一序列。由于信道的影响,该第一序列可能和发射端实际使用的第一序列并不相同。
在基于所述N个第一序列中的一个第一序列所属的序列集合对所述信号进行检测时,M个序列可以为该第一序列。这是针对每个UE而言的。如果有多个UE,接收机通过类似的检测方法可以得到与多个UE分别对应的第一序列,那么,从整体上,接收机可以检测得到多个第一序列。
在一个实施例中,所述对所述信号进行检测,得到生成所述信号的M个序列,并根据所述M个序列,确定对应所述数据符号的第二序列,包括:
基于所述N个第一序列所属的序列集合对所述信号进行检测,得到生成所述信号的M个序列,其中,所述M个序列包括M个第一序列;根据所述M个第一序列,确定合并序列;根据所述合并序列、以及所述合并序列与第二序列的对应关系,确定对应所述数据符号的第二序列。
对于一个UE而言,一种情况下,M等于N,即得到生成所述信号的N个序列,根据所述N个序列确定合并序列,与上述描述类似;另一种情况下,M小于N,可以参考根据所述N个序列确定合并序列的方法,利用M个第一序列获取所有可能的合并序列。如果有多个UE,接收机通过类似的检测方法可以得到与每个UE分别对应的M个第一序列。
在一个实施例中,该方法,还包括:
使用所述M个序列中的至少一个序列进行信道估计;或者,在所述M个序列包括由所述N个第一序列得到的一个合并序列的情况下,根据所述合并序列确定所述N个第一序列,使用所述N个第一序列中的至少一个第一序列进行信道估计。
在所述M个序列包括由所述N个第一序列得到的一个合并序列的情况下,可以使用该合并序列进行信道估计;在所述M个序列包括一个第一序列的情况下,可以使用该第一序列进行信道估计;在所述M个序列包括M个第一序列的情况下,可以使用M个第一序列中至少一个第一序列进行信道估计,或者使用根据M个第一序列得到的合并序列进行信道估计。
在一个实施例中,该方法,还包括:
从所述检测结果中获取信息,所述信息包括以下一个或多个:所述N个第一序列的识别信息;所述N个第一序列中至少一个第一序列的能量信息;所述第二序列的识别信息;第一通信节点的识别信息。
以下对本申请进行示例性的描述,以采用2个导频P1和P2为例。接收机获取接收到的2个导频的符号,以及获取接收到的数据符号。
接收机按照与发射机类似的方式构造非正交序列集合B,使用该序列集合B中的每个序列对所获取的2个导频的符号进行检测,识别发射机使用的联合导频序列(即合并序列),然后根据识别出来的联合导频序列确定发射机使用的扩展序列(即第二序列),用于对接收到的数据符号进行检测。
接收机联合利用2个导频进行用户识别与检测,确定用户使用的扩展序列,然后,分别利用在2个导频上识别到的导频序列进行信道估计,或者利用联合导频序列进行信道估计,并根据信道估计结果以及所确定的扩展序列,对接收到的数据符号进行检测,然后进行解调译码。
当多个用户进行竞争免调度接入与传输时,接收机还采用干扰消除技术,对已经被正确解调译码的用户的发送符号进行重构,并进行干扰消除,然后继续对其他用户进行检测。
本实施例中,接收机的实施步骤包括:
(1)进行导频识别,确定用户使用的扩展序列:导频识别也可以称为激活用户识别。利用构造的非正交导频序列集合B进行盲检测,通过相关检测,获取相关值大于指定门限的联合导频序列和/或相关值较大的若干个联合导频序列,作为识别出来的联合导频序列。然后,根据联合导频序列和扩展序列之间的关联关系或对应关系,利用识别出来的联合导频序列确定用户使用的扩展序列。或者,利用导频序列P1和/或导频序列P2所属的序列集合进行盲检测,通过相关检测,获取相关值大于指定门限的导频序列和/或相关值较大的若干个导频序列,作为识别出来的导频序列P1和/或导频序列P2。然后,根据导频序列P1或导频序列P2和扩展序列之间的关联关系或对应关系,确定用户使用的扩展序列。如果在导频序列P1和扩展序列之间建立了关联关系或对应关系,那么,在利用导频序列P1进行检测时,可以根据导频序列P1确定用户使用的扩展序列,而当利用导频序列P2进行检测时,可以根据联合导频序列来确定用户使用的扩展序列,或者根据导频序列P1和导频序列P2的组合或叠加情况来确定用户使用的扩展序列。
(2)信道估计:根据识别出来的联合导频序列来确定导频序列P1和/或导频序列P2,利用导频序列P1和/或导频序列P2进行信道估计;也可以直接在导频P1/导频P2上进行导频识别,利用导频P1/导频P2上识别出来的导频序列进行信道估计;也可以利用识别出来的联合导频序列进行信道估计。由于联合导频序列是由2个导频序列组合或叠加之后得到的,而2个导频序列可以分别来自于正交或非正交的导频序列集合,那么,接收机可以根据识别出来的联合导频序列来确定这2个导频序列,例如,根据联合导频序列索引和导频序列集合大小,通过除法运算或取余运算,确定构成该联合导频序列的2个导频序列。
(3)对接收到的数据符号进行检测:根据识别出来的用户的信道估计结果以及相应的扩展序列,按照例如最小均方误差(Minimum Mean Square Error,MMSE)检测方法进行检测,获取数据检测结果。
(4)解调译码:对识别出来的用户的数据检测结果进行解调、译码,根据循环冗余校验(Cyclic Redundancy Check,CRC)结果可以确定译码是否正确。由于是竞争免调度传输,数据部分可以携带用户的身份识别信息,接收机将数据正确译码后,即可获得用户身份信息及其传输的数据。
(5)符号重构与干扰消除:对于译码正确的用户,将译码输出的比特重新进行编码、调制、扩展,得到用户的发送符号,利用信道估计结果,重构接收到的符号,然后从接收信号中减去,实现干扰消除。其中,符号重构与干扰消除包括数据符号和2个导频符号上的重构与干扰消除,因此,可以在数据部分携带2个导频的信息,例如2个导频的索引信息、能量信息等。此外,还可以在数据部分携带扩展序列的信息。其中,对于信道估计结果,可以利用上述步骤(2)中基于导频得到的信道估计结果,也可以考虑利用所有译码正确的用户的重构的发送符号进行最小二乘(Least Square,LS)信道估计,得到更新的信道估计结果,基于该更新的信道估计结果进行干扰消除。
(6)进行下一轮识别与检测:回到步骤(1),重新进行下一轮识别与检测。如此迭代,直到无法识别检测到用户为止,或者,直到达到指定迭代次数为止。
针对2个导频,即导频P1/导频P2,上述步骤中的一些处理过程可以在2个导频上分别执行,而且,可以并行执行,也可以串行执行。其中,如果是并行执行,那么,通过利用导频P1、导频P2分别进行导频识别、信道估计和数据检测后,可以分别得到译码正确的用户,然后对在2个导频上译码正确的所有用户进行干扰消除,其中,有可能一个用户在2个导频上均被正确译码,进行一次干扰消除即可。如果是串行执行,那么,可以首先利用导频P1进行导频识别、信道估计和数据检测,得到译码正确的用户,并对译码正确的所有用户进行干扰消除,然后,利用导频P2进行导频识别、信道估计和数据检测,得到译码正确的用户,并对译码正确的所有用户进行干扰消除;然后,重新依次利用导频P1和导频P2进行接收检测和干扰消除,如此迭代执行即可。
在一个实施例中,本申请提供的数据处理方法,包括如下步骤:
获取接收到的多个导频的符号,以及获取接收到的数据符号;对所获取的多个导频的符号进行检测,识别发射机使用的联合导频序列;根据联合导频序列确定发射机使用的第二序列;根据所确定的第二序列对接收到的数据符号进行检测。
所述方法还包括:
根据识别出来的联合导频序列(即合并序列)确定发射机在多个导频上使用的导频序列;或者,对所获取的多个导频的符号进行检测,确定发射机在多个导频上使用的导频序列。
对所获取的多个导频上的符号进行检测,识别发射机使用的联合导频序列,包括:
根据多个导频分别使用的序列集合,获取合并序列集合,通过合并序列结合,对所获取的多个导频的符号进行检测,识别第一通信节点使用的联合导频序列。
根据多个导频使用的序列集合,获取合并序列集合,包括:
从多个导频分别使用的序列集合中任意选择一个序列,得到多个序列,将多个序列进行串联组合处理或叠加处理,得到合并序列集合。
根据联合导频序列确定发射机使用的第二序列,包括:
根据联合导频序列集合和第二序列集合的关联关系或对应关系,通过识别出的联合导频序列,确定扩展序列,即第二序列。
所述方法还包括:
根据其中一个导频上使用的导频序列确定发射机使用的第二序列;或者,根据发射机在多个导频上使用的导频序列确定发射机使用的第二序列;或者,当使用其中一个导频进行检测时,根据该导频上使用的导频序列确定发射机使用的第二序列,当使用其他导频进行检测时,根据联合导频序列确定发射机使用的第二序列。
所述方法还包括:
根据所确定的发射机在多个导频上使用的导频序列,使用其中至少一个导频上的导频序列进行信道估计,用于对接收到的数据符号进行检测;或者,根据所确定的发射机使用的联合导频序列进行信道估计,用于对接收到的数据符号进行检测。
所述方法还包括:
在根据所确定的第二序列对接收到的数据符号进行检测得到检测结果后,对检测结果进行解调译码,获取发射机发送的数据。
所述方法还包括:
从所获取的发射机发送的数据中,获取发射机,即第一通信节点的身份识 别信息、发射机在多个导频上使用的导频序列的信息,即N个第一序列的识别信息、发射机使用的第二序列的信息,即所述第二序列的识别信息。
本申请提供了一种数据处理装置,图3为本申请提供的一种数据处理装置的结构示意图,该装置配置于第一通信节点,如图3所示,该装置包括:获取模块31,设置为获取N个第一序列;确定模块32,设置为根据所述N个第一序列中的至少一个第一序列,确定第二序列;处理模块33,设置为基于所述第二序列对数据进行处理,得到数据符号;发送模块34,设置为发送所述N个第一序列和所述数据符号,其中,N为大于或等于2的整数。
本实施例提供的数据处理装置用于实现如图1所示实施例的数据处理方法,本实施例提供的数据处理装置实现原理和技术效果与图1所示实施例的数据处理方法类似,此处不再赘述。
在上述实施例的基础上,提出了上述实施例的延伸实施例,为了使描述简要,在延伸实施例中仅描述与上述实施例的不同之处。
在一个实施例中,所述N个第一序列为随机获取的。
在一个实施例中,获取模块31,包括如下之一:
从一个序列集合中获取N个第一序列,所述N个第一序列中任意两个序列不同,或者,所述N个第一序列中存在T个序列相同,其中,T为大于或等于2的整数,且T小于或等于N;从不同的序列集合中获取N个第一序列;从同一个序列集合的不同子集中获取N个第一序列。
在一个实施例中,所述序列集合包括如下一个或多个:哈达码序列集合;根据哈达码序列集合得到的序列集合;ZC序列集合;四相序列集合。
在一个实施例中,确定模块32具体设置为:
根据所述N个第一序列,确定合并序列;根据所述合并序列、以及所述合并序列与第二序列的对应关系,确定第二序列。
在一个实施例中,确定模块32具体设置为:
将所述N个第一序列进行串联组合处理或叠加处理,得到合并序列。
在一个实施例中,确定模块32,具体设置为:
根据所述N个第一序列中的一个第一序列、以及该第一序列与第二序列的对应关系,确定第二序列。
在一个实施例中,基于所述第二序列对数据进行的处理包括如下之一:扩 展处理;调制处理;映射处理。
在一个实施例中,发送模块34,包括以下一个:
将所述N个第一序列映射到不同的传输资源上,生成信号并发送;将所述N个第一序列进行合并处理后映射到传输资源上,生成信号并发送;其中,所述合并处理包括串联组合处理或叠加处理。
在一个实施例中,一个第一序列对应一个导频。
在一个实施例中,所述N个第一序列分别对应的导频使用的传输资源包括如下之一:时分的资源;频分的资源;时频分的资源;码分的资源;随机选择的资源。
在一个实施例中,所述数据携带信息,所述信息包括以下一个或多个:
所述N个第一序列的识别信息;所述N个第一序列中至少一个第一序列的能量信息;所述第二序列的识别信息;所述第一通信节点的识别信息。
本申请实施例还提供了一种数据处理装置,图4为本申请提供的又一种数据处理装置的结构示意图,该装置配置于第二通信节点,参见图4,该装置包括:接收模块41,设置为接收信号和数据符号,所述信号是基于N个第一序列生成的,其中,N为大于或等于2的整数;检测模块42,设置为对所述信号进行检测,得到生成所述信号的M个序列,并根据所述M个序列,确定对应所述数据符号的第二序列,其中,M为大于或等于1的整数;获取模块43,设置为根据所述第二序列对所述数据符号进行检测,获取检测结果。
本实施例提供的数据处理装置用于实现如图2所示实施例的数据处理方法,本实施例提供的数据处理装置实现原理和技术效果与图2所示实施例的数据处理方法类似,此处不再赘述。
在上述实施例的基础上,提出了上述实施例的延伸实施例,为了使描述简要,在延伸实施例中仅描述与上述实施例的不同之处。
在一个实施例中,检测模块42,具体设置为:
基于合并序列集合对所述信号进行检测,得到生成所述信号的M个序列,其中,所述合并序列集合基于所述N个第一序列所属的序列集合确定,所述M个序列包括由所述N个第一序列得到的一个合并序列;根据所述合并序列、以及所述合并序列与第二序列的对应关系,确定对应所述数据符号的第二序列。
在一个实施例中,检测模块42,具体设置为:
基于合并序列集合对所述信号进行检测,得到生成所述信号的M个序列, 其中,所述合并序列集合基于所述N个第一序列所属的序列集合确定,所述M个序列包括由所述N个第一序列得到的一个合并序列;根据所述合并序列,确定所述N个第一序列;根据所述N个第一序列中的一个第一序列、以及该第一序列与第二序列的对应关系,确定对应所述数据符号的第二序列。
在一个实施例中,检测模块42,具体设置为:
基于所述N个第一序列中的一个第一序列所属的序列集合对所述信号进行检测,得到生成所述信号的M个序列,其中,所述M个序列包括该第一序列;根据该第一序列、以及该第一序列与第二序列的对应关系,确定对应所述数据符号的第二序列。
在一个实施例中,检测模块42,具体设置为:
基于所述N个第一序列所属的序列集合对所述信号进行检测,得到生成所述信号的M个序列,其中,所述M个序列包括M个第一序列;根据所述M个第一序列,确定合并序列;根据所述合并序列、以及所述合并序列与第二序列的对应关系,确定对应所述数据符号的第二序列。
在一个实施例中,该装置,还包括:信道估计模块,设置为:
使用所述M个序列中的至少一个序列进行信道估计;或者,在所述M个序列包括由所述N个第一序列得到的一个合并序列的情况下,根据所述合并序列确定所述N个第一序列,使用所述N个第一序列中的至少一个第一序列进行信道估计。
在一个实施例中,该装置,还包括:信息获取模块,设置为:
从所述检测结果中获取信息,所述信息包括以下一个或多个:所述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的控制进行信息收发通信。信息包括但不限于N个第一序列和数据符号。
存储装置52作为一种计算机可读存储介质,可设置为存储软件程序、计算机可执行程序以及模块,如本申请实施例中图1所述方法对应的程序指令/模块(例如,数据处理装置中的获取模块31、确定模块32、处理模块33和发送模块34)。存储装置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和获取模块43)。存储装置62可包括存储程序区和存储数据区,其中,存储程序区可存储操作系统、至少一个功能所需的应用程序;存储数据区可存储根据第二通信节点的使用所创建的数据等。此外,存储装置62可以包括高速随机存取存储器,还可以包括非易失性存储器,例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。在一些实例中,存储装置62可包括相对于处理器61远程设置的存储器,这些远程存储器可以通过网络连接至第二通信节点。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
本申请实施例还提供一种存储介质,所述存储介质存储有计算机程序,所述计算机程序被处理器执行时实现本申请实施例中任一所述的数据处理方法。如应用于第一通信节点的数据处理方法和应用于第二通信节点的数据处理方法,其中,应用于第一通信节点的数据处理方法包括:获取N个第一序列;根据所述N个第一序列中的至少一个第一序列,确定第二序列;基于所述第二序列对数据进行处理,得到数据符号;发送所述N个第一序列和所述数据符号;其中,N为大于或等于2的整数。
应用于第二通信节点的数据处理方法包括:接收信号和数据符号,所述信号是基于N个第一序列生成的;对所述信号进行检测,得到生成所述信号的M个序列,并根据所述M个序列,确定对应所述数据符号的第二序列;根据所述第二序列对所述数据符号进行检测,获取检测结果;其中,N为大于或等于2的整数,M为大于或等于1的整数。
本申请实施例的计算机存储介质,可以采用一个或多个计算机可读的介质的任意组合。计算机可读介质可以是计算机可读信号介质或者计算机可读存储介质。计算机可读存储介质例如可以是——但不限于——电、磁、光、电磁、红外线、或半导体的系统、装置或器件,或者任意以上的组合。计算机可读存储介质的例子(非穷举的列表)包括:具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机存取存储器(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 (24)

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

Priority Applications (3)

Application Number Priority Date Filing Date Title
CA3164179A CA3164179A1 (en) 2020-01-16 2020-12-30 Data processing methods and apparatuses, first communication node, second communication mode, and storage medium
US17/792,374 US20230056333A1 (en) 2020-01-16 2020-12-30 Data processing methods and apparatuses, first communication node, second communication node, and storage medium
EP20913723.1A EP4093138A4 (en) 2020-01-16 2020-12-30 DATA PROCESSING METHOD AND DEVICES, FIRST COMMUNICATION NODE, SECOND COMMUNICATION MODE AND STORAGE MEDIUM

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010048797.8A CN111901891A (zh) 2020-01-16 2020-01-16 数据处理方法、装置、第一通信节点和第二通信节点
CN202010048797.8 2020-01-16

Publications (1)

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

Family

ID=73169741

Family Applications (1)

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

Country Status (5)

Country Link
US (1) US20230056333A1 (zh)
EP (1) EP4093138A4 (zh)
CN (1) CN111901891A (zh)
CA (1) CA3164179A1 (zh)
WO (1) WO2021143528A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111901082A (zh) * 2020-01-16 2020-11-06 中兴通讯股份有限公司 信号处理方法、装置、第一通信节点和第二通信节点
CN111901891A (zh) * 2020-01-16 2020-11-06 中兴通讯股份有限公司 数据处理方法、装置、第一通信节点和第二通信节点
CN118157827A (zh) * 2022-12-05 2024-06-07 中兴通讯股份有限公司 数据传输方法、设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3340726A1 (en) * 2015-09-08 2018-06-27 Huawei Technologies Co., Ltd. Method for uplink data transmission, terminal device and network device
CN108306841A (zh) * 2017-01-11 2018-07-20 中兴通讯股份有限公司 用于ofdm通信的信号设计方法及系统、发射机、接收机
CN109769259A (zh) * 2019-04-03 2019-05-17 成都中科微信息技术研究院有限公司 一种电力无线通信系统中的免调度传输方法
CN111901891A (zh) * 2020-01-16 2020-11-06 中兴通讯股份有限公司 数据处理方法、装置、第一通信节点和第二通信节点

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6141373A (en) * 1996-11-15 2000-10-31 Omnipoint Corporation Preamble code structure and detection method and apparatus
EP1838008A1 (en) * 2006-03-23 2007-09-26 Sony Deutschland Gmbh Preamble for synchronization
EP2366261A4 (en) * 2008-09-04 2013-02-13 Powerwave Cognition Inc ADVANCED WIRELESS AD-HOC COMMUNICATION TECHNIQUES
US9621396B2 (en) * 2013-08-05 2017-04-11 Samsung Electronics Co., Ltd. Transmitter, receiver, and controlling methods thereof
WO2015197110A1 (en) * 2014-06-24 2015-12-30 Huawei Technologies Co., Ltd. Method and apparatus for multiple access in a wireless communication system
KR102283183B1 (ko) * 2014-07-28 2021-07-30 삼성전자주식회사 이동통신 시스템에서의 시퀀스 동기화 수행을 위한 방법 및 장치
KR20180053711A (ko) * 2015-09-14 2018-05-23 후아웨이 테크놀러지 컴퍼니 리미티드 업링크 제어 정보 송신 방법, 단말 기기, 기지국 및 통신 시스템
US10973055B2 (en) * 2016-10-20 2021-04-06 Alcatel Lucent System and method for preamble sequence transmission and reception to control network traffic
CN116209052B (zh) * 2017-05-04 2024-04-23 华为技术有限公司 同步信号的发送方法、同步信号的接收方法及相关设备
US12040946B2 (en) * 2019-11-10 2024-07-16 Parallel Wireless, Inc. Decomposition and distribution of network functions for deployment flexibility

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3340726A1 (en) * 2015-09-08 2018-06-27 Huawei Technologies Co., Ltd. Method for uplink data transmission, terminal device and network device
CN108306841A (zh) * 2017-01-11 2018-07-20 中兴通讯股份有限公司 用于ofdm通信的信号设计方法及系统、发射机、接收机
CN109769259A (zh) * 2019-04-03 2019-05-17 成都中科微信息技术研究院有限公司 一种电力无线通信系统中的免调度传输方法
CN111901891A (zh) * 2020-01-16 2020-11-06 中兴通讯股份有限公司 数据处理方法、装置、第一通信节点和第二通信节点

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
See also references of EP4093138A4
ZTE, SANECHIPS: "On the receiver design of grant-free MUSA", 3GPP DRAFT; R1-1720221 ON THE RECEIVER DESIGN OF GRANT-FREE MUSA_FINAL, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG1, no. Reno, USA; 20171127 - 20171201, 18 November 2017 (2017-11-18), Mobile Competence Centre ; 650, route des Lucioles ; F-06921 Sophia-Antipolis Cedex ; France, XP051369857 *

Also Published As

Publication number Publication date
CN111901891A (zh) 2020-11-06
EP4093138A1 (en) 2022-11-23
US20230056333A1 (en) 2023-02-23
EP4093138A4 (en) 2024-02-28
CA3164179A1 (en) 2021-07-22

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
WO2021143528A1 (zh) 数据处理方法、装置、第一通信节点、第二通信节点及存储介质
US11658772B2 (en) Electronic device and communication method for non-orthogonal-resource based multiple access
EP3125457A2 (en) Signal processing system and method, base station and user equipment
WO2016062253A1 (en) System and method for low peak to average power ratio multiple access communications
CN110072287B (zh) 基于加扰的数据传输方法
CN111200572B (zh) 数据传输方法和装置
CN106160787B (zh) 一种数据传输方法及装置
US20240064790A1 (en) Device and method for associating resource information with channel metric information in wireless networks
WO2018100428A1 (en) Method and device for signal processing in communication system
US20210211230A1 (en) Data transmission method and apparatus and storage medium
KR102054840B1 (ko) 무선신호의 송수신 방법
WO2021143632A1 (zh) 数据传输方法、装置、第一通信节点和第二通信节点
US10979263B2 (en) Data processing method and device
WO2021143529A1 (zh) 信号处理方法、装置、第一通信节点、第二通信节点及存储介质
WO2017133407A1 (zh) 信号传输方法和装置
WO2022002005A1 (zh) 一种序列生成方法及相关设备
US20210195568A1 (en) Communication method and apparatus
WO2021143470A1 (zh) 参考信号处理方法、装置、第一通信节点和第二通信节点
KR20200102826A (ko) 통신 시스템에서 비-직교 상향링크 통신을 위한 방법 및 장치
Mohammadkarimi et al. Signature-based Non-orthogonal Multiple Access (S-NOMA) for Massive Machine-Type Communications in 5G
US11785613B2 (en) Base station and communication method
CN109962751B (zh) 一种数据处理方法及装置
WO2023050435A1 (zh) 一种用于无线保真Wi-Fi系统的通信方法及装置
Guo et al. Research on SCMA Satellite Receiver Based on Message Passing

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: 20913723

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 3164179

Country of ref document: CA

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2020913723

Country of ref document: EP

Effective date: 20220816