Signal transmission method and apparatus, and device, storage medium and product

Abstract

Disclosed in the present disclosure is a signal transmission method. The method comprises: sending a first signal, wherein the first signal comprises N orthogonal frequency division multiplexing symbols, or N transmission units with the length of T, N and T being positive integers; the N orthogonal frequency division multiplexing symbols comprise a first orthogonal frequency division multiplexing symbol and a second orthogonal frequency division multiplexing symbol, the first orthogonal frequency division multiplexing symbol bearing M on-off keying bits, and the second orthogonal frequency division multiplexing symbol bearing P on-off keying bits; and the N transmission units with the length of T comprise a first transmission unit and a second transmission unit, the first transmission unit bearing M on-off keying bits, the second transmission unit bearing P on-off keying bits, M and P being positive integers, and M not being equal to P. Further disclosed in the present disclosure are a signal transmission apparatus, a communication device, a computer-readable storage medium, and a computer program product.

Description

Signal transmission method, device, equipment, storage medium and product

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This disclosure is based on and claims the priority of Chinese patent application with application number 202410383031.3 and application date March 29, 2024. The entire content of this Chinese patent application is incorporated herein by reference into this disclosure. Technical Field

[0003] The present disclosure relates to, but is not limited to, the field of communications, and in particular to a signal transmission method, a signal transmission apparatus, a communication device, a computer-readable storage medium, and a computer program product. Background Art

[0004] Currently, to support ultra-low power consumption in the μW range, terminals must select a signal modulation scheme when designing cellular passive Ambient Internet of Things (A-IoT). A commonly used modulation scheme is on-off keying (OOK), such as OOK-1 and OOK-4. OOK modulation modulates the amplitude of the carrier signal to 0 or 1. The receiver then uses envelope detection to detect the amplitude and demodulates the resulting sequence of 0s and 1s.

[0005] In A-IOT design, the complexity of hardware updates is reduced, and the hardware architecture can be reused as much as possible. For example, when multiplexing the Orthogonal Frequency Division Multiplexing (OFDM) structure and adopting OOK-1 or OOK-4 modulation, it is necessary to insert the CP after the Inverse Fast Fourier Transform (IFFT) transformation, that is, inserting a piece of data at the end of an OFDM symbol into the head of the OFDM symbol. For example, for the OFDM symbol carrying 6 on / off bits in Figure 1; as shown in Figure 1, inserting the CP in the OFDM symbol may result in additional rising or falling edges.

[0006] However, in the decoding method in the related art, bits are determined by hopping. Then, when an OFDM symbol is inserted into the CP, the additional hopping introduced will cause the problem of data decoding errors. Summary of the Invention

[0007] The embodiments of the present disclosure provide a signal transmission method, a signal transmission apparatus, a communication device, a computer-readable storage medium, and a computer program product, which solve the problem of data decoding errors caused by inserting a CP.

[0008] In a first aspect, the present disclosure provides a signal transmission method, comprising:

[0009] Sending a first signal; wherein the first signal includes N orthogonal frequency division multiplexing symbols, or N transmission units of length T; N and T are positive integers;

[0010] The N orthogonal frequency division multiplexing symbols include a first orthogonal frequency division multiplexing symbol and a second orthogonal frequency division multiplexing symbol; the first orthogonal frequency division multiplexing symbol carries M on-off keying bits; the second orthogonal frequency division multiplexing symbol carries P on-off keying bits;

[0011] The N transmission units of length T include a first transmission unit and a second transmission unit; the first transmission unit carries M on-off keying bits; the second transmission unit carries P on-off keying bits; the M and the P are positive integers, and the M is not equal to the P.

[0012] In a second aspect, a signal transmission device is provided, the signal transmission device comprising:

[0013] A sending module, configured to send a first signal; wherein the first signal includes N orthogonal frequency division multiplexing symbols, or N transmission units of length T; N and T are positive integers;

[0014] The N orthogonal frequency division multiplexing symbols include a first orthogonal frequency division multiplexing symbol and a second orthogonal frequency division multiplexing symbol; the first orthogonal frequency division multiplexing symbol carries M on-off keying bits; the second orthogonal frequency division multiplexing symbol carries P on-off keying bits;

[0015] The N transmission units of length T include a first transmission unit and a second transmission unit; the first transmission unit carries M on-off keying bits; the second transmission unit carries P on-off keying bits; the M and the P are positive integers, and the M is not equal to the P.

[0016] According to a third aspect, a communication device is provided, comprising:

[0017] a memory for storing executable instructions;

[0018] The processor is configured to implement the above-mentioned signal transmission method when executing the executable instructions stored in the memory.

[0019] In a fourth aspect, an embodiment of the present disclosure provides a computer-readable storage medium, which stores one or more programs, and the one or more programs can be executed by one or more processors to implement the above-mentioned signal transmission method.

[0020] In a fifth aspect, an embodiment of the present disclosure provides a computer program product, including a computer program, which implements the above-mentioned signal transmission method when executed by a processor.

[0021] By adjusting the number of OOK bits carried within each OFDM symbol, this disclosure addresses the problem of extra OOK signal transitions caused by inserting CPs in the existing OFDM architecture, which can lead to false detections during transition-based detection at the receiver. Furthermore, this disclosure reuses OFDM's CP insertion structure without introducing false detections, requiring minimal hardware modifications. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] FIG1 is a schematic diagram of an OFDM symbol provided by the related art;

[0023] FIG2 is a schematic diagram of a communication system provided by an embodiment of the present disclosure;

[0024] FIG3 is an example diagram of OOK symbol generation using OOK-1 according to an embodiment of the present disclosure;

[0025] FIG4 is an example diagram of OOK symbol generation using OOK-4 according to an embodiment of the present disclosure;

[0026] FIG5 is a schematic diagram of a Manchester decoding method provided by related art

[0027] FIG6 is an example diagram of bit values ​​at the symbol boundaries of three consecutive OFDM symbols provided by an embodiment of the present disclosure;

[0028] FIG7 is a schematic diagram of value combinations corresponding to the intersections of three OFDM symbols provided by an embodiment of the present disclosure;

[0029] FIG8 is a schematic diagram of a combined analysis of OOK waveform transition caused by inserting a CP according to an embodiment of the present disclosure;

[0030] FIG9 is a schematic diagram of solving the CP problem by adjusting the number of OOK bits within an OFDM symbol according to an embodiment of the present disclosure;

[0031] FIG10 is a schematic diagram of a bit stream of Manchester encoding in different manners provided by an embodiment of the present disclosure;

[0032] FIG11 is a flow chart of a signal transmission method according to an embodiment of the present disclosure;

[0033] FIG12 is a second flow chart of a signal transmission method according to an embodiment of the present disclosure;

[0034] FIG13 is a schematic diagram of a first signal provided by an embodiment of the present disclosure;

[0035] FIG14 is a schematic block diagram of a sixth network function provided by an embodiment of the present disclosure;

[0036] FIG15 is a schematic structural diagram of a communication device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0037] The following will describe the technical solutions in the embodiments of the present disclosure in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present disclosure, not all of them. All other embodiments obtained by ordinary technicians in this field based on the embodiments of the present disclosure without making any creative efforts shall fall within the scope of protection of the present disclosure.

[0038] FIG2 is a schematic diagram of a communication system according to an embodiment of the present disclosure.

[0039] As shown in Figure 2, the communication system 100 may include a terminal device 110 and a network device 120. The network device 120 may communicate with the terminal device 110 via an air interface. The terminal device 110 and the network device 120 support multi-service transmission.

[0040] It should be understood that the embodiments of the present disclosure are only illustrative of the communication system 100, but the embodiments of the present disclosure are not limited thereto. That is, the technical solutions of the embodiments of the present disclosure can be applied to various communication systems, such as: Long Term Evolution (LTE) system, LTE Time Division Duplex (TDD), Universal Mobile Telecommunication System (UMTS), Internet of Things (IoT) system, Narrow Band Internet of Things (NB-IoT) system, enhanced Machine-Type Communications (eMTC) system, 5G communication system (also known as New Radio (NR) communication system), or future communication systems.

[0041] In the communication system 100 shown in Figure 2, the network device 120 may be an access network device that communicates with the terminal device 110. The access network device may provide communication coverage for a specific geographical area and may communicate with the terminal device 110 (e.g., user equipment (UE)) located within the coverage area.

[0042] The network device 120 may be an evolved Node B (eNB or eNodeB) in an LTE system, or a Next Generation Radio Access Network (NG RAN) device, or a base station (gNB) in an NR system, or a wireless controller in a Cloud Radio Access Network (CRAN), or the network device 120 may be a relay station, an access point, a vehicle-mounted device, a wearable device, a hub, a switch, a bridge, a router, or a network device in a future evolved Public Land Mobile Network (PLMN), etc.

[0043] The terminal device 110 includes but is not limited to any terminal device connected to the network device 120 or other terminal devices by wired or wireless connection.

[0044] For example, the terminal device 110 may refer to an access terminal, user equipment (UE), a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communication device, a user agent, or a user apparatus. An access terminal may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, an IoT device, a satellite handheld terminal, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in a 5G network, or a terminal device in a future evolution network, etc.

[0045] The terminal device 110 can be used for device-to-device (D2D) communication.

[0046] FIG2 exemplarily shows a base station and two terminal devices. Optionally, the communication system 100 may include multiple base stations, and each base station may include other numbers of terminal devices within its coverage area, which is not limited in the embodiments of the present disclosure.

[0047] It should be noted that Figure 2 merely illustrates a system applicable to the present disclosure. The methods described in the embodiments of the present disclosure are also applicable to other systems. Furthermore, the terms "system" and "network" are often used interchangeably herein. The term "and / or" herein simply describes an association relationship between associated objects, indicating that three possible relationships exist. For example, "A and / or B" can represent: A exists alone, A and B exist simultaneously, or B exists alone. Furthermore, the character " / " generally indicates that the associated objects are in an "or" relationship. It should also be understood that the term "indication" in the embodiments of the present disclosure can be direct, indirect, or indicate an association relationship. For example, "A indicates B" can mean that A directly indicates B, for example, B can obtain information through A; it can also mean that A indirectly indicates B, for example, A indicates C, and B can obtain information through C; or it can mean that A and B have an association relationship. It should also be understood that the term "corresponding" in the embodiments of the present disclosure can mean that two objects have a direct or indirect correspondence relationship, an association relationship, or a relationship between an indicator and the indicated, a configuration and the configured, and so on. It should also be understood that the “predefined” or “predefined rules” mentioned in the embodiments of the present disclosure can be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in devices (for example, including terminal devices and network devices), and the present disclosure does not limit its specific implementation method. For example, predefined can refer to what is defined in the protocol. It should also be understood that in the embodiments of the present disclosure, the “protocol” can refer to a standard protocol in the field of communications, such as the LTE protocol, the NR protocol, and related protocols used in future communication systems, and the present disclosure does not limit this.

[0048] To facilitate understanding of the technical solutions of the embodiments of the present disclosure, the relevant technologies of the embodiments of the present disclosure are described below. The following relevant technologies are optional solutions that can be arbitrarily combined with the technical solutions of the embodiments of the present disclosure, and they all fall within the protection scope of the embodiments of the present disclosure.

[0049] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the art in the art of the present disclosure. The terms used herein are only for the purpose of describing the embodiments of the present disclosure and are not intended to limit the present disclosure.

[0050] Before explaining the present disclosure, the signal transmission method for passive IoT technology in the related art is described here:

[0051] Passive IoT technology offers the advantages of ultra-low cost, ultra-low power consumption, and the absence of battery power. It has broad application prospects in digital information collection across industries such as warehousing, logistics, energy, manufacturing, and agriculture. It is a key component in building the fifth-generation (5G) full-scenario IoT and will provide hundreds of billions of new connections for 5G networks. Current research focuses on two main categories of devices capable of communicating with base stations, such as terminals and tags. The first category has a peak power consumption of 1μW and a limited energy storage capacity, but lacks the ability to amplify uplink and downlink signals. Uplink signals require the use of a carrier provided by an external source. The second category has a peak power consumption of several hundred μW, has energy storage capacity, and is capable of amplifying both uplink and downlink signals. Uplink signals require the use of a carrier provided by an external source, and may also have independent signal generation capabilities.

[0052] To support ultra-low power consumption in the μW range, A-IoT designs require careful selection of waveforms and modulation schemes. Related passive IoT technologies, such as radio frequency identification (RFID), employ double-sideband amplitude shift keying (DSB-ASK), single-sideband amplitude shift keying (SSB-ASK), or phase reverse amplitude shift keying (PR-ASK) modulation schemes.

[0053] In the design process of A-IOT, in addition to considering low complexity, it is also necessary to consider the complexity of upgrading the new wireless / new air interface (New Radio, NR). Reusing the hardware architecture of NR as much as possible in the design can reduce the complexity of hardware updates. Therefore, for downlink transmission, that is, the transmission from the base station to the tag, or the intermediate node, such as the user equipment (User Equipment, UE) to the tag, also known as the forward link, consider using a method based on multi-carrier on-off keying (MC-OOK) modulation. Based on current research, OOK-1 and OOK-4 are more preferred methods. Figure 3 is an example of OOK symbol generation using OOK-1.

[0054] Exemplarily, a low power wake-up signal (LPWUS) including N subcarriers and a traditional NR signal (Legacy NR signal) can be IFFT transformed based on K carriers, and then CP is inserted to obtain an OFDM symbol.

[0055] Option OOK-1: Single-bit in 1 OFDM symbol, SCs of LP-WUS are:

[0056] OOK=1 means all SCs of LPWUS are modulated;

[0057] OOK=0 means all SCs of LPWUS are zero power (from base-band point of view).

[0058] It's important to note that in OOK-1, each OFDM symbol corresponds to an on / off waveform, carrying one bit. This makes it more suitable for low-rate transmission, but its symbol duration is longer, resulting in better coverage. In OOK-1, since the entire symbol carries the same on or off signal, inserting a CP simply increases the symbol length. By setting the length of each bit to the OFDM symbol length, the tag can detect the bit value.

[0059] FIG4 is an example of OOK symbol generation using OOK-4.

[0060] Exemplarily, an LP-WUS sample consisting of M OOK bits uses N subcarriers and a Legacy NR signal, a total of K carriers, to undergo IFFT transformation, and then inserts a CP to obtain an OFDM symbol including a CP. M OOK bits are composed of N' samples (N'samples are generated from M-bits), that is, N'samples are generated from M-bits. Here, M can be 4 bits, such as 1001; the LP-WUS time consisting of N' samples first undergoes signal generation and modification (Signal generation and modification), followed by discrete Fourier transform / least squares; finally, when N' is not equal to N, truncation or other additional modifications (Truncation N'->N and modification) are performed to obtain N subcarriers, which are then subjected to IFFT transformation and CP insertion operations.

[0061] Option OOK-4: In the time domain, one OFDM symbol carries M OOK bits, i.e., Transform M-bit OOK in time domain.

[0062] N SCs of OOK-1are generated by a transformation(DFT / Least square);

[0063] Signal modification may or may NOT be used;

[0064] Truncation or other additional modification may or may NOT be used, if not used, N is the same as N';

[0065] N' can be the same as K.

[0066] It should be noted that OOK-4 allows each OFDM symbol to carry M bits, making it suitable for higher-rate transmission. OOK-4 is used for ease of description only; other names are possible. The above generation method is only one way to achieve M OOK bits per OFDM symbol, but is not limited to this method.

[0067] For the OOK-4 method, each OFDM symbol carries M on / off bits. Inserting a CP may bring about additional rising edges or falling edges. Considering the complexity of tag detection, a possible detection method is to perform bit judgment through rising edges or falling edges. For example, Manchester encoding is used, and there will be a jump in the middle bit of each bit. The receiving end decodes the data by detecting the jump and the interval between adjacent jumps. Figure 5 is a schematic diagram of a Manchester decoding method provided by the related art. If the duration of a data symbol is 2T, the minimum interval of the jump is T. After the decoder is turned on, the signal obtained after Manchester encoding in Figure 1 is searched for the first jump, and then it is judged whether the interval with the previous jump is 2T. Once it is met, the decoder completes synchronization (Sync) with the data clock, judges that the current data is 0 according to the encoding logic, and starts to make subsequent judgments based on the jump to decode (Decode). When the hopping interval is T, the bit data remains the same as the previous bit. When the interval is 2T, an opposite bit is stored. That is, the symbol obtained after decoding in Figure 5 corresponds to 100. Due to tag synchronization errors, the actual interval may not be exactly T or 2T. A certain error range must be maintained, such as within +-50%T.

[0068] The solution of the related technology is to remove the CP when the tag receives it, and then make a judgment. Another solution is not to add CP. For example, taking 15KHz as an example, each OFDM symbol corresponds to 2048Ts (Ts = 1 / 2048 / 15KHz), and each subframe 1ms contains 14 OFDM symbols. The CP length of the first and the seventh OFDM symbols is 160Ts, and the others are 144Ts. There are a total of 144×12+160×2=2048 Ts. Therefore, after no longer inserting CP for each OFDM symbol, there are just 2048Ts left, which constitutes the length of an OFDM symbol. Therefore, the OOK signal is transmitted using a subframe of 15 OFDM symbols without adding CP.

[0069] To address the issue of tag-side envelope detection errors caused by the OFDM architecture's OOK signal generation and the multiplexing CP addition process, two methods have been described above. The first method removes the CP, requiring the tag to remove the CP every M OOK symbols or not decode the corresponding CP length. This increases the complexity of tag implementation, and the CP length is increased every 0.5ms. Accurate CP removal requires the tag to achieve 0.5ms timing. Furthermore, considering the tag's timing error, inaccurate CP removal is likely to occur, leading to decoding errors. Although the second method does not require CP determination, it does not reuse the original IFFT-then-CP addition structure at the transmitting end, such as the base station or intermediate node UE. It also changes the number of OFDM symbols and cannot achieve alignment with the original OFDM symbol level.

[0070] To analyze the potential issues caused by CP, this disclosure considers different scenarios at the boundary between two consecutive OFDM symbols. As shown in Figure 6, consider OFDM symbol n-1 with the last bit value a, OFDM symbol n with the first bit value b and the last bit value c, and OFDM symbol n+1 with the first bit value d. The bit values ​​here refer to the bits after Manchester encoding. For example, if 1 is encoded as 01, the last bit value refers to the 1 in "01."

[0071] The present disclosure considers the possible values ​​of abcd, which has 16 cases in total. As shown in Figure 7, the values ​​of abcd are 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, and 1111.

[0072] The present disclosure takes into account that after the insertion of CP, as shown in Figure 8, the × mark will introduce a jump other than the data bit between OFDM symbol n-1 and OFDM symbol n, resulting in an error in judgment. For other cases, the insertion of CP only leads to a longer duration of bit a or a longer duration of bit b, and does not cause additional jumps. Considering that the label itself will cause sampling errors, the duration of each bit can be tolerated within a certain period of time. Therefore, the terminal needs to consider the CP processing of four cases: 0010, 0011, 1100, and 1101. It can be seen that the case where the CP problem occurs means that a is the same as b, but different from c.

[0073] The present disclosure takes into account the use of Manchester encoding. After Manchester encoding, each information codeword will always be encoded as 01 or 10. That is, when the number of bits M that can be carried by each OFDM symbol is even, the last two bits will definitely have a jump. When b and c in OFDM symbol n are different, if the value of M in OFDM symbol n is reduced by 1 to M-1, the two bits of the last codeword encoded as 10 or 01 will be split, with the first bit carried in OFDM symbol n and the second bit carried in OFDM symbol n+1. In this way, b and c will take the same bit value, solving the CP problem. As shown in Figure 9, this is equivalent to the symbol boundary being located between the two bits of the original last codeword.

