Information indication method and apparatus, communication device, storage medium, and program product

Abstract

Provided in the present disclosure are an information indication method and apparatus, a communication device, a storage medium, and a program product. The method comprises: a first node sending first indication information to a second node, wherein the first indication information is used to indicate a candidate parameter sequence or a candidate parameter set that can be used when the second node sends a first message to the first node; the candidate parameter sequence or the candidate parameter set contains at least one candidate parameter; and the candidate parameter includes any one of the following: a frequency shift factor R1, a repetition factor R2, and a quantity R3 of square wave periods corresponding to a time length of a single information bit.

Description

Information indication methods and devices, communication equipment, storage media, and program products

[0001] Cross-references to related applications

[0002] This disclosure claims priority to Chinese Patent Application No. 202510122145.7, filed in China on January 24, 2025, the entire contents of which are incorporated herein by reference. Technical Field

[0003] This disclosure relates to the field of wireless communication technology, and in particular to an information indication method and apparatus, communication equipment, storage medium, and program product. Background Technology

[0004] Passive IoT technologies commonly use multiple access methods including slotted-ALOHA and binary tree algorithms. For mobile communications such as 4G and 5G, orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) schemes are typically used.

[0005] The Ambient-IoT (AIoT) currently under research can be seen as an extension and upgrade of traditional Radio Frequency Identification (RFID) systems. In traditional RFID systems, multiple tags are accessed using the ALOHA algorithm and binary tree algorithm. While existing technologies have solved the user access problem to some extent, they are not well-suited for user access in AIoT scenarios. Summary of the Invention

[0006] To address the aforementioned technical problems, this disclosure provides an information indication method and apparatus, a communication device, a computer storage medium, and a computer program product.

[0007] The information indication method provided in this disclosure includes:

[0008] The first node sends a first indication information to the second node, the first indication information being used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending a first message to the first node;

[0009] The candidate parameter sequence or candidate parameter set contains at least one candidate parameter, and the candidate parameter includes any one of the following:

[0010] Frequency shift factor R1;

[0011] Repetition factor R²;

[0012] The number of square wave periods R3 corresponding to the duration of a single information bit.

[0013] The information indication method provided in this disclosure includes:

[0014] The second node receives the first indication information sent by the first node. The first indication information is used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending the first message to the first node.

[0015] The candidate parameter sequence or candidate parameter set contains at least one candidate parameter, and the candidate parameter includes any one of the following:

[0016] Frequency shift factor R1;

[0017] Repetition factor R²;

[0018] The number of square wave periods R3 corresponding to the duration of a single information bit.

[0019] The information indicating device provided in this embodiment is applied to a first node, and the device includes:

[0020] The sending unit is used to send first indication information to the second node, wherein the first indication information is used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending the first message to the first node.

[0021] The candidate parameter sequence or candidate parameter set contains at least one candidate parameter, and the candidate parameter includes any one of the following:

[0022] Frequency shift factor R1;

[0023] Repetition factor R²;

[0024] The number of square wave periods R3 corresponding to the duration of a single information bit.

[0025] The information indicating device provided in this embodiment is applied to a second node, and the device includes:

[0026] The receiving unit is configured to receive first indication information sent by the first node, wherein the first indication information is used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending a first message to the first node;

[0027] The candidate parameter sequence or candidate parameter set contains at least two candidate parameters, and the candidate parameters include any one of the following:

[0028] Frequency shift factor R1;

[0029] Repetition factor R²;

[0030] The number of square wave periods R3 corresponding to the duration of a single information bit.

[0031] The communication device provided in this embodiment includes a processor and a memory, the memory being used to store a computer program, and the processor being used to call and run the computer program stored in the memory to execute any of the above-described information indication methods.

[0032] The computer-readable storage medium provided in this disclosure is used to store a computer program that causes a computer to execute any of the above-described information indication methods.

[0033] The computer program product provided in this disclosure includes computer program instructions that cause a computer to execute any of the above-described information indication methods.

[0034] In the technical solution of this embodiment, the first node indicates a candidate parameter sequence or a candidate parameter set to the second node, so that the second node can send a first message to the first node according to the candidate parameters in the candidate parameter sequence or the candidate parameter set. The candidate parameters include any one of the following: frequency shift factor R1; repetition factor R2; number of square wave periods R3 corresponding to the time length of a single information bit. The second node selects the candidate parameters in the candidate parameter sequence or the candidate parameter set for access, which can avoid signal interference and is suitable for user access in AIoT scenarios. Attached Figure Description

[0035] Figure 1 is a schematic diagram of the label inventory;

[0036] Figure 2 is a schematic diagram of multiple tags being reused using TDM or FDM.

[0037] Figure 3 is a schematic diagram of the original device signal, the approximate carrier signal, and the modulated device signal;

[0038] Figure 4 is a schematic diagram of the integrated transceiver communication architecture provided in an embodiment of this disclosure;

[0039] Figure 5 is a schematic diagram of a transmit-receive separation communication architecture provided in an embodiment of this disclosure;

[0040] Figure 6 is a flowchart illustrating the information indication method provided in an embodiment of this disclosure;

[0041] Figure 7 is a schematic diagram of subcarrier modulation under different R values ​​provided in the embodiments of this disclosure;

[0042] Figure 8 is a normalized power spectral density diagram of Miller encoding and Manchester encoding provided in the embodiments of this disclosure;

[0043] Figure 9 is a power spectral density diagram of Miller-encoded parallel transmission single-sideband power spectral density provided in an embodiment of this disclosure;

[0044] Figure 10 is a power spectral density diagram of Manchester-coded parallel transmission single-sideband provided in an embodiment of this disclosure;

[0045] Figure 11 is a schematic diagram of the attenuation of different harmonics provided in the embodiments of this disclosure;

[0046] Figure 12 is a schematic diagram of the available bandwidth of the second node provided in an embodiment of this disclosure;

[0047] Figure 13 is a schematic diagram of the frequency shift bandwidth range of the second node under the condition of sampling frequency offset provided in the embodiments of this disclosure;

[0048] Figure 14 is a schematic diagram of harmonic interference corresponding to different R values ​​provided in the embodiments of this disclosure;

[0049] Figure 15 is a schematic diagram of harmonic interference corresponding to different R values ​​provided in the embodiments of this disclosure;

[0050] Figure 16 is a second schematic flowchart of the information indication method provided in an embodiment of this disclosure;

[0051] Figure 17 is a schematic diagram of the structural composition of the information indication device provided in an embodiment of this disclosure;

[0052] Figure 18 is a schematic diagram of the structural composition of the information indication device provided in an embodiment of this disclosure;

[0053] Figure 19 is a schematic structural diagram of a communication device provided in an embodiment of this disclosure;

[0054] Figure 20 is a schematic structural diagram of a chip according to an embodiment of this disclosure. Detailed Implementation

[0055] It should be noted that the term "and / or" in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / " in this document generally indicates that the preceding and following related objects have an "or" relationship. It should also be understood that "instruction" mentioned in this document can be direct instruction, indirect instruction, or an indication of a related relationship. For example, A instructing B can mean that A directly instructs B, for example, B can be obtained through A; it can also mean that A indirectly instructs B, for example, A instructs C, B can be obtained through C; or it can mean that there is a related relationship between A and B. Furthermore, it should be understood that "protocol" mentioned in this document can refer to standard protocols in the field of communication, such as the NR protocol and related protocols applied in future communication systems; this disclosure does not limit this.

[0056] To facilitate understanding of the technical solutions of the embodiments of this disclosure, the relevant technologies of the embodiments of this disclosure will be described below.

[0057] RFID is the most representative passive Internet of Things (IoT) technology. An RFID system consists of tags, readers, and a control platform. The reader uses inductive coupling or backscatter coupling principles to send electromagnetic wave signals to the tag. The tag converts the electromagnetic wave signals into energy, activating the tag chip and sending back information, thus achieving tag identification. Mainstream RFID systems support multiple frequency bands. Among them, ultra-high frequency (850MHz~910MFz) RFID systems are based on electromagnetic wave backscattering technology, with a theoretical transmission distance of 1-10 meters. They have a wide range of applications, including logistics, manufacturing, aviation, and many other industries.

[0058] Ambient IoT, or AIoT for short, is a passive form of IoT, and can be seen as an extension and upgrade of traditional RFID systems. Traditional RFID systems use slotted ALOHA and binary tree algorithms to connect multiple tags.

[0059] Taking the slotted ALOHA algorithm as an example, Figure 1 shows an example of tag inventory in an RFID system. A query command initiates an inventory round, carrying parameter Q; the reader uses parameter Q to adjust the probability of tag response, controlling the number of time slots for the response. Upon receiving a query command or a query adjust command, the tag preloads a value between 0 and 2 into its slot counter. Q The tag receives a value between -1 and 1. Each time a new QueryRep is received, the tag decrements its slot counter by 1 and backscatters RN16 when its slot counter reaches zero. RN16 is a 16-bit random or pseudo-random number generated by the tag. When only one tag responds with RN16, as shown in Figure 1, the reader can obtain the information the tag needs. When multiple tags respond with RN16 in the same slot, a collision occurs, and the inventory of conflicting tags fails. Similarly, there may be slots where no tag meets the response conditions.

[0060] Due to the low cost of the tags, they lack a high-precision internal clock and cannot achieve precise position synchronization. Transmission from the tag to the reader is timed via commands sent by the reader. For example, as shown in Figure 1, each message sent from the tag to the reader requires first receiving a command message from the reader.

[0061] In AIoT design, slotted-ALOHA is currently used as the starting point for research. However, slotted-ALOHA in RFID systems can only achieve sequential communication between the reader and the tag, resulting in relatively low inventory efficiency. In AIoT discussions, to improve inventory efficiency, it has been proposed to support time-division multiplexing (TDM) or frequency-division multiplexing (FDM) between tags. Figure 2 shows an example of multiple tags using TDM or FDM when a tag responds to a paging command from the base station. In the figure, if multiple tags respond to Msg3, TDM or FDM transmission will also occur.

[0062] The technical solutions disclosed herein are primarily designed for FDM (Frequency Division Multiple Access). For AIoT devices based on backscattering, baseband processing enables small frequency shifts to achieve frequency division multiple access while suppressing interference. Several methods for achieving small frequency shifts are investigated for Binary Phase Shift Keying (BPSK) and On-Off Keying (OOK).

[0063] Table 1 Frequency shifting methods

[0064] Based on the above research, it can be seen that in order to apply FDMA, a parameter R needs to be introduced. This parameter can be called a frequency shift factor, a small frequency shift factor, a small frequency shift (SFS) factor, a repetition number, or the number of square wave periods corresponding to the duration of a single information bit, etc. The technical solutions of this disclosure do not limit the name of this parameter.

[0065] Unlike traditional FDMA technology where the network directly indicates frequency resources and the terminal maps data to the corresponding frequency domain location, AIoT devices require frequency shifting based on constraints such as data rate and parameter R. As shown in Table 1 above, different frequency shifting methods all require the use of square waves. A characteristic of square waves is the presence of harmonics; therefore, the modulated device signal will contain harmonics.

