Scrambling method and communication apparatus

Abstract

The present application provides a scrambling method and a communication apparatus. The scrambling method is applicable to probabilistic shaping pre-transform scenarios. A transmitting end device may scramble a partial bit sequence in a coded sequence obtained after probabilistic shaping pre-transform and channel coding, the partial bit sequence being bits that have not undergone probabilistic shaping pre-transform. The method in the embodiments of the present application may avoid breaking specific distribution introduced by probabilistic shaping pre-transform, and reduce the energy consumption and transmit power of transmitting end devices when transmitting modulation symbols.

Description

Scrambling methods and communication devices

[0001] This application claims priority to Chinese Patent Application No. 202411884022.9, filed on December 18, 2024, entitled "Scrambling Method and Communication Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of channel coding, and more specifically, to a scrambling method and related communication apparatus in channel coding. Background Technology

[0003] Higher-order modulation refers to mapping multiple bits to the same channel symbol, which can improve spectral efficiency. Common higher-order modulation schemes include quadrature amplitude modulation (QAM) and amplitude modulation (AM), such as 16QAM, 64QAM, and 256AM. Different symbols in higher-order modulation may have different energies; by transmitting more low-energy symbols and fewer high-energy symbols, average energy can be saved. Theoretical analysis shows that for a Gaussian white noise channel, the greatest energy saving occurs when the transmitted symbol distribution follows a Gaussian distribution. Compared to a uniform distribution, a Gaussian distribution can save up to 1.53 dB of transmit power.

[0004] Probabilistic shaping (PS) is a common "shaping" technique. It involves cascading a precoder before the encoder to map ("shape") the information bits into a sequence following a specific distribution (the precoder is also called a distribution matcher (DM), or some kind of transformation). Then, during the encoding process, systematic coding is used, ensuring that the aforementioned sequence satisfying the specific distribution ultimately appears directly in the encoded sequence, thus shaping the final modulated symbol. Probabilistic shaping can achieve a higher probability of occurrence for low-energy symbols than for high-energy symbols.

[0005] New Radio (NR) requires scrambling all bits before modulation to improve noise immunity. However, when probabilistic shaping is introduced, NR's scrambling method disrupts the specific distribution introduced by probabilistic shaping, thus reducing its energy-saving effect. Summary of the Invention

[0006] This application provides a scrambling method and a communication device that can avoid scrambling from disrupting the specific distribution introduced by probability shaping. In the case of probability shaping, it can reduce the energy consumption of the transmitting device when transmitting modulation symbols and reduce the transmission power.

[0007] Firstly, a scrambling method is provided, which can be executed by a communication device or a module applied to the communication device (e.g., a processor, chip, circuit, etc., or a logic module, hardware, and / or software capable of implementing all or part of the functions of the communication device). The communication device is also referred to as a transmitting device or an encoding device. The method may include: performing a first scrambling on a first bit sequence in a first coded sequence to obtain a second coded sequence, wherein the first coded sequence is a bit sequence obtained after channel coding, and the channel coding includes a probabilistic shaping pre-transformation, and the first bit sequence consists of bits in the first coded sequence that have not undergone the probabilistic shaping pre-transformation; mapping the bits in the second coded sequence onto modulation symbols; and outputting the modulated symbols.

[0008] The above technical solution scrambles the bits in the coded sequence that have not undergone probabilistic shaping pre-transformation, but does not scramble the bits that have already undergone probabilistic shaping pre-transformation, thereby avoiding the destruction of the specific distribution introduced by the probabilistic shaping pre-transformation, reducing the energy consumption of the transmitting equipment when transmitting modulation symbols, and reducing the transmission power.

[0009] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: obtaining a first information bit sequence; performing a probabilistic shaping pre-transformation on a portion of the first information bit sequence to obtain a second information bit sequence to be encoded, the second information bit sequence including bits that have undergone the probabilistic shaping pre-transformation and bits that have not undergone the probabilistic shaping pre-transformation; and performing channel coding on the second information bit sequence to obtain the first coding sequence.

[0010] The above technical solution can map the information bit sequence into a sequence that follows a specific distribution, which can make the probability of low-energy symbols appearing higher than that of high-energy symbols, thereby reducing the energy consumption and transmission power of the transmitting device when transmitting modulation symbols.

[0011] In conjunction with the first aspect, in some implementations of the first aspect, the first encoded sequence includes the second information bit sequence and the first check bit sequence, wherein the first bit sequence is the bits in the first encoded sequence that have not undergone probabilistic shaping pre-transformation, including: the first bit sequence includes some or all of the bits in the second information bit sequence that have not undergone probabilistic shaping pre-transformation.

[0012] In the above technical solution, the bits to be scrambled are related to the parameters of the probabilistic shaping pretransformation, and the bits that have not undergone the probabilistic shaping pretransformation are scrambled to avoid destroying the specific distribution introduced by the probabilistic shaping pretransformation.

[0013] In conjunction with the first aspect, in some implementations of the first aspect, the first encoded sequence includes the second information bit sequence and the first parity bit sequence, wherein the first bit sequence is the bits in the first encoded sequence that have not undergone probabilistic shaping pre-transformation, including: the first bit sequence includes some or all of the parity bits in the first parity bit sequence.

[0014] In the above technical solution, the bits to be scrambled are related to the parameters of the channel coding, and the check bits added to the channel coding after the probability shaping pre-transformation are scrambled, which can avoid destroying the specific distribution introduced by the probability shaping pre-transformation.

[0015] In conjunction with the first aspect, in some implementations of the first aspect, the first bit sequence is the bit in the first coding sequence that has not undergone probabilistic shaping pre-transformation, including: the first bit sequence includes some or all of the bits in the first coding sequence that are mapped to the first two bits of each modulation symbol.

[0016] In the above technical solution, the bits to be scrambled are related to the bit positions of the modulation symbols. The first one or two bits of the encoded sequence after channel coding that need to be mapped to the modulation symbols are scrambled. The scrambled bits can affect the sign of the symbol energy, but do not affect the energy of the symbol. Therefore, this scrambling method can still achieve a higher probability of low-energy symbols than high-energy symbols, reducing the energy consumption of the transmitting equipment when transmitting modulation symbols and reducing the transmission power.

