SEQUENCE GENERATING AND PROCESSING METHOD AND APPARATUS

Abstract

This application discloses a sequence generating method and apparatus, and relates to the field of communications technologies, to resolve a problem that a PAPR of a DMRS symbol is higher than that of a data symbol. An initialization factor of a first sequence is obtained, where the initialization factor is associated with a first parameter, and the first sequence is generated based on the initialization factor. In addition, the first parameter is a port number, or the first parameter is a code division multiplexing CDM group identity.

Description

TECHNICAL FIELD

The present invention relates to the field of mobile communications technologies, and specifically, to a sequence generating and processing method and apparatus.

BACKGROUND

In a multiple-input multiple-output (multi-input multi-output) system, each transmit antenna (for example, a logical antenna or a physical antenna) has an independent data channel. A receive end device (for example, a network device or a terminal) usually performs channel estimation on each transmit antenna based on a reference signal that is known in advance, and restores, based on a channel estimation result, a data signal transmitted through the data channel. Therefore, how to configure a reference signal or how to configure a sequence used to generate a reference signal is of vital importance. In a process of configuring the sequence for generating the reference signal, how to avoid interference also becomes an important problem that urgently needs to be resolved.

SUMMARY

Embodiments of this application provide a sequence generating and processing method and apparatus. The present invention provides a sequence generating and processing method and apparatus. The sequence generating and processing method and apparatus can effectively reduce a peak to average power ratio in a symbol sending process, and are particularly applicable to a scenario in which a reference signal is sent.

According to a first aspect, an embodiment of this application provides a sequence generating method, including: obtaining an initialization factor of a first sequence, where the initialization factor is associated with a first parameter; and generating the first sequence based on the initialization factor.

With reference to the first aspect, in a first possible design, the initialization factor satisfies:

$c_{\mathrm{init}}=\left(2^{17}f\left(\lambda \right)+2N_{\mathrm{ID}}^{g\left(\lambda ,n_{\mathrm{SCID}}\right)}+g\left(\lambda ,n_{\mathrm{SCID}}\right)\right)\mathrm{mod}{2}^{31}$ $\mathrm{where}f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+1\right)\left(2N_{\mathrm{ID}}^{g\left(\lambda ,n_{SCID}\right)}+1\right)+2^{d}h\left(\lambda \right),$ $f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+2^{d}h\left(\lambda \right)+1\right)\left(2N_{\mathrm{ID}}^{g\left(\lambda ,n_{SCID}\right)}+1\right),\mathrm{or}$ $f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+1\right)\left(2N_{ID}^{g\left(\lambda ,n_{SCID}\right)}+2^{d}h\left(\lambda \right)+1\right);$ $d\mathrm{satisfies}:d\in \left\{0,1,2,\dots ,13\right\};$ $\lambda \mathrm{is}\mathrm{the}\mathrm{first}\mathrm{parameter},\mathrm{and}\lambda \mathrm{is}\mathrm{one}\mathrm{of}{\lambda }_1,{\lambda }_2,\mathrm{and}{\lambda }_3;$ $g\left({\lambda }_1,n_{SCID}\right)=n_{SCID},\mathrm{and}h\left({\lambda }_1\right)=0;$ $g\left({\lambda }_2,n_{SCID}\right)=1-n_{SCID},\mathrm{and}h\left({\lambda }_2\right)=0;$ $g\left({\lambda }_3,n_{\mathrm{SCID}}\right)=n_{\mathrm{SCID}},\mathrm{and}h\left({\lambda }_3\right)=1;\mathrm{or}$ $g\left({\lambda }_3,n_{SCID}\right)=1-n_{SCID},\mathrm{and}h\left({\lambda }_3\right)=1;\mathrm{and}$ $N_{symb}^{\mathrm{slot}}\mathrm{is}a\mathrm{quantity}\mathrm{of}\mathrm{symbols}\mathrm{in}a\mathrm{slot},$ $n_{s,f}^{\mu }\mathrm{is}\mathrm{an}\mathrm{index}\mathrm{of}a\mathrm{subframe}\mathrm{or}a\mathrm{slot},$ $l\mathrm{is}\mathrm{an}\mathrm{index}\mathrm{of}a\mathrm{symbol},$ $n_{SCID}\mathrm{is}a\mathrm{scrambling}\mathrm{factor},\mathrm{and}$ $N_{ID}^{g\left(\lambda ,n_{SCID}\right)}\mathrm{is}a\mathrm{sequence}\mathrm{scrambling}\mathrm{identity}.$

With reference to the first aspect or the first possible design of the first aspect, in a second possible design, λ₁ is 0, λ₂ is 1, and λ₃ is 2.

With reference to the first aspect, in a third possible design, the initialization factor satisfies:

c _init=(2¹⁷(N_symb^slotn_s,f^μ+1+1)(2N_ID^g(λ,nSCID)+g(λ, n_SCID)+2¹⁷└λ/2┘)mod2³¹

where N_symb^slot is a quantity of symbols in a slot, n_s,f^μ is an index of a subframe or a slot, 1 is an index of a symbol, n_SCID is a scrambling factor, and N_ID^g(λ,nSCID) is a sequence scrambling identity;

• • λ is the first parameter, and is one of 0, 1, and 2; and
  • when λ=0, g(λ, n_SCID)=n_SCID;
  • when λ=1, g(λ, n_SCID)=1−n_SCID; or
  • when λ=2, g(λ, n_SCID)=n_SCID, or g(λ, n_SCID)=1−n_SCID.

With reference to the first aspect or the first to the third possible designs of the first aspect, in a fourth possible design, the first parameter is a port number; or the first parameter is a code division multiplexing CDM group identity.

With reference to the first aspect or the first to the fourth possible designs of the first aspect, in a fifth possible design, the method further includes receiving a first signaling, where the first signaling is used to indicate the first parameter.

With reference to the first aspect or the first to the fifth possible designs of the first aspect, in a sixth possible design, the method further includes:

• • generating a first reference signal based on the first sequence; and
  • sending the first reference signal.

With reference to the first aspect or the first to the fifth possible designs of the first aspect, in a seventh possible design, the method further includes:

• • receiving a second reference signal; and
  • processing the second reference signal based on the first sequence.

According to a second aspect, an embodiment of this application provides a sequence generating apparatus, including: a determining module, configured to obtain an initialization factor of a first sequence, where the initialization factor is associated with a first parameter; and a generation module, configured to generate the first sequence based on the initialization factor.

With reference to the second aspect, in a first possible design, the initialization factor satisfies:

$c_{\mathrm{init}}=\left(2^{17}f\left(\lambda \right)+2N_{\mathrm{ID}}^{g\left(\lambda ,n_{\mathrm{SCID}}\right)}+g\left(\lambda ,n_{\mathrm{SCID}}\right)\right)\mathrm{mod}{2}^{31}$ $\mathrm{where}f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+1\right)\left(2N_{\mathrm{ID}}^{g\left(\lambda ,n_{SCID}\right)}+1\right)+2^{d}h\left(\lambda \right),$ $f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+2^{d}h\left(\lambda \right)+1\right)\left(2N_{\mathrm{ID}}^{g\left(\lambda ,n_{SCID}\right)}+1\right),\mathrm{or}$ $f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+1\right)\left(2N_{ID}^{g\left(\lambda ,n_{SCID}\right)}+2^{d}h\left(\lambda \right)+1\right);$ $d\mathrm{satisfies}:d\in \left\{0,1,2,\dots ,13\right\};$ $\lambda \mathrm{is}\mathrm{the}\mathrm{first}\mathrm{parameter},\mathrm{and}\lambda \mathrm{is}\mathrm{one}\mathrm{of}{\lambda }_1,{\lambda }_2,\mathrm{and}{\lambda }_3;$ $g\left({\lambda }_1,n_{SCID}\right)=n_{SCID},\mathrm{and}h\left({\lambda }_1\right)=0;$ $g\left({\lambda }_2,n_{SCID}\right)=1-n_{SCID},\mathrm{and}h\left({\lambda }_2\right)=0;$ $g\left({\lambda }_3,n_{\mathrm{SCID}}\right)=n_{\mathrm{SCID}},\mathrm{and}h\left({\lambda }_3\right)=1;\mathrm{or}$ $g\left({\lambda }_3,n_{\mathrm{SCID}}\right)=1-n_{SCID},\mathrm{and}h\left({\lambda }_3\right)=1;\mathrm{and}$ $N_{symb}^{\mathrm{slot}}\mathrm{is}a\mathrm{quantity}\mathrm{of}\mathrm{symbols}\mathrm{in}a\mathrm{slot},$ $n_{s,f}^{\mu }\mathrm{is}\mathrm{an}\mathrm{index}\mathrm{of}a\mathrm{subframe}\mathrm{or}a\mathrm{slot},$ $l\mathrm{is}\mathrm{an}\mathrm{index}\mathrm{of}a\mathrm{symbol},$ $n_{SCID}\mathrm{is}a\mathrm{scrambling}\mathrm{factor},\mathrm{and}$ $N_{ID}^{g\left(\lambda ,n_{SCID}\right)}\mathrm{is}a\mathrm{sequence}\mathrm{scrambling}\mathrm{identity}.$

With reference to the second aspect or the first possible design of the second aspect, in a second possible design, λ₁ is 0, λ₂ is 1, and λ₃ is 2.

With reference to the second aspect, in a third possible design, the initialization factor satisfies:

c _init=(2¹⁷(N_symb^slotn_s,f^μ+1+1)(2N_ID^g(λ,nSCID)+g(λ, n_SCID)+2¹⁷└λ/2┘)mod2³¹

where N_symb^slot is a quantity of symbols in a slot, n_s,f^μ is an index of a subframe or a slot, 1 is an index of a symbol, n_SCID is a scrambling factor, and N_ID^g(λ,nSCID) is a sequence scrambling identity;

• • λ is the first parameter, and is one of 0, 1, and 2; and
  • when λ=0, g(λ, n_SCID)=n_SCID;
  • when λ=1, g(λ, n_SCID)=1−n_SCID; or
  • when λ=2, g(λ, n_SCID)=n_SCID, or g(λ, n_SCID)=1−n_SCID.

With reference to the second aspect or the first to the third possible designs of the second aspect, in a fourth possible design, the first parameter is a port number, or the first parameter is a code division multiplexing CDM group identity.

With reference to the second aspect or the first to the fourth possible designs of the second aspect, in a fifth possible design, the apparatus further includes:

• • a receiving module, configured to receive first signaling, where the first signaling is used to indicate the first parameter.

With reference to the second aspect or the first to the fifth possible designs of the second aspect, in a sixth possible design, the apparatus further includes:

• • the generation module, further configured to generate a first reference signal based on the first sequence; and
  • a sending module, configured to send the first reference signal.

With reference to the second aspect or the first to the fifth possible designs of the second aspect, in a seventh possible design, the apparatus further includes:

• • a receiving module, configured to receive a second reference signal; and
  • a processing module, configured to process the second reference signal based on the first sequence.

According to a third aspect, an embodiment of this application provides a communications system, including a transmit end and a receive end. The transmit end is configured to perform the sixth possible design of the first aspect, and the receive end is configured to perform the seventh possible design of the first aspect.

According to a fourth aspect, this application further provides a processor and a memory that are associated with the foregoing aspects. The processor is configured to perform the methods according to the first aspect and the possible designs of the first aspect. The memory is configured to store programs corresponding to the first aspect and the possible designs of the first aspect.

In the embodiments of the present invention, through implementation of the foregoing aspects, there may be a plurality of initialization factors in a sequence generating process. Further, in the present invention, the initialization factor is designed, so that a parameter of the generated initialization factor is associated with a port number or a CDM group. In this way, a case in which a same sequence is used for different CDM groups can be avoided, and a problem that a PAPR of a DMRS symbol is higher than that of a data symbol is resolved.

BRIEF DESCRIPTION OF DRAWINGS

To describe the technical solutions in the embodiments of the present invention more clearly, the following briefly describes the accompanying drawings used in describing the embodiments.

FIG. 1 is a schematic diagram of a communications system applicable to an embodiment of this application;

FIG. 2 is a schematic diagram of another communications system applicable to an embodiment of this application;

FIG. 3 is a schematic diagram of a hardware structure of a communications device applicable to an embodiment of this application;

FIG. 4 is a schematic diagram of a sequence generating method according to an embodiment of this application;

FIG. 5 is a schematic structural diagram of a sequence generating apparatus according to an embodiment of this application; and

FIG. 6 is a schematic structural diagram of a sequence generating apparatus according to an embodiment of this application.

DESCRIPTION OF EMBODIMENTS

Terms used in the implementation part of the present invention are merely intended to explain specific embodiments of the present invention, but are not intended to limit the present invention. The following clearly describes the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention.

FIG. 1 is a schematic architectural diagram of a communications system according to an embodiment of the present invention. The communications system includes a transmit end device and a receive end device. An example in which the transmit end device is an access network device and the receive end device is user equipment (English: User Equipment, UE for short) is used for description in this embodiment of the present invention. The user equipment and the access network device communicate with each other by using an air interface technology. The air interface technology may include: an existing 2G (for example, global system for mobile communications (English: Global System for Mobile Communications, GSM for short)) system, 3G (for example, universal mobile telecommunications system (English: Universal Mobile Telecommunications System, UMTS for short), wideband code division multiple access (English: Wideband Code Division Multiple Access, WCDMA for short), and time division-synchronous code division multiple access (English: Time Division-Synchronous Code Division Multiple Access, TD-SCDMA for short)) system, and 4G (for example, FDD LTE or TDD LTE) system, and a new radio access technology (English: New Radio Access Technology, New RAT for short) system, for example, a 4.5G or 5G system.

A method described in the present invention may be executed by the user equipment or the access network device, or may be executed by a chip, a circuit, a storage device, or a computer program. In the present invention, the user equipment is described as UE in a general sense. In addition, the user equipment may also be referred to as a mobile station, an access terminal, a subscriber unit, a subscriber station, a remote station, a remote terminal, a mobile device, a user terminal, a terminal, a wireless communications device, a user agent, a user apparatus, or the like. The user equipment may be a cellular phone, a cordless phone, a session initiation protocol (English: Session Initiation Protocol, SIP for short) phone, a wireless local loop (English: Wireless Local Loop, WLL for short) station, a personal digital assistant (English: Personal Digital Assistant, PDA for short), a handheld device with a wireless communication function, a computing device, another processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a mobile station in a future 5G network, a terminal device in a future evolved public land mobile network (English: Public Land Mobile Network, PLMN for short), or the like. Moreover, in the embodiments of the present invention, the user equipment may further include a relay (English: Relay) and another device that can perform data communication with the access network device (for example, a base station).

The access network device described in the present invention may be a device configured to communicate with the user equipment. Specifically, in a wireless communications system, the access network device is a device that communicates with the user equipment in a wireless manner. For example, the access network device may be a base transceiver station (English: Base Transceiver Station, BTS for short) in a GSM system, may be an NB (English: NodeB) in a WCDMA system, or may be an evolved NodeB (English: evolved Node B, eNB for short) in LTE, a relay station, a vehicle-mounted device, a wearable device, an access network device in the future 5G network, an access network device in the future evolved PLMN network, or the like.

Technical solutions provided in the embodiments of this application may be applied to various communications systems. FIG. 2 is a schematic diagram of another communications system according to an embodiment of the present invention.

FIG. 2 is a schematic diagram of a communications system applicable to an embodiment of this application. The communications system may include one or more network devices 10 (only one network device is shown) and one or more terminals 20 connected to each network device 10. FIG. 2 is merely a schematic diagram, and does not constitute a limitation on an applicable scenario of the technical solutions provided in this application. A device for performing the implementations of the present invention may be the network device 10, or may be one or more terminals 20. The network device 10 and the one or more terminals 20 may be applicable to an uplink scenario and a downlink scenario.

The network device 10 may be a transmission reception point (transmission reception point, TRP), a base station, a relay station, an access point, or the like. The network device 10 may be a network device in a 5G communications system or a network device in a future evolved network; or may be a wearable device, a vehicle-mounted device, or the like. In addition, the network device 10 may alternatively be a base transceiver station (base transceiver station, BTS) in a global system for mobile communications (global system for mobile communication, GSM) or a code division multiple access (code division multiple access, CDMA) network, may be an NB (NodeB) in a wideband code division multiple access (wideband code division multiple access, WCDMA), or may be an eNB or eNodeB (evolutional NodeB) in long term evolution (long term evolution, LTE). The network device 10 may alternatively be a radio controller in a cloud radio access network (cloud radio access network, CRAN) scenario.

The terminal 20 may be user equipment (user equipment, UE), an access terminal, a UE unit, a UE station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a UE terminal, a wireless communications device, a UE agent, a UE apparatus, or the like. The access terminal may be a cellular phone, a cordless phone, a session initiation protocol (session initiation protocol, SIP) phone, a wireless local loop (wireless local loop, WLL) station, a personal digital assistant (personal digital assistant, PDA), a handheld device with a wireless communication function, a computing device, another processing device connected to a wireless modem, a vehicle-mounted device, a wearable device, a terminal in a 5G network, a terminal in a future evolved public land mobile network (public land mobile network, PLMN) network, or the like.

Optionally, each network element (for example, the network device 10 and the terminals 20) in FIG. 2 may be implemented by one device, may be jointly implemented by a plurality of devices, or may be a function module in a device. This is not specifically limited in this embodiment of this application. It may be understood that the foregoing function may be a function of a network element in a hardware device, may be a software function running on dedicated hardware, or may be a virtualization function instantiated on a platform (for example, a cloud platform).

For example, each network element in FIG. 2 may be implemented by using a communications device 200 in FIG. 3. FIG. 3 is a schematic diagram of a hardware structure of a communications device applicable to an embodiment of this application. The communications device 200 includes at least one processor 201, a communications line 202, a memory 203, and at least one communications interface 204.

The processor 201 may be a general-purpose central processing unit (central processing unit, CPU), a microprocessor, an application-specific integrated circuit (application-specific integrated circuit, ASIC), or one or more integrated circuits configured to control program execution in the solutions in this application.

The communications line 202 may include a path for transmitting information between the foregoing components.

The communications interface 204 may be implemented by using any apparatus such as a transceiver, and is configured to communicate with another device or a communications network, such as Ethernet, a RAN, or a wireless local area network (wireless local area networks, WLAN).

The memory 203 may be a read-only memory (read-only memory, ROM) or another type of static storage device that can store static information and instructions, a random access memory (random access memory, RAM) or another type of dynamic storage device that can store information and instructions, or may be an electrically erasable programmable read-only memory (electrically erasable programmable read-only memory, EEPROM), a compact disc read-only memory (compact disc read-only memory, CD-ROM) or another compact disc storage, an optical disc storage (including a compact disc, a laser disc, an optical disc, a digital versatile disc, a Blu-ray optical disc, and the like), a magnetic disk storage medium or another magnetic storage device, or any other medium that can be used to carry or store expected program code in a form of an instruction or a data structure and that can be accessed by a computer. However, the memory 203 is not limited thereto. The memory may exist independently, and is connected to the processor by using the communications line 202. Alternatively, the memory may be integrated with the processor. The memory provided in this embodiment of this application may usually be non-volatile. The memory 203 is configured to store a computer-executable instruction for executing the solutions in this application, and the processor 201 controls the execution. The processor 201 is configured to execute the computer-executable instruction stored in the memory 203, to implement a method provided in the following embodiment of this application.

Optionally, the computer-executable instruction in this embodiment of this application may also be referred to as application program code. This is not specifically limited in this embodiment of this application.

During specific implementation, in an embodiment, the processor 201 may include one or more CPUs, for example, a CPU 0 and a CPU 1 in FIG. 3.

During specific implementation, in an embodiment, the communications device 200 may include a plurality of processors, for example, the processor 201 and a processor 207 in FIG. 3. Each one of the processors may be a single-core (single-CPU) processor, or may be a multi-core (multi-CPU) processor. The processor herein may refer to one or more devices, circuits, and/or processing cores configured to process data (for example, a computer program instruction).

During specific implementation, in an embodiment, the communications device 200 may further include an output device 205 and an input device 206. The output device 205 communicates with the processor 201, and may display information in a plurality of manners. For example, the output device 205 may be a liquid crystal display (liquid crystal display, LCD), a light emitting diode (light emitting diode, LED) display device, a cathode ray tube (cathode ray tube, CRT) display device, a projector (projector), or the like. The input device 206 communicates with the processor 201, and may receive an input from a user in a plurality of manners. For example, the input device 206 may be a mouse, a keyboard, a touchscreen device, a sensing device, or the like.

The foregoing communications device 200 may be a general-purpose device or a dedicated device. During specific implementation, the communications device 200 may be a desktop computer, a portable computer, a network server, a personal digital assistant (personal digital assistant, PDA), a mobile phone, a tablet computer, a wireless terminal device, an embedded device, or a device having a structure similar to that in FIG. 3. A type of the communications device 200 is not limited in this embodiment of this application.

It should be noted that any technical solution provided in the embodiments of this application may be applied to a downlink transmission scenario, or may be applied to an uplink transmission scenario. When the solution is applied to a downlink transmission scenario, a transmit end device may be a network device, and a receive end device may be a terminal. When the solution is applied to an uplink transmission scenario, a transmit end device may be a terminal, and a receive end device may be a network device. In any one of the following embodiments, after the transmit end device (or the receive end device) is replaced with a network device, a network device in this embodiment and the network device that the transmit end device (or the receive end device) is replaced with may represent a same network device. After the transmit end device (or the receive end device) is replaced with a terminal, a terminal in this embodiment and the terminal that the transmit end device (or the receive end device) is replaced with may represent a same terminal. This is uniformly described herein, and details are not described below again.

A “resource unit” in the embodiments of this application is a basic unit for scheduling a terminal. The resource unit includes a plurality of contiguous subcarriers in frequency domain and one time interval (time interval, TI) in time domain. In different scheduling processes, sizes of resource units may be the same or may be different. The TI may be a transmission time interval (transmission time interval, TTI) in an LTE system, may be a symbol-level short TTI or a short TTI in a high frequency system with a large subcarrier , or may be a slot (slot) or a mini-slot (mini-slot) in a 5G system. This is not limited in the embodiments of this application. Optionally, one resource unit may include one or more RBs, one or more RB pairs (RB pair), and the like. In addition, the resource unit may alternatively be half an RB or the like. In addition, the resource unit may be another time-frequency resource. This is not limited in the embodiments of this application. It should be noted that, unless otherwise specified, or when no conflict exists, the following specific examples are all described by using an example in which the resource unit is an RB in the LTE system.

A “scheduling periodicity” in the embodiments of this application is a time interval TI.

A “time-domain symbol” in the embodiments of this application may include but is not limited to any one of the following: an OFDM symbol, a universal filtered multicarrier (universal filtered multi-carrier, UFMC) signal, a filter-bank multi-carrier (filter-bank multi-carrier, FBMC) symbol, a generalized frequency division multiplexing (generalized frequency-division multiplexing, GFDM) symbol, and the like.

The term “at least one (type)” in the embodiments of this application includes one (type) or more (types). “A plurality of (types)” means two (types) or more than two (types). For example, at least one of A, B, and C includes the following cases: Only A exists, only B exists, both A and B exist, both A and C exist, both B and C exist, and all of A, B, and C exist. The term “and/or” in the embodiments of this application is merely an association relationship for describing associated objects and represents that three relationships may exist. For example, A and/or B may represent the following three cases: Only A exists, both A and B exist, and only B exists. The term character “/” in the embodiments of this application generally indicates an “or” relationship between associated objects. In addition, in a formula, the character “/” indicates a division relationship between the associated objects. For example, A/B may indicate that A is divided by B. The terms “first”, “second”, and the like in the embodiments of this application are intended to distinguish between different objects but do not indicate an order of the different objects.

The following describes the technical solutions provided in the embodiments of this application with reference to the accompanying drawings.

FIG. 4 is a schematic diagram of a sequence generating method according to an embodiment of this application. The method includes the following steps.

S401: Obtain an initialization factor of a first sequence, where the initialization factor is associated with a first parameter.

S402: Generate the first sequence based on the initialization factor.

With reference to the foregoing description, steps S401 and S402 may be performed by a network device, or may be performed by a terminal. In a communications system, the two steps may alternatively be performed by both the network device and the terminal. In a case of uplink and downlink data transmission, the foregoing steps may be performed for a plurality of times by one network device or terminal. For example, in an uplink transmission process, a sequence generating method is performed once for a sequence of an uplink signal. Before or after the performing, the method is performed once again for generating a sequence of a downlink signal. In an embodiment, the first sequence is a sequence for generating a reference signal. The reference signal may be but is not limited to a demodulation reference signal (demodulation reference signal, DMRS), or may be another reference signal used for demodulation.

In an embodiment, the initialization factor is associated with the first parameter. The first parameter may be specifically a system parameter, for example, a port number or a code division multiplexing (code division multiplexing, CDM) group identity. The port herein is usually an antenna port, or may be a port in another form, for example, a physical port of an antenna. Optionally, the first parameter may alternatively be another parameter, for example, a parameter such as an antenna panel identity or another identity.

In an embodiment, the method may further include: S401A: Determine a first parameter, and obtain an initialization factor of a first sequence based on the first parameter. For example, when the antenna port is the first parameter, S401A is as follows: Determine an antenna port, and obtain an initialization factor of a first sequence based on the antenna port. Alternatively, when the CDM group identity is the first parameter, S401A is as follows: Determine a CDM group identity, and obtain an initialization factor of a first sequence based on the CDM group identity. It should be understood that the CDM group identity may alternatively be other information about the CDM group. For example, another parameter that can be used to determine group information of the CDM group is obtained. The parameter may be used to determine the group information or the group identity that is of the CDM group in an implicit or explicit manner, or based on a preset correspondence. The parameter is the first parameter.

The following gives specific examples for description according to the foregoing method.

Example 1

The First Parameter is a CDM Group Identity

For a CDM group identity of a CDM group to which a reference signal corresponding to the first sequence belongs is obtained, the first sequence may be used to generate the reference signal to demodulate data corresponding to the CDM group. Therefore, correspondingly, a process of obtaining the initialization factor of the first sequence is also determined by the CDM group identity. For example, the CDM group identity may be 0, 1, or 2. In this case, a manner of generating the initialization factor may have different functions based on the CDM group identity. For example, the initialization factor satisfies:

$c_{\mathrm{init}}=\left(2^{17}f\left(\lambda \right)+2N_{\mathrm{ID}}^{g\left(\lambda ,n_{\mathrm{SCID}}\right)}+g\left(\lambda ,n_{\mathrm{SCID}}\right)\right)\mathrm{mod}{2}^{31}$ $\mathrm{where}f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+1\right)\left(2N_{\mathrm{ID}}^{g\left(\lambda ,n_{SCID}\right)}+1\right)+2^{d}h\left(\lambda \right),$ $f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+2^{d}h\left(\lambda \right)+1\right)\left(2N_{\mathrm{ID}}^{g\left(\lambda ,n_{SCID}\right)}+1\right),\mathrm{or}$ $f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+1\right)\left(2N_{ID}^{g\left(\lambda ,n_{SCID}\right)}+2^{d}h\left(\lambda \right)+1\right);$ $d\mathrm{satifies}:d\in \left\{0,1,2,\dots ,13\right\};$ $\lambda \mathrm{is}\mathrm{the}\mathrm{first}\mathrm{parameter},$ $\mathrm{and}\lambda \mathrm{is}a\mathrm{CDM}\mathrm{group}\mathrm{identity}\mathrm{and}\mathrm{may}\mathrm{be}\mathrm{specifically}\mathrm{one}\mathrm{of}0,1,\mathrm{and}2;\mathrm{and}$ $\mathrm{when}\lambda =0,g\left(\lambda ,n_{SCID}\right)=n_{SCID};$ $\mathrm{when}\lambda =1,g\left(\lambda ,n_{SCID}\right)=1-n_{SCID};\mathrm{or}$ $\mathrm{when}\lambda =2,g\left(\lambda ,n_{SCID}\right)=n_{SCID},$ $\mathrm{or}g\left(\lambda ,n_{SCID}\right)=1-n_{SCID}.$