[0066] If the approximate carrier has a period of For a square wave, the time-domain expression for the approximate carrier wave is:

[0067] Correspondingly, the frequency domain expression for the approximate carrier is:

[0068] As can be seen from the above formula, a periodic square wave at odd multiples of f... bs There are frequency components in the area.

[0069] In the time domain, the original device signal x(t) is compared with the approximate carrier signal s. m Multiplying (t) by (t) yields the modulated device signal y(t) = x(t)s. m (t). In the frequency domain, as shown in Figure 3, the original device signal X(f) and the approximate carrier signal S are compared. m (f) Perform convolution operation to obtain the modulated device signal as follows:

[0070] Therefore, the final modulated device signal will also contain harmonics. How to select parameter R to avoid interference between different devices needs to be addressed. To this end, the following technical solutions according to embodiments of this disclosure are proposed.

[0071] It should be noted that the technical solutions of this disclosure can be applied to AIoT scenarios, such as inventory scenarios in AIoT scenarios.

[0072] It should be noted that the terms "passive Internet of Things", "environmental Internet of Things", "Ambient IoT", and "AIoT" in the embodiments of this disclosure can be used interchangeably.

[0073] It should be noted that, in the embodiments of this disclosure, "first node" refers to a device that provides communication services to the second node. In some implementations, the first node includes at least one of the following: a reader / writer, a base station, a relay node, and a terminal. The first node can be a transceiver integrated device, as shown in Figure 4, where the first node can both send messages to and receive messages sent by the second node; alternatively, the first node can be a transceiver separated device, as shown in Figure 5, where first node A sends messages to the second node, and first node B receives messages sent by the second node.

[0074] It should be noted that the "second node" in this embodiment refers to an AIoT device, which can also be called a passive IoT device or an environmental IoT device. In some implementations, the second node includes at least one of the following: a tag, a terminal.

[0075] It should be noted that the "first message" in this embodiment can be an access message sent by the second node to the first node, but is not limited to this, and can also be any message sent by the second node to the first node.

[0076] Figure 6 is a flowchart illustrating an embodiment of the information indication method provided in this disclosure. As shown in Figure 6, the information indication method includes the following steps:

[0077] Step 601: The first node sends a first indication message to the second node. The first indication message is used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending the first message to the first node. The candidate parameter sequence or candidate parameter set contains at least one candidate parameter, which includes any of the following: frequency shift factor R1; repetition factor R2; number of square wave periods R3 corresponding to the time length of a single information bit.

[0078] In some implementations, the candidate parameter is a frequency shift factor (or simply frequency shift factor), denoted as R1.

[0079] In some implementations, the candidate parameter is a repetition factor, denoted as R2.

[0080] In some implementations, the candidate parameter is the number of square wave periods corresponding to the duration of a single information bit, denoted as R3.

[0081] It should be noted that the technical solutions of this disclosure do not limit the names of the candidate parameters; for example, they can also be small frequency shift factor or SFS factor, etc. In some descriptions, the candidate parameters can be uniformly described as R.

[0082] In this embodiment of the disclosure, the first indication information sent by the first node to the second node includes a sequence of candidate parameters or a set of candidate parameters that the second node can use when sending a first message to the first node; or, the first indication information sent by the first node to the second node is used to indicate the sequence of candidate parameters or a set of candidate parameters that the second node can use when sending a first message to the first node.

[0083] In some implementations, when the candidate parameter sequence or candidate parameter set is predefined and the number of candidate parameter sequences or candidate parameter sets is greater than 1, the first indication information indicates the index of the candidate parameter sequence or candidate parameter set (i.e., the candidate parameter sequence or candidate parameter set that can be used when the second node sends the first message to the first node).

[0084] The second node can select a candidate parameter from the candidate parameter sequence or set and send a first message to the first node using the selected candidate parameter. The candidate parameter sequence or set must contain at least one candidate parameter, which can be understood as containing at least one candidate parameter value, such as at least one R value.

[0085] In some implementations, the first instruction information is sent via broadcast.

[0086] In some implementations, the first indication information is carried in the access signaling, which is transmitted via broadcast.

[0087] In this embodiment of the disclosure, the candidate parameter sequence or candidate parameter set is a subset or the entirety of a certain set. In some implementations, the first node determines the set (which can be understood as the available access resources of the second node) based on a first parameter, the first parameter including at least one of the following: the transmission bandwidth or occupied bandwidth of the second node; the order of harmonic interference that the second node needs to avoid; the available bandwidth of the second node; the sampling frequency offset (SFO) of the second node; the largest candidate parameter value of the second node; the interval of the candidate parameter values ​​of the second node.

[0088] In some implementations, the first parameter may further include at least one of the following: the linear encoding method of the second node; the data rate of the second node.

[0089] In some implementations, the first node determines the maximum candidate parameter value R based on the available bandwidth B of the second node (or the available bandwidth of system transmission) and the data rate r of the second node. max The backscatter link rate (BLF) of each second node and its corresponding candidate parameter value (R).

[0090] It should be noted that in subcarrier modulation, the main parameters affecting the parallel transmission of the second node include the backscatter link frequency (BLF), candidate parameter R, data rate r, and the main lobe width r of the signal power spectrum. b However, this is not the only factor; parameters affecting parallel transmission at the second node can be adjusted by adding or removing some parameters. These parameters are explained below.

[0091] 1. Backscatter Link Rate (BLF): Where T pri This refers to the duration of a high-low pulse. Alternatively, it can be described as the period of a square wave, or the time interval between repetitions of the Manchester encoded codeword. For example, suppose the duration of the information bit "0" (or "1", taking 0 as an example here) is T. inf After being encoded in Manchester, it becomes "10", and the duration of 10 is T. inf So repeating R=2 times becomes T inf If 1010 is transmitted within a certain time period, then at this time T pri For T inf / 2. The corresponding value in Table 1 is T. pri =T inf / 2.

[0092] 2. Candidate Parameter R: The candidate parameter R can be a frequency shift factor, a repetition factor, the number of square wave periods corresponding to the duration of a single information bit, a small frequency shift factor, or an SFS factor, etc. Figure 7 shows the subcarrier modulation schematics under different R values, from top to bottom: R=2, R=4, and R=8. For R=2, the subcarrier signal periodically repeats twice within one level duration of the original signal (e.g., information bit); for R=4, the subcarrier signal periodically repeats four times within one level duration of the original signal; and for R=8, the subcarrier signal periodically repeats eight times within one level duration of the original signal. With the BLF constant, increasing the R value increases the signal duration but decreases the data rate.

[0093] 3. Data rate r: The data rate r is proportional to...

[0094] 4. Main lobe width r b : Main lobe width r b It is the main lobe width of the signal power spectrum.

[0095] It should be noted that the candidate parameter sequence or set is a subset or the entirety of a certain set, which can be understood as the set of R-values. The set of R-values ​​is related to at least one of the following parameters: the transmission bandwidth or occupied bandwidth of the second node; the order of harmonic interference that the second node needs to avoid; the available bandwidth of the second node; the sampling frequency offset of the second node; the largest candidate parameter value of the second node; and the interval between the candidate parameter values ​​of the second node. These parameters are explained below.

[0096] 1. The transmission bandwidth or bandwidth occupied by the second node:

[0097] The transmission bandwidth or occupied bandwidth of the second node specifically refers to the transmission bandwidth or occupied bandwidth of the data transmitted from the second node to the first node (corresponding to the D2R link). Here, the occupied bandwidth includes the guard band in addition to the transmission bandwidth.

[0098] During frequency shifting, the original signal of the second node (i.e., the original device signal) can be either uncoded or coded data. As mentioned in the related technologies above, it can use either linear coding or non-linear coding. Different coding methods may change the spectral characteristics of the original signal, leading to changes in the bandwidth occupied by the original signal. The following examples illustrate this with the parameter configurations of Miller coding and Manchester coding.

[0099] Miller coding: Logic '1's toggle occurs at symbol boundaries, while logic '0's toggle only occurs in the middle of a symbol if two '0's are not consecutive. Miller coding requires more bandwidth than uncoded signals (such as NRZ coding). Because Miller coding may not always involve level toggles within a bit period (especially consecutive '0's), its spectral spread is not as large as Manchester coding. However, due to timing variations, Miller coding has more frequency components than the original signal and typically requires approximately 1.5 times the bandwidth of the original signal.

[0100] Manchester encoding: Each bit has a distinct level transition; logic '1' toggles from high to low in the middle, and logic '0' toggles from low to high in the middle. Because each bit in Manchester encoding is represented as two symbols (a high-low or low-high transition within one cycle), the encoded signal spectrum requires approximately twice the bandwidth of the original signal. Figure 8 shows the normalized power spectral density plots for Miller encoding and Manchester encoding.

[0101] For example, Figures 9 and 10 show the single-sideband power spectral density diagrams for parallel transmission of Miller-coded and Manchester-coded signals with the same BLF and R, respectively. Here, R corresponds to the following settings in Figures 9 and 10: second node 0 does not perform subcarrier modulation, BLF = 5 kbps, or R = 1; second node 1 has BLF1 = 10 kbps and R = 2; second node 2 has BLF2 = 20 kbps and R = 4; and second node 3 has BLF1 = 40 kbps and R = 8. That is, different second nodes use different small-frequency shift factors. It can be seen that for Miller coding, the main lobes of different second nodes can be effectively distinguished; for Manchester coding, the main lobes of signals from different second nodes overlap significantly. It should be noted that when using Manchester coding, parallel transmission of signals from different second nodes requires a larger bandwidth spacing.

[0102] 2. Harmonic interference order to be avoided at the second node:

[0103] The signal modulated by the square wave subcarrier will generate harmonics. The position of the harmonics is determined by the characteristics of the square wave. For example, the harmonics of a periodic square wave appear at odd multiples of the fundamental frequency, and their amplitudes vary according to... The proportional attenuation. Considering the significant energy attenuation of higher-order harmonics, harmonic interference can be disregarded after a certain order; that is, resource allocation only considers interference from a limited number of harmonic orders (such as 1st and 3rd order harmonics). As shown in Figure 11, the 3rd order harmonic attenuates by 9.5 dB compared to the 1st order, the 5th order by approximately 14 dB, and the 7th order by approximately 17 dB. Therefore, considering a small coverage radius, such as when the signal power difference between different tags sent to the reader is not significant, fewer harmonics can be avoided (i.e., fewer harmonic interference orders need to be avoided).

[0104] 3. Available bandwidth of the second node:

[0105] The available bandwidth of a second node specifically refers to the bandwidth allowed for transmission from the second node to the first node. For example, if there is a total bandwidth of 5MHz available for all second node D2R transmissions, then the transmission of any single second node cannot exceed this 5MHz bandwidth.

[0106] For example, as shown in Figure 12, the signal of the second node may be restricted to a certain bandwidth range for transmission, and exceeding this range may affect adjacent band signals. Therefore, it is necessary to ensure that the frequency-shifted signal of the second node and its strong harmonic components are within the available bandwidth (or the available transmission frequency band range).