[0017] In conjunction with the first aspect, in some implementations of the first aspect, the above method further includes: performing a second scrambling on the first information bit sequence to obtain a third information bit sequence; performing a probabilistic shaping pre-transformation on a portion of the first information bit sequence to obtain a second information bit sequence to be encoded, which includes: performing a probabilistic shaping pre-transformation on a portion of the third information bit sequence to obtain a second information bit sequence to be encoded.

[0018] The above technical solution adds a scrambling operation before the probabilistic shaping pretransformation, which does not destroy the specific distribution introduced by the probabilistic shaping pretransformation, and the scrambling operation can also improve the anti-interference ability.

[0019] In conjunction with the first aspect, in some implementations of the first aspect, the first scrambling of the first bit sequence in the first encoded sequence includes: performing a first scrambling on the first bit sequence in the first encoded sequence based on a first scrambling sequence, wherein the length of the first scrambling sequence is equal to the length of the first bit sequence; and / or, the second scrambling of the first information bit sequence includes: performing a second scrambling on the first information bit sequence based on a second scrambling sequence, wherein the length of the second scrambling sequence is equal to the length of the first information bit sequence.

[0020] Secondly, a scrambling method is provided, which can be executed by a communication device or a module applied to the communication device (e.g., a processor, chip, circuit, etc., or a logic module, hardware, and / or software capable of implementing all or part of the functions of the communication device). The communication device is also referred to as a transmitting device or an encoding device. The method may include: acquiring a first information bit sequence; performing a second scrambling on the first information bit sequence to obtain a third information bit sequence; and performing a probabilistic shaping pre-transformation on a portion of the third information bit sequence to obtain a second information bit sequence to be encoded, the second information bit sequence including bits that have undergone the probabilistic shaping pre-transformation and bits that have not undergone the probabilistic shaping pre-transformation.

[0021] The above technical solution adds a scrambling operation before the probability shaping pre-transformation, which does not destroy the specific distribution introduced by the probability shaping pre-transformation, reduces the energy consumption of the transmitting equipment when transmitting modulation symbols, and lowers the transmission power; in addition, the scrambling operation can also improve the anti-interference capability.

[0022] In conjunction with the second aspect, in some implementations of the second aspect, the above method further includes: channel coding the second information bit sequence to obtain a first coding sequence; performing a first scrambling on the first bit sequence in the first coding sequence to obtain a second coding sequence, wherein the first bit sequence is the bit in the first coding sequence that has not undergone probabilistic shaping pre-transformation; mapping the bits in the second coding sequence onto modulation symbols; and outputting the modulated symbols.

[0023] The above technical solution scrambles the bits in the coded sequence that have not undergone probabilistic shaping pre-transformation, but does not scramble the bits that have already undergone probabilistic shaping pre-transformation, thereby avoiding the destruction of the specific distribution introduced by the probabilistic shaping pre-transformation, reducing the energy consumption of the transmitting equipment when transmitting modulation symbols, and reducing the transmission power.

[0024] In conjunction with the second aspect, in some implementations of the second aspect, the first encoding sequence includes the second information bit sequence and the first check bit sequence, wherein the first bit sequence is the bits in the first encoding sequence that have not undergone probabilistic shaping pre-transformation, including: the first bit sequence includes some or all of the bits in the second information bit sequence that have not undergone probabilistic shaping pre-transformation.

[0025] In the above technical solution, the bits to be scrambled are related to the parameters of the probabilistic shaping pretransformation, and the bits that have not undergone the probabilistic shaping pretransformation are scrambled to avoid destroying the specific distribution introduced by the probabilistic shaping pretransformation.

[0026] In conjunction with the second aspect, in some implementations of the second aspect, the first encoding sequence includes the second information bit sequence and the first check bit sequence, wherein the first bit sequence is the bits in the first encoding sequence that have not undergone probabilistic shaping pre-transformation, including: the first bit sequence includes some or all of the check bits in the first check bit sequence.

[0027] In the above technical solution, the bits to be scrambled are related to the parameters of the channel coding, and the check bits added to the channel coding after the probability shaping pre-transformation are scrambled, which can avoid destroying the specific distribution introduced by the probability shaping pre-transformation.

[0028] In conjunction with the second aspect, in some implementations of the second aspect, the first bit sequence is the bit in the first coding sequence that has not undergone probabilistic shaping pre-transformation, including: the first bit sequence includes some or all of the bits in the first coding sequence that are mapped to the first two bits of each modulation symbol.

[0029] In the above technical solution, the bits to be scrambled are related to the bit positions of the modulation symbols. The first one or two bits of the encoded sequence after channel coding that need to be mapped to the modulation symbols are scrambled. The scrambled bits can affect the sign of the symbol energy, but do not affect the energy of the symbol. Therefore, this scrambling method can still achieve a higher probability of low-energy symbols than high-energy symbols, reducing the energy consumption of the transmitting equipment when transmitting modulation symbols and reducing the transmission power.

[0030] In conjunction with the second aspect, in some implementations of the second aspect, the first scrambling of the first bit sequence in the first encoded sequence includes: performing a first scrambling on the first bit sequence in the first encoded sequence based on a first scrambling sequence, wherein the length of the first scrambling sequence is equal to the length of the first bit sequence; and / or, the second scrambling of the first information bit sequence includes: performing a second scrambling on the first information bit sequence based on a second scrambling sequence, wherein the length of the second scrambling sequence is equal to the length of the first information bit sequence.

[0031] Thirdly, a communication device is provided, which has the function of implementing the method in the first aspect or any possible implementation of the first aspect. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more units corresponding to the above-described function.

[0032] Fourthly, a communication device is provided, which has the function of implementing the method in the second aspect or any possible implementation of the second aspect. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more units corresponding to the above-described function.

[0033] Fifthly, a communication device is provided, comprising at least one processor configured to cause the communication device to execute the method of the first aspect or any possible implementation thereof; or to execute the method of the second aspect or any possible implementation thereof. Optionally, the at least one processor is coupled to at least one memory for storing computer programs or instructions, and the at least one processor is configured to call and run the computer program or instructions from the at least one memory, causing the communication device to execute the method of the first aspect or any possible implementation thereof; or to execute the method of the second aspect or any possible implementation thereof. Optionally, the at least one processor may be included in the communication device or may be configured outside the communication device. Optionally, the communication device further includes the at least one memory. Optionally, the communication device further includes at least one communication interface. As an example, the communication interface may include an input interface and / or an output interface, or may be an interface circuit.

[0034] Sixthly, a communication device is provided, comprising a communication interface and a circuit. The communication interface is configured to receive a signal to be processed and transmit the signal to the circuit. The circuit is configured to process the signal to perform a method as described in the first aspect or any possible implementation thereof; or to perform a method as described in the second aspect or any possible implementation thereof. Optionally, the communication interface is further configured to output a signal processed by the circuit. Optionally, the signal may include information and / or data. Optionally, the communication device may be a chip (e.g., a baseband chip) or a chip system.

[0035] A seventh aspect provides a computer-readable storage medium storing computer program code or instructions that, when executed on a computer, cause the method of the first aspect or any possible implementation thereof to be implemented; or, the method of the second aspect or any possible implementation thereof to be implemented.

[0036] Eighthly, a computer program product is provided, the computer program product comprising computer program code or instructions, which, when executed on a computer, cause the method in the first aspect or any possible implementation thereof to be implemented; or, as in the second aspect or any possible implementation thereof, the method to be implemented.

[0037] A ninth aspect provides a wireless communication system, including a communication device as described in the third aspect or including a communication device as described in the fourth aspect. Attached Figure Description

[0038] Figure 1 is a schematic flowchart of probabilistic shaping technology.

[0039] Figure 2 shows the constellation distribution after probabilistic shaping.

[0040] Figure 3 shows an example of a communication system applicable to the technical solution of this application.

[0041] Figure 4 is a schematic diagram of the basic process of wireless communication.

[0042] Figure 5 is a flowchart of an example encoding chain.

[0043] Figure 6 is a schematic flowchart of the scrambling or descrambling method 200 provided in this application.

[0044] Figure 7 is a schematic structural diagram of the communication device 1000 provided in this application.

[0045] Figure 8 is a schematic structural diagram of another communication device provided in this application.

[0046] Figure 9 is a schematic structural diagram of the chip provided in this application. Detailed Implementation

[0047] The technical solutions in this application will now be described with reference to the accompanying drawings.

[0048] Higher-order modulation refers to mapping multiple bits to the same channel symbol. Table 1 shows a 16ASK bit mapping relationship. During the modulation process, the modulation symbol x is determined based on bits b0, b1, b2, and b3, and is used as the modulation symbol to be transmitted.

[0049] Table 1

[0050] Since different symbols may have different energies in high-order modulation, average energy can be saved by sending more low-energy symbols and fewer high-energy symbols. Probabilistic shaping is a common "shaping" technique, and its typical flowchart is shown in Figure 1.

[0051] Figure 1 is a schematic flowchart of probabilistic shaping technology. As shown in Figure 1, by cascading a precoder before the channel encoder, the information bits are mapped ("shaped") to a sequence that follows a specific distribution. The precoder is also called a distribution matcher (DM) or probabilistic shaping pretransform. Then, during the encoding process, systematic coding is used so that the aforementioned sequence following the specific distribution ultimately appears directly in the encoded sequence, thereby shaping the final modulation symbol. It should be noted that Figure 1 shows one possible implementation of the probabilistic shaping pretransform; other pretransformation methods are also possible, and this is only an example. In Figure 1, the bit sequence to be encoded is u1u2…u K The bit sequence u1u2…u z As input for channel coding; another part of the bit sequence u z+1 u z+2 …u K As the input to the probabilistic shaping pretransform, the output of the probabilistic shaping pretransform is the bit sequence p1p2…p s Without probabilistic shaping pretransformation, the input to channel coding is a bit sequence u1u2…u z At this point, the input length of the channel coding is K1 = z = K; however, when the probabilistic shaping pretransform is enabled, the input of the channel coding is a bit sequence u1u2…u z The bit sequence p1p2…p of the output of the probabilistic shaping pretransform s These two parts, at this point the input length of the channel coding is K1 = z + s.

[0052] Figure 2 shows the constellation distribution after probabilistic shaping. It can be seen that low-energy symbols appear more frequently than high-energy symbols.

[0053] New Radio (NR) requires scrambling all bits before modulation to improve noise immunity. However, NR's scrambling method disrupts the specific distribution introduced by probabilistic shaping pre-modulation, thus failing to save energy.

[0054] Therefore, this application provides a scrambling or descrambling method that redesigns the scrambling method of NR, which can avoid scrambling from destroying the specific distribution introduced by the probability shaping pretransformation, thereby saving average energy.

[0055] The technical solution of this application is described below.

[0056] The technical solutions of this application can be applied to various existing and future communication systems, including but not limited to: satellite communication systems, fifth-generation (5G) systems or new radio (NR) systems, long-term evolution (LTE) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, and future communication systems. Furthermore, they can also be applied to sidelink (SL) communication, vehicle-to-everything (V2X) communication, machine-to-machine (M2M) communication, machine-type communication (MTC), and Internet of Things (IoT) communication systems, or other communication systems, etc., which are not limited herein.

[0057] Figure 3 illustrates an example of a communication system 100 applicable to the technical solutions of this application. As shown in Figure 3, the communication system 100 may include one or more transmitting devices and one or more receiving devices. Optionally, one of the transmitting device and the receiving device may be a terminal device, and the other may be a network device. The scrambling or descrambling method provided in this application is applicable to communication between the network device and the terminal device shown in Figure 3, i.e., uplink communication or downlink communication. For example, in downlink communication, the transmitting device in this embodiment is a network device, and the receiving device is a terminal device; in uplink communication, the transmitting device in this embodiment is a terminal device, and the receiving device is a network device.