It should be understood that for different 2, the foregoing three branches that initialization factors satisfy may be predefined at a receive end and a transmit end by using a correspondence or in a form of a table.

In an example, h(λ) may be └λ/2┘, which represent rounding down λ/2.

N_symb^slot is a quantity of symbols in a slot, n_s,f^μ is an index of a subframe or a slot, l is an index of a symbol, n_SCID is a scrambling factor, and N_ID^g(λ,nSCID) is a sequence scrambling identity.

In an example, if d=0, the foregoing initialization factor satisfies:

c _init=(2¹⁷(N_symb^slotn_s,f^μ+1+1)(2N_ID^g(λ,nSCID)+g(λ, n_SCID)+2¹⁷└λ/2┘)mod2³¹; and

more specifically, when λ=0, the foregoing initialization factor satisfies:

c _init=(2¹⁷(N_symb^slotn_s,f^μ+1+1)(2N_ID^nSCID+1)+2N_ID^nSCID+n_SCID+2¹⁷└λ/2┘)mod2³¹;

more specifically, when λ=1, the foregoing initialization factor satisfies:

c _init=(2¹⁷(N_symb^slotn_s,f^μ+1+1)(2N_ID^1−nSCID+1)+2N_ID^1−nSCID+1−n_SCID+2¹⁷└λ/2┘)mod2³¹; or

more specifically, when λ=2, the foregoing initialization factor satisfies:

$c_{\mathrm{init}}=\left(2^{17}\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+1\right)\left(2N_{\mathrm{ID}}^{g\left(\lambda ,n_{\mathrm{SCID}}\right)}+1\right)+2N_{ID}^{g\left(\lambda ,n_{SCID}\right)}+g\left(\lambda ,n_{\mathrm{SCID}}\right)+2^{17}\lfloor \lambda /2\rfloor \right)\mathrm{mod}{2}^{31},\mathrm{or}$ $c_{\mathrm{init}}=\left(2^{17}\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+1\right)\left(2N_{\mathrm{ID}}^{1-n_{\mathrm{SCID}}}+1\right)+2N_{ID}^{1-n_{SCID}}+1-n_{\mathrm{SCID}}+2^{17}\lfloor \lambda /2\rfloor \right)\mathrm{mod}{2}^{31}.$