[0107] 4. Sampling frequency offset of the second node:

[0108] Due to the limited computational processing power of the second node, the generated BLF value may not be accurate, but may deviate within a certain range. For example, Figure 13 shows the frequency shift bandwidth range of the second node under the condition of sampling frequency offset. As shown in Figure 13, the figure illustrates the possible range of each harmonic order of the second node, as well as the actual range of harmonic occurrence. Therefore, the parameter R needs to be configured to avoid the range where strong harmonics of the second node signal may occur.

[0109] 5. The largest candidate parameter value for the second node:

[0110] The maximum candidate parameter value of the second node specifically refers to the upper limit of the candidate parameter value, i.e., R. max In the process of multiple access, when the data rate of the second node is determined, the upper limit of BLF, that is, the maximum value of frequency shift, is also determined.

[0111] 6. The interval of the candidate parameter values ​​for the second node:

[0112] The interval between candidate parameter values ​​of the second node, also known as the R interval or the interval of R values, determines the frequency interval at which the second node performs frequency division multiplexing.

[0113] The set of R values ​​can be determined based on at least one of the following: the transmission bandwidth or occupied bandwidth of the second node, the order of harmonic interference that the second node needs to avoid, the available bandwidth of the second node, the sampling frequency offset of the second node, the maximum candidate parameter value of the second node, and the interval of the candidate parameter values ​​of the second node.

[0114] In some implementations, the constraint condition for the set of R values ​​is: under Miller coding conditions, avoid interference from the 1st, 3rd, and 5th harmonics.

[0115] In some implementations, the corresponding backscatter link frequency (BLF) can be determined based on the candidate parameter R and the data rate r, and its calculation formula is as follows: BLF R =R×r.

[0116] It should be noted that when a candidate parameter sequence or set is a subset or the entirety of a certain set, that set refers to the set of R values. The set of R values ​​includes one or more R values, and the number of R values ​​contained in the set can be understood as the maximum number of second nodes for parallel transmission.

[0117] The following explains the specific implementation of the set (i.e., the set of R values).

[0118] 1. First implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0119] 2,4,8; or,

[0120] 4,6,8.

[0121] The first implementation set is used for the access of the second node with a sampling frequency offset of 0% (i.e., SFO = 0%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 8 (i.e., R...). max =8).

[0122] For example, the sets under different combination methods can be numbered as shown in Table 2 below:

[0123] Table 2 SFO = 0%, R max =8 corresponding to the set of R values

[0124] 2. Second implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0125] 2,4,8; or,

[0126] 2, 8, 12; or,

[0127] 4, 6, 8; or,

[0128] 4, 8, 10; or,

[0129] 6, 8, 12; or,

[0130] 8, 10, 12.

[0131] The second implementation set is used for the access of the second node with a sampling frequency offset of 0% (i.e., SFO = 0%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 12 (i.e., R...). max =12).

[0132] For example, the sets under different combination methods can be numbered as shown in Table 3 below:

[0133] Table 3 SFO = 0%, R max =12 corresponding to the set of R values

[0134] 3. The third implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0135] 2,4,8,14,16;

[0136] 2,8,12,14,16; or,

[0137] 4, 6, 8, 14, 16; or,

[0138] 6, 8, 12, 14, 16; or,

[0139] 4, 8, 10, 14, 16; or,

[0140] 8, 10, 12, 14, 16.

[0141] The third implementation set is used for the access of the second node with a sampling frequency offset of 0% (i.e., SFO = 0%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 16 (i.e., R...). max =16).

[0142] For example, the sets under different combination methods can be numbered as shown in Table 4 below:

[0143] Table 4 SFO = 0%, R max =16 corresponding to the set of R values

[0144] 4. Fourth implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0145] 2,4,8,14,16,18,22,26,28,32; or,

[0146] 2,4,14,16,18,22,24,26,28,32; or,

[0147] 2,8,12,14,16,18,22,26,28,32; or,

[0148] 2,12,14,16,18,22,24,26,28,32; or,

[0149] 2,8,14,16,18,20,22,26,28,32; or,

[0150] 2,14,16,18,20,22,24,26,28,32; or,

[0151] 2,4,8,14,16,22,26,28,30,32; or,

[0152] 2,4,14,16,22,24,26,28,30,32; or,

[0153] 2,8,12,14,16,22,26,28,30,32; or,

[0154] 2,12,14,16,22,24,26,28,30,32; or,

[0155] 2,8,14,16,20,22,26,28,30,32; or,

[0156] 2,14,16,20,22,24,26,28,30,32; or,

[0157] 4,8,10,14,16,18,22,26,28,32; or,

[0158] 4,10,14,16,18,22,24,26,28,32; or,

[0159] 8,10,12,14,16,18,22,26,28,32; or,

[0160] 10,12,14,16,18,22,24,26,28,32; or,

[0161] 8,10,14,16,18,20,22,26,28,32; or,

[0162] 10,14,16,18,20,22,24,26,28,32.

[0163] The fourth implementation set is used for the access of the second node with a sampling frequency offset of 0% (i.e., SFO = 0%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 32 (i.e., R...). max =32).

[0164] For example, the sets under different combination methods can be numbered as shown in Table 5 below:

[0165] Table 5 SFO = 0%, R max =32 corresponding to the set of R values

[0166] 5. Fifth implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0167] 2,4,8,14,16,18,22,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or,

[0168] 2,4,8,14,18,22,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or,

[0169] 2,4,8,16,18,22,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or,

[0170] 2,4,8,18,22,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or,

[0171] 2,4,14,16,18,22,24,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or,

[0172] 2,4,14,18,22,24,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or,

[0173] 2,4,16,18,22,24,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or,

[0174] 2,4,18,22,24,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or,

[0175] 2,4,14,16,18,22,26,28,32,34,36,38,40,44,46,50,52,56,58,62,64; or,

[0176] 2,4,14,18,22,26,28,32,34,36,38,40,44,46,48,50,52,56,58,62,64; or,

[0177] 2,4,16,18,22,26,28,32,34,36,38,40,42,44,46,50,52,56,58,62,64; or,

[0178] 2,4,18,22,26,28,32,34,36,38,40,42,44,46,48,50,52,56,58,62,64; or,

[0179] 2,4,8,14,16,18,22,26,28,32,34,38,44,46,50,52,56,58,60,62,64; or,

[0180] 2,4,8,14,18,22,26,28,32,34,38,44,46,48,50,52,56,58,60,62,64; or,

[0181] 2,4,8,16,18,22,26,28,32,34,38,42,44,46,50,52,56,58,60,62,64; or,

[0182] 2,4,8,18,22,26,28,32,34,38,42,44,46,48,50,52,56,58,60,62,64; or,

[0183] 2,4,14,16,18,22,24,26,28,32,34,38,44,46,50,52,56,58,60,62,64; or,

[0184] 2,4,14,18,22,24,26,28,32,34,38,44,46,48,50,52,56,58,60,62,64; or,

[0185] 2,4,16,18,22,24,26,28,32,34,38,42,44,46,50,52,56,58,60,62,64; or,

[0186] 2,4,18,22,24,26,28,32,34,38,42,44,46,48,50,52,56,58,60,62,64; or,

[0187] 2,4,14,16,18,22,26,28,32,34,38,40,44,46,50,52,56,58,60,62,64; or,

[0188] 2,4,14,18,22,26,28,32,34,38,40,44,46,48,50,52,56,58,60,62,64; or,

[0189] 2,4,16,18,22,26,28,32,34,38,40,42,44,46,50,52,56,58,60,62,64; or,

[0190] 2,4,18,22,26,28,32,34,38,40,42,44,46,48,50,52,56,58,60,62,64; or,

[0191] 2,8,14,16,18,20,22,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or,

[0192] 2,8,14,18,20,22,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or,

[0193] 2,8,16,18,20,22,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or,

[0194] 2,8,18,20,22,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or,

[0195] 2,14,16,18,20,22,24,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or,

[0196] 2,14,18,20,22,24,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or,

[0197] 2,16,18,20,22,24,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or,

[0198] 2,18,20,22,24,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or,

[0199] 2,14,16,18,20,22,26,28,32,34,36,38,40,44,46,50,52,56,58,62,64; or,

[0200] 2,14,18,20,22,26,28,32,34,36,38,40,44,46,48,50,52,56,58,62,64; or,

[0201] 2,16,18,20,22,26,28,32,34,36,38,40,42,44,46,50,52,56,58,62,64; or,

[0202] 2,18,20,22,26,28,32,34,36,38,40,42,44,46,48,50,52,56,58,62,64; or,

[0203] 2,4,8,14,16,22,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or,

[0204] 2,4,8,14,22,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or,

[0205] 2,4,8,16,22,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or,

[0206] 2,4,8,22,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or,

[0207] 2,4,14,16,22,24,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or,

[0208] 2,4,14,22,24,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or,

[0209] 2,4,16,22,24,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or,

[0210] 2,4,22,24,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or,

[0211] 2,4,14,16,22,26,28,30,32,34,36,38,40,44,46,52,54,56,58,62,64; or,

[0212] 2,4,14,22,26,28,30,32,34,36,38,40,44,46,48,52,54,56,58,62,64; or,

[0213] 2,4,16,22,26,28,30,32,34,36,38,40,42,44,46,52,54,56,58,62,64; or,

[0214] 2,4,22,26,28,30,32,34,36,38,40,42,44,46,48,52,54,56,58,62,64; or,

[0215] 2,4,8,14,16,22,26,28,30,32,34,38,44,46,52,54,56,58,60,62,64; or,

[0216] 2,4,8,14,22,26,28,30,32,34,38,44,46,48,52,54,56,58,60,62,64; or,

[0217] 2,4,8,16,22,26,28,30,32,34,38,42,44,46,52,54,56,58,60,62,64; or,

[0218] 2,4,8,22,26,28,30,32,34,38,42,44,46,48,52,54,56,58,60,62,64; or,

[0219] 2,4,14,16,22,24,26,28,30,32,34,38,44,46,52,54,56,58,60,62,64; or,

[0220] 2,4,14,22,24,26,28,30,32,34,38,44,46,48,52,54,56,58,60,62,64; or,

[0221] 2,4,16,22,24,26,28,30,32,34,38,42,44,46,52,54,56,58,60,62,64; or,

[0222] 2,4,22,24,26,28,30,32,34,38,42,44,46,48,52,54,56,58,60,62,64; or,

[0223] 2,4,14,16,22,26,28,30,32,34,38,40,44,46,52,54,56,58,60,62,64; or,

[0224] 2,4,14,22,26,28,30,32,34,38,40,44,46,48,52,54,56,58,60,62,64; or,

[0225] 2,4,16,22,26,28,30,32,34,38,40,42,44,46,52,54,56,58,60,62,64; or,

[0226] 2,4,22,26,28,30,32,34,38,40,42,44,46,48,52,54,56,58,60,62,64; or,

[0227] 2,8,14,16,20,22,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or,

[0228] 2,8,14,20,22,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or,

[0229] 2,8,16,20,22,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or,

[0230] 2,8,20,22,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or,

[0231] 2,14,16,20,22,24,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or,

[0232] 2,14,20,22,24,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or,

[0233] 2,16,20,22,24,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or,

[0234] 2,20,22,24,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or,

[0235] 2,14,16,20,22,26,28,30,32,34,36,38,40,44,46,52,54,56,58,62,64; or,

[0236] 2,14,20,22,26,28,30,32,34,36,38,40,44,46,48,52,54,56,58,62,64; or,

[0237] 2,16,20,22,26,28,30,32,34,36,38,40,42,44,46,52,54,56,58,62,64; or,

[0238] 2,20,22,26,28,30,32,34,36,38,40,42,44,46,48,52,54,56,58,62,64; or,

[0239] 2,4,8,14,16,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or,

[0240] 2,4,8,14,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or,

[0241] 2,4,8,16,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or,

[0242] 2,4,8,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or,

[0243] 2,4,14,16,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or,

[0244] 2,4,14,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or,

[0245] 2,4,16,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or,

[0246] 2,4,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or,

[0247] 2,4,14,16,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or,

[0248] 2,4,14,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or,

[0249] 2,4,16,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or,

[0250] 2,4,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64; or,

[0251] 2,4,8,14,16,22,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or,

[0252] 2,4,8,14,22,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or,

[0253] 2,4,8,16,22,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or,

[0254] 2,4,8,22,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or,

[0255] 2,4,14,16,22,24,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or,

[0256] 2,4,14,22,24,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or,

[0257] 2,4,16,22,24,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or,

[0258] 2,4,22,24,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or,

[0259] 2,4,14,16,22,26,28,32,34,38,40,44,46,50,52,54,56,58,60,62,64; or,

[0260] 2,4,14,22,26,28,32,34,38,40,44,46,48,50,52,54,56,58,60,62,64; or,

[0261] 2,4,16,22,26,28,32,34,38,40,42,44,46,50,52,54,56,58,60,62,64; or,

[0262] 2,4,22,26,28,32,34,38,40,42,44,46,48,50,52,54,56,58,60,62,64; or,

[0263] 2,8,14,16,20,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or,

[0264] 2,8,14,20,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or,

[0265] 2,8,16,20,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or,

[0266] 2,8,20,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or,

[0267] 2,14,16,20,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or,

[0268] 2,14,20,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or,

[0269] 2,16,20,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or,

[0270] 2,20,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or,

[0271] 2,14,16,20,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or,

[0272] 2,14,20,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or,

[0273] 2,16,20,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or,

[0274] 2,20,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64; or,

[0275] 4,6,8,14,16,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or,

[0276] 4,6,8,14,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or,

[0277] 4,6,8,16,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or,

[0278] 4,6,8,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or,

[0279] 4,6,14,16,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or,

[0280] 4,6,14,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or,

[0281] 4,6,16,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or,

[0282] 4,6,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or,

[0283] 4,6,14,16,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or,

[0284] 4,6,14,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or,

[0285] 4,6,16,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or,

[0286] 4,6,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64; or,

[0287] 4,6,8,14,16,22,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or,

[0288] 4,6,8,14,22,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or,

[0289] 4,6,8,16,22,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or,

[0290] 4,6,8,22,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or,

[0291] 4,6,14,16,22,24,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or,

[0292] 4,6,14,22,24,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or,

[0293] 4,6,16,22,24,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or,

[0294] 4,6,22,24,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or,

[0295] 4,6,14,16,22,26,28,32,34,38,40,44,46,50,52,54,56,58,60,62,64; or,

[0296] 4,6,14,22,26,28,32,34,38,40,44,46,48,50,52,54,56,58,60,62,64; or,

[0297] 4,6,16,22,26,28,32,34,38,40,42,44,46,50,52,54,56,58,60,62,64; or,

[0298] 4,6,22,26,28,32,34,38,40,42,44,46,48,50,52,54,56,58,60,62,64; or,

[0299] 6,8,14,16,20,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or,

[0300] 6,8,14,20,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or,

[0301] 6,8,16,20,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or,

[0302] 6,8,20,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or,

[0303] 6,14,16,20,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or,

[0304] 6,14,20,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or,

[0305] 6,16,20,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or,

[0306] 6,20,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or,

[0307] 6,14,16,20,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or,

[0308] 6,14,20,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or,

[0309] 6,16,20,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or,

[0310] 6,20,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64.

[0311] The fifth implementation set is used for the access of the second node with a sampling frequency offset of 0% (i.e., SFO = 0%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 64 (i.e., R...). max =64).

[0312] For example, the sets under different combinations can be numbered as shown in Table 6 below:

[0313] Table 6 SFO = 0%, R max =64 corresponding to the set of R values

[0314] 6. Sixth implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0315] 4,8.

[0316] The sixth implementation set is used for the access of a second node with a sampling frequency offset of 5% (i.e., SFO = 5%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 8 (i.e., R...). max =8).

[0317] For example, the sets under the combination method can be numbered as shown in Table 7 below:

[0318] Table 7 SFO = 5%, R max =8 corresponding to the set of R values

[0319] 7. Seventh implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0320] 4, 8, 16; or,

[0321] 8, 12, 16.

[0322] The seventh implementation set is used for the access of a second node with a sampling frequency offset of 5% (i.e., SFO = 5%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 16 (i.e., R...). max =16).

[0323] For example, the sets under different combinations can be numbered as shown in Table 8 below:

[0324] Table 8 SFO = 5%, R max =16 corresponding to the set of R values

[0325] 8. The eighth implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0326] 2,14,18,22,28; or,

[0327] 2,14,18,22,32; or,

[0328] 2,14,18,26,32.

[0329] The eighth set of implementation methods is used for the access of the second node with a sampling frequency offset of 5% (i.e., SFO = 5%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 32 (i.e., R...). max =32).

[0330] For example, the sets under different combination methods can be numbered as shown in Table 9 below:

[0331] Table 9 SFO = 5%, R max =32 corresponding to the set of R values

[0332] 9. Ninth implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0333] 2,16,24,30,36,42,54,64; or,

[0334] 2,16,24,30,36,42,56,64; or,

[0335] 4,16,24,30,36,42,54,64; or,

[0336] 4,16,24,30,36,42,56,64.

[0337] The ninth implementation set is used for the access of a second node with a sampling frequency offset of 5% (i.e., SFO = 5%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 64 (i.e., R...). max =64).

[0338] For example, the sets under different combination methods can be numbered as shown in Table 10 below:

[0339] Table 10 SFO = 5%, R max =64 corresponding to the set of R values

[0340] 10. The tenth implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0341] 4,8.

[0342] The tenth implementation set is used for the access of a second node with a sampling frequency offset of 10% (i.e., SFO = 10%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 8 (i.e., R...). max =8).

[0343] For example, the sets under the combination method can be numbered as shown in Table 11 below:

[0344] Table 11 SFO = 10%, R max =8 corresponding to the set of R values

[0345] 11. Eleventh implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0346] 4,8; or,

[0347] 6,12; or,

[0348] 8,12.

[0349] The eleventh implementation set is used for the access of the second node with a sampling frequency offset of 10% (i.e., SFO = 10%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 12 (i.e., R...). max =12).

[0350] For example, the sets under different combination methods can be numbered as shown in Table 12 below:

[0351] Table 12 SFO = 10%, R max =12 corresponding to the set of R values

[0352] 12. The twelfth implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0353] 4,8,16.

[0354] The twelfth implementation set is used for the access of the second node with a sampling frequency offset of 10% (i.e., SFO = 10%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 16 (i.e., R...). max =16).

[0355] For example, the sets under different combination methods can be numbered as shown in Table 13 below:

[0356] Table 13 SFO = 10%, R max =16 corresponding to the set of R values

[0357] 13. The thirteenth implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0358] 2,14,20,28; or,

[0359] 2,14,20,30; or,

[0360] 2,16,22,30; or,

[0361] 2,16,22,32; or,

[0362] 2,16,24,32; or,

[0363] 4,8,16,30; or,

[0364] 4,8,16,32.

[0365] The thirteenth implementation set is used for the access of the second node with a sampling frequency offset of 10% (i.e., SFO = 10%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 32 (i.e., R...). max =32).

[0366] For example, the sets under different combination methods can be numbered as shown in Table 14 below:

[0367] Table 14 SFO = 10%, R max =32 corresponding to the set of R values

[0368] 14. The fourteenth implementation method: The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets:

[0369] 2,14,26,34,52; or,

[0370] 2,16,22,30,40; or,

[0371] 2,16,24,32,58; or,

[0372] 2,16,24,32,60; or,

[0373] 2,16,30,40,58; or,

[0374] 2,16,30,40,60; or,

[0375] 2,16,30,40,62; or,

[0376] 2,20,28,38,50; or,

[0377] 2,22,30,40,54; or,

[0378] 2,22,30,40,56; or,

[0379] 2,22,30,42,54; or,

[0380] 2,22,30,42,56; or,

[0381] 2,22,30,44,56; or,

[0382] 2,24,32,44,58; or,

[0383] 2,24,32,44,60; or,

[0384] 2,24,32,46,60; or,

[0385] 2,26,34,48,62; or,

[0386] 2,26,34,48,64; or,

[0387] 2,26,34,50,64; or,

[0388] 2,26,36,48,64; or,

[0389] 2,26,36,50,64; or,

[0390] 4,8,16,30,58; or,

[0391] 4,8,16,30,60; or,

[0392] 4,8,16,30,62; or,

[0393] 4,8,16,30,64; or,

[0394] 4,8,16,32,58; or,

[0395] 4,8,16,32,60; or,

[0396] 4,8,16,32,62; or,

[0397] 4,8,16,32,64; or,

[0398] 4,8,32,48,62; or,

[0399] 4,8,32,48,64; or,

[0400] 4,16,30,40,58; or,

[0401] 4, 16, 30, 40, 60; or,

[0402] 4,16,30,40,62; or,

[0403] 4,26,34,48,62; or,

[0404] 4,26,34,48,64; or,

[0405] 4,26,34,50,64; or,

[0406] 4,26,36,48,64; or,

[0407] 4,26,36,50,64.

[0408] The fourteenth set of implementation methods is used for the access of the second node with a sampling frequency offset of 10% (i.e., SFO = 10%). Furthermore, the maximum value of the candidate parameters corresponding to this set is 64 (i.e., R...). max =64).

[0409] For example, the sets under different combination methods can be numbered as shown in Table 15 below:

[0410] Table 15 SFO = 10%, R max =64 corresponding to the set of R values

[0411] The above-described scheme of this disclosure embodiment provides SFO = {0%, 5%, 10%}, R max The set of R values ​​without 1st, 3rd, and 5th order harmonic interference when the value is {8, 12, 16, 32, 64}.

[0412] SFO = 0%, R max =8 corresponds to two sets of R values, and the length of each set of R values ​​is 3;

[0413] SFO = 0%, R max =12 corresponds to 6 sets of R values, and the length of each set of R values ​​is 3;

[0414] SFO = 0%, R max =16 corresponds to 6 sets of R values, and the length of each set of R values ​​is 5;

[0415] SFO = 0%, R max =32 corresponds to 18 sets of R values, and the length of each set of R values ​​is 10;

[0416] SFO = 0%, R max =64 corresponds to 144 sets of R values, and the length of each set of R values ​​is 21;

[0417] SFO = 5%, R max =8 corresponds to 1 set of R values, and the length of each set of R values ​​is 2;

[0418] SFO = 5%, R max =16 corresponds to two sets of R values, and the length of each set of R values ​​is 3;

[0419] SFO = 5%, R max =32 corresponds to 3 sets of R values, and the length of each set of R values ​​is 5;

[0420] SFO = 5%, R max=64 corresponds to 4 sets of R values, and the length of each set of R values ​​is 8;

[0421] SFO = 10%, R max =8 corresponds to 1 set of R values, and the length of each set of R values ​​is 2;

[0422] SFO = 10%, R max =12 corresponds to 3 sets of R values, and the length of each set of R values ​​is 2;

[0423] SFO = 10%, R max =16 corresponds to one set of R values, and the length of each set of R values ​​is 3;

[0424] SFO = 10%, R max =32 corresponds to 7 sets of R values, and the length of each set of R values ​​is 4;

[0425] SFO = 10%, R max =64 corresponds to 39 sets of R values, and the length of each set of R values ​​is 5.

[0426] It should be noted that the length of the R-value set refers to the number of R-values ​​contained in the R-value set.

[0427] The technical solutions of the embodiments of this disclosure are illustrated below with specific application examples.

[0428] Application Example 1

[0429] Consider multi-device parallel transmission using Miller coding. The data rate is 5kbps, and the maximum value of R is 12 (i.e., Rmax). max =12), R values ​​are spaced at intervals of 2 (i.e., the minimum BLF interval is 10kbps), the second node has no sampling frequency offset (i.e., SFO = 0%), and the available bandwidth B of the second node is 640kHz. If the carrier frequency transmitted by the first node is f0Hz, then the corresponding transmission bandwidth of the second node is [f0-320, f0+320]kHz. Under this setting, if only the effects of the 1st, 3rd, and 5th order harmonics are considered (i.e., the effects of the 7th order and above harmonics are ignored), there are the following six sets of R values:

[0430] R = {2, 4, 8}; R = {2, 8, 12}; R = {4, 6, 8}; R = {4, 8, 10}; R = {6, 8, 12}; R = {8, 10, 12}. It can be seen that the maximum number of parallel transmissions at the second node is 3. For example, Figure 14 shows schematic diagrams of 1st, 3rd, and 5th order harmonic interference corresponding to different R values.

[0431] Application Example 2

[0432] In practical applications, considering that the crystal oscillator of the second node has a sampling frequency offset, the frequency of its generated signal may have a certain range of offset, which leads to an increase in the bandwidth occupied by the signal of the second node.

[0433] Consider parallel transmission of signals from multiple devices using Miller coding. The data rate is 5 kbps, and the maximum value of R is 12 (i.e., Rmax). max =12), R values ​​are spaced at intervals of 2 (i.e., the minimum BLF interval is 10kbps), the second node has a 10% sampling frequency offset, and the available bandwidth B of the second node is 640kHz. If the carrier frequency transmitted by the first node is f0Hz, then the corresponding data rate range of the second node is [f0-320, f0+320]kbps. Under this setting, if only the effects of the 1st, 3rd, and 5th order harmonics are considered, the following three sets of R values ​​are possible:

[0434] R = {4, 8}; R = {6, 12}; R = {8, 12}. It can be seen that the maximum number of parallel transmissions at the second node is 2. For example, Figure 15 shows schematic diagrams of 1st, 3rd, and 5th order harmonic interference corresponding to different R values.

[0435] The technical solution of this disclosure uses square wave modulation technology to shift the signal of the second node, and by reasonably configuring the R value of the second node, it realizes frequency division multiplexing of multiple devices and improves the system's multiple access efficiency.

[0436] Figure 16 is a second flowchart illustrating the information indication method provided in this embodiment of the present disclosure. As shown in Figure 16, the information indication method includes the following steps:

[0437] Step 1601: The second node receives the first indication information sent by the first node. The first indication information is used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending the first message to the first node. The candidate parameter sequence or candidate parameter set contains at least two candidate parameters, and the candidate parameters include any one of the following: frequency shift factor R1; repetition factor R2; number of square wave periods R3 corresponding to the time length of a single information bit.

[0438] In some implementations, the candidate parameter is a frequency shift factor (or simply frequency shift factor), denoted as R1.

[0439] In some implementations, the candidate parameter is the repetition factor, denoted as R2.

[0440] In some implementations, the candidate parameter is the number of square wave periods corresponding to the duration of a single information bit, denoted as R3.

[0441] It should be noted that the technical solutions of this disclosure do not limit the names of the candidate parameters; for example, they can also be small frequency shift factor or SFS factor, etc. In some descriptions, the candidate parameters can be uniformly described as R.

[0442] In this embodiment of the disclosure, the first indication information sent by the first node to the second node includes a sequence of candidate parameters or a set of candidate parameters that the second node can use when sending a first message to the first node; or, the first indication information sent by the first node to the second node is used to indicate the sequence of candidate parameters or a set of candidate parameters that the second node can use when sending a first message to the first node.

[0443] In some implementations, when the candidate parameter sequence or candidate parameter set is predefined and the number of candidate parameter sequences or candidate parameter sets is greater than 1, the first indication information indicates the index of the candidate parameter sequence or candidate parameter set (i.e., the candidate parameter sequence or candidate parameter set that can be used when the second node sends the first message to the first node).

[0444] The second node can select a candidate parameter from the candidate parameter sequence or set and send a first message to the first node using the selected candidate parameter. The candidate parameter sequence or set must contain at least one candidate parameter, which can be understood as containing at least one candidate parameter value, such as at least one R value.

[0445] In some implementations, the first instruction information is sent via broadcast.

[0446] In some implementations, the first indication information is carried in the access signaling, which is transmitted via broadcast.

[0447] It should be noted that when a candidate parameter sequence or set is a subset or the entirety of a certain set, that set refers to the R-value set. The R-value set includes one or more R-values, and the number of R-values ​​in the R-value set can be understood as the maximum number of second nodes for parallel transmission. The specific implementation of the set (i.e., the R-value set) can be referred to the description of the relevant scheme in Figure 6 above.

[0448] Figure 17 is a schematic diagram of the structure of an information indicating device provided in an embodiment of this disclosure, applied to a first node. As shown in Figure 17, the information indicating device includes:

[0449] The sending unit 1701 is used to send first indication information to the second node. The first indication information is used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending the first message to the first node.

[0450] The candidate parameter sequence or candidate parameter set contains at least one candidate parameter, and the candidate parameter includes any one of the following:

[0451] Frequency shift factor R1;

[0452] Repetition factor R²;

[0453] The number of square wave periods R3 corresponding to the duration of a single information bit.

[0454] It should be noted that when a candidate parameter sequence or set is a subset or the entirety of a certain set, that set refers to the R-value set. The R-value set includes one or more R-values, and the number of R-values ​​in the R-value set can be understood as the maximum number of second nodes for parallel transmission. The specific implementation of the set (i.e., the R-value set) can be referred to the description of the relevant scheme in Figure 6 above.

[0455] In some embodiments, the apparatus further includes: a determining unit 1702, configured to determine the set based on a first parameter, the first parameter including at least one of the following:

[0456] The transmission bandwidth or bandwidth occupied by the second node;

[0457] The order of harmonic interference that needs to be avoided at the second node;

[0458] Available bandwidth of the second node;

[0459] The sampling frequency offset of the second node;

[0460] The largest candidate parameter value for the second node;

[0461] The interval of the candidate parameter values ​​of the second node.

[0462] Those skilled in the art should understand that the functions of each unit in the information indication device shown in Figure 17 can be understood with reference to the relevant description of the aforementioned method. The functions of each unit in the information indication device shown in Figure 17 can be implemented by a program running on a processor, or by specific logic circuits.

[0463] Figure 18 is a schematic diagram of the structure of the information indication device provided in this embodiment of the present disclosure, applied to the second node. As shown in Figure 18, the information indication device includes:

[0464] The receiving unit 1801 is configured to receive first indication information sent by the first node, wherein the first indication information is used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending a first message to the first node;

[0465] The candidate parameter sequence or candidate parameter set contains at least two candidate parameters, and the candidate parameters include any one of the following:

[0466] Frequency shift factor R1;

[0467] Repetition factor R²;

[0468] The number of square wave periods R3 corresponding to the duration of a single information bit.

[0469] It should be noted that when a candidate parameter sequence or set is a subset or the entirety of a certain set, that set refers to the R-value set. The R-value set includes one or more R-values, and the number of R-values ​​in the R-value set can be understood as the maximum number of second nodes for parallel transmission. The specific implementation of the set (i.e., the R-value set) can be referred to the description of the relevant scheme in Figure 6 above.

[0470] Those skilled in the art should understand that the functions of each unit in the information indication device shown in Figure 18 can be understood with reference to the relevant description of the aforementioned method. The functions of each unit in the information indication device shown in Figure 18 can be implemented by a program running on a processor, or by specific logic circuits.

[0471] Figure 19 is a schematic structural diagram of a communication device 1900 provided in an embodiment of this disclosure. The communication device 1900 shown in Figure 19 includes a processor 1910, which can call and run computer programs from memory to implement the methods in the embodiments of this disclosure.

[0472] Optionally, as shown in FIG19, the communication device 1900 may further include a memory 1920. The processor 1910 may retrieve and run computer programs from the memory 1920 to implement the methods in the embodiments of this disclosure.

[0473] The memory 1920 can be a separate device independent of the processor 1910, or it can be integrated into the processor 1910.

[0474] Optionally, as shown in FIG19, the communication device 1900 may further include a transceiver 1930, and the processor 1910 may control the transceiver 1930 to communicate with other devices. Specifically, it may send information or data to other devices or receive information or data sent by other devices.

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

[0476] Optionally, the communication device 1900 may specifically be the first node in the embodiments of this disclosure, and the communication device 1900 may implement the corresponding processes implemented by the first node in the various methods of the embodiments of this disclosure. For the sake of brevity, it will not be described in detail here.

[0477] Optionally, the communication device 1900 may specifically be the second node in the embodiments of this disclosure, and the communication device 1900 may implement the corresponding processes implemented by the second node in the various methods of the embodiments of this disclosure. For the sake of brevity, it will not be described in detail here.

[0478] Figure 20 is a schematic structural diagram of a chip according to an embodiment of the present disclosure. The chip 2000 shown in Figure 20 includes a processor 2010, which can call and run computer programs from memory to implement the methods in the embodiments of the present disclosure.

[0479] Optionally, as shown in FIG20, chip 2000 may further include memory 2020. Processor 2010 may call and run computer programs from memory 2020 to implement the methods in the embodiments of this disclosure.

[0480] The memory 2020 can be a separate device independent of the processor 2010, or it can be integrated into the processor 2010.