[0058] For example, a terminal device may also be referred to as user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, mobile terminal (MT), remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user apparatus. In the embodiments of this application, the terminal device may be a device that provides voice and / or data connectivity to a user, and can be used to connect people, objects, and machines, such as a handheld device with wireless connectivity, in-vehicle equipment, etc. The terminal device in the embodiments of this application may be a mobile phone, tablet computer, laptop computer, PDA, mobile internet device (MID), wearable device, virtual reality (VR) device, augmented reality (AR) device, wireless terminal in industrial control, wireless terminal in self-driving, wireless terminal in remote medical surgery, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, wireless terminal in smart home, etc. Optionally, the UE may be used as a base station. For example, the UE may act as a scheduling entity, providing sidelink signals between UEs in V2X or SL, etc.

[0059] In this embodiment, the device used to implement the functions of the terminal device can be the terminal device itself, or any device capable of supporting the terminal device in implementing the corresponding functions, such as a chip, processor, circuit, hardware, and / or software combination. This device is located on the terminal side and can be configured within or used in conjunction with the terminal device. The chip system can consist of chips or include chips and other discrete components. In this embodiment, the terminal device is used as an example to illustrate the device for implementing the corresponding functions of the terminal device.

[0060] The network device in this application embodiment may include a device for communicating with a terminal device. This network device may include an access network device or a radio access network device; for example, the network device may be a base station. In this application embodiment, the access network device may refer to a radio access network (RAN) node (or device) that connects the terminal device to the wireless network. A base station can broadly encompass, or be replaced by, various names such as: NodeB, evolved NodeB (eNB), next-generation NodeB (gNB), relay station, access point, transmitting and receiving point (TRP), transmitting point (TP), master station, auxiliary station, motor slide retainer (MSR) node, home base station, network controller, access node, wireless node, access point (AP), transmission node, transceiver node, baseband unit (BBU), remote radio unit (RRU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), radio unit (RU), positioning node, etc. A base station can be a macro base station, micro base station, relay node, donor node, or a combination thereof. A base station can also refer to a communication module, modem, or chip installed within the aforementioned equipment or apparatus. A base station can also be a mobile switching center, a device performing base station functions in D2D, V2X, and M2M communications, a network device (e.g., a base station) in a future communication network, or a device performing network device functions. A base station can support networks using the same or different access technologies. Optionally, a RAN node can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, the access network equipment in vehicle-to-everything (V2X) technology can be a roadside unit (RSU). The embodiments of this application do not limit the specific technology or device form used in the network equipment.

[0061] Base stations can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile base station, and one or more cells can move depending on the location of the mobile base station. In other examples, a helicopter or drone can be configured as a device to communicate with another base station.

[0062] In some deployments, the network device in this application embodiment may be a device including a CU, or a DU, or a device including both CU and DU, or a control plane CU node (central unit-control plane (CU-CP)) and a user plane CU node (central unit-user plane (CU-UP)) and a DU node. For example, the network device may include gNB-CU-CP, gNB-CU-UP, and gNB-DU.

[0063] In some deployments, multiple RAN nodes collaborate to assist terminals in achieving wireless access, with different RAN nodes each implementing some of the base station's functions. For example, RAN nodes can be CUs, DUs, CU-CPs, CU-UPs, or RUs. CUs and DUs can be configured separately or included in the same network element, such as a BBU. RUs can be included in radio frequency equipment or radio frequency units, such as RRUs, AAUs, or RRHs.

[0064] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an open radio access network (ORAN / O-RAN) system, CU can also be called an open CU (open CU, O-CU), and DU can also be called an open DU (open DU, O-DU). CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software modules and hardware modules.

[0065] In this embodiment, the device used to implement the functions of the network device can be the network device itself; it can also be a device capable of supporting the network device in implementing the corresponding functions, such as a chip, processor, circuit, hardware, and / or software combination. This device is located on the network side and can be configured within or used in conjunction with the network device. In this embodiment, only the network device is used as an example to illustrate the implementation of the corresponding functions of the network device.

[0066] Figure 4 is a schematic diagram of the basic process of wireless communication. As shown in Figure 4, at the signal transmitting end, the signal source is transmitted after sequentially undergoing source coding, channel coding, and modulation. At the signal receiving end, the received signal is sequentially demodulated, channel decoded, and source recovered before being output to the destination. Among these, channel coding and channel decoding are one of the core technologies in the field of wireless communication.

[0067] The scrambling or descrambling methods provided in this application can be used in dedicated network devices or general-purpose devices, and can be applied to the various network devices (e.g., base stations) and terminal devices mentioned above. Specifically, the scrambling scheme is mainly implemented by the channel coding unit (e.g., encoder or device that supports the coding device to implement the corresponding function) in these devices; the descrambling scheme is mainly implemented by the channel decoding unit (e.g., decoder or device that supports the decoding device to implement the corresponding function) in these devices.

[0068] Optionally, the functions of the encoding or decoding device can be implemented by application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or by software (e.g., program code in memory), or by a combination of both, without limitation.

[0069] Figure 5 shows a flowchart of an example encoding chain.

[0070] Specifically, the transmitting device can divide the information data into multiple TBs according to the system-supported transport block (TB) size (TBS), and add a cyclic redundancy check (CRC) code (TB-CRC) to each TB. If the TB size after adding the CRC code exceeds the maximum code block length, the TB can be segmented to obtain multiple code blocks (CBs). Each segmented CB can be further CRC-coded (CB-CRC) to obtain the input to be encoded corresponding to each CB. This input to be encoded is a sequence of bits to be encoded, which may include the information bits and check bits (i.e., the CRC code) in its corresponding CB. The transmitting device can perform channel coding on this input to be encoded, such as low-density parity check (LDPC) coding, to obtain the corresponding encoded sequence. Rate matching is performed on the encoded sequence, and the rate-matched encoded sequences are interleaved to form codewords (CWs). The transmitting device can scramble the codewords to generate scrambled bits. The scrambled bits are modulated to obtain modulation symbols. After being mapped by resource elements (REs), the modulation symbols are mapped onto multiple REs, thus obtaining the value carried on each RE. Based on the values ​​carried on these REs, the transmitting device can generate a baseband signal. The baseband signal can then be processed by radio frequency (RF) or intermediate radio frequency (IRF) before being transmitted by the antenna.