[0074] It should be noted that, assuming the number of OOK chips within each OFDM symbol is M (or the number of OOK on / off bits is M, with each off bit being recorded as one bit and each on bit being recorded as one bit), if an OOK-4 structure is used for transmission, then M corresponds to the number of OOK bits within each OFDM symbol in the time domain. Considering that Manchester coding is used before OOK modulation, every two OOK bits correspond to one information bit. Manchester coding, also known as split-phase code, synchronization code, or phase coding, is a coding method that uses level transitions to represent 1 or 0. Its variation rules are simple: each code element is represented by two level signals of different phases, that is, a periodic square wave, but the phases of code 0 and code 1 are exactly opposite. There are two different encoding methods for Manchester coding. Assuming the bit period is 2T, one is that 0 is encoded as a low level in the first T time and a high level in the second T time; 1 is encoded as a high level in the first T time and a low level in the second T time; the other is the opposite, that is, 1 is encoded as a low level in the first T time and a high level in the second T time; 0 is encoded as a high level in the first T time and a low level in the second T time, as shown in Figure 10.

[0075] Based on this, we propose the following solution to solve the false detection problem caused by CP.

[0076] FIG11 is a flow chart of a signal transmission method provided by an embodiment of the present disclosure. As shown in FIG11 , the method is applied to the network device 120 in the communication system 100 shown in FIG2 . The method includes:

[0077] Step 101: Send a first signal.

[0078] The first signal includes N OFDM symbols, or N transmission units of length T; N and T are positive integers;

[0079] The N OFDM symbols include a first OFDM symbol and a second OFDM symbol; the first OFDM symbol carries M OOK bits; the second OFDM symbol carries P OOK bits;

[0080] The N transmission units of length T include a first transmission unit and a second transmission unit; the first transmission unit carries M OOK bits; the second transmission unit carries P OOK bits; M and P are positive integers, and M is not equal to P.

[0081] In an embodiment of the present disclosure, a first device, such as a base station, a relay device, the network device 120 in Figure 2, etc., which is a device that provides communication services for tags, sends a first signal including N OFDM symbols to the tag, such as a device, the terminal device 110 in Figure 2, an active device, and a passive device.

[0082] Here, the tag can be one or multiple. When there is only one tag, the first signal can be sent via an existing media channel to improve compatibility with existing systems and reduce system modification costs. When there are multiple tags, the media plane communication channel that the first device can establish is a one-to-many multicast / broadcast communication channel. This allows the first signal to be sent only once via the established multicast / broadcast communication channel, allowing all other tags to receive it, effectively reducing the number of messages sent.

[0083] In some embodiments, the first OFDM symbol may be any OFDM symbol in the first signal that carries M OOK bits; the second OFDM symbol may be any OFDM symbol in the first signal that carries P OOK bits.

[0084] In some embodiments, the next OFDM symbol of the second OFDM symbol carries M OOK bits; or the next transmission unit of the second transmission unit carries M OOK bits.

[0085] Further, the second OFDM symbol is the first OFDM symbol starting from data transmission; or, the second transmission unit is the first transmission unit starting from data transmission; and, the third OFDM symbol after the second OFDM symbol carries M on-off keying bits; wherein, the third OFDM symbol includes all OFDM symbols in the first signal except the last OFDM symbol and the first OFDM symbol (i.e., the aforementioned second OFDM symbol) or the third OFDM symbol includes all OFDM symbols in the first signal except the first OFDM symbol; or, the third transmission unit after the second transmission unit carries M on-off keying bits; wherein, the third transmission unit includes all transmission units in the first signal except the last transmission unit and the first transmission unit (i.e., the aforementioned second transmission unit) or the third transmission unit includes all transmission units in the first signal except the first transmission unit; that is, during data transmission, M-1 OOK bits are transmitted within one OFDM symbol (or within the time length T corresponding to one OFDM symbol), and all subsequent OFDM symbols transmit M OOK bits. Obviously, in the present disclosure, it is not necessary to judge the bit values ​​at the boundaries of adjacent OFDM frames. The first OFDM frame can be directly transmitted as M-1 bits, followed by M bits, so as to avoid the hopping false detection problem caused by CP.

[0086] In some embodiments, the number of bits carried by the last OFDM symbol among the N OFDM symbols is less than M; or the number of bits carried by the last transmission unit among the N transmission units is less than M.

[0087] In some embodiments, M is equal to P plus 1, that is, P is 1 less than M.

[0088] In some embodiments, M is an even number, for example, M is 6; it should be noted that, considering the use of Manchester encoding, each information bit contains a 0 and a 1, so when M is an even number, the transmission of M-1 bits will inevitably change the value of the last bit, so no additional jumps will be introduced due to the insertion of CP.

[0089] It should be noted that, for OFDM symbol n-1, the last bit value is a, the first bit value of OFDM symbol n is b, the last bit is c, and the first bit value of OFDM symbol n+1 is d. When starting from OFDM symbol n, when M-1 bits are transmitted for the first time, the last bit of this OFDM symbol and the first bit of the next OFDM symbol n+1 correspond to two Manchester bits encoded from the same information bit, one of which must be 0 and the other 1. Therefore, when determining abcd corresponding to the next OFDM symbol n+1, the situation of a=b will not occur. Therefore, no matter whether the next OFDM symbol n+1 is M or M-1, there will be no CP jump. When the next OFDM symbol n+1 still transmits M bits, since the first bit is the second Manchester-coded bit after encoding the last information bit left in the previous OFDM symbol n, the M-1 bits transmitted in OFDM symbol n+1 will cause the last OOK bit of OFDM symbol n+1 and the first bit of OFDM symbol n+2 to be Manchester-coded bits corresponding to the same information bit. Therefore, for example, they are unequal, and thus, there will be no CP jump. Therefore, transmitting M bits in each subsequent OFDM symbol can solve the problem. Since the number of Manchester-coded bits in the last OFDM symbol of data transmission is always an even number, and the first bit is the coded bit left in the previous OFDM symbol, the number of OOK bits carried by the last OFDM symbol will be an odd number.

[0090] In some embodiments, the value of M is such that when a symbol or transmission unit carries P on-off keying bits, the time length of each on-off keying bit, combined with all or part of the cyclic prefix, for example, the sum of 1 / 2 time lengths, is minimized to the duration length of each on-off keying bit when the symbol or transmission unit carries M on-off keying bits.

[0091] Here, specifically for the selection of M value, after reducing to P, that is, M-1 bits, the corresponding values ​​at adjacent OFDM symbols are two consecutive high levels or consecutive low levels, which are judged as 2 bits from the decoding judgment of the receiving end. For the current OFDM symbol, the duration of its first bit is When M bits are used, the duration of each OFDM symbol is In order to avoid the decision problem caused by the large change in the bit duration length, it is necessary to minimize the value of formula (1).

[0092] Derivative of formula (1): Get the minimum value, Considering the 15KHz subcarrier spacing, T CP 4.7us, T OFDM = 66.7µs. Then M = 6.333. Rounding to the nearest integer, M is 6.

[0093] Here, T OFDM Used to represent the duration of OFDM symbols, T CP Used to characterize the duration of the inserted CP.

