WO2018149332A1 - 一种极性码的传输方法和装置 - Google Patents

一种极性码的传输方法和装置 Download PDF

Info

Publication number
WO2018149332A1
WO2018149332A1 PCT/CN2018/075464 CN2018075464W WO2018149332A1 WO 2018149332 A1 WO2018149332 A1 WO 2018149332A1 CN 2018075464 W CN2018075464 W CN 2018075464W WO 2018149332 A1 WO2018149332 A1 WO 2018149332A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
coding
descrambling
bit sequence
polar
Prior art date
Application number
PCT/CN2018/075464
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 华为技术有限公司
Priority to EP18753899.6A priority Critical patent/EP3562045B1/en
Publication of WO2018149332A1 publication Critical patent/WO2018149332A1/zh
Priority to US16/544,529 priority patent/US11057150B2/en

Links

Images

Classifications

    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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/13Linear codes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05Error 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/09Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/3738Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 with judging correct decoding
    • HELECTRICITY
    • H03ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, 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/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/3769Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 using symbol combining, e.g. Chase combining of symbols received twice or more
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041Arrangements at the transmitter end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0052Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/324Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the data link layer [OSI layer 2], e.g. HDLC
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0466Wireless resource allocation based on the type of the allocated resource the resource being a scrambling code
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/30Resource management for broadcast services