N_symb^slot is a quantity of symbols in a slot, for example, but not limited to, a quantity of symbols in a slot that carries the reference signal. For example, in the LTE standard, N_symb^slot may be equal to 6 or 7, or may be 10. In NR, N_symb^slot may be variable, or may be a fixed value. n_s,f^μ is an index of a subframe or a slot, for example, but not limited to, an index of a subframe that carries the reference signal. Alternatively, n_s,f^μ is an index of a slot, for example, but not limited to, an index of a slot that carries the reference signal. 1 is an index of a symbol, for example, but not limited to, an index of a symbol that carries the reference signal. For example, in the LTE standard, l may be equal to 0 to 5 or 0 to 6; in the NR, a value range of l may be 0 to 13. n_SCID is a scrambling factor. For example, a value of n_SCID may be 0 or 1. N_ID^g(λ,nSCID) is a sequence scrambling identity. The slot herein may alternatively be a time unit. In an extended embodiment, the slot may alternatively be replaced with a quantity of slots in a subframe.

In an embodiment, when λ=2, an expression that the initialization factor satisfies may be λ=0 or λ=1.

Example 2

The First Parameter is a Port Identity

A first parameter value may be determined based on different port identities. For example, because there is the following correspondence (Table 1) between a port identity and a CDM group identity, an initialization factor may alternatively be directly determined based on the following p value:

TABLE 1
p    CDM group λ
1000 0
1001 0
1002 1
1003 1
1004 2
1005 2
1006 0
1007 0
1008 1
1009 1
1010 2
1011 2

For example, when p is 1000 and 1001, it is directly determined that the initialization factor is the following formula or satisfies the following formula:

c _init=(2¹⁷(N_symb^slotn_s,f^μ+1+1)(2N_ID^g(λ,nSCID)+g(λ, n_SCID)+2¹⁷└λ/2┘)mod2³¹;

When p is 1002 and 1003, it is directly determined that the initialization factor is the following formula or satisfies the following formula:

c _init=(2¹⁷(N_symb^slotn_s,f^μ+1+1)(2N_ID^nSCID+1)+2N_ID^nSCID+n_SCID+2¹⁷└λ/2┘)mod2³¹;

where other p values may correspond to values of the CDM group, and details are not described herein again.

Example 3

The First Parameter is Another Identity

For example, the CDM group may be usually determined in a manner of implicit notification through signaling. For example, a mapping relationship is defined, where a state indicated by signaling corresponds to a port value, and the CDM group identity is further determined based on Table 1. In a process of determining the initialization factor, the initialization factor may be determined and generated directly based on the signaling, both a sender and a receiver of the signaling may determine the initialization factor according to the implementation.

The foregoing three examples describe examples of the first parameter. It should be understood that the first parameter in the present invention is limited to the foregoing several identities.

In an embodiment, the initialization factor satisfies:

$c_{\mathrm{init}}=\left(2^{17}f\left(\lambda \right)+2N_{\mathrm{ID}}^{g\left(\lambda ,n_{\mathrm{SCID}}\right)}+g\left(\lambda ,n_{\mathrm{SCID}}\right)\right)\mathrm{mod}{2}^{31}$ $\mathrm{where}f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+1\right)\left(2N_{\mathrm{ID}}^{g\left(\lambda ,n_{SCID}\right)}+1\right)+2^{d}h\left(\lambda \right),$ $f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+2^{d}h\left(\lambda \right)+1\right)\left(2N_{\mathrm{ID}}^{g\left(\lambda ,n_{SCID}\right)}+1\right),\mathrm{or}$ $f\left(\lambda ,n_{SCID}\right)=\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+1\right)\left(2N_{ID}^{g\left(\lambda ,n_{SCID}\right)}+2^{d}h\left(\lambda \right)+1\right);$ $d\mathrm{satisfies}:d\in \left\{0,1,2,\dots ,13\right\};$ $\lambda \mathrm{is}\mathrm{the}\mathrm{first}\mathrm{parameter},\mathrm{and}\lambda \mathrm{is}\mathrm{one}\mathrm{of}{\lambda }_1,{\lambda }_2,\mathrm{and}{\lambda }_3;$ $g\left({\lambda }_1,n_{SCID}\right)=n_{SCID},\mathrm{and}h\left({\lambda }_1\right)=0;$ $g\left({\lambda }_2,n_{SCID}\right)=1-n_{SCID},\mathrm{and}h\left({\lambda }_2\right)=0;$ $g\left({\lambda }_3,n_{\mathrm{SCID}}\right)=n_{\mathrm{SCID}},\mathrm{and}h\left({\lambda }_3\right)=1;\mathrm{or}$ $g\left({\lambda }_3,n_{SCID}\right)=1-n_{SCID},\mathrm{and}h\left({\lambda }_3\right)=1;\mathrm{and}$ $N_{symb}^{\mathrm{slot}}\mathrm{is}a\mathrm{quantity}\mathrm{of}\mathrm{symbols}\mathrm{in}a\mathrm{slot},$ $n_{s,f}^{\mu }\mathrm{is}\mathrm{an}\mathrm{index}\mathrm{of}a\mathrm{subframe}\mathrm{or}a\mathrm{slot},$ $l\mathrm{is}\mathrm{an}\mathrm{index}\mathrm{of}a\mathrm{symbol},$ $n_{SCID}\mathrm{is}a\mathrm{scrambling}\mathrm{factor},\mathrm{and}$ $N_{ID}^{g\left(\lambda ,n_{SCID}\right)}\mathrm{is}a\mathrm{sequence}\mathrm{scrambling}\mathrm{identity}.$

In an embodiment, λ₁ is 0, λ₂ is 1, and λ₃ is 2.