[0094] An embodiment of the present disclosure provides a signal transmission method, the method comprising: sending a first signal; wherein the first signal includes N orthogonal frequency division multiplexing symbols, or N transmission units of length T; N and T are positive integers; the N orthogonal frequency division multiplexing symbols include a first orthogonal frequency division multiplexing symbol and a second orthogonal frequency division multiplexing symbol; the first orthogonal frequency division multiplexing symbol carries M on-off keying bits; the second orthogonal frequency division multiplexing symbol carries P on-off keying bits; the N transmission units of length T include a first transmission unit and a second transmission unit; the first transmission unit carries M on-off keying bits; the second transmission unit carries P on-off keying bits; M and P are positive integers, and M is not equal to P. That is, the present disclosure solves the problem of additional OOK signal hops caused by reusing the existing OFDM architecture to insert a CP, which causes false detection in hop-based detection at the receiving end, by adjusting the number of OOK bits carried within each OFDM symbol. At the same time, the present disclosure can reuse the OFDM CP insertion structure without introducing false detection, and requires minimal hardware modification.

[0095] FIG12 is a flow chart of a signal transmission method provided by an embodiment of the present disclosure. As shown in FIG12 , the method is applied to the network device 120 in the communication system 100 shown in FIG2 . The method includes:

[0096] Step 201: Determine the number of OOK bits carried by the first OFDM symbol based on a first value corresponding to the last OOK bit in the OFDM symbol preceding the first OFDM symbol in the N OFDM symbols, a second value corresponding to the first OOK bit in the first OFDM symbol, and a third value corresponding to the last OOK bit in the first OFDM symbol.

[0097] or,

[0098] Based on the first value corresponding to the last OOK bit in the transmission unit before the I-th transmission unit in N transmission units, the second value corresponding to the first OOK bit in the I-th transmission unit, and the third value corresponding to the last OOK bit in the I-th transmission unit, determine the number of OOK bits carried by the I-th transmission unit; where I is a positive integer less than or equal to N.

[0099] In some embodiments, if the first value = the second value ≠ the third value, the number of OOK bits carried by the I-th OFDM symbol is determined to be P, or the number of OOK bits carried by the I-th transmission unit is determined to be P; if the first value ≠ the second value, or the first value = the second value = the third value, that is, in other scenarios except the scenario where the first value = the second value ≠ the third value, the number of OOK bits carried by the I-th OFDM symbol is determined to be M, or the number of OOK bits carried by the I-th transmission unit is determined to be M; wherein P is 1 less than M. Taking P = 5 and M = 6 as an example, as shown in Figure 13, the second OFDM symbol carries 5 OOK bits, and the other OFDM symbols carry 6 OOK bits. Here, 1 information bit corresponds to 2 Manchester bits.

[0100] In some embodiments, if the number of OOK bits carried by the 1st OFDM symbol is P, the number of OOK bits carried by the 1+1th OFDM symbol is P; or, if the number of OOK bits carried by the 1st transmission unit is P, the number of OOK bits carried by the 1+1th transmission unit is P. It should be noted that when a certain OFDM symbol is determined to carry M-1 OOK bits, its adjacent subsequent OFDM symbol also carries M-1 OOK bits, then the subsequent OFDM symbols do not need to be based on the last OOK bit in the previous OFDM symbol, the first OOK bit in the current OFDM symbol, and the last OOK bit in the current OFDM symbol. That is, for each transmission of an OFDM symbol carrying M-1 bits, it is necessary to follow it with another OFDM symbol carrying M-1 bits. In this way, if there is no hopping problem caused by CP, the subsequent OFDM symbol will continue to carry M OFDM symbols, and the corresponding information bits are complete, thus achieving higher transmission efficiency.

[0101] In some embodiments, the number of bits carried by the last OFDM symbol among the N OFDM symbols is less than M; or the number of bits carried by the last transmission unit among the N transmission units is less than M.

[0102] In some embodiments, M is equal to P plus 1, that is, P is 1 less than M.

[0103] In some embodiments, M is an even number, for example, M is 6; it should be noted that, considering the use of Manchester encoding, each information bit contains a 0 and a 1, so when M is an even number, the transmission of M-1 bits will inevitably change the value of the last bit, so no additional jumps will be introduced due to the insertion of CP.

[0104] It should be noted that, for OFDM symbol n-1, the last bit value is a, the first bit value of OFDM symbol n is b, the last bit is c, and the first bit value of OFDM symbol n+1 is d. When starting from OFDM symbol n, when M-1 bits are transmitted for the first time, the last bit of this OFDM symbol and the first bit of the next OFDM symbol n+1 correspond to two Manchester bits encoded from the same information bit, one of which must be 0 and the other 1. Therefore, when determining abcd corresponding to the next OFDM symbol n+1, the situation of a=b will not occur. Therefore, no matter whether the next OFDM symbol n+1 is M or M-1, there will be no CP jump. When the next OFDM symbol n+1 still transmits M bits, since the first bit is the second Manchester-coded bit after encoding the last information bit left in the previous OFDM symbol n, the M-1 bits transmitted in OFDM symbol n+1 will cause the last OOK bit of OFDM symbol n+1 and the first bit of OFDM symbol n+2 to be Manchester-coded bits corresponding to the same information bit. Therefore, for example, they are unequal, and thus, there will be no CP jump. Therefore, transmitting M bits in each subsequent OFDM symbol can solve the problem. Since the number of Manchester-coded bits in the last OFDM symbol of data transmission is always an even number, and the first bit is the coded bit left in the previous OFDM symbol, the number of OOK bits carried by the last OFDM symbol will be an odd number.

[0105] In some embodiments, the value of M is such that the ratio of the time length of the OOK bits including the CP when the orthogonal frequency division multiplexing symbol or transmission unit carries P OOK bits to the duration length of each OOK bit when the orthogonal frequency division multiplexing symbol or transmission unit carries M OOK bits is minimized.

[0106] Here, specifically for the selection of M value, after reducing to P, that is, M-1 bits, the corresponding values ​​at adjacent OFDM symbols are two consecutive high levels or consecutive low levels, which are judged as 2 bits from the decoding judgment of the receiving end. For the current OFDM symbol, the duration of its first bit is When M bits are used, the duration of each OFDM symbol is In order to avoid the decision problem caused by the large change in the bit duration length, it is necessary to minimize the value of formula (2).

[0107] Derivative of formula (1): Get the minimum value, Considering the 15KHz subcarrier spacing, TCP 4.7us, T OFDM = 66.7µs. Then M = 6.333. Rounding to the nearest integer, M is 6.

[0108] Here, T OFDM Used to represent the duration of OFDM symbols, T CP Used to characterize the duration of the inserted CP.

[0109] Step 202: Use L subcarriers to transmit the OOK bits in each OFDM symbol, or transmit the OOK bits in each transmission unit.

[0110] Wherein, L is the least common multiple of M and P, or L is not less than the least common multiple of M and P, and is a multiple of 12 of the number of subcarriers in each resource block;

