WO2018228589A1 - 一种编码方法、无线设备和芯片 - Google Patents
一种编码方法、无线设备和芯片 Download PDFInfo
- Publication number
- WO2018228589A1 WO2018228589A1 PCT/CN2018/091826 CN2018091826W WO2018228589A1 WO 2018228589 A1 WO2018228589 A1 WO 2018228589A1 CN 2018091826 W CN2018091826 W CN 2018091826W WO 2018228589 A1 WO2018228589 A1 WO 2018228589A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- sequence
- length
- mother code
- numbers
- code sequence
- 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/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
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/63—Joint error correction and other techniques
- H03M13/635—Error control coding in combination with rate matching
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0041—Arrangements at the transmitter end
- H04L1/0043—Realisations of complexity reduction techniques, e.g. use of look-up tables
Definitions
- the present invention relates to the field of coding and, more particularly, to an encoding method, a wireless device, and a chip.
- 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 Polar code can obtain FER performance superior to LDPC and Turbo codes.
- the application provides an encoding method, a wireless device and a chip, which can reduce the storage overhead of the system.
- the application provides an encoding method, the method comprising:
- the length 2 n 'acquires a coding sequence of the mother code the length is 2 n' sequence comprise 2 n 'serial numbers, the length of the mother code sequence is 2 n, the mother code
- the sequence includes 2 n serial numbers, the 2 n serial numbers are part or all of the 2 n ' serial numbers, the n′ is a natural number, and the n is a natural number less than or equal to n′;
- the input bits to be encoded are encoded using the mother code sequence.
- the present application provides a wireless device including at least a memory, an interface, and an encoder:
- the encoder is configured to obtain an input bit to be encoded through the interface, and obtain the sequence of length 2 n′ from the memory; acquire a mother for encoding according to the sequence of length 2 n′ a code sequence, the length of the mother code sequence is 2 n , the mother code sequence includes 2 n serial numbers, and the 2 n serial numbers are part or all of the 2 n' serial numbers.
- n be a natural number less than or equal to n'; the input code to be encoded is encoded using the mother code sequence.
- the present application provides a chip including an interface and an encoder:
- the encoder is configured to obtain an input bit to be encoded through the interface
- the encoder is further configured according to the length 2 n 'of the coding sequence for acquiring mother code sequence, the length is 2 n' sequence comprise 2 n 'serial numbers, the master code sequence The length is 2 n , the mother code sequence includes 2 n serial numbers, the 2 n serial numbers are part or all of the 2 n ' serial numbers, and the n′ is a natural number, and the n a natural number less than or equal to n'; the input code to be encoded is encoded using the mother code sequence.
- the present application further provides a computer storage medium, where the program code is stored, and when the program code is executed by a computer or a processor, the following steps are implemented:
- the length 2 n 'acquires a coding sequence of the mother code the length is 2 n' sequence comprise 2 n 'serial numbers, the length of the mother code sequence is 2 n, the mother code
- the sequence includes 2 n serial numbers, the 2 n serial numbers are part or all of the 2 n ' serial numbers, the n′ is a natural number, and the n is a natural number less than or equal to n′;
- the input bits to be encoded are encoded using the mother code sequence.
- the present application further provides a computer program product, where the computer program product includes the above program code, and the computer program product may be stored in the storage medium of the fourth aspect, or may be stored on a server for downloading by a user. .
- n n'-1, according to the above aspects of length 2 n 'of the coding sequence for obtaining master code sequence comprising:
- the length of the 2 n' sequence is An even or odd sequence number obtains the mother code sequence.
- the mother code sequence for encoding can be obtained very quickly from the sequence of length 2 n' , and the algorithm is simple and easy to implement.
- obtaining the mother code sequence for encoding according to the sequence of length 2 n′ in the foregoing aspects includes: acquiring a mother code sequence for encoding according to a sequence of length 2 n′; Any one of the sequence numbers S' in the mother code sequence satisfies the following conditions:
- the S is a sequence number in the sequence of length 2 n' that satisfies the following conditions:
- V is an integer
- the mod is a remainder operator
- This implementation is applicable to mother code sequences of various lengths. As long as the length of the mother code sequence is less than or equal to 2 n' , the required mother code sequence can be taken from the sequence of length 2 n' .
- obtaining the mother code sequence for encoding according to the sequence of length 2 n′ in the above aspects comprises: 2 n′ binary sequences from the sequence of length 2 n′ The number is taken out by 2 n binary serial numbers, and the n'-n bits of the fixed position in each binary serial number of the 2 n binary serial numbers are equal to a preset value.
- the mother code sequence is formed by removing the remaining bits of n'-n bits of the fixed position according to each of the 2 n binary sequence numbers.
- This implementation is also applicable to mother code sequences of various lengths, and is simpler to implement. For example, it is possible to implement the selection of the above binary numbers by logic circuits.
- the ordering of 2 n sequence numbers in the mother code sequence in the mother code sequence is the same as the order in the sequence of length 2 n ' . Since the channels in the sequence of length 2 n' are fixedly ordered, the channels in the selected mother code sequences are also fixedly ordered, which facilitates direct mapping of information bits to highly reliable channels for subsequent encoding. .
- each sequence corresponds to a different value of n′, when it is determined that the length of the required mother code sequence is 2 n .
- a corresponding sequence may be selected from the plurality of sequences, and a mother code sequence for encoding may be obtained from the sequence selected according to the selection.
- the memory in the wireless device can store the plurality of different sequences of length 2 n' for encoder selection.
- the system can store one or several long sequences, and then obtain a required mother code sequence from one of the long sequences according to the needs of the coding, thereby reducing the storage overhead of the system.
- FIG. 1 is a schematic structural diagram of a wireless communication network according to an embodiment of the present invention.
- FIG. 2 is a schematic diagram of a codec process according to an embodiment of the present invention.
- FIG. 3 is a schematic diagram of a coding process according to an embodiment of the present invention.
- FIG. 4(a) is a schematic diagram of a method for acquiring a mother code according to an embodiment of the present invention.
- 4(b) is a schematic diagram of another method for acquiring a mother code according to an embodiment of the present invention.
- FIG. 5 is a schematic diagram of a method for acquiring a mother code according to another embodiment of the present invention.
- FIG. 6 is a schematic structural diagram of a wireless device 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), and the like.
- 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 network according to an embodiment of the present invention.
- FIG. 1 is only an example, and other wireless networks that can use the encoding method or apparatus of the embodiments of the present invention are also within the scope of the present invention.
- the wireless communication network 100 includes a network device 110, and a terminal 112.
- the network device 110 can also be connected to the core network.
- the network device 101 can also communicate with the IP network 200, such as the Internet, a private IP network, or other data network.
- Network devices provide services to terminals within coverage.
- network device 110 provides wireless access to one or more terminals within its coverage.
- Network devices can also communicate with one another, for example, network device 110 can communicate with network device 120.
- the above network device may be a device for communicating with the terminal device.
- it may be a base station (Base Transceiver Station, BTS) in a GSM system or a CDMA system, or a base station (NodeB, NB) in a WCDMA system, or an evolved base station (Evolved Node B, eNB) in an LTE system.
- BTS Base Transceiver Station
- NodeB, NB base station
- Evolved Node B, eNB evolved base station
- the network device may also be a relay station, an access point, an in-vehicle device, or the like.
- D2D Device to Device
- the network device may also be a terminal functioning as a base station.
- the foregoing terminal may be referred to as a User Equipment (UE), an access terminal, a subscriber unit, 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.
- SIP Session Initiation Protocol
- WLL Wireless Local Loop
- PDA Personal Digital Assistant
- the network device/terminal When the network device communicates with the terminal, the network device/terminal needs to encode the data/information to be sent according to the flow shown in FIG. 2, and needs to decode the received data/information.
- the network devices and terminals are collectively referred to as wireless devices.
- the wireless device After acquiring the data/information (also referred to as a source) to be transmitted, the wireless device sequentially transmits the source code, channel coding, rate matching (optional), and modulation on the channel, and the opposite end After receiving the signal, it is subjected to demodulation, de-rate matching (optional), channel decoding and source decoding to obtain the final data/information (also called a sink).
- the data/information also referred to as a source
- the wireless device After receiving the signal, it is subjected to demodulation, de-rate matching (optional), channel decoding and source decoding to obtain the final data/information (also called a sink).
- Embodiments of the present invention generally relate to channel coding, which will be described below by way of specific examples.
- the mother code sequence is crucial in the polar coding process, but different code lengths and code rates correspond to different mother code sequences, which requires a lot of storage for different code lengths and code rates.
- the mother code sequence results in a large consumption of storage space.
- multiple mother code sequences may share a sequence of length 2 n' , and different code lengths or code rate corresponding mother code sequences may be obtained from the sequence of length 2 n' , such that This saves a lot of storage space.
- the wireless device before a previously stored coded length is 2 n 'sequence, or get a length of 2 n from other devices' sequence, the length is 2 n' sequence can meet a variety of code length or code rate Demand. 3, it is assumed that the wireless device need only encode length is 2 n mother code sequences, the coding method of an embodiment of the present invention are as follows:
- the length is 2 n' is the length of the sequence 2 n includes 2 n 'serial numbers, the length of the master code sequence is 2 n, the master code sequence Included in the 2 n serial numbers, the 2 n serial numbers are part or all of the 2 n ' serial numbers, n' is a natural number or a positive integer, and the n is a natural number or a positive value less than or equal to n' Integer
- sequence numbers herein refer to the sequence numbers of the channels.
- Said length of 2 n 'sequence of 2 n' serial numbers may have a particular order.
- the input code to be encoded is encoded by using the mother code sequence.
- the method may further include: 301: acquiring a sequence of length 2 n' . If there are multiple sequences of different lengths to choose from, that is, the sequence of length 2 n' is one of a plurality of sequences of different lengths, step 301 may be: obtaining the sequence from the plurality of sequences of different lengths A sequence of length 2 n' .
- the wireless device can be either a network device or a terminal.
- the above sequence of length 2 n' may be pre-stored.
- the sequence of length 2 n' may be pre-stored in the internal memory of the access network device, or may be obtained by the access network device from other network devices.
- the protocol can specify that there is only one sequence of length 2 n' , that is, the largest mother code sequence, and all mother code sequences can be obtained from the largest mother code sequence of length 2 n' .
- the protocol may also specify several sequences of different lengths, that is, the values of n' of different sequences are different, and the sequence of length 2 n' mentioned above may be one of the sequences of different lengths. For a sequence of a certain length, only part of the mother code sequence can be obtained from the sequence of this specific length, and other mother code sequences can be obtained from sequences of other lengths.
- the length of 2 n 'sequences mentioned may be employed based on density evolution, Gaussian approximation, a linear fit or calculated channel polarization weights (PW) and the like method to obtain the reliability of the channel, and the reliability of the channel from the high
- the sequence of length 2 n' may also be a set of channel sequence numbers with a certain order obtained by other methods, for example, offline search.
- the mother code sequence may be a Q sequence or other types of sequences.
- sequence of length 2 n' can also be obtained in many other ways, since the focus of the present invention is not here, and will not be described in detail herein.
- the sequence of length 2 n' may be pre-stored in the wireless device or may be acquired by the wireless device from another device.
- the terminal may acquire the sequence of length 2 n' from the network device before encoding;
- the network device may be from other network devices before encoding (for example, the control device) , the core network device or another network device) obtains this sequence of length 2 n' .
- the above step 302 is not needed, and in step 304, the sequence of length 2 n' can be directly used for encoding. . Since the above sequence of length 2 n' is one or more sequences designed in consideration of a plurality of code lengths and/or code rates, the length of the mother code sequence used in actual coding may often be shorter than the above length of 2 n' The length of the sequence, therefore, the embodiment of the present invention also devised several methods for obtaining the mother code sequence to be used in actual coding from the above sequence of length 2 n' .
- the wireless device can obtain a 2 n mother code sequence from a long sequence of length 2 n' using any of the following embodiments.
- Embodiment 1 is a diagrammatic representation of Embodiment 1:
- the mother code sequence can be obtained from an even or odd sequence number in the sequence of length 2 n' .
- the mother code sequence may be obtained according to the serial number of the even number in the sequence of length 2 n ' .
- the mother code sequence may also be obtained according to an odd number in the sequence of length 2 n' .
- the sequence of the length 2 n' acquired by the wireless device is 402 in FIG. 4(a), that is, ⁇ 0, 1, 2, 4, 8,3,5,6,9,10,12,7,11,13,14,15 ⁇ .
- the wireless device can take out the even sequence numbers ⁇ 0, 2, 4, 8, 6, 10, 12, 14 ⁇ in the sequence of length 2 n' (see Figure 4).
- (a) of (a) is used to construct a mother code sequence; if the sequence number of any one of the mother code sequences is S', and any one of the sequences of length 2 n' is even, the serial number is Se, then: The resulting mother code sequence is ⁇ 0, 1, 2, 4, 3, 5, 6, 7 ⁇ as shown by 406a in Fig. 4(a).
- the odd sequence number ⁇ 1, 3, 5, 9 in the sequence of length 2 n' can be taken out by taking the above sequence of length 2 n' as an example. , 7, 11, 13, 15 ⁇ (shown as 404b in Fig. 4(b)) for constructing the encoded mother code sequence; assuming that the sequence number of any one of the mother code sequences is S', the length is 2 Any sequence number that is odd in the sequence of n' is S, then: The resulting mother code sequence is ⁇ 0, 1, 2, 4, 3, 5, 6, 7 ⁇ as shown by 406b in Fig. 4(b).
- Embodiment 2 is a diagrammatic representation of Embodiment 1:
- the second embodiment is different from the first embodiment in that the second embodiment can be applied to mother code sequences of various lengths.
- the master code sequence of 2 n from the sequence number of length 2 n can be by way of 'obtaining sequence:
- the mother code sequence for encoding is obtained according to the sequence of length 2 n' such that any one of the sequence numbers S' in the mother code sequence satisfies the following conditions:
- S is a sequence number in a sequence of length 2 n' that satisfies the following conditions:
- the final mother code sequence is the same regardless of the value of V.
- the above formula can also be slightly modified, for example, S is a sequence number that satisfies the following conditions in a long sequence:
- Embodiment 3 is a diagrammatic representation of Embodiment 3
- the third embodiment is also applicable to mother code sequences of various lengths.
- the 2 n sequence numbers in the mother code sequence can be obtained from a sequence of length 2 n' as follows:
- the preset value here may be a preset value or a plurality of preset values.
- the preset value may be one, for example, 0 or 1, that is, a 1 , a 2 , . . . , a n ' -n have the same value.
- the above preset value may also be two, for example, 0 and 1, that is, a 1 , a 2 , ..., a part of a n '-n is 0, and the other part is 1.
- the preset value may be plural, that is, a preset value is set for each of the n'-n bits of the fixed position.
- the mother code sequence is a sequence formed by removing the bits of the n'-n fixed positions according to the binary form of each of the obtained 2 n sequence numbers. .
- the selection condition is with That is, the value of the 2nd bit is equal to 1, and the binary serial number whose value of the 4th bit is equal to 0 is a binary serial number satisfying the selection condition.
- the sequence number shown at 506 in Fig. 5 is the binary sequence number selected from the sequence of length 2 n' according to the above conditions.
- the mother code sequence is formed by removing the bits of the two fixed positions from each of the obtained four binary serial numbers.
- the second bit (x 1 ) and the fourth bit (x 3 ) in 506 are removed to form a binary coded mother code sequence 508, and the serial numbers in 508 are all expressed in decimal to form 510.
- the mother code sequence ⁇ 0, 1, 2, 3 ⁇ shown in decimal is shown.
- the embodiment of the present application is not limited thereto, as long as the length is obtained according to the sequence of 2 n' lengths.
- the 2 n mother code sequence can refer to the above method. To save space, it is not enumerated here.
- the ordering of 2 n sequence numbers in the mother code sequence described in the foregoing Embodiments 1 to 3 in the mother code sequence is the same as the order in the length of 2 n' .
- the same ordering as used herein refers to the relative order or sequence between the serial number and the serial number.
- FIG. 6 shows a schematic block diagram of a wireless device in accordance with an embodiment of the present invention.
- wireless device 600 includes at least a packet encoder 604 and a memory 608. among them,
- Memory 608 for storing a length of 2 n 'of the sequence
- the encoder 604 is configured to obtain the input bit to be encoded through the interface 602, obtain the sequence of the length 2 n' from the memory 608, and perform steps 302-304 or 301-304.
- the function of the encoder 604 can be implemented by a chip or an integrated circuit. If the chip is implemented by a chip, the wireless device 600 can further include an interface 602, and the encoder 604 is configured to obtain an input bit to be encoded through the interface 602. 608 obtains the above sequence of length 2 n' , and performs the above steps 302-304 or 301-304.
- the chip may be implemented by a logic circuit when performing steps 302-304 or 301-304, or may be implemented by a processor, or partially implemented by a logic circuit, and partially by a processor. If it is implemented by a processor, the memory 608 may store program code for implementing part or all of steps 302-304 or 301-304. When the processor runs the program code, steps 302-304 are executed. Or some or all of 301 to 304.
- the above memory 608 may be integrated inside the chip or external to the chip.
- the wireless device 600 can also include a transmitter 606 for transmitting the encoded bits of the encoder 604.
- the wireless device 600 can also include an antenna 616 for transmitting the encoded sequence of the encoder through the antenna 616. If the wireless device is a terminal, the antenna 616 described above is likely to be integrated in the terminal. If the wireless device is a network device, the antenna 616 may be integrated into the network device or may be separate from the network device, for example, by remotely connecting to the network device.
- the wireless device may further include a receiver 610 for receiving information or data from other wireless devices, and the decoder 612 is configured to acquire the encoder according to the sequence of length 2 n' stored in the memory 608.
- the mother code sequence, and the bits to be decoded are decoded using the mother code sequence, and then the decoded bits are output through the interface 614.
- the encoder 604 and decoder 612 described above may also be integrated to form a codec or codec device, and the transmitter 606 and the receiver 610 may be integrated to form a transceiver.
- Embodiments of the present invention also provide a chip that is comprised of at least the interface 602 and encoder 604 described above.
- Embodiments of the present invention also provide a computer storage medium storing program code for implementing steps 302-304 or 301-304.
- the storage medium includes: a U disk, a removable hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program codes.
- Embodiments of the present invention also provide a computer program product comprising program code for implementing steps 302-304 or 301-304.
- the computer program product can be stored on a storage medium or server for download by a user.
- connection relationship between the devices or the constituent units mentioned in the above embodiments may be directly connected or coupled, or may be indirectly connected or indirectly coupled, and there may be other devices between the two devices or constituent units.
- the constituent units are not shown in the drawings since they are not particularly relevant to the solution of the embodiment of the present invention.
- the wireless device or the wireless communication system only needs to store a long sequence, and when encoding, reads the mother code sequence of the required length for encoding from the long sequence, thereby reducing the storage of the wireless device or system. Overhead.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
本发明实施例公开了一种编码方法、无线设备和芯片。该编码方法包括:根据长度为2n'的序列获取用于编码的母码序列,所述长度为2n'的序列中包括2n'个序列号,所述母码序列的长度为2n,所述母码序列中包括2n个序列号,所述2n个序列号为所述2n'个序列号中的部分或全部,所述n'为自然数,所述n为小于或等于n'的自然数;采用所述母码序列对输入的待编码比特进行编码。通过此方法,系统可以只存储一个或几个长序列,然后根据编码的需要去从其中的一个长序列中获取需要的母码序列,由此降低了系统的存储开销。
Description
本申请要求于2017年06月16日提交中国专利局、申请号为201710458937.7、申请名称为“一种编码方法、无线设备和芯片”的中国专利申请的优先权,其全部内容通过引用结合在本申请中。
本发明涉及编码领域,并且更具体地,涉及一种编码方法、无线设备和芯片。
通信系统通常采用信道编码提高数据传输的可靠性,保证通信的质量。极化(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的矩阵。在CRC辅助的增强SC译码算法下,Polar码可以获取优于LDPC和Turbo码的FER性能。
现有技术中,为了支持系统要求的所有码长和码率的组合,需要存储大量的母码序列,因此,系统的存储开销极大。
发明内容
本申请提供一种编码方法、无线设备和芯片,能够降低系统的存储开销。
第一方面,本申请提供了一种编码方法,该方法包括:
根据长度为2
n’的序列获取用于编码的母码序列,所述长度为2
n’的序列中包括2
n’个序列号,所述母码序列的长度为2
n,所述母码序列中包括2
n个序列号,所述2
n个序列号为所述2
n’个序列号中的部分或全部,所述n’为自然数,所述n为小于或等于n’的自然数;采用所述母码序列对输入的待编码比特进行编码。
第二方面,本申请提供了一种无线设备,该无线设备至少包括存储器、接口和编码器:
所述存储器,用于存储长度为2
n’的序列,所述长度为2
n’的序列中包括2
n’个序列号,所述n’为自然数。所述编码器,用于通过所述接口获取输入的待编码比特,并从所述存储器获取所述长度为2
n’的序列;根据所述长度为2
n’的序列获取用于编码的母码序列,所述母码序列的长度为2
n,所述母码序列中包括2
n个序列号,所述2
n个序列号为所述2
n’个序列号中的部分或全部,所述n为小于或等于n’的自然数;采用所述母码序列对输入的待编码比特进行编码。
第三方面,本申请提供了一种芯片,该芯片包括接口和编码器:
所述编码器,用于通过所述接口获取输入的待编码比特;
所述编码器还用于根据所述长度为2
n’的序列获取用于编码的母码序列,所述长度为2
n’的序列中包括2
n’个序列号,所述母码序列的长度为2
n,所述母码序列中包括2
n个序列号,所述2
n个序列号为所述2
n’个序列号中的部分或全部,所述n’为自然数,所述n为小于或等于n’的自然数;采用所述母码序列对所述输入的待编码比特进行编码。
第四方面,本申请还提供了一种计算机存储介质,该存储介质中存储有程序代码,当此程序代码被计算机或者处理器执行时用于实现如下步骤:
根据长度为2
n’的序列获取用于编码的母码序列,所述长度为2
n’的序列中包括2
n’个序列号,所述母码序列的长度为2
n,所述母码序列中包括2
n个序列号,所述2
n个序列号为所述2
n’个序列号中的部分或全部,所述n’为自然数,所述n为小于或等于n’的自然数;采用所述母码序列对输入的待编码比特进行编码。
第五方面,本申请还提供了一种计算机程序产品,该计算机程序产品中包括上述程序代码,该计算机程序产品可以存储在上述第四方面的存储介质中,也可以存储在服务器上供用户下载。
在一种可能的实现方式中,n=n’-1,上述几方面中根据长度为2
n’的序列获取用于编码的母码序列包括:根据所述长度为2
n’的序列中为偶数或奇数的序列号获取所述母码序列。
采用此种方式可以非常快捷的从长度为2
n’的序列中获取用于编码的母码序列,算法简单易实现。
在另一种可能的实现方式中,上述几方面中根据长度为2
n’的序列获取用于编码的母码序列包括:根据长度为2
n’的序列获取用于编码的母码序列使得所述母码序列中任意一个序号S’满足如下条件:
所述S为所述长度为2
n’的序列中满足如下条件的序列号:
其中,V为整数,-2
n’-n<V≤0,所述mod为取余运算符。
此种实现方式适用于各种长度的母码序列,只要母码序列的长度小于或等于2
n’,都可以从长度为2
n’的序列中取出需要的母码序列。
在另一种可能的实现方式中,上述几方面中根据长度为2
n’的序列获取用于编码的母码序列包括:从所述长度为2
n’的序列中的2
n’个二进制序列号取出2
n个二进制序列号,所述2
n个二进制序列号的每个二进制序列号中固定位置的n’-n个比特等于预设值。所述母码序列为根据所述2
n个二进制序列号中的每个二进制序列号去掉所述固定位置的n’-n个比特后剩下的比特形成。
此种实现方式也适用于各种长度的母码序列,并且实现起来更为简单,例如,通过逻辑电路就可能实现上述二进制序号的选取。
可选的,上述各方面和实现方式中,母码序列中的2
n个序列号在所述母码序列中的排序与在所述长度为2
n’的序列中的排序相同。由于长度为2
n’的序列中信道是有固定排序的,因此选出来的母码序列中信道也是有固定排序的,这就方便后续编码时将信息比特直接映射到高可靠性的信道上去传输。
可选的,上述各方面和实现方式中,可以有多个不同的长度为2
n’的序列,每个序列对应的n’取值不同,当确定需要的母码序列的长度为2
n时,可以从这多个序列中选择一个对应的序列,并从根据这个选择的序列获取用于编码的母码序列。无线设备中存储器可以存储这多个不同的长度为2
n’的序列以供编码器选择。
上述长度为2
n’的序列只有一个时可以称作最大母码序列或者最长序列。上述长度为2
n’的序列有多个时,可以称作长序列。在实际应用中,还可以叫其它名字,本申请中不做限定。
通过本申请提供的技术方案,系统可以存储一个或几个长序列,然后根据编码的需要去从其中的一个长序列中获取需要的母码序列,由此能够降低系统的存储开销。
为了更清楚地说明本发明实施例的技术方案,下面将对本发明实施例中所需要使用的附图作简单地介绍,显而易见地,下面所描述的附图仅仅是本发明的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动的前提下,还可以根据这些附图获得其他的附图。
图1是本发明实施例的无线通信网络的结构示意图;
图2是本发明实施例的编解码流程示意图;
图3是本发明实施例的编码流程示意图;
图4(a)是本发明实施例的母码获取方法示意图;
图4(b)是本发明实施例的另一种母码获取方法示意图;
图5是本发明另一实施例的母码获取方法示意图;
图6是本发明实施例的无线设备的结构示意图;
下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行描述,显然,所描述的实施例是本发明一部分实施例,而不是全部的实施例。基于本发明中的 实施例,本领域普通技术人员在没有付出创造性劳动前提下所获得的所有其他实施例,都属于本发明保护的范围。
本发明实施例可应用于各种通信系统,例如,全球移动通讯(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只是一种示例,其它能用到本发明实施例的编码方法或装置的无线网络也都在本发明的保护范围内。
如图1所示,无线通信网络100包括网设备110,和终端112。当无线通信网络100包括核心网时,该网络设备110还可以与核心网相连。网设备101还可以与IP网络200进行通信,例如,因特网(internet),私有的IP网,或其它数据网等。网络设备为覆盖范围内的终端提供服务。例如,参见图1所示,网络设备110为其覆盖范围内的一个或多个终端提供无线接入。除此之外,网络设备之间的覆盖范围可以存在重叠的区域,例如网络设备110和120。网络设备之间还可以互相通信,例如,网络设备110可以与网络设备120之间进行通信。
上述网络设备可以是用于与终端设备进行通信的设备。例如,可以是GSM系统或CDMA系统中的基站(Base Transceiver Station,BTS),也可以是WCDMA系统中的基站(NodeB,NB),还可以是LTE系统中的演进型基站(Evolved Node B,eNB或eNodeB)或未来5G网络中的网络侧设备等。或者该网络设备还可以是中继站、接入点、车载设备等。在终端对终端(Device to Device,D2D)通信系统中,该网络设备还可以是担任基站功能的终端。
上述终端可以指用户设备(User Equipment,UE)、接入终端、用户单元、移动站、远方站、远程终端、移动设备、用户终端、无线通信设备、用户代理或用户装置。接入终端可以是蜂窝电话、无绳电话、会话启动协议(Session Initiation Protocol,SIP)电话、无线本地环路(Wireless Local Loop,WLL)站、个人数字处理(Personal Digital Assistant,PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备,未来5G网络中的终端设备等。
上述网络设备与终端进行通信时,网络设备/终端均需要根据图2所示的流程对待发送的数据/信息进行编码,并且需要对接收到的数据/信息进行解码。为了方便描述,下面将网络设备和终端统称为无线设备。
参见图2所示,无线设备获取待发送的数据/信息(也可以叫作信源)后,依次经过信源编码、信道编码、速率匹配(可选)和调制后在信道上发出,对端收到信号后依次经过解调、解速率匹配(可选)、信道解码和信源解码后获得最终的数据/信息(也可以叫作信宿)。
本发明的实施例主要涉及信道编码,下面将通过具体的例子进行说明。根据背景 技术部分的描述可以知道,polar编码过程中,母码序列至关重要,但是不同的码长、码率对应着不同的母码序列,这就需要针对不同的码长、码率存储很多母码序列,导致存储空间的消耗很大。而本发明的实施例中多个母码序列可以共用一个长度为2
n’的序列,不同的码长或码率对应的母码序列都可以从这个长度为2
n’的序列中获取,这样就大大节省了存储空间。
假设无线设备在编码之前预先存储了一个长度为2
n’的序列,或者从其他设备获取了一个长度为2
n’的序列,该长度为2
n’的序列能够满足多种码长或码率的需求。如图3所示,假设无线设备编码时只需要长度为2
n的母码序列,则本发明实施例的编码方法如下:
302,根据长度为2
n’的序列获取用于编码的母码序列,该长度为2
n’的序列中包括2
n’个序列号,该母码序列的长度为2
n,该母码序列中包括2
n个序列号,该2
n个序列号为所述2
n’个序列号中的部分或全部,n’为自然数或正整数,所述n为小于或等于n’的自然数或正整数;
可选地,当此方法用于信道编码时,本文中的序列号都是指信道的序列号。上述长度为2
n’的序列中的2
n’个序列号可以具有特定顺序。
304,采用所述母码序列对输入的待编码比特进行编码。
可选的,在步骤302之前还可以包括:301,获取长度为2
n’的序列。如果有多个不同长度的序列可供选择,即长度为2
n’的序列为多个不同长度的序列中的一个,则步骤301还可以为:从该多个不同长度的序列中获取所述长度为2
n’的序列。
由于无线设备既可以是网络设备也可以是终端。对于终端来说,上述长度为2
n’的序列可以是预先存
储在终端的内部存储器中的,也可以是终端接入网络时或接入网络后从接入网设备获取的。对于接入网设备来说,上述长度为2
n’的序列可以是预先存储在接入网设备的内部存储器中的,也有可能是接入网设备从其他网络设备获取的。
协议中可以规定只有一个长度为2
n’的序列,即最大母码序列,所有的母码序列都可以从这个长度为2
n’的最大母码序列中获取。协议中也可以规定有几个不同长度的序列,即不同序列的n’取值不一样,上文中提到的长度为2
n’的序列可以是这多个不同长度的序列中的一个,对于某个特定长度的序列,只有部分母码序列可以从这个特定长度的序列中获取,其它母码序列可以从其它长度的序列中获取。
上述提到的长度为2
n’的序列可以采用基于密度进化、高斯近似、线性拟合或计算信道的极化权重(PW)等方法来获取信道的可靠度,并对信道的可靠度从高到低或者从低到高进行排列后得到的信道序列号集合。该长度为2
n’的序列也可以是采用其它方法,例如,离线搜索的方式,得到的具有一定排序的信道序列号集合。该母码序列可以是Q序列,也可以是其它类型的序列。
除了上面提到的方式外,该长度为2
n’的序列还可以采用很多其它方式获取,由于本发明的重点不在于此,在此就不详述了。
该长度为2
n’的序列可以是预先存储在无线设备中的,也可以是无线设备从另外一个设备获取的。例如,当无线设备是终端时,终端可以在编码前从网络设备获取此长度为2
n’的序列;当无线设备是网络设备时,网络设备可以在编码前从其它网络设备(例 如,控制设备,核心网设备或另一个网络设备)获取此长度为2
n’的序列。
如果实际编码时需要的母码序列的长度刚好是2
n’,即n=n’,则上述步骤302就不需要了,在步骤304中可以直接采用所述长度为2
n’的序列进行编码。由于上述长度为2
n’的序列是考虑了多种码长和/或码率而设计的一个或多个序列,实际编码时使用的母码序列的长度往往可能短于上述长度为2
n’的序列的长度,因此,本发明的实施例还设计了几种从上述长度为2
n’的序列中获取实际编码时需要使用的母码序列的方法。
假设无线设备需要的母码序列长度为2
n,无线设备可以采用如下实施例中的任意一种从长度为2
n’的长序列中获取长度为2
n母码序列。
实施例一:
n=n’-1时,母码序列可以根据所述长度为2
n’的序列中为偶数或奇数的序列号获得。
方式一:母码序列可以是根据所述长度为2
n’的序列中为偶数的序列号获得。
方式二:母码序列还可以是根据所述长度为2
n’的序列中为奇数的序列号获得。
例如,参见图4(a)所示,假设n’=4,无线设备获取的所述长度为2
n’的序列为图4(a)中的402,即{0,1,2,4,8,3,5,6,9,10,12,7,11,13,14,15}。
如果n=n’-1=3,则无线设备可以取出所述长度为2
n’的序列中的偶数序列号{0,2,4,8,6,10,12,14}(如图4(a)中的404a所示)用于构成母码序列;假设母码序列中任意一个的序列号为S’,所述长度为2
n’的序列中为偶数的任意一个序列号为Se,则:
最终形成的的母码序列如图4(a)中的406a所示,为{0,1,2,4,3,5,6,7}。
参见图4(b)所示,还是以上述的所述长度为2
n’的序列为例,可以取出该所述长度为2
n’的序列中的奇数序列号{1,3,5,9,7,11,13,15}(如图4(b)中的404b所示)用于构成编码的母码序列;假设母码序列中任意一个的序列号为S’,所述长度为2
n’的序列中为奇数的任意一个序列号为S,则:
最终形成的的母码序列如图4(b)中的406b所示,为{0,1,2,4,3,5,6,7}。
上面只是以n’=4,n=3为例进行说明,如果要从其它长度的序列中选出一半作为母码序列也可以参照上述方法。
由于上述实施例只适用于n=n’-1的情况,即适用于有限的几种长度的母码序列。为了使大部分或者所有的母码序列都能从所述长度为2
n’的序列中获取,则还需要其它的方法,下面将通过其它的实施例进行介绍。
实施例二:
实施例二与实施例一的不同之处在于,实施例二可以适用于各种长度的母码序列。
假设用于编码的母码长度为2
n,母码序列中的2
n个序列号可以通过如下方式从长度为2
n’的序列中获取:
根据长度为2
n’的序列获取用于编码的母码序列使得母码序列中任意一个序列号S’满足如下条件:
S为长度为2
n’的序列中满足如下条件的序列号:
其中,-2
n’-n<V≤0,所述mod为取余运算符。
为方便理解,下面通过具体的例子进行介绍。
例如,假设n’=4,即长度为2
n’=16的序列为{0,1,2,4,8,3,5,6,9,10,12,7,11,13,14,15},如果要从中取出N=2的母码序列,则可以采用如下几种方式中的一种:
其中,0≤V<2
n’-n。
应理解,对于上述公式的各种变形都属于本发明的保护范围。
实施例三:
实施例三也适用于各种长度的母码序列。母码序列中的2
n个序列号可以通过如下方式从长度为2
n’的序列获取:
(1)从长度为2
n’的序列中的2
n’个列号中取出2
n个序列号,所述2
n个序列号的每个序列号的二进制形式中的n’-n个固定位置的比特等于预设值。此处的预设值可以是一个预设值也可以是多个预设值。
例如,将所述长度2
n’的序列中每一个序列号都用二进制表示为x=(x
0,x
1,.....x
n’-1),假设固位置的n’-n个比特为
假设预设值为a
1,a
2,…,a
n’-n,a
t=0或1,1≤t≤n’-n;即需要从所述长度为2
n’的序列中挑选出满足如下条件的2
N个二进制序列号用于 构成母码序列:
当然,在实际应用时,上述预设值可以为一个,例如0或者1,即a
1,a
2,…,a
n’-n的值相同。或者,上述预设值也可以为两个,例如,0和1,即a
1,a
2,…,a
n’-n中一部分为0,另一部分为1。又或者,上述预设值也可以是多个,即针对上述固定位置的n’-n个比特中的每个比特都设置一个预设值。
(2)所述母码序列为根据所述获取的2
n个序列号中的每个序列号的二进制形式去掉所述n’-n个固定位置的比特后剩下的比特所表示的序列形成。
为了让更容易理解,下面将通过一个具体的例子对实施例三进行介绍。
参见图5的502所示,假设n’=4,长度为2
n’=16的序列用十进制表示的为{0,1,2,4,8,3,5,6,9,10,12,7,11,13,14,15},如果将所述长度为2
n’的序列中的序列号都用二进制表示,则参见图5中的504所示。
假设用于编码的母码序列的长度为2
n=4,即n=2,如果要从所述长度为2
n’的序列中获取用于编码的母码序列,则可以采用如下方式:
例如,假设固定位置的2个比特分别为第2比特(即,
)和第4个比特(即,
),假设预设的值有两个a
1=1和a
2=0,即挑选条件为
和
即第2个比特的值等于1,第4个比特的值等于0的二进制序列号为满足挑选条件的二进制序列号。
图5的506所示的序列号即为根据上述条件从所述长度为2
n’的序列中挑选出的二进制序列号。
(2)母码序列为将所述获取的4个二进制序列号中的每个二进制序列号中去掉所述2个固定位置的比特后形成。
参见图5所示,去掉506中的第2比特(x
1)和第4比特(x
3)后形成了二进制表示的母码序列508,将508中的序列号都用十进制表示则形成了510所示的用十进制表示的母码序列{0,1,2,3}。
需要说明的是,如果长度为2
n’的序列本就是用二进制表示的,那么图5中的502和510就不需要了。
上实施例二和实施例三只是以n’=4,n=2为例进行说明,但是本申请的实施例并不限于此,只要是根据所述长度为2
n’个的序列获取长度为2
n的母码序列均可以参照上述方法,为节省篇幅,此处未再一一列举。
可选地,上述实施例一至实施例三中描述的母码序列中的2
n个序列号在所述母码序列中的排序与在所述长度为2
n’的中的排序相同。此处所说的排序相同是指序列号与序列号之间的相对顺序或者先后顺序相同。
上述结合图1至图5,详细说明了根据本发明实施例的用于极化编码的方法。以下结合图6,对上述实施例中提到的无线设备进行说明。
图6示出了本发明实施例的无线设备的示意性框图。如图6所示,无线设备600至少包括包编码器604和存储器608。其中,
存储器608,用于存储长度为2
n’的序列;
长度为2
n’的序列的获取方式可以参见前面方法实施例中的描述。
编码器604,用于通过接口602获取输入的待编码比特,从存储器608获取上述长度为2
n’的序列,并执行步骤302~304或者301~304。
上述编码器604的功能可以通过芯片或者集成电路来实现,如果是通过芯片实现,则上述无线设备600还可以包括一个接口602,编码器604用于通过接口602获取输入的待编码比特,从存储器608获取上述长度为2
n’的序列,并执行上述步骤302~304或者301~304。
芯片在执行步骤302~304或者301~304时可以通过逻辑电路来实现,也可以通过处理器来实现,或者部分通过逻辑电路来实现、部分通过处理器来实现。如果是通过处理器实现的,则上述存储器608中可以存储有用于实现步骤302~304或者301~304中的部分或全部的程序代码,当处理器运行这些程序代码时就会执行步骤302~304或者301~304中的部分或全部。上述存储器608可以集成在芯片的内部,也可以设置在芯片的外部。
至于如何从长度为2
n’的序列中获取长度为2
n的母码序列,可以参见前面的描述,此处不再赘述。
无线设备600还可以包括发送器606用于发送编码器604编码后的比特。
无线设备600还可以包括天线616,发送器606用于将编码器编码后的序列通过天线616发送出去。如果该无线设备是终端,则上述天线616很有可能集成在终端中。如果该无线设备是网络设备,天线616有可能集成在网络设备中,也有可能与网络设备是分离的,例如,通过拉远的方式与网络设备连接。
除此之外,该无线设备还可以包括接收器610,用于从其它的无线设备接收信息或数据,解码器612用于根据存储器608中存储的长度为2
n’的序列获取编码器使用的母码序列,并采用母码序列对待解码的比特进行解码,然后通过接口614输出解码后的比特。
在实际应用时,上述编码器604和解码器612也可以集成在一起形成编解码器或编解码装置,发送器606和接收器610可以集成在一起形成收发器。
本发明的实施例还提供了一种芯片,该芯片至少由上述接口602和编码器604构成。
本发明的实施例还提供了一种计算机存储介质,该存储介质中存储用于实现步骤302~304或者301~304的程序代码。
存储介质包括:U盘、移动硬盘、只读存储器(ROM,Read-Only Memory)、随机存取存储器(RAM,Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
本发明的实施例还提供了一种计算机程序产品,该计算机程序产品中包括用于实现步骤302~304或者301~304的程序码。该计算机程序产品可以存储在存储介质或者服务器上供用户下载。
上述实施例中提到的各器件或者各组成单元之间的连接关系可以是直接连接或耦合的,也可以是间接连接或间接耦合的,两个器件或组成单元之间还可能有其它的器件或者组成单元,由于和本发明实施例的方案不是特别相关,所以在图中没有示出。
通过上述实施例,无线设备或者无线通信系统仅需要存储长序列,在进行编码时,从所述长序列中读取进行编码所需长度的母码序列,由此降低了无线设备或系统的存储开销。
以上所述,仅为本发明的具体实施方式,但本发明的保护范围并不局限于此,任何熟悉本技术领域的技术人员在本发明揭露的技术范围内,可轻易想到变化或替换,都应涵盖在本发明的保护范围之内。因此,本发明的保护范围应以所述权利要求的保护范围为准。
Claims (24)
- 一种编码方法,其特征在于,所述方法包括:根据长度为2 n’的序列获取用于编码的母码序列,所述长度为2 n’的序列中包括2 n’个序列号,所述母码序列的长度为2 n,所述母码序列中包括2 n个序列号,所述2 n个序列号为所述2 n’个序列号中的部分或全部,所述n’为自然数,所述n为小于或等于n’的自然数;采用所述母码序列对输入的待编码比特进行编码。
- 根据权利要求1所述的方法,其特征在于,所述n=n’-1,所述根据长度为2 n’的序列获取用于编码的母码序列包括:根据所述长度为2 n’的序列中为偶数或奇数的序列号获取所述母码序列。
- 根据权利要求1所述的方法,其特征在于,所述根据长度为2 n’的序列获取用于编码的母码序列包括:从所述长度为2 n’的序列中的2 n’个序列号取出2 n个序列号,所述2 n个序列号的每个序列号的二进制形式中n’-n个固定位置的比特等于预设值;所述母码序列为根据所述2 n个序列号中的每个序列号的二进制形式去掉所述n’-n个固定位置的比特后剩下的比特所表示的序列形成。
- 根据权利要求1-4任意一项所述的方法,其特征在于,所述母码序列中的2 n个序列号在所述母码序列中的排序与在所述长度为2 n’的序列中的排序相同。
- 根据权利要求1-4任意一项所述的方法,其特征在于,所述长度为2 n’的序列是多个不同长度的序列中的一个,所述根据长度为2 n’的序列获取用于编码的母码序列之前还包括:从所述多个不同长度的序列中获取所述长度为2 n’的序列。
- 根据权利要求1-6任意一项所述的方法,其特征在于,所述2 n’个序列号为2 n’个信道的序列号,所述长度为2 n’的序列是对所述2 n’个信道的序列号按照信道的可靠度进行排序后得到的。
- 一种无线设备,其特征在于,所述无线设备至少包括存储器和编码器:所述存储器,用于存储长度为2 n’的序列,所述长度为2 n’的序列中包括2 n’个序列号,所述n’为自然数;所述编码器,用于获取输入的待编码比特,并从所述存储器获取所述长度为2 n’的序列;根据所述长度为2 n’的序列获取用于编码的母码序列,所述母码序列的长度为 2 n,所述母码序列中包括2 n个序列号,所述2 n个序列号为所述2 n’个序列号中的部分或全部,所述n为小于或等于n’的自然数;采用所述母码序列对输入的待编码比特进行编码。
- 根据权利要求8所述的无线设备,其特征在于,所述n=n’-1,所述根据长度为2 n’的序列获取用于编码的母码序列包括:根据所述长度为2 n’的序列中为偶数或奇数的序列号获取所述母码序列。
- 根据权利要求8所述的无线设备,其特征在于,所述编码器用于根据长度为2 n’的序列获取用于编码的母码序列包括:所述编码器用于从所述长度为2 n’的序列中的2 n’个序列号取出2 n个序列号,所述2 n个序列号的每个序列号的二进制形式中n’-n个固定位置的比特等于预设值;所述母码序列为根据所述2 n个序列号中的每个序列号的二进制形式去掉所述n’-n个固定位置的比特后剩下的比特所表示的序列形成。
- 根据权利要求8-11任意一项所述的无线设备,其特征在于,所述母码序列中的2 n个序列号在所述母码序列中的排序与在所述长度为2 n’的序列中的排序相同。
- 根据权利要求8-12任意一项所述的无线设备,其特征在于,所述长度为2 n’的序列是多个不同长度的序列中的一个,所述编码器还用于,从所述多个不同长度的序列中获取所述长度为2 n’的序列。
- 根据权利要求8-13任意一项所述的无线设备,其特征在于,所述2 n’个序列号为2 n’个信道的序列号,所述长度为2 n’的序列是对所述2 n’个信道的序列号按照信道的可靠度进行排序后得到的。
- 根据权利要求8-14任意一项所述的无线设备,其特征在于,所述无线设备还包括接口,所述编码器,用于通过所述接口获取所述输入的待编码比特。
- 一种芯片,其特征在于,所述芯片包括接口和编码器:所述编码器,用于通过所述接口获取输入的待编码比特;所述编码器还用于根据所述长度为2 n’的序列获取用于编码的母码序列,所述长度为2 n’的序列中包括2 n’个序列号,所述母码序列的长度为2 n,所述母码序列中包括2 n个序列号,所述2 n个序列号为所述2 n’个序列号中的部分或全部,所述n’为自然数,所述n为小于或等于n’的自然数;采用所述母码序列对所述输入的待编码比特进行编码。
- 根据权利要求16所述的芯片,其特征在于,所述n=n’-1,所述编码器用于根 据长度为2 n’的序列获取用于编码的母码序列包括:所述编码器用于根据所述长度为2 n’的序列中为偶数或奇数的序列号获取所述母码序列。
- 根据权利要求16所述的芯片,其特征在于,所述根据长度为2 n’的序列获取用于编码的母码序列包括:所述编码器用于从所述长度为2 n’的序列中的2 n’个序列号取出2 n个序列号,所述2 n个序列号的每个序列号的二进制形式中的n’-n个固定位置的比特等于预设值;所述母码序列为根据所述2 n个序列号中的每个序列号的二进制形式去掉所述n’-n个固定位置的比特后剩下的比特所表示的序列形成。
- 根据权利要求16-19任意一项所述的芯片,其特征在于,所述母码序列中的2 n个序列号在所述母码序列中的排序与在所述长度为2 n’的序列中的排序相同。
- 根据权利要求16-20任意一项所述的芯片,其特征在于,所述长度为2 n’的序列是多个不同长度的序列中的一个,所述编码器还用于,从所述多个不同长度的序列中获取所述长度为2n’的序列。
- 根据权利要求16-21任意一项所述的芯片,其特征在于,所述2n’个序列号为2n’个信道的序列号,所述长度为2n’的序列是对所述2n’个信道的序列号按照信道的可靠度进行排序后得到的。
- 一种计算机存储介质,其特征在于,所述存储介质中存储有程序代码,当其在计算机上运行时,计算机执行如权利要求1-7中任一项所述的方法。
- 一种计算机程序产品,其特征在于,所述计算机程序包括程序码,当所述指令在计算机上运行时,计算机执行如权利要求1-7中任一项所述的方法。
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP18817901.4A EP3605901A4 (en) | 2017-06-16 | 2018-06-19 | CODING METHOD, WIRELESS DEVICE AND CHIP |
US16/689,754 US11190213B2 (en) | 2017-06-16 | 2019-11-20 | Coding method, wireless device, and chip |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710458937.7 | 2017-06-16 | ||
CN201710458937.7A CN109150375A (zh) | 2017-06-16 | 2017-06-16 | 一种编码方法、无线设备和芯片 |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US16/689,754 Continuation US11190213B2 (en) | 2017-06-16 | 2019-11-20 | Coding method, wireless device, and chip |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2018228589A1 true WO2018228589A1 (zh) | 2018-12-20 |
Family
ID=64658961
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2018/091826 WO2018228589A1 (zh) | 2017-06-16 | 2018-06-19 | 一种编码方法、无线设备和芯片 |
Country Status (4)
Country | Link |
---|---|
US (1) | US11190213B2 (zh) |
EP (1) | EP3605901A4 (zh) |
CN (1) | CN109150375A (zh) |
WO (1) | WO2018228589A1 (zh) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109784455B (zh) * | 2019-01-23 | 2022-02-22 | 青岛柯锐思德电子科技有限公司 | 一种卷盘料带标注方法 |
CN114499545A (zh) * | 2020-10-26 | 2022-05-13 | 华为技术有限公司 | 编码方法以及装置 |
US20220330232A1 (en) * | 2021-04-09 | 2022-10-13 | Qualcomm Incorporated | Rate matching for multi-slot uplink shared channel transmission |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102082635A (zh) * | 2010-03-30 | 2011-06-01 | 大唐移动通信设备有限公司 | 一种码本存储及使用该码本的信息收发方法及装置 |
CN103684477A (zh) * | 2012-09-24 | 2014-03-26 | 华为技术有限公司 | 混合极性码的生成方法和生成装置 |
CN106230489A (zh) * | 2016-07-15 | 2016-12-14 | 西安电子科技大学 | 适用于任意高阶调制的极化码编码调制方法 |
WO2017097098A1 (zh) * | 2015-12-10 | 2017-06-15 | 华为技术有限公司 | 极化码处理的方法及通信设备 |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2001251200A (ja) * | 2000-03-03 | 2001-09-14 | Nec Corp | 符号化方法 |
JP4022111B2 (ja) * | 2002-08-23 | 2007-12-12 | 株式会社エヌ・ティ・ティ・ドコモ | 信号符号化装置及び信号符号化方法 |
JP4819130B2 (ja) * | 2005-11-28 | 2011-11-24 | エルジー エレクトロニクス インコーポレイティド | 無線通信システムでコードシーケンスを生成して送信するための方法及び装置 |
CN101217337B (zh) | 2007-01-01 | 2013-01-23 | 中兴通讯股份有限公司 | 一种支持递增冗余混合自动重传的低密度奇偶校验码编码装置和方法 |
WO2010073922A1 (ja) * | 2008-12-25 | 2010-07-01 | 日本電気株式会社 | 誤り訂正符号化装置、復号装置、符号化方法、復号方法、及びそのプログラム |
CN101867443B (zh) * | 2009-04-14 | 2015-05-20 | 中兴通讯股份有限公司 | 速率匹配方法和装置 |
WO2010134553A1 (ja) * | 2009-05-20 | 2010-11-25 | 日本電信電話株式会社 | 符号化方法、符号化装置、復号方法、復号装置、プログラム及び記録媒体 |
EP3425806A1 (en) | 2013-05-07 | 2019-01-09 | Huawei Technologies Co., Ltd. | Coding and decoding method and device, and system |
EP3073660B1 (en) * | 2013-11-20 | 2020-06-24 | Huawei Technologies Co., Ltd. | Polar code processing method and device |
US10432234B2 (en) * | 2016-07-19 | 2019-10-01 | Mediatek Inc. | Low complexity rate matching for polar codes |
US10700816B2 (en) * | 2016-08-09 | 2020-06-30 | Lg Electronics Inc. | Method for performing HARQ using polar code |
US10742350B2 (en) * | 2017-06-19 | 2020-08-11 | Samsung Electronics Co., Ltd. | Method and apparatus of rate-matching for communication and broadcasting systems |
-
2017
- 2017-06-16 CN CN201710458937.7A patent/CN109150375A/zh active Pending
-
2018
- 2018-06-19 EP EP18817901.4A patent/EP3605901A4/en not_active Ceased
- 2018-06-19 WO PCT/CN2018/091826 patent/WO2018228589A1/zh unknown
-
2019
- 2019-11-20 US US16/689,754 patent/US11190213B2/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102082635A (zh) * | 2010-03-30 | 2011-06-01 | 大唐移动通信设备有限公司 | 一种码本存储及使用该码本的信息收发方法及装置 |
CN103684477A (zh) * | 2012-09-24 | 2014-03-26 | 华为技术有限公司 | 混合极性码的生成方法和生成装置 |
WO2017097098A1 (zh) * | 2015-12-10 | 2017-06-15 | 华为技术有限公司 | 极化码处理的方法及通信设备 |
CN106230489A (zh) * | 2016-07-15 | 2016-12-14 | 西安电子科技大学 | 适用于任意高阶调制的极化码编码调制方法 |
Non-Patent Citations (2)
Title |
---|
CHEN, KAI: "Research on Polar Coding Theory and Practical Applications", CHINA DOCTORAL DISSERTATIONS FULL-TEXT DATABASE, 30 April 2015 (2015-04-30), XP009507011 * |
See also references of EP3605901A4 |
Also Published As
Publication number | Publication date |
---|---|
US20200091935A1 (en) | 2020-03-19 |
US11190213B2 (en) | 2021-11-30 |
EP3605901A4 (en) | 2020-04-22 |
EP3605901A1 (en) | 2020-02-05 |
CN109150375A (zh) | 2019-01-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN106899379B (zh) | 用于处理极化码的方法和通信设备 | |
US11133829B2 (en) | Communciation method using polar code, and wireless device | |
WO2018171682A1 (zh) | 一种编码方法、译码方法、装置和设备 | |
US10924210B2 (en) | Method, apparatus, and device for determining polar code encoding and decoding | |
CN109391343B (zh) | 一种Polar码编码方法及装置 | |
WO2018228589A1 (zh) | 一种编码方法、无线设备和芯片 | |
US11936402B2 (en) | Puncturing of polar codes with complementary sequences | |
WO2020098461A1 (zh) | Polar码编码方法及装置 | |
WO2018202080A1 (zh) | Polar码编译码方法及装置 | |
CN112118074B (zh) | 一种通信方法及装置 | |
WO2021254291A1 (zh) | 一种Polar码速率匹配方法及装置 | |
WO2019037782A1 (zh) | 极化码的译码方法和译码器 | |
WO2018161946A1 (zh) | 数据处理的方法和装置 | |
CN111865487B (zh) | 一种编码方法及通信设备 | |
WO2022007621A1 (zh) | 一种Polar码编解码方法及装置 |
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: 18817901 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2018817901 Country of ref document: EP Effective date: 20191025 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |