WO2024098301A1 - 信号传输方法和装置 - Google Patents

信号传输方法和装置 Download PDF

Info

Publication number
WO2024098301A1
WO2024098301A1 PCT/CN2022/130960 CN2022130960W WO2024098301A1 WO 2024098301 A1 WO2024098301 A1 WO 2024098301A1 CN 2022130960 W CN2022130960 W CN 2022130960W WO 2024098301 A1 WO2024098301 A1 WO 2024098301A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence set
complementary sequence
permutation
permuted
finite field
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2022/130960
Other languages
English (en)
French (fr)
Inventor
冯奇
汪凡
张长
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN202280101360.3A priority Critical patent/CN120153613A/zh
Priority to EP22964775.5A priority patent/EP4611324A4/en
Priority to PCT/CN2022/130960 priority patent/WO2024098301A1/zh
Publication of WO2024098301A1 publication Critical patent/WO2024098301A1/zh
Priority to US19/204,328 priority patent/US20250274814A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0007—Code type
    • H04J13/0055—ZCZ [zero correlation zone]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/10—Code generation
    • H04J13/14—Generation of codes with a zero correlation zone

Definitions

  • the present application relates to the field of communication technology, and in particular to a signal transmission method and device.
  • the ideal autocorrelation and ideal cross-correlation characteristics of sequences have very important applications in wireless communications.
  • the ideal autocorrelation characteristic means that the correlation value between a sequence and any non-zero shift is zero
  • the ideal cross-correlation characteristic means that the correlation value of any shift of two sequences is zero.
  • Periodic correlation refers to the cyclic shift correlation of the sequence, and the overlapping part of the sequence is always equal to the sequence length.
  • Non-periodic correlation refers to the zero-filled shift correlation of the sequence, and the overlapping part of the sequence is usually less than the sequence length.
  • periodic correlation sequences there are sequences with ideal autocorrelation characteristics and sequences with ideal mutual correlation characteristics, but there is no sequence with both ideal autocorrelation and ideal mutual correlation characteristics.
  • non-periodic correlation sequences there is no sequence with ideal autocorrelation characteristics, nor is there a sequence with ideal mutual correlation characteristics.
  • uplink random access uses the periodic correlation characteristics of the Zadoff-Chu sequence (also called the ZC sequence) and uses the ZC sequence to add a cyclic prefix to achieve ideal autocorrelation.
  • ZC sequence also called the ZC sequence
  • the embodiments of the present application provide a signal transmission method and device, which can reduce the time-frequency resource overhead of signal transmission, improve spectrum efficiency, and thus improve system performance.
  • a signal transmission method comprising: determining a permutation complementary sequence set, the permutation complementary sequence set comprising M member sequences, the member sequence comprising N member symbols, M and N are both integers greater than 1, the member symbols are obtained by performing a permutation operation on parameters of the permutation complementary sequence set, the permutation operation is a single mapping operation within a finite field, and the permutation complementary sequence set satisfies non-periodic correlation; and sending a signal based on the permutation complementary sequence set.
  • the signal transmission method provided by the present application performs a single mapping operation in a finite field on the parameters in the permutation complementary sequence set to obtain a member symbol of the permutation complementary sequence set, obtains a member sequence of the permutation complementary sequence set according to the member symbol, and then determines the permutation complementary sequence set according to the member sequence, and the permutation complementary sequence set satisfies the non-periodic correlation. Since the permutation complementary sequence set satisfies the non-periodic correlation, when sending a signal through the permutation complementary sequence set, the transmitting end does not need to add a cyclic prefix when determining the signal to be sent, which can reduce the time-frequency resource overhead of signal transmission, improve spectrum efficiency, and thus improve system performance.
  • the parameters of the permutation complementary sequence set include at least one of the following: a length N of a member sequence in the permutation complementary sequence set, a number M of member sequences, and a length Z of a zero correlation zone in the permutation complementary sequence set, where Z is an integer greater than or equal to 1.
  • the number of permutation complementary sequence sets is Among them, the lth replacement complementary sequence set s [k][l] in the kth replacement complementary sequence set is expressed as:
  • N is greater than or equal to M
  • M is greater than or equal to Z
  • M is divisible by Z, k ⁇ 1,2,...,Z-1 ⁇ , Replace the nth member symbol of the mth member sequence in the complementary sequence set s [k][l] Expressed as:
  • the permuted complementary sequence set obtained in the embodiment of the present application satisfies non-periodic correlation.
  • the transmitter does not need to add a cyclic prefix when determining the signal to be sent, which can reduce the time-frequency resource overhead of signal transmission, improve spectrum efficiency, and thus improve system performance.
  • the permuted complementary sequence set obtained in the embodiment of the present application does not need to add a cyclic prefix, which reduces overhead, improves spectrum efficiency, and also increases sequence capacity.
  • N>M Z.
  • the sequence obtained by this implementation method reduces overhead and improves spectrum efficiency while also increasing sequence capacity, and can improve the signal detection capability of the receiving end in scenarios with high noise or scenarios where the receiving end has high requirements for signal detection performance.
  • the sequence obtained by this implementation reduces overhead and improves spectrum efficiency, and is suitable for multi-user access scenarios.
  • the permutation complementary sequence set is a partial sequence set in the candidate permutation complementary sequence set, and the number of the candidate permutation complementary sequence set is Among them, the lth replacement complementary sequence set s [k][l] in the kth replacement complementary sequence set is expressed as:
  • M is divisible by Z, k ⁇ 1,2,...,Z-1 ⁇ , Replace the nth member symbol of the mth member sequence in the complementary sequence set s [k][l] Expressed as:
  • the embodiment of the present application obtains a permuted complementary sequence set by limiting the sequence set index number within the group of the candidate permuted complementary sequence set, so that the transmitter does not need to add a cyclic prefix, which reduces overhead and improves spectrum efficiency while also improving sequence capacity, and is suitable for high-speed mobile communication scenarios.
  • the permutation complementary sequence set is a sequence set in which l of the candidate permutation complementary sequence sets belongs to the following set:
  • f is a positive integer.
  • the permutation complementary sequence set obtained in the embodiment of the present application has a number of permutation complementary sequence sets within the group that is close to 1/3 of the number of candidate permutation complementary sequence sets. Compared with the restricted set of ZC sequences, it is beneficial to increase the number of valid sequence sets, improves the sequence capacity, and is suitable for high-speed mobile communication scenarios.
  • sending a signal based on a permutation complementary sequence set includes: determining a target permutation complementary sequence set from the permutation complementary sequence set; mapping the target permutation complementary sequence set to N member symbols and M subcarriers, generating the above-mentioned signal, and sending the signal.
  • sending a signal based on a permuted complementary sequence set includes: a terminal device sending a random access signal to a network device based on the permuted complementary sequence set.
  • the member sequence length N and the member sequence number M are sent by the network device to the terminal device, or are agreed upon by a protocol.
  • a signal transmission device which may be a terminal device or a network device, or a device in the terminal device or the network device (for example, a chip, or a chip system, or a circuit), or a device that can be used in combination with the terminal device or the network device.
  • the device may include a module or unit corresponding to each of the methods/operations/steps/actions described in the first aspect.
  • the module or unit may be a hardware circuit, software, or a combination of hardware circuit and software.
  • the device includes: a processing unit, used to determine a permutation complementary sequence set, the permutation complementary sequence set includes M member sequences, the member sequence includes N member symbols, M and N are both integers greater than 1, the above member symbols are obtained by performing a permutation operation on parameters of the permutation complementary sequence set, the permutation operation is a single mapping operation within a finite field, and the permutation complementary sequence set satisfies non-periodic correlation; a transceiver unit, used to send a signal based on the permutation complementary sequence set.
  • the parameters of the permutation complementary sequence set include at least one of the following: the length N of the member sequence in the permutation complementary sequence set, the number M of the member sequences, and the length Z of the zero correlation zone in the permutation complementary sequence set, where Z is an integer greater than or equal to 1.
  • the number of permutation complementary sequence sets is Among them, the lth replacement complementary sequence set s [k][l] in the kth replacement complementary sequence set is expressed as:
  • N is greater than or equal to M
  • M is greater than or equal to Z
  • M is divisible by Z, k ⁇ 1,2,...,Z-1 ⁇ , Replace the nth member symbol of the mth member sequence in the complementary sequence set s [k][l] Expressed as:
  • N>M Z.
  • the permutation complementary sequence set is a partial sequence set in a candidate permutation complementary sequence set
  • the number of the candidate permutation complementary sequence set is Among them, the lth replacement complementary sequence set s [k][l] in the kth replacement complementary sequence set is expressed as:
  • M is divisible by Z, k ⁇ 1,2,...,Z-1 ⁇ , Replace the nth member symbol of the mth member sequence in the complementary sequence set s [k][l] Expressed as:
  • the permutation complementary sequence set is a sequence set in which l of the candidate permutation complementary sequence sets belongs to the following set:
  • f is a positive integer.
  • the processing unit is further used to: determine a target permutation complementary sequence set from the permutation complementary sequence set; map the target permutation complementary sequence set to N member symbols and M subcarriers to generate a signal; and the transceiver unit is further used to: send a signal.
  • the transceiver unit is further configured to: send a random access signal to the network device based on the permuted complementary sequence set.
  • the member sequence length N and the member sequence number M are sent by the network device to the apparatus, or are agreed upon by the protocol.
  • a signal transmission device comprising: a processor, the processor is coupled to a memory, the memory is used to store a computer program, when the processor calls the computer program, the device executes a method in any possible implementation of the first aspect.
  • processors there are one or more processors and one or more memories.
  • the memory may be integrated with the processor, or the memory may be provided separately from the processor.
  • the memory can be a non-transitory memory, such as a read-only memory (ROM), which can be integrated with the processor on the same chip or can be separately set on different chips.
  • ROM read-only memory
  • the embodiments of the present application do not limit the type of memory and the setting method of the memory and the processor.
  • the relevant data interaction process such as sending the connection data request information
  • receiving the capability information can be a process of receiving the input capability information from the processor.
  • the processed output data can be output to the transmitter, and the input data received by the processor can come from the receiver.
  • the transmitter and the receiver can be collectively referred to as a transceiver.
  • the device in the third aspect mentioned above can be a chip, and the processor can be implemented by hardware or by software.
  • the processor can be a logic circuit, an integrated circuit, etc.; when implemented by software, the processor can be a general-purpose processor, which is implemented by reading the software code stored in the memory.
  • the memory can be integrated in the processor or can be located outside the processor and exist independently.
  • a computer-readable storage medium which stores a computer program (also referred to as code or instruction), which, when executed on a computer, enables the computer to execute a method in any possible implementation of the first aspect.
  • a computer program also referred to as code or instruction
  • a computer program product comprising: a computer program (also referred to as code, or instruction), which, when executed, enables a computer to execute a method in any possible implementation of the first aspect.
  • a computer program also referred to as code, or instruction
  • a communication system including a terminal device and a network device, wherein the terminal device or the network device is used to implement the above-mentioned first aspect or any possible implementation method of the first aspect.
  • FIG1 is a schematic diagram of a communication system used in an embodiment of the present application.
  • FIG2 is a schematic diagram of a period-related sequence provided in an embodiment of the present application.
  • FIG3 is a schematic diagram of a non-periodic correlation sequence provided in an embodiment of the present application.
  • FIG4 is a schematic diagram of a time-frequency resource configuration format of a physical random access channel provided in an embodiment of the present application
  • FIG5 is a schematic diagram of another physical random access channel time-frequency resource configuration format provided in an embodiment of the present application.
  • FIG6 is a schematic flow chart of a signal transmission method provided in an embodiment of the present application.
  • FIG7 is a schematic diagram of a mutual correlation characteristic of a permuted complementary sequence set provided in an embodiment of the present application.
  • FIG8 is a schematic diagram of the cross-correlation characteristics of another permuted complementary sequence set provided in an embodiment of the present application.
  • FIG9 is a schematic diagram of the cross-correlation characteristics of yet another permuted complementary sequence set provided in an embodiment of the present application.
  • FIG10 is a schematic diagram of a ZC sequence and a candidate permuted complementary sequence set provided in an embodiment of the present application using a restricted set for frequency offset resistance comparison;
  • FIG11 is a schematic block diagram of a signal transmission device provided in an embodiment of the present application.
  • FIG. 12 is a schematic block diagram of another signal transmission device provided in an embodiment of the present application.
  • words such as “first” and “second” are used to distinguish the same or similar items with substantially the same functions and effects. Those skilled in the art can understand that words such as “first” and “second” do not limit the quantity and execution order, and words such as “first” and “second” do not necessarily limit the difference.
  • At least one refers to one or more
  • plural refers to two or more.
  • And/or describes the association relationship of associated objects, indicating that three relationships may exist.
  • a and/or B can represent: A exists alone, A and B exist at the same time, and B exists alone, where A and B can be singular or plural.
  • the character “/” generally indicates that the objects associated before and after are in an “or” relationship.
  • At least one of the following” or similar expressions refers to any combination of these items, including any combination of single or plural items.
  • At least one of a, b, or c can represent: a, b, c, a-b, a--c, b-c, or a-b-c, where a, b, c can be single or multiple.
  • LTE long term evolution
  • FDD frequency division duplex
  • TDD LTE time division duplex
  • 5G fifth generation mobile communication system
  • NR new radio
  • the terminal device in the embodiments of the present application may also be referred to as: user equipment (UE), mobile station (MS), mobile terminal (MT), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication equipment, user agent or user device, etc.
  • UE user equipment
  • MS mobile station
  • MT mobile terminal
  • access terminal user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication equipment, user agent or user device, etc.
  • a terminal device can be a device that provides voice/data connectivity to users, such as a handheld device with wireless connection function, a vehicle-mounted device, etc.
  • terminal devices include: mobile phones, tablet computers, laptops, PDAs, mobile internet devices (MID), wearable devices, drones, robots, smart point of sale (POS), customer-premises equipment (CPE), virtual reality (VR) equipment, augmented reality (AR) equipment, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical surgery, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, and wireless terminals in smart homes.
  • MID mobile internet devices
  • POS customer-premises equipment
  • VR virtual reality
  • AR augmented reality
  • the present application does not limit the wireless terminals in the present invention, such as wireless terminals in smart home, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDA), handheld devices with wireless communication functions, computing devices or other processing devices connected to wireless modems, vehicle-mounted devices, wearable devices, terminal devices in 5G networks or terminal devices in future evolved public land mobile communication networks (PLMN), etc.
  • wireless terminals in smart home cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDA), handheld devices with wireless communication functions, computing devices or other processing devices connected to wireless modems, vehicle-mounted devices, wearable devices, terminal devices in 5G networks or terminal devices in future evolved public land mobile communication networks (PLMN), etc.
  • PLMN public land mobile communication networks
  • the terminal device may be a terminal device in an Internet of Things (IoT) system.
  • IoT Internet of Things
  • the Internet of Things is an important part of the future development of information technology. Its main technical feature is to connect objects to the network through communication technology, thereby realizing an intelligent network of human-machine interconnection and object-to-object interconnection.
  • the terminal device in the embodiment of the present application may be a wearable device.
  • Wearable devices may also be called wearable smart devices, which are a general term for wearable devices that are designed and developed using wearable technology for daily wear, such as glasses, gloves, watches, clothing and shoes. Wearable devices are portable devices that can be worn directly on the body or integrated into the user's clothes or accessories.
  • Wearable devices are not only hardware devices, but also can realize powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include full-featured, large-size, and can realize complete or partial functions without relying on smartphones, such as smart watches or smart glasses, and only focus on a certain type of application functions, and need to be used in conjunction with other devices such as smartphones, such as various types of smart bracelets and smart jewelry for vital sign monitoring.
  • the terminal device may also be a terminal device in machine type communication (MTC).
  • MTC machine type communication
  • the terminal device may also be a vehicle-mounted module, a vehicle-mounted module, a vehicle-mounted component, a vehicle-mounted chip or a vehicle-mounted unit, etc., which is built into the vehicle as one or more components or units.
  • the vehicle can implement the method provided by the present application through the built-in vehicle-mounted module, vehicle-mounted module, vehicle-mounted component, vehicle-mounted chip or vehicle-mounted unit, etc. Therefore, the embodiments of the present application may also be applied to the Internet of Vehicles, such as vehicle to everything (V2X), long-term evolution-vehicle (LTE-V), vehicle-to-vehicle (V2V) technology, etc.
  • V2X vehicle to everything
  • LTE-V long-term evolution-vehicle
  • V2V vehicle-to-vehicle
  • the network device involved in the present application can be a device that communicates with a terminal device.
  • the network device can also be called an access network device or a wireless access network device. It can be a transmission reception point (TRP), an evolved NodeB (eNB or eNodeB) in an LTE system, a home base station (for example, home evolved NodeB, or home Node B, HNB), a baseband unit (BBU), or a wireless controller in a cloud radio access network (CRAN) scenario, or the network device can be a relay station, an access point, a vehicle-mounted device, a wearable device, a network device in a 5G network, or a network device in a future evolved PLMN network, etc.
  • TRP transmission reception point
  • eNB or eNodeB evolved NodeB
  • HNB home evolved NodeB
  • BBU baseband unit
  • CRAN cloud radio access network
  • the network device can be a relay station, an access point, a vehicle-mounted device, a
  • the above network devices can also be urban base stations, micro base stations, pico base stations, femto base stations, etc., and the present application does not limit this.
  • the network device may include a centralized unit (CU) node, a distributed unit (DU) node, a radio access network (RAN) device including a CU node and a DU node, or a RAN device including a control plane CU node (CU-CP node) and a user plane CU node (CU-UP node) and a DU node.
  • CU centralized unit
  • DU distributed unit
  • RAN radio access network
  • RAN radio access network
  • the network equipment provides services for the cell, and the terminal equipment communicates with the cell through the transmission resources (for example, frequency domain resources, or spectrum resources) allocated by the network equipment.
  • the cell can belong to a macro base station (for example, macro eNB or macro gNB, etc.), or to a base station corresponding to a small cell.
  • the small cell here may include: metro cell, micro cell, pico cell, femto cell, etc. These small cells have the characteristics of small coverage and low transmission power, and are suitable for providing high-speed data transmission services.
  • the terminal device or network device may include a hardware layer, an operating system layer running on the hardware layer, and an application layer running on the operating system layer.
  • the hardware layer includes hardware such as a central processing unit (CPU), a memory management unit (MMU), and a memory (also called main memory).
  • the operating system may be any one or more computer operating systems that implement business processing through a process, such as a Linux operating system, a Unix operating system, an Android operating system, an iOS operating system, or a Windows operating system.
  • the application layer includes applications such as a browser, an address book, a word processing software, and an instant messaging software.
  • the embodiment of the present application does not specifically limit the specific structure of the execution subject of the method provided in the embodiment of the present application, as long as it can communicate according to the method provided in the embodiment of the present application, for example, the execution subject of the method provided in the embodiment of the present application may be a terminal device or a network device, or a functional module in a terminal device or a network device that can execute a program.
  • computer-readable media may include, but are not limited to: magnetic storage devices (e.g., hard disks, floppy disks, or tapes, etc.), optical disks (e.g., compact disks (CDs), digital versatile disks (DVDs), etc.), smart cards and flash memory devices (e.g., erasable programmable read-only memory (EPROM), cards, sticks or key drives, etc.).
  • magnetic storage devices e.g., hard disks, floppy disks, or tapes, etc.
  • optical disks e.g., compact disks (CDs), digital versatile disks (DVDs), etc.
  • smart cards and flash memory devices e.g., erasable programmable read-only memory (EPROM), cards, sticks or key drives, etc.
  • various storage media described herein may represent one or more devices and/or other machine-readable media for storing information.
  • machine-readable medium may include, but is not limited to, various other media that can store, contain and/or carry instructions and/or data.
  • FIG. 1 To facilitate understanding of the embodiments of the present application, a communication system applicable to the embodiments of the present application is first described in detail in conjunction with FIG. 1 .
  • FIG. 1 shows a communication system 100 to which an embodiment of the present application can be applied.
  • the communication system 100 may include at least one network device, such as the network device 110 shown in FIG. 1 ; the communication system 100 may also include at least one terminal device, such as the terminal device 120 shown in FIG. 1 .
  • the network device 110 and the terminal device 120 may communicate via a wireless link.
  • Each communication device, such as the network device 110 or the terminal device 120 may be configured with multiple antennas, which may include at least one transmitting antenna for sending signals and at least one receiving antenna for receiving signals.
  • each communication device also additionally includes a transmitter chain and a receiver chain, and those skilled in the art may understand that they may include multiple components related to signal transmission and signal reception (such as processors, modulators, multiplexers, demodulators, demultiplexers or antennas, etc.). Therefore, the network device 110 and the terminal device 120 may communicate via a multi-antenna technology.
  • Figure 1 exemplarily shows a network device and two terminal devices.
  • the communication system 100 may include multiple network devices and the coverage area of each network device may include other numbers of terminal devices, which is not limited in the embodiments of the present application.
  • Periodic correlation refers to the cyclic shift correlation of the sequence. The overlapping part of the sequence is always equal to the sequence length.
  • v* is the conjugate of the complex number v
  • ⁇ is the delay of the sequence v.
  • FIG2 is a schematic diagram of a periodically correlated sequence.
  • sequence u [u 0 , u 1 , u 2 , u 3 , u 4 , u 5 , u 6 , u 7 ]
  • sequence v [v 0 , v 1 , v 2 , v 3 , v 4 , v 5 , v 6 , v 7 ]
  • the lengths N of the two sequences are 8, and the delay of sequence v is 3.
  • the overlapping portion of sequence u and sequence v is always equal to the sequence length 8, and the periodic correlation function of sequence u and sequence v is:
  • v * is the conjugate of the complex number v
  • ⁇ is the delay of the sequence v.
  • Non-periodic correlation refers to the zero-filled shift correlation of the sequence.
  • the overlapping part of the sequence is usually smaller than the sequence length.
  • v* is the conjugate of the complex number v
  • ⁇ is the delay of the sequence v.
  • FIG3 is a schematic diagram of a non-periodic correlation sequence.
  • sequence u [u 0 , u 1 , u 2 , u 3 , u 4 , u 5 , u 6 , u 7 ]
  • received sequence v [v 0 , v 1 , v 2 , v 3 , v 4 , v 5 , v 6 , v 7 ]
  • the lengths N of the two sequences are 8, and the delay of sequence v is 3.
  • the overlapping part of sequence u and sequence v is always less than the sequence length 8
  • the non-periodic correlation function of sequence u and sequence v is:
  • Complementary sequence set refers to the sequence set in which the sum of the autocorrelation functions of all member sequences satisfies the ideal autocorrelation characteristics.
  • uplink random access uses the periodic correlation characteristics of the ZC sequence and adds a cyclic prefix to the ZC sequence to achieve ideal autocorrelation.
  • this will bring about a large time-frequency resource overhead, resulting in low spectrum efficiency.
  • uplink random access utilizes the periodic correlation characteristics of the ZC sequence and adopts the ZC sequence to add a cyclic prefix to achieve ideal autocorrelation.
  • Figures 4 and 5 show the physical random access channel (PRACH) time-frequency resource configuration format (PRACH format for short).
  • the first line of Figures 4 and 5 is the PRACH format of the transmitter.
  • the transmitter sends a signal, and correspondingly, the receiver receives the signal.
  • the second line indicates that the transmitted signal reaches the receiver after a period of time.
  • the terminal device sends an uplink signal containing a preamble sequence through the PRACH channel.
  • Different preamble sequences are transmitted through PRACH time-frequency resources with different configuration formats, that is, different preamble sequences correspond to different PRACH time-frequency resource configuration formats.
  • the preamble sequence includes a cyclic prefix, a ZC sequence part, and a guard interval in the PRACH time-frequency resource configuration.
  • Different preamble sequences have different sizes of cyclic prefixes in the PRACH time-frequency resource configuration, and the coverage radius of the cell is also different.
  • the cell coverage radius r is calculated as follows:
  • t CP is the overhead of the cyclic prefix and c is the speed of light.
  • a PRACH format with a larger cyclic prefix is used to achieve random access.
  • the time-frequency resources of the cyclic prefix, ZC sequence part, and guard interval of the access preamble need to be set equal.
  • the PRACH format shown in FIG4 is PRACH format 0, and the cyclic prefix t CP of the random access preamble sequence corresponding to PRACH format 0 is 0.1 ms.
  • the PRACH format shown in FIG5 is PRACH format 1, and the cyclic prefix t CP of the random access preamble sequence corresponding to PRACH format 1 is 0.68 ms.
  • the cell coverage radius is greater than or equal to 15 km, it is necessary to use PRACH format 1 with a larger cyclic prefix to achieve random access.
  • the cyclic prefix t CP of the random access preamble sequence is 0.68 ms, and the cyclic prefix occupies a large overhead, which will bring about a large time-frequency resource overhead, resulting in low spectrum efficiency.
  • the present application proposes a signal transmission method and device, which performs a single mapping operation in a finite field on the parameters in the permutation complementary sequence set to obtain a member symbol of the permutation complementary sequence set, obtains a member sequence of the permutation complementary sequence set according to the member symbol, and then determines the permutation complementary sequence set according to the member sequence, and the permutation complementary sequence set satisfies the non-periodic correlation.
  • the transmitter since the permutation complementary sequence set satisfies the non-periodic correlation, when sending a signal through the permutation complementary sequence set, the transmitter does not need to add a cyclic prefix when determining the signal to be sent, which can reduce the time-frequency resource overhead of signal transmission, improve spectrum efficiency, and thus improve system performance.
  • the embodiments of the present application can be applied to a plurality of different scenarios, including the scenario shown in FIG. 1, but are not limited to the scenario.
  • the terminal device can be used as a transmitter and the network device can be used as a receiver
  • the network device can be used as a transmitter and the terminal device can be used as a receiver
  • the network device can be used as a transmitter and the terminal device can be used as a receiver
  • the embodiments of the present application are described below according to the transmitter and the receiver.
  • the transmitting end can be replaced by a device or chip that can implement functions similar to those of the transmitting end
  • the receiving end can also be replaced by a device or chip that can implement functions similar to those of the receiving end.
  • the embodiments of the present application do not limit their names.
  • FIG6 is a schematic flow chart of a signal transmission method 600 provided in an embodiment of the present application.
  • the method 600 can be applied to the communication system 100 shown in FIG1 , but the embodiment of the present application is not limited thereto.
  • the method 600 can include the following steps:
  • a transmitting end determines a permutation complementary sequence set, the permutation complementary sequence set includes M member sequences, each member sequence of the M member sequences includes N member symbols, and M and N are both integers greater than 1.
  • Each member symbol of the N member symbols is obtained by performing a permutation operation on a parameter of the permutation complementary sequence set, the permutation operation is a single mapping operation within a finite field, and the permutation complementary sequence set satisfies aperiodic correlation.
  • the parameters of the permutation complementary sequence set include at least one of the following: the length N of the member sequence in the permutation complementary sequence set, the number M of the member sequences, and the length Z of the zero correlation zone in the permutation complementary sequence set, where Z is an integer greater than or equal to 1.
  • the number of the above-mentioned replacement complementary sequence sets may be one or more, which is not limited in the embodiment of the present application.
  • the transmitting end may specifically determine the permutation complementary sequence set in the following manner: the transmitting end performs a permutation operation on the parameters of the permutation complementary sequence set to determine a member symbol, and the transmitting end may execute the determination method N times to obtain N member symbols; the transmitting end determines a member sequence based on the N member symbols, and the transmitting end may execute the determination method M times to obtain M member sequences; finally, the transmitting end may determine a permutation complementary sequence set based on the M member sequences.
  • the above permutation complementary sequence set is determined by the transmitting end.
  • the permutation complementary sequence set may also be agreed upon in the protocol, or pre-stored, or pre-sent by the receiving end to the transmitting end, and this application does not limit this.
  • the transmitting end transmits a signal based on the permuted complementary sequence set.
  • the receiving end receives the signal from the transmitting end.
  • the above-mentioned sending of a signal based on a permutation complementary sequence set includes: determining a target permutation complementary sequence set from the permutation complementary sequence set; mapping the target permutation complementary sequence set to N member symbols and M subcarriers, generating a signal, and sending the signal.
  • the M member sequences of the permutation complementary sequence set use frequency division multiplexing, and the N member symbols of the member sequence use time division multiplexing.
  • the transmitter may select one permutation complementary sequence set from the permutation complementary sequence sets, determine the permutation complementary sequence set as the target permutation complementary sequence set, generate a signal using the target permutation complementary sequence set, and send the signal.
  • the receiving end can determine multiple permutation complementary sequence sets in the same manner as the transmitting end. After the receiving end receives the signal from the transmitting end, the receiving end can search from multiple permutation complementary sequence sets, and determine the target permutation complementary sequence set used by the transmitting end to send the signal by performing non-periodic correlation processing on the received signal and the local multiple permutation complementary sequence sets.
  • the signal transmission method of the embodiment of the present application performs a single mapping operation in a finite field on the parameters in the permutation complementary sequence set to obtain a member symbol of the permutation complementary sequence set, obtains a member sequence of the permutation complementary sequence set according to the member symbol, and then determines the permutation complementary sequence set according to the member sequence, and the permutation complementary sequence set satisfies the non-periodic correlation. Since the permutation complementary sequence set satisfies the non-periodic correlation, when sending a signal through the permutation complementary sequence set, the transmitting end does not need to add a cyclic prefix when determining the signal to be sent, which can reduce the time-frequency resource overhead of signal transmission, improve spectrum efficiency, and thus improve system performance.
  • the number of the above replacement complementary sequence sets is There are Z-1 groups in total, each with Among them, the lth replacement complementary sequence set s [k] [l] in the kth replacement complementary sequence set is expressed as:
  • N is the length of the member sequence of the permutation complementary sequence set
  • M is the number of member sequences of the permutation complementary sequence set
  • Z is the length of the zero correlation zone of the permutation complementary sequence set
  • l is the index number of the number of members in the permutation complementary sequence set.
  • N is greater than or equal to M
  • M is greater than or equal to Z
  • M is divisible by Z, k ⁇ 1,2,...,Z-1 ⁇
  • mapping the target permutation complementary sequence set to M subcarriers may specifically be: mapping the M rows of elements in the matrix s [k][l] to the M subcarriers, for example, the subcarrier index (or number) is 0 to M-1, and the above mapping may specifically be mapping the 0th row elements to the 0th subcarrier, mapping the 1st row elements to the 1st subcarrier, and so on, mapping the M-1th row elements to the M-1th subcarrier.
  • the above mapping of the target permutation complementary sequence set to N member symbols may specifically be: mapping the N columns of elements in the matrix s [k][l] to N member symbols, for example, the member symbol index (or number) is 0 to N-1, and the above mapping may specifically be mapping the 0th column elements to the 0th member symbol, mapping the 1st column elements to the 1st member symbol, and so on, mapping the N-1th column elements to the N-1th member symbol.
  • nth member symbol of the mth member sequence in the above permuted complementary sequence set s [k][l] is It can be in a finite field Middle parameters In finite fields Middle parameters And in finite fields The parameters n mod Z are permuted in the above equation, which can be expressed by the following formula:
  • m p ⁇ Z + q, q ⁇ 0,1,...,Z-1 ⁇ ,n ⁇ 0,1,...,N-1 ⁇
  • the permutation operation in Representing a finite field The permutation operation in . represents a finite field of order N ⁇ 0,1,2,...,N-1 ⁇
  • express Finite field of order represents the Z-order finite field ⁇ 0,1,2,...,Z-1 ⁇ .
  • the permutation operation is a mapping operation within a finite field, and the mapping operation can be implemented by a function.
  • gcd represents the greatest common divisor of two numbers
  • mod represents the modulus operation.
  • Permutation function Representation: The finite field middle Permutation to a finite field middle Permutation function Representation: The finite field middle Permutation to a finite field middle ⁇ (n mod Z) a ⁇ (n mod Z)+b means: The n mod Z permutation in the finite field a ⁇ (n mod Z)+b in .
  • the length N of the member sequence, the number M of the member sequences, and the length Z of the zero correlation zone can have different configurations.
  • the transmitter can generate different permutation complementary sequence sets, and apply the permutation complementary sequence sets to different scenarios. This can reduce overhead, improve spectrum efficiency, and meet the system performance requirements in the current scenario.
  • the number of permutation complementary sequence sets is N ⁇ (N-1), where the lth permutation complementary sequence set s [k][l] in the kth permutation complementary sequence set is expressed as:
  • N is the length of the member sequence
  • M is the number of member sequences
  • Z is the length of the zero correlation zone, k ⁇ 1,2,...,N-1 ⁇ , l ⁇ 0,1,...,N-1 ⁇ .
  • the l permutation in is a finite field
  • the physical meaning of the second summation term is: the sum of N points sampled at equal intervals on the unit circle of the complex plane, so the second summation term is equal to 0.
  • any permuted complementary sequence set s [k][l] has an ideal non-periodic autocorrelation property.
  • the permuted complementary sequence set s [k][l] has an ideal intra-group aperiodic mutual correlation characteristic, and there are N zero correlation sequence sets in the group.
  • the second summation term is equal to N.
  • the first summation term is equal to 0; when When , the first summation term is equal to 1. That is, among the N-1 values of k ⁇ 1,2,...,N-1 ⁇ , the maximum value of the non-periodic cross-correlation of the inter-group sequence set is N, the peak value of the non-periodic autocorrelation is N 2 , and the maximum value of the cross-correlation is only the peak value.
  • the non-periodic related side lobes can be effectively suppressed.
  • the permutation complementary sequence set s [k][l] has an ideal non-periodic autocorrelation characteristic, an ideal intra-group non-periodic mutual correlation characteristic, and a low inter-group non-periodic mutual correlation characteristic; there are N zero correlation sequence sets within the group, there are N-1 low correlation groups in total, and the maximum value of the non-periodic mutual correlation of sequence sets between groups is N.
  • the member sequence length N, the number of member sequences M, and the zero correlation zone Z of the permutation complementary sequence set constitute a triplet (N,N,N).
  • the member sequence length of the ZC sequence is N ⁇ M
  • the zero correlation zone is M ⁇ Z, constituting a binary (N 2 ,N 2 ).
  • the permutation complementary sequence set (N,N,N) is obtained by the non-periodic correlation analysis of the permutation complementary sequence set mentioned above, and the evaluation indicator analysis of the ZC sequence (N 2 ,N 2 ) is the same as that of the prior art, which will not be repeated here.
  • the sequence capacity N of the permutation complementary sequence set (N,N,N) in the zero correlation zone is greater than the sequence capacity 0 of the ZC sequence (N 2 ,N 2 ) in the zero correlation zone, and the sequence capacity N ⁇ (N-1) of the permutation complementary sequence set (N,N,N) in the low correlation zone is less than the sequence capacity N 2 -1 of the ZC sequence (N 2 ,N 2 ) in the low correlation zone.
  • N is the length of the member sequence
  • M is the number of member sequences
  • Z is the length of the zero correlation zone, k ⁇ 1,2,...,M-1 ⁇ , l ⁇ 0,1,...,N-1 ⁇ ;
  • gcd represents the greatest common divisor of two numbers
  • mod represents the modulus operation
  • the l permutation in is a finite field
  • any permuted complementary sequence set s [k][l] has an ideal non-periodic autocorrelation property.
  • the permuted complementary sequence set s [k][l] has an ideal intra-group aperiodic mutual correlation characteristic, and there are N zero correlation sequence sets in the group.
  • the second summation term is equal to M.
  • Make The first summation term does not exceed That is, among the M-1 values of k ⁇ 1,2,...,M-1 ⁇ , the maximum value of the non-periodic cross-correlation of the inter-group sequence set is The non-periodic related side lobes can be effectively suppressed.
  • the permuted complementary sequence set s [k][l] has an ideal aperiodic autocorrelation characteristic, an ideal intra-group aperiodic cross-correlation characteristic, and a low inter-group aperiodic cross-correlation characteristic.
  • N zero-correlation sequence sets within the group, and there are M-1 low-correlation groups in total.
  • the maximum aperiodic cross-correlation value of the sequence sets between groups is
  • the member sequence length N, the number of member sequences M, and the zero correlation zone Z of the permutation complementary sequence set constitute a triplet (N,M,M).
  • the member sequence length of the ZC sequence is N ⁇ M
  • the zero correlation zone is M ⁇ Z, constituting a binary (N ⁇ M,M 2 ).
  • the permutation complementary sequence set (N,M,M) is obtained by the non-periodic correlation analysis of the permutation complementary sequence set mentioned above, and the evaluation indicator analysis of the ZC sequence (N ⁇ M,M 2 ) is the same as that of the prior art, which will not be repeated here.
  • N is the length of the member sequence
  • M is the number of member sequences
  • Z is the length of the zero correlation zone, k ⁇ 1,2,...,Z-1 ⁇ ,
  • gcd represents the greatest common divisor of two numbers
  • mod represents the modulus operation.
  • any permuted complementary sequence set s [k][l] has an ideal non-periodic autocorrelation property.
  • the permuted complementary sequence set s [k][l] has an ideal intra-group aperiodic cross-correlation property and coexists within the group. A set of zero correlation sequences.
  • the third summation term is equal to Z.
  • the second summation is equal to on the basis of, Make The first summation term does not exceed That is, among the Z-1 values of k ⁇ 1,2,...,Z-1 ⁇ , the maximum value of the non-periodic cross-correlation of the inter-group sequence set is The non-periodic related side lobes can be effectively suppressed.
  • the permutation complementary sequence set s [k][l] has an ideal non-periodic autocorrelation characteristic, an ideal intra-group non-periodic cross-correlation characteristic, and a low inter-group non-periodic cross-correlation characteristic.
  • Z-1 low correlation groups There are Z-1 low correlation groups, and the maximum value of the cross-correlation is
  • the member sequence length N, the number of member sequences M, and the zero correlation zone Z of the permutation complementary sequence set constitute a triplet (N,M,Z).
  • the member sequence length of the ZC sequence is N ⁇ M
  • the zero correlation zone is M ⁇ Z, constituting a binary (N ⁇ M,M ⁇ Z).
  • the permutation complementary sequence set (N,M,Z) is obtained by the non-periodic correlation analysis of the permutation complementary sequence set mentioned above, and the evaluation indicator analysis of the ZC sequence (N ⁇ M,M ⁇ Z) is the same as the prior art, which will not be repeated here.
  • the sequence capacity of the permuted complementary sequence set (N, M, Z) in the zero correlation zone is Greater than the sequence capacity of the ZC sequence (N ⁇ M, M ⁇ Z) in the zero correlation region Therefore, when N>M>Z is configured, the permuted complementary sequence set does not need to add a cyclic prefix compared to the ZC sequence. It is suitable for multi-user access scenarios while reducing overhead and improving spectrum efficiency.
  • the permutation complementary sequence set is a partial sequence set in the candidate permutation complementary sequence set
  • the number of candidate permutation complementary sequence sets is Among them, the lth replacement complementary sequence set s [k][l] in the kth replacement complementary sequence set is expressed as:
  • N is the length of the member sequence
  • M is the number of member sequences
  • Z is the length of the zero correlation zone
  • M is divisible by Z, k ⁇ 1,2,...,Z-1 ⁇
  • the permutation complementary sequence set is a partial sequence set in the candidate permutation complementary sequence set, and may also be referred to as a restricted set obtained by restricting the candidate permutation complementary sequence set.
  • gcd represents the greatest common divisor of two numbers
  • mod represents the modulus operation.
  • the permutation complementary sequence set is obtained by limiting the index number l in the candidate permutation complementary sequence set according to the number of subcarrier spacings to combat Doppler frequency shift.
  • l may belong to the following set:
  • f is the number of subcarrier spacings to combat Doppler frequency shift, which is a positive integer.
  • j The number of elements in the above set l is indivual.
  • permutation complementary sequence set may also be referred to as a restricted permutation complementary sequence set or a restricted set of permutation complementary sequence sets, which is not limited in the present application.
  • the permutation complementary sequence set satisfies the ideal intra-group aperiodic cross-correlation property and coexists within the group. If the set of sequence set index numbers within the group is not restricted, that is, At this time, the frequency offset may cause the intra-group non-periodic cross-correlation value of the candidate permuted complementary sequence set to be non-zero.
  • the frequency deviation does not exceed the interval of one subcarrier.
  • the permutation complementary sequence set is obtained by limiting the sequence set index number within the group of the candidate permutation complementary sequence set, that is, the permutation complementary sequence set is a sequence set in which l in the candidate permutation complementary sequence set belongs to the following set:
  • Figure 10 shows a schematic diagram of the comparison of ZC sequence and candidate permutation complementary sequence set using restricted set to resist frequency deviation.
  • 0 represents a valid sequence/permutation complementary sequence set
  • +1 represents that the sequence is positively offset by one subcarrier
  • -1 represents that the sequence is negatively offset by one subcarrier. It can be seen that when the ZC sequence uses a restricted set to combat a frequency deviation not exceeding one subcarrier interval, the number of available cyclic shifts in the restricted set is a part of the number of sequences in the unrestricted set.
  • the number of available cyclic shifts in the restricted set is 1/6 to 1/3 of the number of sequences in the unrestricted set.
  • the permutation complementary sequence set satisfies the ideal intra-group non-periodic cross-correlation characteristics, and the coexistence within the group
  • the zero-correlation sequence set replaces the complementary sequence set, and the number of sequence set index numbers in the group is close to 1/3 of the number of index numbers in the candidate replacement complementary sequence set, that is, taking the group as a unit, the number of replacement complementary sequence sets in the group is close to 1/3 of the number of candidate replacement complementary sequence sets.
  • the transmitter can obtain the permutation complementary sequence set by limiting the sequence set index number within the group of the candidate permutation complementary sequence set without adding a cyclic prefix. While reducing overhead and improving spectrum efficiency, it also improves sequence capacity and is suitable for high-speed mobile communication scenarios.
  • the above-mentioned sending end is a terminal device
  • the above-mentioned receiving end is a network device
  • the above-mentioned sending of signals based on a permutation complementary sequence set includes: the terminal device sends a random access signal to the network device based on the permutation complementary sequence set.
  • the member sequence length N and the member sequence number M are sent by the network device to the terminal device, or are agreed upon by a protocol.
  • the length Z of the zero correlation zone, the starting value k of the permuted complementary sequence set group index number, and the starting value l of the permuted complementary sequence set intra-group sequence set index number are sent by the network device to the terminal device, or are agreed upon by the protocol.
  • the network device and the terminal device determine a permutation complementary sequence set according to the starting value k of the group index number, and the terminal device randomly selects a permutation complementary sequence set from the permutation complementary sequence set to send a signal.
  • the network device and the terminal device may calculate the number of sequence sets in the group according to the length N of the member sequence, the number M of the member sequence, and the length Z of the zero correlation zone. Then, the network device and the terminal device can round up the quotient of the number of permuted complementary sequence sets required by the cell and the number of sequence sets in the group to obtain the number of permuted complementary sequence sets C.
  • the network device and the terminal device can determine the group number corresponding to the group index number according to the starting value k of the group index number, and determine C groups of permuted complementary sequence sets in sequence according to the order of the group numbers, wherein the number of each permuted complementary sequence set in the first C-1 groups of permuted complementary sequence sets is The number of permuted complementary sequence sets in group C is the number of permuted complementary sequence sets required by the cell divided by the number of sequence sets in the group The remainder obtained.
  • the number of permuted complementary sequence sets required by the above-mentioned cell is a positive integer, which may be agreed upon by a protocol or indicated by a network device to a terminal device through signaling.
  • the number of permutation complementary sequence sets required by the above cell is 64.
  • the corresponding relationship between the group index number and the group sequence number can be shown in Table 4.
  • the transmitting end can randomly select a permutation complementary sequence set from the permutation complementary sequence set with group index 1 to send a signal.
  • the transmitter can randomly select a permutation complementary sequence set from the 64 permutation complementary sequence sets to send a signal.
  • FIG11 shows a device 1100 provided in an embodiment of the present application.
  • the device 1100 may be a transmitter, or a device capable of supporting the transmitter to implement its functions, such as a chip or chip system that can be used in the transmitter.
  • the device 1100 includes: a processing unit 1110 and a transceiver unit 1120.
  • the processing unit 1110 is used to: determine a permutation complementary sequence set, where the permutation complementary sequence set includes M member sequences, where the member sequences include N member symbols, where M and N are both integers greater than 1, where the member symbols are obtained by performing a permutation operation on a parameter of the permutation complementary sequence set, where the permutation operation is a single mapping operation within a finite field, and where the permutation complementary sequence set satisfies aperiodic correlation;
  • the transceiver unit 1120 is configured to send a signal based on the permuted complementary sequence set.
  • the parameters of the permutation complementary sequence set include at least one of the following: the length N of the member sequence in the permutation complementary sequence set, the number M of the member sequences, and the length Z of the zero correlation zone in the permutation complementary sequence set, where Z is an integer greater than or equal to 1.
  • the number of permutation complementary sequence sets is Among them, the lth replacement complementary sequence set s [k][l] in the kth replacement complementary sequence set is expressed as:
  • N is greater than or equal to M
  • M is greater than or equal to Z
  • M is divisible by Z, k ⁇ 1,2,...,Z-1 ⁇ ,
  • the permutation complementary sequence set is a partial sequence set in the candidate permutation complementary sequence set, and the number of the candidate permutation complementary sequence sets is Among them, the lth replacement complementary sequence set s [k][l] in the kth replacement complementary sequence set is expressed as:
  • M is divisible by Z, k ⁇ 1,2,...,Z-1 ⁇ ,
  • the permutation complementary sequence set is a sequence set in which l of the candidate permutation complementary sequence sets belongs to the following set:
  • f is a positive integer.
  • the processing unit 1110 is further used to: determine a target permutation complementary sequence set from the permutation complementary sequence set; map the target permutation complementary sequence set to N member symbols and M subcarriers to generate a signal; and the transceiver unit 1120 is further used to: send a signal.
  • the transceiver unit 1120 is further configured to: send a random access signal to the network device based on the permuted complementary sequence set.
  • the member sequence length N and the member sequence number M are sent by the network device to the apparatus, or are agreed upon by a protocol.
  • the device 1100 here is embodied in the form of a functional unit.
  • the term "unit” here may refer to an application specific integrated circuit (ASIC), an electronic circuit, a processor (such as a shared processor, a dedicated processor or a group processor, etc.) and a memory for executing one or more software or firmware programs, a combined logic circuit and/or other suitable components that support the described functions.
  • ASIC application specific integrated circuit
  • the device 1100 can be specifically the sending end in the above-mentioned embodiment, and can be used to execute the various processes and/or steps corresponding to the sending end in the above-mentioned method embodiment. To avoid repetition, it will not be repeated here.
  • the device 1100 of each of the above schemes has the function of implementing the corresponding steps performed by the sending end in the above method.
  • the function can be implemented by hardware, or by hardware executing the corresponding software implementation.
  • the hardware or software includes one or more modules corresponding to the above functions; for example, the transceiver unit can specifically include a receiving unit and a sending unit, and the receiving unit and/or the sending unit can be replaced by a transceiver (for example, the sending unit can be replaced by a transmitter, and the receiving unit can be replaced by a receiver), and other units, such as a processing unit, can be replaced by a processor to respectively perform the transceiver operations and related processing operations in each method embodiment.
  • the above-mentioned transceiver unit can also be a transceiver circuit (for example, it can include a receiving circuit and a transmitting circuit), and the processing unit can be a processing circuit.
  • the device in Figure 11 can be the transmitting end in the aforementioned embodiment, or it can be a chip or a chip system, for example: a system on chip (system on chip, SoC).
  • the transceiver unit can be an input and output circuit, a communication interface; the processing unit is a processor or a microprocessor or an integrated circuit integrated on the chip. This is not limited here.
  • FIG12 shows another signal transmission device 1200 provided in an embodiment of the present application.
  • the device 1200 includes a processor 1210, a transceiver 1220, and a memory 1230.
  • the processor 1210, the transceiver 1220, and the memory 1230 communicate with each other through an internal connection path, the memory 1230 is used to store instructions, and the processor 1210 is used to execute the instructions stored in the memory 1230 to control the transceiver 1220 to send signals and/or receive signals.
  • the device 1200 can be specifically the transmitting end in the above embodiment, and can be used to execute the various steps and/or processes with the transmitting end in the above method embodiment.
  • the memory 1230 may include a read-only memory and a random access memory, and provide instructions and data to the processor. A part of the memory may also include a non-volatile random access memory.
  • the memory may also store information about the device type.
  • the processor 1210 may be used to execute instructions stored in the memory, and when the processor 1210 executes the instructions stored in the memory, the processor 1210 is used to execute the various steps and/or processes of the above method embodiment corresponding to the first terminal device or network device.
  • the transceiver 1220 may include a transmitter and a receiver, the transmitter may be used to implement the various steps and/or processes corresponding to the above transceiver for performing the sending action, and the receiver may be used to implement the various steps and/or processes corresponding to the above transceiver for performing the receiving action.
  • the processor of the above-mentioned device may be a central processing unit (CPU), and the processor may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • the general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.
  • each step of the above method can be completed by an integrated logic circuit of hardware in a processor or an instruction in the form of software.
  • the steps of the method disclosed in conjunction with the embodiment of the present application can be directly embodied as a hardware processor for execution, or a combination of hardware and software units in a processor for execution.
  • the software unit can be located in a mature storage medium in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory or an electrically erasable programmable memory, a register, etc.
  • the storage medium is located in a memory, and the processor executes the instructions in the memory, and completes the steps of the above method in conjunction with its hardware. To avoid repetition, it is not described in detail here.
  • the present application also provides a communication system, which may include the above-mentioned transmitting end and receiving end.
  • the present application also provides a computer-readable storage medium, which is used to store a computer program, and the computer program is used to implement the various steps or processes performed by the sending end in the above embodiments.
  • the present application also provides a computer program product, which includes a computer program (also referred to as code, or instructions).
  • a computer program also referred to as code, or instructions.
  • the computer program runs on a computer, the computer can execute the various steps or processes performed by the sending end in the above embodiments.
  • the disclosed systems, devices and methods can be implemented in other ways.
  • the device embodiments described above are only schematic.
  • the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, or it can be an electrical, mechanical or other form of connection.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiments of the present application.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
  • the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium.
  • the technical solution of the present application is essentially or partly contributed to the prior art, or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application.
  • the aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, and other media that can store program codes.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Quality & Reliability (AREA)

Abstract

本申请提供了一种信号传输方法和装置，能够降低信号传输的时频资源开销，提高频谱效率，从而提高系统性能。该包括：确定置换互补序列集，该置换互补序列集包括M个成员序列，成员序列包括N个成员符号，M和N均是大于1的整数，成员符号是对置换互补序列集的参数进行置换操作得到的，置换操作为有限域内的单一映射操作，置换互补序列集满足非周期相关性；基于该置换互补序列集发送信号。

Description

信号传输方法和装置 技术领域
本申请涉及通信技术领域，尤其涉及一种信号传输方法和装置。
背景技术
随着无线通信的迅速发展，无线通信过程中面临着海量用户接入干扰问题，无线通信系统要有更高的频谱效率来支持海量用户接入。序列设计在无线通信系统中是一项关键的技术，序列的理想自相关和理想互相关特性在无线通信中有非常重要的应用。理想自相关特性是指序列与其任意非零移位的相关值均为零，理想互相关特性是指两个序列任意移位的相关值均为零。
序列的相关性包括两种形式：周期相关和非周期相关。周期相关是指序列的循环移位相关，序列的交叠部分始终等于序列长度。非周期相关是指序列的补零移位相关，序列的交叠部分通常小于序列长度。对于周期相关序列，存在具有理想自相关特性的序列，存在具有理想互相关特性的序列，但不存在同时具有理想自相关和理想互相关特性的序列。目前的非周期相关序列，不存在具有理想自相关特性的序列，也不存在具有理想互相关特性的序列。
在现有的标准协议中，上行随机接入利用Zadoff-Chu序列(也可以称为ZC序列)的周期相关特性，采用ZC序列添加循环前缀实现理想自相关。但是，这样会带来较大的时频资源开销，导致频谱效率低。
发明内容
本申请实施例提供一种信号传输方法和装置，能够降低信号传输的时频资源开销，提高频谱效率，从而提高系统性能。
第一方面，提供了一种信号传输方法，包括：确定置换互补序列集，该置换互补序列集包括M个成员序列，该成员序列包括N个成员符号，M和N均是大于1的整数，成员符号是对置换互补序列集的参数进行置换操作得到的，该置换操作为有限域内的单一映射操作，置换互补序列集满足非周期相关性；基于置换互补序列集发送信号。
本申请提供的信号传输方法，通过对置换互补序列集中的参数进行有限域内的单一映射操作，得到置换互补序列集的成员符号，根据成员符号得到置换互补序列集的成员序列，再根据成员序列确定置换互补序列集，该置换互补序列集满足非周期相关性。由于该置换互补序列集满足非周期相关性，通过该置换互补序列集发送信号，发送端在确定待发送信号时无需添加循环前缀，能够降低信号传输的时频资源开销，提高频谱效率，从而提高系统性能。
结合第一方面，在第一方面的某些实现方式中，置换互补序列集的参数包括下列至少一个：置换互补序列集中成员序列的长度N、成员序列的个数M、以及置换互补 序列集中零相关区的长度Z，Z是大于或等于1的整数。
结合第一方面，在第一方面的某些实现方式中，置换互补序列集的个数为
Figure PCTCN2022130960-appb-000001
其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
Figure PCTCN2022130960-appb-000002
其中，N大于或等于M，M大于或等于Z，M能被Z整除，k∈{1,2,...,Z-1}，
Figure PCTCN2022130960-appb-000003
置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
Figure PCTCN2022130960-appb-000004
表示为：
Figure PCTCN2022130960-appb-000005
其中，m＝p×Z+q，
Figure PCTCN2022130960-appb-000006
q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
Figure PCTCN2022130960-appb-000007
表示有限域
Figure PCTCN2022130960-appb-000008
中的置换操作，
Figure PCTCN2022130960-appb-000009
表示有限域
Figure PCTCN2022130960-appb-000010
中的置换操作，
Figure PCTCN2022130960-appb-000011
表示有限域
Figure PCTCN2022130960-appb-000012
中的置换操作。
本申请实施例得到的置换互补序列集满足非周期相关性，通过该置换互补序列集发送信号，发送端在确定待发送信号时无需添加循环前缀，能够降低信号传输的时频资源开销，提高频谱效率，从而提高系统性能。
结合第一方面，在第一方面的某些实现方式中，N＝M＝Z。
本申请实施例得到的置换互补序列集相较于ZC序列，无需添加循环前缀，在降低开销、提升频谱效率的同时，还提高了序列容量。
结合第一方面，在第一方面的某些实现方式中，N>M＝Z。
该实现方式得到的序列，在降低开销、提升频谱效率的同时，还提高了序列容量，可以在噪声较大的场景或者接收端对信号检测性能要求高的场景下，提高接收端的信号检测能力。
结合第一方面，在第一方面的某些实现方式中，N>M>Z。
该实现方式得到的序列，在降低开销、提升频谱效率的同时，适用于多用户接入的场景。
结合第一方面，在第一方面的某些实现方式中，置换互补序列集是候选置换互补序列集中的部分序列集，该候选置换互补序列集的个数为
Figure PCTCN2022130960-appb-000013
其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
Figure PCTCN2022130960-appb-000014
其中，N>M>Z，M能被Z整除，k∈{1,2,...,Z-1}，
Figure PCTCN2022130960-appb-000015
置换 互补序列集s [k][l]中第m个成员序列的第n个成员符号
Figure PCTCN2022130960-appb-000016
表示为：
Figure PCTCN2022130960-appb-000017
其中，m＝p×Z+q，
Figure PCTCN2022130960-appb-000018
q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
Figure PCTCN2022130960-appb-000019
表示有限域
Figure PCTCN2022130960-appb-000020
中的置换操作，
Figure PCTCN2022130960-appb-000021
表示有限域
Figure PCTCN2022130960-appb-000022
中的置换操作，
Figure PCTCN2022130960-appb-000023
表示有限域
Figure PCTCN2022130960-appb-000024
中的置换操作。
本申请实施例通过限制候选置换互补序列集的组内序列集索引号得到的置换互补序列集，发送端可以无需添加循环前缀，在降低开销、提升频谱效率的同时，还提高了序列容量，适用于高速移动的通信场景中。
结合第一方面，在第一方面的某些实现方式中，置换互补序列集为候选置换互补序列集中l属于下列集合的序列集：
Figure PCTCN2022130960-appb-000025
其中，f是正整数。
本申请实施例得到的置换互补序列集，组内的置换互补序列集的个数接近候选置换互补序列集的个数的1/3，相较于ZC序列的限制集，有利于提升有效序列集的个数，提高了序列容量，且适用于高速移动的通信场景中。
结合第一方面，在第一方面的某些实现方式中，基于置换互补序列集发送信号，包括：从置换互补序列集中确定目标置换互补序列集；将该目标置换互补序列集映射到N个成员符号和M个子载波上，生成上述信号，并发送该信号。
结合第一方面，在第一方面的某些实现方式中，基于置换互补序列集发送信号，包括：终端设备基于置换互补序列集向网络设备发送随机接入信号。
结合第一方面，在第一方面的某些实现方式中，成员序列长度N和成员序列个数M是网络设备向终端设备发送的，或者，是协议约定的。
第二方面，提供了一种信号传输装置，该装置可以是终端设备或网络设备，也可以是终端设备或网络设备中的装置(例如，芯片，或者芯片系统，或者电路)，或者是能够和终端设备或网络设备匹配使用的装置。
一种可能的实现中，该装置可以包括执行第一方面中所描述的方法/操作/步骤/动作所一一对应的模块或单元，该模块或单元可以是硬件电路，也可是软件，也可以是硬件电路结合软件实现。
一种可能的实现中，该装置包括：处理单元，用于确定置换互补序列集，该置换互补序列集包括M个成员序列，该成员序列包括N个成员符号，M和N均是大于1的整数，上述成员符号是对置换互补序列集的参数进行置换操作得到的，置换操作为有限域内的单一映射操作，置换互补序列集满足非周期相关性；收发单元，用于基于置换互补序列集发送信号。
结合第二方面，在第二方面的某些实现方式中，置换互补序列集的参数包括下列至少一个：置换互补序列集中成员序列的长度N、成员序列的个数M、以及置换互补序列集中零相关区的长度Z，Z是大于或等于1的整数。
结合第二方面，在第二方面的某些实现方式中，置换互补序列集的个数为
Figure PCTCN2022130960-appb-000026
其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
Figure PCTCN2022130960-appb-000027
其中，N大于或等于M，M大于或等于Z，M能被Z整除，k∈{1,2,...,Z-1}，
Figure PCTCN2022130960-appb-000028
置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
Figure PCTCN2022130960-appb-000029
表示为：
Figure PCTCN2022130960-appb-000030
其中，m＝p×Z+q，
Figure PCTCN2022130960-appb-000031
q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
Figure PCTCN2022130960-appb-000032
表示有限域
Figure PCTCN2022130960-appb-000033
中的置换操作，
Figure PCTCN2022130960-appb-000034
表示有限域
Figure PCTCN2022130960-appb-000035
中的置换操作，
Figure PCTCN2022130960-appb-000036
表示有限域
Figure PCTCN2022130960-appb-000037
中的置换操作。
结合第二方面，在第二方面的某些实现方式中，N＝M＝Z。
结合第二方面，在第二方面的某些实现方式中，N>M＝Z。
结合第二方面，在第二方面的某些实现方式中，N>M>Z。
结合第二方面，在第二方面的某些实现方式中，置换互补序列集是候选置换互补序列集中的部分序列集，该候选置换互补序列集的个数为
Figure PCTCN2022130960-appb-000038
其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
Figure PCTCN2022130960-appb-000039
其中，N>M>Z，M能被Z整除，k∈{1,2,...,Z-1}，
Figure PCTCN2022130960-appb-000040
置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
Figure PCTCN2022130960-appb-000041
表示为：
Figure PCTCN2022130960-appb-000042
其中，m＝p×Z+q，
Figure PCTCN2022130960-appb-000043
q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
Figure PCTCN2022130960-appb-000044
表示有限域
Figure PCTCN2022130960-appb-000045
中的置换操作，
Figure PCTCN2022130960-appb-000046
表示有限域
Figure PCTCN2022130960-appb-000047
中的置换操作，
Figure PCTCN2022130960-appb-000048
表示有限域
Figure PCTCN2022130960-appb-000049
中的置换操作。
结合第二方面，在第二方面的某些实现方式中，置换互补序列集为候选置换互补序列集中l属于下列集合的序列集：
Figure PCTCN2022130960-appb-000050
其中，f是正整数。
结合第二方面，在第二方面的某些实现方式中，处理单元还用于：从置换互补序列集中确定目标置换互补序列集；将目标置换互补序列集映射到N个成员符号和M个子载波上，生成信号；收发单元还用于：发送信号。
结合第二方面，在第二方面的某些实现方式中，收发单元还用于：基于置换互补序列集向网络设备发送随机接入信号。
结合第二方面，在第二方面的某些实现方式中，成员序列长度N和成员序列个数M是网络设备向装置发送的，或者，是协议约定的。
第三方面，提供了一种信号传输装置，该装置包括：处理器，处理器与存储器耦合，存储器用于存储计算机程序，当处理器调用计算机程序时，使得装置执行上述第一方面的任一种可能实现方式中的方法。
可选地，处理器为一个或多个，存储器为一个或多个。
可选地，存储器可以与处理器集成在一起，或者存储器与处理器分离设置。
在具体实现过程中，存储器可以为非瞬时性(non-transitory)存储器，例如只读存储器(read only memory，ROM)，其可以与处理器集成在同一块芯片上，也可以分别设置在不同的芯片上，本申请实施例对存储器的类型以及存储器与处理器的设置方式不做限定。
应理解，相关的数据交互过程例如发送接续数据请求信息可以为从处理器输出指示信息的过程，接收能力信息可以为处理器接收输入能力信息的过程。具体地，处理输出的数据可以输出给发射器，处理器接收的输入数据可以来自接收器。其中，发射器和接收器可以统称为收发器。
上述第三方面中的装置可以是一个芯片，该处理器可以通过硬件来实现也可以通过软件来实现，当通过硬件实现时，该处理器可以是逻辑电路、集成电路等；当通过软件来实现时，该处理器可以是一个通用处理器，通过读取存储器中存储的软件代码来实现，该存储器可以集成在处理器中，可以位于该处理器之外，独立存在。
第四方面，提供了一种计算机可读存储介质，该计算机可读存储介质存储有计算机程序(也可以称为代码，或指令)，当其在计算机上运行时，使得计算机执行上述第一方面中的任一种可能实现方式中的方法。
第五方面，提供了一种计算机程序产品，计算机程序产品包括：计算机程序(也可以称为代码，或指令)，当计算机程序被运行时，使得计算机执行上述第一方面中的任一种可能实现方式中的方法。
第六方面，提供了一种通信系统，包括终端设备和网络设备，该终端设备或网络设备用于实现上述第一方面或第一方面的任一种可能实现的方法。
附图说明
图1是本申请实施例所应用的通信系统的示意图；
图2是本申请实施例提供的周期相关的序列的示意图；
图3是本申请实施例提供的非周期相关的序列的示意图；
图4是本申请实施例提供的一种物理随机接入信道时频资源配置格式的示意图；
图5是本申请实施例提供的另一物理随机接入信道时频资源配置格式的示意图；
图6是本申请实施例提供的信号传输方法的示意性流程图；
图7是本申请实施例提供的一种置换互补序列集的互相关特性的示意图；
图8是本申请实施例提供的另一置换互补序列集的互相关特性的示意图；
图9是本申请实施例提供的再一置换互补序列集的互相关特性的示意图；
图10是本申请实施例提供的ZC序列和候选置换互补序列集采用限制集抗频偏比较的示意图；
图11是本申请实施例提供的一种信号传输装置的示意性框图；
图12是本申请实施例提供的另一种信号传输装置的示意性框图。
具体实施方式
下面将结合附图，对本申请中的技术方案进行描述。
在本申请的实施例中，采用了“第一”、“第二”等字样对功能和作用基本相同的相同项或相似项进行区分。本领域技术人员可以理解“第一”、“第二”等字样并不对数量和执行次序进行限定，并且“第一”、“第二”等字样也并不限定一定不同。
需要说明的是，本申请实施例中，“示例性的”或者“例如”等词用于表示作例子、例证或说明。本申请中被描述为“示例性的”或者“例如”的任何实施例或设计方案不应被解释为比其他实施例或设计方案更优选或更具优势。确切而言，使用“示例性的”或者“例如”等词旨在以具体方式呈现相关概念。
本申请实施例中，“至少一个”是指一个或者多个，“多个”是指两个或两个以上。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B的情况，其中A，B可以是单数或者复数。字符“/”一般表示前后关联对象是一种“或”的关系。“以下至少一项(个)”或其类似表达，是指的这些项中的任意组合，包括单项(个)或复数项(个)的任意组合。例如，a，b，或c中的至少一项(个)，可以表示：a，b，c，a-b，a--c，b-c，或a-b-c，其中a，b，c可以是单个，也可以是多个。
本申请提供的技术方案可以应用于各种通信系统，例如：长期演进(long term evolution，LTE)系统、LTE频分双工(frequency division duplex，FDD)系统、LTE时分双工(time division duplex，TDD)系统、第五代(5th generation，5G)移动通信系统、新无线(new radio，NR)系统或者其他演进的通信系统，以及5G通信系统的下一代移动通信系统等。
本申请实施例中的终端设备也可以称为：用户设备(user equipment，UE)、移动台(mobile station，MS)、移动终端(mobile terminal，MT)、接入终端、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置等。
终端设备可以是一种向用户提供语音/数据连通性的设备，例如，具有无线连接功能的手持式设备、车载设备等。目前，一些终端设备的举例包括：手机(mobile phone)、平板电脑、笔记本电脑、掌上电脑、移动互联网设备(mobile internet device，MID)、可穿戴设备、无人机、机器人、智能销售点(point of sale，POS)机、客户终端设备 (customer-premises equipment，CPE)、虚拟现实(virtual reality，VR)设备、增强现实(augmented reality，AR)设备、工业控制(industrial control)中的无线终端、无人驾驶(self driving)中的无线终端、远程手术(remote medical surgery)中的无线终端、智能电网(smart grid)中的无线终端、运输安全(transportation safety)中的无线终端、智慧城市(smart city)中的无线终端、智慧家庭(smart home)中的无线终端、蜂窝电话、无绳电话、会话启动协议(session initiation protocol，SIP)电话、无线本地环路(wireless local loop，WLL)站、个人数字助理(personal digital assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备，5G网络中的终端设备或者未来演进的公用陆地移动通信网络(public land mobile network，PLMN)中的终端设备等，本申请对此并不限定。
作为示例而非限定，在本申请中，终端设备可以是物联网(internet of things，IoT)系统中的终端设备。物联网是未来信息技术发展的重要组成部分，其主要技术特点是将物品通过通信技术与网络连接，从而实现人机互连，物物互连的智能化网络。示例性地，本申请实施例中的终端设备可以是可穿戴设备。可穿戴设备也可以称为穿戴式智能设备，是应用穿戴式技术对日常穿戴进行智能化设计、开发出可以穿戴的设备的总称，如眼镜、手套、手表、服饰及鞋等。可穿戴设备是可以直接穿在身上，或是整合到用户的衣服或配件的一种便携式设备。可穿戴设备不仅仅是一种硬件设备，更可以通过软件支持以及数据交互、云端交互来实现强大的功能。广义穿戴式智能设备包括功能全、尺寸大、可不依赖智能手机实现完整或者部分的功能，例如：智能手表或智能眼镜等，以及只专注于某一类应用功能，需要和其它设备如智能手机配合使用，如各类进行体征监测的智能手环、智能首饰等。
作为示例而非限定，在本申请实施例中，终端设备还可以是机器类型通信(machine type communication，MTC)中的终端设备。此外，终端设备还可以是作为一个或多个部件或者单元而内置于车辆的车载模块、车载模组、车载部件、车载芯片或者车载单元等，车辆通过内置的所述车载模块、车载模组、车载部件、车载芯片或者车载单元等可以实施本申请提供的方法。因此，本申请实施例也可以应用于车联网，例如车辆外联(vehicle to everything，V2X)、车间通信长期演进技术(long term evolution-vehicle，LTE-V)、车到车(vehicle-to-vehicle，V2V)技术等。
本申请涉及的网络设备可以是与终端设备通信的设备，该网络设备也可以称为接入网设备或无线接入网设备，它可以是传输接收点(transmission reception point，TRP)，还可以是LTE系统中的演进型基站(evolved NodeB，eNB或eNodeB)，还可以是家庭基站(例如，home evolved NodeB，或home Node B，HNB)、基带单元(base band unit，BBU)，还可以是云无线接入网络(cloud radio access network，CRAN)场景下的无线控制器，或者该网络设备可以为中继站、接入点、车载设备、可穿戴设备以及5G网络中的网络设备或者未来演进的PLMN网络中的网络设备等，还可以是WLAN中的接入点(access point，AP)，还可以是NR系统中的gNB，上述网络设备还可以是城市基站、微基站、微微基站、毫微微基站等等，本申请对此不做限定。
在一种网络结构中，网络设备可以包括集中单元(centralized unit，CU)节点、或分布单元(distributed unit，DU)节点、或是包括CU节点和DU节点的无线接入网络 (radio access network，RAN)设备、或者是包括控制面CU节点(CU-CP节点)和用户面CU节点(CU-UP节点)以及DU节点的RAN设备。
网络设备为小区提供服务，终端设备通过网络设备分配的传输资源(例如，频域资源，或者说，频谱资源)与小区进行通信，该小区可以属于宏基站(例如，宏eNB或宏gNB等)，也可以属于小小区(small cell)对应的基站，这里的小小区可以包括：城市小区(metro cell)、微小区(micro cell)、微微小区(pico cell)、毫微微小区(femto cell)等，这些小小区具有覆盖范围小、发射功率低的特点，适用于提供高速率的数据传输服务。
在本申请实施例中，终端设备或网络设备可以包括硬件层、运行在硬件层之上的操作系统层、以及运行在操作系统层上的应用层。该硬件层包括中央处理器(central processing unit，CPU)、内存管理单元(memory management unit，MMU)和内存(也称为主存)等硬件。该操作系统可以是任意一种或多种通过进程(process)实现业务处理的计算机操作系统，例如，Linux操作系统、Unix操作系统、Android操作系统、iOS操作系统或windows操作系统等。该应用层包含浏览器、通讯录、文字处理软件、即时通信软件等应用。并且，本申请实施例并未对本申请实施例提供的方法的执行主体的具体结构特别限定，只要能够根据本申请实施例提供的方法进行通信即可，例如，本申请实施例提供的方法的执行主体可以是终端设备或网络设备，或者，是终端设备或网络设备中能够执行程序的功能模块。
另外，本申请实施例的各个方面或特征可以实现成方法、装置或使用标准编程和/或工程技术的制品。本申请中使用的术语“制品”涵盖可从任何计算机可读器件、载体或介质访问的计算机程序。例如，计算机可读介质可以包括，但不限于：磁存储器件(例如，硬盘、软盘或磁带等)，光盘(例如，压缩盘(compact disc，CD)、数字通用盘(digital versatile disc，DVD)等)，智能卡和闪存器件(例如，可擦写可编程只读存储器(erasable programmable read-only memory，EPROM)、卡、棒或钥匙驱动器等)。另外，本文描述的各种存储介质可代表用于存储信息的一个或多个设备和/或其它机器可读介质。术语“机器可读介质”可包括但不限于，能够存储、包含和/或承载指令和/或数据的各种其它介质。
为便于理解本申请实施例，首先结合图1对适用于本申请实施例的通信系统进行详细说明。
图1示出了本申请实施例可以应用的通信系统100。如图1所示，该通信系统100可以包括至少一个网络设备，例如图1所示的网络设备110；该通信系统100还可以包括至少一个终端设备，例如图1所示的终端设备120。网络设备110与终端设备120可以通过无线链路通信。各通信设备，如网络设备110或终端设备120，可以配置多个天线，该多个天线可以包括至少一个用于发送信号的发射天线和至少一个用于接收信号的接收天线。另外，各通信设备还附加地包括发射机链和接收机链，本领域普通技术人员可以理解，它们均可以包括与信号发送和信号接收相关的多个部件(例如处理器、调制器、复用器、解调器、解复用器或天线等)。因此，网络设备110与终端设备120可以通过多天线技术通信。
图1示例性地示出了一个网络设备和两个终端设备，可选地，该通信系统100可 以包括多个网络设备并且每个网络设备的覆盖范围内可以包括其它数量的终端设备，本申请实施例对此不做限定。
为便于理解，首先对本申请实施例所涉及的术语进行简单介绍。
1、周期相关：指序列的循环移位相关，序列的交叠部分始终等于序列长度。序列u和序列v是长度为N的序列，u＝[u 0,u 1,...,u N-1]，v＝[v 0,v 1,...,v N-1]，序列u和序列v的周期相关函数为：
Figure PCTCN2022130960-appb-000051
其中，mod为取模运算，v*为复数v的共轭，τ是序列v的时延。
图2为周期相关的序列的示意图，如图2，序列u＝[u 0,u 1,u 2,u 3,u 4,u 5,u 6,u 7]，序列v＝[v 0,v 1,v 2,v 3,v 4,v 5,v 6,v 7]，两个序列长度N为8，序列v的时延为3。序列u和序列v的交叠部分始终等于序列长度8，序列u与序列v的周期相关函数为：
Figure PCTCN2022130960-appb-000052
其中，mod为取模运算，v *为复数v的共轭，τ是序列v的时延。
2、非周期相关：指序列的补零移位相关，序列的交叠部分通常小于序列长度。序列u和序列v是长度为N的序列，u＝[u 0,u 1,...,u N-1]，v＝[v 0,v 1,...,v N-1]，序列u和v序列的周期相关函数为：
Figure PCTCN2022130960-appb-000053
其中，mod为取模运算，v*为复数v的共轭，τ是序列v的时延。
图3为非周期相关的序列的示意图，如图3，序列u＝[u 0,u 1,u 2,u 3,u 4,u 5,u 6,u 7]，接收序列v＝[v 0,v 1,v 2,v 3,v 4,v 5,v 6,v 7]，两个序列长度N为8，序列v的时延为3。序列u和序列v的交叠部分始终小于序列长度8，序列u与序列v的非周期相关函数为：
Figure PCTCN2022130960-appb-000054
3、理想自相关特性：指序列与其任意非零移位的相关值均为零。
4、理想互相关特性：指两个序列任意移位的相关值均为零。
5、互补序列集：指序列集中所有成员序列自相关函数的和满足理想自相关特性。
随着无线通信的迅速发展，无线通信过程中面临着海量用户接入干扰问题，无线通信系统要有更高的频谱效率来支持海量用户接入。序列设计在无线通信系统中是一项比较关键的技术，序列的理想自相关和理想互相关特性在无线通信中有非常重要的应用。对于周期相关序列，存在具有理想自相关特性的序列，存在具有理想互相关特性的序列，但不存在同时具有理想自相关和理想互相关特性的序列。目前的非周期相关序列，不存在具有理想自相关特性的序列，也不存在具有理想互相关特性的序列。
在现有的标准协议中，上行随机接入利用ZC序列的周期相关特性，采用ZC序列添加循环前缀实现理想自相关。但是，这样会带来较大的时频资源开销，导致频谱效 率低。
具体而言，当终端设备想要在某个小区中与网络设备进行数据传输时，该终端设备需要接入该网络设备。在现有的标准协议中，上行随机接入利用ZC序列的周期相关特性，采用ZC序列添加循环前缀实现理想自相关。
图4和图5示出了物理随机接入信道(physical random access channel，PRACH)时频资源配置格式(简称为PRACH格式)。图4和图5的第一行为发送端的PRACH格式，发送端发送信号，对应地，接收端接收信号，第二行表示发送信号经过一段时间到达接收端。终端设备通过PRACH信道发送包含前导序列的上行信号，不同的前导序列通过不同配置格式的PRACH时频资源传输，即不同的前导序列对应不同的PRACH时频资源配置格式。前导序列在PRACH时频资源配置上包括循环前缀、ZC序列部分、以及保护间隔。不同的前导序列，在PRACH时频资源配置的循环前缀的大小不同，小区的覆盖半径也不同。
示例性地，小区覆盖半径r的计算方式为：
Figure PCTCN2022130960-appb-000055
其中，t CP为循环前缀的开销，c为光速。
当小区半径大于或等于预设值时，为了保证ZC序列的理想自相关的特性，且接收端在接收信号时，接收端的序列和发送端的序列交叠的部分保证周期相关，接收端的序列部分与其他数据符号不产生干扰，采用循环前缀较大的PRACH格式实现随机接入。极端情况下，需要将接入前导的循环前缀、ZC序列部分、以及保护间隔三部分的时频资源设置成相等的。
示例性地，图4所示的PRACH格式为PRACH格式0，PRACH格式0对应的随机接入前导序列的循环前缀t CP为0.1ms。图5所示的PRACH格式为PRACH格式1，PRACH格式1对应的随机接入前导序列的循环前缀t CP为0.68ms。通过上述小区覆盖半径的计算公式，可以得出，循环前缀t CP为0.1ms对应的小区半径为15km，即小区半径的预设值为15km。当小区覆盖半径大于或等于15km时，需要采用循环前缀较大的PRACH格式1实现随机接入。此时，随机接入前导序列的循环前缀t CP为0.68ms，循环前缀占用开销大，这样会带来较大的时频资源开销，导致频谱效率低频谱效率低。
为了解决上述技术问题，本申请提出了一种信号传输方法和装置，对置换互补序列集中的参数进行有限域内的单一映射操作，得到置换互补序列集的成员符号，根据成员符号得到置换互补序列集的成员序列，再根据成员序列确定置换互补序列集，该置换互补序列集满足非周期相关性。由于该置换互补序列集满足非周期相关性，通过该置换互补序列集发送信号，发送端在确定待发送信号时无需添加循环前缀，能够降低信号传输的时频资源开销，提高频谱效率，从而提高系统性能。
下面以具体的实施例对本申请的技术方案以及本申请的技术方案如何解决上述技术问题进行详细说明。下面这几个具体的实施例可以独立实现，也可以相互结合，对于相同或相似的概念或过程可能在某些实施例中不再赘述。
本申请实施例可以应用于多个不同的场景下，包括图1所示的场景，但并不限于该场景。示例性地，对于上行传输，终端设备可以作为发送端，网络设备可以作为接收端；对于下行传输，网络设备可以作为发送端，终端设备可以作为接收端；对于其 他传输场景，例如，终端设备和终端设备之间的数据传输，其中一个终端设备可以作为发送端，另一个终端设备可以作为接收端；又例如，网络设备和网络设备之间的上行传输，其中一个网络设备可以作为发送端，另一个网络设备可以作为接收端。因此，下面按照发送端和接收端对本申请实施例进行描述。
应理解，发送端可以替换为能够实现与发送端类似功能的装置或芯片，接收端也可以替换为能够实现与接收端类似功能的装置或芯片，本申请实施例对其名称不作限定。
图6为本申请实施例提供的信号传输方法600的示意性流程图。该方法600可以应用于图1所示的通信系统100，但本申请实施例不限于此。如图6所示，该方法600可以包括下列步骤：
S601，发送端确定置换互补序列集，该置换互补序列集包括M个成员序列，M个成员序列的每个成员序列包括N个成员符号，M和N均是大于1的整数。N个成员符号的每个成员符号是对置换互补序列集的参数进行置换操作得到的，置换操作为有限域内的单一映射操作，置换互补序列集满足非周期相关性。
可选地，置换互补序列集的参数包括下列至少一个：置换互补序列集中成员序列的长度N、成员序列的个数M、以及置换互补序列集中零相关区的长度Z，Z是大于或等于1的整数。
上述置换互补序列集的个数可以为一个，也可以为多个，本申请实施例对此不作限定。
一种可能的实现中，发送端具体可以通过下列方式确定置换互补序列集：发送端对置换互补序列集的参数进行置换操作确定一个成员符号，发送端可以执行该确定方式N次，得到N个成员符号；发送端根据N个成员符号确定一个成员序列，发送端可以执行该确定方式M次，得到M个成员序列；最后，发送端可以根据M个成员序列确定一个置换互补序列集。
应理解，上述置换互补序列集是发送端确定的。在一些可能的实现中，该置换互补序列集也可以是协议中约定的，或者预先存储的，或者接收端预先发送给发送端的，本申请对此不作限制。
S602，发送端基于置换互补序列集发送信号。对应地，接收端接收来自发送端的信号。
可选地，上述基于置换互补序列集发送信号，包括：从置换互补序列集中确定目标置换互补序列集；将目标置换互补序列集映射到N个成员符号和M个子载波上，生成信号，并发送信号。其中，置换互补序列集的M个成员序列采用频分复用，成员序列的N个成员符号采用时分复用。
示例性地，在该置换互补序列集为多个的情况下，发送端可以从置换互补序列集中选择一个置换互补序列集，将该置换互补序列集确定为目标置换互补序列集，利用该目标置换互补序列集生成信号并发送。
应理解，接收端可以按照与发送端相同的方式，确定多个置换互补序列集。在接收端接收到来自发送端的信号之后，接收端可以从多个置换互补序列集中查找，通过将接收到的信号与本地多个置换互补序列集进行非周期相关处理，确定出发送端发送 该信号所采用的目标置换互补序列集。
本申请实施例的信号传输方法，通过对置换互补序列集中的参数进行有限域内的单一映射操作，得到置换互补序列集的成员符号，根据成员符号得到置换互补序列集的成员序列，再根据成员序列确定置换互补序列集，该置换互补序列集满足非周期相关性。由于该置换互补序列集满足非周期相关性，通过该置换互补序列集发送信号，发送端在确定待发送信号时无需添加循环前缀，能够降低信号传输的时频资源开销，提高频谱效率，从而提高系统性能。
可选地，上述置换互补序列集的个数为
Figure PCTCN2022130960-appb-000056
共包括Z-1组，每组有
Figure PCTCN2022130960-appb-000057
个。其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
Figure PCTCN2022130960-appb-000058
其中，N为置换互补序列集的成员序列的长度，M为置换互补序列集的成员序列的个数，Z为置换互补序列集的零相关区的长度，l为置换互补序列集的组内成员个数的索引号。N大于或等于M，M大于或等于Z，M能被Z整除，k∈{1,2,...,Z-1}，
Figure PCTCN2022130960-appb-000059
一种可能的映射中，将目标置换互补序列集映射到M个子载波上具体可以为：将矩阵s [k][l]中的M行元素映射到M个子载波上，例如，子载波的索引(或编号)为0～M-1，上述映射具体可以为将第0行元素映射到第0个子载波上，将第1行元素映射到第1个子载波上，以此类推，将第M-1行元素映射到第M-1个子载波上。上述将目标置换互补序列集映射到N个成员符号具体可以为：将矩阵s [k][l]中的N列元素映射到N个成员符号上，例如，成员符号的索引(或编号)为0～N-1，上述映射具体可以为将第0列元素映射到第0个成员符号上，将第1列元素映射到第1个成员符号上，以此类推，将第N-1列元素映射到第N-1个成员符号上。
上述置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
Figure PCTCN2022130960-appb-000060
可以是在有限域
Figure PCTCN2022130960-appb-000061
中对参数
Figure PCTCN2022130960-appb-000062
在有限域
Figure PCTCN2022130960-appb-000063
中对参数
Figure PCTCN2022130960-appb-000064
以及在有限域
Figure PCTCN2022130960-appb-000065
中对参数n mod Z分别进行置换操作得到的，具体可以通过下述公式表示：
Figure PCTCN2022130960-appb-000066
其中，m＝p×Z+q，
Figure PCTCN2022130960-appb-000067
q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
Figure PCTCN2022130960-appb-000068
表示有限域
Figure PCTCN2022130960-appb-000069
中的置换操作，
Figure PCTCN2022130960-appb-000070
表示有限域
Figure PCTCN2022130960-appb-000071
中的置换操作，
Figure PCTCN2022130960-appb-000072
表示有限域
Figure PCTCN2022130960-appb-000073
中的置换操作。
Figure PCTCN2022130960-appb-000074
表示N阶有限域{0,1,2,...,N-1}，
Figure PCTCN2022130960-appb-000075
表示
Figure PCTCN2022130960-appb-000076
阶有限域
Figure PCTCN2022130960-appb-000077
表示Z阶有限域{0,1,2,...,Z-1}。
一种可能的实现方式中，置换操作为有限域内的映射操作，该映射操作可以通过函数来实现。
示例性地，上述置换操作中置换函数可以为：
Figure PCTCN2022130960-appb-000078
gcd(d,N-1)＝1，
Figure PCTCN2022130960-appb-000079
Π(n mod Z)＝a×(n mod Z)+b。其中，gcd表示两个数的最大公约数，mod表示取模运算，
Figure PCTCN2022130960-appb-000080
置换函数
Figure PCTCN2022130960-appb-000081
表示：将有限域
Figure PCTCN2022130960-appb-000082
中的
Figure PCTCN2022130960-appb-000083
置换为有限域
Figure PCTCN2022130960-appb-000084
中的
Figure PCTCN2022130960-appb-000085
置换函数
Figure PCTCN2022130960-appb-000086
表示：将有限域
Figure PCTCN2022130960-appb-000087
中的
Figure PCTCN2022130960-appb-000088
置换为有限域
Figure PCTCN2022130960-appb-000089
中
Figure PCTCN2022130960-appb-000090
Π(n mod Z)＝a×(n mod Z)+b表示：将有限域
Figure PCTCN2022130960-appb-000091
中的n mod Z置换为有限域
Figure PCTCN2022130960-appb-000092
中的a×(n mod Z)+b。
本申请实施例中的成员序列的长度N、成员序列的个数M、以及零相关区的长度Z可以具有不同的配置，在不同的配置情况下，发送端可以生成不同的置换互补序列集，将置换互补序列集应用到不同的场景下，可以在降低开销、提升频谱效率的同时，满足当前场景下的系统性能要求。
下面，将结合置换互补序列集的参数N、M、以及Z的不同的配置情况，介绍不同的置换互补序列集。
情况1，N＝M＝Z，置换互补序列集的个数为N×(N-1)，其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
Figure PCTCN2022130960-appb-000093
其中，N为成员序列的长度，M为成员序列的个数，Z为零相关区的长度，k∈{1,2,...,N-1}，l∈{0,1,...,N-1}。
置换互补序列集s [k][l]第m个成员序列的第n个成员符号
Figure PCTCN2022130960-appb-000094
表示为：
Figure PCTCN2022130960-appb-000095
其中，m∈{0,1,...,N-1}，n∈{0,1,...,N-1}，
Figure PCTCN2022130960-appb-000096
表示有限域
Figure PCTCN2022130960-appb-000097
中的置换操作，
Figure PCTCN2022130960-appb-000098
表示有限域
Figure PCTCN2022130960-appb-000099
中的置换操作。
示例性地，上述置换操作中的置换函数可以为：Γ(l)＝l d，gcd(d,N-1)＝1，Π(n)＝a×n+b，其中，gcd表示两个数的最大公约数，
Figure PCTCN2022130960-appb-000100
置换函数Γ(l)＝l d表示：将有限域
Figure PCTCN2022130960-appb-000101
中的l置换为有限域
Figure PCTCN2022130960-appb-000102
中的l d。Π(n)＝a×n+b表示：将有限域
Figure PCTCN2022130960-appb-000103
中的n置换为有限域
Figure PCTCN2022130960-appb-000104
中的a×n+b。
下面对参数配置方案为N＝M＝Z的置换互补序列集的非周期相关性进行分析：
(1)任意序列集s [k][l]的非周期自相关函数为：
Figure PCTCN2022130960-appb-000105
当时延τ≠0时，Π(n)-Π(n+τ)≠0，第二个求和项的物理含义表示：复平面的单位圆上等间隔采样的N个点的和，因此，第二个求和项等于0。
示例性地，当Π(n)＝a×n+b时，第二个求和项具体为：
Figure PCTCN2022130960-appb-000106
其中，
Figure PCTCN2022130960-appb-000107
表示在复平面的单位圆上的一个点，
Figure PCTCN2022130960-appb-000108
表示：对复平面的单位圆上等间隔采样的N个点求和，对这N个复数相加，可以得到
Figure PCTCN2022130960-appb-000109
因此，任意置换互补序列集s [k][l]均具有理想的非周期自相关特性。
(2)组内序列集s [k][l]和
Figure PCTCN2022130960-appb-000110
的非周期互相关函数：
Figure PCTCN2022130960-appb-000111
当时延τ≠0时，第二个求和项等于0；当时延τ＝0时，第一个求和项等于0。也即l在l∈{0,1,...,N-1}的N个取值中，组内序列集的非周期互相关函数都等于0。
因此，置换互补序列集s [k][l]具有理想的组内非周期互相关特性，组内共存在N个零相关序列集。
(3)组间序列集s [k][l]和
Figure PCTCN2022130960-appb-000112
的非周期互相关函数：
Figure PCTCN2022130960-appb-000113
对于置换操作
Figure PCTCN2022130960-appb-000114
有且只有一个
Figure PCTCN2022130960-appb-000115
使得
Figure PCTCN2022130960-appb-000116
此时第二个求和项等于N。当
Figure PCTCN2022130960-appb-000117
时，第一个求和项等于0；当
Figure PCTCN2022130960-appb-000118
时，第一个求和项等于1。也即k在k∈{1,2,...,N-1}的N-1个取值中，组间序列集的非周期互相关最大值为N，非周期自相关的峰值为N 2，互相关最大值仅为峰值的
Figure PCTCN2022130960-appb-000119
可以有效抑制非周期相关的旁瓣。
因此，如图7所示的置换互补序列集的互相关特性示意图，在N＝M＝Z的情况下，置换互补序列集s [k][l]具有理想的非周期自相关特性、理想的组内非周期互相关特性、以及低组间非周期互相关特性；组内存在N个零相关序列集，共存在N-1个低相关组，组间序列集的非周期互相关最大值为N。
在N＝M＝Z的情况下，置换互补序列集的成员序列长度N、成员序列个数M、以及零相关区Z构成三元组(N,N,N)。在相同的时频资源下，ZC序列的成员序列长度为N×M，零相关区为M×Z，构成二元组(N 2,N 2)。通过对置换互补序列集和ZC序列的评价指标进行分析，得到置换互补序列集(N,N,N)和ZC序列(N 2,N 2)成员的评价指 标情况，如表一所示。其中，置换互补序列集(N,N,N)是通过上述置换互补序列集的非周期相关性分析得到的，ZC序列(N 2,N 2)的评价指标分析与现有技术相同，此处不再赘述。
表一
Figure PCTCN2022130960-appb-000120
从表一可以看出，在相同的时频资源条件下，置换互补序列集(N,N,N)在零相关区的序列容量N大于ZC序列(N 2,N 2)在零相关区的序列容量0，置换互补序列集(N,N,N)在低相关区的序列容量N×(N-1)小于ZC序列(N 2,N 2)在低相关区的序列容量N 2-1。
发送端在确定了置换互补序列集后，当配置小区所需的置换互补序列集的数目大小于或等于组内置换互补序列集的个数时，可以从零相关区确定目标置换互补序列集；当配置小区所需的置换互补序列集的数目大于组内置换互补序列集的个数时，需要从低相关区确定目标置换互补序列集。即虽然置换互补序列集在低相关区的序列容量小于ZC序列在低相关区的序列容量，但对发送信号的影响较小。因此，当配置N＝M＝Z时，置换互补序列集相较于ZC序列，无需添加循环前缀，在降低开销、提升频谱效率的同时，还提高了序列容量。
情况2，N>M＝Z，置换互补序列集的个数为(M-1)×N，其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
Figure PCTCN2022130960-appb-000121
其中，N为成员序列的长度，M为成员序列的个数，Z为零相关区的长度，k∈{1,2,...,M-1}，l∈{0,1,...,N-1}；
置换互补序列集s [k][l]中第m个成员序列的第n个符号
Figure PCTCN2022130960-appb-000122
表示为：
Figure PCTCN2022130960-appb-000123
其中，m∈{0,1,...,M-1}，n∈{0,1,...,N-1}，
Figure PCTCN2022130960-appb-000124
表示有限域
Figure PCTCN2022130960-appb-000125
中的置换操作，
Figure PCTCN2022130960-appb-000126
表示有限域
Figure PCTCN2022130960-appb-000127
中的置换操作。
示例性地，上述置换操作的置换函数可以为：Γ(l)＝l d，gcd(d,N-1)＝1，Π(n mod M)＝a×(n mod M)+b。其中，gcd表示两个数的最大公约数，mod表示取模运算，
Figure PCTCN2022130960-appb-000128
置换函数Γ(l)＝l d表示：将有限域
Figure PCTCN2022130960-appb-000129
中的l置换为有限域
Figure PCTCN2022130960-appb-000130
中的l d。置换函数Π(n mod M)＝a×(n mod M)+b表示：将有限域
Figure PCTCN2022130960-appb-000131
中的n mod M置换为有限域
Figure PCTCN2022130960-appb-000132
中的a×(n mod M)+b。
下面，我们对置换互补序列集的非周期相关性进行分析：
(1)任意序列集s [k][l]的非周期自相关函数为：
Figure PCTCN2022130960-appb-000133
当时延τ≠0时，第二个求和项等于0。
因此，任意置换互补序列集s [k][l]均具有理想的非周期自相关特性。
(2)组内序列集s [k][l]和
Figure PCTCN2022130960-appb-000134
的非周期互相关函数：
Figure PCTCN2022130960-appb-000135
当时延τ≠0时，第二个求和项等于0；当时延τ＝0时，第一个求和项等于0。也即l在l∈{0,1,...,N-1}的N个取值中，组内序列集的非周期互相关函数都等于0。
因此，置换互补序列集s [k][l]具有理想的组内非周期互相关特性，组内共存在N个零相关序列集。
(3)组间序列集s [k][l]和
Figure PCTCN2022130960-appb-000136
的非周期互相关函数：
Figure PCTCN2022130960-appb-000137
对于置换操作
Figure PCTCN2022130960-appb-000138
有且只有一个
Figure PCTCN2022130960-appb-000139
使得
Figure PCTCN2022130960-appb-000140
此时第二个求和项等于M。在此基础上，
Figure PCTCN2022130960-appb-000141
使得
Figure PCTCN2022130960-appb-000142
第一个求和项不超过
Figure PCTCN2022130960-appb-000143
也即k在k∈{1,2,...,M-1}的M-1个取值中，组间序列集的非周期互相关最大值为
Figure PCTCN2022130960-appb-000144
可以有效抑制非周期相关的旁瓣。
因此，如图8所示的另一置换互补序列集的互相关特性示意图，在N>M＝Z的情况下，置换互补序列集s [k][l]具有理想的非周期自相关特性、理想的组内非周期互相关特性、以及低组间非周期互相关特性，组内存在N个零相关序列集，共存在M-1个低相关组，组间序列集的非周期互相关最大值为
Figure PCTCN2022130960-appb-000145
在N>M＝Z的情况下，置换互补序列集的成员序列长度N、成员序列个数M、以及零相关区Z构成三元组(N,M,M)，在相同时频资源下，ZC序列的成员序列长度为N×M，零相关区为M×Z，构成二元组(N×M,M 2)。通过对置换互补序列集和ZC序列的评价指标进行分析，得到置换互补序列集(N,M,M)和ZC序列(N×M,M 2)的评价指标情况，如表二所示。其中，置换互补序列集(N,M,M)是通过上述置换互补序列集的非周期相关性分析得到的，ZC序列(N×M,M 2)的评价指标分析与现有技术相同，此处不再赘述。
表二
Figure PCTCN2022130960-appb-000146
Figure PCTCN2022130960-appb-000147
从表二可以看出，在相同的时频资源条件下，置换互补序列集(N,M,M)的在零相关区的序列容量N大于ZC序列(N×M,M 2)在零相关区的序列容量
Figure PCTCN2022130960-appb-000148
因此，当配置N>M＝Z时，置换互补序列集相较于ZC序列，无需添加循环前缀，在降低开销、提升频谱效率的同时，还提高了序列容量，可以在噪声较大的场景或者接收端对信号检测性能要求高的场景下，提高接收端的信号检测能力。
情况3，N>M>Z，置换互补序列集的个数为
Figure PCTCN2022130960-appb-000149
其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
Figure PCTCN2022130960-appb-000150
其中，N为成员序列的长度，M为成员序列的个数，Z为零相关区的长度，k∈{1,2,...,Z-1}，
Figure PCTCN2022130960-appb-000151
置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
Figure PCTCN2022130960-appb-000152
表示为：
Figure PCTCN2022130960-appb-000153
其中，m＝p×Z+q，
Figure PCTCN2022130960-appb-000154
q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
Figure PCTCN2022130960-appb-000155
表示有限域
Figure PCTCN2022130960-appb-000156
中的置换操作，
Figure PCTCN2022130960-appb-000157
表示有限域
Figure PCTCN2022130960-appb-000158
中的置换操作，
Figure PCTCN2022130960-appb-000159
表示有限域
Figure PCTCN2022130960-appb-000160
中的置换操作。
示例性地，上述置换操作中置换函数可以为：
Figure PCTCN2022130960-appb-000161
gcd(d,N-1)＝1，
Figure PCTCN2022130960-appb-000162
Π(n mod Z)＝a×(n mod Z)+b。其中，gcd表示两个数的最大公约数，mod表示取模运算，
Figure PCTCN2022130960-appb-000163
置换函数
Figure PCTCN2022130960-appb-000164
表示：将有限域
Figure PCTCN2022130960-appb-000165
中的
Figure PCTCN2022130960-appb-000166
置换为有限域
Figure PCTCN2022130960-appb-000167
中的
Figure PCTCN2022130960-appb-000168
置换函数
Figure PCTCN2022130960-appb-000169
表示：将有限域
Figure PCTCN2022130960-appb-000170
中的
Figure PCTCN2022130960-appb-000171
置换为有限域
Figure PCTCN2022130960-appb-000172
中
Figure PCTCN2022130960-appb-000173
置换函数Π(n mod Z)＝a×(n mod Z)+b表示：将有限域
Figure PCTCN2022130960-appb-000174
中的n mod Z置换为有限域
Figure PCTCN2022130960-appb-000175
中的a×(n mod Z)+b。
下面，我们对参数配置方案为N>M>Z的置换互补序列集的非周期相关性进行分析：
(1)任意序列集s [k][l]的非周期自相关函数为：
Figure PCTCN2022130960-appb-000176
当时延τ≠0时，第二个求和项等于0。
因此，任意置换互补序列集s [k][l]均具有理想的非周期自相关特性。
(2)组内序列集s [k][l]和
Figure PCTCN2022130960-appb-000177
的非周期互相关函数：
Figure PCTCN2022130960-appb-000178
当时延τ≠0时，第三个求和项等于0；当
Figure PCTCN2022130960-appb-000179
时，第二个求和项等于0；当τ＝0且
Figure PCTCN2022130960-appb-000180
时，第一个求和项等于0。也即l在
Figure PCTCN2022130960-appb-000181
的
Figure PCTCN2022130960-appb-000182
个取值中，组内序列集的非周期互相关函数都等于0。
因此，置换互补序列集s [k][l]具有理想的组内非周期互相关特性，组内共存在
Figure PCTCN2022130960-appb-000183
个零相关序列集。
(3)组间序列集s [k][l]和
Figure PCTCN2022130960-appb-000184
的非周期互相关函数：
Figure PCTCN2022130960-appb-000185
对于置换操作
Figure PCTCN2022130960-appb-000186
有且只有一个
Figure PCTCN2022130960-appb-000187
使得
Figure PCTCN2022130960-appb-000188
此时第三个求和项等于Z。
Figure PCTCN2022130960-appb-000189
第二个求和项等于
Figure PCTCN2022130960-appb-000190
在此基础上，
Figure PCTCN2022130960-appb-000191
使得
Figure PCTCN2022130960-appb-000192
第一个求和项不超过
Figure PCTCN2022130960-appb-000193
也即k在k∈{1,2,...,Z-1}的Z-1个取值中，组间序列集的非周期互相关最大值为
Figure PCTCN2022130960-appb-000194
可以有效抑制非周期相关的旁瓣。
因此，如图9所示的再一置换互补序列集的互相关特性示意图，在N>M>Z的情 况下，置换互补序列集s [k][l]具有理想的非周期自相关特性、理想的组内非周期互相关特性、以及低组间非周期互相关特性，组内存在
Figure PCTCN2022130960-appb-000195
个零相关序列集，共存在Z-1个低相关组，互相关最大值为
Figure PCTCN2022130960-appb-000196
在N>M>Z的情况下，置换互补序列集的成员序列长度N、成员序列个数M、以及零相关区Z构成三元组(N,M,Z)。在相同时频资源下，ZC序列的成员序列长度为N×M，零相关区为M×Z，构成二元组(N×M,M×Z)。通过对置换互补序列集和ZC序列的评价指标进行分析，得到置换互补序列集(N,M,Z)和ZC序列(N×M,M×Z)评价指标的评价指标情况，如表三所示。其中，置换互补序列集(N,M,Z)是通过上述置换互补序列集的非周期相关性分析得到的，ZC序列(N×M,M×Z)的评价指标分析与现有技术相同，此处不再赘述。
表三
Figure PCTCN2022130960-appb-000197
从表三可以看出，在相同的时频资源条件下，置换互补序列集(N,M,Z)在零相关区的序列容量
Figure PCTCN2022130960-appb-000198
大于ZC序列(N×M,M×Z)在零相关区的序列容量
Figure PCTCN2022130960-appb-000199
因此，当配置N>M>Z时，置换互补序列集相较于ZC序列，无需添加循环前缀，在降低开销、提升频谱效率的同时，适用于多用户接入的场景。
一种可能的实现中，置换互补序列集是候选置换互补序列集中的部分序列集，候选置换互补序列集的个数为
Figure PCTCN2022130960-appb-000200
其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
Figure PCTCN2022130960-appb-000201
其中，N为成员序列的长度，M为成员序列的个数，Z为零相关区的长度，N>M>Z，M能被Z整除，k∈{1,2,...,Z-1}，
Figure PCTCN2022130960-appb-000202
置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
Figure PCTCN2022130960-appb-000203
表示为：
Figure PCTCN2022130960-appb-000204
其中，m＝p×Z+q，
Figure PCTCN2022130960-appb-000205
q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
Figure PCTCN2022130960-appb-000206
表示有限域
Figure PCTCN2022130960-appb-000207
中的置换操作，
Figure PCTCN2022130960-appb-000208
表示有限域
Figure PCTCN2022130960-appb-000209
中的置换操作，
Figure PCTCN2022130960-appb-000210
表示有限域
Figure PCTCN2022130960-appb-000211
中的置换操作。
具体地，置换互补序列集是候选置换互补序列集中的部分序列集，也可以称为对候选置换互补序列集进行限制所得到的限制集。
示例性地，上述置换操作中的置换函数可以为：
Figure PCTCN2022130960-appb-000212
gcd(d,N-1)＝1，
Figure PCTCN2022130960-appb-000213
Π(n mod Z)＝a×(n mod Z)+b。其中，gcd表示两个数的最大公约数，mod表示取模运算，
Figure PCTCN2022130960-appb-000214
置换函数
Figure PCTCN2022130960-appb-000215
表示：将有限域
Figure PCTCN2022130960-appb-000216
中的
Figure PCTCN2022130960-appb-000217
置换为有限域
Figure PCTCN2022130960-appb-000218
中的
Figure PCTCN2022130960-appb-000219
置换函数
Figure PCTCN2022130960-appb-000220
表示：将有限域
Figure PCTCN2022130960-appb-000221
中的
Figure PCTCN2022130960-appb-000222
置换为有限域
Figure PCTCN2022130960-appb-000223
中
Figure PCTCN2022130960-appb-000224
置换函数Π(n mod Z)＝a×(n mod Z)+b表示：将有限域
Figure PCTCN2022130960-appb-000225
中的n mod Z置换为有限域
Figure PCTCN2022130960-appb-000226
中的a×(n mod Z)+b。
可选地，置换互补序列集是对候选置换互补序列集中的索引号l根据对抗多普勒频移的子载波间隔数进行限制得到的。示例性地，l可以属于下列集合：
Figure PCTCN2022130960-appb-000227
其中，f是对抗多普勒频移的子载波间隔数，属于正整数。i取遍
Figure PCTCN2022130960-appb-000228
j取遍
Figure PCTCN2022130960-appb-000229
上述集合l中元素的数量有
Figure PCTCN2022130960-appb-000230
个。
应理解，该置换互补序列集，还可以称为限制置换互补序列集或者置换互补序列集的限制集，本申请对此不做限定。
具体地，
Figure PCTCN2022130960-appb-000231
使得
Figure PCTCN2022130960-appb-000232
Figure PCTCN2022130960-appb-000233
即置换互补序列集满足理想的组内非周期互相关特性，组内共存在
Figure PCTCN2022130960-appb-000234
个零相关序列集。如果不限制组内序列集索引号的集合，即
Figure PCTCN2022130960-appb-000235
此时频偏可能会导致候选置换互补序列集的组内非周期互相关值不为0。
示例性地，在高速移动(例如，高铁)的通信场景中，频偏不超过一个子载波的间隔。通过限制候选置换互补序列集的组内序列集索引号得到置换互补序列集，即置换互补序列集为候选置换互补序列集中l属于下列集合的序列集：
Figure PCTCN2022130960-appb-000236
图10示出了ZC序列和候选置换互补序列集采用限制集抗频偏比较的示意图。如图10所示，“0”表示有效的序列/置换互补序列集，“+1”表示序列正向偏移了一个子载波，“-1”表示序列负向偏移了一个子载波。可以看出，ZC序列采用限制集对抗不超过一个子载波间隔的频偏时，限制集中可用循环移位个数是非限制集的序列个数的一部分，一般情况下，考虑到图中所示的虚线框空白区的序列个数可以为一个或多个，所以，限制集中可用循环移位个数是非限制集的序列个数的1/6～1/3。在相同的时频资源条件下，通过置换互补序列集对抗不超过一个子载波间隔的频偏时，该置换互补序列集满足理想的组内非周期互相关特性，组内共存在
Figure PCTCN2022130960-appb-000237
零相关序列集置换互补序列集，组内序列集索引号的个数接近候选置换互补序列集中索引号个数的1/3，也即以组为单位，组内的置换互补序列集的个数接近候选置换互补序列集的个数的1/3。
因此，在配置N>M>Z的情况下，通过限制候选置换互补序列集的组内序列集索引号得到的置换互补序列集，发送端可以无需添加循环前缀，在降低开销、提升频谱效率的同时，还提高了序列容量，且适用于高速移动的通信场景中。
一种可能的实现中，在随机接入场景下，上述发送端为终端设备，上述接收端为网络设备，上述基于置换互补序列集发送信号，包括：终端设备基于置换互补序列集向网络设备发送随机接入信号。
可选地，成员序列长度N和成员序列个数M是网络设备向终端设备发送的，或者，是协议约定的。
可选地，零相关区的长度Z、置换互补序列集的组索引号的起始值k，置换互补序列集的组内序列集索引号的起始值l是网络设备向终端设备发送的，或者，是协议约定的。
网络设备和终端设备根据组索引号的起始值k确定置换互补序列集，终端设备从置换互补序列集中随机选择一个置换互补序列集发送信号。
可选地，上述组索引号和组序号之间存在对应关系，该对应关系为协议约定的或网络侧预配置的。
在一种可能的实现方式中，网络设备和终端设备可以根据成员序列的长度N、成员序列的个数M、以及零相关区的长度Z计算组内序列集的个数
Figure PCTCN2022130960-appb-000238
然后，网络设备和终端设备可以根据小区所需的置换互补序列集的数目和组内序列集的个数的商向上取整，得到置换互补序列集的组数C。接着，网络设备和终端设备可以根据组索引号的起始值k，确定该组索引号对应的组序号，按照组序号的顺序依次确定C组置换互补序列集，其中，前C-1组置换互补序列集中，每组置换互补序列集的个数为
Figure PCTCN2022130960-appb-000239
第C组置换互补序列集的个数为小区所需的置换互补序列集的数目除以组内序列集的个数
Figure PCTCN2022130960-appb-000240
得到的余数。
上述小区所需的置换互补序列集的数目为正整数，可以是协议约定的或者网络设备通过信令为终端设备指示的。
示例性地，上述小区所需的置换互补序列集的数目为64。协议约定了置换互补序列集的组索引号和组序号对应关系为：组序号为1时，组索引号为k＝3，组序号为2时，组索引号为k＝1，组序号为3时，组索引号为k＝5，组序号为Z-1时，组索引号为k＝4。组索引号和组序号对应关系可以如表四所示。
表四
组序号 组索引号
1 k＝3
2 k＝1
3 k＝5
... ...
Z-1 k＝4
当
Figure PCTCN2022130960-appb-000241
大于或等于小区所需的置换互补序列集的数目64，置换互补序列集的组索引号的起始值k＝3时，即组内置换互补序列集的个数大于或等于小区所需的置换互补序列集的数目64时，发送端可以从组序号为1的置换互补序列集中随机选出一个置换互补序列集发送信号。当组内置换互补序列集的个数
Figure PCTCN2022130960-appb-000242
小于小区所需的置换互补序列集的数目64时，则发送端在确定k＝3组的置换互补序列集后，接着可以确定k＝1组的置换互补序列集，直至选出64个置换互补序列集。发送端可以从该64个置换互补序列集中随机选出一个置换互补序列集发送信号。表五列出了组索引号的起始值k＝3时，发送端确定的置换互补序列集。
表五
Figure PCTCN2022130960-appb-000243
如表五所示，
Figure PCTCN2022130960-appb-000244
等于31，发送端可以确定k＝3组的置换互补序列集、k＝1组的置换互补序列集和k＝5组的置换互补序列集中的前两个置换互补序列集。
应理解，上述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请实施例的实施过程构成任何限定。
上文中结合图1至图10，详细描述了根据本申请实施例的信号传输方法，下面将结合图11至图12，详细描述根据本申请实施例的信号传输装置。
图11示出了本申请实施例提供的装置1100。该装置1100可以是发送端，也可以是够支持发送端实现其功能的装置，例如是可以用于发送端中的芯片或芯片系统。该装置1100包括：处理单元1110和收发单元1120。
处理单元1110用于：确定置换互补序列集，置换互补序列集包括M个成员序列，成员序列包括N个成员符号，M和N均是大于1的整数，成员符号是对置换互补序列集的参数进行置换操作得到的，置换操作为有限域内的单一映射操作，置换互补序列集满足非周期相关性；
收发单元1120用于：基于置换互补序列集发送信号。
可选地，置换互补序列集的参数包括下列至少一个：置换互补序列集中成员序列的长度N、成员序列的个数M、以及置换互补序列集中零相关区的长度Z，Z是大于或等于1的整数。
可选地，置换互补序列集的个数为
Figure PCTCN2022130960-appb-000245
其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
Figure PCTCN2022130960-appb-000246
其中，N大于或等于M，M大于或等于Z，M能被Z整除，k∈{1,2,...,Z-1}，
Figure PCTCN2022130960-appb-000247
置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
Figure PCTCN2022130960-appb-000248
表示为：
Figure PCTCN2022130960-appb-000249
其中，m＝p×Z+q，
Figure PCTCN2022130960-appb-000250
q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
Figure PCTCN2022130960-appb-000251
表示有限域
Figure PCTCN2022130960-appb-000252
中的置换操作，
Figure PCTCN2022130960-appb-000253
表示有限域
Figure PCTCN2022130960-appb-000254
中的置换操作，
Figure PCTCN2022130960-appb-000255
表示有限域
Figure PCTCN2022130960-appb-000256
中的置换操作。
可选地，N＝M＝Z。
可选地，N>M>Z。
可选地，N>M>Z。
可选地，置换互补序列集是候选置换互补序列集中的部分序列集，候选置换互补序列集的个数为
Figure PCTCN2022130960-appb-000257
其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
Figure PCTCN2022130960-appb-000258
其中，N>M>Z，M能被Z整除，k∈{1,2,...,Z-1}，
Figure PCTCN2022130960-appb-000259
置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
Figure PCTCN2022130960-appb-000260
表示为：
Figure PCTCN2022130960-appb-000261
其中，m＝p×Z+q，
Figure PCTCN2022130960-appb-000262
q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
Figure PCTCN2022130960-appb-000263
表示有限域
Figure PCTCN2022130960-appb-000264
中的置换操作，
Figure PCTCN2022130960-appb-000265
表示有限域
Figure PCTCN2022130960-appb-000266
中的置换操作，
Figure PCTCN2022130960-appb-000267
表示有限域
Figure PCTCN2022130960-appb-000268
中的置换操作。
可选地，置换互补序列集为候选置换互补序列集中l属于下列集合的序列集：
Figure PCTCN2022130960-appb-000269
其中，f是正整数。
可选地，处理单元1110还用于：从置换互补序列集中确定目标置换互补序列集；将目标置换互补序列集映射到N个成员符号和M个子载波上，生成信号；收发单元1120还用于：发送信号。
可选地，收发单元1120还用于：基于置换互补序列集向网络设备发送随机接入信号。
可选地，成员序列长度N和成员序列个数M是网络设备向该装置发送的，或者，是协议约定的。
应理解，这里的装置1100以功能单元的形式体现。这里的术语“单元”可以指应用特有集成电路(application specific integrated circuit，ASIC)、电子电路、用于执行一个或多个软件或固件程序的处理器(例如共享处理器、专有处理器或组处理器等)和存储器、合并逻辑电路和/或其它支持所描述的功能的合适组件。在一个可选例子中，本领域技术人员可以理解，装置1100可以具体为上述实施例中的发送端，可以用于执行上述方法实施例中与发送端对应的各个流程和/或步骤，为避免重复，在此不再赘述。
上述各个方案的装置1100具有实现上述方法中发送端所执行的相应步骤的功能。所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个与上述功能相对应的模块；例如收发单元具体可以包括接收单元和发送单元，接收单元和/或发送单元可以由收发机替代(例如，发送单元可以由发送机替代，接收单元可以由接收机替代)，其它单元，如处理单元等可以由处理器替代，分别执行各个方法实施例中的收发操作以及相关的处理操作。
此外，上述收发单元还可以是收发电路(例如可以包括接收电路和发送电路)，处理单元可以是处理电路。在本申请的实施例中，图11中的装置可以是前述实施例中的发送端，也可以是芯片或者芯片系统，例如：片上系统(system on chip，SoC)。其中，收发单元可以是输入输出电路、通信接口；处理单元为该芯片上集成的处理器或者微处理器或者集成电路。在此不做限定。
图12示出了本申请实施例提供的另一信号传输装置1200。该装置1200包括处理器1210、收发器1220和存储器1230。其中，处理器1210、收发器1220和存储器1230通过内部连接通路互相通信，该存储器1230用于存储指令，该处理器1210用于执行该存储器1230存储的指令，以控制该收发器1220发送信号和/或接收信号。
应理解，装置1200可以具体为上述实施例中的发送端，并且可以用于执行上述方法实施例中与发送端的各个步骤和/或流程。可选地，该存储器1230可以包括只读存储器和随机存取存储器，并向处理器提供指令和数据。存储器的一部分还可以包括非易失性随机存取存储器。例如，存储器还可以存储设备类型的信息。该处理器1210可以用于执行存储器中存储的指令，并且当该处理器1210执行存储器中存储的指令时，该处理器1210用于执行上述与该第一终端设备或网络设备对应的方法实施例的各个步骤和/或流程。该收发器1220可以包括发射器和接收器，该发射器可以用于实现上 述收发器对应的用于执行发送动作的各个步骤和/或流程，该接收器可以用于实现上述收发器对应的用于执行接收动作的各个步骤和/或流程。
应理解，在本申请实施例中，上述装置的处理器可以是中央处理单元(central processing unit，CPU)，该处理器还可以是其他通用处理器、数字信号处理器(DSP)、专用集成电路(ASIC)、现场可编程门阵列(FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。
在实现过程中，上述方法的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。结合本申请实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件单元组合执行完成。软件单元可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器执行存储器中的指令，结合其硬件完成上述方法的步骤。为避免重复，这里不再详细描述。
本申请实施还提供了一种通信系统，该通信系统可以包括上述发送端和接收端。
根据本申请实施例提供的方法，本申请还提供一种计算机可读存储介质，该计算机可读存储介质用于存储计算机程序，该计算机程序用于实现上述实施例中发送端所执行的各个步骤或流程。
根据本申请实施例提供的方法，本申请还提供一种计算机程序产品，该计算机程序产品包括计算机程序(也可以称为代码，或指令)，当该计算机程序在计算机上运行时，该计算机可以执行上述实施例中发送端所执行的各个步骤或流程。
本领域普通技术人员可以意识到，结合本文中所公开的实施例中描述的各方法步骤和单元，能够以电子硬件、计算机软件或者二者的结合来实现，为了清楚地说明硬件和软件的可互换性，在上述说明中已经按照功能一般性地描述了各实施例的步骤及组成。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。本领域普通技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，为了描述的方便和简洁，上述描述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另外，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口、装置或单元的间接耦合或通信连接，也可以是电的，机械的或其它的形式连接。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本申请实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以是两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分，或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(read-only memory，ROM)、随机存取存储器(random access memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到各种等效的修改或替换，这些修改或替换都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以权利要求的保护范围为准。

Claims (25)

  1. 一种信号传输方法，其特征在于，包括：
    确定置换互补序列集，所述置换互补序列集包括M个成员序列，所述成员序列包括N个成员符号，M和N均是大于1的整数，所述成员符号是对所述置换互补序列集的参数进行置换操作得到的，所述置换操作为有限域内的单一映射操作，所述置换互补序列集满足非周期相关性；
    基于所述置换互补序列集发送信号。
  2. 根据权利要求1所述的方法，其特征在于，所述置换互补序列集的参数包括下列至少一个：
    所述置换互补序列集中成员序列的长度N、所述成员序列的个数M、以及所述置换互补序列集中零相关区的长度Z，Z是大于或等于1的整数。
  3. 根据权利要求2所述的方法，其特征在于，所述置换互补序列集的个数为
    Figure PCTCN2022130960-appb-100001
    其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
    Figure PCTCN2022130960-appb-100002
    其中，N大于或等于M，M大于或等于Z，M能被Z整除，k∈{1,2,...,Z-1}，
    Figure PCTCN2022130960-appb-100003
    所述置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
    Figure PCTCN2022130960-appb-100004
    表示为：
    Figure PCTCN2022130960-appb-100005
    其中，m＝p×Z+q，
    Figure PCTCN2022130960-appb-100006
    q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
    Figure PCTCN2022130960-appb-100007
    表示有限域
    Figure PCTCN2022130960-appb-100008
    中的置换操作，
    Figure PCTCN2022130960-appb-100009
    表示有限域
    Figure PCTCN2022130960-appb-100010
    中的置换操作，
    Figure PCTCN2022130960-appb-100011
    表示有限域
    Figure PCTCN2022130960-appb-100012
    中的置换操作。
  4. 根据权利要求3所述的方法，其特征在于，N＝M＝Z。
  5. 根据权利要求3所述的方法，其特征在于，N>M＝Z。
  6. 根据权利要求3所述的方法，其特征在于，N>M>Z。
  7. 根据权利要求2所述的方法，其特征在于，所述置换互补序列集是候选置换互补序列集中的部分序列集，所述候选置换互补序列集的个数为
    Figure PCTCN2022130960-appb-100013
    其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
    Figure PCTCN2022130960-appb-100014
    其中，N>M>Z，M能被Z整除，k∈{1,2,...,Z-1}，
    Figure PCTCN2022130960-appb-100015
    所述置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
    Figure PCTCN2022130960-appb-100016
    表示为：
    Figure PCTCN2022130960-appb-100017
    其中，m＝p×Z+q，
    Figure PCTCN2022130960-appb-100018
    q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
    Figure PCTCN2022130960-appb-100019
    表示有限域
    Figure PCTCN2022130960-appb-100020
    中的置换操作，
    Figure PCTCN2022130960-appb-100021
    表示有限域
    Figure PCTCN2022130960-appb-100022
    中的置换操作，
    Figure PCTCN2022130960-appb-100023
    表示有限域
    Figure PCTCN2022130960-appb-100024
    中的置换操作。
  8. 根据权利要求7所述的方法，其特征在于，所述置换互补序列集为所述候选置换互补序列集中l属于下列集合的序列集：
    Figure PCTCN2022130960-appb-100025
    其中，f是正整数。
  9. 根据权利要求1至8任一项所述的方法，其特征在于，所述基于所述置换互补序列集发送信号，包括：
    从所述置换互补序列集中确定目标置换互补序列集；
    将所述目标置换互补序列集映射到N个成员符号和M个子载波上，生成所述信号，并发送所述信号。
  10. 根据权利要求1至9任一项所述的方法，其特征在于，所述基于所述置换互补序列集发送信号，包括：
    终端设备基于所述置换互补序列集向网络设备发送随机接入信号。
  11. 根据权利要求10所述的方法，其特征在于，所述成员序列长度N和成员序列个数M是所述网络设备向所述终端设备发送的，或者，是协议约定的。
  12. 一种信号传输装置，其特征在于，包括：
    处理单元，用于确定置换互补序列集，所述置换互补序列集包括M个成员序列，所述成员序列包括N个成员符号，M和N均是大于1的整数，所述成员符号是对所述置换互补序列集的参数进行置换操作得到的，所述置换操作为有限域内的单一映射操作，所述置换互补序列集满足非周期相关性；
    收发单元，用于基于所述置换互补序列集发送信号。
  13. 根据权利要求12所述的装置，其特征在于，所述置换互补序列集的参数包括下列至少一个：
    所述置换互补序列集中成员序列的长度N、所述成员序列的个数M、以及所述置换互补序列集中零相关区的长度Z。
  14. 根据权利要求13所述的装置，其特征在于，所述置换互补序列集的个数为
    Figure PCTCN2022130960-appb-100026
    其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
    Figure PCTCN2022130960-appb-100027
    其中，N大于或等于M，M大于或等于Z，M能被Z整除，k∈{1,2,...,Z-1}，
    Figure PCTCN2022130960-appb-100028
    所述置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
    Figure PCTCN2022130960-appb-100029
    表示为：
    Figure PCTCN2022130960-appb-100030
    其中，m＝p×Z+q，
    Figure PCTCN2022130960-appb-100031
    q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
    Figure PCTCN2022130960-appb-100032
    表示有限域
    Figure PCTCN2022130960-appb-100033
    中的置换操作，
    Figure PCTCN2022130960-appb-100034
    表示有限域
    Figure PCTCN2022130960-appb-100035
    中的置换操作，
    Figure PCTCN2022130960-appb-100036
    表示有限域
    Figure PCTCN2022130960-appb-100037
    中的置换操作。
  15. 根据权利要求14所述的装置，其特征在于，N＝M＝Z。
  16. 根据权利要求14所述的装置，其特征在于，N>M＝Z。
  17. 根据权利要求14所述的装置，其特征在于，N>M>Z。
  18. 根据权利要求13所述的装置，其特征在于，所述置换互补序列集是候选置换互补序列集中的部分序列集，所述候选置换互补序列集的个数为
    Figure PCTCN2022130960-appb-100038
    其中，第k组置换互补序列集中第l个置换互补序列集s [k][l]表示为：
    Figure PCTCN2022130960-appb-100039
    其中，N>M>Z，M能被Z整除，k∈{1,2,...,Z-1}，
    Figure PCTCN2022130960-appb-100040
    所述置换互补序列集s [k][l]中第m个成员序列的第n个成员符号
    Figure PCTCN2022130960-appb-100041
    表示为：
    Figure PCTCN2022130960-appb-100042
    其中，m＝p×Z+q，
    Figure PCTCN2022130960-appb-100043
    q∈{0,1,...,Z-1}，n∈{0,1,...,N-1}，
    Figure PCTCN2022130960-appb-100044
    表示有限域
    Figure PCTCN2022130960-appb-100045
    中的置换操作，
    Figure PCTCN2022130960-appb-100046
    表示有限域
    Figure PCTCN2022130960-appb-100047
    中的置换操作，
    Figure PCTCN2022130960-appb-100048
    表示有限域
    Figure PCTCN2022130960-appb-100049
    中的置换操作。
  19. 根据权利要求18所述的装置，其特征在于，所述置换互补序列集为所述候选置换互补序列集中l属于下列集合的序列集：
    Figure PCTCN2022130960-appb-100050
    其中，f是正整数。
  20. 根据权利要求12至19任一项所述的装置，其特征在于，所述处理单元还用 于：
    从所述置换互补序列集中确定目标置换互补序列集；
    将所述目标置换互补序列集映射到N个成员符号和M个子载波上，生成所述信号；
    所述收发单元还用于：发送所述信号。
  21. 根据权利要求12至20任一项所述的装置，其特征在于，所述收发单元还用于：
    基于所述置换互补序列集向网络设备发送随机接入信号。
  22. 根据权利要求21所述的装置，其特征在于，所述成员序列长度N和成员序列个数M是所述网络设备向所述装置发送的，或者，是协议约定的。
  23. 一种信号传输装置，其特征在于，包括：处理器，所述处理器与存储器耦合，所述存储器用于存储计算机程序，当所述处理器调用所述计算机程序时，使得所述装置执行如权利要求1至11中任一项所述的方法。
  24. 一种计算机可读存储介质，其特征在于，用于存储计算机程序，所述计算机程序包括用于实现如权利要求1至11中任一项所述的方法的指令。
  25. 一种计算机程序产品，其特征在于，包括计算机程序，当所述计算机程序被运行时，使得计算机执行如权利要求1至11中任一项所述的方法。
PCT/CN2022/130960 2022-11-09 2022-11-09 信号传输方法和装置 Ceased WO2024098301A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
CN202280101360.3A CN120153613A (zh) 2022-11-09 2022-11-09 信号传输方法和装置
EP22964775.5A EP4611324A4 (en) 2022-11-09 2022-11-09 METHOD AND APPARATUS FOR SIGNAL TRANSMISSION
PCT/CN2022/130960 WO2024098301A1 (zh) 2022-11-09 2022-11-09 信号传输方法和装置
US19/204,328 US20250274814A1 (en) 2022-11-09 2025-05-09 Signal transmission method and apparatus

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2022/130960 WO2024098301A1 (zh) 2022-11-09 2022-11-09 信号传输方法和装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US19/204,328 Continuation US20250274814A1 (en) 2022-11-09 2025-05-09 Signal transmission method and apparatus

Publications (1)

Publication Number Publication Date
WO2024098301A1 true WO2024098301A1 (zh) 2024-05-16

Family

ID=91031548

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/130960 Ceased WO2024098301A1 (zh) 2022-11-09 2022-11-09 信号传输方法和装置

Country Status (4)

Country Link
US (1) US20250274814A1 (zh)
EP (1) EP4611324A4 (zh)
CN (1) CN120153613A (zh)
WO (1) WO2024098301A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117254892A (zh) * 2022-06-10 2023-12-19 华为技术有限公司 信息交互方法及相关装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101355374A (zh) * 2007-07-24 2009-01-28 重庆无线绿洲通信技术有限公司 一种无干扰准同步码分多址通信系统的信号生成方法
CN102291197A (zh) * 2011-05-19 2011-12-21 重庆大学 组间正交互补序列集的生成方法
US20200136697A1 (en) * 2018-10-27 2020-04-30 Fudan University Cs-based omnidirectional beamforming design method in uniform rectangular arrays

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6567482B1 (en) * 1999-03-05 2003-05-20 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for efficient synchronization in spread spectrum communications

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101355374A (zh) * 2007-07-24 2009-01-28 重庆无线绿洲通信技术有限公司 一种无干扰准同步码分多址通信系统的信号生成方法
CN102291197A (zh) * 2011-05-19 2011-12-21 重庆大学 组间正交互补序列集的生成方法
US20200136697A1 (en) * 2018-10-27 2020-04-30 Fudan University Cs-based omnidirectional beamforming design method in uniform rectangular arrays

Non-Patent Citations (1)

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

Also Published As

Publication number Publication date
CN120153613A (zh) 2025-06-13
US20250274814A1 (en) 2025-08-28
EP4611324A4 (en) 2026-03-11
EP4611324A1 (en) 2025-09-03

Similar Documents

Publication Publication Date Title
US11323973B2 (en) Information sending and receiving method and related device
US10873434B2 (en) Signal processing method and apparatus
EP3863204B1 (en) Method for transmitting synchronization signal, network apparatus, and terminal apparatus
CN110741715B (zh) 随机接入前导码传输方法及装置
CN110226342B (zh) 发送参考信号的方法和装置及接收参考信号的方法和装置
RU2721757C1 (ru) Способ и устройство для передачи информации
WO2021195975A1 (zh) 传输参考信号的方法和装置
CN109462891B (zh) 检测窗指示方法及装置
CN111684731B (zh) 通信方法、通信设备和网络设备
WO2022006851A1 (zh) 无线通信方法、终端设备和网络设备
US11509440B2 (en) Method and apparatus for indicating synchronization signal block group indication information within synchronization signal blocks
CN114667685B (zh) 通信方法和装置
US20250274814A1 (en) Signal transmission method and apparatus
WO2023236823A1 (zh) 基于uwb的ppdu传输方法及相关装置
EP4576694A1 (en) Communication method and related apparatus
JP2025529826A (ja) 信号処理方法および装置
CN108476059A (zh) 一种信号的发送方法、接收方法、终端设备、基站及系统
CN119922711A (zh) 信号传输方法和传输装置
CN109309554B (zh) 通信方法和通信设备
WO2025077852A1 (zh) 信号传输方法和传输装置
CN120547694A (zh) 通信方法和通信装置
WO2024065196A1 (zh) 数据传输方法及装置
WO2026016828A1 (zh) 一种通信方法、装置及系统
WO2025102742A1 (zh) 通信方法和通信装置
WO2024255260A1 (zh) 通信方法和通信装置

Legal Events

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

Ref document number: 22964775

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 202280101360.3

Country of ref document: CN

WWE Wipo information: entry into national phase

Ref document number: 2022964775

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2022964775

Country of ref document: EP

Effective date: 20250527

NENP Non-entry into the national phase

Ref country code: DE

WWP Wipo information: published in national office

Ref document number: 202280101360.3

Country of ref document: CN

WWP Wipo information: published in national office

Ref document number: 2022964775

Country of ref document: EP