[0111] It should be noted that when OOK-4 is used for downlink transmission of OOK signals in Figure 3, N subcarriers need to be occupied for IFFT transformation. Therefore, when no truncation or modification is required, N'=N. In order to support M or P OFDM symbols of equal length, N needs to be a common multiple of M and P, that is, M-1.

[0112] For example, taking M = 6, the common multiple of 5 and 6 is 30, so 30 subcarriers are needed to generate the OOK signal. If we further consider an integer number of resource blocks (RBs), 36 subcarriers are needed to generate the OOK signal, occupying 3 RBs. We can also consider using the common multiple of M-1, M, and the number of subcarriers in each RB, 12, to generate the OOK signal. When M = 6, this corresponds to 60 subcarriers and 5 RBs.

[0113] An embodiment of the present disclosure provides a signal transmission device, which can be used to implement a signal transmission method provided in the embodiments corresponding to FIG. 11 and FIG. 12 . As shown in FIG. 14 , a signal transmission device 1400 includes:

[0114] The sending module 1401 is used to send a first signal; wherein the first signal includes N orthogonal frequency division multiplexing symbols, or N transmission units of length T; N and T are positive integers; the N orthogonal frequency division multiplexing symbols include a first orthogonal frequency division multiplexing symbol and a second orthogonal frequency division multiplexing symbol; the first orthogonal frequency division multiplexing symbol carries M on-off keying bits; the second orthogonal frequency division multiplexing symbol carries P on-off keying bits; the N transmission units of length T include a first transmission unit and a second transmission unit; the first transmission unit carries M on-off keying bits; the second transmission unit carries P on-off keying bits; M and P are positive integers, and M is not equal to P types.

[0115] In other embodiments of the present disclosure, the next OFDM symbol of the second OFDM symbol carries M on-off keying bits; or the next transmission unit of the second transmission unit carries M on-off keying bits.

[0116] In other embodiments of the present disclosure, the second orthogonal frequency division multiplexing symbol is the first orthogonal frequency division multiplexing symbol at the start of data transmission; or, the second transmission unit is the first transmission unit at the start of data transmission.

[0117] In other embodiments of the present disclosure, M is equal to P plus 1.

[0118] In other embodiments of the present disclosure, M is an even number.

[0119] In other embodiments of the present disclosure, the third orthogonal frequency division multiplexing symbol after the second orthogonal frequency division multiplexing symbol carries M on-off keying bits; wherein, the third orthogonal frequency division multiplexing symbol includes all orthogonal frequency division multiplexing symbols in the first signal except the last orthogonal frequency division multiplexing symbol and the second orthogonal frequency division multiplexing symbol, or the third orthogonal frequency division multiplexing symbol includes all orthogonal frequency division multiplexing symbols in the first signal except the second orthogonal frequency division multiplexing symbol; or, the third transmission unit after the second transmission unit carries M on-off keying bits; wherein, the third transmission unit includes all transmission units in the first signal except the last transmission unit and the second transmission unit, or the third transmission unit includes all transmission units in the first signal except the second transmission unit.

[0120] In other embodiments of the present disclosure, the processing module 1402 is used to determine the number of on-off keying bits carried by the Ith orthogonal frequency division multiplexing symbol based on the first value corresponding to the last on-off keying bit in the previous orthogonal frequency division multiplexing symbol of the Ith orthogonal frequency division multiplexing symbol among N orthogonal frequency division multiplexing symbols, the second value corresponding to the first on-off keying bit in the Ith orthogonal frequency division multiplexing symbol, and the third value corresponding to the last on-off keying bit in the Ith orthogonal frequency division multiplexing symbol; or; determine the number of on-off keying bits carried by the Ith transmission unit based on the first value corresponding to the last on-off keying bit in the previous transmission unit of the Ith transmission unit among N transmission units, the second value corresponding to the first on-off keying bit in the Ith transmission unit, and the third value corresponding to the last on-off keying bit in the Ith transmission unit; wherein I is a positive integer less than or equal to N.

[0121] In other embodiments of the present disclosure, the processing module 1402 is configured to, if the first value is equal to the second value and the second value is not equal to the third value, determine that the number of on-off keying bits carried by the I-th orthogonal frequency division multiplexing symbol is P, or determine that the number of on-off keying bits carried by the I-th transmission unit is P;

[0122] Processing module 1402 is used to determine that the number of on-off keying bits carried by the I-th orthogonal frequency division multiplexing symbol is M, or to determine that the number of on-off keying bits carried by the I-th transmission unit is M if the first value is not equal to the second value, or the first value is equal to the second value and the second value is equal to the third value; wherein P is 1 less than M.

[0123] In other embodiments of the present disclosure, if the number of on-off keying bits carried by the Ith orthogonal frequency division multiplexing symbol is P, the number of on-off keying bits carried by the I+1th orthogonal frequency division multiplexing symbol is P; or, if the number of on-off keying bits carried by the Ith transmission unit is P, the number of on-off keying bits carried by the I+1th transmission unit is P.

[0124] In other embodiments of the present disclosure, the value of M is taken so that the ratio of the sum of the time length of each on-off keying bit when the orthogonal frequency division multiplexing symbol or transmission unit carries P on-off keying bits plus all or part of the cyclic prefix (for example, 1 / 2 time length) to the duration length of each on-off keying bit when the orthogonal frequency division multiplexing symbol or transmission unit carries M on-off keying bits is minimized.

[0125] In other embodiments of the present disclosure, the value of M is 6.

[0126] In other embodiments of the present disclosure, the number of bits carried by the last orthogonal frequency division multiplexing symbol among N orthogonal frequency division multiplexing symbols is less than M; or the number of bits carried by the last transmission unit among N transmission units is less than M.

[0127] In other embodiments of the present disclosure, the processing module 1402 is used to use L subcarriers to transmit the on-off keying bits in each orthogonal frequency division multiplexing symbol, or to transmit the on-off keying bits in each transmission unit; wherein L is the least common multiple of M and P, or L is not less than the least common multiple of M and P, and is a multiple of the number of subcarriers in each resource block.

[0128] The description of the above device embodiment is similar to the description of the above method embodiment, and has similar beneficial effects as the method embodiment. For technical details not disclosed in the device embodiment of the present disclosure, please refer to the description of the method embodiment of the present disclosure for understanding.

[0129] It should be noted that, in the embodiments of the present disclosure, if the above-mentioned signal transmission method is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present disclosure is essentially or the part that contributes to the relevant technology can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for enabling a terminal device to execute all or part of the methods of each embodiment of the present disclosure. The aforementioned storage medium includes: various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM), a magnetic disk or an optical disk. In this way, the embodiments of the present disclosure are not limited to any specific combination of hardware and software.

