WO2021004239A1 - 数据处理方法及装置 - Google Patents

数据处理方法及装置 Download PDF

Info

Publication number
WO2021004239A1
WO2021004239A1 PCT/CN2020/096388 CN2020096388W WO2021004239A1 WO 2021004239 A1 WO2021004239 A1 WO 2021004239A1 CN 2020096388 W CN2020096388 W CN 2020096388W WO 2021004239 A1 WO2021004239 A1 WO 2021004239A1
Authority
WO
WIPO (PCT)
Prior art keywords
layer
bit sequence
information
bit
sequence
Prior art date
Application number
PCT/CN2020/096388
Other languages
English (en)
French (fr)
Inventor
李佳徽
颜敏
马梦瑶
林伟
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2021004239A1 publication Critical patent/WO2021004239A1/zh
Priority to US17/572,302 priority Critical patent/US20220329348A1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0033—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0036—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the receiver
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0067—Rate matching
    • H04L1/0068—Rate matching by puncturing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/007—Unequal error protection
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0075—Transmission of coding parameters to receiver

Definitions

  • This application relates to the field of communication technology, and in particular to a data processing method and device.
  • Multimedia communication refers to a new communication method that can provide multiple media data such as voice, data, image, and video at the same time during a call.
  • multimedia data As an important part of multimedia data, video brings a brand new visual experience to users.
  • video services will have broader development prospects, and subsequent video data encoding and transmission technologies have also become current research hotspots in the field of multimedia communications.
  • This application provides a data processing method and device for improving coding efficiency.
  • a data processing method which includes: a transmitting end layering original information to obtain a first bit sequence of N layers, the original information is at least one bit sequence or at least one integer, and N is an integer greater than 1;
  • the terminal performs first processing on the first bit sequence of the N layer to obtain the first information, the first information does not include all the bits in the first bit sequence of the N layer or the first information includes some bits in the first bit sequence of the N layer;
  • the transmitting end performs channel coding and constellation on the coding information used to indicate the proportion information of 0 or 1 in the first bit sequence of each layer in the N-layer first bit sequence
  • the third information is obtained by modulation; the sending end sends the second information and the third information to the receiving end.
  • the transmitting end can send the coded information of the N-layer first bit sequence and the second information that does not contain part or all of the bits in the N-layer first bit sequence to the receiving end, and the receiving end can send the code according to the coding information.
  • the information and the second information are processed to obtain the N-layer first bit sequence. Since the transmitting end sends the encoded information to the receiving end, the information sent by the transmitting end may not include some or all of the bits in the first bit sequence of the N layer, thereby reducing the bandwidth requirement of the data and improving the coding efficiency of the data .
  • the sender layered the original information to obtain the first bit sequence of N layers, including: the sender would sort the original information according to the importance of the original information from high to low or from low to high.
  • the information is layered to obtain the first bit sequence of N layers.
  • the first processing includes channel coding and bit cutting
  • the original information can be compressed through bit shearing, and the system transmission resource requirements can be reduced.
  • the first processing is rateless coding
  • the transmitting end performs the first processing on the first bit sequence of the N layers to obtain the first information, including: the transmitting end performs the first processing on the nth bit sequence in the first bit sequence of the N layers.
  • the original information can be compressed through rateless coding, reducing the system transmission resource requirements.
  • the more important first bit sequence in the first bit sequence of the N layer adopts a channel coding manner with a lower coding rate and/or a longer coding length.
  • the more redundant bits are in the sequence after channel coding through the channel coding method with the lower the coding rate and/or the longer the coding length, the lower the coding rate and/or the coding
  • the longer the code length the more reliable the channel coding method, which can increase the probability of the receiving end to correctly decode more important information, improve the reliability of data transmission, and enhance the ability of data to adapt to the channel.
  • the second processing includes bit splicing and constellation modulation
  • the transmitting end performs second processing on the first information to obtain the second information, including: the transmitting end performs bit splicing on the N-layer third bit sequence to obtain a The fourth bit sequence of the layer; the transmitting end performs constellation modulation on the fourth bit sequence to obtain the second information.
  • the more important bits in the fourth bit sequence are mapped to the higher bits of the constellation symbol during constellation modulation.
  • This possible implementation method because the higher the constellation symbol, the higher the energy, therefore, this optional method can increase the probability of the receiving end to decode more important information, thereby ensuring the transmission reliability of important data, and at the same time can improve the data The ability to adapt to the channel.
  • the second processing includes bit splicing, constellation modulation, and constellation symbol splicing.
  • the transmitting end performs second processing on the first information to obtain the second information, including: the transmitting end performs the third bit sequence on the N layer Bit splicing obtains the fourth bit sequence of the M layer.
  • the fourth bit sequence of the mth layer in the fourth bit sequence of the M layer contains: the mth of all third bit sequences including the mth bit in the third bit sequence of the N layer Bits, M is an integer greater than 1, m is an integer greater than 0 and less than or equal to M; the transmitter performs constellation modulation on the fourth bit sequence of the M layer to obtain the M layer constellation symbol sequence; the transmitter performs constellation on the M layer constellation symbol sequence The symbols are spliced to obtain the second information.
  • the more important fourth bit sequence in the fourth bit sequence of the M layer adopts a modulation method with a lower modulation order.
  • This possible implementation can make the more important information adopt the more reliable constellation modulation method, improve the probability of the receiving end to demodulate the important information correctly, and improve the reliability of data transmission.
  • the second processing includes constellation modulation and constellation symbol splicing
  • the transmitting end performs second processing on the first information to obtain the second information, including: the transmitting end performs constellation modulation on the N-layer third bit sequence respectively Obtain the N-layer constellation symbol sequence; the transmitting end performs constellation symbol splicing on the N-layer constellation symbol sequence to obtain the second information.
  • the more important third bit sequence in the third bit sequence of the N layer adopts a modulation method with a lower modulation order.
  • This possible implementation can make the more important information adopt the more reliable constellation modulation method, improve the probability of the receiving end to demodulate the important information correctly, and improve the reliability of data transmission.
  • the more important bits in the third bit sequence of each layer in the third bit sequence of the N layers are mapped to the higher bits of the constellation symbol in the corresponding constellation symbol sequence.
  • This possible implementation method because the higher the constellation symbol, the higher the energy, therefore, this optional method can increase the probability of the receiving end to decode more important information, thereby ensuring the transmission reliability of important data, and at the same time can improve the data The ability to adapt to the channel.
  • a data processing method including: a receiving end receives second information and third information from a sending end, the second information is obtained by the sending end performing second processing on the first information; the first information is obtained by the sending end Perform the first processing on the first bit sequence of the N layer, and the first information does not include all the bits in the first bit sequence of the N layer or the first information includes some bits in the first bit sequence of the N layer; the first bit sequence of the N layer
  • the original information is obtained by layering the original information by the sending end, and the original information is at least one bit sequence or at least one integer;
  • the third information is obtained by the sending end performing channel coding and constellation modulation on the coding information of the first bit sequence of the N layer, and the coding information is used
  • N is an integer greater than 1
  • the receiving end performs constellation demodulation and channel decoding on the third information to obtain the restored Encoding information; the receiving end performs third processing
  • the transmitting end can send the coded information of the N-layer first bit sequence and the second information that does not contain part or all of the bits in the N-layer first bit sequence to the receiving end, and the receiving end can send the code according to the code
  • the information and the second information are processed to obtain the N-layer first bit sequence. Since the transmitting end sends the encoded information to the receiving end, the information sent by the transmitting end may not include some or all of the bits in the first bit sequence of the N layer, thereby reducing the bandwidth requirement of the data and improving the coding efficiency of the data .
  • the third processing includes constellation demodulation and soft information splitting.
  • the receiving end performs third processing on the second information to obtain the first soft information, including: the receiving end performs constellation demodulation on the second information
  • the third soft information is obtained.
  • the third soft information is the log likelihood ratio corresponding to each bit in the fourth bit sequence.
  • the fourth bit sequence is obtained by bit splicing the third bit sequence of N layers by the transmitting end.
  • the three-bit sequence is the first information; the receiving end performs soft information splitting on the third soft information to obtain the first soft information.
  • the first soft information includes N layers of soft information, and one layer of soft information is the N layer of the third bit sequence.
  • the log likelihood ratio corresponding to the bits in the third bit sequence of the layer is the first soft information.
  • the third processing includes constellation symbol splitting, constellation demodulation, and soft information splitting.
  • the receiving end performs third processing on the second information to obtain the first soft information, including: Information is divided into constellation symbols to obtain an M-layer constellation symbol sequence.
  • the M-layer constellation symbol sequence is obtained by constellation modulation on the fourth bit sequence of the M layer by the transmitting end, and the fourth bit sequence of the M layer is the third bit sequence of the transmitting end to the N layer.
  • the fourth bit sequence of the mth layer in the fourth bit sequence of the M layer includes: the mth bit in all the third bit sequences including the mth bit in the third bit sequence of the N layer, and the N layer
  • the third bit sequence is the first information, M is an integer greater than 1, and m is an integer greater than 0 and less than or equal to M;
  • the receiving end performs constellation demodulation on the M layer constellation symbol sequence to obtain the third soft information of the M layer, and the M layer
  • the three pieces of soft information are the log-likelihood ratios corresponding to the bits in the fourth bit sequence of the M layer;
  • the receiving end performs soft information splitting on the third soft information of the M layer to obtain the first soft information, and the first soft information includes N layers Soft information, one layer of soft information is the log-likelihood ratio corresponding to the bits in the third bit sequence of one layer in the third bit sequence of N layers.
  • the third processing includes constellation symbol splitting and constellation demodulation, and the receiving end performs third processing on the second information to obtain the first soft information, including: the receiving end performs constellation symbol splitting on the second information.
  • N-layer constellation symbol sequence is obtained.
  • the N-layer constellation symbol sequence is obtained by performing constellation modulation on the N-layer third bit sequence on the transmitting end.
  • the N-layer third bit sequence is the first information; the receiving end performs the N-layer constellation symbol sequence separately
  • the first soft information is obtained by constellation demodulation.
  • the first soft information includes N layers of soft information, and one layer of soft information is the log likelihood ratio corresponding to the bits in the third bit sequence of the third bit sequence of the N layers.
  • the soft information sequence corresponding to the second bit sequence of the nth layer includes the log likelihood ratios corresponding to the bits in the second bit sequence of the nth layer.
  • the log-likelihood ratio in the n-layer soft information is the log-likelihood ratio corresponding to the bits in the n-th layer of the third bit sequence in the N-layer third bit sequence.
  • the n-layer second bit sequence is obtained by bit cutting, the n-th layer second bit sequence is obtained by channel coding the n-th layer first bit sequence in the N-layer first bit sequence by the transmitter, and the n-th layer third bit sequence It is the part of the second bit sequence of the nth layer excluding some or all of the bits in the first bit sequence of the nth layer; the receiving end sends the soft information corresponding to each second bit sequence in the second bit sequence of the N layer
  • the sequence is channel-decoded to obtain the second soft information, and the second soft information includes the log likelihood ratios corresponding to the bits in the first bit sequence of each layer in the first bit sequence of the N layers.
  • the fourth processing is rateless decoding
  • the receiving end performs fourth processing on the first soft information according to the encoded information to obtain the second soft information, including: the receiving end performs soft information calculation according to the encoded information to obtain N
  • the bit in the first bit sequence of each layer in the sequence corresponds to the log-likelihood ratio, and the first soft information is decoded without rate to obtain the second soft information.
  • the second soft information includes each of the N layers of the first bit sequence.
  • a transmitting end device including: a processing unit and a transmitting unit; the processing unit is configured to layer original information to obtain an N-layer first bit sequence, and to perform an analysis on the N-layer first bit sequence Perform first processing to obtain first information, perform second processing on the first information to obtain second information, perform channel coding and constellation modulation on the coded information of the N-layer first bit sequence to obtain third information; where The original information is at least one bit sequence or at least one integer, and the first information does not include all bits in the N-layer first bit sequence or the first information includes part of the N-layer first bit sequence Bit, the coding information is used to indicate the proportion information of 0 or 1 in the first bit sequence of each layer in the first bit sequence of the N layers, and N is an integer greater than 1; the sending unit is used to The receiving end sends the second information and the third information.
  • the processing unit is specifically configured to: layer the original information according to the importance of the information in the original information in descending or descending order to obtain the N-layer first bit sequence.
  • the first processing includes channel coding and bit cutting
  • the layer third bit sequence is a part of the nth layer second bit sequence excluding some or all of the bits in the nth layer first bit sequence.
  • the first processing is rateless encoding
  • the more important first bit sequence in the first bit sequence of the N layer adopts a channel coding manner with a lower coding rate and/or a longer coding length.
  • the second processing includes bit splicing and constellation modulation
  • the processing unit is specifically configured to: perform bit splicing on the N-layer third bit sequence to obtain a layer of the fourth bit sequence; Performing constellation modulation on the fourth bit sequence to obtain the second information.
  • the more important bits in the fourth bit sequence are mapped to higher bits of the constellation symbol during constellation modulation.
  • the second processing includes bit splicing, constellation modulation, and constellation symbol splicing
  • the processing unit is specifically configured to: perform bit splicing on the N-layer third bit sequence to obtain the M-layer fourth bit Sequence
  • the fourth bit sequence of the mth layer in the fourth bit sequence of the M layer includes: the mth bit in all the third bit sequences including the mth bit in the third bit sequence of the N layer, M Is an integer greater than 1, and m is an integer greater than 0 and less than or equal to M
  • performing constellation symbol splicing on the M layer constellation symbol sequence to obtain Mentioned second information is specifically configured to: perform bit splicing on the N-layer third bit sequence to obtain the M-layer fourth bit Sequence
  • the fourth bit sequence of the mth layer in the fourth bit sequence of the M layer includes: the mth bit in all the third bit sequences including the mth bit in the third bit sequence of the
  • the more important fourth bit sequence in the fourth bit sequence of the M layer adopts a modulation mode with a lower modulation order.
  • the second processing includes constellation modulation and constellation symbol splicing
  • the processing unit is specifically configured to: perform constellation modulation on the N-layer third bit sequence to obtain the N-layer constellation symbol sequence; Performing constellation symbol splicing on the N-layer constellation symbol sequence to obtain the second information.
  • the more important third bit sequence in the N-layer third bit sequence adopts a modulation method with a lower modulation order.
  • the more important bits in the third bit sequence of each layer in the N-layer third bit sequence are mapped to the higher bits of the constellation symbol in the corresponding constellation symbol sequence.
  • a receiving end device including: a receiving unit and a processing unit; the receiving unit is configured to receive second information and third information from a sending end, and the second information is paired by the sending end
  • the first information is obtained by the second processing; the first information is obtained by the transmitting end performing the first processing on the N-layer first bit sequence, and the first information does not include all of the N-layer first bit sequence
  • the bit or the first information includes part of the bits in the N-layer first bit sequence;
  • the N-layer first bit sequence is obtained by layering original information by the transmitting end, and the original information is at least one bit Sequence or at least one integer;
  • the third information is obtained by channel coding and constellation modulation on the coding information of the N-layer first bit sequence by the transmitting end, and the coding information is used to indicate the N-layer first bit
  • the processing unit is used to perform constellation demodulation and channel decoding on the third information to obtain the restored
  • For the encoded information perform a third process on the second information to obtain first soft information, perform a fourth process on the first soft information according to the encoded information to obtain second soft information, and perform a third process on the second soft information.
  • the original information after reconstruction is obtained; wherein, the first soft information is the log likelihood ratio corresponding to each bit in the first information, and the second soft information is the N-th layer The log likelihood ratio corresponding to the bit in the first bit sequence of each layer in a bit sequence.
  • the third processing includes constellation demodulation and soft information splitting, and the processing unit is specifically configured to: perform constellation demodulation on the second information to obtain third soft information, so
  • the third soft information is the log-likelihood ratio corresponding to each bit in the fourth bit sequence, and the fourth bit sequence is obtained by bit splicing the N-layer third bit sequence by the transmitting end.
  • the third bit sequence is the first information; soft information is split on the third soft information to obtain the first soft information.
  • the first soft information includes N layers of soft information, and one layer of soft information is all The log likelihood ratios corresponding to the bits in the third bit sequence of one layer in the third bit sequence of the N layers.
  • the third processing includes constellation symbol splitting, constellation demodulation, and soft information splitting
  • the processing unit is specifically configured to: perform constellation symbol splitting on the second information to obtain M-layer constellation symbol sequence, the M-layer constellation symbol sequence is obtained by constellation modulation of the M-layer fourth bit sequence by the transmitting end, and the M-layer fourth bit sequence is the third bit of the N-layer by the transmitting end
  • the sequence is obtained by bit splicing, and the fourth bit sequence of the mth layer in the fourth bit sequence of the M layer includes: the mth bit sequence of all the third bit sequences including the mth bit in the third bit sequence of the N layer Bits, the N-layer third bit sequence is the first information, M is an integer greater than 1, and m is an integer greater than 0 and less than or equal to M; performing constellation demodulation on the M-layer constellation symbol sequence to obtain M
  • the third soft information of the M layer is the log-likelihood ratio corresponding to the bits in the fourth bit sequence of the M layer; the third soft information of the
  • the third processing includes constellation symbol splitting and constellation demodulation
  • the processing unit is specifically configured to: perform constellation symbol splitting on the second information to obtain an N-layer constellation symbol sequence
  • the N-layer constellation symbol sequence is obtained by performing constellation modulation on the N-layer third bit sequence respectively by the transmitting end, and the N-layer third bit sequence is the first information; and the N-layer constellation symbol sequence is respectively constelled
  • the first soft information is obtained by demodulation.
  • the first soft information includes N layers of soft information, and one layer of soft information is the logarithmic similarity corresponding to the bits in the third bit sequence of the third layer of the N layer. Ranby.
  • the fourth processing includes soft information splicing and channel decoding, and the processing unit is specifically configured to: perform soft information calculations according to the encoded information to obtain the first bit sequence in the N layer
  • the soft information sequence corresponding to the second bit sequence, the soft information sequence corresponding to the nth layer second bit sequence includes the log-likelihood ratios corresponding to the bits in the nth layer second bit sequence, and the nth layer
  • the log-likelihood ratio in the layer soft information is the log-likelihood ratio corresponding to the bits in the n-th layer third bit sequence in the N-layer third bit sequence, and the n-th layer third bit sequence is determined by
  • the sending end performs the bit cutting on the nth layer second bit sequence, and the nth layer second bit sequence is obtained by the sending end on the nth layer in the N layer first bit sequence.
  • a bit sequence is obtained by channel coding, and the third bit sequence of the nth layer is a part of the second bit sequence of the nth layer excluding some or all of the bits in the first bit sequence of the nth layer; Channel decoding the soft information sequence corresponding to the second bit sequence of each layer in the N-layer second bit sequence to obtain the second soft information.
  • the second soft information includes the first bit sequence of each layer in the N-layer first bit sequence. The log-likelihood ratio corresponding to the bits in a bit sequence.
  • the fourth processing is rateless decoding
  • the processing unit is specifically configured to: perform soft information calculations according to the encoded information to obtain the nth layer in the first bit sequence of the N layers.
  • the corresponding log-likelihood ratio performs rate-free decoding on the first soft information to obtain the second soft information.
  • the second soft information includes the first bit sequence of each layer in the N-layer first bit sequence.
  • the log likelihood ratio corresponding to the bit.
  • a sender device including: a processor configured to execute computer instructions to implement any one of the methods provided in the first aspect.
  • the sending end device further includes a memory, the processor is coupled with the memory, and the memory is configured to store the computer instruction.
  • the memory and the processor are integrated together, or the memory and the processor are independent devices.
  • the sending end device further includes a communication interface and a communication bus, and the processor, memory, and communication interface are connected through the communication bus.
  • the communication interface is used to execute the sending action in the corresponding method.
  • the communication interface executes the sending action in the corresponding method through the transmitter in it.
  • a receiving end device including a processor, the processor is configured to execute computer instructions to implement any of the methods provided in the second aspect.
  • the receiving end device further includes a memory, the processor is coupled with the memory, and the memory is configured to store the computer instruction.
  • the memory and the processor are integrated together, or the memory and the processor are independent devices.
  • the receiving end device further includes a communication interface and a communication bus, and the processor, the memory and the communication interface are connected through the communication bus.
  • the communication interface is used to perform the receiving action in the corresponding method.
  • the communication interface executes the receiving action in the corresponding method through the receiver therein.
  • a transmitter device including a logic circuit and an output interface, where the logic circuit and the output interface are used to implement any one of the methods provided in the first aspect.
  • the logic circuit is used to execute the processing action in the corresponding method
  • the output interface is used to execute the sending action in the corresponding method.
  • a receiving end device including: a logic circuit and an input interface, and the logic circuit and the input interface are used to implement any one of the methods provided in the second aspect.
  • the logic circuit is used to execute the processing action in the corresponding method
  • the input interface is used to execute the received action in the corresponding method.
  • a communication system including: the sender device provided in the third aspect and the receiver device provided in the fourth aspect; or, the sender device provided in the fifth aspect and the receiver device provided in the sixth aspect ; Or, the transmitting end device provided in the seventh aspect and the receiving end device provided in the eighth aspect.
  • a computer-readable storage medium stores computer instructions.
  • the computer instructions run on a computer, the computer executes any of the methods provided in the first aspect.
  • a computer-readable storage medium stores computer instructions that, when run on a computer, cause the computer to execute any of the methods provided in the second aspect.
  • a computer program product containing computer instructions is provided.
  • the computer instructions run on a computer, the computer executes any of the methods provided in the first aspect.
  • a computer program product containing computer instructions is provided.
  • the computer instructions run on a computer, the computer executes any of the methods provided in the second aspect.
  • a sender device including: a processor, the processor is coupled to a memory, the memory is configured to store computer execution instructions, and the processor executes the computer execution stored in the memory Instructions to make the device execute any method provided in the first aspect.
  • the memory is located inside the sending end device.
  • the memory is located outside the sending end device.
  • a receiving end device comprising: a processor, the processor is coupled to a memory, the memory is configured to store a computer execution instruction, and the processor executes the computer execution stored in the memory Instructions to make the device execute any method provided in the second aspect.
  • the memory is located inside the receiving end device.
  • the memory is located outside the receiving end device.
  • Figure 1 is a schematic diagram of a network architecture
  • Figure 2 is a schematic diagram of a flow of data processing at the sender and receiver
  • FIG. 3 is a flowchart of a data processing method provided by an embodiment of the application.
  • FIG. 4 is a schematic diagram of a data processing flow provided by an embodiment of this application.
  • FIG. 5 is a schematic diagram of binary conversion of a DCT quantized coefficient according to an embodiment of the application.
  • 6 to 11 are schematic diagrams of a data processing flow provided by embodiments of this application.
  • FIG. 12 is a schematic diagram of the composition of a sending end device provided by an embodiment of this application.
  • FIG. 13 and FIG. 14 are respectively schematic diagrams of the hardware structure of a sender device according to an embodiment of the application.
  • 15 is a schematic diagram of the composition of a receiving end device provided by an embodiment of the application.
  • FIG. 16 and FIG. 17 are respectively schematic diagrams of the hardware structure of a receiving end device according to an embodiment of the application.
  • the embodiment of the present application provides a communication system, which includes a sending end and a receiving end.
  • the sending end can be a network device or a terminal.
  • the receiving end may be a terminal.
  • the sending end is a terminal
  • the receiving end can be a network device or a terminal.
  • the transmitting end is a network device and the receiving end is a terminal
  • Figure 1 the schematic diagram of the architecture of the communication system.
  • the network equipment may be a device deployed in a radio access network (RAN) to provide wireless communication functions for the terminal, for example, it may be a base station, various forms of control nodes (for example, a network controller, a wireless controller (for example, , Cloud radio access network (cloud radio access network, wireless controller in CRAN) scenarios)), etc.
  • the network equipment may be various forms of macro base stations, micro base stations (also referred to as small stations), relay stations, access points (access points, AP), etc., and may also be antenna panels of base stations.
  • the control node may be connected to multiple base stations and configure resources for multiple terminals under the coverage of the multiple base stations. In systems using different wireless access technologies, the names of devices with base station functions may be different.
  • LTE long-term evolution
  • eNB evolved NodeB
  • 5G fifth-generation
  • NR new radio
  • gNB next generation node base station
  • PLMN public land mobile network
  • a terminal can be a device that provides voice or data connectivity to users. It can also be called user equipment (UE), mobile station, subscriber unit, station, and terminal equipment. (terminal equipment, TE), etc.
  • the terminal may be a cellular phone (cellular phone), personal digital assistant (personal digital assistant, PDA), wireless modem (modem), handheld device (laptop computer), cordless phone (cordless phone) , Wireless local loop (wireless local loop, WLL), tablet computer (pad), smart phone (smartphone), customer premise equipment (customer premise equipment, CPE), sensor with network access function, etc.
  • devices that can access the communication system, communicate with the network side of the communication system, or communicate with other objects through the communication system can all be the terminals in the embodiments of the present application, such as intelligent transportation Terminals and cars in smart homes, household equipment in smart homes, power meter reading equipment in smart grids, voltage monitoring equipment, environmental monitoring equipment, video monitoring equipment in smart security networks, cash registers, etc.
  • M2M machine-to-machine
  • eMBB enhanced mobile broadband
  • URLLC ultra-reliable & low latency communication
  • massive Scenarios such as Internet of Things communication (massive machine type communication, mMTC).
  • the network architecture and service scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application.
  • a person of ordinary skill in the art knows that with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are equally applicable to similar technical problems.
  • the sending end sends the signal obtained after source coding, channel coding, constellation modulation, and resource mapping on the source to the receiving end.
  • the signal is between the sending end and the receiving end. When transmitting on the channel, it may be interfered by noise.
  • the receiving end After receiving the signal, the receiving end performs resource demapping, constellation demodulation, channel decoding, and source decoding on the signal to obtain the sink (that is, the restored source).
  • FIG. 2 only shows part of the steps in the data sending and receiving process. In actual implementation, there may be other steps, which are not limited in the embodiment of the present application.
  • Source coding is a conversion of a source for the purpose of improving the effectiveness of communication, or to reduce or eliminate the redundancy of a source. Specifically, it is to find a certain method according to the statistical characteristics of the information source to transform the information source into the shortest bit sequence, so as to maximize the average amount of information carried by each bit of the latter, and at the same time, it can ensure that the original information is restored without distortion. Source.
  • source decoding which is the process of restoring the signal before source decoding to obtain the source.
  • Channel coding is also called error control coding, which is to add redundant bits to information bits (for example, the source coded bits in Fig. 2) at the transmitting end, and these redundant bits are related to the information bits.
  • the signal after channel coding includes information bits and redundant bits in turn.
  • Channel decoding means that the receiving end detects and corrects errors generated during the transmission process according to the correlation between redundant bits and information bits, and restores the information bits, thereby resisting the interference of the transmission process and improving the data transmission. reliability.
  • Constellation modulation refers to mapping the bits in the bit sequence to the constellation symbols in the constellation diagram.
  • one constellation symbol includes one bit or multiple bits, and one bit in the bit sequence can be mapped to one bit in the constellation symbol.
  • constellation modulation is to process the digital signal (for example, the aforementioned bit sequence) that needs to be transmitted in the time domain, frequency domain, or code domain, so as to transmit as much information as possible with the smallest possible bandwidth.
  • constellation demodulation which is the process of recovering bit sequence from constellation symbols.
  • Resource mapping is the process of mapping a signal (for example, the signal modulated by the constellation in FIG. 2) onto a transmission resource (for example, time domain, frequency domain, or space domain resources).
  • resource demapping which is the process of restoring the signal mapped to the transmission resource to the signal before mapping.
  • Rateless coding is a channel coding method. Only redundant bits are included in the rate-free encoded signal.
  • the encoding rate refers to the proportion of bits before encoding (ie, information bits) in the bits after encoding. If a bit sequence is encoded with a lower coding rate, the more redundant bits in the bit sequence after encoding, the higher the reliability of data transmission.
  • the code length refers to the number of bits in the bit sequence after coding.
  • the number of information bits is fixed, if a coding method with a longer coding code length is used for coding, the more redundant bits in the bit sequence after coding, the higher the reliability of data transmission.
  • the modulation order is used to calculate the number of bits that each constellation symbol can represent.
  • binary phase shift keying BPSK
  • quadrature phase shift keying quadrature phase shift keying
  • QAM quadrature amplitude modulation
  • 16QAM 32QAM
  • 64QAM 64QAM
  • the modulation orders corresponding to 256QAM are 2, 4, 8, 16, 32, 64, 256.
  • the bit numbers corresponding to these modulation orders are log 2 (2) (ie 1), log 2 (4) (ie 2 ), log 2 (8) (ie 3), log 2 (16) (ie 4), log 2 (32) (ie 5), log 2 (64) (ie 6), log 2 (256) (ie 8 ).
  • the log-likelihood ratio of a bit means that the ratio of the probability that the bit is 1 to the probability that the bit is 0 takes the natural logarithm. If the probability that the bit is 1 is p(1) and the probability that the bit is 0 is p(0), then the log-likelihood ratio of the bit is ln[p(1)/p(0) ].
  • the embodiment of the application provides a data processing method, as shown in FIG. 3 or FIG. 4, including:
  • the transmitting end layered the original information to obtain the first bit sequence of N layers.
  • the original information is at least one bit sequence or at least one integer, and N is an integer greater than 1.
  • the sending end in the embodiment of the present application may be a terminal or a network device or a chip in a terminal (for example, a short-range communication chip used to implement functions such as high-speed and low-latency screen projection) or a chip in a network device.
  • a terminal or a network device or a chip in a terminal for example, a short-range communication chip used to implement functions such as high-speed and low-latency screen projection
  • a chip in a network device for example, a short-range communication chip used to implement functions such as high-speed and low-latency screen projection
  • the original information can have the following two situations:
  • the original information is one or more bit sequences obtained by encoding video, instructions, voice, pictures, text and other data through the source, or the original information is binary quantization coefficients of discrete cosine transform (DCT) One or more bit sequences obtained after conversion.
  • DCT discrete cosine transform
  • the DCT quantized coefficient includes one or more integers.
  • the original information may be a 1-bit sequence obtained by encoding the video data through a source, for example, 10001100001101110110010011000011.
  • the original information may also be a 4-bit sequence obtained by encoding the video data through the source, for example, 10001100, 00110111, 01100100, and 11000011.
  • the original information may also be one or more bit sequences obtained after binary conversion of one or more integers in the DCT quantized coefficients, and the number of bits contained in the one or more bit sequences is the number of bits of the binary conversion.
  • the DCT quantization coefficients are 255, 55, 72, 12, 43, 93
  • 6 bit sequences can be obtained, which are 11111111, 00110111, and 01001000 respectively.
  • 00001100, 00101011, 01011101 these 6 bit sequences are the original information
  • a bit sequence corresponds to an integer in the DCT quantization coefficient, 11111111, 00110111, 01001000, 00001100, 00101011, 01011101 correspond to the integers 255, 55, 72, 12, 43, 93.
  • the DCT quantized coefficient includes one or more integers.
  • the DCT quantization coefficients are 255, 55, 72, 12, 43, and 93.
  • the sending end can perform DCT transformation on the pixel values of the pixels in the image to obtain DCT coefficients, and then quantize the DCT coefficients to obtain DCT quantized coefficients, where the DCT coefficients are real numbers.
  • the DCT quantization coefficient is an integer.
  • the transmitting end performs first processing on the first bit sequence of the N layer to obtain first information, the first information does not include all the bits in the first bit sequence of the N layer or the first information includes some bits in the first bit sequence of the N layer .
  • the sending end performs second processing on the first information to obtain second information.
  • the transmitting end performs channel coding and constellation modulation on the coding information of the first bit sequence of the N layer to obtain third information, where the coding information is used to indicate the value of 0 or 1 in the first bit sequence of each layer in the first bit sequence of the N layer. Percentage information.
  • the coding information may be information about the proportion of 0 or 1 in the first bit sequence of each layer in the first bit sequence of the N layers.
  • step 304 may be executed after step 303, or may be executed before step 303 or step 302.
  • the sending end sends the second information and the third information to the receiving end.
  • the receiving end receives the second information and the third information from the sending end.
  • the receiving end in the embodiment of the present application may be a terminal or a network device or a chip in the terminal (for example, a short-range communication chip used to implement functions such as high-speed and low-latency screen projection) or a chip in a network device.
  • a terminal or a network device or a chip in the terminal for example, a short-range communication chip used to implement functions such as high-speed and low-latency screen projection
  • a chip in a network device for example, a short-range communication chip used to implement functions such as high-speed and low-latency screen projection
  • the receiving end performs constellation demodulation and channel decoding on the third information to obtain restored encoded information.
  • the receiving end performs third processing on the second information to obtain the first soft information, where the first soft information is a log likelihood ratio corresponding to each bit in the first information.
  • step 306 and step 307 are in no particular order.
  • the receiving end performs fourth processing on the first soft information according to the encoded information to obtain second soft information, where the second soft information is the log likelihood ratio corresponding to the bit in the first bit sequence of each layer in the first bit sequence of N layers .
  • the receiving end reconstructs the second soft information to obtain the restored original information.
  • the N-layer first bit sequence may also be referred to as data information bits, and the encoded information may also be referred to as 0/1 bit probability distribution information or control information bits before encoding.
  • the sending end and the receiving end may also include other operations.
  • the sender may also perform resource mapping (that is, the second information and the third information are mapped to the transmission resource for transmission), correspondingly, the second information and the third information
  • resource demapping that is, extract the second information and the third information from the transmission resource
  • the transmitting end may also perform block assembly, and correspondingly, the receiving end may also perform channel estimation and equalization before performing resource demapping.
  • the transmitting end can send the encoding information of the N-layer first bit sequence and the second information that does not include some or all of the bits in the N-layer first bit sequence to the receiving end, and the receiving end can send the The encoded information and the second information are processed to obtain the first bit sequence of N layers. Since the transmitting end sends the encoded information to the receiving end, the information sent by the transmitting end may not include some or all of the bits in the first bit sequence of the N layer, thereby reducing the bandwidth requirement of the data and improving the coding efficiency of the data .
  • step 301 when the foregoing step 301 is specifically implemented, it includes: the sender layer the original information according to the order of importance of the information in the original information from high to low or low to high to obtain the N-layer first bit sequence. Among them, the more important information in the original information has a greater impact on restoring the video, instructions, voice, pictures, text, etc. corresponding to the original information.
  • the sending end may layer the original information through bit-plane layering technology to obtain the first bit sequence of N layers, or use source coding (for example, scalable video coding (SVC), image-based
  • source coding for example, scalable video coding (SVC)
  • SVC scalable video coding
  • the original information is divided into N-layer first bit sequence by video coding technology such as 306-degree layering (Tile-based 360°) of the block or other methods.
  • Step 302 can be implemented in the following manner 1.1 or manner 1.2 in specific implementation.
  • step 302 includes in specific implementation:
  • the channel coding mode can be any channel coding mode except rateless coding.
  • the channel coding manners used for the first bit sequence of different layers may be the same or different, which is not specifically limited in the embodiment of the present application.
  • the transmitting end performs bit cutting on the second bit sequence of the nth layer to obtain the third bit sequence of the nth layer; where the third bit sequence of the nth layer is the second bit sequence of the nth layer except for the nth layer The part other than some or all of the bits in the first bit sequence.
  • a second bit sequence includes a corresponding first bit sequence (that is, information bits) and redundant bits.
  • first bit sequence that is, information bits
  • redundant bits part or all of the bits in the first bit sequence in the second bit sequence can be cut.
  • the partial bits may be high-order bits in the first bit sequence, low-order bits, or middle-position bits, which are not specifically limited in the embodiment of the present application.
  • the second bit sequence obtained by channel coding of the first bit sequence is 11110010
  • the first 4 bits in 11110010 are information bits
  • the last 4 bits are redundant bits .
  • the third bit sequence obtained by cutting the first 4 bits of 11110010 is 0010.
  • Step 308 includes steps 308-1a to 308-1c in specific implementation:
  • the receiving end performs soft information calculations according to the encoded information to obtain the log likelihood ratios corresponding to the bits in the n-th layer first bit sequence in the n-th layer first bit sequence in the bit shearing process.
  • N 1, 2,...,N.
  • the receiving end compares the log-likelihood ratios corresponding to the bits in the first bit sequence of the nth layer that are cut during the bit cutting process with the pair in the nth layer of soft information in the first soft information.
  • the number-likelihood ratio is used for soft information splicing to obtain the soft information sequence corresponding to the second bit sequence of the nth layer.
  • the soft information sequence corresponding to the second bit sequence of the nth layer includes the logarithm corresponding to the bits in the second bit sequence of the nth layer.
  • the log-likelihood ratio in the n-th layer of soft information is the log-likelihood ratio corresponding to the bits in the n-th layer of the third bit sequence in the N-layer third bit sequence.
  • step 308-1b if the cut bits are one or more bits of the highest bit of the first bit sequence, in the soft information sequence corresponding to the second bit sequence of the nth layer, the nth layer
  • the log-likelihood ratios corresponding to the bits cut during the bit-cutting process in a bit sequence are located before the log-likelihood ratios in the nth layer of soft information in the first soft information.
  • the nth layer of soft information in the first soft information contains The log-likelihood ratios are L3, L4, L5, and L6 in sequence, and the soft information sequence corresponding to the second bit sequence of the nth layer includes: L1-L2-L3-L4-L5-L6.
  • the receiving end channel-decodes the soft information sequence corresponding to the second bit sequence of each layer in the second bit sequence of the N layers to obtain the second soft information, and the second soft information includes each of the first bit sequences in the N layer.
  • the log likelihood ratio corresponding to the bit in the first bit sequence of the layer is a log likelihood ratio corresponding to the bit in the first bit sequence of the layer.
  • channel decoding of the soft information sequence corresponding to the second bit sequence of the nth layer can obtain the log-likelihood ratio corresponding to the bit in the first bit sequence of the nth layer.
  • step 308-1c the receiving end uses a channel decoding method corresponding to the channel coding method of the sending end to perform channel decoding.
  • step 308 when step 308 is specifically implemented, the receiving end needs to know which bits are cut by the transmitting end during bit cutting in order to perform soft information splicing. It also needs to know the bit rate (or the first bit rate) of the channel coding. The number of bits in a bit sequence and the code length) for channel decoding. Information such as which bits are cut by the transmitting end and the code rate of the channel coding (or the number of bits in the first bit sequence and the code length) and other information can be sent by the transmitting end to the receiving end, or It can be pre-configured or pre-defined at the receiving end, partly sent by the sending end to the receiving end, and part pre-configured or pre-defined at the receiving end.
  • step 302 includes step 302-2a in specific implementation:
  • the sending end will cut off the information bits, and only reserve the redundant bits.
  • step 308 includes steps 308-2a and 308-2b in specific implementation:
  • step 308-1a For the method of calculating the log likelihood ratio corresponding to the bit in the first bit sequence, refer to the related description of step 308-1a, which is not repeated here.
  • the receiving end performs rate-free decoding on the first soft information according to the log-likelihood ratios corresponding to the bits in the first bit sequence of each layer in the first bit sequence of the N layer calculated by the soft information to obtain the second Soft information.
  • the second soft information includes the log likelihood ratios corresponding to the bits in the first bit sequence of each layer in the first bit sequence of the N layers.
  • the receiving end will determine the corresponding log-likelihood ratio and the first soft bit sequence of the n-th layer first bit sequence in the N-layer first bit sequence calculated through soft information.
  • the nth layer of soft information in the information is spliced by soft information, and the log likelihood ratio in the nth layer of soft information is the log likelihood corresponding to the bit in the nth layer of the third bit sequence in the N layer of third bit sequence ratio.
  • the nth layer of soft information in the first soft information is L5 and L6 in order.
  • the soft information sequence after soft information splicing includes: L1-L2-L3-L4-L5-L6.
  • step 308 when step 308 is specifically implemented, the receiving end needs to know the code rate of the channel coding (or the number of bits in the first bit sequence and the code length) in order to perform rateless decoding.
  • Information such as the code rate (or the number of bits in the first bit sequence and the coding code length) of the channel coding at the transmitting end can be sent from the transmitting end to the receiving end, pre-configured or predefined at the receiving end, or part of it It is sent by the sender to the receiver, and some are pre-configured or predefined on the receiver.
  • the N-layer third bit sequence is the foregoing first information.
  • the original information can be compressed through bit cutting or rateless coding, reducing the system transmission resource requirements.
  • the more important first bit sequence in the first bit sequence of the N layer adopts a channel coding method with a lower coding rate and/or a longer coding code length, or N
  • the first bit sequence with the higher level in the first bit sequence of the layer adopts the channel coding method with the lower the coding rate and/or the longer the coding code length.
  • the first bit sequence with the higher level is more important.
  • One level includes one Or multiple first bit sequences.
  • the more redundant bits in the sequence after channel coding are performed by the channel coding method with the lower the coding rate and/or the longer the coding length, the lower the coding rate and/or the coding code
  • the channel coding efficiency can also be improved.
  • the more important bits correspond to the key information in the video data, because there are more reliable channel coding methods, regardless of whether the channel quality is good or not. Restore this part of the information.
  • the unimportant bits are information that is not sensitive to the human eye.
  • the first bit sequence of the 3 layers is 11111111, 00110111, and 01001000 in order of importance, and the coding rate corresponding to the first bit sequence of the 3 layers is 1/2, 4 /7, 2/3, refer to Table 1, the second bit sequence of the three layers is 1111111110101100, 00110111101000, and 001101111100 in sequence, and the third bit sequence of the three layers obtained by bit cutting is 10101100, 101000, and 1100 in sequence.
  • the coding rate used for the coding information of the first bit sequence of the N layer is lower than the coding bit rate used for the first bit sequence of any one of the first bit sequences of the N layer, and/or the first bit sequence of the N layer
  • the coding information of the bit sequence adopts a coding code length which is longer than the coding code length of any first bit sequence of the N layer of the first bit sequence.
  • the coding rate and/or coding length used for the coding information of the first bit sequence of the N layer can also be the same as a certain first bit sequence or different from any first bit sequence, as long as the reliability of the channel coding method is compared High, to ensure that the receiving end can decode correctly.
  • Step 303 can be implemented in any one of the following manner 2.1 to manner 2.3 during specific implementation.
  • step 303 includes steps 303-1a and 303-1b in specific implementation:
  • the transmitting end performs bit splicing on the third bit sequence of the N layer to obtain a fourth bit sequence of one layer.
  • the third bit sequence of the N layer may be sequentially spliced in order of importance from high to low or from low to high. It should be noted that the third bit sequence of the first bit sequence with higher corresponding importance in the third bit sequence of the N layer is more important. For example, referring to Table 1 above, if the importance of the first bit sequence of the three layers is from high to low: the first bit sequence of the first layer, the first bit sequence of the second layer, and the first bit sequence of the third layer, then 3 The importance of the layer third bit sequence from high to low is: the first layer third bit sequence, the second layer third bit sequence, and the third layer third bit sequence.
  • the first bit sequence of the first layer if the importance of the first bit sequence of the three layers is from high to low: the first bit sequence of the first layer, the first bit sequence of the second layer, and the first bit sequence of the third layer, send
  • the fourth bit sequence obtained by bit splicing the third bit sequence of the N layer by the end in the order of importance is: 101011001010001100.
  • the transmitting end performs constellation modulation on the fourth bit sequence to obtain the second information.
  • the more important bits in the fourth bit sequence are mapped to higher bits of the constellation symbol when performing constellation modulation. Since the higher bits of the constellation symbols have higher energy, this optional method can increase the probability of the receiving end to decode more important information, thereby ensuring the transmission reliability of important data, and at the same time can improve the ability of data adaptive channel.
  • the fourth bit sequence is 1010110010100011, which has 16 bits in total
  • 256QAM is used for constellation modulation
  • the fourth bit sequence can be mapped to 2 constellation symbols.
  • the odd-numbered bits can be mapped to the first constellation symbol
  • the even-numbered bits can be mapped to the second constellation symbol.
  • the sender can The four-bit sequence is supplemented with 0s, so that the number of bits in the fourth bit sequence after the supplements can be mapped to an integer number of constellation symbols, and the fourth bit sequence after the supplements are mapped to the constellation symbols.
  • the log-likelihood ratio corresponding to the complemented 0 can be removed from the soft information after the constellation demodulation.
  • step 307 the third processing includes constellation demodulation and soft information splitting.
  • step 307 can include step 307-1a and step 307-1b:
  • the receiving end performs constellation demodulation on the second information to obtain the third soft information, the third soft information is the log likelihood ratio corresponding to each bit in the fourth bit sequence, and the fourth bit sequence is compared by the transmitting end
  • the N-layer third bit sequence is obtained by bit splicing, and the N-layer third bit sequence is the first information.
  • the receiving end performs soft information splitting on the third soft information to obtain the first soft information.
  • the first soft information includes N layers of soft information, and one layer of soft information is the third layer of the N layer of third bit sequence.
  • the receiving end When the receiving end performs soft information splitting, it needs to know the value of N and the number of bits contained in each third bit sequence.
  • the value of N and the number of bits contained in each third bit sequence can be sent by the sender to the receiver, pre-configured or predefined in the receiver, or partly sent by the sender to the receiver. Some are pre-configured or predefined in the receiving end.
  • the number of bits contained in each third bit sequence can also be determined by the receiving end according to the number of bits in each first bit sequence, the coding rate or coding length of each first bit sequence, and each first bit sequence. One or more of the number of bits cut off in a bit sequence is determined.
  • the number of bits in each first bit sequence, the coding rate or coding length of each first bit sequence, and the number of bits cut off by each first bit sequence can be sent by the sending end to
  • the receiving end may also be pre-configured or pre-defined in the receiving end, part of the sending end may be sent to the receiving end, and part may be pre-configured or pre-defined in the receiving end.
  • step 302 in mode 2.1, if step 302 is implemented in mode 1.1, the data processing process of the sending end and the receiving end can be seen in FIG. 6. If step 302 is implemented in way 1.2, the data processing process of the sending end and the receiving end can be seen in FIG. 7.
  • step 303 includes step 303-2a to step 303-2c in specific implementation:
  • the transmitting end performs bit splicing on the third bit sequence of the N layer to obtain the fourth bit sequence of the M layer.
  • the fourth bit sequence of the mth layer in the fourth bit sequence of the M layer includes: the inclusion in the third bit sequence of the N layer In the m-th bit in all the third bit sequences of the m-th bit, M is an integer greater than 1, and m is an integer greater than 0 and less than or equal to M.
  • the higher-order bit in the fourth bit sequence of the m-th layer belongs to the more important third bit sequence.
  • the value of M is the number of bits in the third bit sequence that contains the most bits in the third bit sequence of the N layer.
  • the value of M is 8.
  • the 8-layer fourth bit sequence obtained after bit splicing according to the 3-layer third bit sequence can be seen in Table 2.
  • the transmitting end performs constellation modulation on the fourth bit sequence of the M layer to obtain an M layer constellation symbol sequence.
  • the more important fourth bit sequence in the fourth bit sequence of the M layer adopts a modulation mode with a lower modulation order, or the fourth bit sequence with a higher level in the fourth bit sequence of the M layer adopts a modulation order.
  • This optional method can make the more important information adopt the more reliable constellation modulation mode, improve the probability of the receiving end to demodulate the important information correctly, and improve the reliability of data transmission.
  • the modulation order adopted by the fourth bit sequence of the first layer to the eighth layer is sequentially reduced.
  • the fourth bit sequence of the first to fourth layers may be the first level
  • the fourth bit sequence of the fifth and sixth layers may be the second level
  • the seventh and eighth The four-bit sequence may be a third level
  • the fourth bit sequences of the same level use the same modulation order
  • the fourth bit sequences of the first level, the second level, and the third level use the same modulation order.
  • the transmitting end can add 0 to the fourth bit sequence, so that the bits in the fourth bit sequence after 0 are added
  • the number can be mapped to an integer number of constellation symbols, and the fourth bit sequence after complementing 0 is mapped to the constellation symbols.
  • the log-likelihood ratio corresponding to the complement 0 can be removed from the soft information after the constellation demodulation.
  • steps 303-2a and 303-2b the more important third bit sequence can be mapped to the higher bits of the constellation symbol. Since the higher the constellation symbol, the higher the energy, therefore, this method can improve the probability of the receiving end to decode more important information, thereby ensuring the transmission reliability of important data, and at the same time can improve the ability of data adaptive channel.
  • the transmitting end performs constellation symbol splicing on the M-layer constellation symbol sequence to obtain second information.
  • the M-layer constellation symbol sequence can be spliced sequentially in the order from the first layer to the M-th layer constellation symbol sequence, or in the order from the M-th layer constellation symbol sequence to the first-layer constellation symbol sequence
  • the embodiment of this application does not specifically limit this.
  • step 307 may include step 307-2a and step 307-2c when specifically implemented:
  • the receiving end performs constellation symbol splitting on the second information to obtain an M-layer constellation symbol sequence.
  • the receiving end performs constellation demodulation on the M-layer constellation symbol sequence to obtain the third soft information of the M layer, and the third soft information of the M layer is the log likelihood ratio corresponding to the bits in the fourth bit sequence of the M layer.
  • the receiving end performs soft information splitting on the M-layer third soft information to obtain the first soft information.
  • the first soft information includes N layers of soft information, and one layer of soft information is one layer of the N-layer third bit sequence.
  • the receiving end When performing constellation symbol splitting, the receiving end needs to know the value of M and the number of constellation symbols contained in each constellation symbol sequence. When performing soft information splitting, the receiving end needs to know the bit splicing mode of the transmitting end. Information such as the value of M, the number of constellation symbols contained in each constellation symbol sequence, and the bit splicing method of the transmitting end can be sent from the transmitting end to the receiving end, or pre-configured or predefined in the receiving end, or Part is sent from the sender to the receiver, and part is pre-configured or predefined in the receiver.
  • step 302 in mode 2.2, if step 302 is implemented in mode 1.1, the data processing process of the sending end and the receiving end can be seen in FIG. 8. If step 302 is implemented in way 1.2, the data processing process of the sending end and the receiving end can be seen in FIG. 9.
  • the second processing includes constellation modulation and constellation symbol splicing.
  • step 303 includes:
  • the transmitting end respectively performs constellation modulation on the third bit sequence of the N layer to obtain an N layer constellation symbol sequence.
  • the transmitting end can add 0 to the third bit sequence, so that the number of bits in the third bit sequence after 0 is added
  • the number can be mapped to an integer number of constellation symbols, and the third bit sequence after complementing 0 is mapped to the constellation symbols.
  • the log-likelihood ratio corresponding to the complement 0 can be removed from the soft information after the constellation demodulation.
  • the more important third bit sequence in the N-layer third bit sequence adopts a modulation mode with a lower modulation order, or the third bit sequence with a higher level in the N-layer third bit sequence adopts a modulation order.
  • This optional method can make the more important information adopt the more reliable constellation modulation mode, improve the probability of the receiving end to demodulate the important information correctly, and improve the reliability of data transmission.
  • the modulation order adopted by the third bit sequence of the first layer to the third layer is sequentially reduced.
  • the third bit sequence of the first layer may be the first level
  • the third bit sequence of the second and third layers may be the second level
  • the modulation order used for the third bit sequence of the same level In the same way, the modulation order used by the third bit sequence of the first level and the second level is sequentially reduced.
  • the more important bits in the third bit sequence of each layer in the third bit sequence of the N layers are mapped to the higher bits of the constellation symbol in the corresponding constellation symbol sequence. Since the higher bits of the constellation symbols have higher energy, this optional method can increase the probability of the receiving end to decode more important information, thereby ensuring the transmission reliability of important data, and at the same time can improve the ability of data adaptive channel.
  • the transmitting end performs constellation symbol splicing on the N-layer constellation symbol sequence to obtain the second information.
  • the N-layer constellation symbol sequence can be sequentially spliced in the order of the layer 1 to the N-th layer constellation symbol sequence, or in the order of the N-th layer constellation symbol sequence to the layer 1 constellation symbol sequence
  • the embodiment of this application does not specifically limit this.
  • step 307 may include step 307-3a and step 307-3b in specific implementation:
  • the receiving end performs constellation symbol splitting on the second information to obtain an N-layer constellation symbol sequence.
  • the receiving end performs constellation demodulation on the N-layer constellation symbol sequence to obtain the first soft information.
  • the first soft information includes N-layer soft information, and one layer of soft information is the first layer of the N-layer third bit sequence.
  • the log-likelihood ratio corresponding to the bits in the three-bit sequence.
  • the receiving end When performing constellation symbol splitting, the receiving end needs to know the value of N and the number of constellation symbols in each constellation symbol sequence.
  • the receiving end When performing constellation demodulation, the receiving end needs to know the modulation order of each third bit sequence.
  • Information such as the value of N, the number of constellation symbols in each constellation symbol sequence, and the modulation order of each third bit sequence can be sent by the transmitter to the receiver, or pre-configured or predefined in the receiver Yes, it can also be partly sent by the sender to the receiver, and partly pre-configured or predefined in the receiver.
  • step 302 is implemented in mode 1.1, the data processing process of the sending end and the receiving end can be seen in FIG. 10. If step 302 is implemented in way 1.2, the data processing process of the sending end and the receiving end can be seen in FIG. 11.
  • Step 309 can be implemented in the following way 3.1 or way 3.2 in specific implementation.
  • the receiving end can perform channel decoding through the belief transmission method (using the proportion of 0 or 1 in the first bit sequence of N layers in the encoded information as the initial iteration value) to obtain that each bit in the first bit sequence of each layer is 0 or The probability of 1, according to this probability, the original information is recovered by combining information, and the original information is one or more integers.
  • I represents the number of bits when the value is converted into binary.
  • the receiving end can obtain the value of each bit in the original information according to the probability that each bit in the first bit sequence of each layer is 0 or 1.
  • the original information is one or more bit sequences.
  • the transmitter can use the frequency selection characteristics and spatial propagation characteristics of the channel to map the constellation symbols after constellation modulation to different frequency domain resources (for example, resource block). , RB)) and airspace resources (for example, antenna ports).
  • frequency domain resources for example, resource block. , RB
  • airspace resources for example, antenna ports.
  • relatively important constellation symbols may be mapped to subcarriers or antenna ports with larger channel gains.
  • common video data processing methods include the following four.
  • the first and second are digital-analog mixing methods for video data processing
  • the third and fourth are pure digital video data processing methods.
  • Softcast SoftCast
  • the processing process of SoftCast includes: DCT transformation, power allocation, whitening, and resource mapping of pictures are sent out, and the receiving end performs linear least square estimation (LLSE) decoding on the received signal, and DCT inverse transformation is obtained. image.
  • LLSE linear least square estimation
  • SoftCast does not use channel coding, the information is directly uploaded on the channel, which is greatly affected by noise, especially when the SNR is low, the received signal will be poor, and the visual quality of the video cannot meet the actual needs.
  • the method provided by the embodiment of the present application performs channel coding on the first bit sequence of the N layer, so that the signal is reliably transmitted on the channel.
  • the second type Amimon’s joint source and channel coding (JSCC)
  • the process of Amimon’s JSCC includes: layering pictures to obtain a coarse information layer and a fine information layer. For the fine information layer, directly perform constellation modulation and resource mapping, and send the signal mapped to the transmission resource.
  • the method provided in the embodiment of the present application performs channel coding on the first bit sequence of the N layer to enable reliable signal transmission on the channel, and the method provided in the present application can enable data to have a strong ability to adapt to the channel.
  • the third type Advanced Television Systems Committee (Advanced Television Systems Committee, ATSC) layered division multiplexing (LDM) and scalable high-efficiency video coding (SHVC), which can be referred to as ATSC's LDM & SHVC.
  • ATSC Advanced Television Systems Committee
  • LDM layered division multiplexing
  • SHVC scalable high-efficiency video coding
  • the processing process of ATSC's LDM & SHVC includes: layering pictures according to sampling points (divided into base layer and enhancement layer), and performing channel coding and constellation modulation on each layer, integrating the information after constellation modulation, and mapping it in Sent on transmission resources.
  • the method provided by the embodiment of the present application performs bit cutting on the N-layer second bit sequence obtained after channel coding the N-layer first bit sequence, thereby reducing the bits transmitted by the sender and improving the data transmission efficiency.
  • ATSC's LDM&SHVC only divides the picture into two layers, and the ability to adapt to the channel is very limited.
  • this application improves the ability of video data to adapt to the channel by dividing the original information into 3, 4 or more layers according to importance. .
  • FlexCast includes: DCT conversion, binary conversion, rateless coding, resource mapping and sending of pictures.
  • the transmitter needs to adjust the modulation order according to the channel state information such as SNR fed back by the receiver, which increases the implementation complexity of the transmitter.
  • the data can be adaptive to the channel, and the modulation order does not need to be adjusted according to the channel state information such as SNR fed back by the receiving end.
  • the implementation complexity of the transmitting end is reduced.
  • each network element for example, the sending end device and the receiving end device, in order to implement the above-mentioned functions, includes hardware structures and/or software modules corresponding to each function.
  • the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed by hardware or computer software-driven hardware depends on the specific application and design constraint conditions of the technical solution. Professionals and technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered beyond the scope of this application.
  • the embodiments of the present application can divide the sending end device and the receiving end device into functional units according to the foregoing method examples.
  • each functional unit can be divided corresponding to each function, or two or more functions can be integrated into one processing unit. in.
  • the above-mentioned integrated unit can be implemented in the form of hardware or software functional unit. It should be noted that the division of units in the embodiments of the present application is illustrative, and is only a logical function division, and there may be other division methods in actual implementation.
  • FIG. 12 shows a schematic diagram of a possible structure of the sending end device (denoted as the sending end device 120) involved in the foregoing embodiment.
  • the sending end device 120 includes a processing unit 1201 and a sending unit 1202, and may also include a storage unit. 1203.
  • the processing unit 1201 is used to control and manage the actions of the sending end device.
  • the processing unit 1201 is used to support the sending end device to perform steps 301 to 305 in FIG. 3, and/or as described in the embodiment of the present application. Actions performed by the sender device in other processes.
  • the processing unit 1201 may communicate with other network entities through the sending unit 1202, for example, with the receiving end shown in FIG. 3.
  • the storage unit 1203 is used to store the program code and data of the sending end device.
  • the sending end device may be a device or a chip in the device.
  • the antenna and control circuit with transmitting function in the transmitting end device 120 can be regarded as the transmitting unit 1202 of the transmitting end device 120, and the processor with processing function can be regarded as the processing unit 1201 of the transmitting end device 120.
  • the sending unit 1202 may be a transmitter, a transmitter, a sending circuit, and so on.
  • the integrated unit in FIG. 12 is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer readable storage medium.
  • a computer readable storage medium includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor to execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the storage media for storing computer software products include: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disk, etc., which can store program codes Medium.
  • the unit in FIG. 12 may also be called a module, for example, the processing unit may be called a processing module.
  • FIG. 13 shows a schematic diagram of another possible structure of the transmitting end device (denoted as the transmitting end device 130) involved in the foregoing embodiment.
  • the sending end device 130 includes a processor 1301, and optionally, a memory 1302 and/or a transmitter 1303 connected to the processor 1301.
  • the processor 1301, the memory 1302, and the transmitter 1303 are connected by a bus.
  • the processor 1301 may be a general-purpose central processing unit (central processing unit, CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more programs for controlling the execution of the program of this application. integrated circuit.
  • the processor 1301 may also include multiple CPUs, and the processor 1301 may be a single-CPU (single-CPU) processor or a multi-core (multi-CPU) processor.
  • the processor here may refer to one or more devices, circuits, or processing cores for processing data (for example, computer program instructions).
  • the memory 1302 may be a ROM or other types of static storage devices that can store static information and instructions, RAM, or other types of dynamic storage devices that can store information and instructions, or an electrically erasable programmable read-only memory (electrically erasable programmable read-only memory).
  • read-only memory EEPROM
  • compact disc read-only memory, CD-ROM
  • optical disc storage including compact discs, laser discs, optical discs, digital universal discs, Blu-ray discs, etc.
  • magnetic disks A storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program codes in the form of instructions or data structures and that can be accessed by a computer, and the embodiments of the present application do not impose any limitation on this.
  • the memory 1302 may exist independently, or may be integrated with the processor 1301. Wherein, the memory 1302 may contain computer program code.
  • the processor 1301 is configured to execute the computer program code stored in the memory 1302, so as to implement the method provided in the embodiment of the present application.
  • the processor 1301 is configured to support the sending end device to perform steps 301 to 305 in FIG. 3, and/or actions performed by the sending end device in other processes described in the embodiments of the present application.
  • the processor 1301 may communicate with other network entities through the transmitter 1303, for example, communicate with the receiving end shown in FIG. 3.
  • the memory 1302 is used to store the program code and data of the sending end device.
  • FIG. 14 shows another possible structural schematic diagram of the sending end device (denoted as the sending end device 140) involved in the foregoing embodiment.
  • the sending end device 140 includes a logic circuit 1401 and an output interface 1402.
  • the logic circuit 1401 is used to control and manage the actions of the sending end device.
  • the logic circuit 1401 is used to support the sending end device to perform steps 301 to 305 in FIG. 3, and/or other processes described in the embodiments of this application.
  • the logic circuit 1401 can communicate with other network entities through the output interface, for example, with the receiving end shown in FIG. 3.
  • FIG. 15 shows a schematic diagram of a possible structure of the receiving end device (denoted as receiving end device 150) involved in the above embodiment.
  • the receiving end device 150 includes a processing unit 1501 and a receiving unit 1502, and may also include a storage unit. 1503.
  • the processing unit 1501 is used to control and manage the actions of the receiving end device.
  • the processing unit 1501 is used to support the receiving end device to perform steps 305 to 309 in FIG. 3, and/or as described in the embodiments of the present application. Actions performed by the receiving device in other processes.
  • the processing unit 1501 may communicate with other network entities through the receiving unit 1502, for example, with the sending end shown in FIG. 3.
  • the storage unit 1503 is used to store the program code and data of the receiving end device.
  • the receiving end device may be a device or a chip in the device.
  • the antenna and control circuit with receiving function in the receiving device 150 can be regarded as the receiving unit 1502 of the receiving device 150, and the processor with processing function can be regarded as the processing unit 1501 of the receiving device 150.
  • the receiving unit 1502 may be a receiver, a receiver, a receiving circuit, and so on.
  • the integrated unit in FIG. 15 is implemented in the form of a software function module and sold or used as an independent product, it can be stored in a computer readable storage medium.
  • a computer readable storage medium includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor to execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the storage media for storing computer software products include: U disk, mobile hard disk, read-only memory (read-only memory, ROM), random access memory (random access memory, RAM), magnetic disk or optical disk, etc., which can store program codes Medium.
  • the unit in FIG. 15 may also be called a module, for example, the processing unit may be called a processing module.
  • FIG. 16 shows another possible structural schematic diagram of the receiving end device (denoted as receiving end device 160) involved in the foregoing embodiment.
  • the receiving end device 160 includes a processor 1601, and optionally, a memory 1602 and/or a receiver 1603 connected to the processor 1601.
  • the processor 1601, the memory 1602, and the receiver 1603 are connected by a bus.
  • processor 160 For the description of the processor 1601, refer to the foregoing description of the processor 1301, which is not repeated here.
  • the processor 1601 is configured to execute the computer program code stored in the memory 1602, so as to implement the method provided in the embodiment of the present application.
  • the processor 1601 is configured to support the receiving end device to perform steps 305 to 309 in FIG. 3, and/or actions performed by the receiving end device in other processes described in the embodiment of the present application.
  • the processor 1601 may communicate with other network entities through the receiver 1603, for example, communicate with the sending end shown in FIG. 3.
  • the memory 1602 is used to store program codes and data of the receiving end device.
  • FIG. 17 shows another possible structural schematic diagram of the receiving end device (denoted as receiving end device 170) involved in the foregoing embodiment.
  • the receiving end device 170 includes a logic circuit 1701 and an input interface 1702.
  • the logic circuit 1701 is used to control and manage the actions of the receiving end device.
  • the logic circuit 1701 is used to support the receiving end device to perform steps 305 to 309 in FIG. 3, and/or other processes described in the embodiments of this application.
  • the logic circuit 1701 can communicate with other network entities through the input interface, for example, with the sending end shown in FIG. 3.
  • the embodiment of the present application also provides a computer-readable storage medium, including instructions, which when run on a computer, cause the computer to execute any of the above methods.
  • the embodiments of the present application also provide a computer program product containing instructions, which when run on a computer, cause the computer to execute any of the above methods.
  • An embodiment of the present application also provides a communication system, including: the above-mentioned sending end and receiving end.
  • the above embodiments it may be implemented in whole or in part by software, hardware, firmware or any combination thereof.
  • a software program it may be implemented in the form of a computer program product in whole or in part.
  • the computer program product includes one or more computer instructions.
  • the computer program instructions When the computer program instructions are loaded and executed on the computer, the processes or functions described in the embodiments of the present application are generated in whole or in part.
  • the computer can be a general-purpose computer, a dedicated computer, a computer network, or other programmable devices.
  • Computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium.
  • computer instructions may be transmitted from a website, computer, server, or data center through a cable (such as Coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL) or wireless (such as infrared, wireless, microwave, etc.) transmission to another website site, computer, server, or data center.
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or may include one or more data storage devices such as a server or a data center that can be integrated with the medium.
  • the usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, and a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium (for example, a solid state disk (SSD)).

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
  • Error Detection And Correction (AREA)

Abstract

本申请提供了一种数据处理方法及装置。该方法中，发送端可以将N层第一比特序列的编码信息和不包含N层第一比特序列中的部分或全部比特的第二信息向接收端发送，接收端可以根据该编码信息以及第二信息处理得到N层第一比特序列。由于发送端将编码信息发送给了接收端，因此，发送端发送的信息可以不包含N层第一比特序列中的部分或全部比特，从而降低了数据对带宽的需求，提高了数据的编码效率。

Description

数据处理方法及装置
本申请要求于2019年07月10日提交国家知识产权局、申请号为201910622112.3、申请名称为“数据处理方法及装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域，尤其涉及一种数据处理方法及装置。
背景技术
多媒体通信是指在一次呼叫过程中能同时提供多种媒体数据如语音、数据、图像、视频等的新型通信方式。视频作为多媒体数据的重要组成部分，给用户带来了视觉上的全新体验。未来几年，视频业务将会有更为广阔的发展前景，随之而来的视频数据的编码和传输技术也成为当前多媒体通信领域的研究热点。
由于无线信道带宽是有限的，因此，如何降低视频数据对带宽的需求，提高编码效率是视频数据传输中一个亟待解决的问题。
发明内容
本申请提供了一种数据处理方法及装置，用于提高编码效率。
为达到上述目的，本申请提供了以下技术方案：
第一方面，提供了一种数据处理方法，包括：发送端将原始信息进行分层得到N层第一比特序列，原始信息为至少一个比特序列或至少一个整数，N为大于1的整数；发送端对N层第一比特序列进行第一处理得到第一信息，第一信息不包括N层第一比特序列中的全部比特或第一信息包括N层第一比特序列中的部分比特；发送端对第一信息进行第二处理得到第二信息；发送端对用于指示N层第一比特序列中的每层第一比特序列中的0或1的占比信息的编码信息进行信道编码和星座调制得到第三信息；发送端向接收端发送第二信息和第三信息。第一方面提供的方法，发送端可以将N层第一比特序列的编码信息和不包含N层第一比特序列中的部分或全部比特的第二信息向接收端发送，接收端可以根据该编码信息以及第二信息处理得到N层第一比特序列。由于发送端将编码信息发送给了接收端，因此，发送端发送的信息可以不包含N层第一比特序列中的部分或全部比特，从而降低了数据对带宽的需求，提高了数据的编码效率。
在一种可能的实现方式中，发送端将原始信息进行分层得到N层第一比特序列，包括：发送端按照原始信息中的信息的重要性由高至低或由低至高的顺序将原始信息进行分层得到N层第一比特序列。
在一种可能的实现方式中，第一处理包括信道编码和比特剪切，发送端对N层第一比特序列进行第一处理得到第一信息，包括：发送端对N层第一比特序列中的第n层第一比特序列进行信道编码得到第n层第二比特序列，n＝1，2，…，N；发送端对第n层第二比特序列进行比特剪切得到第n层第三比特序列；其中，第n层第三比特序列为第n层第二比特序列中的除第n层第一比特序列中的部分或全部比特之外的部分。该种可能的实现方式，通过比特剪切可以压缩原始信息，降低系统传输资源需求。
在一种可能的实现方式中，第一处理为无速率编码，发送端对N层第一比特序列进行 第一处理得到第一信息，包括：发送端对N层第一比特序列中的第n层第一比特序列进行无速率编码得到第n层第三比特序列，n＝1，2，…，N。该种可能的实现方式，通过无速率编码可以压缩原始信息，降低系统传输资源需求。
在一种可能的实现方式中，N层第一比特序列中的越重要的第一比特序列采用编码码率越低和/或编码码长越长的信道编码方式。该种可能的实现方式，由于经过编码码率越低和/或编码码长越长的信道编码方式进行信道编码后的序列中冗余比特越多，因此，编码码率越低和/或编码码长越长的信道编码方式越可靠，从而可以增加接收端正确解码更重要的信息的概率，提高数据传输的可靠性，提升数据自适应信道的能力。
在一种可能的实现方式中，第二处理包括比特拼接和星座调制，发送端对第一信息进行第二处理得到第二信息，包括：发送端对N层第三比特序列进行比特拼接得到一层第四比特序列；发送端对第四比特序列进行星座调制得到第二信息。
在一种可能的实现方式中，第四比特序列中的越重要的比特在进行星座调制时映射到星座符号的越高位。该种可能的实现方式，由于星座符号的越高位的能量越高，因此，该可选的方法可以提高接收端解码更重要的信息的概率，从而保证重要数据的传输可靠性，同时可以提升数据自适应信道的能力。
在一种可能的实现方式中，第二处理包括比特拼接、星座调制和星座符号拼接，发送端对第一信息进行第二处理得到第二信息，包括：发送端对N层第三比特序列进行比特拼接得到M层第四比特序列，M层第四比特序列中的第m层第四比特序列包含：N层第三比特序列中的包含第m个比特的全部第三比特序列中的第m个比特，M为大于1的整数，m为大于0小于等于M的整数；发送端对M层第四比特序列分别进行星座调制得到M层星座符号序列；发送端对M层星座符号序列进行星座符号拼接得到第二信息。
在一种可能的实现方式中，M层第四比特序列中的越重要的第四比特序列采用调制阶数越低的调制方式。该种可能的实现方式，可以使得越重要的信息采用越可靠的星座调制方式，提高接收端正确解调重要信息的概率，提高数据传输的可靠性。
在一种可能的实现方式中，第二处理包括星座调制和星座符号拼接，发送端对第一信息进行第二处理得到第二信息，包括：发送端对N层第三比特序列分别进行星座调制得到N层星座符号序列；发送端对N层星座符号序列进行星座符号拼接得到第二信息。
在一种可能的实现方式中，N层第三比特序列中的越重要的第三比特序列采用调制阶数越低的调制方式。该种可能的实现方式，可以使得越重要的信息采用越可靠的星座调制方式，提高接收端正确解调重要信息的概率，提高数据传输的可靠性。
在一种可能的实现方式中，N层第三比特序列中的每层第三比特序列中的越重要的比特映射到对应的星座符号序列中的星座符号的越高位。该种可能的实现方式，由于星座符号的越高位的能量越高，因此，该可选的方法可以提高接收端解码更重要的信息的概率，从而保证重要数据的传输可靠性，同时可以提升数据自适应信道的能力。
第二方面，提供了一种数据处理方法，包括：接收端从发送端接收第二信息和第三信息，第二信息由发送端对第一信息进行第二处理得到；第一信息由发送端对N层第一比特序列进行第一处理得到，第一信息不包括N层第一比特序列中的全部比特或第一信息包括N层第一比特序列中的部分比特；N层第一比特序列由发送端对原始信息进行分层得到，原始信息为至少一个比特序列或至少一个整数；第三信息由发送端对N层第一比特序列的 编码信息进行信道编码和星座调制得到，编码信息用于指示N层第一比特序列中的每层第一比特序列中的0或1的占比信息，N为大于1的整数；接收端对第三信息进行星座解调和信道解码得到还原后的编码信息；接收端对第二信息进行第三处理得到第一软信息，第一软信息为第一信息中的每个比特对应的对数似然比；接收端根据编码信息对第一软信息进行第四处理得到第二软信息，第二软信息为N层第一比特序列中每层第一比特序列中的比特对应的对数似然比；接收端对第二软信息进行重建得到还原后的原始信息。第二方面提供的方法，发送端可以将N层第一比特序列的编码信息和不包含N层第一比特序列中的部分或全部比特的第二信息向接收端发送，接收端可以根据该编码信息以及第二信息处理得到N层第一比特序列。由于发送端将编码信息发送给了接收端，因此，发送端发送的信息可以不包含N层第一比特序列中的部分或全部比特，从而降低了数据对带宽的需求，提高了数据的编码效率。
在一种可能的实现方式中，第三处理包括星座解调和软信息拆分，接收端对第二信息进行第三处理得到第一软信息，包括：接收端对第二信息进行星座解调得到第三软信息，第三软信息为第四比特序列中的每个比特对应的对数似然比，第四比特序列由发送端对N层第三比特序列进行比特拼接得到，N层第三比特序列为第一信息；接收端对第三软信息进行软信息拆分得到第一软信息，第一软信息中包括N层软信息，一层软信息为N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
在一种可能的实现方式中，第三处理包括星座符号拆分、星座解调和软信息拆分，接收端对第二信息进行第三处理得到第一软信息，包括：接收端对第二信息进行星座符号拆分得到M层星座符号序列，M层星座符号序列由发送端对M层第四比特序列分别进行星座调制得到，M层第四比特序列为发送端对N层第三比特序列进行比特拼接得到，M层第四比特序列中的第m层第四比特序列包含：N层第三比特序列中的包含第m个比特的全部第三比特序列中的第m个比特，N层第三比特序列为第一信息，M为大于1的整数，m为大于0小于等于M的整数；接收端对M层星座符号序列分别进行星座解调得到M层第三软信息，M层第三软信息分别为M层第四比特序列中的比特对应的对数似然比；接收端对M层第三软信息进行软信息拆分得到第一软信息，第一软信息中包括N层软信息，一层软信息为N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
在一种可能的实现方式中，第三处理包括星座符号拆分和星座解调，接收端对第二信息进行第三处理得到第一软信息，包括：接收端对第二信息进行星座符号拆分得到N层星座符号序列，N层星座符号序列由发送端对N层第三比特序列分别进行星座调制得到，N层第三比特序列为第一信息；接收端对N层星座符号序列分别进行星座解调得到第一软信息，第一软信息中包括N层软信息，一层软信息为N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
在一种可能的实现方式中，第四处理包括软信息拼接和信道解码，接收端根据编码信息对第一软信息进行第四处理得到第二软信息，包括：接收端根据编码信息进行软信息计算得到N层第一比特序列中的第n层第一比特序列中的在比特剪切过程中剪切掉的比特依次对应的对数似然比，n＝1，2，…，N；接收端将第n层第一比特序列中的在比特剪切过程中剪切掉的比特依次对应的对数似然比与第一软信息中的第n层软信息中的对数似然比进行软信息拼接得到第n层第二比特序列对应的软信息序列，第n层第二比特序列对应的 软信息序列包括第n层第二比特序列中的比特依次对应的对数似然比，第n层软信息中的对数似然比为N层第三比特序列中的第n层第三比特序列中的比特对应的对数似然比，第n层第三比特序列由发送端对第n层第二比特序列进行比特剪切得到，第n层第二比特序列由发送端对N层第一比特序列中的第n层第一比特序列进行信道编码得到，第n层第三比特序列为第n层第二比特序列中的除第n层第一比特序列中的部分或全部比特之外的部分；接收端将N层第二比特序列中的每层第二比特序列对应的软信息序列进行信道解码得到第二软信息，第二软信息中包括N层第一比特序列中的每层第一比特序列中的比特对应的对数似然比。
在一种可能的实现方式中，第四处理为无速率解码，接收端根据编码信息对第一软信息进行第四处理得到第二软信息，包括：接收端根据编码信息进行软信息计算得到N层第一比特序列中的第n层第一比特序列中的比特依次对应的对数似然比，n＝1，2，…，N；接收端根据通过软信息计算得到的N层第一比特序列中的每层第一比特序列中的比特依次对应的对数似然比对第一软信息进行无速率解码得到第二软信息，第二软信息中包括N层第一比特序列中的每层第一比特序列中的比特对应的对数似然比。
第三方面，提供了一种发送端装置，包括：处理单元和发送单元；所述处理单元，用于将原始信息进行分层得到N层第一比特序列，对所述N层第一比特序列进行第一处理得到第一信息，对所述第一信息进行第二处理得到第二信息，对所述N层第一比特序列的编码信息进行信道编码和星座调制得到第三信息；其中，所述原始信息为至少一个比特序列或至少一个整数，所述第一信息不包括所述N层第一比特序列中的全部比特或所述第一信息包括所述N层第一比特序列中的部分比特，所述编码信息用于指示所述N层第一比特序列中的每层第一比特序列中的0或1的占比信息，N为大于1的整数；所述发送单元，用于向接收端发送所述第二信息和所述第三信息。
在一种可能的实现方式中，所述处理单元，具体用于：按照所述原始信息中的信息的重要性由高至低或由低至高的顺序将所述原始信息进行分层得到所述N层第一比特序列。
在一种可能的实现方式中，所述第一处理包括信道编码和比特剪切，所述处理单元，具体用于：对所述N层第一比特序列中的第n层第一比特序列进行信道编码得到第n层第二比特序列，n＝1，2，…，N；对所述第n层第二比特序列进行比特剪切得到第n层第三比特序列；其中，所述第n层第三比特序列为所述第n层第二比特序列中的除所述第n层第一比特序列中的部分或全部比特之外的部分。
在一种可能的实现方式中，所述第一处理为无速率编码，所述处理单元，具体用于：对所述N层第一比特序列中的第n层第一比特序列进行无速率编码得到第n层第三比特序列，n＝1，2，…，N。
在一种可能的实现方式中，所述N层第一比特序列中的越重要的第一比特序列采用编码码率越低和/或编码码长越长的信道编码方式。
在一种可能的实现方式中，所述第二处理包括比特拼接和星座调制，所述处理单元，具体用于：对N层第三比特序列进行比特拼接得到一层第四比特序列；对所述第四比特序列进行星座调制得到所述第二信息。
在一种可能的实现方式中，所述第四比特序列中的越重要的比特在进行星座调制时映射到星座符号的越高位。
在一种可能的实现方式中，所述第二处理包括比特拼接、星座调制和星座符号拼接，所述处理单元，具体用于：对N层第三比特序列进行比特拼接得到M层第四比特序列，所述M层第四比特序列中的第m层第四比特序列包含：所述N层第三比特序列中的包含第m个比特的全部第三比特序列中的第m个比特，M为大于1的整数，m为大于0小于等于M的整数；对所述M层第四比特序列分别进行星座调制得到M层星座符号序列；对所述M层星座符号序列进行星座符号拼接得到所述第二信息。
在一种可能的实现方式中，所述M层第四比特序列中的越重要的第四比特序列采用调制阶数越低的调制方式。
在一种可能的实现方式中，所述第二处理包括星座调制和星座符号拼接，所述处理单元，具体用于：对N层第三比特序列分别进行星座调制得到N层星座符号序列；对所述N层星座符号序列进行星座符号拼接得到所述第二信息。
在一种可能的实现方式中，所述N层第三比特序列中的越重要的第三比特序列采用调制阶数越低的调制方式。
在一种可能的实现方式中，所述N层第三比特序列中的每层第三比特序列中的越重要的比特映射到对应的星座符号序列中的星座符号的越高位。
第四方面，提供了一种接收端装置，包括：接收单元和处理单元；所述接收单元，用于从发送端接收第二信息和第三信息，所述第二信息由所述发送端对第一信息进行第二处理得到；所述第一信息由所述发送端对N层第一比特序列进行第一处理得到，所述第一信息不包括所述N层第一比特序列中的全部比特或所述第一信息包括所述N层第一比特序列中的部分比特；所述N层第一比特序列由所述发送端对原始信息进行分层得到，所述原始信息为至少一个比特序列或至少一个整数；所述第三信息由所述发送端对所述N层第一比特序列的编码信息进行信道编码和星座调制得到，所述编码信息用于指示所述N层第一比特序列中的每层第一比特序列中的0或1的占比信息，N为大于1的整数；所述处理单元，用于对所述第三信息进行星座解调和信道解码得到还原后的所述编码信息，对所述第二信息进行第三处理得到第一软信息，根据所述编码信息对所述第一软信息进行第四处理得到第二软信息，对所述第二软信息进行重建得到还原后的所述原始信息；其中，所述第一软信息为所述第一信息中的每个比特对应的对数似然比，所述第二软信息为所述N层第一比特序列中每层第一比特序列中的比特对应的对数似然比。
在一种可能的实现方式中，所述第三处理包括星座解调和软信息拆分，所述处理单元，具体用于：对所述第二信息进行星座解调得到第三软信息，所述第三软信息为第四比特序列中的每个比特对应的对数似然比，所述第四比特序列由所述发送端对N层第三比特序列进行比特拼接得到，所述N层第三比特序列为所述第一信息；对所述第三软信息进行软信息拆分得到所述第一软信息，所述第一软信息中包括N层软信息，一层软信息为所述N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
在一种可能的实现方式中，所述第三处理包括星座符号拆分、星座解调和软信息拆分，所述处理单元，具体用于：对所述第二信息进行星座符号拆分得到M层星座符号序列，所述M层星座符号序列由所述发送端对M层第四比特序列分别进行星座调制得到，所述M层第四比特序列为所述发送端对N层第三比特序列进行比特拼接得到，所述M层第四比特序列中的第m层第四比特序列包含：所述N层第三比特序列中的包含第m个比特的全 部第三比特序列中的第m个比特，所述N层第三比特序列为所述第一信息，M为大于1的整数，m为大于0小于等于M的整数；对所述M层星座符号序列分别进行星座解调得到M层第三软信息，所述M层第三软信息分别为所述M层第四比特序列中的比特对应的对数似然比；对所述M层第三软信息进行软信息拆分得到第一软信息，所述第一软信息中包括N层软信息，一层软信息为所述N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
在一种可能的实现方式中，所述第三处理包括星座符号拆分和星座解调，所述处理单元，具体用于：对所述第二信息进行星座符号拆分得到N层星座符号序列，所述N层星座符号序列由发送端对N层第三比特序列分别进行星座调制得到，所述N层第三比特序列为所述第一信息；对所述N层星座符号序列分别进行星座解调得到第一软信息，所述第一软信息中包括N层软信息，一层软信息为所述N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
在一种可能的实现方式中，所述第四处理包括软信息拼接和信道解码，所述处理单元，具体用于：根据所述编码信息进行软信息计算得到N层第一比特序列中的第n层第一比特序列中的在比特剪切过程中剪切掉的比特依次对应的对数似然比，n＝1，2，…，N；将所述第n层第一比特序列中的在比特剪切过程中剪切掉的比特依次对应的对数似然比与所述第一软信息中的第n层软信息中的对数似然比进行软信息拼接得到所述第n层第二比特序列对应的软信息序列，所述第n层第二比特序列对应的软信息序列包括所述第n层第二比特序列中的比特依次对应的对数似然比，所述第n层软信息中的对数似然比为所述N层第三比特序列中的第n层第三比特序列中的比特对应的对数似然比，所述第n层第三比特序列由所述发送端对所述第n层第二比特序列进行所述比特剪切得到，所述第n层第二比特序列由所述发送端对所述N层第一比特序列中的第n层第一比特序列进行信道编码得到，所述第n层第三比特序列为所述第n层第二比特序列中的除所述第n层第一比特序列中的部分或全部比特之外的部分；将N层第二比特序列中的每层第二比特序列对应的软信息序列进行信道解码得到第二软信息，所述第二软信息中包括所述N层第一比特序列中的每层第一比特序列中的比特对应的对数似然比。
在一种可能的实现方式中，所述第四处理为无速率解码，所述处理单元，具体用于：根据所述编码信息进行软信息计算得到N层第一比特序列中的第n层第一比特序列中的比特依次对应的对数似然比，n＝1，2，…，N；根据通过软信息计算得到的N层第一比特序列中的每层第一比特序列中的比特依次对应的对数似然比对所述第一软信息进行无速率解码得到第二软信息，所述第二软信息中包括所述N层第一比特序列中的每层第一比特序列中的比特对应的对数似然比。
第五方面，提供了一种发送端装置，包括：处理器，所述处理器用于执行计算机指令，以实现第一方面提供的任意一种方法。
在一种可能的实现方式中，发送端装置还包括存储器，所述处理器与所述存储器耦合，所述存储器用于存储所述计算机指令。
在一种可能的实现方式中，存储器和处理器集成在一起，或者，存储器和处理器为独立的器件。
在一种可能的实现方式中，发送端装置还包括通信接口和通信总线，处理器、存储器 和通信接口通过通信总线连接。通信接口用于执行相应方法中的发送的动作。例如，通信接口通过其中的发送器执行相应方法中的发送动作。
第六方面，提供了一种接收端装置，包括：处理器，所述处理器用于用于执行计算机指令，以实现第二方面提供的任意一种方法。
在一种可能的实现方式中，接收端装置还包括存储器，所述处理器与所述存储器耦合，所述存储器用于存储所述计算机指令。
在一种可能的实现方式中，存储器和处理器集成在一起，或者，存储器和处理器为独立的器件。
在一种可能的实现方式中，接收端装置还包括通信接口和通信总线，处理器、存储器和通信接口通过通信总线连接。通信接口用于执行相应方法中的接收的动作。例如，通信接口通过其中的接收器执行相应方法中的接收动作。
第七方面，提供了一种发送端装置，包括：逻辑电路和输出接口，逻辑电路和输出接口用于实现第一方面提供的任意一种方法。其中，逻辑电路用于执行相应方法中的处理动作，输出接口用于执行相应方法中的发送的动作。
第八方面，提供了一种接收端装置，包括：逻辑电路和输入接口，逻辑电路和输入接口用于实现第二方面提供的任意一种方法。其中，逻辑电路用于执行相应方法中的处理动作，输入接口用于执行相应方法中的接收的动作。
第九方面，提供了一种通信系统，包括：第三方面提供的发送端装置和第四方面提供的接收端装置；或者，第五方面提供的发送端装置和第六方面提供的接收端装置；或者，第七方面提供的发送端装置和第八方面提供的接收端装置。
第十方面，提供了一种计算机可读存储介质，所述计算机可读存储介质存储计算机指令，当该计算机指令在计算机上运行时，使得计算机执行第一方面提供的任意一种方法。
第十一方面，提供了一种计算机可读存储介质，所述计算机可读存储介质存储计算机指令，当该计算机指令在计算机上运行时，使得计算机执行第二方面提供的任意一种方法。
第十二方面，提供了一种包含计算机指令的计算机程序产品，当该计算机指令在计算机上运行时，使得计算机执行第一方面提供的任意一种方法。
第十三方面，提供了一种包含计算机指令的计算机程序产品，当该计算机指令在计算机上运行时，使得计算机执行第二方面提供的任意一种方法。
第十四方面，提供一种发送端装置，包括：处理器，所述处理器被耦合到存储器，所述存储器用于存储计算机执行指令，所述处理器执行所述存储器存储的所述计算机执行指令，以使所述装置执行第一方面提供的任意一种方法。
在一种可能的实现方式中，所述存储器位于所述发送端装置内部。
在一种可能的实现方式中，所述存储器位于所述发送端装置外部。
第十五方面，提供一种接收端装置，包括：处理器，所述处理器被耦合到存储器，所述存储器用于存储计算机执行指令，所述处理器执行所述存储器存储的所述计算机执行指令，以使所述装置执行第二方面提供的任意一种方法。
在一种可能的实现方式中，所述存储器位于所述接收端装置内部。
在一种可能的实现方式中，所述存储器位于所述接收端装置外部。
第三方面至第十五方面中的任一种实现方式所带来的技术效果可参见第一方面和第 二方面中对应实现方式所带来的技术效果，此处不再赘述。
其中，需要说明的是，上述各个方面中的任意一个方面的各种可能的实现方式，在方案不矛盾的前提下，均可以进行组合。
附图说明
图1为一种网络架构组成示意图；
图2为一种发送端和接收端处理数据的流程示意图；
图3为本申请实施例提供的数据处理方法的流程图；
图4为本申请实施例提供的一种数据处理的流程示意图；
图5为本申请实施例提供的一种DCT量化系数进行二进制转换的示意图；
图6至图11分别为本申请实施例提供的一种数据处理的流程示意图；
图12为本申请实施例提供的一种发送端装置的组成示意图；
图13和图14分别为本申请实施例提供的一种发送端装置的硬件结构示意图；
图15为本申请实施例提供的一种接收端装置的组成示意图；
图16和图17分别为本申请实施例提供的一种接收端装置的硬件结构示意图。
具体实施方式
下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行描述。其中，在本申请的描述中，除非另有说明，“/”表示或的意思，例如，A/B可以表示A或B。本文中的“和/或”仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。
在本申请的描述中，除非另有说明，“多个”是指两个或多于两个。另外，为了便于清楚描述本申请实施例的技术方案，在本申请的实施例中，采用了“第一”、“第二”等字样对功能和作用基本相同的相同项或相似项进行区分。本领域技术人员可以理解“第一”、“第二”等字样并不对数量和执行次序进行限定，并且“第一”、“第二”等字样也并不限定一定不同。
本申请实施例提供了一种通信系统，该通信系统包括发送端和接收端。发送端可以为网络设备或终端。当发送端为网络设备时，接收端可以为终端。当发送端为终端时，接收端可以为网络设备也可以为终端。当发送端为网络设备，接收端为终端时，该通信系统的架构示意图可参见图1。
网络设备可以为部署在无线接入网(radio access network，RAN)中为终端提供无线通信功能的装置，例如可以为基站、各种形式的控制节点(例如，网络控制器、无线控制器(例如，云无线接入网络(cloud radio access network，CRAN)场景下的无线控制器))等。示例性的，网络设备可以为各种形式的宏基站，微基站(也称为小站)，中继站，接入点(access point，AP)等，也可以为基站的天线面板。所述控制节点可以连接多个基站，并为所述多个基站覆盖下的多个终端配置资源。在采用不同的无线接入技术的系统中，具备基站功能的设备的名称可能会有所不同。例如，长期演进(long term evolution，LTE)系统中可以称为演进型基站(evolved NodeB，eNB或eNodeB)，第五代(5th-generation，5G)系统或新无线(new radio，NR)系统中可以称为下一代基站节点(next generation node base station，gNB)，本申请对基站的具体名称不作限定。网络设备还可以是未来演进的公共陆地移动网络(public land mobile network，PLMN)中的网络设备等。
终端可以是一种向用户提供语音或者数据连通性的设备，也可以称为用户设备(user  equipment，UE)，移动台(mobile station)，用户单元(subscriber unit)，站台(station)，终端设备(terminal equipment，TE)等。例如，终端可以为蜂窝电话(cellular phone)，个人数字助理(personal digital assistant，PDA)，无线调制解调器(modem)，手持设备(handheld)，膝上型电脑(laptop computer)，无绳电话(cordless phone)，无线本地环路(wireless local loop，WLL)台，平板电脑(pad)，智能手机(smartphone)，用户驻地设备(customer premise equipment，CPE)，具有网络接入功能的传感器等。随着无线通信技术的发展，可以接入通信系统、可以与通信系统的网络侧进行通信，或者通过通信系统与其它物体进行通信的设备都可以是本申请实施例中的终端，譬如，智能交通中的终端和汽车、智能家居中的家用设备、智能电网中的电力抄表仪器、电压监测仪器、环境监测仪器、智能安全网络中的视频监控仪器、收款机等等。
本申请实施例提供的技术方案可以应用于多种通信场景。例如，机器对机器(machine to machine，M2M)、宏微通信、增强型移动宽带(enhanced mobile broadband，eMBB)、超高可靠超低时延通信(ultra-reliable & low latency communication，URLLC)以及海量物联网通信(massive machine type communication，mMTC)等场景。
本申请实施例描述的网络架构以及业务场景是为了更加清楚的说明本申请实施例的技术方案，并不构成对于本申请实施例提供的技术方案的限定。本领域普通技术人员可知，随着网络架构的演变和新业务场景的出现，本申请实施例提供的技术方案对于类似的技术问题同样适用。
为了使得本申请更加的清楚，首先对本申请提到的部分概念和内容作简单介绍。
1、数据发送和接收的一般流程
参见图2，在数据发送和接收过程中，发送端将对信源进行信源编码、信道编码、星座调制、资源映射后得到的信号向接收端发送，该信号在发送端和接收端之间的信道上传输时，可能会受到噪声的干扰，接收端接收到该信号后，对该信号进行资源解映射、星座解调、信道解码、信源解码得到信宿(即还原出的信源)。
图2中仅仅示出了数据发送和接收过程中的部分步骤，在实际实现时，还可以有其他的步骤，本申请实施例对此不作限制。
2、信源编码
信源编码是一种以提高通信有效性为目的而对信源进行的变换，或者说为了减少或消除信源冗余度而进行的信源变换。具体说，就是针对信源的统计特性来寻找某种方法，把信源变换为最短的比特序列，使后者的各比特所载荷的平均信息量最大，同时又能保证无失真地恢复原来的信源。
信源编码的逆过程为信源解码，信源解码即将信源解码前的信号还原得到信源的过程。
3、信道编码
信道编码也叫差错控制编码，就是在发送端对信息比特(例如，图2中的信源编码后的比特)添加冗余比特，这些冗余比特是和信息比特相关的。信道编码后的信号依次包括信息比特和冗余比特。
信道编码的逆过程为信道解码，信道解码即接收端根据冗余比特与信息比特的相关性来检测和纠正传输过程产生的差错，还原出信息比特，从而对抗传输过程的干扰，提高数据传输的可靠性。
4、星座调制
星座调制是指将比特序列中的比特映射到星座图中的星座符号上。其中，一个星座符号包括一个比特位或多个比特位，比特序列中的一个比特可以映射到星座符号中的一个比特位。
星座调制的目的，是把需要传输的数字信号(例如，上述比特序列)在时域、频域或者码域上进行处理，以达到用尽量小的带宽传输尽量多的信息。
星座调制的逆过程为星座解调，星座解调即从星座符号上恢复比特序列的过程。
5、资源映射
资源映射即将信号(例如，图2中的星座调制后的信号)映射到传输资源(例如，时域、频域或者空域资源)上的过程。
资源映射的逆过程为资源解映射，资源解映射即将映射到传输资源上的信号还原得到映射前的信号的过程。
6、无速率编码
无速率编码是一种信道编码方式。无速率编码后的信号中仅包括冗余比特。
7、编码码率
编码码率是指编码之前的比特(即信息比特)在编码之后的比特中的占比。一个比特序列，若采用编码码率越低的编码方式进行编码，则编码之后的比特序列中的冗余比特越多，数据传输的可靠性越高。
8、编码码长
编码码长是指编码之后的比特序列中的比特数。在信息比特数固定的情况下，若采用编码码长越长的编码方式进行编码，则编码之后的比特序列中的冗余比特越多，数据传输的可靠性越高。
9、调制阶数
调制阶数用于计算每个星座符号所能代表的比特数。其中，二进制相移键控(binary phase shift keying，BPSK)，正交相移键控(quadrature phase shift keying，QPSK)，8正交幅度调制(quadrature amplitude modulation，QAM)，16QAM，32QAM，64QAM，256QAM对应的调制阶数分别为2，4，8，16，32，64，256，这些调制阶数对应的比特数分别是log 2(2)(即1)，log 2(4)(即2)，log 2(8)(即3)，log 2(16)(即4)，log 2(32)(即5)，log 2(64)(即6)，log 2(256)(即8)。
调制阶数越高，误码率(bit error rate，BER)越高。从星座图上去理解的话，调制阶数越高，星座符号(即星座点)越密，例如，调制阶数为32时，星座图中的星座符号个数为32，调制阶数为64时，星座图中的星座符号个数为64。星座图中的星座符号越密，星座符号之间的距离降低了，判决的时候越容易被判定成别的星座符号，所以BER越高。
10、对数似然比
一个比特的对数似然比是指该比特为1的概率和该比特为0的概率的比值取自然对数。若将该比特为1的概率记为p(1)，将该比特为0的概率记为p(0)，则该比特的对数似然比为ln[p(1)/p(0)]。
本申请实施例提供了一种数据处理方法，如图3或图4所示，包括：
301、发送端将原始信息进行分层得到N层第一比特序列，原始信息为至少一个比特 序列或至少一个整数，N为大于1的整数。
本申请实施例中的发送端可以为终端或网络设备或终端中的芯片(例如，用来实现高速低时延投屏等功能的短距通信芯片)或网络设备中的芯片等。
在本申请实施例中，原始信息可以有以下两种情况：
情况1、原始信息为对视频、指令、语音、图片、文字等数据经过信源编码后得到的一个或多个比特序列或原始信息为对离散余弦变换(discrete cosine transform，DCT)量化系数进行二进制转换后得到的一个或多个比特序列。
其中，DCT量化系数中包括一个或多个整数。
示例性的，原始信息可以为对视频数据经过信源编码后得到的1个比特序列，例如，10001100001101110110010011000011。原始信息也可以为对视频数据经过信源编码后得到的4个比特序列，例如，10001100、00110111、01100100、11000011。原始信息还可以为对DCT量化系数中的一个或多个整数经过二进制转换之后得到的一个或多个比特序列，该一个或多个比特序列中包含的比特个数即二进制转换的位数。例如，参见图5，若DCT量化系数为255、55、72、12、43、93，则按照8位的二进制转换位数进行二进制转换之后可以得到6个比特序列，分别为11111111、00110111、01001000、00001100、00101011、01011101，这6个比特序列即原始信息，一个比特序列对应DCT量化系数中的一个整数，11111111、00110111、01001000、00001100、00101011、01011101对应的整数分别为255、55、72、12、43、93。
情况2、原始信息为DCT量化系数。
其中，DCT量化系数中包括一个或多个整数。示例性的，DCT量化系数为255、55、72、12、43、93。
在情况1和情况2下，针对图片或视频，发送端可以将图像中的像素点的像素值进行DCT变换得到DCT系数，再对DCT系数进行量化得到DCT量化系数，其中，DCT系数为实数，DCT量化系数为整数。
302、发送端对N层第一比特序列进行第一处理得到第一信息，第一信息不包括N层第一比特序列中的全部比特或第一信息包括N层第一比特序列中的部分比特。
303、发送端对第一信息进行第二处理得到第二信息。
304、发送端对N层第一比特序列的编码信息进行信道编码和星座调制得到第三信息，编码信息用于指示N层第一比特序列中的每层第一比特序列中的0或1的占比信息。
示例性的，编码信息可以为N层第一比特序列中的每层第一比特序列中的0或1的占比信息。
其中，步骤304可以执行在步骤303之后，也可以执行在步骤303或步骤302之前。
305、发送端向接收端发送第二信息和第三信息。相应的，接收端从发送端接收第二信息和第三信息。
本申请实施例中的接收端可以为终端或网络设备或终端中的芯片(例如，用来实现高速低时延投屏等功能的短距通信芯片)或网络设备中的芯片等。
306、接收端对第三信息进行星座解调和信道解码得到还原后的编码信息。
307、接收端对第二信息进行第三处理得到第一软信息，第一软信息为第一信息中的每个比特对应的对数似然比。
其中，步骤306和步骤307的执行顺序不分先后。
308、接收端根据编码信息对第一软信息进行第四处理得到第二软信息，第二软信息为N层第一比特序列中每层第一比特序列中的比特对应的对数似然比。
309、接收端对第二软信息进行重建得到还原后的原始信息。
上述方法中，N层第一比特序列也可以称为数据信息比特，编码信息也可以称为编码前0/1比特概率分布信息或控制信息比特。
图3和图4所示的流程仅仅为本申请提供的包含本申请创新点的基本流程，在实际实现时，发送端和接收端还可以包含其他操作。例如，第二信息和第三信息在信道上传输之前，发送端还可以进行资源映射(即将第二信息和第三信息映射到传输资源上进行传输)，相应的，第二信息和第三信息在信道上传输之后，接收端还可以进行资源解映射(即将第二信息和第三信息从传输资源上提取出来)，从而获取到第二信息和第三信息。再例如，在进行资源映射之后，发送端还可以进行块组装，相应的，接收端在进行资源解映射之前还可以进行信道估计和均衡。
本申请实施例提供的方法，发送端可以将N层第一比特序列的编码信息和不包含N层第一比特序列中的部分或全部比特的第二信息向接收端发送，接收端可以根据该编码信息以及第二信息处理得到N层第一比特序列。由于发送端将编码信息发送给了接收端，因此，发送端发送的信息可以不包含N层第一比特序列中的部分或全部比特，从而降低了数据对带宽的需求，提高了数据的编码效率。
可选的，上述步骤301在具体实现时，包括：发送端按照原始信息中的信息的重要性由高至低或由低至高的顺序将原始信息进行分层得到N层第一比特序列。其中，原始信息中的越重要的信息对还原原始信息对应的视频、指令、语音、图片、文字等影响越大。
具体的，发送端可以通过比特平面分层技术对原始信息进行分层得到N层第一比特序列，也可以通过信源编码(例如，可扩展的视频编码(scalable video coding，SVC)、基于图块的306度分层(Tile-based 360°))等视频编码技术或者其他方式将原始信息分为N层第一比特序列。
步骤302在具体实现时可以通过以下方式1.1或方式1.2实现。
方式1.1
在方式1.1中，第一处理包括信道编码和比特剪切，该情况下，步骤302在具体实现时包括：
302-1a、发送端对N层第一比特序列中的第n层第一比特序列进行信道编码得到第n层第二比特序列，n＝1，2，…，N。
其中，信道编码的方式可以为除无速率编码之外的任意一种信道编码方式。不同层第一比特序列采用的信道编码的方式可以相同，也可以不同，本申请实施例对此不作具体限制。
302-1b、发送端对第n层第二比特序列进行比特剪切得到第n层第三比特序列；其中，第n层第三比特序列为第n层第二比特序列中的除第n层第一比特序列中的部分或全部比特之外的部分。
其中，一个第二比特序列包括对应的第一比特序列(即信息比特)以及冗余比特。在进行比特剪切时，可以剪切第二比特序列中的第一比特序列中的部分比特或全部比特。其 中，该部分比特可以为第一比特序列中的高位比特，也可以为低位比特，还可以为中间位置的比特，本申请实施例对此不作具体限制。
示例性的，若一个第一比特序列为1111，该第一比特序列经过信道编码后得到的第二比特序列为11110010，11110010中的前4位比特为信息比特，后四位比特为冗余比特。假设在进行比特剪切时剪切掉的为第二比特序列中的第一比特序列中的全部比特，则将11110010的前4位比特剪切后得到的第三比特序列为0010。
在接收端，与步骤302对应的步骤为步骤308，在方式1.1下，第四处理包括软信息拼接和信道解码，步骤308在具体实现时包括步骤308-1a至308-1c：
308-1a、接收端根据编码信息进行软信息计算得到N层第一比特序列中的第n层第一比特序列中的在比特剪切过程中剪切掉的比特依次对应的对数似然比，n＝1，2，…，N。
其中，根据编码信息进行软信息计算时，得到的第n层第一比特序列中的每个比特对应的对数似然比均相同。例如，若一层第一比特序列中的0的占比为3/4，则根据编码信息计算得到的该层第一比特序列中的每个比特对应的对数似然比均为ln((1/4)/(3/4))＝ln(1/3)。
308-1b、接收端将第n层第一比特序列中的在比特剪切过程中剪切掉的比特依次对应的对数似然比与第一软信息中的第n层软信息中的对数似然比进行软信息拼接得到第n层第二比特序列对应的软信息序列，第n层第二比特序列对应的软信息序列包括第n层第二比特序列中的比特依次对应的对数似然比，第n层软信息中的对数似然比为N层第三比特序列中的第n层第三比特序列中的比特对应的对数似然比。
其中，关于第一软信息的获取方法可参见下文。
步骤308-1b在具体实现时，若剪切掉的比特为第一比特序列的最高位的一个或多个比特，则在第n层第二比特序列对应的软信息序列中，第n层第一比特序列中的在比特剪切过程中剪切掉的比特依次对应的对数似然比位于第一软信息中的第n层软信息中的对数似然比之前。示例性的，若第n层第一比特序列在比特剪切过程中剪切掉的比特对应的对数似然比依次为L1和L2，第一软信息中的第n层软信息中包含的对数似然比依次为L3、L4、L5和L6，则第n层第二比特序列对应的软信息序列包括：L1-L2-L3-L4-L5-L6。
308-1c、接收端将N层第二比特序列中的每层第二比特序列对应的软信息序列进行信道解码得到第二软信息，第二软信息中包括N层第一比特序列中的每层第一比特序列中的比特对应的对数似然比。
其中，第n层第二比特序列对应的软信息序列进行信道解码可以得到第n层第一比特序列中的比特对应的对数似然比。
步骤308-1c在具体实现时，接收端采用与发送端的信道编码方式对应的信道解码方式进行信道解码。
在方式1.1下，步骤308在具体实现时，接收端需要获知发送端在比特剪切时剪切掉的为哪几个比特，以便进行软信息拼接，还需要获知信道编码的码率(或第一比特序列中的比特个数和编码码长)，以便进行信道解码。发送端在比特剪切时剪切掉的为哪几个比特以及信道编码的码率(或第一比特序列中的比特个数和编码码长)等信息可以是发送端发送给接收端的，也可以是预配置或预定义在接收端的，还可以部分是发送端发送给接收端的，部分是预配置或预定义在接收端的。
方式1.2
第一处理为无速率编码，该情况下，步骤302在具体实现时包括步骤302-2a：
302-2a、发送端对N层第一比特序列中的第n层第一比特序列进行无速率编码得到第n层第三比特序列，n＝1，2，…，N。
其中，在无速率编码的过程中，发送端会剪切掉信息比特，仅保留冗余比特。
在接收端，与步骤302对应的步骤为步骤308，在方式1.2下，步骤308在具体实现时包括步骤308-2a和308-2b：
308-2a、接收端根据编码信息进行软信息计算得到N层第一比特序列中的第n层第一比特序列中的比特依次对应的对数似然比，n＝1，2，…，N。
其中，计算第一比特序列中的比特对应的对数似然比的方法可参见步骤308-1a的相关描述，在此不再赘述。
308-2b、接收端根据通过软信息计算得到的N层第一比特序列中的每层第一比特序列中的比特依次对应的对数似然比对第一软信息进行无速率解码得到第二软信息，第二软信息中包括N层第一比特序列中的每层第一比特序列中的比特对应的对数似然比。
其中，在无速率解码的过程中，接收端会对通过软信息计算得到的N层第一比特序列中的第n层第一比特序列中的比特依次对应的对数似然比和第一软信息中的第n层软信息进行软信息拼接，第n层软信息中的对数似然比为N层第三比特序列中的第n层第三比特序列中的比特对应的对数似然比。示例性的，若通过软信息计算得到的第n层第一比特序列中的比特对应的对数似然比依次为L1、L2、L3、L4，第一软信息中的第n层软信息中包含的对数似然比依次为L5和L6，则针对第n层第一比特序列，经过软信息拼接后的软信息序列包括：L1-L2-L3-L4-L5-L6。
在方式1.2下，步骤308在具体实现时，接收端需要获知信道编码的码率(或第一比特序列中的比特个数和编码码长)，以便进行无速率解码。发送端进行信道编码的码率(或第一比特序列中的比特个数和编码码长)等信息可以是发送端发送给接收端的，也可以是预配置或预定义在接收端的，还可以部分是发送端发送给接收端的，部分是预配置或预定义在接收端的。
在上述方式1.1和方式1.2中，可以理解的是，N层第三比特序列即上述第一信息。方式1.1和方式1.2中通过比特剪切或无速率编码可以压缩原始信息，降低系统传输资源需求。
在上述方式1.1和方式1.2中，可选的，N层第一比特序列中的越重要的第一比特序列采用编码码率越低和/或编码码长越长的信道编码方式，或者，N层第一比特序列中的等级越高的第一比特序列采用编码码率越低和/或编码码长越长的信道编码方式，等级越高的第一比特序列越重要，一个等级中包括一个或多个第一比特序列。该可选的方法，由于经过编码码率越低和/或编码码长越长的信道编码方式进行信道编码后的序列中冗余比特越多，因此，编码码率越低和/或编码码长越长的信道编码方式越可靠，从而可以增加接收端正确解码更重要的信息的概率，提高数据传输的可靠性，提升数据自适应信道的能力。另外，与N层第一比特序列均采用很可靠的信道编码方式相比，还可以提升信道编码效率。
以视频数据为例，由于越重要的比特对于恢复视频数据更加的关键，只要接收端能准确接收这部分信息，基本的画面质量和观赏感就能保证。不管信噪比(signal-to-noise ratio， SNR)高低，越重要的比特对应的是视频数据中的关键信息，因为有更可靠的信道编码方式，不论信道质量是否好，均可以很好的恢复出这部分信息。不重要的比特是人眼不敏感的信息，当信道质量较好、SNR较高时，接收端可以较高质量地恢复出这部分信息，增加图像质量。当信道质量较差、SNR较低时，接收端若恢复不出这部分信息，也不会太大的影响图像质量。因此，对越重要的第一比特序列采用越可靠的信道编码方式，可以增强视频数据自适应信道的能力，避免信道资源的浪费，简化实现的复杂度。另外，视频数据在进行传输时，若视频速率与信道容量不匹配，信道噪声比预测值大时，重建视频时失真将非常大，信道噪声比预测值小时，重建视频时的失真也不会降低，这种现象可以称为悬崖效应。该可选的方法，由于视频数据有较强的适应信道的能力，因此，可以避免悬崖效应，减少重传和反馈所需要的时延，为视频低时延传输要求提供了保证。
示例性的，若N＝3，3层第一比特序列按照重要性由高至低的顺序依次为11111111、00110111、01001000，3层第一比特序列对应的编码码率依次为1/2、4/7、2/3，参见表1，3层第二比特序列依次为1111111110101100、00110111101000、001101111100，经过比特剪切得到的3层第三比特序列依次为10101100、101000、1100。
表1
Figure PCTCN2020096388-appb-000001
可选的，N层第一比特序列的编码信息采用的编码码率比N层第一比特序列中的任意一层第一比特序列采用的编码码率更低，和/或，N层第一比特序列的编码信息采用的编码码长比N层第一比特序列中的任意一层第一比特序列采用的编码码长更长。该可选的方法可以保证接收端正确解码N层第一比特序列的编码信息，从而保证较好的还原原始信息。当然，N层第一比特序列的编码信息采用的编码码率和/或编码码长也可以与某个第一比特序列相同或与任意一个第一比特序列不同，只要信道编码方式的可靠性比较高，保证接收端可以正确解码即可。
步骤303在具体实现时可以通过以下方式2.1至方式2.3中的任意一种方式实现。
方式2.1
第二处理包括比特拼接和星座调制，该情况下，步骤303在具体实现时包括步骤303-1a和步骤303-1b：
303-1a、发送端对N层第三比特序列进行比特拼接得到一层第四比特序列。
步骤303-1a在具体实现时，N层第三比特序列可以按照重要性由高至低或由低至高的顺序依次拼接。需要说明的是，N层第三比特序列中的对应重要性越高的第一比特序列的第三比特序列越重要。例如，参见上述表1，若3层第一比特序列的重要性由高至低依次为：第1层第一比特序列、第2层第一比特序列、第3层第一比特序列，则3层第三比特序列的重要性由高至低依次为：第1层第三比特序列、第2层第三比特序列、第3层第三比特序列。
另外，在一个第三比特序列中，越靠前的比特越重要。
示例性的，参见表1，若3层第一比特序列的重要性由高至低依次为：第1层第一比 特序列、第2层第一比特序列、第3层第一比特序列，发送端按照重要性由高至低的顺序对N层第三比特序列进行比特拼接得到的第四比特序列为：101011001010001100。
303-1b、发送端对第四比特序列进行星座调制得到第二信息。
可选的，第四比特序列中的越重要的比特在进行星座调制时映射到星座符号的越高位。由于星座符号的越高位的能量越高，因此，该可选的方法可以提高接收端解码更重要的信息的概率，从而保证重要数据的传输可靠性，同时可以提升数据自适应信道的能力。示例性的，假设第四比特序列为1010110010100011，其中共有16个比特，若采用256QAM进行星座调制，则可以将该第四比特序列映射到2个星座符号上。其中，奇数位的比特可以映射到第1个星座符号上，偶数位的比特可以映射到第2个星座符号上。若第四比特序列中的比特个数不够映射到整数个的星座符号上(即第四比特序列中的比特个数不是星座符号中包含的比特个数的整数倍)，发送端可以对该第四比特序列进行补0，使得补0之后的第四比特序列中的比特个数能够映射到整数个的星座符号上，将补0之后的第四比特序列映射到星座符号上。相应的，接收端在进行处理时，在星座解调之后的软信息中将补的0对应的对数似然比去掉即可。
在接收端，与步骤303对应的步骤为步骤307，在方式2.1下，第三处理包括星座解调和软信息拆分，该情况下，步骤307在具体实现时可以包括步骤307-1a和步骤307-1b：
307-1a、接收端对第二信息进行星座解调得到第三软信息，第三软信息为第四比特序列中的每个比特对应的对数似然比，第四比特序列由发送端对N层第三比特序列进行比特拼接得到，N层第三比特序列为第一信息。
307-1b、接收端对第三软信息进行软信息拆分得到第一软信息，第一软信息中包括N层软信息，一层软信息为N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
接收端在进行软信息拆分时，需要知道N的值以及每个第三比特序列中包含的比特个数。N的值以及每个第三比特序列中包含的比特个数可以是发送端发送给接收端的，也可以是预配置或预定义在接收端中的，还可以部分是发送端发送给接收端，部分是预配置或预定义在接收端中的。其中，每个第三比特序列中包含的比特个数还可以是接收端根据每个第一比特序列中的比特个数、每个第一比特序列的编码码率或编码码长、每个第一比特序列剪切掉的比特个数中的一个或多个确定。其中，每个第一比特序列中的比特个数、每个第一比特序列的编码码率或编码码长、每个第一比特序列剪切掉的比特个数等信息可以是发送端发送给接收端的，也可以是预配置或预定义在接收端中的，还可以部分是发送端发送给接收端，部分是预配置或预定义在接收端中的。
其中，在方式2.1下，若步骤302采用方式1.1实现，发送端和接收端的数据处理过程可参见图6。若步骤302采用方式1.2实现，发送端和接收端的数据处理过程可参见图7。
方式2.2
第二处理包括比特拼接、星座调制和星座符号拼接，该情况下，步骤303在具体实现时包括步骤303-2a至步骤303-2c：
303-2a、发送端对N层第三比特序列进行比特拼接得到M层第四比特序列，M层第四比特序列中的第m层第四比特序列包含：N层第三比特序列中的包含第m个比特的全部第三比特序列中的第m个比特，M为大于1的整数，m为大于0小于等于M的整数。
其中，第m层第四比特序列中的越高位的比特属于越重要的第三比特序列。
可以理解的是，M的值为N层第三比特序列中的包含的比特最多的第三比特序列中的比特的个数。示例性的，基于表1所示的示例，M的值为8。基于表1所示的示例，根据3层第三比特序列进行比特拼接后得到的8层第四比特序列可参见表2。
表2
Figure PCTCN2020096388-appb-000002
303-2b、发送端对M层第四比特序列分别进行星座调制得到M层星座符号序列。
可选的，M层第四比特序列中的越重要的第四比特序列采用调制阶数越低的调制方式，或者，M层第四比特序列中的等级越高的第四比特序列采用调制阶数越低的调制方式，等级越高的第四比特序列越重要，一个等级中包括一个或多个第四比特序列。该可选的方法，可以使得越重要的信息采用越可靠的星座调制方式，提高接收端正确解调重要信息的概率，提高数据传输的可靠性。
示例性的，基于表2所示的示例，一种可能的实现方式，第1层至第8层第四比特序列采用的调制阶数依次降低。另一种可能的实现方式，第1层至第4层第四比特序列可以为第一等级，第5层和第6层第四比特序列可以为第二等级，第7层和第8层第四比特序列可以为第三等级，相同等级的第四比特序列采用的调制阶数相同，第一等级、第二等级、第三等级的第四比特序列采用的调制阶数依次降低。
需要说明的是，若第四比特序列中的比特个数不够映射到整数个星座符号上，发送端可以对该第四比特序列进行补0，使得补0之后的第四比特序列中的比特个数能够映射到整数个星座符号上，将补0之后的第四比特序列映射到星座符号上。相应的，接收端在进行处理时，在星座解调之后的软信息中将补的0对应的对数似然比去掉即可。
通过步骤303-2a和303-2b，可以使得越重要的第三比特序列映射到星座符号的越高位。由于星座符号的越高位的能量越高，因此，该方法可以提高接收端解码更重要的信息的概率，从而保证重要数据的传输可靠性，同时可以提升数据自适应信道的能力。
303-2c、发送端对M层星座符号序列进行星座符号拼接得到第二信息。
步骤303-2c在具体实现时，M层星座符号序列可以按照第1层至第M层星座符号序列的顺序依次拼接，也可以按照第M层星座符号序列至第1层星座符号序列的顺序依次拼接，本申请实施例对此不作具体限定。
在方式2.2下，相应的，第三处理包括星座符号拆分、星座解调和软信息拆分，该情况下，步骤307在具体实现时可以包括步骤307-2a和步骤307-2c：
307-2a、接收端对第二信息进行星座符号拆分得到M层星座符号序列。
307-2b、接收端对M层星座符号序列分别进行星座解调得到M层第三软信息，M层第三软信息分别为M层第四比特序列中的比特对应的对数似然比。
307-2c、接收端对M层第三软信息进行软信息拆分得到第一软信息，第一软信息中包括N层软信息，一层软信息为N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
接收端在进行星座符号拆分时，需要知道M的值以及每个星座符号序列中包含的星座符号的个数，接收端在进行软信息拆分时，需要知道发送端的比特拼接方式。M的值、每个星座符号序列中包含的星座符号的个数以及发送端的比特拼接方式等信息可以是发送端发送给接收端的，也可以是预配置或预定义在接收端中的，还可以部分是发送端发送给接收端，部分是预配置或预定义在接收端中的。
其中，在方式2.2下，若步骤302采用方式1.1实现，发送端和接收端的数据处理过程可参见图8。若步骤302采用方式1.2实现，发送端和接收端的数据处理过程可参见图9。
方式2.3
第二处理包括星座调制和星座符号拼接，该情况下，步骤303在具体实现时包括：
303-3a、发送端对N层第三比特序列分别进行星座调制得到N层星座符号序列。
需要说明的是，若第三比特序列中的比特个数不够映射到整数个星座符号上，发送端可以对该第三比特序列进行补0，使得补0之后的第三比特序列中的比特个数能够映射到整数个星座符号上，将补0之后的第三比特序列映射到星座符号上。相应的，接收端在进行处理时，在星座解调之后的软信息中将补的0对应的对数似然比去掉即可。
可选的，N层第三比特序列中的越重要的第三比特序列采用调制阶数越低的调制方式，或者，N层第三比特序列中的等级越高的第三比特序列采用调制阶数越低的调制方式，等级越高的第三比特序列越重要，一个等级中包括一个或多个第三比特序列。该可选的方法，可以使得越重要的信息采用越可靠的星座调制方式，提高接收端正确解调重要信息的概率，提高数据传输的可靠性。
示例性的，基于表1所示的示例，一种可能的实现方式，第1层至第3层第三比特序列采用的调制阶数依次降低。另一种可能的实现方式，第1层第三比特序列可以为第一等级，第2层和第3层第三比特序列可以为第二等级，相同等级的第三比特序列采用的调制阶数相同，第一等级和第二等级的第三比特序列采用的调制阶数依次降低。
可选的，N层第三比特序列中的每层第三比特序列中的越重要的比特映射到对应的星座符号序列中的星座符号的越高位。由于星座符号的越高位的能量越高，因此，该可选的方法可以提高接收端解码更重要的信息的概率，从而保证重要数据的传输可靠性，同时可以提升数据自适应信道的能力。
303-3b、发送端对N层星座符号序列进行星座符号拼接得到第二信息。
步骤303-3b在具体实现时，N层星座符号序列可以按照第1层至第N层星座符号序列的顺序依次拼接，也可以按照第N层星座符号序列至第1层星座符号序列的顺序依次拼接，本申请实施例对此不作具体限定。
在方式2.3下，相应的，第三处理包括星座符号拆分和星座解调，该情况下，步骤307在具体实现时可以包括步骤307-3a和步骤307-3b：
307-3a、接收端对第二信息进行星座符号拆分得到N层星座符号序列。
307-3b、接收端对N层星座符号序列分别进行星座解调得到第一软信息，第一软信息中包括N层软信息，一层软信息为N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
接收端在进行星座符号拆分时，需要知道N的值以及每个星座符号序列中的星座符号个数，接收端在进行星座解调时，需要知道每个第三比特序列的调制阶数。N的值、每个星座符号序列中的星座符号个数，以及每个第三比特序列的调制阶数等信息可以是发送端发送给接收端的，也可以是预配置或预定义在接收端中的，还可以部分是发送端发送给接收端，部分是预配置或预定义在接收端中的。
其中，在方式2.3下，若步骤302采用方式1.1实现，发送端和接收端的数据处理过程可参见图10。若步骤302采用方式1.2实现，发送端和接收端的数据处理过程可参见图11。
步骤309在具体实现时可以通过以下方式3.1或方式3.2实现。
方式3.1、软重建
接收端可以通过置信传输方法(以编码信息中的N层第一比特序列中的0或1的占比作为初始迭代值)进行信道解码得到每层第一比特序列中的每个比特为0或1的概率，根据此概率做信息合并恢复出原始信息，原始信息为一个或多个整数。
其中，原始信息中的一个值为
Figure PCTCN2020096388-appb-000003
其中，I表示该值进行二进制转换时的位数。p i(b)表示该值对应的第一比特序列中的第i个比特为b(b＝0或1)的概率。
方式3.2、硬重建(具体可以通过硬判决实现)
接收端可根据每层第一比特序列中的每个比特为0或1的概率硬判决得到原始信息中的每个比特的值。该情况下，原始信息为一个或多个比特序列。
可选的，为了提高系统的鲁棒性和画面质量，发送端可以利用信道的频选特性和空间传播特性将星座调制之后的星座符号映射到不同的频域资源(例如，资源块(resource block，RB))和空域资源(例如，天线端口)上去。示例性的，可以将相对重要的星座符号映射到信道增益较大的子载波或天线端口上。
目前，常见的视频数据处理方法包括以下4种。其中，第一种和第二种为数模混合进行视频数据处理的方法，第三种和第四种为纯数字的视频数据处理的方法。
第一种：软播(SoftCast)
SoftCast的处理过程包括：将图片进行DCT变换、功率分配、白化、资源映射发送出去，接收端对接收到的信号进行线性的最小均方估计(linear least square estimate，LLSE)解码、DCT逆变换得到图片。
SoftCast由于没有使用信道编码，信息直接在信道上传，受噪声的影响很大，尤其是在低SNR的时候，接收的信号会很差，视频的视觉质量无法满足实际需求。本申请实施例提供的方法通过对N层第一比特序列进行信道编码从而使得信号在信道上可靠的传输。
第二种：Amimon’s联合信源信道编码(joint source and channel coding，JSCC)
Amimon’s JSCC的处理过程包括：将图片进行分层，得到粗信息层和精细信息层，针对精细的信息层，直接进行星座调制、资源映射，并将映射到传输资源上的信号发送出去。
Amimon’s JSCC中的精细信息层由于没有使用信道编码，信息直接在信道上传，受噪声的影响很大，尤其是在低SNR的时候，接收的信号会很差，视频的视觉质量无法满足实际需求。本申请实施例提供的方法通过对N层第一比特序列进行信道编码从而使得信号在信道上可靠的传输，并且本申请提供的方法可以使得数据具有较强的自适应信道的能力。
第三种：高级电视系统委员会(advanced television systems committee，ATSC)的层分复用(layered division multiplexing，LDM)和可扩展的高效视频编码(scalable high-efficiency video coding，SHVC)，可以简称为ATSC’s LDM & SHVC。
ATSC’s LDM & SHVC的处理过程包括：根据采样点将图片进行分层(分为基础层和增强层)，并对每层进行信道编码和星座调制，将星座调制后的信息进行整合，并映射在传输资源上发送。
本申请实施例提供的方法通过对N层第一比特序列进行信道编码后得到的N层第二比特序列进行比特剪切，从而减少发送端传输的比特，提高数据传输效率。另外，ATSC’s LDM&SHVC中只将图片分为两层，适应信道的能力十分有限，而本申请通过将原始信息按照重要性分为3层、4层甚至更多层，提高视频数据自适应信道的能力。
第四种：柔性播(FlexCast)
FlexCast的处理过程包括：将图片进行DCT变换、二进制转换、无速率编码、资源映射发送出去。
FlexCast中当SNR变化范围较大时(例如，超过7个dB)，发送端需要根据接收端反馈的SNR等信道状态信息调整调制阶数，提高了发送端的实现复杂度。本申请实施例提供的方法中，数据可以自适应信道，不需要根据接收端反馈的SNR等信道状态信息调整调制阶数，相比FlexCast降低了发送端的实现复杂度。
上述主要从各个网元之间交互的角度对本申请实施例的方案进行了介绍。可以理解的是，各个网元，例如，发送端装置和接收端装置为了实现上述功能，其包含了执行各个功能相应的硬件结构和/或软件模块。本领域技术人员应该很容易意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，本申请能够以硬件或硬件和计算机软件的结合形式来实现。某个功能究竟以硬件还是计算机软件驱动硬件的方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
本申请实施例可以根据上述方法示例对发送端装置和接收端装置进行功能单元的划分，例如，可以对应各个功能划分各个功能单元，也可以将两个或两个以上的功能集成在一个处理单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。需要说明的是，本申请实施例中对单元的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。
图12示出了上述实施例中所涉及的发送端装置(记为发送端装置120)的一种可能的结构示意图，该发送端装置120包括处理单元1201和发送单元1202，还可以包括存储单元1203。
其中，处理单元1201用于对发送端装置的动作进行控制管理，例如，处理单元1201用于支持发送端装置执行图3中的步骤301至步骤305，和/或本申请实施例中所描述的其他过程中的发送端装置执行的动作。处理单元1201可以通过发送单元1202与其他网络实 体通信，例如，与图3中示出的接收端之间通信。存储单元1203用于存储发送端装置的程序代码和数据。其中，发送端装置可以是设备，也可以是设备内的芯片。
发送端装置120中的具有发送功能的天线和控制电路可以视为发送端装置120的发送单元1202，具有处理功能的处理器可以视为发送端装置120的处理单元1201。发送单元1202可以为发送机、发送器、发送电路等。
图12中的集成的单元如果以软件功能模块的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请实施例的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)或处理器(processor)执行本申请各个实施例所述方法的全部或部分步骤。存储计算机软件产品的存储介质包括：U盘、移动硬盘、只读存储器(read-only memory，ROM)、随机存取存储器(random access memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
图12中的单元也可以称为模块，例如，处理单元可以称为处理模块。
另外，图13示出了上述实施例中所涉及的发送端装置(记为发送端装置130)的另一种可能的结构示意图。参见图13，发送端装置130包括处理器1301，可选的，还包括与处理器1301连接的存储器1302和/或发射器1303。处理器1301、存储器1302和发射器1303通过总线相连接。
处理器1301可以是一个通用中央处理器(central processing unit，CPU)、微处理器、特定应用集成电路(application-specific integrated circuit，ASIC)，或者一个或多个用于控制本申请方案程序执行的集成电路。处理器1301也可以包括多个CPU，并且处理器1301可以是一个单核(single-CPU)处理器，也可以是多核(multi-CPU)处理器。这里的处理器可以指一个或多个设备、电路或用于处理数据(例如计算机程序指令)的处理核。
存储器1302可以是ROM或可存储静态信息和指令的其他类型的静态存储设备、RAM或者可存储信息和指令的其他类型的动态存储设备，也可以是电可擦可编程只读存储器(electrically erasable programmable read-only memory，EEPROM)、只读光盘(compact disc read-only memory，CD-ROM)或其他光盘存储、光碟存储(包括压缩光碟、激光碟、光碟、数字通用光碟、蓝光光碟等)、磁盘存储介质或者其他磁存储设备、或者能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，本申请实施例对此不作任何限制。存储器1302可以是独立存在，也可以和处理器1301集成在一起。其中，存储器1302中可以包含计算机程序代码。
处理器1301用于执行存储器1302中存储的计算机程序代码，从而实现本申请实施例提供的方法。例如，处理器1301用于支持发送端装置执行图3中的步骤301至步骤305，和/或本申请实施例中所描述的其他过程中的发送端装置执行的动作。处理器1301可以通过发射器1303与其他网络实体通信，例如，与图3中示出的接收端之间通信。存储器1302用于存储发送端装置的程序代码和数据。
图14示出了上述实施例中所涉及的发送端装置(记为发送端装置140)的另一种可能的结构示意图。
参见图14，发送端装置140包括逻辑电路1401和输出接口1402。逻辑电路1401用 于对发送端装置的动作进行控制管理，例如，逻辑电路1401用于支持发送端装置执行图3中的步骤301至步骤305，和/或本申请实施例中所描述的其他过程中的发送端装置执行的动作。逻辑电路1401可以通过输出接口与其他网络实体通信，例如，与图3中示出的接收端之间通信。
图15示出了上述实施例中所涉及的接收端装置(记为接收端装置150)的一种可能的结构示意图，该接收端装置150包括处理单元1501和接收单元1502，还可以包括存储单元1503。
其中，处理单元1501用于对接收端装置的动作进行控制管理，例如，处理单元1501用于支持接收端装置执行图3中的步骤305至步骤309，和/或本申请实施例中所描述的其他过程中的接收端装置执行的动作。处理单元1501可以通过接收单元1502与其他网络实体通信，例如，与图3中示出的发送端之间通信。存储单元1503用于存储接收端装置的程序代码和数据。其中，接收端装置可以是设备，也可以是设备内的芯片。
接收端装置150中的具有接收功能的天线和控制电路可以视为接收端装置150的接收单元1502，具有处理功能的处理器可以视为接收端装置150的处理单元1501。接收单元1502可以为接收机、接收器、接收电路等。
图15中的集成的单元如果以软件功能模块的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请实施例的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)或处理器(processor)执行本申请各个实施例所述方法的全部或部分步骤。存储计算机软件产品的存储介质包括：U盘、移动硬盘、只读存储器(read-only memory，ROM)、随机存取存储器(random access memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
图15中的单元也可以称为模块，例如，处理单元可以称为处理模块。
另外，图16示出了上述实施例中所涉及的接收端装置(记为接收端装置160)的另一种可能的结构示意图。
参见图16，接收端装置160包括处理器1601，可选的，还包括与处理器1601连接的存储器1602和/或接收器1603。处理器1601、存储器1602和接收器1603通过总线相连接。
关于处理器1601的描述可参见上述关于处理器1301的描述，在此不再赘述。
关于存储器1602的描述可参见上述关于存储器1302的描述，在此不再赘述。
处理器1601用于执行存储器1602中存储的计算机程序代码，从而实现本申请实施例提供的方法。例如，处理器1601用于支持接收端装置执行图3中的步骤305至步骤309，和/或本申请实施例中所描述的其他过程中的接收端装置执行的动作。处理器1601可以通过接收器1603与其他网络实体通信，例如，与图3中示出的发送端之间通信。存储器1602用于存储接收端装置的程序代码和数据。
图17示出了上述实施例中所涉及的接收端装置(记为接收端装置170)的另一种可能的结构示意图。参见图17，接收端装置170包括逻辑电路1701和输入接口1702。逻辑电路1701用于对接收端装置的动作进行控制管理，例如，逻辑电路1701用于支持接收端装置执行图3中的步骤305至步骤309，和/或本申请实施例中所描述的其他过程中的接收端 装置执行的动作。逻辑电路1701可以通过输入接口与其他网络实体通信，例如，与图3中示出的发送端之间通信。
本申请实施例还提供了一种计算机可读存储介质，包括指令，当该指令在计算机上运行时，使得计算机执行上述任一方法。
本申请实施例还提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述任一方法。
本申请实施例还提供了一种通信系统，包括：上述发送端和接收端。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件程序实现时，可以全部或部分地以计算机程序产品的形式来实现。该计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行计算机程序指令时，全部或部分地产生按照本申请实施例所述的流程或功能。计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，计算机指令可以从一个网站站点、计算机、服务器或者数据中心通过有线(例如同轴电缆、光纤、数字用户线(digital subscriber line，DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可以用介质集成的服务器、数据中心等数据存储设备。可用介质可以是磁性介质(例如，软盘、硬盘、磁带)，光介质(例如，DVD)、或者半导体介质(例如固态硬盘(solid state disk，SSD))等。
尽管在此结合各实施例对本申请进行了描述，然而，在实施所要求保护的本申请过程中，本领域技术人员通过查看附图、公开内容、以及所附权利要求书，可理解并实现公开实施例的其他变化。在权利要求中，“包括”(comprising)一词不排除其他组成部分或步骤，“一”或“一个”不排除多个的情况。单个处理器或其他单元可以实现权利要求中列举的若干项功能。相互不同的从属权利要求中记载了某些措施，但这并不表示这些措施不能组合起来产生良好的效果。
尽管结合具体特征及其实施例对本申请进行了描述，显而易见的，在不脱离本申请的精神和范围的情况下，可对其进行各种修改和组合。相应地，本说明书和附图仅仅是所附权利要求所界定的本申请的示例性说明，且视为已覆盖本申请范围内的任意和所有修改、变化、组合或等同物。显然，本领域的技术人员可以对本申请进行各种改动和变型而不脱离本申请的精神和范围。这样，倘若本申请的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。

Claims (28)

  1. 一种数据处理方法，其特征在于，包括：
    发送端将原始信息进行分层得到N层第一比特序列，所述原始信息为至少一个比特序列或至少一个整数，N为大于1的整数；
    所述发送端对所述N层第一比特序列进行第一处理得到第一信息，所述第一信息不包括所述N层第一比特序列中的全部比特或所述第一信息包括所述N层第一比特序列中的部分比特；
    所述发送端对所述第一信息进行第二处理得到第二信息；
    所述发送端对所述N层第一比特序列的编码信息进行信道编码和星座调制得到第三信息，所述编码信息用于指示所述N层第一比特序列中的每层第一比特序列中的0或1的占比信息；
    所述发送端向接收端发送所述第二信息和所述第三信息。
  2. 根据权利要求1所述的方法，其特征在于，所述发送端将原始信息进行分层得到N层第一比特序列，包括：
    所述发送端按照所述原始信息中的信息的重要性由高至低或由低至高的顺序将所述原始信息进行分层得到所述N层第一比特序列。
  3. 根据权利要求1或2所述的方法，其特征在于，所述第一处理包括信道编码和比特剪切，所述发送端对所述N层第一比特序列进行第一处理得到第一信息，包括：
    所述发送端对所述N层第一比特序列中的第n层第一比特序列进行信道编码得到第n层第二比特序列，n＝1，2，…，N；
    所述发送端对所述第n层第二比特序列进行比特剪切得到第n层第三比特序列；其中，所述第n层第三比特序列为所述第n层第二比特序列中的除所述第n层第一比特序列中的部分或全部比特之外的部分。
  4. 根据权利要求1或2所述的方法，其特征在于，所述第一处理为无速率编码，所述发送端对所述N层第一比特序列进行第一处理得到第一信息，包括：
    所述发送端对所述N层第一比特序列中的第n层第一比特序列进行无速率编码得到第n层第三比特序列，n＝1，2，…，N。
  5. 根据权利要求3或4所述的方法，其特征在于，所述N层第一比特序列中的越重要的第一比特序列采用编码码率越低和/或编码码长越长的信道编码方式。
  6. 根据权利要求3-5任一项所述的方法，其特征在于，所述第二处理包括比特拼接和星座调制，所述发送端对所述第一信息进行第二处理得到第二信息，包括：
    所述发送端对N层第三比特序列进行比特拼接得到一层第四比特序列；
    所述发送端对所述第四比特序列进行星座调制得到所述第二信息。
  7. 根据权利要求6所述的方法，其特征在于，所述第四比特序列中的越重要的比特在进行星座调制时映射到星座符号的越高位。
  8. 根据权利要求3-5任一项所述的方法，其特征在于，所述第二处理包括比特拼接、星座调制和星座符号拼接，所述发送端对所述第一信息进行第二处理得到第二信息，包括：
    所述发送端对N层第三比特序列进行比特拼接得到M层第四比特序列，所述M层第四比特序列中的第m层第四比特序列包含：所述N层第三比特序列中的包含第m个比特 的全部第三比特序列中的第m个比特，M为大于1的整数，m为大于0小于等于M的整数；
    所述发送端对所述M层第四比特序列分别进行星座调制得到M层星座符号序列；
    所述发送端对所述M层星座符号序列进行星座符号拼接得到所述第二信息。
  9. 根据权利要求8所述的方法，其特征在于，所述M层第四比特序列中的越重要的第四比特序列采用调制阶数越低的调制方式。
  10. 根据权利要求3-5任一项所述的方法，其特征在于，所述第二处理包括星座调制和星座符号拼接，所述发送端对所述第一信息进行第二处理得到第二信息，包括：
    所述发送端对N层第三比特序列分别进行星座调制得到N层星座符号序列；
    所述发送端对所述N层星座符号序列进行星座符号拼接得到所述第二信息。
  11. 根据权利要求10所述的方法，其特征在于，所述N层第三比特序列中的越重要的第三比特序列采用调制阶数越低的调制方式。
  12. 根据权利要求10或11所述的方法，其特征在于，所述N层第三比特序列中的每层第三比特序列中的越重要的比特映射到对应的星座符号序列中的星座符号的越高位。
  13. 一种数据处理方法，其特征在于，包括：
    接收端从发送端接收第二信息和第三信息，所述第二信息由所述发送端对第一信息进行第二处理得到；所述第一信息由所述发送端对N层第一比特序列进行第一处理得到，所述第一信息不包括所述N层第一比特序列中的全部比特或所述第一信息包括所述N层第一比特序列中的部分比特；所述N层第一比特序列由所述发送端对原始信息进行分层得到，所述原始信息为至少一个比特序列或至少一个整数；所述第三信息由所述发送端对所述N层第一比特序列的编码信息进行信道编码和星座调制得到，所述编码信息用于指示所述N层第一比特序列中的每层第一比特序列中的0或1的占比信息，N为大于1的整数；
    所述接收端对所述第三信息进行星座解调和信道解码得到还原后的所述编码信息；
    所述接收端对所述第二信息进行第三处理得到第一软信息，所述第一软信息为所述第一信息中的每个比特对应的对数似然比；
    所述接收端根据所述编码信息对所述第一软信息进行第四处理得到第二软信息，所述第二软信息为所述N层第一比特序列中每层第一比特序列中的比特对应的对数似然比；
    所述接收端对所述第二软信息进行重建得到还原后的所述原始信息。
  14. 根据权利要求13所述的方法，其特征在于，所述第三处理包括星座解调和软信息拆分，所述接收端对所述第二信息进行第三处理得到第一软信息，包括：
    所述接收端对所述第二信息进行星座解调得到第三软信息，所述第三软信息为第四比特序列中的每个比特对应的对数似然比，所述第四比特序列由所述发送端对N层第三比特序列进行比特拼接得到，所述N层第三比特序列为所述第一信息；
    所述接收端对所述第三软信息进行软信息拆分得到所述第一软信息，所述第一软信息中包括N层软信息，一层软信息为所述N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
  15. 根据权利要求13所述的方法，其特征在于，所述第三处理包括星座符号拆分、星座解调和软信息拆分，所述接收端对所述第二信息进行第三处理得到第一软信息，包括：
    所述接收端对所述第二信息进行星座符号拆分得到M层星座符号序列，所述M层星 座符号序列由所述发送端对M层第四比特序列分别进行星座调制得到，所述M层第四比特序列为所述发送端对N层第三比特序列进行比特拼接得到，所述M层第四比特序列中的第m层第四比特序列包含：所述N层第三比特序列中的包含第m个比特的全部第三比特序列中的第m个比特，所述N层第三比特序列为所述第一信息，M为大于1的整数，m为大于0小于等于M的整数；
    所述接收端对所述M层星座符号序列分别进行星座解调得到M层第三软信息，所述M层第三软信息分别为所述M层第四比特序列中的比特对应的对数似然比；
    所述接收端对所述M层第三软信息进行软信息拆分得到第一软信息，所述第一软信息中包括N层软信息，一层软信息为所述N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
  16. 根据权利要求13所述的方法，其特征在于，所述第三处理包括星座符号拆分和星座解调，所述接收端对所述第二信息进行第三处理得到第一软信息，包括：
    所述接收端对所述第二信息进行星座符号拆分得到N层星座符号序列，所述N层星座符号序列由发送端对N层第三比特序列分别进行星座调制得到，所述N层第三比特序列为所述第一信息；
    所述接收端对所述N层星座符号序列分别进行星座解调得到第一软信息，所述第一软信息中包括N层软信息，一层软信息为所述N层第三比特序列中的一层第三比特序列中的比特对应的对数似然比。
  17. 根据权利要求14-16任一项所述的方法，其特征在于，所述第四处理包括软信息拼接和信道解码，所述接收端根据所述编码信息对所述第一软信息进行第四处理得到第二软信息，包括：
    所述接收端根据所述编码信息进行软信息计算得到N层第一比特序列中的第n层第一比特序列中的在比特剪切过程中剪切掉的比特依次对应的对数似然比，n＝1，2，…，N；
    所述接收端将所述第n层第一比特序列中的在比特剪切过程中剪切掉的比特依次对应的对数似然比与所述第一软信息中的第n层软信息中的对数似然比进行软信息拼接得到所述第n层第二比特序列对应的软信息序列，所述第n层第二比特序列对应的软信息序列包括所述第n层第二比特序列中的比特依次对应的对数似然比，所述第n层软信息中的对数似然比为所述N层第三比特序列中的第n层第三比特序列中的比特对应的对数似然比，所述第n层第三比特序列由所述发送端对所述第n层第二比特序列进行所述比特剪切得到，所述第n层第二比特序列由所述发送端对所述N层第一比特序列中的第n层第一比特序列进行信道编码得到，所述第n层第三比特序列为所述第n层第二比特序列中的除所述第n层第一比特序列中的部分或全部比特之外的部分；
    所述接收端将N层第二比特序列中的每层第二比特序列对应的软信息序列进行信道解码得到第二软信息，所述第二软信息中包括所述N层第一比特序列中的每层第一比特序列中的比特对应的对数似然比。
  18. 根据权利要求14-16任一项所述的方法，其特征在于，所述第四处理为无速率解码，所述接收端根据所述编码信息对所述第一软信息进行第四处理得到第二软信息，包括：
    所述接收端根据所述编码信息进行软信息计算得到N层第一比特序列中的第n层第一比特序列中的比特依次对应的对数似然比，n＝1，2，…，N；
    所述接收端根据通过软信息计算得到的N层第一比特序列中的每层第一比特序列中的比特依次对应的对数似然比对所述第一软信息进行无速率解码得到第二软信息，所述第二软信息中包括所述N层第一比特序列中的每层第一比特序列中的比特对应的对数似然比。
  19. 一种发送端装置，其特征在于，包括：用于实现如权利要求1-12任一项所述的方法的单元。
  20. 一种接收端装置，其特征在于，包括：用于实现如权利要求13-18任一项所述的方法的单元。
  21. 一种发送端装置，其特征在于，包括：处理器；
    所述处理器被耦合到存储器，所述存储器用于存储计算机执行指令，所述处理器执行所述存储器存储的所述计算机执行指令，以使所述装置实现如权利要求1-12任一项所述的方法。
  22. 根据权利要求21所述的发送端装置，其特征在于，所述存储器位于所述发送端装置内部。
  23. 根据权利要求21所述的发送端装置，其特征在于，所述存储器位于所述发送端装置外部。
  24. 一种接收端装置，其特征在于，包括：处理器；
    所述处理器被耦合到存储器，所述存储器用于存储计算机执行指令，所述处理器执行所述存储器存储的所述计算机执行指令，以使所述装置实现如权利要求13-18任一项所述的方法。
  25. 根据权利要求24所述的接收端装置，其特征在于，所述存储器位于所述接收端装置内部。
  26. 根据权利要求24所述的接收端装置，其特征在于，所述存储器位于所述接收端装置外部。
  27. 一种计算机可读存储介质，其特征在于，包括指令，当所述指令在计算机上运行时，使得计算机执行如权利要求1-12任一项所述的方法，或者，使得计算机执行如权利要求13-18任一项所述的方法。
  28. 一种计算机程序产品，其特征在于，包括指令，当该指令在计算机上运行时，使得计算机执行如权利要求1-12任一项所述的方法，或者，使得计算机执行如权利要求13-18任一项所述的方法。
PCT/CN2020/096388 2019-07-10 2020-06-16 数据处理方法及装置 WO2021004239A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US17/572,302 US20220329348A1 (en) 2019-07-10 2022-01-10 Data processing method and device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910622112.3A CN112217598B (zh) 2019-07-10 2019-07-10 数据处理方法及装置
CN201910622112.3 2019-07-10

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/572,302 Continuation US20220329348A1 (en) 2019-07-10 2022-01-10 Data processing method and device

Publications (1)

Publication Number Publication Date
WO2021004239A1 true WO2021004239A1 (zh) 2021-01-14

Family

ID=74047640

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/096388 WO2021004239A1 (zh) 2019-07-10 2020-06-16 数据处理方法及装置

Country Status (3)

Country Link
US (1) US20220329348A1 (zh)
CN (1) CN112217598B (zh)
WO (1) WO2021004239A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113141232B (zh) * 2021-02-02 2021-11-26 中南民族大学 基于16QAM调制的无速率IoT上行传输系统及方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080170640A1 (en) * 2003-08-20 2008-07-17 Thomson Licensing Methods and Apparatus For Hierarchical Modulation Using Radial Constellation
CN102316360A (zh) * 2010-07-09 2012-01-11 华为终端有限公司 视频刷新方法、装置及系统
CN103347202A (zh) * 2013-06-19 2013-10-09 兰州大学 一种无线通信系统中的ewf码译码方法
WO2018029628A1 (en) * 2016-08-12 2018-02-15 Telefonaktiebolaget Lm Ericsson (Publ) Iterative decoding of harq-ir transmissions based on soft output polar code decoders

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020126759A1 (en) * 2001-01-10 2002-09-12 Wen-Hsiao Peng Method and apparatus for providing prediction mode fine granularity scalability
CN100596129C (zh) * 2005-10-13 2010-03-24 北京泰美世纪科技有限公司 一种多载波数字卫星广播系统及其数字信息传输方法
CN100502380C (zh) * 2006-10-20 2009-06-17 北京泰美世纪科技有限公司 多载波数字移动多媒体广播系统及其数字信息传输方法
CN101272224B (zh) * 2008-05-04 2011-11-09 清华大学 全球数字广播系统中的ldpc分层信道编解码实现方法
CN105531942B (zh) * 2013-10-14 2019-12-17 哈曼国际工业有限公司 通信方法和系统

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080170640A1 (en) * 2003-08-20 2008-07-17 Thomson Licensing Methods and Apparatus For Hierarchical Modulation Using Radial Constellation
CN102316360A (zh) * 2010-07-09 2012-01-11 华为终端有限公司 视频刷新方法、装置及系统
CN103347202A (zh) * 2013-06-19 2013-10-09 兰州大学 一种无线通信系统中的ewf码译码方法
WO2018029628A1 (en) * 2016-08-12 2018-02-15 Telefonaktiebolaget Lm Ericsson (Publ) Iterative decoding of harq-ir transmissions based on soft output polar code decoders

Also Published As

Publication number Publication date
CN112217598B (zh) 2022-10-18
CN112217598A (zh) 2021-01-12
US20220329348A1 (en) 2022-10-13

Similar Documents

Publication Publication Date Title
US9509379B2 (en) System and method for designing and using multidimensional constellations
US9020029B2 (en) Arbitrary precision multiple description coding
JP7257406B2 (ja) データ通信処理方法および装置
EP4047846A1 (en) Coding and decoding methods and devices
WO2016090588A1 (zh) 传输数据的方法、发送端设备和接收端设备
CN105409260A (zh) 用于用户设备协作的系统和方法
KR102570656B1 (ko) 신호를 수신하기 위한 방법 및 장치
JP6991127B2 (ja) 受信装置および受信方法
US20230275687A1 (en) Channel coding method and communication apparatus
WO2022161201A1 (zh) 编码调制与解调解码方法及装置
WO2021004239A1 (zh) 数据处理方法及装置
JP6929852B2 (ja) 受信装置および受信方法
JP6929851B2 (ja) 送信装置、受信装置、送信方法および受信方法
WO2018171748A1 (zh) 一种资源映射方法及其装置
CN112737728B (zh) 数据处理方法及装置
CN106797567B (zh) 数据传输方法和相关设备
WO2017170109A1 (ja) 送信装置、受信装置、送信方法および受信方法
CN114915376B (zh) 译码方法、编码方法、装置、设备和存储介质
US20240073066A1 (en) Devices and methods for a dirty paper coding scheme
WO2023236932A1 (zh) Llr值的量化方法、装置、电子设备及存储介质
WO2023160053A1 (zh) 概率成型的映射方法及概率解成型的接收处理方法
WO2024092415A1 (zh) 一种通信方法及装置
CN117240402A (zh) 一种llr值的量化方法及装置
CN110611525A (zh) 一种基于速率分拆的信号传输、接收方法及装置
JP2020109878A (ja) 送信装置、受信装置、送信方法および受信方法

Legal Events

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

Ref document number: 20836272

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 20836272

Country of ref document: EP

Kind code of ref document: A1