[0481] Optionally, the chip 2000 may also include an input interface 2030. The processor 2010 can control the input interface 2030 to communicate with other devices or chips; specifically, it can acquire information or data sent by other devices or chips.

[0482] Optionally, the chip 2000 may also include an output interface 2040. The processor 2010 can control the output interface 2040 to communicate with other devices or chips, specifically, to output information or data to other devices or chips.

[0483] Optionally, the chip can be applied to the first node in the embodiments of this disclosure, and the chip can implement the corresponding processes implemented by the first node in the various methods of the embodiments of this disclosure. For the sake of brevity, it will not be described in detail here.

[0484] Optionally, the chip can be applied to the second node in the embodiments of this disclosure, and the chip can implement the corresponding processes implemented by the second node in the various methods of the embodiments of this disclosure. For the sake of brevity, it will not be described in detail here.

[0485] It should be understood that the chip mentioned in the embodiments of this disclosure may also be referred to as a system-on-a-chip, system chip, chip system, or system-on-a-chip, etc.

[0486] It should be understood that the processor in this disclosure embodiment may be an integrated circuit chip with signal processing capabilities. In implementation, the steps of the above method embodiments can be completed by integrated logic circuits in the processor's hardware or by instructions in software form. The processor described above 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. It can implement or execute the methods, steps, and logic block diagrams disclosed in this disclosure embodiment. The general-purpose processor can be a microprocessor or any conventional processor, etc. The steps of the methods disclosed in the embodiments of this disclosure can be directly embodied as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules can be located in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. The storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method.

[0487] It is understood that the memory in the embodiments of this disclosure can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDR SDRAM), Enhanced Synchronous DRAM (ESDRAM), Synchlink DRAM (SLDRAM), and Direct Rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0488] It should be understood that the above-described memory is exemplary but not limiting. For example, the memory in the embodiments of this 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 dynamic random access memory (SLDRAM), and direct memory bus RAM (DR RAM), etc. That is to say, the memory in the embodiments of this disclosure is intended to include, but is not limited to, these and any other suitable types of memory.

[0489] This disclosure also provides a computer-readable storage medium for storing computer programs.

[0490] Optionally, the computer-readable storage medium may be applied to the first node in the embodiments of this disclosure, and the computer program causes the computer to execute the corresponding processes implemented by the first node in the various methods of the embodiments of this disclosure, which will not be described in detail here for the sake of brevity.

[0491] Optionally, the computer-readable storage medium may be applied to the second node in the embodiments of this disclosure, and the computer program causes the computer to execute the corresponding processes implemented by the second node in the various methods of the embodiments of this disclosure, which will not be described in detail here for the sake of brevity.

[0492] This disclosure also provides a computer program product, including computer program instructions.

[0493] Optionally, the computer program product can be applied to the first node in the embodiments of this disclosure, and the computer program instructions cause the computer to execute the corresponding processes implemented by the first node in the various methods of the embodiments of this disclosure. For the sake of brevity, these will not be described in detail here.

[0494] Optionally, the computer program product can be applied to the second node in the embodiments of this disclosure, and the computer program instructions cause the computer to execute the corresponding processes implemented by the second node in the various methods of the embodiments of this disclosure. For the sake of brevity, these will not be described in detail here.

[0495] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this disclosure.

[0496] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0497] In the several embodiments provided in this disclosure, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0498] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0499] In addition, the functional units in the various embodiments of this disclosure can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0500] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this disclosure, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this disclosure. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0501] The above description is merely a specific embodiment of this disclosure, but the scope of protection of this disclosure is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this disclosure should be included within the scope of protection of this disclosure. Therefore, the scope of protection of this disclosure should be determined by the scope of the claims.

Claims

1. An information indication method, the method comprising: The first node sends a first indication information to the second node, the first indication information being used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending a first message to the first node; The candidate parameter sequence or candidate parameter set contains at least one candidate parameter, and the candidate parameter includes any one of the following: Frequency shift factor R1; Repetition factor R²; The number of square wave periods R3 corresponding to the duration of a single information bit.

2. The method according to claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,4,8; or, 4,6,8。 3. The method according to claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,4,8; or, 2, 8, 12; or, 4, 6, 8; or, 4, 8, 10; or, 6, 8, 12; or, 8,10,12。 4. The method according to claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,4,8,14,16； 2,8,12,14,16; or, 4, 6, 8, 14, 16; or, 6, 8, 12, 14, 16; or, 4, 8, 10, 14, 16; or, 8,10,12,14,16。 5. The method according to claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,4,8,14,16,18,22,26,28,32; or, 2,4,14,16,18,22,24,26,28,32; or, 2,8,12,14,16,18,22,26,28,32; or, 2,12,14,16,18,22,24,26,28,32; or, 2,8,14,16,18,20,22,26,28,32; or, 2,14,16,18,20,22,24,26,28,32; or, 2,4,8,14,16,22,26,28,30,32; or, 2,4,14,16,22,24,26,28,30,32; or, 2,8,12,14,16,22,26,28,30,32; or, 2,12,14,16,22,24,26,28,30,32; or, 2,8,14,16,20,22,26,28,30,32; or, 2,14,16,20,22,24,26,28,30,32; or, 4,8,10,14,16,18,22,26,28,32; or, 4,10,14,16,18,22,24,26,28,32; or, 8,10,12,14,16,18,22,26,28,32; or, 10,12,14,16,18,22,24,26,28,32; or, 8,10,14,16,18,20,22,26,28,32; or, 10,14,16,18,20,22,24,26,28,32。 6. The method of claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,4,8,14,16,18,22,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or, 2,4,8,14,18,22,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or, 2,4,8,16,18,22,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or, 2,4,8,18,22,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or, 2,4,14,16,18,22,24,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or, 2,4,14,18,22,24,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or, 2,4,16,18,22,24,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or, 2,4,18,22,24,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or, 2,4,14,16,18,22,26,28,32,34,36,38,40,44,46,50,52,56,58,62,64; or, 2,4,14,18,22,26,28,32,34,36,38,40,44,46,48,50,52,56,58,62,64; or, 2,4,16,18,22,26,28,32,34,36,38,40,42,44,46,50,52,56,58,62,64; or, 2,4,18,22,26,28,32,34,36,38,40,42,44,46,48,50,52,56,58,62,64; or, 2,4,8,14,16,18,22,26,28,32,34,38,44,46,50,52,56,58,60,62,64; or, 2,4,8,14,18,22,26,28,32,34,38,44,46,48,50,52,56,58,60,62,64; or, 2,4,8,16,18,22,26,28,32,34,38,42,44,46,50,52,56,58,60,62,64; or, 2,4,8,18,22,26,28,32,34,38,42,44,46,48,50,52,56,58,60,62,64; or, 2,4,14,16,18,22,24,26,28,32,34,38,44,46,50,52,56,58,60,62,64; or, 2,4,14,18,22,24,26,28,32,34,38,44,46,48,50,52,56,58,60,62,64; or, 2,4,16,18,22,24,26,28,32,34,38,42,44,46,50,52,56,58,60,62,64; or, 2,4,18,22,24,26,28,32,34,38,42,44,46,48,50,52,56,58,60,62,64; or, 2,4,14,16,18,22,26,28,32,34,38,40,44,46,50,52,56,58,60,62,64; or, 2,4,14,18,22,26,28,32,34,38,40,44,46,48,50,52,56,58,60,62,64; or, 2,4,16,18,22,26,28,32,34,38,40,42,44,46,50,52,56,58,60,62,64; or, 2,4,18,22,26,28,32,34,38,40,42,44,46,48,50,52,56,58,60,62,64; or, 2,8,14,16,18,20,22,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or, 2,8,14,18,20,22,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or, 2,8,16,18,20,22,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or, 2,8,18,20,22,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or, 2,14,16,18,20,22,24,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or, 2,14,18,20,22,24,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or, 2,16,18,20,22,24,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or, 2,18,20,22,24,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or, 2,14,16,18,20,22,26,28,32,34,36,38,40,44,46,50,52,56,58,62,64; or, 2,14,18,20,22,26,28,32,34,36,38,40,44,46,48,50,52,56,58,62,64; or, 2,16,18,20,22,26,28,32,34,36,38,40,42,44,46,50,52,56,58,62,64; or, 2,18,20,22,26,28,32,34,36,38,40,42,44,46,48,50,52,56,58,62,64; or, 2,4,8,14,16,22,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or, 2,4,8,14,22,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or, 2,4,8,16,22,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or, 2,4,8,22,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or, 2,4,14,16,22,24,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or, 2,4,14,22,24,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or, 2,4,16,22,24,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or, 2,4,22,24,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or, 2,4,14,16,22,26,28,30,32,34,36,38,40,44,46,52,54,56,58,62,64; or, 2,4,14,22,26,28,30,32,34,36,38,40,44,46,48,52,54,56,58,62,64; or, 2,4,16,22,26,28,30,32,34,36,38,40,42,44,46,52,54,56,58,62,64; or, 2,4,22,26,28,30,32,34,36,38,40,42,44,46,48,52,54,56,58,62,64; or, 2,4,8,14,16,22,26,28,30,32,34,38,44,46,52,54,56,58,60,62,64; or, 2,4,8,14,22,26,28,30,32,34,38,44,46,48,52,54,56,58,60,62,64; or, 2,4,8,16,22,26,28,30,32,34,38,42,44,46,52,54,56,58,60,62,64; or, 2,4,8,22,26,28,30,32,34,38,42,44,46,48,52,54,56,58,60,62,64; or, 2,4,14,16,22,24,26,28,30,32,34,38,44,46,52,54,56,58,60,62,64; or, 2,4,14,22,24,26,28,30,32,34,38,44,46,48,52,54,56,58,60,62,64; or, 2,4,16,22,24,26,28,30,32,34,38,42,44,46,52,54,56,58,60,62,64; or, 2,4,22,24,26,28,30,32,34,38,42,44,46,48,52,54,56,58,60,62,64; or, 2,4,14,16,22,26,28,30,32,34,38,40,44,46,52,54,56,58,60,62,64; or, 2,4,14,22,26,28,30,32,34,38,40,44,46,48,52,54,56,58,60,62,64; or, 2,4,16,22,26,28,30,32,34,38,40,42,44,46,52,54,56,58,60,62,64; or, 2,4,22,26,28,30,32,34,38,40,42,44,46,48,52,54,56,58,60,62,64; or, 2,8,14,16,20,22,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or, 2,8,14,20,22,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or, 2,8,16,20,22,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or, 2,8,20,22,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or, 2,14,16,20,22,24,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or, 2,14,20,22,24,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or, 2,16,20,22,24,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or, 2,20,22,24,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or, 2,14,16,20,22,26,28,30,32,34,36,38,40,44,46,52,54,56,58,62,64; or, 2,14,20,22,26,28,30,32,34,36,38,40,44,46,48,52,54,56,58,62,64; or, 2,16,20,22,26,28,30,32,34,36,38,40,42,44,46,52,54,56,58,62,64; or, 2,20,22,26,28,30,32,34,36,38,40,42,44,46,48,52,54,56,58,62,64; or, 2,4,8,14,16,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 2,4,8,14,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 2,4,8,16,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 2,4,8,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 2,4,14,16,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 2,4,14,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 2,4,16,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 2,4,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 2,4,14,16,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or, 2,4,14,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or, 2,4,16,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or, 2,4,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64; or, 2,4,8,14,16,22,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or, 2,4,8,14,22,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or, 2,4,8,16,22,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or, 2,4,8,22,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or, 2,4,14,16,22,24,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or, 2,4,14,22,24,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or, 2,4,16,22,24,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or, 2,4,22,24,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or, 2,4,14,16,22,26,28,32,34,38,40,44,46,50,52,54,56,58,60,62,64; or, 2,4,14,22,26,28,32,34,38,40,44,46,48,50,52,54,56,58,60,62,64; or, 2,4,16,22,26,28,32,34,38,40,42,44,46,50,52,54,56,58,60,62,64; or, 2,4,22,26,28,32,34,38,40,42,44,46,48,50,52,54,56,58,60,62,64; or, 2,8,14,16,20,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 2,8,14,20,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 2,8,16,20,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 2,8,20,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 2,14,16,20,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 2,14,20,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 2,16,20,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 2,20,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 2,14,16,20,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or, 2,14,20,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or, 2,16,20,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or, 2,20,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64; or, 4,6,8,14,16,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 4,6,8,14,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 4,6,8,16,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 4,6,8,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 4,6,14,16,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 4,6,14,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 4,6,16,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 4,6,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 4,6,14,16,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or, 4,6,14,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or, 4,6,16,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or, 4,6,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64; or, 4,6,8,14,16,22,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or, 4,6,8,14,22,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or, 4,6,8,16,22,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or, 4,6,8,22,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or, 4,6,14,16,22,24,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or, 4,6,14,22,24,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or, 4,6,16,22,24,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or, 4,6,22,24,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or, 4,6,14,16,22,26,28,32,34,38,40,44,46,50,52,54,56,58,60,62,64; or, 4,6,14,22,26,28,32,34,38,40,44,46,48,50,52,54,56,58,60,62,64; or, 4,6,16,22,26,28,32,34,38,40,42,44,46,50,52,54,56,58,60,62,64; or, 4,6,22,26,28,32,34,38,40,42,44,46,48,50,52,54,56,58,60,62,64; or, 6,8,14,16,20,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 6,8,14,20,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 6,8,16,20,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 6,8,20,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 6,14,16,20,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 6,14,20,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 6,16,20,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 6,20,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 6,14,16,20,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or, 6,14,20,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or, 6,16,20,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or, 6,20,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64。 7. The method according to any one of claims 2 to 6, wherein, The set is used for the access of the second node with a sampling frequency offset of 0%.