[0130] FIG15 is a schematic structural diagram of a communication device 1500 provided in an embodiment of the present disclosure. The communication device can be a signal transmission device. The communication device 1500 shown in FIG15 includes a first processor 1510, which can call and execute a computer program from a memory to implement the method in the embodiment of the present disclosure.

[0131] Optionally, as shown in FIG15 , the communication device 1500 may further include a first memory 1520. The first processor 1510 may call and execute a computer program from the first memory 1520 to implement the method in the embodiment of the present disclosure.

[0132] The first memory 1520 may be a separate device independent of the first processor 1510 , or may be integrated into the first processor 1510 .

[0133] Optionally, as shown in FIG15 , the communication device 1500 may further include a transceiver 1530 , and the first processor 1510 may control the transceiver 1530 to communicate with other devices, specifically, to send information or data to other devices, or to receive information or data sent by other devices.

[0134] The transceiver 1530 may include a transmitter and a receiver. The transceiver 1530 may further include an antenna, and the number of antennas may be one or more.

[0135] Optionally, the communication device 1500 may specifically be a signal transmission device in an embodiment of the present disclosure, and the communication device 1500 may implement the corresponding processes implemented by the signal transmission device in each method of the embodiment of the present disclosure. For the sake of brevity, they will not be repeated here.

[0136] In some embodiments, the present disclosure further provides a computer program product, including a computer program, which can be executed by the first processor 1510 of the communication device 1500 to complete the steps of any of the aforementioned methods.

[0137] It should be understood that the processor of the embodiments of the present disclosure may be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above-mentioned method embodiment can be completed by hardware integrated logic circuits in the processor or by software instructions. The above-mentioned processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The various methods, steps, and logic block diagrams disclosed in the embodiments of the present disclosure can be implemented or executed. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the method disclosed in conjunction with the embodiments of the present disclosure can be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium mature in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and, in conjunction with its hardware, completes the steps of the above-mentioned method.

[0138] As an embodiment, the processor may include one or more general-purpose central processing units (CPUs). Each of these processors may be a single-core (single-CPU) processor or a multi-core (multi-CPU) processor. The processor herein may refer to one or more devices, circuits, and / or processing cores for processing data (e.g., executing computer instructions).

[0139] It is understood that the memory in the embodiments of the present disclosure may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory may be a ROM, a programmable read-only memory (Programmable ROM, PROM), an erasable programmable read-only memory (Erasable PROM, EPROM), an electrically erasable programmable read-only memory (Electrically EPROM, EEPROM) or a flash memory. The volatile memory may be a random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM), and direct RAM bus random access memory (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0140] It should be understood that the above-mentioned memories are exemplary but not restrictive. For example, the memories in the embodiments of the present disclosure may also be static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link DRAM (SLDRAM), and direct RAM RAM (DR RAM), etc. In other words, the memories in the embodiments of the present disclosure are intended to include, but are not limited to, these and any other suitable types of memories.

[0141] The embodiment of the present disclosure also provides a computer-readable storage medium for storing a computer program.

[0142] Optionally, the computer-readable storage medium can be applied to the signal transmission device in the embodiments of the present disclosure, and the computer program enables the computer to execute the corresponding processes implemented by the signal transmission device in the various methods of the embodiments of the present disclosure. For the sake of brevity, they will not be repeated here.

[0143] In the above embodiments, all or part of the embodiments may be implemented by software, hardware, firmware, or any combination thereof. When implemented by software, all or part of the embodiments may be implemented in the form of a computer program product.

[0144] The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function according to the embodiment of the present disclosure is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from a website, a computer, a server or a data center by wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) mode to another website, computer, server or data center. The computer-readable storage medium can be any available medium that a computer can store or a data storage device such as a server or data center that includes one or more available media integrations. Available media can be magnetic media, (such as floppy disks, hard disks, tapes), optical media (such as DVDs), or semiconductor media (such as solid-state drives (SSDs)).

[0145] The signal transmission method, signal transmission device, communication equipment, computer-readable storage medium and computer program product provided in the embodiments of the present disclosure are introduced in detail above. Specific examples are used herein to illustrate the principles and implementation methods of the present disclosure. The description of the above embodiments is only used to help understand the method of the present disclosure and its core ideas. At the same time, for those skilled in the art, according to the ideas of the present disclosure, there will be changes in the specific implementation methods and application scopes. In summary, the content of this specification should not be understood as a limitation on the present disclosure.

[0146] It should be understood that “one embodiment” or “an embodiment” or “an embodiment of the present disclosure” or “the aforementioned embodiment” or “some implementation methods” or “some embodiments” mentioned throughout the specification means that the specific features, structures or characteristics related to the embodiment are included in at least one embodiment of the present disclosure. Therefore, “in one embodiment” or “in an embodiment” or “an embodiment of the present disclosure” or “the aforementioned embodiment” or “some implementation methods” or “some embodiments” appearing throughout the specification do not necessarily refer to the same embodiment. In addition, these specific features, structures or characteristics can be combined in one or more embodiments in any suitable manner. It should be understood that in the various embodiments of the present disclosure, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present disclosure. The serial numbers of the embodiments of the present disclosure mentioned above are for description only and do not represent the advantages and disadvantages of the embodiments.

[0147] Unless otherwise specified, any step in the embodiments of the present disclosure performed by a signal transmission device / communications equipment may be performed by a processor of the signal transmission device / communications equipment. Unless otherwise specified, the embodiments of the present disclosure do not limit the order in which the signal transmission device / communications equipment performs the following steps. Furthermore, the data processing methods used in different embodiments may be the same or different.

[0148] In the several embodiments provided in the present disclosure, it should be understood that the disclosed devices and methods can be implemented in other ways. The device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as: multiple units or components can be combined, or can be integrated into another system, or some features can be ignored or not executed. In addition, the coupling, direct coupling, or communication connection between the components shown or discussed can be through some interfaces, and the indirect coupling or communication connection of the devices or units can be electrical, mechanical or other forms.

[0149] The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units; they may be located in one place or distributed across multiple network units; some or all of the units may be selected according to actual needs to achieve the purpose of the scheme of this embodiment.

[0150] In addition, all functional units in the embodiments of the present disclosure may be integrated into one processing unit, or each unit may be separately used as a unit, or two or more units may be integrated into one unit; the above-mentioned integrated units may be implemented in the form of hardware or in the form of hardware plus software functional units.

[0151] The methods disclosed in the several method embodiments provided in this disclosure can be arbitrarily combined without conflict to obtain new method embodiments.

[0152] The features disclosed in the several product embodiments provided in this disclosure can be arbitrarily combined without conflict to obtain new product embodiments.

[0153] The features disclosed in several method or device embodiments provided in this disclosure may be arbitrarily combined without conflict to obtain new method embodiments or device embodiments.

[0154] Those skilled in the art will understand that all or part of the steps of implementing the above-mentioned method embodiment can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer storage medium. When the program is executed, it executes the steps of the above-mentioned method embodiment; and the aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROMs, magnetic disks or optical disks.