[0071] The probabilistic shaping pre-transformation is generally performed before channel coding. The scrambling or descrambling methods provided in this application are described in detail below.

[0072] Figure 6 is a schematic flowchart of the scrambling or descrambling method 200 provided in this application. Steps 210 to 222 in method 200 can be performed by a transmitting device (or an information transmitting device), such as by the transmitting device or a device applied to the transmitting device (e.g., a chip, processor, or circuit), which can be an encoding device. Optionally, method 200 further includes steps 224 to 232, which can be performed by a receiving device (or an information receiving device), such as by the receiving device or a device applied to the receiving device (e.g., a chip, processor, or circuit), which can be a decoding device.

[0073] Optionally, before performing the scrambling or descrambling method provided in this application, method 200 further includes steps S210 to S216:

[0074] 210. The sending device acquires the first information bit sequence.

[0075] Specifically, the first information bit sequence is the bit sequence to be encoded.

[0076] 214. The transmitting device performs a probabilistic shaping pre-transformation on a portion of the first information bit sequence to obtain the second information bit sequence to be encoded.

[0077] Specifically, the second information bit sequence includes bits that have undergone probabilistic shaping pre-transformation and bits that have not undergone probabilistic shaping pre-transformation. For example, the bit sequence to be encoded in the example shown in Figure 1 above is u1u2…u K This can be used as the first information bit sequence mentioned above; where the bit sequence u z+1 u z+2 …u K These are bits that need to undergo probability shaping pre-transformation and can be used as part of the first information bit sequence mentioned above; the bit sequence u1u2…u z The first information bit sequence does not require probabilistic shaping pre-transformation and can be another part of the first information bit sequence. The second information bit sequence can include the probabilistically shaped pre-transformed bits and the unprobabilistically shaped pre-transformed bits in the first information bit sequence, where the unprobabilistically shaped pre-transformed bits in the first information bit sequence are u1u2…u z The bits u in the first information bit sequence that need to undergo probability shaping pre-transformation z+1 u z+2 …u K After probabilistic shaping pretransformation, we obtain p1p2…p s Therefore, the second information bit sequence includes u1u2…u z and p1p2…p s These two parts.

[0078] 216. The transmitting device performs channel coding on the second information bit sequence to be encoded to obtain the first coded sequence.

[0079] For example, the transmitting device may perform LDCP encoding or Polar encoding on the second information bit sequence to be encoded, etc., and this application does not limit this.

[0080] For example, the transmitting device uses systematic code encoding during the encoding process, and the original data is directly included in the encoded sequence. For instance, the second information bit sequence can be directly included in the encoded first sequence. In addition, the first encoded sequence also includes redundant bits from the channel coding process, which are added parity bits. Therefore, the first encoded sequence includes the second information bit sequence and the first parity bit sequence.

[0081] Specifically, the aforementioned first check bit sequence is related to the parameters of the channel coding. For example, the first check bit sequence can be added based on the code rate R and the code length N of the channel coding. For instance, for LDPC coding, if the code rate R = K / N, the code length N, and the number of bits in the original data (i.e., the number of bits in the second information bit sequence) is K, then the number of bits in the first check bit sequence is NK.

[0082] 218. The transmitting device performs a first scrambling on the first bit sequence in the first encoded sequence to obtain the second encoded sequence.

[0083] Specifically, the first bit sequence mentioned above is the bit in the first coding sequence that has not undergone probabilistic shaping pre-transformation, that is, the first bit sequence is a portion of the bits in the first coding sequence.

[0084] Example 1: The first bit sequence described above includes some or all of the bits in the second information bit sequence that have not undergone probabilistic shaping pre-transformation. For example, in the example shown in Figure 1 above, the bits in the second information bit sequence that have not undergone probabilistic shaping pre-transformation are u1u2…u z The first bit sequence may include u1u2…u z This application does not limit the number of bits in the data to some or all of them.

[0085] Example 2: The first bit sequence mentioned above includes some or all of the bits in the first check bit sequence mentioned above.

[0086] Specifically, the aforementioned first parity bit sequence is a redundant bit in the channel coding process, which has not undergone probabilistic shaping pre-transformation, and therefore can be scrambled. For example, for LDPC coding, if the channel coding rate R = K / N, the channel coding code length is N, and the number of bits in the original data (i.e., the number of bits in the second information bit sequence) is K, then the number of bits in the first parity bit sequence is NK. The first bit sequence may include some or all of the parity bits in the NK bits of the first parity bit sequence; this application does not limit this.

[0087] Example 3: The first bit sequence mentioned above includes some or all of the bits in the first coded sequence that are mapped to the first j bits of each modulation symbol.

[0088] Specifically, i is the bit index in each modulation symbol, ranging from 0 to Q. m The value of -1 is taken to satisfy i mod Q. m Bits ≤ 1 can belong to the first bit sequence. Therefore, the first bit (i = 0) and the second bit (i = 1) in each modulation symbol can satisfy this condition. Thus, the first bit sequence includes some or all bits in the first coding sequence that are mapped to the first and second bits of each modulation symbol. In other words, the first bit sequence includes some or all bits in the first coding sequence that are mapped to the first two bits of each modulation symbol.

[0089] For example, 16QAM modulation has a modulation order of 4, and each modulation symbol can be mapped to 4 bits. The first bit sequence can include the first bit in the first coding sequence mapped to the modulation symbol (e.g., bit b0 in Table 1 above). The first bit of the modulation symbol is used to determine the sign of the energy of the modulation symbol, but cannot determine the level of energy. 256AM modulation has a modulation order of 8, and each modulation symbol can be mapped to 8 bits. The first bit sequence can include the first and second bits in the first coding sequence mapped to the modulation symbol. The first and second bits of the modulation symbol are used to determine the sign of the energy of the modulation symbol, but cannot determine the level of energy. This application does not limit this.

[0090] Examples 1, 2, and 3 above can also be used in combination. One example: some bits in the second information bit sequence included in the first bit sequence that have not undergone probabilistic shaping pre-transformation may also be some bits mapped to the first two bits of each modulation symbol; another example: some bits in the first bit sequence that are mapped to the first two bits of each modulation symbol may also be some bits in the first check bit sequence; yet another example: the first bit sequence may include two parts of bits, one part being the bits shown in Example 1, 2, or 3, and the other part being the bits shown in the examples excluding that part; yet another example: the first bit sequence may include three parts of bits, which are the bits shown in Examples 1, 2, and 3 above, respectively, and this application does not limit this.

