+

WO2018184493A1 - Procédé et dispositif de codage et de décodage de données - Google Patents

Procédé et dispositif de codage et de décodage de données Download PDF

Info

Publication number
WO2018184493A1
WO2018184493A1 PCT/CN2018/080835 CN2018080835W WO2018184493A1 WO 2018184493 A1 WO2018184493 A1 WO 2018184493A1 CN 2018080835 W CN2018080835 W CN 2018080835W WO 2018184493 A1 WO2018184493 A1 WO 2018184493A1
Authority
WO
WIPO (PCT)
Prior art keywords
feature information
decoded
encoded
data block
data
Prior art date
Application number
PCT/CN2018/080835
Other languages
English (en)
Chinese (zh)
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 WO2018184493A1 publication Critical patent/WO2018184493A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/09—Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • H03M13/091—Parallel or block-wise CRC computation
    • 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/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/0057—Block codes
    • 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/0061—Error detection codes

Definitions

  • Embodiments of the present invention relate to the field of electronics and communications technologies and, more particularly, to methods and apparatus for data encoding and decoding.
  • Polar codes algorithm is the first procoding algorithm that theoretically proves that it can achieve Shannon capacity and has low coding and decoding (compilation code complexity is O(NlogN)) complexity.
  • the main broadcast block (English: Master Information Block, abbreviation: MIB) is carried on the physical broadcast channel (English: Physical Broadcast Channel, abbreviation: PBCH).
  • MIB Master Information Block
  • PBCH Physical Broadcast Channel
  • the embodiment of the invention provides a data processing method and device, which can reduce the complexity of recovering feature information (such as timing information) carried in the MIB by the receiving end.
  • an embodiment of the present invention provides a data encoding method, where the method includes:
  • each of the plurality of data blocks to be encoded carries feature information in each of the to-be-coded data blocks, and the feature information is encoded by Polar code.
  • the relationship between the feature information carried by the two adjacent data blocks to be encoded is satisfied: the feature information carried by the data block to be coded is descrambled by the corresponding relative scrambling code sequence, and is carried by the previous data block to be coded. Characteristic information;
  • the multi-segment encoded data blocks are output in the order in which they are adjacent to each other.
  • the feature information is feature information after being scrambled.
  • the feature information carried in the multiple pieces of data blocks to be encoded It is different.
  • the feature information may be timing information, where the timing information indicates that the multi-segment encoded data block is sent. order of.
  • the feature information refers to information related to a sending end of the multiple pieces of data to be encoded, or Refers to information related to the receiving end of the multi-segment data block to be encoded, or refers to information related to the data block to be encoded carrying the feature information, or refers to the sending manner of the data block after the multi-segment encoding relevant information.
  • the data block that is multi-segment encoded is configured according to The sequential output of the preceding and following adjacent, including:
  • the multi-segment encoded data blocks are output in the order in which the timing information is displayed.
  • the multi-segment to-be-coded data block refers to the multi-segment to-be-coded data block that is sent in one transmission period, Moreover, the timing information carried in different data blocks to be encoded is different in one transmission period.
  • the feature information carried in the data block to be encoded adjacent to each other in a transmission period When constructing the relative scrambling code sequence, the constructed relative scrambling code sequence has log 2 N, wherein the N-segment encoded data block is transmitted in one transmission period.
  • the multiple data blocks to be encoded belong to a data block to be encoded in one transmission period, where Before or after the step of multi-segment data block to be encoded by Polar code to obtain the encoded data block, the method further includes:
  • the feature information carried in the multi-segment data block to be encoded is scrambled by using different scrambling code sequences, wherein the feature information carried in the multi-segment data block to be encoded in one transmission period is the same.
  • an embodiment of the present invention further provides a decoding method, where the method includes:
  • the data block to be decoded carries the feature information to be decoded
  • a relative scrambling code sequence is used to participate in descrambling processing, and the obtained descrambling result is decoded and judged.
  • the relative scrambling code sequence is used to participate in descrambling processing, and the obtained descrambling result is decoded and judged.
  • the processing specifically includes: using a relative scrambling code sequence to descramble the feature information to be decoded carried in the data block to be decoded in the subsequent segment, and obtaining the descrambled feature information, and using the descrambled feature information and The feature information to be decoded carried in the data block to be decoded in the previous segment is combined and subjected to decoding processing; and the feature information after the decoding process is determined;
  • the relationship between the feature information carried by the adjacent two blocks of the data block to be decoded is constrained, thereby reducing the complexity of cracking the correct feature information.
  • the feature information may be feature information after being scrambled.
  • the feature information carried in the two data blocks to be decoded is different.
  • a third possible implementation manner if the result of the determination is an error, try other relative scrambling code sequences to participate in the descrambling, The obtained descrambling result is decoded and judged until the judgment result is correct or all relative scrambling code sequences are tried. Among them, the relative scrambling code sequence of each attempt is different.
  • the determining process includes:
  • the decoded feature information After determining that the decoded feature information is correctly verified and belongs to the candidate feature information, it is determined that the decoded feature information is correct feature information.
  • the candidate feature information is: associated with the relative scrambling code sequence participating in the descrambling process Characteristic information.
  • the interference processing is performed by using a relative scrambling code sequence, and the obtained descrambling result is decoded and Before the step of judging the processing, the method further includes:
  • an embodiment of the present invention further provides a decoding method, where the method includes:
  • the data block to be decoded carries the feature information to be decoded
  • the feature information to be decoded carried in the data block to be decoded is descrambled to obtain the descrambled feature information, and the descrambled feature information is used in the data block to be decoded in the previous segment. Carrying the feature information to be decoded and combining the decoding process; and determining the feature information after the decoding process;
  • the feature information judged to be correct is output.
  • the embodiment of the present invention further provides a data processing apparatus, where the data processing apparatus includes:
  • a first encoding module configured to perform a Polar code encoding on a plurality of data blocks to be encoded to obtain a coded data block, where each piece of the data block to be encoded in the plurality of pieces of data to be encoded carries feature information, and the feature information After the Polar code is encoded, the relationship between the feature information carried by the two adjacent data blocks to be encoded is satisfied: the feature information carried by the latter data block to be coded is descrambled by using the corresponding relative scrambling code sequence. Characteristic information carried by a data block to be encoded;
  • the interface module is configured to output the multi-segment encoded data blocks in the order of the adjacent ones.
  • an embodiment of the present invention further provides a data processing apparatus, where the data processing apparatus includes:
  • a receiving module configured to receive two pieces of data blocks to be decoded that are adjacent to each other before and after, and the data block to be decoded carries feature information to be decoded;
  • a first decoding module configured to participate in descrambling processing by using a relative scrambling code sequence, and perform decoding and judging processing on the obtained descrambling result, wherein the relative scrambling code sequence is used to participate in descrambling processing, and the obtained Decoding the decoding result and determining the processing specifically includes: using a relative scrambling code sequence to descramble the feature information to be decoded carried in the data block to be decoded in the subsequent segment, and obtaining the descrambled feature information, Decoding the feature information and combining the feature information to be decoded carried in the data block to be decoded in the previous segment to perform decoding processing; and determining the decoded feature information; When the feature information participating in the judgment is an error, another relative scrambling code sequence is used to participate in the descrambling, and the obtained descrambling result is decoded and judged.
  • the embodiment of the present invention further provides a data processing apparatus, where the data processing apparatus includes:
  • a receiving module configured to receive two pieces of data blocks to be decoded that are adjacent to each other before and after, and the data block to be decoded carries feature information to be decoded;
  • a second decoding module configured to calculate a correlation between the two pieces of information to be decoded carried in the data block to be decoded, and obtain a relative scrambling code sequence that matches the correlation,
  • the relative scrambling code sequence descrambles the feature information to be decoded carried in the data block to be decoded in the subsequent segment to obtain the descrambled feature information, and the descrambled feature information and the previous segment Decoding the feature information to be decoded carried in the data block to be decoded and performing decoding processing; and determining the feature information after the decoding process;
  • the receiving module is further configured to output the feature information determined to be correct if the feature information participating in the determination is correct.
  • an embodiment of the present invention provides a communication device, where the communication device includes: a processor, and a memory interconnected with the processor, when the communication device is running, the processor reads and executes The instructions in the memory or run their own hardware logic to cause the communication device to perform various embodiments of any of the methods described in the first to third aspects.
  • the memory is configured to store the instructions, and the memory may be independent of the processor or integrated in the processor.
  • the communications apparatus may further include a transceiver for receiving and/or transmitting data.
  • Yet another aspect of an embodiment of the present application also provides a computer readable storage medium having stored therein instructions that, when run on a computer, cause the computer to perform the methods described in the above aspects .
  • Yet another aspect of an embodiment of the present application also provides a computer program product comprising instructions that, when executed on a computer, cause the computer to perform the methods described in the various aspects above.
  • FIG. 1 is a schematic diagram of a wireless communication system in an embodiment of the present invention.
  • FIG. 2 is a schematic diagram of a coding process of a Polar code in an embodiment of the invention
  • FIG. 3 is a schematic flowchart of a data encoding method according to an embodiment of the present invention.
  • FIG. 4 is a schematic flow chart of a specific implementation manner of the data encoding method shown in FIG. 3;
  • FIG. 5 is a schematic flowchart diagram of a specific implementation manner of the data encoding method shown in FIG. 3;
  • FIG. 6 is a schematic flowchart of a decoding method according to an embodiment of the present invention.
  • FIG. 7 is a schematic flowchart diagram of another decoding method according to an embodiment of the present invention.
  • FIG. 8 is a schematic flowchart of a specific implementation manner of the data encoding method shown in FIG. 3;
  • FIG. 9 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present invention.
  • FIG. 10 is a schematic structural diagram of another data processing apparatus according to an embodiment of the present invention.
  • FIG. 11 is a schematic structural diagram of still another data processing apparatus according to an embodiment of the present invention.
  • FIG. 12 is a schematic structural diagram of a communication apparatus according to an embodiment of the present invention.
  • GSM Global System of Mobile communication
  • CDMA Code Division Multiple Access
  • WCDMA Wideband Code Division Multiple Access
  • GPRS General Packet Radio Service
  • LTE Long Term Evolution
  • FDD Frequency Division Duplex
  • TDD Time Division Duplex
  • UMTS Universal Mobile Telecommunication System
  • the base station may be a device for communicating with the terminal device, for example, may be a base station (Base Transceiver Station, BTS) in the GSM system or CDMA, or a base station (NodeB, NB) in the WCDMA system, or It is an evolved base station (Evolutional Node B, eNB or eNodeB) in the LTE system, or the base station can be a relay station, an access point, an in-vehicle device, a wearable device, and a network side device in a future 5G network.
  • BTS Base Transceiver Station
  • NodeB NodeB
  • NB evolved base station
  • the base station can be a relay station, an access point, an in-vehicle device, a wearable device, and a network side device in a future 5G network.
  • the terminal may communicate with one or more core networks via a Radio Access Network (RAN), and the terminal may refer to a User Equipment (UE), a terminal, a subscriber unit, a subscriber station, a mobile station, and a mobile station. , remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent or user device.
  • the terminal can be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), and a wireless communication function.
  • FIG. 1 illustrates a wireless communication system 100.
  • System 100 includes a base station 102 that can include multiple antenna groups. For example, one antenna group may include antennas 104 and 106, another antenna group may include antennas 108 and 110, and additional groups may include antennas 112 and 114. Two antennas are shown for each antenna group, however more or fewer antennas may be used for each group.
  • Base station 102 can include a transmitter chain and a receiver chain, as will be understood by those of ordinary skill in the art, which can include various components associated with signal transmission and reception, such as processors, modulators, multiplexers, demodulators, Demultiplexer or antenna.
  • Base station 102 can communicate with one or more terminals, such as terminal 116 and terminal 122. However, it will be appreciated that base station 102 can communicate with any number of terminals similar to terminals 116 and 122.
  • Terminals 116 and 122 can be, for example, cellular telephones, smart phones, portable computers, handheld communication devices, handheld computing devices, satellite radios, global positioning systems, PDAs, and/or any other suitable device for communicating over wireless communication system 100.
  • terminal 116 is in communication with antennas 112 and 114, with antennas 112 and 114 transmitting information to terminal 116 over forward link 118 and receiving information from terminal 116 over reverse link 120.
  • terminal 122 is in communication with antennas 104 and 106, wherein antennas 104 and 106 transmit information to terminal 122 over forward link 124 and receive information from terminal 122 over reverse link 126.
  • FDD Frequency Division Duplex
  • the forward link 118 may utilize a different frequency band than that used by the reverse link 120, and the forward link 124 may utilize The frequency bands used by the reverse link 126 are different in frequency bands.
  • TDD Time Division Duplex
  • the forward link 118 and the reverse link 120 can use a common frequency band, and the forward link 124 and the reverse link 126 can be used together. frequency band.
  • Each set of antennas and/or regions designed for communication is referred to as a sector of base station 102.
  • the antenna group can be designed to communicate with terminals in sectors of the coverage area of base station 102.
  • the transmit antennas of base station 102 may utilize beamforming to improve the signal to noise ratio for forward links 118 and 124 of terminals 116 and 122.
  • mobile devices in adjacent cells are less subject to interference when the base station 102 transmits to the randomly dispersed terminals 116 and 122 in the relevant coverage area as compared to the base station transmitting to all of its terminals through a single antenna. .
  • base station 102, terminal 116, and/or terminal 122 may be transmitting wireless communication devices and/or receiving wireless communication devices.
  • the transmitting wireless communication device can encode the data for transmission. Specifically, the transmitting wireless communication device is to be transmitted over a channel to a certain number of information bits of the receiving wireless communication device. Such information bits may be included in a transport block or a plurality of transport blocks of data, which may be segmented to produce a plurality of code blocks.
  • the transmitting wireless communication device can encode each code block using a polar code encoder to improve the reliability of data transmission, thereby ensuring communication quality.
  • enhanced mobile broadband English: enhanced mobile broadband
  • ultra-reliable low-latency Communication English: Ultra Reliable Low Latency Communications
  • mMTC massive Machine Type Communications
  • the eMBB service mainly includes ultra high definition video, augmented reality AR, virtual reality VR, etc.
  • the main feature is that the transmission data volume is large and the transmission rate is high.
  • the URLLC service is mainly used for industrial control and unmanned driving in the Internet of Things.
  • the main features are ultra-high reliability, low latency, low transmission data and burstiness.
  • the mMTC service is mainly used for smart grids and smart cities in the Internet of Things.
  • the main features are the connection of mass devices, the small amount of data transmitted, and the delay of tolerating for a long time.
  • the Polar code is a coding method that theoretically proves that the Shannon capacity can be obtained and has a simple encoding and decoding method.
  • a part of the bits are used to carry information, called information bits, and the set of sequence numbers of these information bits is denoted as A.
  • the other part of the bits is set to a fixed value pre-agreed by the transceiver, which is called a fixed bit, and the set of the sequence numbers is represented by the complement A c of A.
  • These fixed bits are usually set to 0. In fact, only the transceiver end is required to be pre-agreed, and the fixed bit sequence can be arbitrarily set.
  • the encoded bit sequence of the Polar code can be obtained by the following method:
  • indicates the number of elements in the collection, ie K represents the number of elements in set A, Is a submatrix obtained from the rows corresponding to the indices in the set A in the matrix G N . Is a K ⁇ N matrix.
  • the Polar code can be better than the low-density parity-check code (LDPC). Density parity check code) and FER (frame error rate) performance of Turbo code.
  • the embodiment of the present invention utilizes the characteristics of the Polar coding matrix to construct a scrambling code sequence p for the bit sequence u in the data block to be encoded, so that between one coding bit sequence x of each data block to be coded in one transmission period
  • the scrambling of the information end before encoding is equivalent to the scrambling of the encoded coded end, and the type of the scrambling code sequence of the coded bit end is designed to be as small as possible, which is equivalent to designing the scrambling sequence on the information side.
  • the number of scrambling sequences of the information side relative to the scrambling sequence is as small as possible.
  • the types of the relative scrambling code sequences are only log 2 N.
  • each timing information is represented by a vector u, and different p vectors to be encoded are scrambled with different p vectors, and then polar coded and transmitted. Equivalently, the Polarated vector x is scrambled with the corresponding q vector. Send it. It can be seen that each p vector has a corresponding timing.
  • PBCH signals adjacent to each other are received, the latter PBCH signal is descrambled by using the relative scrambling code sequence, and the descrambled result is combined with the previous PBCH signal, and then translated by a polar decoder. Code, and use CRC check, if passed, the decoding is successful.
  • the embodiment of the present invention provides two modes, one is display transmission of timing information, and the other is implicit transmission of timing information.
  • the display transmission of the time series information means that the feature information carried in each piece of the data block to be encoded in one transmission period is different.
  • the feature information carried in the data blocks to be encoded in each segment is used to indicate the sending order of the data blocks to be encoded in each segment.
  • the feature information carried by the data block to be coded is descrambled by the corresponding relative scrambling code sequence to be carried by the previous block to be coded. Characteristic information. In this way, the complexity of cracking the feature information can be reduced at the receiving end by the relative scrambling code sequence.
  • Implicit transmission of timing information means that the feature information carried in each piece of data to be encoded in one transmission period is the same. Different scrambling results are obtained by scrambling different scrambling code sequences in the same plurality of pieces of data to be encoded in a transmission period, and the different scrambling results are used to indicate the one The order in which the plurality of pieces of data blocks to be encoded are transmitted in the transmission period. After the scrambled feature information carried in the two blocks of the data block to be coded is encoded by the Polar code, the scrambled feature information carried by the latter block to be coded is descrambled by using the corresponding relative scrambling code sequence. The scrambled feature information carried by the previous block to be encoded. In this way, the complexity of cracking the scrambled feature information can be reduced at the receiving end by the relative scrambling code sequence.
  • an embodiment of the present invention provides a data encoding method, where the method includes:
  • S102 Output the data blocks that are multi-segment encoded in the order in which they are adjacent to each other.
  • the feature information may be feature information after scrambling.
  • the feature information carried in the plurality of data blocks to be encoded may be different or the same.
  • the feature information may be time series information, and the implementation manner belongs to displaying and transmitting the time series information.
  • the timing information displays an order in which the plurality of encoded data blocks are transmitted.
  • the information about the information about the transmitting end of the data block to be encoded, or the information related to the receiving end of the data block to be encoded, or the information to be carried The information related to the encoded data block or the information related to the manner in which the multi-segment encoded data block is transmitted.
  • the data blocks that are multi-segment encoded are output in the order of the adjacent ones before and after, including:
  • the multi-segment encoded data blocks are output in the order in which the timing information is displayed.
  • the multi-segment encoded data blocks may be transmitted in a broadcast channel in the order in which the timing information is displayed.
  • the multi-segment data block to be encoded refers to a plurality of pieces of data blocks to be encoded transmitted in one transmission period (or transmission period). Moreover, further, the timing information carried in different data blocks to be encoded is different in one transmission period.
  • the plurality of pieces of timing information carried by the plurality of pieces of data blocks to be encoded are used to display a sending order of the plurality of pieces of data blocks to be encoded when being transmitted.
  • the values of the plurality of timing information are not necessarily sequentially arranged, as long as the timing information carried by the data blocks to be encoded in each segment is different in one transmission period.
  • a relative scrambling code sequence can be constructed between the feature information of each of the two adjacent data blocks to be encoded.
  • the relative scrambling code sequences constructed between the feature information of two adjacent to-be-coded data blocks may be the same or different.
  • the value of the feature information may be constructed according to how to construct a relatively identical scrambling code sequence between feature information of each of the two adjacent data blocks to be encoded in one transmission period.
  • the relative scrambling sequence is the target.
  • the data encoding method of the embodiment of the present invention may further include: before the step of performing the Polar code encoding of the plurality of pieces of data to be encoded to obtain the encoded data block, the method further includes:
  • the to-be-encoded data block i to be transmitted refers to the data transmitted ith in a transmission period, and the to-be-coded data block i to be transmitted includes the timing information.
  • the timing information in different data blocks to be encoded is different, that is, the timings of the data blocks to be encoded are different, and the data blocks to be transmitted are also different.
  • the data format of the data block to be transmitted to be transmitted is [b k ...
  • b 0 a 9 , a 8 , a 7 , a 6 , a 5 , a 4 , a 3 , a 2 , a 1 , a 0
  • b k ... b 0 are other system information
  • System frame number, a 0 is low.
  • the data after 16-bit CRC encoding is [b k ...
  • the above embodiments of the present invention can be applied to a physical broadcast channel.
  • the physical broadcast channel (English: Physical Broadcast Channel, abbreviation: PBCH) generally carries a master information block (English: Master Information Block, abbreviation: MIB).
  • MIB Master Information Block
  • the length of the MIB is 24 bits
  • the MIB includes the downlink system bandwidth
  • the PHICH (English: Physical Hybrid ARQ Indicator Channel, Chinese: physical hybrid automatic repeat request indication channel) size
  • the system frame number English: System Frequency Number, referred to as: SFN
  • the base station first performs a Cyclic Redundancy Check (CRC) encoding on the MIB to be transmitted to obtain a 16-bit CRC sequence, and then the base station will have a 40-bit long sequence (including a 24-bit MIB and a 16-bit CRC).
  • CRC Cyclic Redundancy Check
  • the channel coding and the rate matching are performed to obtain a coding sequence, and the coding sequence is segmented to obtain four equal-sized PBCH independent units, and the base station performs subsequent modulation, mapping, and transmission processes.
  • the channel coding of the PBCH is coded using a polarization code. After performing modulation and mapping processes on four PBCH independent units, the transmission is performed within a time window of 40 ms (transmission time of 4 radio frames, 10 ms per radio frame). In the implicit transmission, the bits participating in the coding in the four PBCH independent units are the same, and the encoded bits are also the same. However, when the transmission is displayed, the bits participating in the coding in the four PBCH independent units are different, and the encoded bits are also different.
  • the receiver can only successfully complete the decoding and CRC check operations by receiving only one PBCH independent unit within 40 ms.
  • the transmitting terminal sends the MIB in the first few radio frames within 40 ms, that is, the SFN information is known.
  • the receiving end For the case of poor channel quality, if the receiving end only receives one PBCH independent unit and cannot successfully decode, it will perform soft combining with the next PBCH independent unit transmitted in the next 10ms and then decode it until successful decoding.
  • PBCH independent units (which may also be referred to as data blocks) are transmitted in one PBCH cycle
  • a 1 , a 0 change according to time series, that is, the timing information has the following four types: 0->1->2->3, if according to binary
  • the representation is: 00->01->10->11.
  • the different parts of the system frame numbers in all PBCH independent units in one cycle are used as timing information, and are put into data blocks for encoding and transmission. This method belongs to display transmission.
  • the CRC is also a linear code, that is, the CRC bit CRC(a) obtained by a coding
  • the CRC bits obtained by a+b coding are CRC(a+b)
  • the CRCs of the four data blocks transmitted in one cycle are respectively recorded as CRC (00), CRC (01), CRC (10), CRC (11).
  • the timing information in the previously transmitted data block as a reference
  • the timing information in the data block transmitted in the next transmission can be regarded as scrambling the timing information in the data block transmitted in the previous time, and the scrambled sequence is called relative Scrambling code sequence.
  • the relative scrambling sequence of the data blocks transmitted before and after the two adjacent data blocks before encoding is:
  • the relative scrambling sequences of the coded bits of the two transmitted data blocks adjacent to each other are:
  • the relative scrambling code sequence between 00000000 and 11111111 is 11111111
  • the relative scrambling code sequence between 11111111 and 10101010 is 01010101
  • the relative scrambling code sequence between 10101010 and 01010101 is 11111111.
  • PBCH independent units (which may also be referred to as data blocks) are transmitted in one PBCH cycle, b k ... b 0 and a 9 , a 8 , a 7 , a 6 , a in the system frame number in one cycle 5 , a 4 , a 3 do not change, a 2 , a 1 , a 0 is used to represent timing information.
  • the timing information of each data block is different, there are 8 kinds as follows, namely 0 ->1->2->3->4->5->6->7, if expressed in binary: 000->001->010->011->100->101->110-> 111.
  • the relative scrambling sequence of the data blocks transmitted before and after the two adjacent data blocks before encoding is:
  • the relative scrambling sequence of the encoded bits after the Polar encoding has only three possibilities, namely Polar ([00...001CRC(0...001)]), Polar([00...011CRC(0...011)]) and Polar([00...111CRC(0...111)]).
  • the parts affecting the relative scrambling sequence are listed as a table, as shown in Table 2.
  • the scrambling code sequence of the feature information in the encoded data block may have a total of log 2 N relative scrambling code sequences, where N refers to a to be encoded sent in one transmission period.
  • N refers to a to be encoded sent in one transmission period.
  • the scrambling code sequence has relatively few types of scrambling code sequences.
  • the timing information may be implicitly transmitted.
  • the multi-segment data block to be encoded belongs to a data block to be encoded in one transmission period, and before the step of encoding the data block to be encoded by the multi-segment data block to obtain the encoded data block Or later include:
  • S009 The feature information carried in the data block to be encoded is scrambled by using different scrambling code sequences, where the feature information carried in the multi-segment data block to be encoded in one transmission period is the same.
  • the feature information carried in the multi-segment data block to be encoded in one transmission period is scrambled by using different scrambling code sequences, so that after the scrambling, the multi-segment waiting in one transmission period can be distinguished.
  • Encoded data blocks In the case that the feature information carried in the multi-segment data block to be coded in one transmission period is the same, the data block to be coded in each transmission period can be distinguished in this manner, and the feature can be obtained after scrambling
  • the information indicates the order in which the data blocks to be encoded are transmitted in a transmission period.
  • the way in which the information of the transmission order that is, the time series information
  • the scrambled feature information is implicit transmission.
  • the scrambling process in the step S009 may be that the feature information in the encoded data block is scrambled by performing the Polar code encoding on the data block to be encoded in the multiple segments, or may be The plurality of pieces of data to be encoded are scrambled by the feature information carried before the Polar code is encoded.
  • the data encoding method in the embodiment of the present invention further includes: before scrambling the feature information carried in the multi-segment data block to be encoded by using different scrambling code sequences:
  • the step of encoding the coded data block may further include:
  • the data encoding method of the embodiment of the present invention may further include: after the step of performing the Polar code encoding of the data block to be encoded by the multi-segment to obtain the encoded data block:
  • the feature information carried in the multi-segment data block to be encoded is scrambled by using a corresponding scrambling code sequence.
  • the data to be transmitted within one PBCH cycle is the same, including partial high-order information of the timing.
  • the data format to be transmitted is [b k ... b 0 , a 9 , a 8 , ..., a i ], where b k ... b 0 is other system information, a 9 ,..., a i is the upper bit of the system frame number, and the lower bit does not participate in the encoding.
  • the data is [b k ...
  • the contents of the data block to be encoded are b k ... b 0 , a 9 , a 8 , a 7 , a 6 , a 5 , a 4 , a 3 , a 2 is the same part of all PBCH independent units transmitted in one cycle.
  • the information bits before the Polar encoding are scrambled with different scrambling code sequences, that is, the CRC encoded bit sequence [b k ... b 0 , a 9 , ..., a i , c 15 , c 14 , ...
  • the scrambling results are [b k ... b 0 , a 9 , ..., a i , c 15 , c 14 , ... c 1 , c 0 ], respectively.
  • the information bits before Polar encoding are scrambled with different scrambling code sequences, or the encoded codes of Polar encoding are scrambled with corresponding sequences.
  • the implicit transmission Since in the implicit transmission, it is not necessary to additionally encode the information showing the timing in the system frame number, but only the bits in the system frame number that are to be encoded are selected to be scrambled, and then used. The timing of transmitting each PBCH independent unit in one PBCH period is displayed. Therefore, the encoded data amount is less than the explicit transmission, that is, the encoding code rate is lower, and the decoding performance is slightly better than the explicit transmission.
  • the partial information in the data block to be encoded is scrambled as the feature information, and the scrambling code is constructed for the feature information carried in the data block to be encoded adjacent to each other in one transmission period.
  • the scrambling sequence has fewer types of scrambling sequences, and even the scrambling sequence can be only log 2 N relative to the scrambling sequence.
  • an embodiment of the present invention further provides a decoding method, where the method includes:
  • S201 Receive two pieces of data blocks to be decoded adjacent to each other before and after receiving, and the data block to be decoded carries feature information to be decoded;
  • S202 Participate in descrambling processing by using a relative scrambling code sequence, and perform decoding and judging processing on the obtained descrambling result, wherein the relative scrambling code sequence is used to participate in descrambling processing, and the obtained descrambling result is decoded.
  • the determining process specifically includes: using a relative scrambling code sequence to descramble the feature information to be decoded carried in the data block to be decoded in the subsequent segment to obtain the descrambled feature information, and the descrambled feature The information is combined with the feature information to be decoded carried in the data block to be decoded in the previous segment to perform decoding processing; and the feature information after the decoding process is determined;
  • the relationship between the feature information carried by the adjacent two blocks of the data block to be decoded is constrained, thereby reducing the complexity of cracking the correct feature information.
  • the feature information may be feature information after scrambling.
  • the feature information carried in the two pieces of data blocks to be decoded may be different or the same.
  • the feature information may be time series information, and the implementation manner belongs to displaying and transmitting the time series information.
  • the timing information displays an order in which the plurality of encoded data blocks are transmitted.
  • the timing information may also display an order of receiving the plurality of pieces of data blocks to be decoded.
  • the feature information refers to information related to the sending end of the multi-segment data block to be encoded, or refers to information related to the receiving end of the multi-segment data block to be encoded, or to be encoded with the feature information to be encoded.
  • the data block related information refers to information related to the manner in which the multi-segment encoded data block is transmitted. Because the encoded data block is transmitted through the channel, it is the data block to be decoded in the embodiment of the decoding mode. Therefore, the feature information may also refer to information related to the transmitting end of the data block to be decoded, or information related to the receiving end of the data block to be decoded, or refers to carrying the feature. The information related to the data block to be decoded of the information or the information related to the transmission mode of the data block to be decoded.
  • the decoding method if the result of the determination is an error, other relative scrambling code sequences may be tried to participate in the descrambling, and the obtained descrambling result is decoded and judged until The result of the judgment is correct or all of the relative scrambling code sequences are tried. Among them, the relative scrambling code sequence of each attempt is different.
  • the embodiment of the decoding method further includes: outputting the feature information when the result of the determination is correct.
  • the determining process includes:
  • the decoded feature information After determining that the decoded feature information is correctly verified and belongs to the candidate feature information, it is determined that the decoded feature information is correct feature information.
  • the determining process may further include:
  • the correct feature information is the correct time series information.
  • the candidate feature information refers to feature information associated with the relative scrambling code sequence participating in the descrambling process.
  • the relative scrambling code of the feature information scrambling sequence in the data block to be decoded after the relative scrambling code sequence can be used
  • the feature information in the data block to be decoded in the previous segment is the candidate feature associated with the scrambling code sequence of the scrambling code sequence.
  • the feature information in the data block to be decoded in the subsequent segment may be referred to as feature information associated with the scrambling code sequence relative to the scrambling code sequence.
  • the candidate feature information may specifically be candidate timing information.
  • the two pieces of data blocks to be decoded that are adjacent to each other before and after the receiving include:
  • the verification process may be a CRC (Cyclic Redundancy Check) check process.
  • the descrambling process specifically includes: corresponding to each bit in the feature information to be decoded carried in the data block to be decoded in the subsequent segment, in a corresponding relative In the case where the value in the bit in the scrambling code sequence is 0, the value of the bit after descrambling is the same as before the descrambling; in the case where the value in the bit in the corresponding relative scrambling code sequence is 1, Invert the value before descrambling.
  • the data block to be decoded may be the information after the encoded data block is transmitted through the channel in the foregoing encoding method.
  • the feature information to be decoded may be information in the above coding method after the encoded feature information is transmitted through the channel.
  • the coding method embodiment is implemented at the transmitting end, and the decoding method embodiment is implemented at the receiving end. Therefore, various embodiments and various concepts between them can be used for reference.
  • the encoding method may be referred to as a data processing method.
  • the decoding method may also be referred to as a data processing method.
  • the feature information carried in the LLR information is output, and the feature information may be time series information, for example: a 9 , a 8 , a 7 , a 6 , a 5 , a 4 , a 3 , a 2 , a 1 , a 0 . If there is no verification pass, it waits for the LLR information of the next transmission.
  • the decoding fails for the LLR information of one transmission, it is necessary to combine the LLR information of multiple transmissions to improve the success rate of decoding.
  • the LLR information received twice is taken as an example for description.
  • Step 1 Using the information transmitted for a certain time (such as LLR1), the information for another transmission (LLR2),
  • the descrambling process specifically includes: if the bit in the relative scrambling code sequence is 0,
  • the corresponding bit in the LLR2 has no change before and after descrambling; if the bit in the relative scrambling code sequence is 1, the LLR2 is
  • Step 3 Perform Polar decoding on the combined LLR
  • Step 4 CRC check, if the CRC check fails, replace the above-mentioned descrambling and decoding steps by changing a relative scrambling code sequence. If the CRC check passes, it is determined whether the decoded feature information belongs to the candidate feature information of the used relative scrambling code sequence, and if it belongs to the candidate timing information of the used relative scrambling code sequence, the feature information and decoding carried in the LLR1 are output. result.
  • the step of descrambling, decoding, and verifying is repeated by replacing a relative scrambling code sequence.
  • timing information carried has the following three possibilities: ⁇ 0, 1 ⁇ , ⁇ 1, 2 ⁇ , ⁇ 2, 3 ⁇ .
  • the relative scrambling sequence of ⁇ 0,1 ⁇ and ⁇ 2,3 ⁇ is 1111111, and the relative scrambling sequence of ⁇ 1,2 ⁇ is 01010101.
  • the time series information carried by the two adjacent data blocks to be decoded is ⁇ 0, 1 ⁇ , and the blind detection is first attempted by using the relative scrambling code sequence 01010101, and the LLR information is combined and decoded.
  • the decoding result will pass the CRC check with a certain probability, and the decoded timing information may be 2, that is, the wrong timing information. Therefore, it is only determined by the CRC check whether the blind check is successful or not, and there is a systematic error at a high signal to noise ratio.
  • the correct timing information may only be one.
  • the time information obtained by the decoding is 2, and the candidate timing of the relative scrambling code sequence does not match, it can be determined that the decoding result is erroneous. At this point, it is decided that the blind detection fails, and a relative scrambling code sequence is used to perform blind detection again.
  • the matching step of candidate timing information avoids systematic errors.
  • the following Table 3 can be derived from Table 1.
  • the corresponding timing information that may be obtained is: 0 or 2.
  • the corresponding timing information obtained can only be: 3.
  • the candidate timing information in Table 4 can be derived from Table 2, where the candidate timing information refers to the timing information carried in the data block to be decoded in the previous segment associated with the used relative scrambling code sequence, if the relative interference is used. If the code sequence is "001" and the timing information is one of the candidate timing information sets [0, 2, 4, 6], the decoding may be initially determined to be successful; if the obtained timing information does not belong to 001 The candidate timing information indicates that the relative scrambling sequence used during descrambling is incorrect, and the decoding failure can be determined.
  • the algorithm needs to try all the log 2 N relative scrambling code sequences at most, that is, the maximum number of decoding times is log 2 N times, which is lower than N times in the LTE PBCH, where N refers to the encoded data sent in one transmission period.
  • N refers to the encoded data sent in one transmission period.
  • the timing matching after each decoding is relatively simple and the complexity is low.
  • the two pieces of timing information carried by the two blocks of data to be decoded are used to display an arrangement order of the two pieces of data blocks to be decoded at the time of receiving.
  • the values of the two pieces of timing information are not necessarily sequentially arranged, as long as the timing information carried by the data blocks to be decoded in each segment is different in one receiving period.
  • a relative scrambling code sequence can be constructed between the feature information of each of the two adjacent data blocks to be decoded.
  • the relative scrambling code sequences constructed between the feature information of two adjacent to-be-decoded data blocks may be the same or different.
  • the value of the feature information may be constructed according to how to construct a relative scrambling code sequence between feature information of each of the two adjacent data blocks to be decoded in one receiving period. The same relative scrambling sequence is for the purpose.
  • Table 5 shows another relative scrambling sequence obtained when the timing information carried in the two blocks of data to be decoded adjacent to each other is not arranged in order. .
  • one transmission period for example, one PBCH period
  • the relative scrambling code sequence of the configuration shown in the table can make the candidate timing information corresponding to each relative scrambling code sequence more uniform.
  • Table 6 Listed in Table 6 are candidate timing information derived from Table 5.
  • the determining process specifically includes:
  • an attempt is made to descramble each scrambling code sequence in a set of scrambling code sequences, and the CRC check is performed on the descrambled result, and in the case of passing the CRC check, the pass is determined.
  • the feature information of the CRC check is the correct feature information; after each scrambling code sequence in the set of scrambling code sequences is tried, if the CRC check is still not passed, another relative scrambling code sequence is used. The descrambling is performed, and the obtained descrambling result is decoded and judged.
  • the set of scrambling code sequences refers to a scrambling code sequence corresponding to the candidate feature information associated with the used relative scrambling code sequence.
  • the scrambled feature information is used to indicate the sending order of the data block to be encoded carrying the feature information by scrambling the feature information.
  • the feature information in each data block to be encoded is different in the scrambling code sequence. In this way, in a transmission period, even if the feature information carried in each data block to be encoded is the same, different scrambling results can be obtained by using different scrambling code sequences for each feature information, so that different scrambling results can be obtained.
  • Each feature information corresponds to a scrambling code sequence. These different scrambling results can be used to indicate the order in which the encoded data blocks are sent.
  • the descrambling using the relative scrambling code sequence can determine the candidate feature information associated with the relative scrambling code sequence, but it is not determined whether the relative scrambling code sequence used is correct. All candidate feature information associated with the relative scrambling code sequence is taken as a range, and the scrambling code sequences corresponding to the candidate feature information are tried one by one to confirm whether the CRC check can be passed. If the CRC check is not passed, the relative scrambling code sequence used may be wrong, or the scrambling code sequence used is wrong. The CRC check may not be performed after all the scrambling code sequences corresponding to the candidate feature information are tried. Then, the relative scrambling code sequence is wrong, and it is necessary to replace the previous scrambling code sequence to try.
  • the method before the step of using a relative scrambling code sequence to participate in the descrambling process and decoding and judging the obtained descrambling result, the method further includes:
  • S205 Calculate a correlation between two pieces of feature information to be decoded carried in the data block to be decoded, and obtain a relative scrambling code sequence that matches the correlation, and obtain the relative interference.
  • the code sequence is an associated scrambling code sequence that participates in the descrambling process.
  • step of obtaining a relative scrambling code sequence that matches the correlation by calculating a correlation between two pieces of feature information to be decoded that are carried in the data block to be decoded in the two segments, specifically including: adopting the following formula:
  • qi is the ith relative scrambling code sequence
  • q is the relative scrambling code sequence that best matches LLR1 and LLR2
  • SUM() is the sum function
  • min ⁇ is the smallest one.
  • LLR1 is to be translated in the data block to be decoded in the previous segment
  • LLR2 is the feature information to be decoded carried in the data block to be decoded in the latter segment.
  • an embodiment of the present invention further provides a decoding method, where the method includes:
  • S301 Receive two pieces of data blocks to be decoded that are adjacent to each other before and after receiving, and the data block to be decoded carries feature information to be decoded.
  • the embodiment of the decoding method shown in FIG. 7 is different from the embodiment of the decoding method shown in FIG. 6 in that two parameters to be decoded are carried in the data block to be decoded by the two segments to be decoded.
  • the correlation of the information is obtained, and the relative scrambling code sequence matching the correlation is obtained.
  • Other specific implementations and basic concepts can refer to various concepts and embodiments of the decoding method shown in FIG. 6 above.
  • the calculating by calculating a correlation between two feature information to be decoded carried in the two data blocks to be decoded, obtaining a relative interference matching the correlation
  • the steps of the code sequence include: adopting the following formula:
  • qi is the ith relative scrambling code sequence
  • q is the relative scrambling code sequence that best matches LLR1 and LLR2
  • SUM() is the sum function
  • min ⁇ is the smallest one.
  • LLR1 is to be translated in the data block to be decoded in the previous segment
  • LLR2 is the feature information to be decoded carried in the data block to be decoded in the latter segment.
  • the relative scrambling code sequence matching the correlation is obtained, if the selected relative scrambling code sequence is selected If it is correct, only need to descramble and decode once, you can get the correct feature information.
  • the relative scrambling sequence derived from the correlation has a certain probability that it is erroneous.
  • a physical broadcast channel (English: Physical Broadcast Channel, abbreviation: PBCH) carries a master information block (English: Master Information Block, abbreviation: MIB).
  • the length of the MIB is 24 bits, the MIB includes the downlink system bandwidth, the PHICH (English: Physical Hybrid ARQ Indicator Channel, Chinese: Physical Hybrid Automatic Repeat Request Direction Channel), and the system frame number (English: System Frequency Number) , referred to as: SFN), the high eight and so on.
  • the base station first performs a Cyclic Redundancy Check (CRC) encoding on the MIB to be transmitted to obtain a 16-bit CRC sequence, and then the base station will have a 40-bit long sequence (including a 24-bit MIB and a 16-bit CRC).
  • CRC Cyclic Redundancy Check
  • a coding sequence is obtained, and the coding sequence is segmented to obtain four equal-sized PBCH independent units, and four PBCH independent units are separately scrambled by using four scrambling code sequences, and the base station completes scrambling subsequent steps. Modulation, mapping, and transmission processes.
  • the channel coding of the PBCH is encoded by a TBCC (Tailbiting Convolutional Code), and the four scrambling code sequences adopt different phases.
  • the four PBCH independent units carry the same coded bits, and the four PBCH independent units perform the processes of scrambling, modulation, and mapping, and then transmit them in a time window of 40 ms (transmission time of 4 radio frames, 10 ms per radio frame).
  • the four PBCH independent units carry the same coded bits. Therefore, if the channel quality is good enough, the receiver only receives a PBCH independent unit within 40 ms and successfully completes the descrambling, decoding, and CRC check. operating. Since the receiving end succeeds in scrambling the scrambling code sequence, it is obtained that the transmitting end transmits the MI B in the first few radio frames within 40 ms, that is, the lower 2 bits of the SFN are known.
  • the receiving end For the case of poor channel quality, if the receiving end only receives one PBCH independent unit and cannot successfully descramble the decoding, it will perform soft combining with the next PBCH independent unit sent by the next 10ms and decode it until it is successfully decoded.
  • the UE can obtain the upper 8 bits of the system frame number (SFN) of the cell system, and the lowest 2 bits need to be obtained during the PBCH blind check.
  • SFN system frame number
  • the PBCH is repeated 4 times in a 40 ms period, and each transmitted PBCH carries the same coded bits, that is, each time it can be decoded by itself.
  • each transmitted PBCH will be scrambled with a different scrambling code sequence (ie, there are 4 different scrambling code sequences, and a long random sequence is divided into 4 segments).
  • the UE may only perform decoding within one of the 40 ms, and each of the four possible scrambling sequences is used to try to descramble and decode the PBCH if decoding.
  • the cell transmits the MI B in the first few system frames within 40 ms, that is, the lowest 2 bits of the SFN are known.
  • the content of the PBCH transmitted in the next 10 ms is descrambled and soft-combined, and then decoded until the PBCH is successfully decoded.
  • the soft combining process it is also necessary to descramble the received LLRs using 4 possible scrambling code sequences, and then perform soft combining.
  • the periodic transmission of PBCH in LTE has the following characteristics:
  • Each transmission in one cycle can be independently decoded, or different transmissions can be combined and decoded.
  • the lower 2 bits of the SFN information are implicitly transmitted by bit scrambling different scrambling code sequences after each encoding, and the receiving side obtains the blind detection scrambling code sequence, and the number of attempts to decode and CRC check with the scrambling code sequence The number of digits increases linearly.
  • the timing information of the PBCH is blindly checked, and descrambling and decoding and CRC check are required each time.
  • the blind detection under multiple PBCH merges also needs to descramble the possible scrambling codes first, and then perform decoding and CRC check.
  • the number of decodings required for blind detection is linear with the number of scrambling sequences (the number of information to be carried).
  • the LTE scheme requires at most N decodings, and each decoding performs one CRC check; It only needs to be decoded once, and the CRC is checked once during transmission.
  • the CRC is checked N times.
  • the LTE scheme requires at most N decodings, and each decoding performs one CRC check; the solution of the present invention requires log 2 N decodings, and each translation is displayed during transmission.
  • the code requires 1 CRC check and possibly multiple timing match.
  • multiple CRC check is required for each decoding, and the total CRC check times are the same as LTE. It can be seen that the decoding times in the embodiment of the present invention is lower than the LTE scheme, and the corresponding blind detection complexity is lower than the LTE scheme.
  • the above-described embodiments of the invention only take the blind detection PBCH timing as an example, and the inventive scheme can also be used for transmission and blind detection of other information.
  • the representation of the timing information in the display transmission and the scrambling code design in the implicit transmission are exemplified by a relatively simple mode, and other modes can also achieve the effect of the solution of the present invention, and in one During the transmission period or the reception period, the types of relative scrambling sequences of the feature information carried in all the data blocks to be encoded may be only log 2 N, and the relative scrambling sequence of the feature information carried in all the data blocks to be decoded The type can only be log 2 N.
  • FIG. 9 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present disclosure, where the data processing apparatus includes:
  • a first encoding module configured to perform a Polar code encoding on a plurality of data blocks to be encoded to obtain a coded data block, where each piece of the data block to be encoded in the plurality of pieces of data to be encoded carries feature information, and the feature information After the Polar code is encoded, the relationship between the feature information carried by the two adjacent data blocks to be encoded is satisfied: the feature information carried by the latter data block to be coded is descrambled by using the corresponding scrambling code sequence relative to the scrambling code sequence. And obtaining the feature information carried by the previous data block to be encoded;
  • the interface module is configured to output the multi-segment encoded data blocks in the order of the adjacent ones.
  • the data processing apparatus shown in FIG. 9 can be used to perform various embodiments of the data encoding method shown in FIG. 3, FIG. 4, FIG. 5 and FIG.
  • the technical effects are similar and will not be described here.
  • various specific implementation manners of S006, S007, S008, S009, S100, and S101 in the data encoding method shown in FIG. 3, FIG. 4, FIG. 5, and FIG. 8 can also be used as FIG. 9 correspondingly.
  • Various embodied implementations of the functionality of the first encoding module of the data processing apparatus are shown.
  • Various specific implementations of S102 in the data encoding method shown in FIG. 3, FIG. 4, FIG. 5 and FIG. 8 can also be used as the function of the interface module of the data processing apparatus shown in FIG. A variety of concrete implementations.
  • FIG. 10 is a schematic structural diagram of another data processing apparatus according to an embodiment of the present invention.
  • the data processing apparatus shown in FIG. 10 includes:
  • a receiving module configured to receive two pieces of data blocks to be decoded that are adjacent to each other before and after, and the data block to be decoded carries feature information to be decoded;
  • a first decoding module configured to participate in descrambling processing by using a relative scrambling code sequence, and perform decoding and judging processing on the obtained descrambling result, wherein the relative scrambling code sequence is used to participate in descrambling processing, and the obtained Decoding the decoding result and determining the processing specifically includes: using a relative scrambling code sequence to descramble the feature information to be decoded carried in the data block to be decoded in the subsequent segment, and obtaining the descrambled feature information, Decoding the feature information and combining the feature information to be decoded carried in the data block to be decoded in the previous segment to perform decoding processing; and determining the decoded feature information; When the feature information participating in the judgment is an error, another relative scrambling code sequence is used to participate in the descrambling, and the obtained descrambling result is decoded and judged.
  • the data processing apparatus shown in FIG. 10 provided by the embodiment of the present invention can be used to perform various implementations of the decoding method shown in FIG. 6.
  • the implementation principle and technical effects are similar, and details are not described herein again.
  • various specific implementation manners of the S201 in the decoding method shown in FIG. 6 can also be used as various embodiments of the functions of the receiving module of the data processing apparatus shown in FIG. 10 .
  • Various specific implementations of S205, S202, and S203 in the decoding method shown in FIG. 6 can also be used as various functions of the first decoding module of the data processing apparatus shown in FIG. Concrete implementation.
  • FIG. 11 is a schematic structural diagram of still another data processing apparatus according to an embodiment of the present invention.
  • the data processing apparatus shown in FIG. 11 includes:
  • a receiving module configured to receive two pieces of data blocks to be decoded that are adjacent to each other before and after, and the data block to be decoded carries feature information to be decoded;
  • a second decoding module configured to calculate, by calculating a correlation between two pieces of feature information to be decoded carried in the two blocks of data to be decoded, to obtain a relative scrambling code of the scrambling code sequence matching the correlation a sequence, wherein the scrambling code sequence is used to descramble the feature information to be decoded carried in the data block to be decoded, and the descrambled feature information is obtained, and the descrambled feature is obtained.
  • the information is combined with the feature information to be decoded carried in the data block to be decoded in the previous segment to perform decoding processing; and the feature information after the decoding process is determined;
  • the receiving module is further configured to output the feature information determined to be correct if the feature information participating in the determination is correct.
  • the data processing apparatus shown in FIG. 11 may be used to perform various implementations of the decoding method shown in FIG. 7.
  • the implementation principle and technical effects are similar, and details are not described herein again.
  • various specific implementation manners of S301 and S303 in the decoding method shown in FIG. 7 can also be used as various specific functions of the receiving module of the data processing apparatus shown in FIG. The way to achieve.
  • Various specific implementations of S302 in the decoding method shown in FIG. 7 can also be used as various embodied implementations of the functions of the second decoding module of the data processing apparatus shown in FIG.
  • the communication apparatus includes: a processor, and a memory interconnected with the processor.
  • the processor reads and Execution of the instructions in the memory or execution of its own hardware logic circuitry to cause the communication device to perform various embodiments of any one of the data processing methods illustrated in Figures 3-8.
  • the memory is for storing the instructions, and the memory may be independent of the processor or integrated into the processor.
  • the communication device may further include a transceiver (not shown) for receiving and/or transmitting data.
  • the communication device of the embodiment of the present application may be any device having a wireless communication function, such as an access point, a site, a user equipment, a base station, and the like.
  • the communication device may also have a dual function of encoding and decoding, performing an encoding operation when acting as an encoding end, and performing a decoding operation when acting as a decoding terminal.
  • the communication device includes a baseband chip, the baseband chip includes an encoder and a decoder, and the encoder can be used to implement the same function as the aforementioned encoding end, and the decoder can implement the same function as the aforementioned decoding end.
  • the processor may be an integrated circuit that operates in accordance with a non-curing instruction or an integrated circuit that operates in accordance with a curing instruction.
  • the processor operating in accordance with the non-curing instructions implements various ones of the methods of any of the methods illustrated in Figures 3 through 8 by reading and executing instructions in the memory, or Various embodiments of any of the data processing devices shown in Figures 9 through 11 are shown.
  • the processor operating in accordance with the curing instructions implements various ones of the methods of any of the methods illustrated in Figures 3-8 by running its own hardware logic circuitry, or alternatively, as shown in Figures 9-11 Various embodiments of any of the data processing devices shown in the data processing device.
  • the memory is a random access memory (ROM), a flash memory, a read only memory (RAM), a programmable read only memory, an electrically erasable programmable memory, a cache (CACHE) or a register.
  • ROM random access memory
  • RAM read only memory
  • CACHE electrically erasable programmable memory
  • a storage medium that is convenient for the processor to read.
  • the processor may be a central processing unit (CPU), a graphics processing unit (GPU), or a digital signal processor (DSP). ), Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Network Processor (NP), other programmable logic devices, discrete gate transistors Logic devices, or discrete hardware components, and so on.
  • CPU central processing unit
  • GPU graphics processing unit
  • DSP digital signal processor
  • ASIC Application Specific Integrated Circuit
  • FPGA Field Programmable Gate Array
  • NP Network Processor
  • other programmable logic devices discrete gate transistors Logic devices, or discrete hardware components, and so on.
  • the various embodiments described above may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
  • software When implemented in software, it may be implemented in whole or in part in the form of a computer program product.
  • the computer program product includes one or more computer instructions.
  • the computer program instructions When the computer program instructions are loaded and executed on a computer, the processes or functions described in accordance with embodiments of the present invention are generated in whole or in part.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device.
  • the computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be from a website site, computer, server or data center Transfer to another website site, computer, server, or data center by wire (eg, coaxial cable, fiber optic, digital subscriber line (DSL), or wireless (eg, infrared, wireless, microwave, etc.).
  • the computer readable storage medium can be any available media that can be accessed by a computer or a data storage device such as a server, data center, or the like that includes one or more available media.
  • the usable medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (such as a solid state disk (SSD)).

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Un mode de réalisation de la présente invention concerne un procédé de codage de données caractérisé en ce qu'il comporte les étapes consistant à: effectuer un codage à code polaire sur des blocs de données multiples à coder pour obtenir des blocs de données codés, chacun des blocs de données multiples transportant des informations de caractéristiques, et après que les informations de caractéristiques ont subi un codage à code polaire, une relation entre les informations de caractéristiques transportées par deux blocs de données adjacents précédent et suivant étant satisfaite; utiliser une séquence d'embrouillage correspondante pour effectuer un désembrouillage sur les informations de caractéristiques transportées par la bloc de données suivant pour obtenir les informations de caractéristiques transportées par la bloc de données précédent; et délivrer les blocs de données codés multiples dans un ordre allant des blocs de données précédents aux blocs de données adjacents suivants.
PCT/CN2018/080835 2017-04-05 2018-03-28 Procédé et dispositif de codage et de décodage de données WO2018184493A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710218600.9A CN108696283B (zh) 2017-04-05 2017-04-05 数据编码和译码的方法和装置
CN201710218600.9 2017-04-05

Publications (1)

Publication Number Publication Date
WO2018184493A1 true WO2018184493A1 (fr) 2018-10-11

Family

ID=63712375

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/080835 WO2018184493A1 (fr) 2017-04-05 2018-03-28 Procédé et dispositif de codage et de décodage de données

Country Status (2)

Country Link
CN (1) CN108696283B (fr)
WO (1) WO2018184493A1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109873686B (zh) * 2019-03-11 2020-06-05 北京理工大学 一种基于极化码的5g广播信道合并接收方法
CN112217597B (zh) * 2019-07-10 2022-04-01 大唐移动通信设备有限公司 一种物理广播信道pbch的解调方法及设备

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130246883A1 (en) * 2010-11-22 2013-09-19 Sony Corporation Data processing device and data processing method
CN103516476A (zh) * 2012-06-29 2014-01-15 华为技术有限公司 编码方法和设备
CN103780329A (zh) * 2012-10-17 2014-05-07 华为技术有限公司 一种编译码的方法、装置及系统
CN105009461A (zh) * 2013-12-24 2015-10-28 华为技术有限公司 极性码的译码方法和译码装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103281166B (zh) * 2013-05-15 2016-05-25 北京邮电大学 一种基于极化码的混合自动重传请求传输方法
USRE48563E1 (en) * 2013-08-20 2021-05-18 Lg Electronics Inc. Method for transmitting data by using polar coding in wireless access system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130246883A1 (en) * 2010-11-22 2013-09-19 Sony Corporation Data processing device and data processing method
CN103516476A (zh) * 2012-06-29 2014-01-15 华为技术有限公司 编码方法和设备
CN103780329A (zh) * 2012-10-17 2014-05-07 华为技术有限公司 一种编译码的方法、装置及系统
CN105009461A (zh) * 2013-12-24 2015-10-28 华为技术有限公司 极性码的译码方法和译码装置

Also Published As

Publication number Publication date
CN108696283B (zh) 2021-06-22
CN108696283A (zh) 2018-10-23

Similar Documents

Publication Publication Date Title
CN107005690B (zh) 极化码的速率匹配的方法、装置和无线通信设备
WO2019158031A1 (fr) Procédé de codage, procédé de décodage, dispositif de codage, et dispositif de décodage
CN109075799B (zh) 极化Polar码的编译码方法及装置
US10938422B2 (en) Polar code rate matching method and apparatus, and a communications apparatus
CN108462554B (zh) 一种极性码的传输方法和装置
WO2016119105A1 (fr) Procédé et dispositif de génération de code polaire
WO2019062145A1 (fr) Procédé de codage polaire et appareil de codage ainsi que procédé de décodage et appareil de décodage
US10887050B2 (en) Downlink signal reception method and user equipment, and downlink signal transmission method and base station
US11139836B2 (en) Information transmission method and transmission device, and information reception method and reception device
WO2017124844A1 (fr) Procédé de détermination de taille de bloc de transmission d'un code de polarisation, et dispositif de communication
WO2020048537A1 (fr) Procédé et dispositif de codage en cascade
CN111600677B (zh) 一种数据传输方法及装置
KR102662470B1 (ko) 조기 종료를 위해 극성 코드에서 분산 crc를 인터리빙하는 시스템 및 방법
US11343018B2 (en) Polar code interleaving processing method and apparatus
US20230224082A1 (en) Retransmission method and apparatus
CN108429599A (zh) 用于通信系统中的数据处理的方法和设备
US12143124B2 (en) Encoding and decoding method and related apparatus
US20230208554A1 (en) Encoding and Decoding Method and Apparatus
WO2019037782A1 (fr) Procédé de décodage et décodeur pour codes polaires
WO2018184493A1 (fr) Procédé et dispositif de codage et de décodage de données
WO2022117061A1 (fr) Procédé et dispositif de détermination de bits d'assistant de code polaire
US10581464B2 (en) Encoder device, decoder device, and methods thereof
US11044046B2 (en) Data processing method and apparatus

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: 18781698

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18781698

Country of ref document: EP

Kind code of ref document: A1

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载