8. The method according to claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 4,8。 9. The method according to claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 4, 8, 16; or, 8,12,16。 10. The method according to claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,14,18,22,28; or, 2,14,18,22,32; or, 2,14,18,26,32。 11. The method of claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,16,24,30,36,42,54,64; or, 2,16,24,30,36,42,56,64; or, 4,16,24,30,36,42,54,64; or, 4,16,24,30,36,42,56,64。 12. The method of any one of claims 8-11, wherein, The set is used for the access of a second node with a sampling frequency offset of 5%.

13. The method of claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 4,8。 14. The method of claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 4,8; or, 6,12; or, 8,12。 15. The method of claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 4,8,16。 16. The method of claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,14,20,28; or, 2,14,20,30; or, 2,16,22,30; or, 2,16,22,32; or, 2,16,24,32; or, 4,8,16,30; or, 4,8,16,32。 17. The method of claim 1, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,14,26,34,52; or, 2,16,22,30,40; or, 2,16,24,32,58; or, 2,16,24,32,60; or, 2,16,30,40,58; or, 2,16,30,40,60; or, 2,16,30,40,62; or, 2,20,28,38,50; or, 2,22,30,40,54; or, 2,22,30,40,56; or, 2,22,30,42,54; or, 2,22,30,42,56; or, 2,22,30,44,56; or, 2,24,32,44,58; or, 2,24,32,44,60; or, 2,24,32,46,60; or, 2,26,34,48,62; or, 2,26,34,48,64; or, 2,26,34,50,64; or, 2,26,36,48,64; or, 2,26,36,50,64; or, 4,8,16,30,58; or, 4,8,16,30,60; or, 4,8,16,30,62; or, 4,8,16,30,64; or, 4,8,16,32,58; or, 4,8,16,32,60; or, 4,8,16,32,62; or, 4,8,16,32,64; or, 4,8,32,48,62; or, 4,8,32,48,64; or, 4,16,30,40,58; or, 4, 16, 30, 40, 60; or, 4,16,30,40,62; or, 4,26,34,48,62; or, 4,26,34,48,64; or, 4,26,34,50,64; or, 4,26,36,48,64; or, 4,26,36,50,64。 18. The method of any one of claims 13 to 17, wherein, The set is used for the access of a second node with a sampling frequency offset of 10%.

19. The method according to any one of claims 2 to 6, 8 to 11, and 13 to 17, further comprising: The first node determines the set based on a first parameter, wherein the first parameter includes at least one of the following: The transmission bandwidth or bandwidth occupied by the second node; The order of harmonic interference that needs to be avoided at the second node; Available bandwidth of the second node; The sampling frequency offset of the second node; The largest candidate parameter value for the second node; The interval of the candidate parameter values ​​of the second node.

20. The method according to claim 1, wherein, When the candidate parameter sequence or candidate parameter set is predefined and the number of the candidate parameter sequence or candidate parameter set is greater than 1, the first indication information indicates the index of the candidate parameter sequence or candidate parameter set.

21. The method according to claim 1, further comprising: The first node determines the candidate parameter sequence or candidate parameter set based on the first parameter; The first parameter includes at least one of the following: The transmission bandwidth or occupied bandwidth of the second node; the order of harmonic interference to be avoided by the second node; the available bandwidth of the second node; the sampling frequency offset of the second node; the maximum candidate parameter value of the second node; the interval of the candidate parameter values ​​of the second node; the linear encoding method of the second node; and the data rate of the second node.

22. An information indication method, the method comprising: The second node receives the first indication information sent by the first node. The first indication information is used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending the first message to the first node. The candidate parameter sequence or candidate parameter set contains at least two candidate parameters, and the candidate parameters include any one of the following: Frequency shift factor R1; Repetition factor R²; The number of square wave periods R3 corresponding to the duration of a single information bit.

23. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,4,8; or, 4,6,8。 24. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,4,8; or, 2, 8, 12; or, 4, 6, 8; or, 4, 8, 10; or, 6, 8, 12; or, 8,10,12。 25. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,4,8,14,16； 2,8,12,14,16; or, 4, 6, 8, 14, 16; or, 6, 8, 12, 14, 16; or, 4, 8, 10, 14, 16; or, 8,10,12,14,16。 26. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,4,8,14,16,18,22,26,28,32; or, 2,4,14,16,18,22,24,26,28,32; or, 2,8,12,14,16,18,22,26,28,32; or, 2,12,14,16,18,22,24,26,28,32; or, 2,8,14,16,18,20,22,26,28,32; or, 2,14,16,18,20,22,24,26,28,32; or, 2,4,8,14,16,22,26,28,30,32; or, 2,4,14,16,22,24,26,28,30,32; or, 2,8,12,14,16,22,26,28,30,32; or, 2,12,14,16,22,24,26,28,30,32; or, 2,8,14,16,20,22,26,28,30,32; or, 2,14,16,20,22,24,26,28,30,32; or, 4,8,10,14,16,18,22,26,28,32; or, 4,10,14,16,18,22,24,26,28,32; or, 8,10,12,14,16,18,22,26,28,32; or, 10,12,14,16,18,22,24,26,28,32; or, 8,10,14,16,18,20,22,26,28,32; or, 10,14,16,18,20,22,24,26,28,32。 27. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,4,8,14,16,18,22,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or, 2,4,8,14,18,22,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or, 2,4,8,16,18,22,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or, 2,4,8,18,22,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or, 2,4,14,16,18,22,24,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or, 2,4,14,18,22,24,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or, 2,4,16,18,22,24,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or, 2,4,18,22,24,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or, 2,4,14,16,18,22,26,28,32,34,36,38,40,44,46,50,52,56,58,62,64; or, 2,4,14,18,22,26,28,32,34,36,38,40,44,46,48,50,52,56,58,62,64; or, 2,4,16,18,22,26,28,32,34,36,38,40,42,44,46,50,52,56,58,62,64; or, 2,4,18,22,26,28,32,34,36,38,40,42,44,46,48,50,52,56,58,62,64; or, 2,4,8,14,16,18,22,26,28,32,34,38,44,46,50,52,56,58,60,62,64; or, 2,4,8,14,18,22,26,28,32,34,38,44,46,48,50,52,56,58,60,62,64; or, 2,4,8,16,18,22,26,28,32,34,38,42,44,46,50,52,56,58,60,62,64; or, 2,4,8,18,22,26,28,32,34,38,42,44,46,48,50,52,56,58,60,62,64; or, 2,4,14,16,18,22,24,26,28,32,34,38,44,46,50,52,56,58,60,62,64; or, 2,4,14,18,22,24,26,28,32,34,38,44,46,48,50,52,56,58,60,62,64; or, 2,4,16,18,22,24,26,28,32,34,38,42,44,46,50,52,56,58,60,62,64; or, 2,4,18,22,24,26,28,32,34,38,42,44,46,48,50,52,56,58,60,62,64; or, 2,4,14,16,18,22,26,28,32,34,38,40,44,46,50,52,56,58,60,62,64; or, 2,4,14,18,22,26,28,32,34,38,40,44,46,48,50,52,56,58,60,62,64; or, 2,4,16,18,22,26,28,32,34,38,40,42,44,46,50,52,56,58,60,62,64; or, 2,4,18,22,26,28,32,34,38,40,42,44,46,48,50,52,56,58,60,62,64; or, 2,8,14,16,18,20,22,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or, 2,8,14,18,20,22,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or, 2,8,16,18,20,22,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or, 2,8,18,20,22,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or, 2,14,16,18,20,22,24,26,28,32,34,36,38,44,46,50,52,56,58,62,64; or, 2,14,18,20,22,24,26,28,32,34,36,38,44,46,48,50,52,56,58,62,64; or, 2,16,18,20,22,24,26,28,32,34,36,38,42,44,46,50,52,56,58,62,64; or, 2,18,20,22,24,26,28,32,34,36,38,42,44,46,48,50,52,56,58,62,64; or, 2,14,16,18,20,22,26,28,32,34,36,38,40,44,46,50,52,56,58,62,64; or, 2,14,18,20,22,26,28,32,34,36,38,40,44,46,48,50,52,56,58,62,64; or, 2,16,18,20,22,26,28,32,34,36,38,40,42,44,46,50,52,56,58,62,64; or, 2,18,20,22,26,28,32,34,36,38,40,42,44,46,48,50,52,56,58,62,64; or, 2,4,8,14,16,22,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or, 2,4,8,14,22,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or, 2,4,8,16,22,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or, 2,4,8,22,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or, 2,4,14,16,22,24,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or, 2,4,14,22,24,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or, 2,4,16,22,24,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or, 2,4,22,24,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or, 2,4,14,16,22,26,28,30,32,34,36,38,40,44,46,52,54,56,58,62,64; or, 2,4,14,22,26,28,30,32,34,36,38,40,44,46,48,52,54,56,58,62,64; or, 2,4,16,22,26,28,30,32,34,36,38,40,42,44,46,52,54,56,58,62,64; or, 2,4,22,26,28,30,32,34,36,38,40,42,44,46,48,52,54,56,58,62,64; or, 2,4,8,14,16,22,26,28,30,32,34,38,44,46,52,54,56,58,60,62,64; or, 2,4,8,14,22,26,28,30,32,34,38,44,46,48,52,54,56,58,60,62,64; or, 2,4,8,16,22,26,28,30,32,34,38,42,44,46,52,54,56,58,60,62,64; or, 2,4,8,22,26,28,30,32,34,38,42,44,46,48,52,54,56,58,60,62,64; or, 2,4,14,16,22,24,26,28,30,32,34,38,44,46,52,54,56,58,60,62,64; or, 2,4,14,22,24,26,28,30,32,34,38,44,46,48,52,54,56,58,60,62,64; or, 2,4,16,22,24,26,28,30,32,34,38,42,44,46,52,54,56,58,60,62,64; or, 2,4,22,24,26,28,30,32,34,38,42,44,46,48,52,54,56,58,60,62,64; or, 2,4,14,16,22,26,28,30,32,34,38,40,44,46,52,54,56,58,60,62,64; or, 2,4,14,22,26,28,30,32,34,38,40,44,46,48,52,54,56,58,60,62,64; or, 2,4,16,22,26,28,30,32,34,38,40,42,44,46,52,54,56,58,60,62,64; or, 2,4,22,26,28,30,32,34,38,40,42,44,46,48,52,54,56,58,60,62,64; or, 2,8,14,16,20,22,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or, 2,8,14,20,22,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or, 2,8,16,20,22,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or, 2,8,20,22,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or, 2,14,16,20,22,24,26,28,30,32,34,36,38,44,46,52,54,56,58,62,64; or, 2,14,20,22,24,26,28,30,32,34,36,38,44,46,48,52,54,56,58,62,64; or, 2,16,20,22,24,26,28,30,32,34,36,38,42,44,46,52,54,56,58,62,64; or, 2,20,22,24,26,28,30,32,34,36,38,42,44,46,48,52,54,56,58,62,64; or, 2,14,16,20,22,26,28,30,32,34,36,38,40,44,46,52,54,56,58,62,64; or, 2,14,20,22,26,28,30,32,34,36,38,40,44,46,48,52,54,56,58,62,64; or, 2,16,20,22,26,28,30,32,34,36,38,40,42,44,46,52,54,56,58,62,64; or, 2,20,22,26,28,30,32,34,36,38,40,42,44,46,48,52,54,56,58,62,64; or, 2,4,8,14,16,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 2,4,8,14,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 2,4,8,16,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 2,4,8,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 2,4,14,16,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 2,4,14,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 2,4,16,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 2,4,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 2,4,14,16,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or, 2,4,14,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or, 2,4,16,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or, 2,4,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64; or, 2,4,8,14,16,22,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or, 2,4,8,14,22,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or, 2,4,8,16,22,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or, 2,4,8,22,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or, 2,4,14,16,22,24,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or, 2,4,14,22,24,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or, 2,4,16,22,24,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or, 2,4,22,24,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or, 2,4,14,16,22,26,28,32,34,38,40,44,46,50,52,54,56,58,60,62,64; or, 2,4,14,22,26,28,32,34,38,40,44,46,48,50,52,54,56,58,60,62,64; or, 2,4,16,22,26,28,32,34,38,40,42,44,46,50,52,54,56,58,60,62,64; or, 2,4,22,26,28,32,34,38,40,42,44,46,48,50,52,54,56,58,60,62,64; or, 2,8,14,16,20,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 2,8,14,20,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 2,8,16,20,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 2,8,20,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 2,14,16,20,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 2,14,20,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 2,16,20,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 2,20,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 2,14,16,20,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or, 2,14,20,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or, 2,16,20,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or, 2,20,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64; or, 4,6,8,14,16,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 4,6,8,14,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 4,6,8,16,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 4,6,8,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 4,6,14,16,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 4,6,14,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 4,6,16,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 4,6,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 4,6,14,16,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or, 4,6,14,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or, 4,6,16,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or, 4,6,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64; or, 4,6,8,14,16,22,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or, 4,6,8,14,22,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or, 4,6,8,16,22,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or, 4,6,8,22,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or, 4,6,14,16,22,24,26,28,32,34,38,44,46,50,52,54,56,58,60,62,64; or, 4,6,14,22,24,26,28,32,34,38,44,46,48,50,52,54,56,58,60,62,64; or, 4,6,16,22,24,26,28,32,34,38,42,44,46,50,52,54,56,58,60,62,64; or, 4,6,22,24,26,28,32,34,38,42,44,46,48,50,52,54,56,58,60,62,64; or, 4,6,14,16,22,26,28,32,34,38,40,44,46,50,52,54,56,58,60,62,64; or, 4,6,14,22,26,28,32,34,38,40,44,46,48,50,52,54,56,58,60,62,64; or, 4,6,16,22,26,28,32,34,38,40,42,44,46,50,52,54,56,58,60,62,64; or, 4,6,22,26,28,32,34,38,40,42,44,46,48,50,52,54,56,58,60,62,64; or, 6,8,14,16,20,22,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 6,8,14,20,22,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 6,8,16,20,22,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 6,8,20,22,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 6,14,16,20,22,24,26,28,32,34,36,38,44,46,50,52,54,56,58,62,64; or, 6,14,20,22,24,26,28,32,34,36,38,44,46,48,50,52,54,56,58,62,64; or, 6,16,20,22,24,26,28,32,34,36,38,42,44,46,50,52,54,56,58,62,64; or, 6,20,22,24,26,28,32,34,36,38,42,44,46,48,50,52,54,56,58,62,64; or, 6,14,16,20,22,26,28,32,34,36,38,40,44,46,50,52,54,56,58,62,64; or, 6,14,20,22,26,28,32,34,36,38,40,44,46,48,50,52,54,56,58,62,64; or, 6,16,20,22,26,28,32,34,36,38,40,42,44,46,50,52,54,56,58,62,64; or, 6,20,22,26,28,32,34,36,38,40,42,44,46,48,50,52,54,56,58,62,64。 28. The method of any one of claims 23 to 27, wherein, The set is used for the access of the second node with a sampling frequency offset of 0%.

29. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 4,8。 30. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 4, 8, 16; or, 8,12,16。 31. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,14,18,22,28; or, 2,14,18,22,32; or, 2,14,18,26,32。 32. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,16,24,30,36,42,54,64; or, 2,16,24,30,36,42,56,64; or, 4,16,24,30,36,42,54,64; or, 4,16,24,30,36,42,56,64。 33. The method of any one of claims 29-32, wherein, The set is used for the access of a second node with a sampling frequency offset of 5%.

34. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 4,8。 35. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 4,8; or, 6,12; or, 8,12。 36. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 4,8,16。 37. The method of claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,14,20,28; or, 2,14,20,30; or, 2,16,22,30; or, 2,16,22,32; or, 2,16,24,32; or, 4,8,16,30; or, 4,8,16,32。 38. The method according to claim 22, wherein, The candidate parameter sequence or candidate parameter set is a subset or the entirety of the following sets: 2,14,26,34,52; or, 2,16,22,30,40; or, 2,16,24,32,58; or, 2,16,24,32,60; or, 2,16,30,40,58; or, 2,16,30,40,60; or, 2,16,30,40,62; or, 2,20,28,38,50; or, 2,22,30,40,54; or, 2,22,30,40,56; or, 2,22,30,42,54; or, 2,22,30,42,56; or, 2,22,30,44,56; or, 2,24,32,44,58; or, 2,24,32,44,60; or, 2,24,32,46,60; or, 2,26,34,48,62; or, 2,26,34,48,64; or, 2,26,34,50,64; or, 2,26,36,48,64; or, 2,26,36,50,64; or, 4,8,16,30,58; or, 4,8,16,30,60; or, 4,8,16,30,62; or, 4,8,16,30,64; or, 4,8,16,32,58; or, 4,8,16,32,60; or, 4,8,16,32,62; or, 4,8,16,32,64; or, 4,8,32,48,62; or, 4,8,32,48,64; or, 4,16,30,40,58; or, 4, 16, 30, 40, 60; or, 4,16,30,40,62; or, 4,26,34,48,62; or, 4,26,34,48,64; or, 4,26,34,50,64; or, 4,26,36,48,64; or, 4,26,36,50,64。 39. The method of any one of claims 34-38, wherein, The set is used for the access of a second node with a sampling frequency offset of 10%.

40. The method of claim 22, wherein, When the candidate parameter sequence or candidate parameter set is predefined and the number of the candidate parameter sequence or candidate parameter set is greater than 1, the first indication information indicates the index of the candidate parameter sequence or candidate parameter set.

41. The method of claim 22, wherein, The candidate parameter sequence or set indicated by the first indication information is associated with the first parameter; The first parameter includes at least one of the following: The transmission bandwidth or occupied bandwidth of the second node; the order of harmonic interference to be avoided by the second node; the available bandwidth of the second node; the sampling frequency offset of the second node; the maximum candidate parameter value of the second node; the interval of the candidate parameter values ​​of the second node; the linear encoding method of the second node; and the data rate of the second node.

42. An information indication device applied to a first node, the device comprising: The sending unit is used to send first indication information to the second node, wherein the first indication information is used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending the first message to the first node. The candidate parameter sequence or candidate parameter set contains at least one candidate parameter, and the candidate parameter includes any one of the following: Frequency shift factor R1; Repetition factor R²; The number of square wave periods R3 corresponding to the duration of a single information bit.

43. An information indication device applied to a second node, the device comprising: The receiving unit is configured to receive first indication information sent by the first node, wherein the first indication information is used to indicate the candidate parameter sequence or candidate parameter set that the second node can use when sending a first message to the first node; The candidate parameter sequence or candidate parameter set contains at least two candidate parameters, and the candidate parameters include any one of the following: Frequency shift factor R1; Repetition factor R²; The number of square wave periods R3 corresponding to the duration of a single information bit.

44. A communication device, comprising: A processor and a memory for storing a computer program, the processor for calling and running the computer program stored in the memory to perform the method as described in any one of claims 1 to 41.

45. A computer-readable storage medium for storing a computer program that causes a computer to perform the method as claimed in any one of claims 1 to 41.

46. ​​A computer program product comprising computer program instructions that cause a computer to perform the method as claimed in any one of claims 1 to 41.

Images