[0091] For example, the aforementioned transmitting device can perform a first scrambling on the first bit sequence in the first encoded sequence based on the first scrambling sequence to obtain a second encoded sequence. This second encoded sequence can be obtained using the following formula 1:

[0092] Among them, in the above formula 1 b represents the scrambled i-th bit in the second encoded sequence. (q) (i) represents the i-th bit in the first bit sequence, c (q) (i) represents the i-th bit in the first scrambling sequence, and mod represents the modulo operation.

[0093] Specifically, the length of the first scrambling sequence is equal to the length of the first bit sequence. For each bit in the first bit sequence, scrambling means performing an XOR operation between that bit and the corresponding scrambling bit in the first scrambling sequence. If the bit is the same as the corresponding scrambling bit in the first scrambling sequence, the scrambling result is 0; if the bit is not the same as the corresponding scrambling bit in the first scrambling sequence, the scrambling result is 1.

[0094] Specifically, the unscrambled bits in the second encoded sequence are the same as the remaining bits in the first encoded sequence excluding the first bit sequence.

[0095] Optionally, step 218 can be omitted. In this case, method 200 can execute step 212 after step 210, whereby the transmitting device performs a second scrambling on the first information bit sequence to obtain the third information bit sequence. Accordingly, step 214 should be: the transmitting device performs a probability shaping pre-transformation on a portion of the third information bit sequence to obtain the second information bit sequence to be encoded.

[0096] For example, in step 212, the transmitting device can perform a second scrambling on all bits in the first information bit sequence based on the second scrambling sequence to obtain a third information bit sequence. The third information bit sequence can also be obtained using the above formula 1, wherein in the above formula 1... b represents the i-th bit in the third information bit sequence. (q) (i) represents the i-th bit in the first information bit sequence, c (q) (i) represents the i-th bit in the second scrambling sequence.

[0097] Specifically, the length of the second scrambling sequence is equal to the length of the first information bit sequence. For each bit in the first information bit sequence, scrambling means performing an XOR operation between that bit and the corresponding scrambling bit in the second scrambling sequence. If the bit is the same as the corresponding scrambling bit in the second scrambling sequence, the scrambling result is 0; if the bit is different from the corresponding scrambling bit in the second scrambling sequence, the scrambling result is 1.

[0098] Optionally, steps 212 and 218 can be performed simultaneously.

[0099] 220. The transmitting device maps the bits in the second coded sequence onto the modulation symbols.

[0100] For example, the modulation scheme of this application can be 16QAM, 64QAM, 256AM, etc., and this application does not limit it.

[0101] Optionally, if step 218 is not performed, step 220 should be: the transmitting device maps the bits in the first coded sequence to the modulation symbols.

[0102] 222. The transmitting device outputs the modulated symbol.

[0103] The modulated symbol output by the transmitting device can be a modulated symbol sent by the transmitting device to the receiving device.

[0104] Optionally, method 200 may also include a descrambling method on the decoding side. This will be explained below in conjunction with steps 224 to 232.

[0105] 224. The receiving device acquires the symbols to be demodulated and demodulates them to obtain the first received sequence.

[0106] The symbol to be demodulated can refer to the modulated symbol output from the encoding side, the received message at the decoding side after transmission through the channel.

[0107] 226. The receiving device performs a first descrambling on the first received sequence to obtain the second received sequence.

[0108] 228. The receiving device performs channel decoding on the second received sequence to obtain the third received sequence.

[0109] Optionally, 230, the receiving device performs an inverse probabilistic shaping pre-transformation on a portion of the third received sequence to obtain a fourth received sequence.

[0110] Optionally, 232, the receiving device performs a second descrambling on the fourth received sequence to obtain the fifth received sequence.

[0111] In steps 224-232, the demodulation, first descrambling, channel decoding, and second descrambling processes performed by the receiving device are the inverse processes of modulation, first scrambling, channel coding, and second scrambling performed by the transmitting device, and the principle is the same as that on the transmitting device side. Those skilled in the art can understand how the decoding side performs demodulation, first descrambling, channel decoding, and second descrambling based on the description on the coding side, so it will not be repeated here.

[0112] The scrambling method described above can avoid disrupting the specific distribution introduced by probability shaping. When probability shaping is introduced, it can reduce the energy consumption of the transmitting device when transmitting modulation symbols and reduce the transmission power.

[0113] The communication device provided in this application is described below.

[0114] Figure 7 is a schematic structural diagram of the communication device 1000 provided in this application. The communication device 1000 can be a transmitting device, or a device applied to the transmitting device that can realize the corresponding functions of the transmitting device in the method embodiments of this application, such as a chip, processor, or circuit. Alternatively, the communication device 1000 can be a receiving device, or a device applied to the receiving device that can realize the corresponding functions of the receiving device in the method embodiments of this application, such as a chip, processor, or circuit.

[0115] Optionally, the communication device 1000 includes a processing module 1001, which may be a processor, a processing board, a processing unit, or a processing device, etc. When the communication device 1000 is a transmitting device or a device applied to a transmitting device, the processing module 1001 is used to perform a first scrambling on the first bit sequence in the first encoded sequence to obtain a second encoded sequence, etc. Specific processes can be found in the detailed descriptions of the corresponding steps in the method embodiments, and will not be repeated here. When the communication device 1000 is a receiving device or a device applied to a receiving device, the processing module 1001 is used to perform a first descrambling on the first received sequence to obtain a second received sequence, etc. Specific processes can be found in the detailed descriptions of the corresponding steps in the method embodiments, and will not be repeated here.

