WO2018184480A1 - 一种编码方法、译码方法、装置和设备 - Google Patents
一种编码方法、译码方法、装置和设备 Download PDFInfo
- Publication number
- WO2018184480A1 WO2018184480A1 PCT/CN2018/080404 CN2018080404W WO2018184480A1 WO 2018184480 A1 WO2018184480 A1 WO 2018184480A1 CN 2018080404 W CN2018080404 W CN 2018080404W WO 2018184480 A1 WO2018184480 A1 WO 2018184480A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- polar code
- subset
- decoding
- interleaving
- encoding
- Prior art date
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1835—Buffer management
- H04L1/1845—Combining techniques, e.g. code combining
-
- 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
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
- H04L1/0013—Rate matching, e.g. puncturing or repetition of code symbols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0033—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter
- H04L1/0034—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter where the transmitter decides based on inferences, e.g. use of implicit signalling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0041—Arrangements at the transmitter end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/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/0067—Rate matching
- H04L1/0068—Rate matching by puncturing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0071—Use of interleaving
-
- 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/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
-
- 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/189—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast in combination with wireless systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1863—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast comprising mechanisms for improved reliability, e.g. status reports
- H04L12/1877—Measures taken prior to transmission
Definitions
- the present invention relates to the field of channel coding and decoding in communication systems, and more particularly to a method, apparatus and apparatus for polarization encoding or decoding.
- 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 zero. In fact, only the transceiver terminal needs 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 key to the encoding of the Polar code depends on the determination of the code length N and the information bit set A.
- the determination of the information bit set A cannot be obtained by simple calculation, and may also include check bits or other bits that are helpful for decoding.
- Most of the prior art uses offline computing storage to determine that the encoder and the decoder pre-store a correspondence table between a plurality of mother code sequences and a code length and a code rate. When performing the Polar code encoding, the corresponding mother code sequence is selected from the required code rate and code length.
- the construction process of the Polar code is a collection
- the selection process determines the performance of the Polar code.
- Common construction methods that is, methods for calculating the reliability of a polarized channel are density evolution (DE) and Gaussian approximation (GA).
- the Polar code is based on a Successive Cancellation (SC) decoding algorithm, that is, sequential decoding starting from the first bit.
- SC Successive Cancellation
- the serial offset list (SC List, SCL) decoding algorithm is an improvement of the SC decoding algorithm. Multiple candidate decoding results are reserved in each bit, and all the bits are decoded, and all decodings in the list are performed according to certain criteria. The result is selected to obtain the final decoded result.
- the criterion may be that the path penalty value of each list is sorted, the list with the smallest path penalty value is selected, or the list passed by the CRC check is used as the final output.
- the present application provides a method, apparatus and device for polar coding, which can further improve the communication performance of the Polar codec.
- the process of the Polar codec such as the interleaving operation, may also implicitly carry information.
- a method for encoding and decoding a Polar code in a communication system determining an information bit position set or a frozen bit position set of a Polar code according to an interleaving operation or a corresponding deinterleaving operation; and based on the determined information bit position set or frozen
- the set of bit positions is encoded or decoded by Polar code.
- a device for encoding and decoding a Polar code in a communication system comprises means for performing the method of the first aspect or any of the possible implementations of the first aspect.
- a device for encoding and decoding a Polar code in a communication system comprising a Polar code structure determining module (201), and a Polar code encoding and decoding module (202), wherein
- the Polar code structure determining module (201) is configured to determine a information bit position set or a frozen bit position set of the Polar code according to an interleaving operation or a corresponding deinterleaving operation;
- the Polar code codec module (202) is configured to perform Polar code encoding or decoding based on the information bit position set or the frozen bit position set determined by the Polar code structure determining module (201).
- an embodiment of the present application provides an apparatus for encoding and decoding a Polar code in a communication system.
- the device includes: a memory, a processor, wherein the memory and the processor are connected to each other by a bus system.
- the memory is for storing instructions for executing the instructions stored by the memory, and when the instructions are executed, the processor performs the method of the first aspect or any possible implementation of the first aspect.
- the present application provides a computer readable medium for storing a computer program, the computer program comprising instructions for performing the method of the first aspect or any of the possible implementations of the first aspect.
- the system constructs a Polar code according to an interleaving operation of the Polar code, so as to perform Polar code encoding or Polar code decoding, and an interleaving operation or a deinterleaving operation based thereon. It can implicitly carry information while improving the transmission performance of the communication system through the Polar code.
- FIG. 1 is a schematic structural diagram of a wireless communication system according to an embodiment of the present invention.
- FIGS. 2a and 2b are simplified diagrams showing the processing flow of a physical layer in a wireless communication system.
- FIG. 3 is a simplified flow chart showing a method of constructing a Polar code in a communication system and a method of encoding and decoding based on the construction method.
- Figures 4a-4d are simplified schematic views of the device from the encoding side and the corresponding method or principle of operation.
- FIG. 5 is a diagram showing the structure and operation of the apparatus on the decoding side according to an embodiment of the present invention.
- FIG. 6 shows an example of a method of constructing a Polar code
- FIG. 7 is a schematic structural diagram of an apparatus for polarization encoding according to an embodiment of the present invention.
- the embodiments of the present invention can be applied to various communication systems, for example, Global System of Mobile communication (GSM) systems, Code Division Multiple Access (CDMA) systems, and Wideband Code Division Multiple Access (Wideband Code).
- Division Multiple Access (WCDMA) system General Packet Radio Service (GPRS), Long Term Evolution (LTE) system, LTE Frequency Division Duplex (FDD) system, LTE time division duplex (Time Division Duplex, TDD), Universal Mobile Telecommunication System (UMTS), or next-generation wireless communication system.
- GSM Global System of Mobile communication
- CDMA Code Division Multiple Access
- Division Multiple Access WCDMA
- GPRS General Packet Radio Service
- LTE Long Term Evolution
- FDD Frequency Division Duplex
- TDD Time Division Duplex
- UMTS Universal Mobile Telecommunication System
- the information or data processed by the base station or the terminal in the above system using the conventional turbo code and LDPC code encoding can be encoded by the Polar code in this embodiment.
- FIG. 1 is a schematic structural diagram of a wireless communication system.
- the embodiment of the present application can be applied to a wireless communication system.
- a wireless communication system is optionally composed of cells, and each cell includes a network side device, such as a base station.
- the network side device provides communication service to one or more terminals or mobile stations (English: Mobile Station, MS for short), wherein the network side device can be connected to the core network device.
- the base station may be a device for communicating with the terminal device.
- it 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 an evolved base station (Evolved Node B, eNB or eNodeB).
- BTS Base Transceiver Station
- NodeB, NB base station
- Evolved Node B, eNB or eNodeB evolved base station
- the base station may 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 base station may also be a terminal that functions as a base station in a Device to Device (D2D) communication.
- D2D Device to Device
- the terminal may be in communication with one or more core networks via a Radio Access Network (RAN).
- a terminal may refer to a User Equipment (UE), an access terminal, a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a wireless communication device, a user agent, or a user device.
- the access terminal may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), with wireless communication.
- 2a and 2b show a process flow of a physical layer in a wireless communication system.
- the source is encoded by a source code and then subjected to channel coding, or rate matching, digitally modulated, and transmitted to the receiving end through a channel.
- the signal received through the channel is digitally demodulated, de-rate matched, channel decoded, and source decoded to obtain a sink.
- an interleaving method (or progressive interleaving) having progressive interleaving characteristics is employed. Referring to FIG.
- the interleaving process may be performed after channel coding, before the rate matching, the length of the to-be-interleaved sequence at the time of interleaving is the length of the Polar code N; reference FIG. 2b may also be performed after the rate matching, and the length of the sequence to be interleaved at the time of interleaving is the rate.
- the target length M after matching.
- Embodiments of the present invention relate to channel coding and channel decoding, wherein channel coding is used to increase redundancy and improve the robustness of information streams in channel transmission.
- channel coding may be a turbo code, a polarization (or Polar) code or a low-density parity check code (LDPC code).
- LDPC code low-density parity check code
- the embodiments of the present invention mainly focus on a channel coding method using a Polar code and a corresponding decoding method and apparatus, but are not limited to being applicable to various communication systems, including a communication system capable of supporting two or more codec modes. I will not go into details.
- K length of non-fixed bits, wherein the non-fixed bits include information bits, optionally including check bits, auxiliary decoded bits, and the like;
- N target quantized sequence, or Polar code mother code length (which is an integer power of 2)
- target code length (on the encoding side M is the code length of the sequence when the transmission is performed. If the rate matching is required after the polar coding, the code length obtained after the rate matching from the length of the Polar code mother code N is obtained; on the decoding side M It is the original received code length, and after the de-rate matching, the target quantization sequence length N) is obtained.
- FIG. 3 a flow chart of a method of constructing a Polar code in a communication system and a method of codec based on the construction method is simply shown.
- an interleaving method having progressive interleaving characteristics is employed, and a Polar code is constructed according to the interleaving method.
- the Polar code constructed in this way has a progressive interleaving characteristic, that is, given the sequence Q1 to be coded, the Polar code is encoded to obtain the coded word C1, and the C1 is progressively interleaved to obtain the sequence C2, and the C2 can be directly subjected to Polar.
- the code is decoded to obtain the decoded bit sequence Q2.
- the Q4 is progressively deinterleaved to obtain the original sequence to be encoded Q1.
- the process is equivalent to first de-interleaving the sequence C2 to obtain C1, and then decoding to obtain Q1.
- the Polar code constructed by the method of the present invention has a controllable number of redundancy versions, that is, the minimum number of progressive interleaving can be controlled to carry enough implicit information. More specifically, the Polar code constructed by the above construction method can be applied to a scene in which PBCH and the like need to implicitly transmit information.
- the above progressive interleaving refers to an interleaving operation in which a plurality of progressive operations are performed using a specific interleaving operation for a sequence to be interleaved.
- the number of redundancy versions is the number of progressive interleaving operations.
- cyclic interleaving is a special case of progressive interleaving, which means that after performing a plurality of progressive interleaving operations, the obtained sequence is identical to the original interleaved sequence.
- a subset of one or more mutually exclusive Polar code subchannel locations are obtained, wherein the subchannel locations in each of the subsets are subjected to any of the foregoing interleaving operations, still belonging to the sub Concentrated, not in other subsets.
- a Polar code is constructed. For example, selecting the first partial subset as the information bit position set; or selecting the second partial subset as the frozen bit position set, any one of the first partial subsets being different from any of the second partial subsets.
- the third subset is selected as a set of puncturing locations; wherein the subset of the third subset is different from any of the first subset and the second subset.
- the redundancy version of the plurality of interleaved sequences obtained by performing the multiple interleaving operation described above may be used to implicitly carry part of information, such as implicitly transmitted information in PBCH or the like.
- the Polar code using the embodiment of the present invention has a controllable number of redundancy versions.
- the number of redundancy versions may be determined according to the requirements of the application scenario. For example, if a scenario requires a Polar code to carry 3 bits of implicit information through at least 8 redundancy versions, when initially constructing a Polar code, we select a period r greater than or equal to 8 An interleaving sequence, based on which the Polar code is constructed.
- period r means that the original sequence is changed back after r times.
- the Polar code construction method having the above interleaving characteristics includes:
- a Polar code coding parameter including a mother code length N, a target code length M, and an information bit length K.
- N log 2
- the interleaving operation ⁇ or ⁇ the division of the subchannel position set is obtained, and t mutually exclusive subsets (orbit) o 1 , o 2 , o 3 , . . . , o t are obtained .
- the subchannel positions are grouped into a plurality of mutually exclusive subsets (which may also be referred to as tracks orbits).
- the elements (serial numbers) in each subset still fall in the subset regardless of how many times the interleaving operation is processed.
- the interleaving operation is, for example, the aforementioned interleaving operation ⁇ for the n long base sequence or the interleaving operation ⁇ for the N long sequence.
- any two mutually exclusive collections means that the two collections do not contain any one of the same elements.
- some mutually exclusive subsets are selected such that the concatenation of the selected one or more mutually exclusive subsets includes K elements, and the selected one or more The union of the mutually exclusive subsets is the information bit position set, and the K elements in the set are the information bit positions.
- the embodiment is not particularly limited.
- the selection of the information bit position set may affect the performance of the code (for example, the BLER performance), and the embodiment of the present invention may also be combined with other possible implementations of the selected information bit set, which are not described herein.
- the target code length M is different according to the mother code length N, that is, when rate matching is required, the target code length M is selected according to the mother code length N and the target code length M.
- the remaining subsets other than the set of information bit positions and the set of puncturing locations are a set of frozen bit positions.
- the above 104, 105, 106 may also be replaced by: the interleaving process divides the sequence number set into multiple subsets and then selects the union of the partial subsets as the frozen bit position set, so that The remaining subset except the set of frozen bit positions and the set of possible puncturing locations is a set of information bit positions.
- the embodiment of the present invention further provides a method for encoding and decoding based on the foregoing manner of constructing a Polar code, or a method for transmitting information:
- 108 Perform codec and subsequent processing according to the Polar code constructed as described above. For example, 108a, at the transmitting end, performing r i- time progressive interleaving at different timings i, performing rate matching, modulation, or resource mapping and transmitting, respectively, for each interleaved result; or, 108b, at the receiving end, performing corresponding inverse Operation, wherein the information of the foregoing i is obtained by blind detection, the information being information implicitly transmitted by the Polar code, by a general inverse operation or other officially transmitted information bits.
- the transmitting end of the embodiments of the present invention may be a terminal, and the receiving end is a network side device, such as a base station. If the transmitting end is a network measuring device such as a base station, the receiving end is a terminal. In a specific scenario, for example, for the PBCH, the transmitting end is a network measuring device such as a base station, and the receiving end is a terminal.
- FIG. 4a a method for transmitting a Polar code in an implementation manner, at the transmitting end:
- a sequence to be encoded is obtained by adding a CRC bit for the main information block MIB to be transmitted.
- the embodiments of the present invention can be applied to other communication scenarios. Further, embodiments of the invention do not limit other ways of obtaining a sequence to be encoded.
- the sequence to be encoded is input as an input of a non-fixed bit position set (information bit position set) to obtain an encoded sequence x 1 N .
- the optional rate matching is performed first, and then the progressive interleaving operation is performed.
- the interleaving operation in this embodiment is for the rate matched sequence x 1 . M.
- the interleaving operation itself also performs adaptive adjustments, for example, removing the punctured subchannel position from the interleaving sequence, and details are not described herein again.
- the foregoing solution may also be implemented by other arrangements.
- the solution of FIG. 4a may be equivalently replaced by: performing different times multiple times at different timings. Progressive interweaving.
- i progressive interleaving i.e., T 1 , T 2 ... to T i interleaving
- it caches a plurality of encoded sequences x 1 N in order to perform i progressive interleaving respectively for the plurality of encoded sequences x 1 N.
- FIG. 4b can also be replaced with the technical solution of FIG. 4d, and details are not described herein again.
- LLR Log Likelihood Ratio
- FIG. 5 is a diagram showing the structure and operation of the apparatus on the decoding side according to an embodiment of the present invention.
- a method for receiving a Polar code in an embodiment of the receiving end receiving a signal, performing solution mapping, digital demodulation, and optional de-rate matching to obtain an LLR, attempting to decode, If the decoding fails, the plurality of signals are further received, multiple LLRs are obtained, soft combining is performed, and the soft combined LLR is attempted to be decoded.
- the method includes:
- the PBCH is used as an information bit, but the embodiment is not limited thereto.
- the interleaving method for the Polar code and the corresponding method for constructing the Polar code are mentioned.
- the following is a specific example.
- the fourth, sixth, and seventh behavior base sequences are respectively recorded as x 2 , x 1 and x 0 , and the other lines are all bases except the eighth line of all ones.
- the sequence is performed and operated.
- the second line which is obtained by x 2 and x 1 and operation, is denoted by x 2 x 1 and the third behavior is x 2 x 0 .
- the interleaving for the encoded bit sequence c (or codeword c) is:
- the interleaving of the pre-encoding bit sequence is recorded as:
- ⁇ u (u 0 , u 1 , u 2 , u 3 , u 4 , u 5 , u 6 , u 7 ) (u 0 , u 2 , u 4 , u 6 , u 1 , u 3 , u 5 , u 7 )
- ⁇ c and ⁇ u have the same interleaving as the code word c and the pre-encoding bit u, and have a feature that the sequence number of bits in the pre-interleaving sequence is ⁇ 0, 1, 2, ..., N-1 ⁇ , then
- the interleaving process divides the sequence number set into multiple mutually exclusive subsets (called orbits), and the sequence number of the subset is still in the subset regardless of how many times the interleaving process is performed.
- the sequence number set ⁇ 0,1,2,3,4,5,6,7 ⁇ is divided into ⁇ 0 ⁇ , ⁇ 1, 2, 4 ⁇ , ⁇ 3, 5, 6 ⁇ , ⁇ 7 ⁇ Four subsets (orbit).
- ⁇ u the interleaving operation obtained by this method can obtain r redundant versions of the pre-encoding sequence u or the encoded sequence c. It can be seen that in this way, the number of redundancy versions r can be controlled.
- the position of the information bit in the Polar code is still at the position of the information bit after the interleaving, and the position of the frozen bit is still frozen after the bit position is interleaved.
- the set of sequence numbers ie, the set of bit positions
- the sequence numbers in the subset still fall within the set after being interleaved.
- the bit positions in some subsets may be selected as information bits for the above interleaving method ⁇ c or ⁇ u , and the bit positions in other subsets are frozen bits.
- the interleaved sequence of the codeword after the Polar code encoding can still be directly decoded.
- Different redundancy versions obtained by different number of interleaving operations can carry different implicit information. It is also possible to soft combine multiple redundancy versions on the decoding side to obtain the gain brought by the energy superposition.
- a Polar interlace and a corresponding construction method are given.
- the interleaving of the base sequence is:
- ⁇ (x 0 ) x 1
- ⁇ (x 1 ) x 2
- ⁇ (x 2 ) x 3
- ⁇ (x 3 ) x 4
- ⁇ (x 5 ) x 6
- ⁇ (x 6 ) x 7
- ⁇ (x 7 ) x 0
- ⁇ (x 8 ) x 8 .
- An interleaving operation ⁇ c corresponding to the encoded sequence and an interleaving operation ⁇ u for the pre-encoding sequence can be obtained.
- ⁇ c and ⁇ u are the same, and can be represented by the interleaving sequence ⁇ .
- the method or the working principle and the device provided by the embodiments of the present invention can obtain the information bit position set or the frozen bit position set of the Polar code to be applied to the encoding or decoding process.
- FIGS. 1 through 6 The method for determining the structure of a Polar code, the application in polar encoding or decoding, and the method of carrying implicit information by interleaving according to an embodiment of the present invention are described in detail above with reference to FIGS. 1 through 6.
- 2a and 2b also respectively provide the structure of the apparatus for encoding and decoding the Polar code
- FIG. 4a to FIG. 4c describe the working principle of the apparatus from the encoding side
- FIG. 5 describes the working principle of the apparatus from the decoding side.
- an embodiment of the present invention provides a device for encoding and decoding a Polar code in a communication system, including a Polar code structure determining module (201). , and, Polar code codec module (202), wherein
- the Polar code structure determining module (201) is configured to determine a information bit position set or a frozen bit position set of the Polar code according to an interleaving operation or a corresponding deinterleaving operation;
- the Polar code codec module (202) is configured to perform Polar code encoding or decoding based on the information bit position set or the frozen bit position set determined by the Polar code structure determining module (201).
- the Polar code structure determining module (201) is further configured to determine the interleaving operation according to a need of the transmission.
- the Polar code structure determining module (201) is configured to: obtain a subset of one or more mutually exclusive Polar code subchannel locations, wherein the subchannel positions in each of the subsets are subjected to any of the foregoing interleaving Operation, still belonging to the subset, and not belonging to other subsets; selecting the first partial subset as the information bit position set; or selecting the second partial subset as the frozen bit position set, any one of the first partial subsets Different from any of the second partial subsets.
- the Polar code structure determining module (201) is further configured to: when a rate matching is required, select a third partial subset as a punch location set; wherein the subset of the third partial subset is different from the Any one of the first partial subset and the second partial subset.
- the device further includes:
- the interleaving module (203) is configured to perform an interleaving operation after the Polar code is encoded, where the interleaving operation implicitly carries specific information.
- the method further includes: a deinterleaving module, configured to perform the deinterleaving operation after the decoding of the Polar code, to obtain specific information that is implicitly carried.
- a deinterleaving module configured to perform the deinterleaving operation after the decoding of the Polar code, to obtain specific information that is implicitly carried.
- the foregoing apparatus is used for transmission of a physical broadcast channel PBCH in a wireless communication system.
- communication device 600 can be configured as a general purpose processing system, such as generally referred to as a chip, the general purpose processing system including: one or more microprocessors providing processor functionality; and an external memory providing at least a portion of storage medium 603, All of this is connected to other support circuits through an external bus architecture.
- a general purpose processing system such as generally referred to as a chip, the general purpose processing system including: one or more microprocessors providing processor functionality; and an external memory providing at least a portion of storage medium 603, All of this is connected to other support circuits through an external bus architecture.
- the communication device 600 can be implemented using an ASIC (application specific integrated circuit) having a processor 602, a bus interface 604, a user interface 606, and at least a portion of the storage medium 603 integrated in a single chip, or Communication device 600 can be implemented using one or more FPGAs (Field Programmable Gate Arrays), PLDs (Programmable Logic Devices), controllers, state machines, gate logic, discrete hardware components, any other suitable circuitry, Or any combination of circuits capable of performing the various functions described throughout the present invention.
- FPGAs Field Programmable Gate Arrays
- PLDs Programmable Logic Devices
- controllers state machines, gate logic, discrete hardware components, any other suitable circuitry, Or any combination of circuits capable of performing the various functions described throughout the present invention.
- FIG. 7 is a schematic structural diagram of a communication device 600 according to an embodiment of the present invention (for example, an access point or a base station, a communication device such as a station or a terminal, or a chip in the foregoing communication device, etc.).
- a communication device 600 for example, an access point or a base station, a communication device such as a station or a terminal, or a chip in the foregoing communication device, etc.
- communication device 600 can be implemented by bus 601 as a general bus architecture.
- bus 601 can include any number of interconnecting buses and bridges.
- Bus 601 connects various circuits together, including processor 602, storage medium 603, and bus interface 604.
- the communication device 600 connects the network adapter 605 or the like via the bus 601 using the bus interface 604.
- the network adapter 605 can be used to implement signal processing functions of the physical layer in the wireless communication network and to transmit and receive radio frequency signals through the antenna 607.
- the user interface 606 can be connected to a user terminal such as a keyboard, display, mouse or joystick.
- Bus 601 can also be connected to various other circuits, such as timing sources, peripherals, voltage regulators, or power management circuits, etc., which are well known in the art and therefore will not be described in detail.
- the processor 602 is responsible for managing the bus and general processing (including executing software stored on the storage medium 1203).
- Processor 602 can be implemented using one or more general purpose processors and/or special purpose processors. Examples of processors include microprocessors, microcontrollers, DSP processors, and other circuits capable of executing software.
- Software should be interpreted broadly to mean instructions, data, or any combination thereof, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise.
- Storage medium 603 is shown separated from processor 602 in the following figures, however, those skilled in the art will readily appreciate that storage medium 603, or any portion thereof, may be located external to communication device 600.
- storage medium 603 can include transmission lines, carrier waveforms modulated with data, and/or computer products separate from wireless nodes, all of which can be accessed by processor 602 via bus interface 604.
- storage medium 603, or any portion thereof, may be integrated into processor 602, for example, may be a cache and/or a general purpose register.
- the processor 602 can perform the methods in the foregoing embodiments, for example, FIG. 2a, FIG. 2b, FIG. 4a-FIG. 4c or FIG. 5 and the corresponding embodiments, and the execution process of the processor 602 is not described herein again.
- the communication device in the embodiment of the present application may be a wireless communication device such as an access point, a station, a base station, or a user terminal.
- the Polar code in the embodiment of the present application may also be a CA-Polar code or a PC-Polar code.
- Arikan Polar refers to the original Polar code, which is not cascaded with other codes, only information bits and frozen bits.
- the CA-Polar code is a Polar code cascading a Cyclic Redundancy Check (CRC) Polar code
- the PC-Polar code is a Polar code cascading Parity Check (PC) code.
- PC-Polar and CA-Polar improve the performance of Polar codes by cascading different codes.
- the “information bit sequence” in the embodiment of the present application may also be called “bit sequence to be encoded” or “information bit set”.
- the “number of information bits” may be the number of bits to be encoded in the bit sequence to be encoded. Number, or the number of elements in the information bit set.
- the unit and method processes of the examples described in the embodiments of the present application can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the solution. The skilled person can use different methods for each particular application to implement the described functionality.
- the disclosed apparatus and method may be implemented in other manners.
- the device embodiments described above are merely illustrative.
- the division of the unit is only a logical function division, and the actual implementation may have another division manner.
- multiple units or components may be combined or integrated into another system, or some steps may be omitted or not performed.
- the coupling or direct coupling or communication connection of the various units to each other may be through some interfaces, which may be in electrical, mechanical or other form.
- the units described as separate components may or may not be physically separate, and may be located in one place or on multiple network elements.
- each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
- the above embodiments it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof.
- 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)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
一种通信系统中Polar码编解码的方法,根据交织操作或者相应的解交织操作确定Polar码的信息比特位置集合或者冻结比特位置集合;基于所述确定的信息比特位置集合或者冻结比特位置集合进行Polar码编码或者解码。
Description
本申请要求于2017年04月05日提交中国专利局、申请号为201710218791.9、申请名称为“Polar码编解码的方法、装置和设备”的中国专利申请的优先权,其全部内容通过引用结合在本申请中。
本发明涉及通信系统中信道编解码领域,并且更具体地,涉及一种用于极化编码或者解码的方法、装置和设备。
通信系统通常采用信道编码提高数据传输的可靠性,保证通信的质量。极化(Polar)码是理论上证明可以取得香农容量,且具有简单的编码和解码方法的编码方式。Polar码是一种线性块码。其生成矩阵为G
N,其编码过程为
其中,
是一个二进制的行矢量,
码长N=2
n,其中,n为正整数。
是F
2的克罗内克乘积,定义为
Polar码的编码过程中,
中的一部分比特用来携带信息,称为信息比特,这些信息比特的序号的集合记作A。另外的一部分比特置为收发端预先约定的固定值,称之为固定比特,其序号的集合用A的补集A
c表示。不失一般性,这些固定比特通常被设为0。实际上,只需要收发端预先约定,固定比特序列可以被任意设置。从而,Polar码的编码比特序列可通过如下方法得到:
这里
为
中的信息比特集合,
为长度K的行矢量,即
|·|表示集合中元素的数目,即K表示集合A中元素的数目,
是矩阵G
N中由集合A中的索引对应的那些行得到的子矩阵。
是一个K×N的矩阵。
Polar码编码的关键取决于码长N和信息比特集合A的确定。已有的Polar码编码方案中,信息比特集合A的确定都不能通过简单的计算得到,也有可能包含校验比特或者其他有助于解码的比特。现有技术中大多采用离线计算存储的方式来确定,即,编码器和解码器预先存储多个母码序列与码长、码率的对应关系表。在进行Polar码编码时,根据所需的码率、码长从中选择对应的母码序列。
现有技术中,Polar码的构造过程即集合
的选取过程,决定了Polar码的性能。常见的构造方法,即计算极化信道可靠度的方法有密度进化(density evolution,DE)、高斯近似(Gaussian approximation,GA)等。
Polar码基于串行抵消(Successive Cancellation,SC)译码算法,即从第1个比特开始顺序译码。串行抵消列表(SC List,SCL)译码算法是对SC译码算法的改 进,在每个比特保留多个候选译码结果,完成全部比特的译码后根据一定准则对列表中所有译码结果进行选择,得到最终译码结果。所述准则可以是根据各列表的路径惩罚值进行排序,选择路径惩罚值最小的列表;也可以是CRC校验通过的列表作为最终输出。
现有技术中过Polar编解码的通信性能需要进一步提高。
发明内容
本申请提供一种用于极化编码的方法、装置和设备,能够进一步提高Polar编解码的通信性能。在一些情况下,还可以通过Polar编解码的的过程,例如其中的交织操作隐式的携带信息。
第一方面,一种通信系统中Polar码编解码的方法,根据交织操作或者相应的解交织操作确定Polar码的信息比特位置集合或者冻结比特位置集合;基于所述确定的信息比特位置集合或者冻结比特位置集合进行Polar码编码或者解码。。
另一方面,还提供了通信系统中Polar码编解码的装置。具体地,该装置包括用于执行第一方面或第一方面的任意可能的实现方式中的方法的单元。
第二方面,一种通信系统中Polar码编解码的装置,包括Polar码结构确定模块(201),和,Polar码编解码模块(202),其中,
所述Polar码结构确定模块(201)用于根据交织操作或者相应的解交织操作确定Polar码的信息比特位置集合或者冻结比特位置集合;
所述Polar码编解码模块(202),用于基于所述Polar码结构确定模块(201)确定的信息比特位置集合或者冻结比特位置集合进行Polar码编码或者解码。
第三方面,本申请实施方式提供了一种通信系统中Polar码编解码的装置。具体地,该装置包括:存储器、处理器,其中,存储器、处理器通过总线系统相互连接。 该存储器用于存储指令,该处理器用于执行该存储器存储的指令,当该指令被执行时,该处理器执行第一方面或第一方面的任意可能的实现方式中的方法。
第四方面,本申请提供一种计算机可读介质,用于存储计算机程序,该计算机程序包括用于执行第一方面或第一方面的任意可能的实现方式中的方法的指令。
在本发明实施例中,系统根据Polar码的交织操作构造Polar码,以便于进行Polar码编码或者Polar码解码,以及其基础上的交织操作或者解交织操作。能够在通过Polar码提高通信系统传输性能的同时,隐式的携带信息。
为了更清楚地说明本发明实施例的技术方案,下面将对本发明实施例中所需要使用的附图作简单地介绍,显而易见地,下面所描述的附图仅仅是本发明的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动的前提下,还可以根据这些附图获得其他的附图。
图1是本发明实施例的一种无线通信系统结构示意图。
图2a以及图2b所示为一种无线通信系统中物理层的处理流程的简单示意图。
图3简单的示出了一种通信系统中Polar码的构造方法以及基于该构造方法的编解码的方法的流程图。
图4a-4d从编码侧的装置和相应的方法或者工作原理的简单示意图。
图5示出了根据本发明实施例的在译码侧的装置结构和工作原理的示意图。
图6示出了Polar码的构造方法一个实例;
图7是根据本发明实施例的用于极化编码的设备的示意性结构图。
下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完 整地描述,显然,所描述的实施例是本发明一部分实施例,而不是全部的实施例。基于本发明中的实施例,本领域普通技术人员在没有付出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。
本发明实施例可应用于各种通信系统,例如,全球移动通讯(Global System of Mobile communication,GSM)系统、码分多址(Code Division Multiple Access,CDMA)系统、宽带码分多址(Wideband Code Division Multiple Access,WCDMA)系统、通用分组无线业务(General Packet Radio Service,GPRS)、长期演进(Long Term Evolution,LTE)系统、LTE频分双工(Frequency Division Duplex,FDD)系统、LTE时分双工(Time Division Duplex,TDD)、通用移动通信系统(Universal Mobile Telecommunication System,UMTS),或者下一代无线通信系统等。在上述的系统中的基站或者终端使用传统Turbo码、LDPC码编码处理的信息或者数据都可以使用本实施例中的Polar码编码。
图1为一种无线通信系统结构示意图。本申请实施例可以应用于无线通信系统,如图1所示,无线通信系统,可选的由小区组成,每个小区包含一个网络侧设备,例如基站。网络侧设备向一个或者多个终端或者移动台(英文:Mobile Station,简称:MS)提供通信服务,其中网络侧设备可以连接到核心网设备。
基站可以是用于与终端设备进行通信的设备。例如,可以是GSM系统或CDMA中的基站(Base Transceiver Station,BTS),也可以是WCDMA系统中的基站(NodeB,NB),还可以是LTE系统中的演进型基站(Evolved Node B,eNB或eNodeB)。或者该基站可以为中继站、接入点、车载设备、可穿戴设备以及未来5G网络中的网络侧设备等。基站还可以为终端对终端(Device to Device,D2D)通信中担任基站功能的终端。
终端可以是经无线接入网(Radio Access Network,RAN)与一个或多个核心网进 行通信。终端可以指用户设备(User Equipment,UE)、接入终端、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、无线通信设备、用户代理或用户装置。接入终端可以是蜂窝电话、无绳电话、会话启动协议(Session Initiation Protocol,SIP)电话、无线本地环路(Wireless Local Loop,WLL)站、个人数字处理(Personal Digital Assistant,PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备,未来5G网络中的终端设备等。
为了便于理解,以下结合图2至图5,对本发明实施例的用于极化编码的方法100进行详细说明。
图2a以及图2b所示为一种无线通信系统中物理层的处理流程过程,在发送端,信源通过信源编码再经过信道编码,或者速率匹配,经过数字调制,经过信道发送到接收端。在接收端,通过信道接收的信号经过数字解调,解速率匹配,信道解码,信源解码,从而得到信宿。其中,本发明实施方式中,采用了具有累进式交织特性的交织方法(或称累进交织)。参考图2a该交织的过程可以在信道编码后,速率匹配前,交织时的待交织序列长度为Polar码长度N;参考图2b也可以在速率匹配之后进行,交织时的待交织序列长度为速率匹配后的目标长度M。
本发明实施方式涉及信道编码和信道解码,其中,信道编码:用于增加冗余,提高信息流在信道传输中的鲁棒性。一般可以是Turbo码,极化(或称Polar)码或者低密度奇偶校验码(Low-density Parity-check Code,简称LDPC码)。本发明实施方式主要是关注采用Polar码的信道编码方法以及相应的解码方法与装置,但也不限于可以应用于各种通信系统中,包括能支持两种以上编解码方式的通信系统中,此处不赘述。
为方便理解,现将前述以及后续可能用到的符号的定义说明如下:
K:非固定比特的长度,其中非固定比特包括信息比特,可选的还包括校验比特,辅助译码的比特等;
N:目标量化序列,或称Polar码母码长度(为2的整数次幂)
M:目标码长(在编码侧M是后续发送时的序列的码长,如果polar编码后需要速率匹配,指从Polar码母码长度N经过速率匹配后得到的码长;在译码侧M是原始接收到的码长,经过解速率匹配后得到目标量化序列长度N)。
参考图3,简单的示出了一种通信系统中Polar码的构造方法以及基于该构造方法的编解码的方法的流程图。在该方法中,采用具有累进式交织特性的交织方法,根据该交织方法构造Polar码。按此方法构造的Polar码具有累进式交织特性,即给定待编码序列Q1,对其进行Polar码编码得到编码后码字C1,对C1进行累进式交织得到序列C2,对C2可直接进行Polar码译码,得到译码后比特序列Q2,若译码过程正确,则对Q2做累进式解交织即可得到原待编码序列Q1。所述过程等效于先对序列C2进行解交织得到C1,再译码得到Q1。本发明所述方法构造的Polar码具有可控的冗余版本数量,即可以控制累进式交织的最小次数,以便携带足够多的隐式信息。更具体的,采用上述构造方法构造的Polar码可以应用于PBCH等等需要隐式的传输信息的场景。
上述累进式交织指的是对于待交织序列,采用特定的交织操作进行多次累进的交织操作。后续将举例说明。冗余版本数量即累进的交织操作的次数。其中,循环交织是累进式交织的一个特例,指在进行多次累进的交织操作后,得到的序列与原待交织序列相同。
在一些例子中,基于交织操作,获得一个或者多个互斥的Polar码子信道位置的子集,其中,每个所述子集中的子信道位置经过任何次数的前述交织操作,仍然属于所 述子集中,不属于其他子集中。基于前述子集,构造Polar码。例如,选择第一部分子集为信息比特位置集合;或者,选择第二部分子集为冻结比特位置集合,所述第一部分子集中的任意一个与所述第二部分子集中的任意一个不同。在需要速率匹配时,选择第三部分子集为打孔位置集合;其中所述第三部分子集中的子集不同于所述第一部分子集和第二部分子集中的任意一个。
上述通过进行多次交织操作得到的多个交织后的序列的冗余版本可以用于隐式的携带部分信息,例如PBCH等中的隐式传输的信息。
采用本发明实施方式的Polar码具有可控的冗余版本数量。具体的,可以根据应用场景需求确定冗余版本数量,例如某场景需要Polar码通过至少8个冗余版本携带3比特隐式信息,则初始构造Polar码时,我们就选择一个周期r大于等于8的交织序列,基于该交织序列构造Polar码。这里面“周期r”是指交织r次之后变回原序列。
具体的,具有上述交织特性的Polar码构造方法包括:
101、根据当前传输的需要,确定Polar码编码参数,包括母码长度N,目标码长M,信息比特长度K等。
其中,对于Polar码的母码长度N,则Polar码的生成矩阵G
N为NxN矩阵,矩阵中包含n=log
2(N)个基序列,G
N中除了全1行外,其他的行都是由部分或者全部基序列所在的行互相之间进行与操作得到的。具体可以参考后续的举例说明,例如以传输PBCH为场景,此处不赘述。
102、根据需要隐式传输的比特数量,确定Polar码交织操作的冗余版本数量r,具体的,log
2(r)不小于所需隐式传输比特数量。
103、确定冗余版本数量为r的基序列的交织操作π和长为N=2
n的序列的交织操 作ρ。
其中,一个例子中,相应的,根据基序列的交织操作π得到对长为N=2
n的序列的交织操作ρ;
其中(i
m-1,i
m-2,...,i
0)
2是i的二进制表示。
其中,可以理解的是如下对编码后的比特序列c的交织操作
等同于如下对编码前比特序列u的交织操作
104、根据交织操作π或者ρ得到对子信道位置集合的划分,得到t个互斥子集(orbit)o
1,o
2,o
3,…,o
t。
其中,根据该交织处理,将子信道位置(或称序号)集合分为互斥的多个子集(也可以称为轨迹orbit)。每个子集中的元素(序号)无论经过多少次交织操作处理,仍然落在该子集中。该交织操作例如前述针对n长基序列的交织操作π或者针对N长序列的交织操作ρ。简而言之,任意两个互斥的集合是指这两个集合不包含任意一个相同的元素。
105、根据K在前述子集(orbit)o
1,o
2,o
3,…,o
t中选择信息比特位置集合。
具体的,在前述多个互斥的子集中,选择某些互斥子集,使被选择的一个或多个 互斥子集的并集中包含K个元素,所述被选择的一个或多个互斥子集的并集即为信息比特位置集合,集合中的K个元素即为信息比特位置。具体的,在这些子集的元素加起来等于K以外,选择哪个或哪几个子集作为信息比特位置集合,本实施方式没有特殊的限定。
当然,信息比特位置集合的选择会影响码的性能(例如BLER性能),本发明实施方式也可以结合其他可能的选择信息比特集合的实施方式,本文不做赘述。
可选的,106、如果目标码长M和根据母码长度N不同,即需要速率匹配时,根据母码长度N,目标码长M选择打孔位置集合。
本领域技术人员知道,107、在信息比特位置集合和打孔位置集合之外的剩余子集为冻结比特位置集合。
可替换的,本领域技术人员也知道,上述104、105、106也可以替换为:该交织处理将序号集合分为多个子集后先选择部分子集的并集作为冻结比特位置集合,这样,除冻结比特位置集合和可能的打孔位置集合之外的剩余子集,为信息比特位置集合。
相应的,本发明实施方式还提供了在前述Polar码的构造方式基础上进行编解码的方法,或者传输信息的方法:
108、根据上述构造的Polar码进行编解码以及后续的处理。例如108a、在发送端在不同的时序i进行r
i次累进的交织、针对各个交织的结果分别进行速率匹配、调制或者资源映射并发送等处理;或者,108b、在接收端,进行相应的逆操作,其中,通过盲检测获得前述i的信息,该信息为通过Polar码隐式传输的信息,通过一般的逆操作或者其他正式传输的信息比特。
需要说明的是,本发明各实施方式的发送端可以是终端,此时接收端为网络侧设备,例如基站等。如果发送端为基站等网络测设备,则接收端为终端。在特定场景下, 例如针对PBCH,发送端是基站等网络测设备,接收端是终端。
参考图4a-4c,从编码侧介绍了装置和相应的方法或者工作原理。参考图4a一个实施方式中的一种Polar码的发送方法,在发送端:
401a、获得待编码序列。
例如,在PBCH的通信场景下,针对待发送的主信息块MIB,通过添加CRC比特,得到待编码序列。当然,本发明实施方式可以应用于其他通信的场景。另外本发明实施方式也不限定获得待编码序列的其他方式。
402a、Polar编码得到编码后的序列x
1
N。
根据前述图3所示的实施方式构造出的Polar码,将前述待编码序列作为非固定比特位置集合(信息比特位置集合)的输入,进行编码,得到编码后的序列x
1
N。
403a、在每个时序对前一个时序交织的结果,进行累进式交织。即在第i个时序,对x
1
N进行针对上一次交织结果的再一次交织(记为第Ti次交织),其中1<=i<=r,r为总时序个数,也是总的冗余版本个数。
累进式交织在具体实现时,可以采取多种方案,本实施方式不不限于此,可以参考图4c等其他方案。
404a、对每个时序交织后的序列进行速率匹配。
405a、对速率匹配后的序列进行调制与资源映射并发送。
可以替换的,针对图4b,与图4a中方法不同的是,先进行可选的速率匹配,再进行累进式交织操作,当然,本实施方式中的交织操作是针对速率匹配后的序列x
1
M.,因而交织操作本身也会进行适应性的调整,例如,将被打孔子信道位置从交织序列中删除,此处不再赘述。
可以替换的,在具体的实现过程中,也可以通过别的安排实现前述的方案,例如如图4c所示,图4a的方案可以等同的替换为:在不同的时序,进行不同次数的多次 累进交织。在时序i,针对编码后的序列x
1
N进行i次累进交织(即第T
1,T
2…到T
i次交织)。相对于图4a的方案,其缓存了多个编码后的序列x
1
N,以便于针对该多个编码后的序列x
1
N分别进行i次累进交织。
同理,图4b的方案也可以替换为图4d的技术方案,本文不再赘述。
参考图2a的下半部分,针对接收侧收到的信号,在接收侧,经过数字解调,可选的解速率匹配,得到对数似然比(Log Likelihood Ratio,LLR)。
图5示出了根据本发明实施例的在译码侧的装置结构和工作原理的示意图。在接收端的一个实施方式中的一种Polar码的接收方法:接收到一份信号,经过解资源映射、数字解调,以及可选的解速率匹配等操作,得到一份LLR,尝试译码,若译码失败,则进一步接收多份信号,得到多份LLR,进行软合并,并对软合并后的LLR进行尝试译码。该方法包括:
501、不需要软合并时,P=1,表示仅收到一份LLR。若需要软合并,接收到连续P(P<=r)份的LLR,对接收到的第i份LLR解交织Si次,其中1<=i<=P,Si为差值为Δ等差序列。然后对解交织后的每份LLR进行软合并。实施方式中以PBCH为信息比特的举例,但本实施方式不限于此。
502、将LLR(需要软合并时为软合并后的LLR)进行Polar码译码,得到译码比特序列;
503、对译码比特序列解交织Si次,其中1<=i<=r-P+1,并对每次解交织得到的比特序列进行CRC校验;
504、通过上述CRC校验的解交织序列对应的解交织次数Si,得到当前时序i。该当前时序i隐含的指示了某些信息,此处不再赘述。
前述实施方式过程中,提到了针对Polar码的交织方法及相应的构造Polar码的方法,下面以具体举例进行介绍。
对于Polar码的母码长度N,则Polar码的生成矩阵G
N为NxN矩阵,矩阵中包含n=log
2(N)个基序列,G
N中除了全1行外,其他行都是由基序列所在的行互相之间进行与操作得到的。
以N=8为例,如图6所示,第4,6,7行为基序列,分别记为x
2,x
1和x
0,其他行,除了全1的第8行外,都是基序列之间进行与操作得到的。例如第2行,是x
2和x
1与操作得到的,记为x
2x
1,第3行为x
2x
0。将生产矩阵的所有行从下到上从0开始标号,得到[7 6 5 4 3 2 1 0],其二进制表示为[111 110 101 100 011 010 001 000],行号的二进制表示[x
2x
1x
0]正好指示了该行是由哪个或哪几个基序列做“与”操作得到的。例如行号为6,二进制表示为[110],是x
2和x
1与操作得到的。
记编码前的待编码序列为u=[u
0 u
1 u
2 u
3 u
4 u
5 u
6 u
7],定义
f
u(x
2,x
1,x
0)=u
0·x
2x
1x
0+u
1·x
2x
1+u
2·x
2x
0+u
3·x
2+u
4·x
1x
0+u
5·x
1+u
6·x
0+u
7·1
则polar码的编码过程可以写作
u·G
8=c=(c
0,c
1,c
2,c
3,c
4,c
5,c
6,c
7)=(f
u(7),f
u(6),f
u(5),f
u(4),f
u(3),f
u(2),f
u(1),f
u(0))
以u=[0 0 0 1 0 0 1 0],则编码后结果为
u·G
8=(f
u(1,1,1),f
u(1,1,0),f
u(1,0,1),f
u(1,0,0),f
u(0,1,1),f
u(0,1,0),f
u(0,0,1),f
u(0,0,0))=(0,1,0,1,1,0,1,0)
下面,如果对基序列做交织π,交织方法例如π(x
0)=x
1,π(x
1)=x
2,π(x
2)=x
0。
针对编码后的比特序列c(或称码字c)的交织记为:
对编码前比特序列的交织记为:
其中,
π
u(u
0,u
1,u
2,u
3,u
4,u
5,u
6,u
7)=(u
0,u
2,u
4,u
6,u
1,u
3,u
5,u
7)
可以看到,π
c对编码后的比特序列c的交织和π
u对编码前比特u的交织的结果是相同的。
π
c和π
u对码字c和编码前比特u所做的交织相同,它具有一个特点:记交织前序列中比特的序号集合为{0,1,2,…,N-1},则该交织处理将序号集合分为互斥的多个子集(称为orbit),子集中序号无论经过多少次交织处理,仍然落在该子集中。继续用以上例子为例,序号集合{0,1,2,3,4,5,6,7}被分为{0},{1,2,4},{3,5,6},{7}四个子集(orbit)。即对于编码前比特序列u而言,无论经过多少次交织,u
2只会被交织到第1,2,4号位置(位置序号从0开始)。编码后的比特序列c亦是如此。
若对n长序列进行r次交织操作π后得到原序列,则上述方法得到π
c,对N=2
n长序列进行r次交织操作π
c也可以得到原序列。π
u亦是如此。则可以说,由此方法得到的交织操作可以得到编码前序列u或者编码后序列c的r个冗余版本。由此可知,按此方法,可以控制冗余版本数量r。
若使得Polar码编码后的序列的交织后序列无需解交织就可以译码,则需要Polar 码中信息比特位置在交织后仍然在信息比特的位置,冻结比特位置交织后仍然在冻结比特的位置。考虑到上述交织操作π
c和π
u,将序号集合(即比特位置集合)分为多个子集,子集中序号经过交织后仍落在集合内。这样,参考前述图2b,可以对于上述交织方法π
c或者π
u,选择某些子集中的比特位置为信息比特位,另外一些子集中的比特位置为冻结比特位。由上述分析可知,这样构造的Polar码符合交织后的码字无需解交织,可直接译码的要求。仍以N=8为例,K=4,则可以选择{0},{1,2,4}为冻结比特位,{3,5,6}{7}为信息比特位。
通过本实施方式中的方法,Polar码编码后码字的交织后序列仍然可以直接译码。通过不同次数的交织操作得到的不同的冗余版本可以携带不同的隐式信息。还可以在译码侧对多个冗余版本进行软合并,获得能量叠加带来的增益。
在另一个例子中,以符合LTE-PBCH配置的需求为例,给出一种Polar的交织及相应的构造方法。其中,目标码长M=480,Polar母码长度为N=512,信息比特长度为K=40,基序列数量为log
2(512)=9。
对基序列的交织为:
π(x
0)=x
1,π(x
1)=x
2,π(x
2)=x
3,π(x
3)=x
4,π(x
5)=x
6,π(x
6)=x
7,π(x
7)=x
0,π(x
8)=x
8.
可以得到对应对编码后的序列的交织操作π
c和对编码前的序列的交织操作π
u,由上述描述可知π
c和π
u相同,可由交织序列ρ表示,本实施例中ρ如下,其中,ρ(i)=j表示,交织后序列的第i位为交织前序列的第j位。
{1 129 2 130 3 131 4 132 5 133 6 134 7 135 8 136 9 137 10 138 11 139 12 140 13 141 14 142 15 143 16 144 17 145 18 146 19 147 20 148 21 149 22 150 23 151 24 152 25 153 26 154 27 155 28 156 29 157 30 158 31 159 32 160 33 161 34 162 35 163 36 164 37 165 38 166 39 167 40 168 41 169 42 170 43 171 44 172 45 173 46 174 47 175 48 176 49 177 50 178 51 179 52 180 53 181 54 182 55 183 56 184 57 185 58 186 59 187 60 188 61 189 62 190 63 191 64 192 65 193 66 194 67 195 68 196 69 197 70 198 71 199 72 200 73 201 74 202 75 203 76 204 77 205 78 206 79 207 80 208 81 209 82 210 83 211 84 212 85 213 86 214 87 215 88 216 89 217 90 218 91 219 92 220 93 221 94 222 95 223 96 224 97 225 98 226 99 227 100 228 101 229 102 230 103 231 104 232 105 233 106 234 107 235 108 236 109 237 110 238 111 239 112 240 113 241 114 242 115 243 116 244 117 245 118 246 119 247 120 248 121 249 122 250 123 251 124 252 125 253 126 254 127 255 128 256 257 385 258 386 259 387 260 388 261 389 262 390 263 391 264 392 265 393 266 394 267 395 268 396 269 397 270 398 271 399 272 400 273 401 274 402 275 403 276 404 277 405 278 406 279 407 280 408 281 409 282 410 283 411 284 412 285 413 286 414 287 415 288 416 289 417 290 418 291 419 292 420 293 421 294 422 295 423 296 424 297 425 298 426 299 427 300 428 301 429 302 430 303 431 304 432 305 433 306 434 307 435 308 436 309 437 310 438 311 439 312 440 313 441 314 442 315 443 316 444 317 445 318 446 319 447 320 448 321 449 322 450 323 451 324 452 325 453 326 454 327 455 328 456 329 457 330 458 331 459 332 460 333 461 334 462 335 463 336 464 337 465 338 466 339 467 340 468 341 469 342 470 343 471 344 472 345 473 346 474 347 475 348 476 349 477 350 478 351 479 352 480 353 481 354 482 355 483 356 484 357 485 358 486 359 487 360 488 361 489 362 490 363 491 364 492 365 493 366 494 367 495 368 496 369 497 370 498 371 499 372 500 373 501 374 502 375 503 376 504 377 505 378 506 379 507 380 508 381 509 382 510 383 511 384 512}
以及根据前述交织操作,对子信道位置(序号)集合的划分,列出其中的一部分集合如下:
{511},
{510,509,507,503,495,479,447,383},
{255},
{508,505,499,487,463,415,319,382},
{506,501,491,471,431,351,446,381},
{502,493,475,439,367,478,445,379},
{494,477,443,375},
{254,253,251,247,239,223,191,127},
......
{0},
{1,2,4,8,16,32,64,128},
{256},
{3,6,12,24,48,96,192,129},
{5,10,20,40,80,160,65,130},
{9,18,36,72,144,33,66,132},
{17,34,68,136},
{257,258,260,264,272,228,320,384},
对于K=40,选择{510,509,507,503,495,479,447,383}∪{508,505,499,487,463,415,319,382}∪{506,501,491,471,431,351,446,381}∪{502,493,475,439,367,478,445,379}∪{254,253,251,247,239,223,191,127}等5个子集,每个子集中有8个元素,共40个元素所对应的序号即为信息比特位置。
在本实施方式中,需要速率匹配去掉N-M=32个子信道,可以将{0}∪ {1,2,4,8,16,32,64,128}∪{256}∪{17,34,68,136}∪{3,6,12,24,48,96,192,129}∪{5,10,20,40,80,160,65,130}∪{9,18,36,72,144,33,66,132}所包含的32个子信道打孔。最后得到K=40,M=480的polar码构造。
具体的,为了描述方便,前述序列可以简单的记为集合o:O(u
511)={511},
O(u
510)={510,509,507,503,495,479,447,383},
O(u
255)={255},
O(u
508)={508,505,499,487,463,415,319,382},
O(u
506)={506,501,491,471,431,351,446,381},
O(u
502)={502,493,475,439,367,478,445,379},
O(u
494)={494,477,443,375},
O(u
254)={254,253,251,247,239,223,191,127},
......
O(c
0)={0},
O(c
1)={1,2,4,8,16,32,64,128},
O(c
256)={256},
O(c
3)={3,6,12,24,48,96,192,129},
O(c
5)={5,10,20,40,80,160,65,130},
O(c
9)={9,18,36,72,144,33,66,132},
O(c
17)={17,34,68,136},
O(c
257)={257,258,260,264,272,228,320,384}
前述的方案也可以采用前述的集合符号表示为:对于K=40,选择O(u
510)∪O(u
508)∪O(u
506)∪O(u
502)∪O(u
254)等5个子集,每个子集中有8个元素,共40个元素所对应的序号即为信息比特位置。同时需要速率匹配去掉N-M=32个子信道,可以将O(c
0)∪O(c
1)∪O(c
256)∪O(c
17)∪O(c
3)∪O(c
5)∪O(c
9)所包含的32个子信道打孔。最后得到K=40,M=480的polar码构造。此处不再赘述。
具体的,无论是编码侧还是解码侧,都可以通过本发明实施方式提供的方法或者工作原理及装置,得到Polar码的信息比特位置集合或者冻结比特位置集合,以应用于编码或者解码的过程。
以上结合图1至图6,详细说明了根据本发明实施例的确定Polar码结构的方法,在polar编码或者解码中的应用,以及通过交织携带隐式信息的方法。其中,图2a、图2b也分别提供了Polar码编解码的装置的结构,图4a-图4c从编码侧描述了该装置的工作原理,图5从解码侧描述了该装置的工作原理。各模块的工作原理或者功能可以参考前述方法流程,此处不再赘述。
参考图2a,图2b,图4a-图4c或者图5,在另一方面,本发明实施方式相应的提供了一种通信系统中Polar码编解码的装置,包括Polar码结构确定模块(201),和,Polar码编解码模块(202),其中,
所述Polar码结构确定模块(201)用于根据交织操作或者相应的解交织操作确定Polar码的信息比特位置集合或者冻结比特位置集合;
所述Polar码编解码模块(202),用于基于所述Polar码结构确定模块(201)确定的信息比特位置集合或者冻结比特位置集合进行Polar码编码或者解码。
可选的,Polar码结构确定模块(201)还用于根据传输的需要确定所述交织操作。
具体的例子中,Polar码结构确定模块(201)用于:获得一个或者多个互斥的Polar码子信道位置的子集,其中,每个所述子集中的子信道位置经过任何次数的前述交织操作,仍然属于所述子集中,且不属于其他子集中;选择第一部分子集为信息比特位置集合;或者,选择第二部分子集为冻结比特位置集合,所述第一部分子集中的任意一个与所述第二部分子集中的任意一个不同。
可选的,所述Polar码结构确定模块(201)还用于:在需要速率匹配时,选择第三部分子集为打孔位置集合;其中所述第三部分子集中的子集不同于所述第一部分子集和第二部分子集中的任意一个。
具体的例子中,所述装置还包括:
交织模块(203),用于在所述Polar码编码后进行交织操作,所述交织操作隐式的携带特定信息。
在接收侧,参考图5,还包括:解交织模块,用于在所述Polar码解码后进行所述解交织操作,获得隐式携带的特定信息。
可选的,前述装置用于无线通信系统中物理广播信道PBCH的传输。
本领域技术人员可以理解,上述Polar码编解码器可以硬件或者软硬件结合的方式实现。以下结合图7,对根据本发明实施例的用于Polar码结构确定装置,以及相应的可用于编码、解码的通信装置600进行说明。
可以替换的,通信装置600可配置成通用处理系统,例如通称为芯片,该通用处理系统包括:提供处理器功能的一个或多个微处理器;以及提供存储介质603的至少一部分的外部存储器,所有这些都通过外部总线体系结构与其它支持电路连接在一起。
可替换的,通信装置600可以使用下述来实现:具有处理器602、总线接口604、用户接口606的ASIC(专用集成电路);以及集成在单个芯片中的存储介质603的至少一部分,或者,通信装置600可以使用下述来实现:一个或多个FPGA(现场可编程门 阵列)、PLD(可编程逻辑器件)、控制器、状态机、门逻辑、分立硬件部件、任何其它适合的电路、或者能够执行本发明通篇所描述的各种功能的电路的任意组合。
图7为本发明实施例所提供的通信装置600的结构示意图(例如接入点或基站、站点或者终端等通信装置,或者前述通信装置中的芯片等)。
在一种实施方式中,如图6所示,通信装置600,可以由总线601作一般性的总线体系结构来实现。根据通信装置600的具体应用和整体设计约束条件,总线601可以包括任意数量的互连总线和桥接。总线601将各种电路连接在一起,这些电路包括处理器602、存储介质603和总线接口604。可选的,通信装置600使用总线接口604将网络适配器605等经由总线601连接。网络适配器605可用于实现无线通信网络中物理层的信号处理功能,并通过天线607实现射频信号的发送和接收。用户接口606可以连接用户终端,例如:键盘、显示器、鼠标或者操纵杆等。总线601还可以连接各种其它电路,如定时源、外围设备、电压调节器或者功率管理电路等,这些电路是本领域所熟知的,因此不再详述。
其中,处理器602负责管理总线和一般处理(包括执行存储在存储介质1203上的软件)。处理器602可以使用一个或多个通用处理器和/或专用处理器来实现。处理器的例子包括微处理器、微控制器、DSP处理器和能够执行软件的其它电路。应当将软件广义地解释为表示指令、数据或其任意组合,而不论是将其称作为软件、固件、中间件、微代码、硬件描述语言还是其它。
在下图中存储介质603被示为与处理器602分离,然而,本领域技术人员很容易明白,存储介质603或其任意部分可位于通信装置600之外。举例来说,存储介质603可以包括传输线、用数据调制的载波波形、和/或与无线节点分离开的计算机制品,这些介质均可以由处理器602通过总线接口604来访问。可替换地,存储介质603或其任意部分可以集成到处理器602中,例如,可以是高速缓存和/或通用寄存器。
处理器602可执行上述实施例中,例如,图2a,图2b,图4a-图4c或者图5及相应的实施方式中的方法,在此不再对处理器602的执行过程进行赘述。
本申请实施例所说的通信装置,可以是接入点、站点、基站或者用户终端等无线通信设备。
本申请实施例所说的的Polar码,包括但不限于Arikan Polar码,还可以是CA-Polar码或者PC-Polar码。Arikan Polar是指原始的Polar码,没有与其它码级联,只有信息比特和冻结比特。CA-Polar码是Polar码级联了循环冗余校验(Cyclic Redundancy Check,简称CRC)的Polar码,PC-Polar码是Polar码级联了奇偶校验(Parity Check,简称PC)的码。PC-Polar和CA-Polar是通过级联不同的码来提高Polar码的性能。
本申请实施例所说的“信息比特序列”,也可以叫做“待编码比特序列”或者“信息比特集合”,相应的,“信息比特个数”可以是待编码比特序列中待编码比特的个数,或者信息比特集合中的元素个数。
本申请实施例描述的各示例的单元及方法过程,能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行,取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能。
在本申请所提供的几个实施例中,应该理解到,所揭露的装置和方法,可以通过其它的方式实现。例如,以上所描述的装置实施例仅仅是示意性的,例如,所述单元的划分,仅仅为一种逻辑功能划分,实际实现时可以有另外的划分方式。例如多个单元或组件可以结合或者可以集成到另一个系统,或一些步骤可以忽略,或不执行。此外,各个单元相互之间的耦合或直接耦合或通信连接可以是通过一些接口实现,这些可以是电性、机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的,既可以位于 一个地方,也可以分布到多个网络单元上。
另外,在本申请各个实施例中的各功能单元可以集成在一个处理单元中,也可以是各个单元单独物理存在,也可以两个或两个以上单元集成在一个单元中。
在上述实施例中,可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时,可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机程序指令时,全部或部分地产生按照本发明实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中,或者从一个计算机可读存储介质向另一个计算机可读存储介质传输,例如,所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质,(例如,软盘、硬盘、磁带)、光介质(例如,DVD)、或者半导体介质(例如固态硬盘Solid State Disk(SSD))等。
Claims (14)
- 一种通信系统中Polar码编解码的方法,其特征在于,根据交织操作或者相应的解交织操作确定Polar码的信息比特位置集合或者冻结比特位置集合;基于所述确定的信息比特位置集合或者冻结比特位置集合进行Polar码编码或者解码。
- 根据权利要求1所述的编解码的方法,其特征在于,所述方法还包括:根据传输的需要确定所述交织操作。
- 根据权利要求2所述的方法,其特征在于,根据所述交织操作确定Polar码的信息比特位置集合或者冻结比特位置集合包括:获得一个或者多个互斥的Polar码子信道位置的子集,其中,每个所述子集中的子信道位置经过任何次数的前述交织操作,仍然属于所述子集中,且不属于其他子集中;选择第一部分子集为信息比特位置集合;或者,选择第二部分子集为冻结比特位置集合,所述第一部分子集中的任意一个与所述第二部分子集中的任意一个不同。
- 根据权利要求3所述的方法,其特征在于,所述方法还包括:在需要速率匹配时,选择第三部分子集为打孔位置集合;其中所述第三部分子集中的子集不同于所述第一部分子集和第二部分子集中的任意一个。
- 根据权利要求1所述的方法,其特征在于,所述方法还包括:在所述Polar码编码后进行所述交织操作,所述交织操作隐式的携带特定信息。
- 根据权利要求1所述的方法,其特征在于,所述方法还包括:在所述Polar码解码后进行所述解交织操作,得到所述交织操作隐式携带的特定信 息。
- 根据权利要求1-6任一所述的方法,其特征在于,所述方法还包括:所述Polar码编解码的方法应用于无线通信系统中物理广播信道PBCH的传输。
- 一种通信系统中Polar码编解码的装置,其特征在于,包括Polar码结构确定模块(201),和,Polar码编解码模块(202),其中,所述Polar码结构确定模块(201)用于根据交织操作或者相应的解交织操作确定Polar码的信息比特位置集合或者冻结比特位置集合;所述Polar码编解码模块(202),用于基于所述Polar码结构确定模块(201)确定的信息比特位置集合或者冻结比特位置集合进行Polar码编码或者解码。
- 根据权利要求8中Polar码编解码的装置,其特征在于,包括Polar码结构确定模块(201,502)还用于根据传输的需要确定所述交织操作。
- 根据权利要求9中Polar码编解码的装置,其特征在于,所述Polar码结构确定模块(201,502)用于:获得一个或者多个互斥的Polar码子信道位置的子集,其中,每个所述子集中的子信道位置经过任何次数的前述交织操作,仍然属于所述子集中,且不属于其他子集中;选择第一部分子集为信息比特位置集合;或者,选择第二部分子集为冻结比特位置集合,所述第一部分子集中的任意一个与所述第二部分子集中的任意一个不同。
- 根据权利要求10所述的装置,其特征在于,所述装置还包括:所述Polar码结构确定模块(201,502)还用于:在需要速率匹配时,选择第三部分子集为打孔位置集合;其中所述第三部分子集中的子集不同于所述第一部分子集和第二部分子集中的任意一个。
- 根据权利要求10所述的装置,其特征在于,所述装置还包括:交织模块,用于在所述Polar码编码后进行交织操作,所述交织操作隐式的携带特定 信息
- 根据权利要求10所述的装置,其特征在于,所述装置还包括:解交织模块,用于在所述Polar码解码后进行所述解交织操作,获得隐式携带的特定信息。
- 根据权利要求8-12任一所述的装置,其特征在于,所述装置用于无线通信系统中物理广播信道PBCH的传输。
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP18780862.1A EP3595209A4 (en) | 2017-04-05 | 2018-03-24 | CODING METHOD, DECODING METHOD, DEVICE AND DEVICE |
US16/585,467 US11239945B2 (en) | 2017-04-05 | 2019-09-27 | Encoding method, decoding method, apparatus, and device |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710218791.9 | 2017-04-05 | ||
CN201710218791.9A CN108696333B (zh) | 2017-04-05 | 2017-04-05 | Polar码编解码的方法、装置和设备 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US16/585,467 Continuation US11239945B2 (en) | 2017-04-05 | 2019-09-27 | Encoding method, decoding method, apparatus, and device |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2018184480A1 true WO2018184480A1 (zh) | 2018-10-11 |
Family
ID=63712320
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2018/080404 WO2018184480A1 (zh) | 2017-04-05 | 2018-03-24 | 一种编码方法、译码方法、装置和设备 |
Country Status (4)
Country | Link |
---|---|
US (1) | US11239945B2 (zh) |
EP (1) | EP3595209A4 (zh) |
CN (1) | CN108696333B (zh) |
WO (1) | WO2018184480A1 (zh) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108809486B (zh) * | 2017-05-03 | 2020-09-04 | 华为技术有限公司 | Polar码编译码方法及装置 |
CN108809500B (zh) | 2017-05-05 | 2020-12-22 | 华为技术有限公司 | 编码方法、装置和设备 |
WO2019021225A1 (en) * | 2017-07-26 | 2019-01-31 | Telefonaktiebolaget Lm Ericsson (Publ) | IMPROVED INFORMATION SEQUENCES FOR POLAR CODES |
US11594048B2 (en) | 2021-03-12 | 2023-02-28 | Agot Co. | Image-based kitchen tracking system with anticipatory preparation management |
CN117155410A (zh) * | 2022-05-23 | 2023-12-01 | 华为技术有限公司 | 一种编码、译码方法及装置 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104079370A (zh) * | 2013-03-27 | 2014-10-01 | 华为技术有限公司 | 信道编译码方法及装置 |
CN104219019A (zh) * | 2013-05-31 | 2014-12-17 | 华为技术有限公司 | 编码方法及编码设备 |
WO2016154968A1 (zh) * | 2015-04-01 | 2016-10-06 | 华为技术有限公司 | 编码方法、装置、基站和用户设备 |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070104225A1 (en) * | 2005-11-10 | 2007-05-10 | Mitsubishi Denki Kabushiki Kaisha | Communication apparatus, transmitter, receiver, and error correction optical communication system |
CN101034953B (zh) * | 2006-03-06 | 2010-06-23 | 诺基亚西门子通信系统技术(北京)有限公司 | 应用低密度奇偶校验码进行数据传输的方法 |
CN109861694B (zh) * | 2013-11-20 | 2021-10-26 | 华为技术有限公司 | 极化码的处理方法和设备 |
WO2016119105A1 (zh) * | 2015-01-26 | 2016-08-04 | 华为技术有限公司 | 极化Polar码的生成方法和设备 |
US10728080B2 (en) * | 2016-05-20 | 2020-07-28 | Qualcomm Incorporated | Polar codes and modulation mappings |
CN107508652A (zh) * | 2016-06-14 | 2017-12-22 | 索尼公司 | 用于交织多址接入通信的电子设备和方法 |
US10931398B2 (en) * | 2016-12-06 | 2021-02-23 | Lg Electronics Inc. | Method and device for transmitting control information by using polar code |
US10348328B2 (en) * | 2017-01-06 | 2019-07-09 | At&T Intellectual Property I, L.P. | Reducing control channel overhead using polar codes |
JP6930107B2 (ja) * | 2017-01-06 | 2021-09-01 | ソニーグループ株式会社 | 基地局装置、端末装置、方法及び記録媒体 |
EP3494641A1 (en) * | 2017-01-10 | 2019-06-12 | Telefonaktiebolaget LM Ericsson (PUBL) | Coding and decoding of a polar code concatenated with interleaving with an outer systematic code |
US10313056B2 (en) * | 2017-02-06 | 2019-06-04 | Mitsubishi Electric Research Laboratories, Inc. | Irregular polar code encoding |
EP3376672B1 (en) * | 2017-03-13 | 2019-09-18 | Mitsubishi Electric R & D Centre Europe B.V. | Method for dynamically configuring a divide and conquer structure of a polar-code based encoder |
-
2017
- 2017-04-05 CN CN201710218791.9A patent/CN108696333B/zh active Active
-
2018
- 2018-03-24 EP EP18780862.1A patent/EP3595209A4/en active Pending
- 2018-03-24 WO PCT/CN2018/080404 patent/WO2018184480A1/zh unknown
-
2019
- 2019-09-27 US US16/585,467 patent/US11239945B2/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104079370A (zh) * | 2013-03-27 | 2014-10-01 | 华为技术有限公司 | 信道编译码方法及装置 |
CN104219019A (zh) * | 2013-05-31 | 2014-12-17 | 华为技术有限公司 | 编码方法及编码设备 |
WO2016154968A1 (zh) * | 2015-04-01 | 2016-10-06 | 华为技术有限公司 | 编码方法、装置、基站和用户设备 |
Non-Patent Citations (1)
Title |
---|
ZTE ET AL.: "Rate Matching of Polar Codes for eMBB", R1-1704385. 3GPPTSG RAN WG1 MEETING #88BIS, 25 March 2017 (2017-03-25), XP051251187 * |
Also Published As
Publication number | Publication date |
---|---|
CN108696333B (zh) | 2021-10-01 |
US20200028619A1 (en) | 2020-01-23 |
CN108696333A (zh) | 2018-10-23 |
EP3595209A4 (en) | 2020-03-25 |
US11239945B2 (en) | 2022-02-01 |
EP3595209A1 (en) | 2020-01-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11689220B2 (en) | Method and device for interleaving data | |
JP7026763B2 (ja) | レートマッチング方法、符号化装置、および通信装置 | |
WO2018184480A1 (zh) | 一种编码方法、译码方法、装置和设备 | |
CN109600194B (zh) | Polar编码方法和编码装置、译码方法和译码装置 | |
CN108604903B (zh) | 使用删余来生成具有可变块长度的极性码 | |
WO2018171790A1 (zh) | 一种数据传输方法及相关设备 | |
JP2020524946A (ja) | ポーラー符号化のための方法および装置 | |
CN109075799B (zh) | 极化Polar码的编译码方法及装置 | |
US10938422B2 (en) | Polar code rate matching method and apparatus, and a communications apparatus | |
WO2017101631A1 (zh) | 用于处理极化码的方法和通信设备 | |
US20050154957A1 (en) | Method and apparatus for decoding forward error correction codes | |
CN110800216A (zh) | 用于通信和广播系统的速率匹配的方法和装置 | |
CN108365850B (zh) | 编码方法、编码装置和通信装置 | |
WO2013152605A1 (zh) | 极性码的译码方法和译码装置 | |
WO2016172940A1 (zh) | 极性码的译码方法和译码装置 | |
CN108282259B (zh) | 一种编码方法及装置 | |
CN108540260B (zh) | 用于确定Polar码编解码的方法、装置和可存储介质 | |
WO2018166455A1 (zh) | 编码方法、编码装置和通信装置 | |
WO2021254422A1 (zh) | Polar码编码方法、Polar码译码方法及其装置 | |
US20230113448A1 (en) | Polar code rate matching method and apparatus | |
WO2018201983A1 (zh) | 极化码信道编码方法、设备以及通信系统 | |
WO2018210216A1 (zh) | 传输数据的方法、芯片、收发机和计算机可读存储介质 | |
WO2018141271A1 (zh) | 数据处理的方法和装置 | |
WO2018167980A1 (ja) | 通信装置、符号化方法、及び復号方法 | |
WO2018220857A1 (ja) | 通信装置、符号化方法、及び復号方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 18780862 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 2018780862 Country of ref document: EP Effective date: 20191009 |