Definitions

  • the present application relates to the field of communications technologies, and in particular, to a method and an apparatus for transmitting a polar code.
  • the physical broadcast channel (English: Physical Broadcast Channel, abbreviation: PBCH) carries the main 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 processing procedure of the transmitting end PBCH is as shown in FIG. 1.
  • 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 adopts TBCC (English: Tailing bit convolution coding, Chinese: tail biting convolution coding), 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 processing procedure of the receiving end PBCH is as shown in FIG. 2.
  • 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 transmits the MIB in the first few radio frames within 40 ms by the descrambling successful scrambling code sequence, 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 transmitted in the next 10ms and then decode it until successful decoding.
  • 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 main object of the present application is to provide a transmission method and transmission apparatus and communication apparatus for improving the coding and decoding performance of a Polar code.
  • the present application provides a method for transmitting, the method being applied to a network device, comprising: performing polar Polar coding on a bit sequence to obtain a coding sequence, where the bit sequence includes control information and a cyclic redundancy check. a CRC sequence; fragmenting the coding sequence to obtain n coding subsequences, n being an integer, n>0; scrambling the n coding subsequences and n scrambling sequences respectively to obtain n scrambled a sequence; transmitting the n scrambled sequences using a modulation and mapping operation.
  • the application provides a transmission apparatus, including: an encoding unit, configured to perform polar Polar coding on a bit sequence, to obtain a coding sequence, where the bit sequence includes control information and a cyclic redundancy check CRC sequence; a rate matching unit, configured to slice the coding sequence to obtain n coding subsequences, where n is an integer, n>0; and a scrambling unit, configured to separately separate the n coding subsequences from the n scrambling sequences
  • the scrambling is performed to obtain n scrambled sequences;
  • the processing unit is configured to use the modulation and mapping operations on the n scrambled sequences; and the transmitting unit is configured to send the n scrambled sequences after the modulation mapping.
  • the r coding subsequence and the n scrambling sequences are separately scrambled, specifically including: each of the n coding subsequences An odd-numbered vector and an even-numbered vector of the encoded sub-sequence are XORed with each of the n scrambling sequences, respectively.
  • the n scrambling sequences are carried Bit information.
  • control information is a main information block MIB.
  • the present application provides a communication device, including: a memory for storing a program; a processor for executing the program stored by the memory, when the program is executed, the processor compares The special sequence performs polar Polar coding to obtain a coding sequence, the bit sequence includes control information and a cyclic redundancy check CRC sequence; the coding sequence is sliced to obtain n coding subsequences, n is an integer, n>0 And scrambling the n coding subsequences and the n scrambling sequences respectively to obtain n scrambled sequences; using the modulation and mapping operations for the n scrambled sequences; and transmitting, for transmitting n The post-scrambled sequence after modulation mapping.
  • the present application provides a computer readable storage medium comprising instructions which, when executed on a computer, cause the computer to perform the decoding method as described in the first aspect.
  • the present application provides a method for transmitting, where the method is applied to a terminal, including: receiving, by a terminal, a symbol sequence, where the symbol sequence is obtained by using a Polar code and controlling a scrambling modulation mapping of the control information by the network device; Decoding and demodulating the symbol sequence to obtain a coding sequence; the terminal selecting at least one coding subsequence from the coding sequence; the terminal performing a Polar decoding on the at least one coding subsequence to obtain a bit sequence, the bit sequence including control information and a CRC sequence; the terminal descrambles the bit sequence with at least one descrambling sequence, and the terminal performs a CRC check on the descrambled bit sequence, if the CRC is Pass the test and get control information and timing information.
  • the application provides a transmission apparatus, including: a receiving unit, configured to receive a symbol sequence, where the symbol sequence is obtained by using a Polar code encoding and scrambling a modulation mapping on a control information by a network device; And performing a de-mapping and demodulating the symbol sequence to obtain a coding sequence, further used to select at least one coding sub-sequence from the coding sequence, and a coding unit, configured to perform a Polar decoding on the at least one coding sub-sequence Obtaining a bit sequence, the bit sequence comprising control information and a CRC sequence; a descrambling unit for descrambling the bit sequence with at least one descrambling sequence; and a parity unit for the descrambled bit
  • the sequence is CRC checked, and if the CRC check passes, control information and timing information are obtained.
  • the present application provides a transmission apparatus, including: a receiving unit, configured to receive a symbol sequence, where the symbol sequence is obtained by using a Polar code encoding and a scramble modulation mapping of the control information by the network device; And performing a de-mapping and demodulating the symbol sequence to obtain a coding sequence, further used to select at least one coding sub-sequence from the coding sequence, and a coding unit, configured to perform a Polar decoding on the at least one coding sub-sequence Obtaining a bit sequence, the bit sequence comprising control information and a CRC sequence; a descrambling unit for descrambling the bit sequence with at least one descrambling sequence; and a parity unit for the descrambled bit
  • the sequence is CRC checked, and if the CRC check passes, control information and timing information are obtained.
  • the terminal performs a Polar decoding on the at least one coding subsequence, and specifically includes: the terminal decoding a coding subsequence;
  • the terminal performs a descrambling operation on the bit sequence by using at least one descrambling sequence, and the terminal performs a CRC check on the descrambled bit sequence, specifically: the terminal uses each descrambling sequence of four descrambling sequences.
  • the sequence respectively performs a descrambling operation on the bit sequence, and the terminal performs a CRC check on each descrambled bit sequence, and if the CRC check passes, the control information is obtained;
  • the terminal obtains timing information according to the sequence number of the descrambling sequence passed by the CRC check.
  • the terminal performs a Polar decoding on the at least one coding subsequence, and specifically includes:
  • the terminal performs soft combining on two coding subsequences to obtain a soft combining sequence; the terminal performs Polar decoding on the soft combining sequence;
  • the terminal performs a descrambling operation on the bit sequence by using at least one descrambling sequence, and the terminal performs a CRC check on the descrambled bit sequence, which specifically includes:
  • the terminal performs a descrambling operation on the bit sequence by using two descrambling sequences, and the terminal performs a CRC check on each descrambled bit sequence, and if the CRC check passes, the control information is obtained;
  • the terminal obtains timing information according to the sequence number of the descrambling sequence passed by the CRC check.
  • control information is a main information block MIB.
  • the present application provides a communication device, including: a memory for storing a program; a transceiver for receiving a sequence of symbols, wherein the sequence of symbols is a network device that uses Polar code encoding for control information and scrambles a modulation map And obtaining, by the processor, the program for executing the memory storage, when the program is executed, the processor demaps and demodulates the symbol sequence to obtain a code sequence; from the code sequence Selecting at least one coding subsequence; performing Polar decoding on the at least one coding subsequence to obtain a bit sequence, the bit sequence including control information and a CRC sequence; and descrambling the bit sequence with at least one descrambling sequence And the terminal performs a CRC check on the descrambled bit sequence, and if the CRC check passes, the control information and the timing information are obtained.
  • the present application provides a computer readable storage medium comprising instructions which, when executed on a computer, cause the computer to perform the decoding method as described in the fifth aspect.
  • the descrambling is performed, which reduces the number of decodings and reduces the implementation complexity.
  • FIG. 1 is a process of PBCH processing at the transmitting end in LTE.
  • Figure 3 is a basic flow chart of wireless communication.
  • FIG. 4 is an application scenario diagram of an embodiment of the present application.
  • Figure 5 is a structural diagram of the Arikan Polar code.
  • Fig. 6 is a configuration diagram of a CA Polar code.
  • Fig. 7 is a configuration diagram of a PC Polar code.
  • FIG. 8 is a flowchart of a sending side according to an embodiment of the present application.
  • FIG. 9 is a structural diagram of a virtual device at a transmitting end according to an embodiment of the present application.
  • FIG. 10 is a structural diagram of a physical device at a transmitting end according to an embodiment of the present application.
  • FIG. 11 is a flowchart of a receiving side according to an embodiment of the present application.
  • FIG. 12 is a structural diagram of a virtual device at a receiving end according to an embodiment of the present application.
  • FIG. 13 is a structural diagram of a physical device at a receiving end according to an embodiment of the present application.
  • FIG. 3 is a basic flow of wireless communication.
  • the source is sequentially sent after source coding, channel coding, rate matching, and modulation mapping.
  • the output sink is sequentially demodulated by demodulation, de-rate matching, channel decoding, and source decoding.
  • the channel coding code can use a Polar code. Since the code length of the original Polar code (parent code) is an integer power of 2, in practical applications, a Polar code of arbitrary code length needs to be implemented by rate matching.
  • the sender performs rate matching after channel coding to achieve an arbitrary target code length, and performs de-rate matching on the receiving end before channel decoding.
  • the basic process of the wireless communication also includes additional processes (for example, precoding and interleaving), and since these additional processes are common knowledge to those skilled in the art, they are not enumerated.
  • the CRC sequence and CRC information mentioned in this application are differently referred to as the same thing.
  • a wireless communication system usually consists of a cell, each cell includes a base station (English: Base Station, BS for short), and the base station transmits to multiple mobile stations (English: Mobile Station, referred to as: MS) provides communication services in which the base station is connected to the core network device, as shown in FIG.
  • the base station includes a BBU (English: Baseband Unit, Chinese: Baseband Unit) and an RRU (English: Remote Radio Unit, Chinese: Remote Radio Unit).
  • the BBU and the RRU can be placed in different places, for example, the RRU is pulled away, placed in a high traffic area, and the BBU is placed in the central computer room.
  • BBUs and RRUs can also be placed in the same room.
  • the BBU and RRU can also be different parts under one rack.
  • the wireless communication system mentioned in the embodiments of the present application includes, but is not limited to, a narrowband Internet of Things system (English: Narrow Band-Internet of Things, referred to as NB-IoT), and a global mobile communication system (English: Global System) For Mobile Communications (GSM), Enhanced Data Rate for GSM Evolution (EDGE), Wideband Code Division Multiple Access (WCDMA) , Code Division Multiple Access (English: Code Division Multiple Access, CDMA2000 for short), Time Division-Synchronization Code Division Multiple Access (TD-SCDMA), Long Term Evolution ( English: Long Term Evolution (LTE) and the three major application scenarios of next-generation 5G mobile communication systems, eMBB, URLLC and eMTC.
  • GSM Global System
  • EDGE Enhanced Data Rate for GSM Evolution
  • WCDMA Wideband Code Division Multiple Access
  • CDMA2000 Code Division Multiple Access
  • TD-SCDMA Time Division-Synchronization Code Division Multiple Access
  • LTE Long Term Evolution
  • eMBB next-generation 5
  • the base station is a device deployed in a radio access network to provide a wireless communication function for an MS.
  • the base station may include various forms of macro base stations, micro base stations (also referred to as small stations), relay stations, access points, and the like.
  • the name of a device having a base station function may be different, for example, in an LTE system, an evolved Node B (evolved NodeB, eNB or eNodeB), in the third In the system (English: 3rd Generation, 3G for short), it is called Node B (English: Node B).
  • the foregoing apparatus for providing wireless communication functions to the MS is collectively referred to as a base station or a BS.
  • the MSs involved in the embodiments of the present application may include various handheld devices having wireless communication functions, in-vehicle devices, wearable devices, computing devices, or other processing devices connected to a wireless modem.
  • the MS may also be referred to as a terminal (English: terminal), and may also include a subscriber unit (English: subscriber unit), a cellular phone (English: cellular phone), a smart phone (English: smart phone), a wireless data card, and a personal number.
  • Assistant English: Personal Digital Assistant, PDA for short
  • PDA Personal Digital Assistant
  • tablet computer tablet computer
  • wireless modem English: modem
  • handheld device English: handset
  • laptop English: laptop computer
  • machine type communication English
  • MTC Machine Type Communication
  • the Polar code is also a linear block code whose encoding matrix is G N and the encoding process is among them Is a binary line vector of length N (ie code length); G N is an N ⁇ N matrix, and Defined as the Kronecker product of log 2 N matrices F 2 . Above matrix
  • Polar code A part of the bits are used to carry information, called a set of information bits, and the set of indexes of these bits is recorded as The other part of the bits is set to a fixed value pre-agreed by the transceiver, which is called a fixed bit set or a frozen bit set.
  • G N (A) is the set of G N Cable
  • Sub-matrices obtained from the corresponding rows, G N is the set of G N
  • the construction process of the Polar code is a collection
  • the selection process determines the performance of the Polar code.
  • the construction process of the Polar code is generally: determining that there are N polarized channels in total according to the length N of the mother code, respectively corresponding to N rows of the coding matrix, calculating the reliability of the polarized channel, and the first K polarizations with higher reliability.
  • Channel index as a collection Element
  • the index corresponding to the remaining (NK) polarized channels as the index set of fixed bits Elements. set Determine the location of the information bits, the collection The position of the fixed bit is determined.
  • the original Polar code (parent code) has a code length of 2, which is an integer power of 2, and in practice, a Polar code of arbitrary code length needs to be implemented by rate matching.
  • Polar code In order to improve the performance of the Polar code, the information bit set is first checked and precoded, and then Polar coded.
  • check precoding There are two common types of check precoding, namely CRC (Chinese: Cyclic Redundancy Check) cascading Polar code, or PC (Chinese: Parity Check, English: Parity Check) cascading Polar code.
  • CRC Cyclic Redundancy Check
  • PC Choinese: Parity Check, English: Parity Check
  • Polar encoding includes: Airkan traditional Polar encoding and CA Polar encoding and PC Polar encoding.
  • the Polar coding and decoding method and the coding and decoding apparatus involved in the present application may be conventional Polar coding, CA Polar coding or PC Polar coding.
  • ⁇ u1, u2, u3, u5 ⁇ is set as a fixed bit set
  • ⁇ u4, u6, u7, u8 ⁇ is set as an information bit set
  • 4 in the information vector of length 4 is set.
  • the bit information bits are encoded into 8-bit coded bits.
  • ⁇ u1, u2 ⁇ is set as a fixed bit set
  • ⁇ u3, u4, u5, u6 ⁇ is set as a set of information bits
  • ⁇ u7, u8 ⁇ is a set of CRC bits.
  • the value of ⁇ u7, u8 ⁇ is obtained by CRC of ⁇ u3, u4, u5, u6 ⁇ .
  • CA-SCL International: CRC-Aided Successive Cancellation List
  • the CA-SCL decoding algorithm selects the path through which the CRC passes as the decoding output in the candidate path of the SCL decoding output by the CRC check.
  • ⁇ u1, u2, u5 ⁇ is set as a fixed bit set
  • ⁇ u3, u4, u6, u7 ⁇ is set as an information bit set
  • ⁇ u7 ⁇ is a PC fixed bit set.
  • the value of ⁇ u7 ⁇ is obtained by X0, u6 ⁇ XOR.
  • the present application provides a transmission method that can be applied to a network device, such as the base station in FIG. Figure 8 is a flow chart of the transmission method, the specific steps are as follows:
  • Step 310 Perform polar Polar coding on the bit sequence to obtain a coding sequence, where the bit sequence includes control information and a cyclic redundancy check CRC sequence.
  • Step 320 Fragment the coding sequence to obtain n coding subsequences, where n is an integer, n>0;
  • Step 330 scrambling the n coding subsequences and the n scrambling sequences respectively to obtain n scrambled sequences;
  • Step 340 Send the n scrambled sequences by using a modulation and mapping operation.
  • bit sequence in step 310 is a vector to be encoded of Polar, and steps 310 and 330 can be exchanged.
  • the bit sequence can be first coded and then scrambled, or the bit sequence can be added first. The scrambling slice is re-encoded.
  • the transmission device 600 shown in FIG. 9 can implement the processes of steps 310-340 and the like.
  • the encoding unit 610 is configured to perform step 310
  • the rate matching unit 620 is configured to perform step 320
  • the scrambling unit 630 is configured to perform the scrambling process of step 330
  • the processing unit 640 is configured to perform the modulation and mapping process in step 340.
  • the sending unit 650 is configured to perform the sending process of the n modulated and mapped scrambled sequences in step 340.
  • the transmission device is, for example, a base station BS or a mobile station MS, and the transmission device may also be an application specific integrated circuit (ASIC: ASIC) or a digital signal processor (English: Digital Signal Processor). : DSP) or chip.
  • ASIC application specific integrated circuit
  • DSP Digital Signal Processor
  • n includes the following implementations:
  • p is the last element with a value of 1, and all other vectors are 0, which can be understood as a scrambling sequence.
  • both p and 0 are vectors of length N, and N is the length of the mother code of the Polar code.
  • the position of the element of 1 in p is the position of the information bit in the vector to be encoded in the Polar.
  • the network device uses the above coding characteristics to transmit x, -x at two timings, and carries 1-bit timing information.
  • step 330 is as follows: the odd-numbered vector and the even-numbered vector of each of the four coding sub-sequences are different from each of the four scrambling sequences, respectively. Or operation.
  • the four scrambling sequences are [0,0], [1,1], [0,1], [1,0].
  • Each of the scrambling sequences has a length of N, the first coefficient in [] represents an even-numbered vector of N elements, and the second coefficient in [] represents an odd-numbered vector of N elements.
  • the scrambling process of encoding the subsequence x and the 4 scrambling sequences is as shown in the following formula:
  • p 0 , p 1 , p 2 , and p 3 are scrambling sequences before encoding.
  • [0, 0], [0, 1], [1, 1], [1, 0] are encoded scrambling sequences.
  • the bit sequence is first scrambled and re-encoded with p 0 , p 1 , p 2 , p 3 , and the bit sequence is first encoded and then [0, 0], [0, 1], [1, 1], [1, 0] Scrambling, the technical effect achieved is the same.
  • u is the bit sequence in step 310, and the values of the two bits in u are flipped arbitrarily, which is equivalent to adding a scrambling vector to u, denoted as p 0 , p 1 , p 2 , p 3 , corresponding After encoding, the corresponding symbol flip will appear.
  • the bit of 1 in p 0 , p 1 , p 2 , p 3 is the position of the information bits in the Polar to-be-coded vector.
  • flipping two bits accordingly produces four cases, so that the network device additionally carries 2 bits of timing information in the transmitted scrambled sequence.
  • u A is the information bit in the Polar to-be-coded vector
  • u A can be CRC-checked according to the rule. Any one of the p iA descrambled according to the above rules cannot pass the CRC check, and p iA is the bit located in the information bit position in the P i vector.
  • control information in step 310 is a main information block MIB.
  • the four scrambling sequences carry 2-bit information, and the 2-bit information may be the lower two bits of the system frame number (SFN).
  • SFN system frame number
  • the present application also provides a communication device 900.
  • the communication device can be a base station or a terminal, or a DSP or ASIC or chip that implements a related decoding function.
  • the communication device 900 includes:
  • the memory 902 is configured to store a program, where the memory may be a RAM (English: Random Access Memory) or a ROM (English: Read Only Memory) or a flash memory, where the memory may be located. It may be located in the communication device alone or in the interior of the processor 903.
  • a processor 903 configured to execute the program stored in the memory, when the program is executed, the processor performs polar Polar coding on the bit sequence to obtain a coding sequence, where the bit sequence includes control information and a loop Redundantly checking the CRC sequence; fragmenting the coding sequence to obtain n coding subsequences, n being an integer, n>0; scrambling the n coding subsequences and n scrambling sequences respectively to obtain n a scrambled sequence; the n scrambled sequences are subjected to modulation and mapping operations.
  • the transceiver 901 is configured to send the scrambled sequence after the n modulation mappings.
  • the transceiver 901, the memory 902, and the processor 903 are connected by a bus 904.
  • n scrambling sequences are newly defined, and the n scrambling sequences are additionally added.
  • the present application provides a transmission method that can be applied to a terminal device, such as MS1-MS2 in FIG. Figure 11 is a flow chart of the transmission method, the specific steps are as follows:
  • Step 410 The terminal receives a symbol sequence, where the symbol sequence is obtained by using a Polar code for the control information and scrambling the modulation mapping.
  • Step 420 The terminal demaps and demodulates the symbol sequence to obtain a coding sequence.
  • Step 430 The terminal selects at least one coding subsequence from the coding sequence.
  • Step 440 The terminal performs a Polar decoding on the at least one coding subsequence to obtain a bit sequence, where the bit sequence includes control information and a CRC sequence.
  • Step 450 The terminal performs a descrambling operation on the bit sequence by using at least one descrambling sequence, and the terminal performs a CRC check on the descrambled bit sequence. If the CRC check passes, the control information and the timing information are obtained.
  • the transmission device 700 shown in FIG. 12 can implement the processes of step 410 to step 450 and the like.
  • the receiving unit 710 is configured to perform step 410
  • the processing unit 720 is configured to perform steps 420 and 430
  • the decoding unit 730 is configured to perform the decoding process of step 440
  • the descrambling unit 740 is configured to perform the descrambling process in step 450.
  • the verification unit 750 is configured to perform the verification process in step 450.
  • the transmission device is, for example, a mobile station MS or a base station BS, and the transmission device may also be an application specific integrated circuit (ASIC) or a digital signal processor (English: Digital Signal Processor). : DSP) or chip.
  • ASIC application specific integrated circuit
  • DSP Digital Signal Processor
  • steps 430-450 include at least the following implementations.
  • the number of coding subsequences selected by the terminal is 1-4.
  • Embodiments 1 and 2 are for the case where the descrambling sequence is two, and Embodiments 3 and 4 are for the case where the descrambling sequence is four.
  • Implementation 1 The terminal decodes a coding subsequence; the terminal separately descrambles the bit sequence with each descrambling sequence of 2 descrambling sequences, and the terminal performs descrambling after each time The bit sequence is subjected to CRC check. If the CRC check passes, control information is obtained; the terminal obtains timing information according to the sequence number of the descrambling sequence passed by the CRC check.
  • the receiving end receives y, -y, whether it receives y or -y, it can decode first, then use 0 and p to perform descrambling operation respectively, and test whether CRC passes, to determine what is actually received.
  • Y is still -y.
  • Implementation 2 The terminal receives two LLR sub-sequences, performs soft combining and then performs decoding.
  • the terminal performs a descrambling operation on the decoding result with 0 and p respectively, and tests whether the CRC passes, to determine whether the input decoder is y or -y.
  • Embodiment 3 the terminal decodes a coding subsequence; the terminal separately descrambles the bit sequence with each descrambling sequence of 4 descrambling sequences, and the terminal performs descrambling after each time The bit sequence is subjected to CRC check. If the CRC check passes, control information is obtained; the terminal obtains timing information according to the sequence number of the descrambling sequence passed by the CRC check.
  • the coding subsequence is an LLR (English: Log Likelihood Ratio) subsequence
  • the terminal decodes the coding subsequence Polar to obtain a bit sequence.
  • the terminal continues to descramble the bit sequence with the four descrambling sequences p 0 , p 1 , p 2 , p 3 respectively, and then performs CRC check. If the CRC check fails, the next round of descrambling and CRC check is performed. operating. Therefore, the maximum number of check times of the CRC check is 4, and the minimum number of check times is 1.
  • the 4 descrambling sequences carry 2 bits of timing information, and the terminal obtains time series information according to the sequence number of the descrambling sequence passed by the CRC check.
  • Implementation 4 the terminal performs soft combining on two coding subsequences to obtain a soft combining sequence; the terminal performs a Polar decoding on the soft combining sequence to obtain a bit sequence; and the terminal uses two descrambling sequences respectively Performing a descrambling operation on the bit sequence, and the terminal performs a CRC check on each descrambled bit sequence, and if the CRC check passes, obtains control information; the sequence number of the descrambling sequence that the terminal passes according to the CRC check , get timing information.
  • the coding subsequence is an LLR subsequence, assuming two LLR subsequences received by the terminal.
  • the blind check 1 operation is performed.
  • the two LLR subsequences received by the terminal may include the second or fourth LLR subsequence, and the terminal inverts the odd bits of the previous LLR subsequence.
  • the blind check 2 operation is performed.
  • the terminal if the LLR subsequence received by the terminal may include the third LLR subsequence, the terminal inverts the even bit of the previous LLR subsequence and the current LLR.
  • the subsequences are soft combined, then Polar decoded, descrambled with sequence p 2 , and CRC checked to determine if it is the current timing.
  • control information in step 440 is a main information block MIB.
  • the present application also provides a communication device 1000.
  • the communication device can be a base station or a terminal, or a DSP or ASIC or chip that implements a related decoding function.
  • the communication device 1000 includes:
  • the memory 1002 is configured to store a program, where the memory may be a RAM (English: Random Access Memory) or a ROM (English: Read Only Memory) or a flash memory, where the memory may be located. It may be located in the communication device alone or in the interior of the processor 1003.
  • a RAM Random Access Memory
  • ROM Read Only Memory
  • flash memory where the memory may be located. It may be located in the communication device alone or in the interior of the processor 1003.
  • the transceiver 1001 is configured to receive a symbol sequence, where the symbol sequence is obtained by using a Polar code encoding and scrambling the modulation mapping on the control information by the network device;
  • a processor 1003 configured to execute the program stored by the memory, when the program is executed, the processor demaps and demodulates the symbol sequence to obtain a code sequence; and selects at least the code sequence from the code sequence a coding subsequence; performing Polar decoding on the at least one coding subsequence to obtain a bit sequence, the bit sequence including control information and a CRC sequence; descrambling the bit sequence with at least one descrambling sequence, and The terminal performs a CRC check on the descrambled bit sequence, and if the CRC check passes, the control information and the timing information are obtained.
  • the transceiver 1001, the memory 1002, and the processor 1003 are connected by a bus 904.
  • the encoding and decoding features of the Polar code are utilized, and the LLR subsequence is received by the receiving side, and the decoding is performed after the Polar decoding, thereby reducing the decoding times and reducing the implementation complexity.
  • the computer program product includes one or more computer instructions.
  • 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 By wired (for example, coaxial cable, optical fiber, digital subscriber line (DSL), or wireless (such as infrared, wireless, microwave, etc.) to another website, computer, server or data center transmission.
  • 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 (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a DVD (English: Digital Video Disk)), or a semiconductor medium.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Error Detection And Correction (AREA)

Abstract

本申请公开了一种传输方法和传输装置和通信设备,其中,该传输方法包括:将比特序列进行极性Polar编码,得到编码序列,该比特序列包含控制信息和循环冗余校验CRC序列;将该编码序列分片,得到n个编码子序列,n为整数,n>0;将n个编码子序列与n个加扰序列分别加扰,得到n个加扰后序列。该传输方法利用Polar码的编译码特点,新定义了n个加扰序列,通过n个加扰序列额外携带了┌ log2n ┐个比特的信息。采用上述编码方法,节省信令开销。

Description

一种极性码的传输方法和装置 技术领域
本申请涉及通信技术领域,尤其涉及一种极性码的传输方法和装置。
背景技术
长期演进(英文:Long Term Evolution,缩写:LTE)系统中,物理广播信道(英文:Physical Broadcast Channel,缩写:PBCH)承载主信息块(英文:Master Information Block,缩写:MIB)。其中,MIB的长度为24比特,MIB包含下行链路系统带宽,PHICH(英文:Physical Hybrid ARQ Indicator Channel,中文:物理混合自动重传请求指示信道)大小,以及系统帧号(英文:System Frequency Number,简称:SFN)的高八位等内容。发送端PBCH的处理过程如图1所示。基站首先对要发送的MIB进行循环冗余校验(英文:Cyclical Redundancy Check,缩写:CRC)编码,得到16位CRC序列,然后基站将40比特长的序列(包含24bits的MIB和16bits的CRC)进行信道编码以及速率匹配后得到编码序列,将该编码序列分段得到4个大小相等的PBCH独立单元,将4个PBCH独立单元采用4个扰码序列进行分别加扰,基站完成加扰后续的调制、映射和发送流程。
其中,PBCH的信道编码采用TBCC(英文:Tailing bit convolution coding,中文:咬尾卷积编码),4个扰码序列采用不同的相位。4个PBCH独立单元携带相同的编码比特,4个PBCH独立单元执行加扰、调制以及映射等流程后在40ms(4个无线帧的传输时间,每个无线帧10ms)的时间窗口内发送。
接收端PBCH的处理过程如图2所示。由发送端描述可知,4个PBCH独立单元携带相同的编码比特,因此信道质量足够好的情况下,接收端只接收40ms内的一个PBCH独立单元就成功完成解扰、译码以及CRC校验的操作。由于接收端通过解扰成功的扰码序列,得到发送端是在40ms内的第几个无线帧发送MIB,即知道了SFN的低2位。
对于信道质量较差的情况,接收端如果只接收一个PBCH独立单元不能成功解扰译码,就与下一个10ms发送的PBCH独立单元进行软合并再进行译码,直到成功解码。
在第五代(5th Generation,5G)通信系统以及后续更多可能的通信系统中定义了三大类场景,分别为增强移动宽带(英文:enhanced Mobile Broadband,简称:eMBB),超可靠低延时通信(英文:Ultra Reliable Low Latency Communications,简称:URLLC)和大规模物联网通信(英文:massive Machine Type Communications,缩写:mMTC)。其中,eMBB业务主要包含超高清视频、增强现实AR、虚拟现实VR等等,主要特点是传输数据量大、传输速率很高。URLLC业务主要是用于物联网中的工业控制、无人驾驶等,主要特点是超高可靠性、低延时,传输数据量较少以及具有突发性。mMTC业务主要是用于物联网中的智能电网、智慧城市等,主要特点是海量设备连接、传输数据量小、容忍较长时间的延时。
在3GPP(英文:3rd Generation Partnership Project,中文:第三代合作伙伴计划)RAN1(英文:Radio Access Network,中文:无线接入网)87次会议上,极性Polar码正式接收为5G eMBB(英文:enhanced Mobile Broadband)场景的上下行控制信道的信道编码方案。将极性码应用于PBCH的信道编码,存在改进的空间。
发明内容
有鉴于此,本申请的主要目的是提供一种传输方法和传输装置和通信设备,用于改善 Polar码的编译译码性能。
第一方面,本申请提供了一种传输的方法,所述方法应用于网络设备,包括:将比特序列进行极性Polar编码,得到编码序列,所述比特序列包含控制信息和循环冗余校验CRC序列;将所述编码序列分片,得到n个编码子序列,n为整数,n>0;将所述n个编码子序列与n个加扰序列分别加扰,得到n个加扰后序列;将所述n个加扰后序列采用调制和映射操作后发送。
第二方面,本申请提供了一种传输的装置,包括:编码单元,用于将比特序列进行极性Polar编码,得到编码序列,所述比特序列包含控制信息和循环冗余校验CRC序列;速率匹配单元,用于将所述编码序列分片,得到n个编码子序列,n为整数,n>0;加扰单元,用于将所述n个编码子序列与n个加扰序列分别加扰,得到n个加扰后序列;处理单元,用于将所述n个加扰后序列采用调制和映射操作;发送单元,用于发送调制映射后的n个加扰后序列。
结合第一方面和第二方面,在一种可能的设计中,所述将所述n个编码子序列与n个加扰序列分别加扰,具体包括:所述n个编码子序列中每个编码子序列的奇数序号向量和偶数序号向量分别与所述n个加扰序列中每个加扰序列进行异或操作。
结合第一方面和第二方面,在一种可能的设计中,所述n个加扰序列携带
Figure PCTCN2018075464-appb-000001
个比特的信息。
结合第一方面和第二方面,在一种可能的设计中,所述控制信息为主信息块MIB。
第三方面,本申请提供了一种通信设备,包括:存储器,用于存储程序;处理器,用于执行所述存储器存储的所述程序,当所述程序被执行时,所述处理器对比特序列进行极性Polar编码,得到编码序列,所述比特序列包含控制信息和循环冗余校验CRC序列;将所述编码序列分片,得到n个编码子序列,n为整数,n>0;将所述n个编码子序列与n个加扰序列分别加扰,得到n个加扰后序列;将所述n个加扰后序列采用调制和映射操作;收发器,用于发送n个调制映射后的加扰后序列。
第四方面,本申请提供了一种计算机可读存储介质,包括指令,当其在计算机上运行时,使得计算机执行如第一方面所述的译码方法。
第五方面,本申请提供了一种传输的方法,所述方法应用于终端,包括:终端接收符号序列,所述符号序列是网络设备对控制信息采用Polar码编码并且加扰调制映射后得到;所述终端对所述符号序列进行解映射解调后得到编码序列;所述终端从所述编码序列选取至少一个编码子序列;所述终端对所述至少一个编码子序列进行Polar译码,得到比特序列,所述比特序列包括控制信息和CRC序列;所述终端用至少一个解扰序列对所述比特序列进行解扰操作,并且终端对解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息和时序信息。
第五方面,本申请提供了一种传输的装置,包括:接收单元,用于接收符号序列,所述符号序列是网络设备对控制信息采用Polar码编码并且加扰调制映射后得到;处理单元,用于对所述符号序列进行解映射解调后得到编码序列,还用于从所述编码序列选取至少一个编码子序列;译码单元,用于对所述至少一个编码子序列进行Polar译码,得到比特序列, 所述比特序列包括控制信息和CRC序列;解扰单元,用于采用至少一个解扰序列对所述比特序列进行解扰操作;校验单元,用于对解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息和时序信息。
第六方面,本申请提供了一种传输的装置,包括:接收单元,用于接收符号序列,所述符号序列是网络设备对控制信息采用Polar码编码并且加扰调制映射后得到;处理单元,用于对所述符号序列进行解映射解调后得到编码序列,还用于从所述编码序列选取至少一个编码子序列;译码单元,用于对所述至少一个编码子序列进行Polar译码,得到比特序列,所述比特序列包括控制信息和CRC序列;解扰单元,用于采用至少一个解扰序列对所述比特序列进行解扰操作;校验单元,用于对解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息和时序信息。
结合第五方面和第六方面,在一种可能的设计中,所述终端对所述至少一个编码子序列进行Polar译码,具体包括:所述终端对一个编码子序列进行译码;
所述终端用至少一个解扰序列对所述比特序列进行解扰操作,并且终端对解扰后的比特序列做CRC校验,具体包括:所述终端用4个解扰序列的每个解扰序列分别对所述比特序列进行解扰操作,并且终端对每次解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息;
所述终端根据CRC校验通过的解扰序列的序号,得到时序信息。
结合第五方面和第六方面,在一种可能的设计中,所述终端对所述至少一个编码子序列进行Polar译码,具体包括:
所述终端对两个编码子序列进行软合并,得到软合并序列;所述终端对所述软合并序列进行Polar译码;
所述终端用至少一个解扰序列对所述比特序列进行解扰操作,并且终端对解扰后的比特序列做CRC校验,具体包括:
所述终端用2个解扰序列分别对所述比特序列进行解扰操作,并且终端对每次解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息;
所述终端根据CRC校验通过的解扰序列的序号,得到时序信息。
结合第五方面和第六方面,在一种可能的设计中,所述控制信息为主信息块MIB。
第七方面,本申请提供了一种通信设备,包括:存储器,用于存储程序;收发器,用于接收符号序列,所述符号序列是网络设备对控制信息采用Polar码编码并且加扰调制映射后得到;处理器,用于执行所述存储器存储的所述程序,当所述程序被执行时,所述处理器对所述符号序列进行解映射解调后得到编码序列;从所述编码序列选取至少一个编码子序列;对所述至少一个编码子序列进行Polar译码,得到比特序列,所述比特序列包括控制信息和CRC序列;用至少一个解扰序列对所述比特序列进行解扰操作,并且终端对解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息和时序信息。
第八方面,本申请提供了一种计算机可读存储介质,包括指令,当其在计算机上运行时,使得计算机执行如第五方面所述的译码方法。
Figure PCTCN2018075464-appb-000002
先Polar译码后解扰,减少译码次数,降低实现复杂度。
附图说明
图1为LTE中发送端PBCH处理的过程。
图2为LTE中接收端PBCH处理的过程。
图3为无线通信的基本流程图。
图4为本申请实施例的应用场景图。
图5为Arikan Polar码的构造示图。
图6为CA Polar码的构造示图。
图7为PC Polar码的构造示图。
图8为本申请实施例的发送侧流程图。
图9为本申请实施例的发送端的虚拟装置结构图。
图10为本申请实施例的发送端的实体装置结构图。
图11为本申请实施例的接收侧流程图。
图12为本申请实施例的接收端的虚拟装置结构图。
图13为本申请实施例的接收端的实体装置结构图。
具体实施方式
下面结合附图对本申请具体实施例作进一步的详细描述。
图3是无线通信的基本流程,在发送端,信源依次经过信源编码、信道编码、速率匹配和调制映射后发出。在接收端,依次通过解调解映射、解速率匹配、信道译码和信源译码输出信宿。信道编译码可以采用Polar码,由于原始Polar码(母码)的码长为2的整数次幂,在实际应用中需要通过速率匹配实现任意码长的Polar码。发送端在信道编码后进行速率匹配实现任意的目标码长,在接收端,信道解码之前先进行解速率匹配。需要说明的是,无线通信的基本流程还包括额外流程(例如:预编码和交织),鉴于这些额外流程对于本领域技术人员而言是公知常识,不再一一列举。本申请中提到的CRC序列和CRC信息同一事物的不同称呼。
本申请实施例可以应用于无线通信系统,无线通信系统通常由小区组成,每个小区包含一个基站(英文:Base Station,简称:BS),基站向多个移动台(英文:Mobile Station,简称:MS)提供通信服务,其中基站连接到核心网设备,如图4所示。其中基站包含BBU(英文:Baseband Unit,中文:基带单元)和RRU(英文:Remote Radio Unit,中文:远端射频单元)。BBU和RRU可以放置在不同的地方,例如:RRU拉远,放置于高话务量的区域,BBU放置于中心机房。BBU和RRU也可以放置在同一机房。BBU和RRU也可以为一个机架下的不同部件。
需要说明的是,本申请实施例提及的无线通信系统包括但不限于:窄带物联网系统(英文:Narrow Band-Internet of Things,简称:NB-IoT)、全球移动通信系统(英文:Global System for Mobile Communications,简称:GSM)、增强型数据速率GSM演进系统(英文:Enhanced Data rate for GSM Evolution,简称:EDGE)、宽带码分多址系统(英文:Wideband Code  Division Multiple Access,简称:WCDMA)、码分多址2000系统(英文:Code Division Multiple Access,简称:CDMA2000)、时分同步码分多址系统(英文:Time Division-Synchronization Code Division Multiple Access,简称:TD-SCDMA),长期演进系统(英文:Long Term Evolution,简称:LTE)以及下一代5G移动通信系统的三大应用场景eMBB,URLLC和eMTC。
本申请实施例中,所述基站是一种部署在无线接入网中为MS提供无线通信功能的装置。所述基站可以包括各种形式的宏基站,微基站(也称为小站),中继站,接入点等。在采用不同的无线接入技术的系统中,具备基站功能的设备的名称可能会有所不同,例如,在LTE系统中,称为演进的节点B(evolved NodeB,eNB或者eNodeB),在第三代(英文:3rd Generation,简称:3G)系统中,称为节点B(英文:Node B)等。为方便描述,本申请所有实施例中,上述为MS提供无线通信功能的装置统称为基站或BS。
本申请实施例中所涉及到的MS可以包括各种具有无线通信功能的手持设备、车载设备、可穿戴设备、计算设备或连接到无线调制解调器的其它处理设备。所述MS也可以称为终端(英文:terminal),还可以包括用户单元(英文:subscriber unit)、蜂窝电话(英文:cellular phone)、智能手机(英文:smart phone)、无线数据卡、个人数字助理(英文:Personal Digital Assistant,简称:PDA)电脑、平板型电脑、无线调制解调器(英文:modem)、手持设备(英文:handset)、膝上型电脑(英文:laptop computer)、机器类型通信(英文:Machine Type Communication,简称:MTC)终端等。为方便描述,本申请所有实施例中,上面提到的设备统称为MS。
下面对Polar码做简单介绍。
通信系统通常采用信道编码提高数据传输的可靠性,以保证通信的质量。土耳其教授Arikan提出的Polar码是第一个理论上证明可以达到香农容量且具有低编译码复杂度的码。
Polar码也是一种线性块码,其编码矩阵为G N,编码过程为
Figure PCTCN2018075464-appb-000003
其中
Figure PCTCN2018075464-appb-000004
是一个二进制的行矢量,长度为N(即码长);G N是一个N×N的矩阵,且
Figure PCTCN2018075464-appb-000005
定义为log 2N个矩阵F 2的克罗内克(Kronecker)乘积。上述矩阵
Figure PCTCN2018075464-appb-000006
Polar码的编码过程中,
Figure PCTCN2018075464-appb-000007
中的一部分比特用来携带信息,称为信息比特集合,这些比特的索引的集合记作
Figure PCTCN2018075464-appb-000008
另外的一部分比特设置为收发端预先约定的固定值,称之为固定比特集合或冻结比特集合(frozen bits),其索引的集合用
Figure PCTCN2018075464-appb-000009
的补集
Figure PCTCN2018075464-appb-000010
表示。Polar码的编
码过程相当于:
Figure PCTCN2018075464-appb-000011
这里,G N(A)是G N中由集合
Figure PCTCN2018075464-appb-000012
中的索
引对应的那些行得到的子矩阵,G N(A C)是G N中由集合
Figure PCTCN2018075464-appb-000013
中的索引对应的那些行得到的子矩阵。
Figure PCTCN2018075464-appb-000014
Figure PCTCN2018075464-appb-000015
中的信息比特集合,数量为K;
Figure PCTCN2018075464-appb-000016
Figure PCTCN2018075464-appb-000017
中的固定比特集合,其数量为(N-K),是已知比特。这些固定比特通常被设置为0,但是只要收发端预先约定,固定比
Figure PCTCN2018075464-appb-000018
息块大小,
Figure PCTCN2018075464-appb-000019
是矩阵G N中由集合
Figure PCTCN2018075464-appb-000020
中的索引对应的那些行得到的子矩阵,
Figure PCTCN2018075464-appb-000021
是一个K×N的矩阵。
Polar码的构造过程即集合
Figure PCTCN2018075464-appb-000022
的选取过程,决定了Polar码的性能。Polar码的构造过程通常是,根据母码码长N确定共存在N个极化信道,分别对应编码矩阵的N个行,计算极化信道可靠度,将可靠度较高的前K个极化信道的索引作为集合
Figure PCTCN2018075464-appb-000023
的元素,剩余(N-K)个极化信道对应的索引作为固定比特的索引集合
Figure PCTCN2018075464-appb-000024
的元素。集合
Figure PCTCN2018075464-appb-000025
决定了信息比特的位置,集合
Figure PCTCN2018075464-appb-000026
决定了固定比特的位置。
从编码矩阵可以看出,原始Polar码(母码)的码长为2的整数次幂,在实际应用中需要通过速率匹配实现任意码长的Polar码。
为了提升Polar码的性能,通常对信息比特集合先进行校验预编码,再进行Polar编码。有两种常见的校验预编码方式,即CRC(中文:循环冗余校验,英文:Cyclic Redundancy Check)级联Polar编码,或是PC(中文:奇偶校验,英文:Parity Check)级联Polar编码。目前,Polar编码包括:Airkan传统Polar编码和CA Polar编码和PC Polar编码。本申请中涉及的Polar编码译码方法和编码译码装置,可以采用传统Polar编码、CA Polar编码或PC Polar编码。
对图5中Airkan传统Polar编码说明,{u1,u2,u3,u5}设置为固定比特集合,{u4,u6,u7,u8}设置为信息比特集合,将长度为4的信息向量中的4位信息比特编码成8位编码比特。
对图6中CA Polar编码说明,{u1,u2}设置为固定比特集合,{u3,u4,u5,u6}设置为信息比特集合,{u7,u8}为CRC比特集合。其中,{u7,u8}的值由{u3,u4,u5,u6}做CRC得到。
对于CA Polar编码,采用CA-SCL(英文:CRC-Aided Successive Cancellation List,中文:CRC协助的串行抵消列表)译码算法。CA-SCL译码算法通过CRC校验在SCL译码输出的候选路径中选择CRC通过的路径作为译码输出。
对图7中PC Polar编码说明,{u1,u2,u5}设置为固定比特集合,{u3,u4,u6,u7}设置为信息比特集合,{u7}为PC固定比特集合。其中,{u7}的值由{u3,u6}异或得到。
本申请提供了一种传输方法,该传输方法可以应用于网络设备,例如:图4中的基站。图8是该传输方法的流程图,具体步骤如下:
步骤310:将比特序列进行极性Polar编码,得到编码序列,所述比特序列包含控制信息和循环冗余校验CRC序列;
步骤320:将所述编码序列分片,得到n个编码子序列,n为整数,n>0;
步骤330:将所述n个编码子序列与n个加扰序列分别加扰,得到n个加扰后序列;
步骤340:将所述n个加扰后序列采用调制和映射操作后发送。
需要说明的是,步骤310中的比特序列为Polar的待编码向量,步骤310和330可以调换,本申请的传输方法,可以把比特序列先编码分片再加扰,也可以把比特序列先加扰分片再编码。
需要说明的是,图9所示的传输装置600可以实现步骤310-步骤340等过程。其中,编码单元610用于执行步骤310,速率匹配单元620用于执行步骤320,加扰单元630用于执行步骤330的加扰过程,处理单元640用于执行步骤340中的调制和映射过程,发送单元650用于执行步骤340中的将n个调制和映射后的加扰后序列的发送过程。该传输装置例如为基站BS或移动台MS,该传输装置也可以为实现相关功能的专用集成电路(英文:Application Specific Integrated Circuit,简称:ASIC)或者数字信号处理器(英文:Digital Signal Processor,简称:DSP)或者芯片。
需要说明的是,n个加扰后序列采用调制和映射操作后在不同的时序发送。n的取值包括以下实现方式:
实现方式1(n=2):以下内容基于先加扰分片再编码的步骤展开。根据Polar编码矩阵,任意翻转比特序列u中一个bit,编码子序列x中相应的bit会发生翻转。假设翻转u中最后一个比特,则x变成-x。相当于:
Figure PCTCN2018075464-appb-000027
Figure PCTCN2018075464-appb-000028
p是最后一个元素为1,其它全为0的向量,可以理解为加扰序列。本申请中,p和0都是长度为N的向量,N为Polar码的母码长度。p中为1的元素的位置为Polar待编码向量u中信息比特的位置。
利用上述编码特性,网络设备在两个时序分别发送x,-x,携带1比特的时序信息。
实现方式2(n=4):
需要说明的是,步骤330的具体过程如下:所述4个编码子序列中每个编码子序列的奇数序号向量和偶数序号向量分别与所述4个加扰序列中每个加扰序列进行异或操作。
举例说明:假定其中一个编码子序列为x,序列长为N,序列x的偶数序号向量为x 0, 序列x的奇数序号向量为x 1。x 0={x(0),x(2)...,x(N-2)},x 1={x(1),x(3)...,x(N-1)}。
4个加扰序列为[0,0],[1,1],[0,1],[1,0]。其中每个加扰序列的长度为N,[]中的第一个系数表示N个元素中的偶数序号向量,[]中的第二个系数表示N个元素中的奇数序号向量。编码子序列x与4个加扰序列的加扰过程,如下面公式所示:
Figure PCTCN2018075464-appb-000029
Figure PCTCN2018075464-appb-000031
Figure PCTCN2018075464-appb-000032
其中,p 0,p 1,p 2,p 3为编码前的加扰序列。在本申请中,[0,0],[0,1],[1,1],[1,0]为编码后的加扰序列。对比特序列先用p 0,p 1,p 2,p 3加扰再编码,与对比特序列先编码再用[0,0],[0,1],[1,1],[1,0]加扰,达到的技术效果相同。
其中,p 0,p 1,p 2,p 3分别为:
p 0=[0 L 0 0],
p 1=[0 L 1 1],
p 2=[0 L 0 1],
p 3=[0 L 1 0]
其中,u为步骤310中的比特序列,任意翻转u中两个bit的值,相当于在u上分别加上一个加扰向量,记为p 0,p 1,p 2,p 3,相应的编码后会呈现出相应的符号翻转。本申请中,p 0,p 1,p 2,p 3中为1的比特为Polar待编码向量中信息比特的位置。此外,翻转两个比特相应产生四种情况,使网络设备在发送的加扰后序列额外携带了2比特的时序信息。
需要说明的是,多个时序中的多个加扰向量集合{P i}(i=0,1,2...n),除了实现方式1(n=2)和实现方式2(n=4)给出的例子外,还包括其他实现方式,只要实现方式满足以下条件:
1)不同时序对应的加扰向量P i互不相同。
2)P i向量中为1的元素仅出现在Polar待编码向量u的信息比特的位置。
3)PBCH中携带的MIB信息以及CRC通过规则串接构成u A,u A为Polar待编码向量中的信息比特,u A按照该规则解串接能够通过CRC校验。任何一个p iA按照上述规则解串接都不能通过CRC校验,p iA为P i向量中位于信息比特位置的比特。
可选地,步骤310中的控制信息为主信息块MIB。
可选地,所述4个加扰序列携带2比特的信息,该2比特的信息可以是系统帧号(SFN)的低两位信息。
如图10所示,本申请还提供了一种通信设备900。该通信设备可以为基站或终端,或者实现相关译码功能的DSP或ASIC或芯片。该通信设备900包括:
存储器902,用于存储程序;其中,该存储器可以为RAM(英文:Random Access Memory,中文:随机访问内存)或者ROM(英文:Read Only Memory,中文:只读内存)或者闪存,其中存储器可以位于单独位于通信设备内,也可以位于处理器903的内部。
处理器903,用于执行所述存储器存储的所述程序,当所述程序被执行时,所述处理器对比特序列进行极性Polar编码,得到编码序列,所述比特序列包含控制信息和循环冗余校验CRC序列;将所述编码序列分片,得到n个编码子序列,n为整数,n>0;将所述n个编码子序列与n个加扰序列分别加扰,得到n个加扰后序列;将所述n个加扰后序列采用调制和映射操作。
收发器901,用于发送n个调制映射后的加扰后序列。
收发器901、存储器902和处理器903之间通过总线904连接。
需要说明的是,处理器执行的方法与前述内容一致,不再赘述。
本实施例利用Polar码的编译码特点,新定义了n个加扰序列,通过n个加扰序列额外
携带了
Figure PCTCN2018075464-appb-000033
个比特的信息,采用上述编码方法,节省信令开销。
本申请提供了一种传输方法,该传输方法可以应用于终端设备,例如:图4中的MS1-MS2。图11是该传输方法的流程图,具体步骤如下:
步骤410:终端接收符号序列,所述符号序列是网络设备对控制信息采用Polar码编码并且加扰调制映射后得到;
步骤420:所述终端对所述符号序列进行解映射解调后得到编码序列;
步骤430:所述终端从所述编码序列选取至少一个编码子序列;
步骤440:所述终端对所述至少一个编码子序列进行Polar译码,得到比特序列,所述比特序列包括控制信息和CRC序列;
步骤450:所述终端用至少一个解扰序列对所述比特序列进行解扰操作,并且终端对解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息和时序信息。
需要说明的是,图12所示的传输装置700可以实现步骤410-步骤450等过程。其中,接收单元710用于执行步骤410,处理单元720用于执行步骤420和430,译码单元730用于执行步骤440的译码过程,解扰单元740用于执行步骤450中的解扰过程,校验单元750用于执行步骤450中的校验过程。该传输装置例如为移动台MS或基站BS,该传输装置也可以为实现相关功能的专用集成电路(英文:Application Specific Integrated Circuit,简称:ASIC)或者数字信号处理器(英文:Digital Signal Processor,简称:DSP)或者芯片。
需要说明的是,步骤430-450至少包括以下实现方式。步骤430中,终端选取的编码子序列的个数为1~4。其中,实施方式1和2针对解扰序列为2个的情形,实施方式3和4针对解扰序列为4个的情形。
实现方式1:所述终端对一个编码子序列进行译码;所述终端用2个解扰序列的每个解扰序列分别对所述比特序列进行解扰操作,并且终端对每次解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息;所述终端根据CRC校验通过的解扰序列的序号,得到时序信息。
举例说明:接收端收到y,-y,不论接收到y或者-y,都可以先译码,然后分别用0和p进行解扰操作,并测试CRC是否通过,来确定实际接收到的是y还是-y。
实现方式2:终端收到两份LLR子序列,进行软合并然后进行译码。终端对译码结果分别用0和p进行解扰操作,并测试CRC是否通过,来确定输入译码器的是y还是-y。
实现方式3:所述终端对一个编码子序列进行译码;所述终端用4个解扰序列的每个解扰序列分别对所述比特序列进行解扰操作,并且终端对每次解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息;所述终端根据CRC校验通过的解扰序列的序号,得到时序信息。
需要补充的是,编码子序列为LLR(英文:Log Likelihood Ratio,中文:对数似然比)子序列,终端将该编码子序列Polar译码,得到比特序列。终端继续用4个解扰序列p 0,p 1,p 2,p 3分别对比特序列解扰,然后做CRC校验,若CRC校验不通过,则进行下一轮解扰和CRC校验操作。因此,CRC校验的最多校验次数为4,最少的校验次数为1。4个解扰序列携带2比特的时序信息,终端根据CRC校验通过的解扰序列的序号,得到时序信息。
实现方式4:所述终端对两个编码子序列进行软合并,得到软合并序列;所述终端对所述软合并序列进行Polar译码,得到比特序列;所述终端用2个解扰序列分别对所述比特序列进行解扰操作,并且终端对每次解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息;所述终端根据CRC校验通过的解扰序列的序号,得到时序信息。
需要补充的是,编码子序列为LLR子序列,假定终端接收到的两份LLR子序列。先进行盲检1操作,在盲检1中,终端收到的两个LLR子序列中可能包含第二份或第四份LLR子序列,终端将前一份的LLR子序列的奇数位取反与当前份LLR子序列软合并,然后Polar译码,用序列p 1,p 3解扰,然后分别进行CRC校验,判断是否是当前时序。
再进行盲检2操作,在盲检2中,若终端接收到的LLR子序列可能包含第三份LLR子序列,此时终端将前一份的LLR子序列的偶数位取反与当前份LLR子序列软合并,然后Polar译码,用序列p 2解扰,进行CRC校验,判断是否是当前时序。
由上述盲检过程可知,若终端收到两个编码子序列,需要完成2次Polar译码和3次CRC校验,才能获得控制信息和时序信息。
可选地,步骤440中的控制信息为主信息块MIB。
如图13所示,本申请还提供了一种通信设备1000。该通信设备可以为基站或终端,或者实现相关译码功能的DSP或ASIC或芯片。该通信设备1000包括:
存储器1002,用于存储程序;其中,该存储器可以为RAM(英文:Random Access  Memory,中文:随机访问内存)或者ROM(英文:Read Only Memory,中文:只读内存)或者闪存,其中存储器可以位于单独位于通信设备内,也可以位于处理器1003的内部。
收发器1001,用于接收符号序列,所述符号序列是网络设备对控制信息采用Polar码编码并且加扰调制映射后得到;
处理器1003,用于执行所述存储器存储的所述程序,当所述程序被执行时,所述处理器对所述符号序列进行解映射解调后得到编码序列;从所述编码序列选取至少一个编码子序列;对所述至少一个编码子序列进行Polar译码,得到比特序列,所述比特序列包括控制信息和CRC序列;用至少一个解扰序列对所述比特序列进行解扰操作,并且终端对解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息和时序信息。
收发器1001、存储器1002和处理器1003之间通过总线904连接。
本实施例利用Polar码的编译码特点,通过接收侧对LLR子序列,先Polar译码后解扰,减少译码次数,降低实现复杂度。
在上述实施例中,可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时,可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时,全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中,或者从一个计算机可读存储介质向另一个计算机可读存储介质传输,例如,所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(英文:Digital Subsciber line,简称:DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质,(例如,软盘、硬盘、磁带)、光介质(例如,DVD(英文:Digital Video Disk,中文:数字视频光盘))、或者半导体介质
(例如固态硬盘(英文:Solid State Disk,简称:SSD)等。

Claims (20)

  1. 一种传输的方法,所述方法应用于网络设备,包括:
    将比特序列进行极性Polar编码,得到编码序列,所述比特序列包含控制信息和循环冗余校验CRC序列;
    将所述编码序列分片,得到n个编码子序列,n为整数,n>0;
    将所述n个编码子序列与n个加扰序列分别加扰,得到n个加扰后序列;
    将所述n个加扰后序列采用调制和映射操作后发送。
  2. 根据权利要求1所述的方法,所述将所述n个编码子序列与n个加扰序列分别加扰,具体包括:
    所述n个编码子序列中每个编码子序列的奇数序号向量和偶数序号向量分别与所述n个加扰序列中每个加扰序列进行异或操作。
  3. 根据权利要求2所述的方法,所述n个加扰序列携带
    Figure PCTCN2018075464-appb-100001
    个比特的信息。
  4. 根据权利要求1-3任一所述的方法,所述控制信息为主信息块MIB。
  5. 一种传输方法,所述方法应用于终端,包括:
    终端接收符号序列,所述符号序列是网络设备对控制信息采用Polar码编码并且加扰调制映射后得到;
    所述终端对所述符号序列进行解映射解调后得到编码序列;
    所述终端从所述编码序列选取至少一个编码子序列;
    所述终端对所述至少一个编码子序列进行Polar译码,得到比特序列,所述比特序列包括控制信息和CRC序列;
    所述终端用至少一个解扰序列对所述比特序列进行解扰操作,并且终端对解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息和时序信息。
  6. 根据权利要求5所述的方法,所述终端对所述至少一个编码子序列进行Polar译码,具体包括:
    所述终端对一个编码子序列进行译码;
    所述终端用至少一个解扰序列对所述比特序列进行解扰操作,并且终端对解扰后的比特序列做CRC校验,具体包括:
    所述终端用4个解扰序列的每个解扰序列分别对所述比特序列进行解扰操作,并且终端对每次解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息;
    所述终端根据CRC校验通过的解扰序列的序号,得到时序信息。
  7. 根据权利要求5所述的方法,所述终端对所述至少一个编码子序列进行Polar译码,具体包括:
    所述终端对两个编码子序列进行软合并,得到软合并序列;
    所述终端对所述软合并序列进行Polar译码;
    所述终端用至少一个解扰序列对所述比特序列进行解扰操作,并且终端对解扰后的比特序列做CRC校验,具体包括:
    所述终端用2个解扰序列分别对所述比特序列进行解扰操作,并且终端对每次解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息;
    所述终端根据CRC校验通过的解扰序列的序号,得到时序信息。
  8. 根据权利要求5-7任一所述的方法,所述控制信息为主信息块MIB。
  9. 一种传输的装置,包括:
    编码单元,用于将比特序列进行极性Polar编码,得到编码序列,所述比特序列包含控制信息和循环冗余校验CRC序列;
    速率匹配单元,用于将所述编码序列分片,得到n个编码子序列,n为整数,n>0;
    加扰单元,用于将所述n个编码子序列与n个加扰序列分别加扰,得到n个加扰后序列;
    处理单元,用于将所述n个加扰后序列采用调制和映射操作;
    发送单元,用于发送调制映射后的n个加扰后序列。
  10. 根据权利要求9所述的装置,所述加扰单元将所述n个编码子序列与n个加扰序列分别加扰,具体包括:
    所述n个编码子序列中每个编码子序列的奇数序号向量和偶数序号向量分别与所述n个加扰序列中每个加扰序列进行异或操作。
  11. 根据权利要求10所述的装置,所述n个加扰序列携带
    Figure PCTCN2018075464-appb-100002
    个比特的信息。
  12. 根据权利要求9-11任一所述的装置,所述控制信息为主信息块MIB。
  13. 一种传输的装置,包括:
    接收单元,用于接收符号序列,所述符号序列是网络设备对控制信息采用Polar码编码并且加扰调制映射后得到;
    处理单元,用于对所述符号序列进行解映射解调后得到编码序列,还用于从所述编码序列选取至少一个编码子序列;
    译码单元,用于对所述至少一个编码子序列进行Polar译码,得到比特序列,所述比特序列包括控制信息和CRC序列;
    解扰单元,用于采用至少一个解扰序列对所述比特序列进行解扰操作;
    校验单元,用于对解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息和时序信息。
  14. 根据权利要求13所述的装置,所述译码单元对所述至少一个编码子序列进行Polar译码,具体包括:
    所述译码单元对一个编码子序列进行译码;
    所述解扰单元用至少一个解扰序列对所述比特序列进行解扰操作,并且所述校验单元对解扰后的比特序列做CRC校验,具体包括:
    所述解扰单元用4个解扰序列的每个解扰序列分别对所述比特序列进行解扰操作,并且所述校验单元对每次解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息;
    所述检验单元根据CRC校验通过的解扰序列的序号,得到时序信息。
  15. 根据权利要求13所述的装置,所述译码单元对所述至少一个编码子序列进行Polar译码,具体包括:
    所述译码单元对两个编码子序列进行软合并,得到软合并序列;
    所述译码单元对所述软合并序列进行Polar译码;
    所述解扰单元用至少一个解扰序列对所述比特序列进行解扰操作,并且所述校验单元对解扰后的比特序列做CRC校验,具体包括:
    所述解扰单元用2个解扰序列分别对所述比特序列进行解扰操作,并且所述校验单元对每次解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息;
    所述校验单元根据CRC校验通过的解扰序列的序号,得到时序信息。
  16. 根据权利要求13-15任一所述的装置,所述控制信息为主信息块MIB。
  17. 一种通信设备,包括:
    存储器,用于存储程序;
    处理器,用于执行所述存储器存储的所述程序,当所述程序被执行时,所述处理器对比特序列进行极性Polar编码,得到编码序列,所述比特序列包含控制信息和循环冗余校验CRC序列;将所述编码序列分片,得到n个编码子序列,n为整数,n>0;将所述n个编码子序列与n个加扰序列分别加扰,得到n个加扰后序列;将所述n个加扰后序列采用调制和映射操作;
    收发器,用于发送n个调制映射后的加扰后序列。
  18. 一种通信设备,包括:
    存储器,用于存储程序;
    收发器,用于接收符号序列,所述符号序列是网络设备对控制信息采用Polar码编码并且加扰调制映射后得到;
    处理器,用于执行所述存储器存储的所述程序,当所述程序被执行时,所述处理器对所述符号序列进行解映射解调后得到编码序列;从所述编码序列选取至少一个编码子序列;对所述至少一个编码子序列进行Polar译码,得到比特序列,所述比特序列包括控制信息和CRC序列;用至少一个解扰序列对所述比特序列进行解扰操作,并且终端对解扰后的比特序列做CRC校验,若CRC校验通过,得到控制信息和时序信息。
  19. 一种计算机可读存储介质,包括指令,当其在计算机上运行时,使得计算机执行如权利要求1-4任意一项所述的方法。
  20. 一种计算机可读存储介质,包括指令,当其在计算机上运行时,使得计算机执行如权利要求5-8任意一项所述的方法。
PCT/CN2018/075464 2017-02-17 2018-02-06 一种极性码的传输方法和装置 WO2018149332A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP18753899.6A EP3562045B1 (en) 2017-02-17 2018-02-06 Polar code transmission method and apparatus
US16/544,529 US11057150B2 (en) 2017-02-17 2019-08-19 Polar code transmission method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710087449.XA CN108462554B (zh) 2017-02-17 2017-02-17 一种极性码的传输方法和装置
CN201710087449.X 2017-02-17

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/544,529 Continuation US11057150B2 (en) 2017-02-17 2019-08-19 Polar code transmission method and apparatus

Publications (1)

Publication Number Publication Date
WO2018149332A1 true WO2018149332A1 (zh) 2018-08-23

Family

ID=63169710

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/075464 WO2018149332A1 (zh) 2017-02-17 2018-02-06 一种极性码的传输方法和装置

Country Status (4)

Country Link
US (1) US11057150B2 (zh)
EP (1) EP3562045B1 (zh)
CN (1) CN108462554B (zh)
WO (1) WO2018149332A1 (zh)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018064407A1 (en) * 2016-09-28 2018-04-05 Idac Holdings, Inc. Efficient broadcast channel in beamformed systems for nr
CN108540259B (zh) * 2017-03-01 2020-07-10 电信科学技术研究院 一种极化码编译码方法及装置
CN110476357B (zh) * 2017-04-01 2021-08-20 华为技术有限公司 极化码传输方法和装置
US11005597B2 (en) * 2017-06-14 2021-05-11 Idac Holdings, Inc. Two-stage scrambling for polar coded PDCCH transmission
WO2019023423A1 (en) * 2017-07-27 2019-01-31 Intel IP Corporation INTERFERENCE OF THE PHYSICAL DIFFUSION CHANNEL (PBCH)
US10911271B2 (en) * 2017-09-11 2021-02-02 Qualcomm Incorporated PBCH scrambling design
US10700829B2 (en) * 2018-02-14 2020-06-30 Qualcomm Incorporated Combining decision metrics of a scrambled payload
CN108988993B (zh) * 2018-08-31 2020-03-20 北京邮电大学 一种降低极化码盲检测虚警率的方法、装置及移动终端
CN110890938B (zh) * 2018-09-10 2021-11-09 华为技术有限公司 使用Polar码的信道编码方案的数据传输方法及相关设备
CN114070693A (zh) * 2020-08-10 2022-02-18 华为技术有限公司 一种数据传输的方法及装置
CN114499760B (zh) * 2022-01-24 2023-08-29 哲库科技(北京)有限公司 译码方法及相关装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104854813A (zh) * 2013-09-30 2015-08-19 瑞典爱立信有限公司 无线网络中通过符号速率映射的下行链路物理层处理
CN105262494A (zh) * 2015-10-13 2016-01-20 东南大学 一种具有迭代早停止机制的极化码bp译码方法
CN106230555A (zh) * 2016-07-29 2016-12-14 西安电子科技大学 极化码的分段循环冗余校验方法

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8635517B2 (en) * 2011-01-31 2014-01-21 Samsung Electronics Co., Ltd. Methods and apparatus for fast synchronization using quasi-cyclic low-density parity-check (QC-LDPC) codes
KR102007770B1 (ko) * 2012-12-14 2019-08-06 삼성전자주식회사 패킷의 부호화 방법과 그 복호화 장치 및 방법
US9923665B2 (en) * 2014-06-06 2018-03-20 Huawei Technologies Co., Ltd. System and method for forward error correction

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104854813A (zh) * 2013-09-30 2015-08-19 瑞典爱立信有限公司 无线网络中通过符号速率映射的下行链路物理层处理
CN105262494A (zh) * 2015-10-13 2016-01-20 东南大学 一种具有迭代早停止机制的极化码bp译码方法
CN106230555A (zh) * 2016-07-29 2016-12-14 西安电子科技大学 极化码的分段循环冗余校验方法

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
HUAWEI ET AL.: "Evaluation of Polar Codes for eMBB Scenario", 3GPPTSG RAN WG1 MEETING #85, R1-164375, 14 May 2016 (2016-05-14), Nanjing, China, XP051089994, [retrieved on 20160527] *
See also references of EP3562045A4 *
SONG, XINFEI: "Research on the Physical Broadcast Channel Information Extraction of TD-LTE Using FPGA", THESIS, vol. 5, 15 May 2016 (2016-05-15), pages 1 - 47, XP055616097 *

Also Published As

Publication number Publication date
US11057150B2 (en) 2021-07-06
CN108462554B (zh) 2021-06-15
EP3562045A4 (en) 2019-12-11
EP3562045B1 (en) 2023-12-13
CN108462554A (zh) 2018-08-28
EP3562045A1 (en) 2019-10-30
US20190372711A1 (en) 2019-12-05

Similar Documents

Publication Publication Date Title
WO2018149332A1 (zh) 一种极性码的传输方法和装置
CN108365848B (zh) 一种极性码的译码方法和装置
WO2018177227A1 (zh) 一种编码方法、译码方法、装置和设备
WO2018127064A1 (zh) 控制信息传输方法及装置
WO2017101631A1 (zh) 用于处理极化码的方法和通信设备
CN108347301B (zh) 数据的传输方法和装置
WO2018202140A1 (zh) 编码方法、装置和设备
WO2018166416A1 (zh) 传输控制信息的方法和装置
US11050510B2 (en) Polar code transmission method and apparatus
WO2018127139A1 (zh) 一种控制信息的传输方法和装置
WO2018161965A1 (zh) 无线通信方法和设备
US11026244B2 (en) Method and device in terminal and base station for dynamic scheduling
CN109756299B (zh) 一种用于无线通信的用户设备、基站中的方法和装置
WO2018196638A1 (zh) 一种信息承载方法及装置
CN108289009B (zh) 一种被用于信道编码的ue、基站中的方法和设备
WO2018171776A1 (zh) 一种广播信息指示的发送方法和发送设备
US20200036474A1 (en) Resource mapping method and apparatus thereof
CN109756294B (zh) 一种用于无线通信的用户设备、基站中的方法和装置
CN108574562B (zh) 数据传输方法及装置
CN112438023B (zh) 极化编码和解码
CN108631915B (zh) 极性码的编码、译码方法及设备
CN113574806A (zh) 极化编码

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

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2018753899

Country of ref document: EP

Effective date: 20190724

NENP Non-entry into the national phase

Ref country code: DE