[0116] Optionally, the communication device 1000 further includes a communication module 1002, which may also be referred to as a transceiver module, transceiver, transceiver unit, or transceiver device, etc., for performing receiving (or input) and / or sending (or output) operations. For example, when the communication device 1000 is a transmitting device or a device applied to a transmitting device, the communication module 1002 can be used to acquire a first information bit sequence and transmit the first information bit sequence to the processing module 1001; and output symbols modulated by the processing module 1001. Similarly, when the communication device 1000 is a receiving device or a device applied to a receiving device, the communication module 1002 can be used to receive symbols to be demodulated and send the symbols to be demodulated to the processing module 1001; and output a third received sequence obtained by the processing module 1001 decoding the symbols to be demodulated. Furthermore, it should be noted that the aforementioned communication module and / or processing module can be implemented through virtual modules. For example, the processing module can be implemented through a software functional unit or a virtual device, and the communication module can be implemented through a software function or a virtual device. Alternatively, the processing module or communication module can also be implemented by a physical device, such as a chip / circuit (e.g., an integrated circuit or logic circuit). The communication module can be an input / output circuit and / or a communication interface, performing input operations (corresponding to the aforementioned receiving operation) and output operations (corresponding to the aforementioned sending operation); the processing module is an integrated processor, microprocessor, or circuit (e.g., an integrated circuit, logic circuit).

[0117] The module division in this application is illustrative and represents only one logical functional division. In actual implementation, other division methods are possible. Furthermore, the functional modules in the various examples of this application can be integrated into a single processor, exist as separate physical entities, or be integrated into a single module. The integrated modules described above can be implemented in hardware, as software functional modules, or a combination of hardware and software.

[0118] Figure 8 is a schematic structural diagram of another communication device provided in this application. The communication device 1100 can be used to implement the functions of any communication device (e.g., a transmitting device or a receiving device) in the communication system described in the foregoing examples. The communication device 1100 may include at least one processor 1110. Optionally, the processor 1110 (or processing device) is coupled to a memory, which may be located within the communication device, integrated with the processor, or located outside the communication device. For example, the communication device 1100 may also include at least one memory 1120. The memory 1120 stores computer programs, instructions, or data necessary for implementing any of the above method embodiments; the processor 1110 may execute the computer programs, instructions, or data stored in the memory 1120 to perform the corresponding functions of the transmitting device or receiving device in any of the above embodiments.

[0119] Optionally, the communication device 1100 may further include a communication interface 1130, through which the communication device 1100 can interact with other devices. For example, the communication interface 1130 may be a transceiver, circuit, bus, module, pin, or other type of communication interface. When the communication device 1100 is a chip-type device or circuit, the communication interface 1130 in the device 1100 may also be an input / output circuit, capable of inputting information (or receiving information) and / or outputting information (or sending information). The processor may be an integrated circuit or logic circuit, etc., and the processor can determine the output information based on the input information.

[0120] The coupling in this application refers to indirect coupling or communication connection between devices, units, or modules, which can be electrical, mechanical, or other forms, used for information exchange between devices, units, or modules. The processor 1110 may operate in conjunction with the memory 1120 and the communication interface 1130. This application does not limit the connection medium between the processor 1110, the memory 1120, and the communication interface 1130.

[0121] Figure 9 is a schematic structural diagram of the chip provided in this application. Chip 30 includes circuit 31 and communication interface 32. Circuit 31 can be a logic circuit, integrated circuit, etc., and communication interface 32 can also be called input / output circuit, input / output interface, interface circuit, etc., which can input information (or receive information) or output information (or send information). Chip 30 can execute the methods executed by the transmitting end device or the receiving end device in the various embodiments of this application.

[0122] In addition, this application also provides a computer-readable storage medium storing computer instructions, which, when executed on a computer, cause the operations and / or processes performed by the sending or receiving device in the various method embodiments of this application to be executed.

[0123] This application also provides a computer program product, which includes computer program code or instructions. When the computer program code or instructions are run on a computer, the operations and / or processes performed by the sending end device or the receiving end device in the various method embodiments of this application are executed.

[0124] Furthermore, this application also provides a chip including a processor. A memory for storing a computer program is provided independently of the chip, and the processor is used to execute the computer program stored in the memory, so that operations and / or processes performed by a transmitting or receiving device in any method embodiment are executed. Further, the chip may also include a communication interface. The communication interface may be an input / output interface or an interface circuit, etc. Further, the chip may also include the memory.

[0125] This application provides a communication system, including the transmitting end device and the receiving end device in the above method embodiments.

[0126] 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.

[0127] In the embodiments of this application, "instruction" can include direct instruction, indirect instruction, explicit instruction, and implicit instruction. When describing a certain instruction information for instructing A, it can be understood that the instruction information carries A, which can be a direct instruction to A or an indirect instruction to A. Indirect instruction can refer to directly instructing B through the instruction information, and the correspondence between B and A, to achieve the purpose of instructing A through the instruction information. The correspondence between B and A can be predefined by the protocol, pre-stored, or obtained through configuration between network elements.

[0128] The processor in this application embodiment has signal processing capabilities and can be a central processing unit (CPU), or a general-purpose processor, digital signal processor (DSP), application-specific integrated circuit (ASIC), field-programmable gate array (FPGA), or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component. It can implement or execute the methods, steps, and logic block diagrams disclosed in this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in this application can be directly embodied in the execution of the hardware processor, or executed by a combination of hardware and software modules within the processor. The software modules can reside 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. This storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above methods.

[0129] In the embodiments of this application, the memory can be volatile memory or non-volatile memory, or it can 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 dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (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.

[0130] The technical solutions provided in this application can be implemented in whole or in part through software, hardware, firmware, or any combination thereof. When implemented using software, they can be implemented in whole or in part as a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a terminal device, an access network device, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., digital video discs (DVDs)), or semiconductor media, etc.

[0131] In the embodiments of this application, "at least one" refers to one or more items. "More than one" means two or more items. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, A and / or B can represent three situations: A exists alone, A and B exist simultaneously, and B exists alone.

[0132] The term "comprising" and any variations thereof used in the embodiments of this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the steps or units listed, but may optionally include other steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or devices.

[0133] In this application, examples may reference each other without logical contradiction. For example, methods and / or terms between method embodiments may reference each other, functions and / or terms between device embodiments may reference each other, and functions and / or terms between device examples and method examples may reference each other.

[0134] 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 application.