In an embodiment, the initialization factor satisfies: ti c_init=(2¹⁷(N_symb^slotn_s,f^μ+1+1)(2N_ID^g(λ,nSCID)+g(λ, n_SCID)+2¹⁷└λ/2┘)mod2³¹

where N_symb^slot is a quantity of symbols in a slot, n_s,f^μ is an index of a subframe or a slot, 1 is an index of a symbol, n_SCID is a scrambling factor, and N_ID^g(λ,nSCID) is a sequence scrambling identity;

• • λ is the first parameter, and is one of 0, 1, and 2; and
  • when λ=0, g(λ, n_SCID)=n_SCID;
  • when λ=1, g(λ, n_SCID)=1−n_SCID; or
  • when λ=2, g(λ, n_SCID)=n_SCID, or g(λ, n_SCID)=1−n_SCID.

In an embodiment, the first parameter is a port number; or the first parameter is a code division multiplexing CDM group identity.

It should be understood that, merely for ease of description, parameter values are added in the foregoing equations and expressions, and may also be different in expression. For example, g(λ, n_SCID) may be directly written as g(n_SCID) or g. Other parameters are similar to g(λ, n_SCID).

In an embodiment, the foregoing steps further include S403: Receive first signaling, where the first signaling is used to indicate the first parameter. In another embodiment, the foregoing steps further include S403A (not shown): Send first signaling, where the first signaling is used to indicate the first parameter.

In an embodiment, the method further includes: S404: Generate a first reference signal based on the first sequence; and S405: Send the first reference signal.

For example, a reference signal may be generated in the following manner:

obtaining a reference signal sequence, where the reference signal sequence may be generated according to the following formula:

$r\left(n\right)=\frac{1}{\sqrt{2}}\left(1-2·c\left(2n\right)\right)+j\frac{1}{\sqrt{2}}\left(1-2·c\left(2n+1\right)\right)$

In this case, the reference signal sequence may alternatively be obtained by using a lookup table obtained based on the foregoing formula, where

c(n)=(x₁(n+N_c)+x₂(n+N_c))mod2

x ₁(n+31)=(x₁(n+3)+x₁(n))mod 2

x ₂(n+31)=(x₂(n+3+x₂(n+2)+x₂(n+1)+x₂(n))mod 2

c(n) is a binary Gold sequence, and a length thereof may be, for example, but is not limited to, M_PN, where n=0,1, . . . , M_PN−1, N_c=1600.

An initialization factor of x₁(n) is: x₁(0)=1, x₁(n)=0,n=1,2, . . . , 30.

An initialization factor of x₂(n) satisfies:

$c_{init}={\sum }_{i=0}^{30}{x}_2\left(i\right)·2^i.$

C_init herein may be in various forms satisfying the foregoing embodiments, or may be directly generated according to the formulas or equivalent variants of the formulas in the foregoing embodiments. In a specific implementation process, the reference signal is a DMRS or a CSI-RS.

It should be understood that, after the foregoing reference signal sequence is generated, if a process is a reference signal sending process, the reference signal sequence may be further mapped to subcarriers. In an embodiment, the foregoing subcarriers are equally spaced or contiguous subcarriers. Correspondingly, if a process is a receiving process, the process may be a demodulation process that is after a reference signal is received, and the foregoing process may further include channel estimation (that is, the foregoing processing step may be a channel estimation step). Details are not described herein again.

The obtaining a reference signal sequence may be in various manners, for example, but not limited to, obtaining the reference signal sequence through calculation according to a preset formula, or obtaining the reference signal sequence through table lookup. More specifically, the preset formula is, for example, but is not limited to, a reference signal sequence generating formula. The formula is a formula related to the initialization factor. For example, a parameter in the preset formula includes the initialization factor. However, the relationship is not limited thereto. In a specific implementation process, for the foregoing preset formula, refer to, for example, but not limited to, a reference signal sequence generating formula mentioned in an existing LTE standard or 5G standard. In addition, as described in this specification, n_{CDM_m} represents an index of a code division multiplexing group to which an antenna port corresponding to the reference signal belongs, an offset value corresponding to the code division multiplexing group, a scrambling factor corresponding to the code division multiplexing group, or other information that can be used to identify the code division multiplexing group.

It should be understood that steps in each embodiment of the present invention may be separately used as an embodiment. In another embodiment, an association relationship between the first parameter and the initialization factor may be stored.

According to implementation of the foregoing method, there may be a plurality of initialization factors in a sequence generating process. Further, in the present invention, the initialization factor is designed, so that a parameter of the generated initialization factor is associated with a port number or a CDM group. In this way, a case in which a same sequence is used for different CDM groups can be avoided, and a problem that a PAPR of a DMRS symbol is higher than that of a data symbol is resolved. In an embodiment:

• • The following initialization factor is used for a type 2 DMRS sequence:

$c_{\mathrm{init}}=\left(2^{17}\left(N_{symb}^{\mathrm{slot}}{n}_{s,f}^{\mu }+l+1\right)\left(2N_{\mathrm{ID}}^{n_{SCID}\left(\lambda \right)}+1\right)+2N_{\mathrm{ID}}^{n_{\mathrm{SCID}}\left(\lambda \right)}+n_{\mathrm{SCID}}\left(\lambda \right)+2^{17}\mathrm{floor}\left(\frac{\lambda }{2}\right)\right)\mathrm{mod}{2}^{31}$ $\square \mathrm{when}\lambda =0,n_{\mathrm{SCID}}\left(\lambda \right)+2^{17}\mathrm{floor}\left(\frac{\lambda }{2}\right)=n_{\mathrm{SCID}};$ $\square \mathrm{when}\lambda =1,n_{SCID}\left(\lambda \right)+2^{17}\mathrm{floor}\left(\frac{\lambda }{2}\right)=1-n_{SCID};\mathrm{or}$ $\square \mathrm{when}\lambda =2,n_{\mathrm{SCID}}\left(\lambda \right)+2^{17}\mathrm{floor}\left(\frac{\lambda }{2}\right)=n_{\mathrm{SCID}}+2^{17}.$

FIG. 5 is a schematic structural diagram of a sequence generating apparatus according to an embodiment of this application, where the sequence generating apparatus includes:

• • a determining module 501, configured to obtain an initialization factor of a first sequence, where the initialization factor is associated with a first parameter; and
  • a generation module 502, configured to generate the first sequence based on the initialization factor.

For obtaining, by the determining module 501, the initialization factor of the first sequence; and generating, by the generation module 502, the first sequence based on the initialization factor, refer to the steps in the embodiment shown in FIG. 4. For example, the determining module may perform step S401, or may perform step 401A and other steps such as generating a reference signal, and details are not described herein again.

The apparatus may further include a receiving module 503, configured to receive first signaling, where the first signaling is used to indicate the first parameter. The module may perform step S403, and details are not described herein again. The receiving module is further configured to receive a second reference signal.

The apparatus may further include: a sending module 504, configured to send a first reference signal. The apparatus may further include a processing module 505, configured to process the second reference signal based on the first sequence.

Some or all of the foregoing modules may be a same module. For example, the generation module, the determining module, and the processing module may be an entire processing module. This embodiment of the present invention also protects integration of the modules and division into a plurality of modules to implement a function of a module. For the functions in this embodiment, refer to various possible designs in the foregoing aspects.

With reference to the example in FIG. 2, the foregoing apparatuses may be in a form shown in FIG. 6.

A processor 601 is configured to obtain an initialization factor of a first sequence, where the initialization factor is associated with a first parameter.

The processor 601 is configured to generate the first sequence based on the initialization factor. The processor may further perform functions of the foregoing processing module and determining module.

The receiving module may be a receiver 602, and the sending module may be a transmitter 603. In an embodiment, the transmitter and the receiver may be an antenna, a set of circuit devices, or transceiver pins of a chip.

The present invention further provides a communications system, including the foregoing transceiver apparatuses, to complete uplink and downlink transmission of a signal. For example, after generating a first sequence, the transmit end generates a first reference signal based on the first sequence and sends the first reference signal; and the receive end receives a second reference signal and processes the second reference signal based on the first sequence.

The present invention further provides a chip. The foregoing chip may be a processor, or may include the foregoing receiver and transmitter.

The present invention further provides a computer program, to perform the methods according to the foregoing embodiments.

To better implement the embodiments of the present invention, an embodiment of the present invention further provides a computer-readable storage medium. The computer-readable storage medium stores one or more computer programs. The computer-readable storage medium may be a magnetic disk, an optical disc, a ROM, a RAM, or the like. The one or more computer programs are run on one or more processors in a transmit end device. When the computer programs are run, a procedure corresponding to the transmit end device in the method embodiment shown in FIG. 4 may be implemented. The one or more computer programs are run on one or more processors in a receive end device. When the computer programs are run, a procedure corresponding to the receive end device in the method embodiment shown in FIG. 4 may be implemented.

Although the present invention is described herein with reference to the embodiments, a scope of the claims of the present invention shall not be limited thereto. In a process of implementing the present invention that claims protection, a person skilled in the art may understand and implement all or a part of the processes in the foregoing embodiments by viewing the accompanying drawings, the disclosed content, and the accompanying claims. Equivalent modifications made in accordance with the claims of the present invention still fall within the scope of the present invention. In the claims, “comprising” does not exclude another component or another step, and “a” or “one” does not exclude a case of “a plurality of”. A single controller or another unit may implement several functions enumerated in the claims. Some measures are recorded in dependent claims that are different from each other, but this does not mean that these measures cannot be combined to produce a better effect. The computer program may be stored/distributed in a proper medium, for example, an optical storage medium or a solid state medium, and is provided together with other hardware or used as a part of hardware, or may be distributed in another manner, such as by using the Internet (English: Internet) or another wired or wireless system.

Claims

1. A sequence generating method, comprising: receiving a first reference signal from a communications device;determining an initialization factor, Cinit, wherein the initialization factor satisfies: cinit=(217(Nsymbslotns,fμ+1+1)(2NIDg(λ,nSCID)+g(λ, nSCID)+217└λ/2┘)mod231where Nsymbslot is a quantity of symbols in a slot, ns,fμ is an index of a subframe or a slot, 1 is an index of a symbol, nSCID is a scrambling factor, and NIDg(λ,nSCID) is a sequence scrambling identity, λ is a parameter with a value of 0, 1, or 2, and g(λ,nSCID) is a function that satisfies:

2. The method according to claim 1, wherein the parameter is a port number or a code division multiplexing (CDM) group identity.

3. The method according to claim 1, wherein the method further comprises: sending first signaling that indicates the parameter to the communications device.

4. An apparatus, comprising: at least one processor coupled to a memory device that stores programming instructions for execution by the at least one processor to cause the apparatus to: receive a first reference signal from a communications device;determine an initialization factor, Cinit, wherein the initialization factor satisfies: ti cinit=(217(Nsymbslotns,fμ+1+1)(2NIDg(λ,nSCID)+g(λ, nSCID)+217└λ/2┘)mod231,where Nsymbslot is a quantity of symbols in a slot, ns,fμ is an index of a subframe or the slot, 1 is an index of a symbol, nSCID is a scrambling factor, NgIDg(λ,nSCID) is a sequence scrambling identity, λ is a parameter with a value of 0, 1, or 2, and g(λ,nSCID) is a function that satisfies:

5. The apparatus according to claim 4, wherein the parameter is a port number or a code division multiplexing (CDM) group identity.

6. The apparatus according to claim 4, wherein the apparatus further comprises: send, through a transmitter, first signaling that indicates the parameter to the communications device.

7. A communications system, comprising a first communications device and a second communications device, wherein the first communications device is configured to perform operations comprising: receiving a first reference signal from the second communications device;determining an initialization factor, Cinit, wherein the initialization factor satisfies: ti cinit=(217(Nsymbslotns,fμ+1+1)(2NIDg(λ,nSCID)+g(λ, nSCID)+217└λ/2┘)mod231where Nsymbslot is a quantity of symbols in a slot, ns,fμ is an index of a subframe or the slot, 1 is an index of a symbol, nSCID is a scrambling factor, NgIDg(λ,nSCID) is a sequence scrambling identity, λ is a parameter with a value of 0, 1, or 2, and g(λ,nSCID) is a function that satisfies: g(λ, nSCID)=nSCID, when λ=0 or 2; org(λ, nSCID)=1−nSCID, when λ=1;processing the first reference signal based on the initialization factor.

8. The system according to claim 7, wherein the parameter is a port number or a code division multiplexing (CDM) group identity.

9. The system according to claim 7, wherein the operations further comprising: sending, through a transceiver, first signaling that indicates the parameter to the second communications device.

10. A signal processing apparatus, comprising: a transceiver;at least one processor; anda memory coupled to the at least one processor and storing programming instructions for execution by the at least one processor to perform operations comprising: receiving a first reference signal from the second communications device;determining an initialization factor, Cinit, wherein the initialization factor satisfies: cinit=(217(Nsymbslotns,fμ+1+1)(2NIDg(λ,nSCID)+g(λ, nSCID)+217└λ/2┘)mod231

11. The apparatus according to claim 10, wherein the parameter is a port number or a code division multiplexing (CDM) group identity.

12. The apparatus according to claim 10, wherein the operations further comprising: sending, through the transceiver, first signaling that indicates the parameter.

13. A non-transitory, computer-readable storage medium, storing programming instructions executable by at least one processor to perform operations comprising: receiving a first reference signal from the second communications device;determining an initialization factor, Cinit, wherein the initialization factor satisfies: cinit=(217(Nsymbslotns,fμ+1+1)(2NIDg(λ,nSCID)+g(λ, nSCID)+217└λ/2┘)mod231where Nsymbslot is a quantity of symbols in a slot, ns,fμ is an index of a subframe or the slot, 1 is an index of a symbol, nSCID is a scrambling factor, NgIDg(λ,nSCID) is a sequence scrambling identity, λ is a parameter with a value of 0, 1, or 2, and g(λ,nSCID) is a function that satisfies: g(λ, nSCID)=nSCID, when λ=0 or 2; org(λ, nSCID)=1−nSCID, when λ=1;processing the first reference signal based on the initialization factor.

14. The non-transitory, computer-readable storage medium according to claim 13, wherein the parameter is a port number or a code division multiplexing (CDM) group identity.

15. The non-transitory, computer-readable storage medium according to claim 13, wherein the operations further comprising: sending first signaling that indicates the parameter to the communications device.