[0155] Alternatively, if the above-mentioned integrated unit of the present disclosure is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer storage medium. Based on this understanding, the technical solution of the embodiment of the present disclosure can essentially or in other words, the part that contributes to the relevant technology can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the methods described in each embodiment of the present disclosure. The aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROMs, magnetic disks or optical disks.

[0156] As used in the present disclosure and the appended claims, the singular forms "a," "an," "said," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.

[0157] It should be noted that, in each embodiment involved in the present disclosure, all steps may be executed or part of the steps may be executed, as long as a complete technical solution can be formed.

[0158] The above description is merely an embodiment of the present disclosure, but the scope of protection of the present disclosure is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this disclosure should be included in the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure should be based on the scope of protection of the claims.

Claims

1. A signal transmission method, the method comprising: Sending a first signal; wherein the first signal includes N orthogonal frequency division multiplexing symbols, or N transmission units of length T; N and T are positive integers; The N orthogonal frequency division multiplexing symbols include a first orthogonal frequency division multiplexing symbol and a second orthogonal frequency division multiplexing symbol; the first orthogonal frequency division multiplexing symbol carries M on-off keying bits; the second orthogonal frequency division multiplexing symbol carries P on-off keying bits; The N transmission units of length T include a first transmission unit and a second transmission unit; the first transmission unit carries M on-off keying bits; the second transmission unit carries P on-off keying bits; The M and the P are positive integers, and the M is not equal to the P.

2. The method according to claim 1, characterized in that The next orthogonal frequency division multiplexing symbol of the second orthogonal frequency division multiplexing symbol carries M on-off keying bits; or; The next transmission unit of the second transmission unit carries M on-off keying bits.

3. The method according to claim 2, wherein the second OFDM symbol is the first OFDM symbol at the start of data transmission; or, The second transmission unit is the first transmission unit at the start of data transmission. The method according to any one of claims 1 to 3, wherein M is equal to P plus 1. The method according to any one of claims 1 to 4, wherein M is an even number and P is an odd number.

6. The method according to claim 3, The third orthogonal frequency division multiplexing symbol following the second orthogonal frequency division multiplexing symbol carries M on-off keying bits; wherein, The third orthogonal frequency division multiplexing symbol includes all orthogonal frequency division multiplexing symbols in the first signal except the last orthogonal frequency division multiplexing symbol and the second orthogonal frequency division multiplexing symbol, or the third orthogonal frequency division multiplexing symbol includes all orthogonal frequency division multiplexing symbols in the first signal except the second orthogonal frequency division multiplexing symbol; or, The third transmission unit following the second transmission unit carries M on-off keying bits; wherein the third transmission unit includes all transmission units in the first signal except the last transmission unit and the second transmission unit, or the third transmission unit includes all transmission units in the first signal except the second transmission unit.

7. The method according to any one of claims 1 to 6, further comprising: Determining the number of on-off keying bits carried by the I-th orthogonal frequency division multiplexing symbol based on a first value corresponding to the last on-off keying bit in an orthogonal frequency division multiplexing symbol preceding an I-th orthogonal frequency division multiplexing symbol in the N orthogonal frequency division multiplexing symbols, a second value corresponding to the first on-off keying bit in the I-th orthogonal frequency division multiplexing symbol, and a third value corresponding to the last on-off keying bit in the I-th orthogonal frequency division multiplexing symbol; or; Based on the first value corresponding to the last on-off keying bit in the transmission unit before the I-th transmission unit in N transmission units, the second value corresponding to the first on-off keying bit in the I-th transmission unit, and the third value corresponding to the last on-off keying bit in the I-th transmission unit, determine the number of on-off keying bits carried by the I-th transmission unit; wherein, I is a positive integer less than or equal to N.

8. The method according to claim 7, further comprising: If the first value is equal to the second value and the second value is not equal to the third value, determine that the number of on-off keying bits carried by the I-th orthogonal frequency division multiplexing symbol is P, or determine that the number of on-off keying bits carried by the I-th transmission unit is P; wherein P is 1 less than M.

9. The method according to claim 8, further comprising: If the first value is not equal to the second value, or the first value is equal to the second value and the second value is equal to the third value, determine that the number of on-off keying bits carried by the I-th orthogonal frequency division multiplexing symbol is M, or determine that the number of on-off keying bits carried by the I-th transmission unit is M.

10. The method according to any one of claims 7 to 9, If the number of on-off keying bits carried by the I-th OFDM symbol is P, the number of on-off keying bits carried by the I+1-th OFDM symbol is P; or, If the number of on-off keying bits carried by the I-th transmission unit is P, the number of on-off keying bits carried by the (I+1)-th transmission unit is P.

11. According to the method described in any one of claims 1 to 10, the value of M is taken so that the ratio of the sum of the time length of each on-off keying bit when the orthogonal frequency division multiplexing symbol or transmission unit carries P on-off keying bits plus the whole or part of the time length of the cyclic prefix to the duration length of each on-off keying bit when the orthogonal frequency division multiplexing symbol or transmission unit carries M on-off keying bits is minimized.

12. The method according to claim 11, wherein the value of M is 6.

13. The method according to any one of claims 1 to 12, wherein the number of bits carried by the last orthogonal frequency division multiplexing symbol of the N orthogonal frequency division multiplexing symbols is less than M; or, The number of bits carried by the last transmission unit in the N transmission units is less than M.

14. The method according to any one of claims 1 to 13, further comprising: Using L subcarriers, transmitting an on-off keying bit within each orthogonal frequency division multiplexing symbol, or transmitting an on-off keying bit within each transmission unit; Wherein, L is the least common multiple of M and P, or L is not less than the least common multiple of M and P and is a multiple of the number of subcarriers in each resource block.

15. A signal transmission device, comprising: A sending module, configured to send a first signal; wherein the first signal includes N orthogonal frequency division multiplexing symbols, or N transmission units of length T; N and T are positive integers; The N orthogonal frequency division multiplexing symbols include a first orthogonal frequency division multiplexing symbol and a second orthogonal frequency division multiplexing symbol; the first orthogonal frequency division multiplexing symbol carries M on-off keying bits; the second orthogonal frequency division multiplexing symbol carries P on-off keying bits; The N transmission units of length T include a first transmission unit and a second transmission unit; the first transmission unit carries M on-off keying bits; the second transmission unit carries P on-off keying bits; The M and the P are positive integers, and the M is not equal to the P.

16. A communication device, comprising: a memory for storing executable instructions; The processor is configured to implement the signal transmission method according to any one of claims 1 to 14 when executing the executable instructions stored in the memory. 17 . A computer-readable storage medium storing one or more programs, wherein the one or more programs can be executed by one or more processors to implement the signal transmission method according to claim 1 .

18. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the computer program is used to implement the signal transmission method according to any one of claims 1 to 14.

Images