[0135] In the several embodiments provided in this application, 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.

[0136] 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.

[0137] In addition, the functional units in the various embodiments of this application 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.

[0138] 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 application, 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 application. 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.

[0139] The above description is merely a specific embodiment of this application, but the scope of protection of this application 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 application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A scrambling method, characterized by, include: The first bit sequence in the first coding sequence is subjected to a first scrambling to obtain a second coding sequence. The first coding sequence is a bit sequence obtained after channel coding. The channel coding includes a probability shaping pre-transformation. The first bit sequence is the bits in the first coding sequence that have not undergone the probability shaping pre-transformation. Map the bits in the second coded sequence to modulation symbols; Output the modulated symbol.

2. The method of claim 1, wherein, The method further includes: Obtain the first information bit sequence; The probability shaping pretransformation is performed on a portion of the first information bit sequence to obtain a second information bit sequence to be encoded. The second information bit sequence includes bits that have undergone the probability shaping pretransformation and bits that have not undergone the probability shaping pretransformation. The second information bit sequence is channel-coded to obtain the first coded sequence.

3. The method of claim 2, wherein, The first encoded sequence includes the second information bit sequence and the first check bit sequence. The first bit sequence is the bits in the first encoded sequence that have not undergone the probability shaping pre-transformation, including: the first bit sequence includes some or all of the bits in the second information bit sequence that have not undergone the probability shaping pre-transformation.

4. The method according to claim 2 or 3, characterized in that, The first encoded sequence includes the second information bit sequence and the first check bit sequence. The first bit sequence is the bits in the first encoded sequence that have not undergone the probability shaping pre-transformation, including: the first bit sequence includes some or all of the parity bits in the first parity bit sequence.

5. The method according to any one of claims 2 to 4, characterized in that, The first bit sequence is the bits in the first coded sequence that have not undergone the probability shaping pre-transformation, including: the first bit sequence includes some or all of the bits in the first coded sequence that are mapped to the first two bits of each modulation symbol.

6. The method according to any one of claims 2 to 5, characterized in that, The method further includes: The first information bit sequence is scrambled a second time to obtain the third information bit sequence; The step of performing the probabilistic shaping pre-transformation on a portion of the first information bit sequence to obtain the second information bit sequence to be encoded includes: performing the probabilistic shaping pre-transformation on a portion of the third information bit sequence to obtain the second information bit sequence to be encoded.

7. The method according to any one of claims 2 to 6, characterized in that, The first scrambling of the first bit sequence in the first encoded sequence includes: performing the first scrambling on the first bit sequence in the first encoded sequence based on the first scrambling sequence, wherein the length of the first scrambling sequence is equal to the length of the first bit sequence; And / or, The second scrambling of the first information bit sequence includes: performing a second scrambling on the first information bit sequence based on a second scrambling sequence, wherein the length of the second scrambling sequence is equal to the length of the first information bit sequence.

8. A scrambling method, characterized in that, The method includes: Obtain the first information bit sequence; The first information bit sequence is scrambled a second time to obtain the third information bit sequence; A portion of the information bit sequence in the third information bit sequence is subjected to a probabilistic shaping pretransformation to obtain a second information bit sequence to be encoded. The second information bit sequence includes bits that have undergone the probabilistic shaping pretransformation and bits that have not undergone the probabilistic shaping pretransformation.

9. The method according to claim 8, characterized in that, The method further includes: Channel coding is performed on the second information bit sequence to obtain the first coded sequence; The first bit sequence in the first encoded sequence is subjected to a first scrambling to obtain a second encoded sequence, wherein the first bit sequence is the bits in the first encoded sequence that have not undergone the probability shaping pre-transformation; Map the bits in the second coded sequence to modulation symbols; Output the modulated symbol.

10. The method according to claim 9, characterized in that, The first encoded sequence includes the second information bit sequence and the first check bit sequence. The first bit sequence is the bits in the first encoded sequence that have not undergone the probability shaping pre-transformation, including: the first bit sequence includes some or all of the bits in the second information bit sequence that have not undergone the probability shaping pre-transformation.

11. The method according to claim 9 or 10, characterized in that, The first encoded sequence includes the second information bit sequence and the first check bit sequence. The first bit sequence is the bits in the first encoded sequence that have not undergone the probability shaping pre-transformation, including: the first bit sequence includes some or all of the parity bits in the first parity bit sequence.

12. The method according to any one of claims 9 to 11, characterized in that, The first bit sequence is the bits in the first coded sequence that have not undergone the probability shaping pre-transformation, including: the first bit sequence includes some or all of the bits in the first coded sequence that are mapped to the first two bits of each modulation symbol.

13. The method according to any one of claims 9 to 12, characterized in that, The first scrambling of the first bit sequence in the first encoded sequence includes: performing the first scrambling on the first bit sequence in the first encoded sequence based on the first scrambling sequence, wherein the length of the first scrambling sequence is equal to the length of the first bit sequence; And / or, The second scrambling of the first information bit sequence includes: performing a second scrambling on the first information bit sequence based on a second scrambling sequence, wherein the length of the second scrambling sequence is equal to the length of the first information bit sequence.

14. A communication device, characterized in that, The system includes a communication interface and circuitry. The communication interface is used to acquire information required to perform the method as described in any one of claims 1-7, and to send the information to the circuitry, which is used to perform the method as described in any one of claims 1-7 based on the received information; or... The communication interface is used to acquire information required to perform the method as described in any one of claims 8-13, and to send the information to the circuit, which is used to perform the method as described in any one of claims 8-13 based on the received information.

15. A communication device, characterized in that, Includes modules or units for performing the method as described in any one of claims 1-13.

16. A communication device, characterized in that, It includes at least one processor, said at least one processor being configured to execute a computer program or instructions to cause the communication device to perform the method as described in any one of claims 1-13.

17. The communication device according to claim 16, characterized in that, It also includes a memory for storing the computer program or instructions.

18. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions that, when executed on a computer, implement the method as described in any one of claims 1-13.

19. A computer program product, characterized in that, The computer program product includes computer program code or instructions, and when the computer program code or instructions are run on a computer, the method as described in any one of claims 1-13 is implemented.

Images