WO2017206055A1

WO2017206055A1 - Puncturing method and device

Info

Publication number: WO2017206055A1
Application number: PCT/CN2016/084052
Authority: WO
Inventors: 武雨春
Original assignee: 华为技术有限公司
Priority date: 2016-05-31
Filing date: 2016-05-31
Publication date: 2017-12-07

Abstract

Disclosed in the present invention are a puncturing method and device. The method comprises: acquiring a frozen index set of polar codes with the length of N symbols and an N*N generation matrix; transforming, according to the frozen set, N row vectors of the N*N generation matrix to obtain an N*N transformation matrix; determining, according to N column vectors of the N*N transformation matrix, the N weights corresponding to the N column vectors; puncturing, according to the N weights, the polar codes with the length of N symbols to obtain transmittable transmission symbols with the length of M, where N and M are integers greater than or equal to 1, and N is greater than M. The present invention can reduce the frame error rate of transmission data.

Description

Method and apparatus for punching

Technical field

Embodiments of the present invention relate to the field of communications, and in particular, to a method and apparatus for punching in the field of communications.

Background technique

Communication systems usually use channel coding to improve the reliability of data transmission and ensure the quality of communication. Forward Error Correction ("FEC") can resist the error in channel transmission by encoding the source information and adding certain redundant information. Polar codes are a new type of FEC code. The polarization code is a coding method that can achieve Shannon channel capacity and has low coding and decoding complexity. The polarization code is a linear block code. Its generator matrix is G _N. , and its encoding process is

Code length N=2 ⁿ , n≥0,

Here

B _N is a bit reversal matrix.

Is the Kronecker power of F, defined as

The polarization code is represented by a coset code

The encoding process is specifically as follows:

Here A is a collection of information bit indexes, ie

|·| indicates the number of elements in the set, that is, K represents the number of elements in the set A, and also represents the number of information bits to be encoded, G _N. (A) is the row corresponding to the index in the set A in G _N. Submatrix. G _N. (A ^C ) is a sub-matrix obtained from the row corresponding to the index in the set A ^C in G _N.

It is a frozen bit, the number is (NK), which is a known bit. For simplicity, these freeze bits can be set to zero. When the polarization code is applied in practice, the limitation is that the coded data block of the polarization code can only select the positive power of 2 for the code length because of its special configuration: N=2^n, and the actual physical channel can The length of the transmitted data does not always have N=2^n, which needs to be punctured or repeatedly matched to the length of data that the physical layer can actually transmit.

The prior art is random puncturing or uniform puncturing to achieve rate matching. For example, after the polarization code is encoded, the output data block length is N=2^n, and the data block that the physical layer can actually transmit is M, M<N. Punch P = (NM) symbols. The method of evenly puncturing is to erase one symbol every N/P symbols. If a symbol is erased, the data of the symbol bit is not transmitted during communication, but the symbol bit that is punctured in this way may be a key data bit. This will make the data frame error rate higher and the transmission effect worse.

Summary of the invention

The method and device for puncturing provided by the embodiment of the invention can reduce the frame error rate of the transmitted data and improve the efficiency of transmitting data.

In a first aspect, a method for puncturing is provided, the method comprising: acquiring a frozen index set of a polarization code of length N symbols and a generation matrix of an N*N order; according to the frozen index set, the N*N Transforming the N rows of the generation matrix of the order to obtain a transform matrix of N*N order; determining N weights corresponding to the N column vectors according to the N column vectors of the transform matrix of the N*N order; The polarization code of length N symbols is punctured according to the N weights to obtain a transmission symbol of length M, and N and M are integers greater than or equal to 1, and N is greater than M.

Specifically, the transform matrix is obtained by transforming the generated matrix according to the frozen index set, and the weight of the polarization code of each symbol of the polarization code of the N symbol lengths is obtained by using the transform matrix, and the weight of each symbol is determined according to the weight of each symbol. The sign bit of the hole can reduce the frame error rate of the transmitted data.

In a first possible implementation manner of the first aspect, the N row vectors of the N*N-order generation matrix are transformed according to the frozen index set, to obtain an N*N-order transformation matrix, including: In the generation matrix of the N*N order, the row vector corresponding to the element in the frozen index set is set to zero, and the transformation matrix of the N*N order is obtained.

Specifically, when N is greater than M, that is, the code length of the polarization code is larger than the data symbol that the actual channel can transmit, the polarization code needs to be punctured, and the NM data symbol bits are removed, and the freeze in the generation matrix can be performed. The row vector corresponding to the position of the element in the index set is set to zero, and the transformation matrix is obtained, further ensuring that important data symbol bits are reserved in the transmission symbol of length M, which can reduce the frame error rate of data transmission and improve data. The efficiency of the transmission.

With reference to the foregoing possible implementation manner of the first aspect, in a second possible implementation manner of the first aspect, determining N corresponding to the N column vectors according to the N column vectors of the N*N-th order transformation matrix The weight includes: the number of non-zero elements of the i-th column vector in the N column vectors of the N*N-th order transformation matrix as the i-th weight in the N weights, i is greater than or equal to 1 and less than or equal to N.

Specifically, after the row corresponding to the index of the frozen index set in the generated transformation matrix is set to zero, the number of non-zero elements per column in the statistical transformation matrix determines the weight corresponding to each symbol bit.

With reference to the foregoing possible implementation manners of the first aspect, in a third possible implementation manner of the first aspect, the polarization code of the length of the N symbols is punctured according to the N weights, and the transmission is enabled. The length of the M transmission symbol includes: determining the smallest NM of the N weights The weight value is obtained by performing a puncturing process on the symbol of the position index corresponding to the N-M weights in the polarization code of the N symbols to obtain the transmission symbol of length M.

With reference to the foregoing possible implementation manner of the first aspect, in a fourth possible implementation manner of the first aspect, the generating matrix of the N*Nth order is a generating matrix of a polarized channel of a discrete memoryless channel.

If the elements of the matrix generated by the polarization of the discrete memoryless channel are only 0 and 1, the row corresponding to the index of the frozen index set may be set to zero to generate a transformation matrix, and the number of 1s in each column in the statistical transformation matrix may be statistically Or adding the elements of each column in the transformation matrix to obtain the weight of each column, that is, when the elements of the generation matrix are 0 and 1, the number of non-zero elements of each column in the transformation matrix is added to each column element. The weight of each column is the same. Of course, for non-zero and one generator matrices, the number of non-zero elements of each column of the transform matrix can be counted to obtain the weight of each column, or the elements of each column can be summed. The weight of each column is not limited in this embodiment of the present invention.

With reference to the foregoing possible implementation manner of the first aspect, in a fifth possible implementation manner of the first aspect, determining a minimum NM weight value of the N weights includes: The N-orders are sorted by the N weights; if the NM weights of the sorted N weights are equal to the N-M+1 weights, the NM weights are Any one of the N-M+1 weights is determined as the NMth weight.

In a second aspect, an apparatus for puncturing is provided, the apparatus comprising: an obtaining module, configured to acquire a frozen index set of a polarization code of length N symbols and a generation matrix of an N*N order; a processing module, And performing N-row vector processing on the N*N-th order generation matrix according to the frozen index set to obtain a N*N-order transformation matrix; and determining a module, configured to use the N of the N*N-order transformation matrix The column vector determines N weights corresponding to the N column vectors; the processing module is further configured to: perform puncturing on the polarization code of the N symbols according to the N weights to obtain a transmittable A transmission symbol of length M, N and M are integers greater than or equal to 1, and N is greater than M.

In a first possible implementation manner of the second aspect, the processing module is specifically configured to: zero the row vector corresponding to the element in the frozen index set in the N*N-th order generation matrix, to obtain the N*N The transformation matrix of the order.

With reference to the foregoing possible implementation manner of the second aspect, in a second possible implementation manner of the second aspect, the determining module is specifically configured to: use the i th in the N column vectors of the transformation matrix of the N*N order The number of non-zero elements of the column vector is taken as the i-th weight in the N weights, i is greater than or equal to 1 and less than or equal to N.

In conjunction with the above possible implementation of the second aspect, a third possible implementation in the second aspect In the mode, the processing module is further configured to: determine a minimum NM weight among the N weights; and use a symbol of a position index corresponding to the minimum NM weight in the polarization code of the N symbols A punching process is performed to obtain a transmission symbol of length M.

In a third aspect, an apparatus for puncturing is provided, the apparatus comprising: a receiver, a transmitter, a memory, a processor, and a bus system. Wherein the receiver, the transmitter, the memory and the processor are connected by the bus system, the memory is for storing instructions for executing the instructions stored by the memory to control the receiver to receive signals and control the sending The transmitter transmits a signal, and when the processor executes the memory stored instructions, the execution causes the processor to perform the method of the first aspect or any of the possible implementations of the first aspect.

In a fourth aspect, a computer readable medium is provided for storing a computer program comprising instructions for performing the method of the first aspect or any of the possible implementations of the first aspect.

DRAWINGS

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings to be used in the embodiments of the present invention or the description of the prior art will be briefly described below. Obviously, the drawings described below are only the present invention. For some embodiments, other drawings may be obtained from those of ordinary skill in the art without departing from the drawings.

1 is a schematic diagram of a wireless communication system according to an embodiment of the present invention;

2 shows a system diagram of a method for puncturing the present invention in a wireless communication environment;

Figure 3 is a schematic view showing a method for punching an embodiment of the present invention;

4 is another schematic view of a method for punching an embodiment of the present invention;

FIG. 5 is a schematic view showing a simulation result of a method for punching according to an embodiment of the present invention; FIG.

6 is a schematic view showing another simulation result of a method for punching according to an embodiment of the present invention;

Figure 7 is a schematic block diagram of an apparatus for punching an embodiment of the present invention;

Fig. 8 shows a schematic block diagram of another apparatus for punching in accordance with an embodiment of the present invention.

detailed description

The technical solutions in the embodiments of the present invention will be clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are a part of the embodiments of the present invention, and It is all embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts shall fall within the scope of the present invention.

The embodiments of the present invention are applicable to various communication systems, and therefore, the following description is not limited to a specific communication system. Global System of Mobile communication ("GSM") system, Code Division Multiple Access ("CDMA") system, 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 ("TDD"), Universal Mobile Telecommunication System (UMTS), and the like. The information or data processed by the base station or the terminal in the above-mentioned system using the conventional Turbo code, Low Density Parity Check Code ("LDPC") encoding may also be encoded using the Polar code in this embodiment. .

The base station may be a device for communicating with the terminal device, for example, may be a base station (Base Transceiver Station, abbreviated as "BTS") in the GSM system or CDMA, or a base station (NodeB in the WCDMA system). NB"), may also be an evolved base station (Evolutional Node B, "eNB" or "eNodeB") in the LTE system, or the base station may be a relay station, an access point, an in-vehicle device, a wearable device, and a future 5G network. Network side devices, etc.

The terminal may communicate with one or more core networks via a radio access network (Radio Access Network, hereinafter referred to as "RAN"), and the terminal may be referred to as a user equipment (User Equipment, "UE"), an access terminal, a subscriber unit, User station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent or 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, or a personal digital assistant (Personal Digital Assistant, Referred to as "PDA"), a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in a future 5G network, and the like.

A schematic diagram 100 of a wireless communication system in accordance with an embodiment of the present invention is shown in FIG. The wireless communication system 100 includes a base station 102 that can include multiple antenna groups. Each antenna group can include one Or multiple antennas, for example, one antenna group may include

antennas

104 and 106, another antenna group may include

antennas

108 and 110, and additional groups may include

antennas

112 and 114. Two antennas are shown in Figure 1 for each antenna group, although more or fewer antennas may be used for each group. Base station 102 can additionally include a transmitter chain and a receiver chain, as will be understood by those of ordinary skill in the art, which can include multiple components associated with signal transmission and reception (e.g., processor, modulator, multiplexer, demodulation) , demultiplexer or antenna, etc.).

Base station 102 can communicate with one or more access terminals, such as access terminal 116 and access terminal 122. It should be understood that base station 102 can communicate with any number of access terminals similar to access terminal 116 or 122.

Access terminals

116 and 122 can be, for example, cellular telephones, smart phones, portable computers, handheld communication devices, handheld computing devices, satellite radios, global positioning systems, PDAs, and/or any other for communicating over wireless communication system 100. Suitable for equipment. As shown in FIG. 1, access terminal 116 is in communication with

antennas

112 and 114, wherein

antennas

112 and 114 transmit information to access terminal 116 over forward link 118 and receive information from access terminal 116 over reverse link 120. . In addition, access terminal 122 is in communication with

antennas

104 and 106, wherein

antennas

104 and 106 transmit information to access terminal 122 over forward link 124 and receive information from access terminal 122 over reverse link 126. In an FDD (Frequency Division Duplex) system, for example, the forward link 118 can utilize a different frequency band than that used by the reverse link 120, and the forward link 124 can utilize the reverse link 126. Different frequency bands used. Moreover, in a TDD (Time Division Duplex) system, the forward link 118 and the reverse link 120 can use a common frequency band, and the forward link 124 and the reverse link 126 can use a common frequency band.

Each set of antennas and/or regions designed for communication is referred to as a sector of base station 102. For example, the antenna group can be designed to communicate with access terminals in sectors of the coverage area of base station 102. During base station 102 communication with

access terminals

116 and 122 via

forward links

118 and 124, respectively, the transmit antenna of base station 102 may utilize beamforming to improve the signal to noise ratio of

forward links

118 and 124. In addition, when the base station 102 uses beamforming to transmit signals to the randomly dispersed

access terminals

116 and 122 in the relevant coverage area, the base station 102 uses a single antenna to transmit signals to all of its access terminals. Mobile devices are subject to less interference.

At a given time, base station 102, access terminal 116 or access terminal 122 may be a wireless communication transmitting device and/or a wireless communication receiving device. When transmitting data, the wireless communication transmitting device can encode the data for transmission. Specifically, the wireless communication transmitting device can acquire (eg, generate, receive from another communication device, or save in a memory, etc.) to be transmitted to the wireless communication through the channel. A certain number of symbols of the device. Such data may be included in a transport block (or multiple transport blocks) of data that may be segmented to produce multiple code blocks. Further, the wireless communication transmitting apparatus may encode each code block using a polarization code encoder (not shown).

2 shows a schematic block diagram of a system 200 in which a method for puncturing in an embodiment of the present invention is applied in a wireless communication environment. System 200 includes a wireless communication device 210 that transmits data via a channel. Although shown as transmitting data, the wireless communication device 210 can also receive data via a channel (eg, the wireless communication device 210 can transmit and receive data simultaneously, the wireless communication device 210 can transmit and receive data at different times, or a combination thereof, etc.) . The wireless communication device 210 can be, for example, a base station (e.g., base station 102 of FIG. 1), an access terminal (e.g., access terminal 116 of FIG. 1, access terminal 122 of FIG. 1, etc.), and the like.

The wireless communication device 210 can include a polarization code encoder 211, a polarization code rate matcher 212, and a transmitter 213. Alternatively, when the wireless communication device 210 receives data via a channel, the wireless communication device 210 may also include a receiver that may be present separately or integrated with the transmitter 213 to form a transceiver.

The polarization code encoder 211 is configured to encode the data to be transmitted from the wireless communication device 210 to obtain a polarization code.

The polarization code rate matcher 212 is configured to perform rate matching according to the polarization code output by the polarization code encoder 211. For example, the polarization code encoder obtains a polarization code of a code length N, and a code that can be transmitted by the physical layer. For the data of length M, the polarization code rate matcher obtains the transmission data of the code length M by performing puncturing or repeated matching processing on the polarization code of the code length N.

In addition, transmitter 213 can then transmit the rate matched transmission symbols processed by polarization code rate matcher 212 on the channel. For example, transmitter 213 can transmit relevant data to other different wireless communication devices (not shown).

Specifically, the process of processing the polarization code of the information source data of the K symbol lengths is: determining a set of information symbol bits of K symbol lengths, a frozen index set and a generation matrix of frozen symbols of NK symbol bit lengths. Since the input data of the polarization encoding process is equal to the number of symbols of the output data, it is necessary to determine the input data of N symbol lengths according to the frozen index set; the input data of the N symbol lengths through the generation matrix, the frozen index set, and the K A set of information symbol bits of symbol length is subjected to polarization coding to obtain a polarization code of N symbol lengths; since the length of the data actually transmitted in the physical layer is a length of M symbol lengths, N symbol lengths are required. Polarization code is subjected to puncturing processing to obtain transmission symbols of M symbol lengths, N is greater than M, and the present invention The embodiment is mainly directed to a method of punching after polarization encoding.

FIG. 3 illustrates a method 300 for puncturing in accordance with an embodiment of the present invention. For example, the method 300 can be performed by the polarization code rate matcher 212 illustrated in FIG. 2, the method 300 including:

S310. Acquire a frozen index set of a polarization code of length N symbols and a generation matrix of an N*N order.

S320, performing transform processing on the N row vectors of the N*N-th order generation matrix according to the frozen index set, to obtain a transform matrix of N*N order;

S330. Determine N weights corresponding to the N column vectors according to the N column vectors of the N*N-th order transformation matrix.

S340, performing a puncturing process on the polarization code of length N symbols according to the N weights to obtain a transmission symbol of length M, wherein N and M are integers greater than or equal to 1, and N is greater than M.

Specifically, the polarization code of length N symbols is obtained according to the frozen index set and the N*N order generation matrix, and the frozen index set and the generation matrix of the polarization code for generating the N symbol lengths are obtained; N* The N-th generation matrix includes N 1*N row vectors, and the N 1*N row vectors are changed according to the frozen index set to obtain N 1*N row vectors to form an N*N-order transformation matrix. The N*N-order transformation matrix includes N N*1 column vectors, and the weights corresponding to each of the N N*1 column vectors are obtained according to the N N*1 column vectors, for example, The elements of each of the N column vectors of the N*N-order transformation matrix may be added to obtain a weight corresponding to each column vector, and for example, each of the N column vectors may be Each element in the vector is assigned a weight coefficient, and then summed to obtain the weight of each column vector, a total of N weights are obtained, and the polarization code of length N symbols is subjected to puncturing according to N weights to obtain a length. For the transmission symbol of M, that is, the polarization code of NM symbol length needs to be destroyed by punching, and the remaining length is M. Input symbol, the length of transmission symbol M is the length of the physical layer can transmit actual data, thus, may reduce the frame error rate of transmission data.

It should be understood that, in S310, the frozen index set and the N*N order generation matrix of the polarization code of length N symbols are acquired, for example, may be acquired by the polarization code rate matcher 212, for example, the polarization code rate matcher 212. The freeze index set and the N*N order generation matrix sent by the polarization code encoder 211 as shown in FIG. 2 may be received, or the polarization code rate matcher 212 may receive the frozen index set and the N*N order sent by other devices. The generation matrix of the present invention is not limited thereto.

It should be understood that the use of symbols as units of data is a preferred embodiment of the present invention and may also be employed. The bit is used as a unit of data, which is not limited in this embodiment of the present invention.

In the embodiment of the present invention, the polarization code after polarization coding is punctured by using the frozen index set and the generation matrix used in the polarization coding process. In the prior art, the polarization code of length N symbols can be expressed as :

among them,

Is a binary line vector with a length of N; G _N. is a generator matrix of N*N order,

The code length is N=2 ⁿ , n≥0; here

B _N is a bit flip matrix,

Represents the Kronecke Product,

Is the Kronecker power, defined as

Suppose two matrices P = [P _ij ] _{m × n} , Q = [Q _ij ] _{r × s} , then

In the prior art, in the encoding process of the polarization code,

Some of the symbols are used to carry information (that is, data information that needs to be sent to the receiving end). These bits are called information symbols, and the index set of these symbols is denoted as A; the remaining part of the symbol is a fixed value, called The freeze symbol, for example, may be set to 0 for convenience. In the embodiment of the present invention, the set of the frozen symbols may be referred to as a frozen index set. It should be understood that the frozen index set may be a frozen bit in the embodiment of the present invention. It may be a freeze symbol, which is not limited by the embodiment of the present invention. G _N. may be referred to as a generator matrix in the embodiment of the present invention.

As an optional embodiment, the N rows of the N*N-order generation matrix are transformed according to the frozen set to obtain a transformation matrix of the N*N order, including: generating the N*N-order generation matrix The row vector corresponding to the element in the frozen index set is set to zero, and the transformation matrix of the N*N order is obtained.

Specifically, when N is greater than M, that is, the code length of the polarization code is greater than the data that can be transmitted by the actual channel, the polarization code needs to be punctured, the NM data symbol bits are removed, and the elements in the index set are frozen. The data symbol bits in the data block represent unimportant data symbol bits, and the row vector corresponding to the position of the elements in the frozen index set in the generation matrix can be set to zero, and the transformation matrix is obtained, which further ensures that the transmission symbol in the length M is retained. Important data symbol bits can reduce the frame error rate of data transmission and improve the efficiency of data transmission.

It should be understood that the row corresponding to the index in the frozen index set is set to zero because of the generation moment The elements of the array are only 0 and 1. For example, for all elements of a generator matrix, values greater than 3, the elements of the row corresponding to the index in the frozen index set can be set to a value less than 3, and N weights are determined. In this case, the number of elements greater than 3 in G1 may be determined as the weight corresponding to each column. The embodiment of the present invention does not impose any limitation on how the N values are determined.

As an example, for example, a Binary Symmetric Channel ("BSC"), if the frozen index set is {0, 1, 2, 3, 4, 5, 6, 8}, the 16*16 generation matrix G for:

[1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0

1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0

1 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0

1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0

1 0 1 0 0 0 0 0 1 0 1 0 0 0 0 0

1 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0

1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0

1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0

1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0

1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0

1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0

1 1 1 1 0 0 0 0 1 1 1 1 0 0 0 0

1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1];

The elements of the 0th line, the 1st line, the 2nd line, the 3rd line, the 4th line, the 5th line, the 6th line, and the 9th line are all set to zero, and the transformation matrix G1 of the 16*16 order is obtained as:

[0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0

1 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0

1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0

1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0

1 1 1 1 0 0 0 0 1 1 1 1 0 0 0 0

1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1];

As an optional embodiment, determining N weights corresponding to the N column vectors according to the N column vectors of the N*N-th order transformation matrix, including: N columns of the N*N-order transformation matrix The number of non-zero elements of the i-th column vector in the vector is taken as the i-th weight in the N weights, and i is greater than or equal to 1 or less than or equal to N.

Specifically, as in the above example, the number of non-zero elements of each column of the transformation matrix G1 is 16 weights: 8, 7, 5, 4, 5, 4, 3, 2, 5, 4, 3, 2, 3, 2, 2, 1.

It should be understood that after setting the row corresponding to the index in the frozen index set to zero, determining the number of non-zero elements of each column in G1 as the weight corresponding to each column is only a preferred embodiment, for example, G1 may be used. The elements of each column are added to obtain 16 weights. For example, each element in each column vector of the N column vectors may be assigned a weight coefficient, and then the weight of each column vector is obtained. The value is obtained by a total of N weights, which is not limited by the embodiment of the present invention.

As an optional embodiment, the polarization code of the length of the N symbols is punctured according to the N weights, and the length of the M transmission symbol that can be transmitted is obtained, including: determining the smallest of the N weights. NM weights; the symbols of the position indices corresponding to the NM weights in the polarization code of length N symbols are punctured to obtain the transmission symbols of length M.

As in the above example, when M is 13, that is, the length of the polarization code is 16, three of the symbols need to be punctured, and only 13 symbols of data can be transmitted on the physical channel, so that selection is required, 8 , 7,5,4,5,4,3,2,5,4,3,2,3,2,2,1 The smallest three

values

1, 2, 2 corresponding to the sign bit data for punching , that is, does not transmit the data of the gray sign bit as shown in FIG. 4, it should be understood that since there are four values with a weight of 2, the sign bit corresponding to any two of the four can be selected for punching, the present invention The embodiment does not limit this.

Optionally, the generation matrix of the N*N order is a generation matrix of a polarization channel of a discrete memoryless channel. If the elements of the matrix generated by polarization of the discrete memoryless channel are only 0 and 1, the row corresponding to the index of the frozen index set may be set to zero to generate a transformation matrix, the number of 1s in the statistical transformation matrix, or the transformation matrix The elements of each column are added to get the weight of each column, that is, when the moment is generated When the elements of the array are 0 and 1, the number of non-zero elements of each column in the transformation matrix is the same as the weight of each column obtained by adding each column element. Of course, for non-zero and 1 generation matrices, The number of non-zero elements of each column of the statistical transformation matrix is obtained as a weight of each column, or the weight of each column is obtained by summing the elements of each column, which is not limited in the embodiment of the present invention.

Therefore, the method for puncturing provided by the embodiment of the present invention first obtains a frozen index set and a generation matrix, sets a row corresponding to the frozen index set index in the generation matrix to zero, and then statistically generates each column of the N columns in the matrix. The number of non-zero elements is determined as N weights, and the N weights are determined as weights of polarization codes of length N symbols, and the smallest NM weights of the N weights are selected. The puncturing process is performed to obtain a transmission symbol of length M. Considering the nature of the polarization code with respect to the existing uniform puncturing, the error rate of the obtained data is low. Taking bit puncturing as an example, as shown in FIG. 5, for an Additive White Gaussian Noise (AWGN) channel, the original information is 50 bits, and the polarization coded polarization code is 128 bits. The transmission bit is 100 bits, and the 28 bits of the 128 bits need to be punctured, that is, K is 50, N is 128, and M is 100. The comparison between the present invention and the prior art uniform puncturing method simulation results shows that In the case of the same bit signal-to-noise ratio, the frame error rate ("FER") is lower when the method of the embodiment of the present invention is used. For example, when 4 dB is used, the uniform punning FER is about 0.04. The FER obtained by the method of the embodiment of the invention is about 0.02. As shown in FIG. 6, for the AWGN channel, the original information is 104 bits, the polarization coded polarization code is 256 bits, and the transmission bit is 208 bits, and 48 bits of 256 bits need to be punctured, that is, K. 104, N is 256, and M is 208. The simulation results of the present invention and the prior art uniform puncturing method show that the FER obtained by the method of the embodiment of the present invention is lower in the case of the same bit signal to noise ratio. For example, at 6 dB, the uniform punctured FER is about 0.1, and the FER obtained by the method of the embodiment of the present invention is about 0.007.

Figure 7 shows an apparatus 400 for puncturing in accordance with an embodiment of the present invention. For example, the apparatus may be a polarization code rate matcher, the apparatus 400 comprising:

The obtaining module 410 is configured to acquire a frozen index set of a polarization code of length N symbols and a generation matrix of an N*N order;

The processing module 420 is configured to perform transform processing on the N row vectors of the N*N-th order generation matrix according to the frozen index set, to obtain a transform matrix of N*N order;

a determining module 430, configured to determine N weights corresponding to the N column vectors according to the N column vectors of the N*N-th order transformation matrix;

The processing module 420 is further configured to: perform puncturing on the polarization code of the N symbols according to the N weights to obtain a transmission symbol of length M that can be transmitted, where N and M are greater than or equal to 1. Integer, N is greater than M.

As an optional embodiment, the processing module 420 is specifically configured to: zero the row vector corresponding to the element in the frozen index set in the N*N-order generation matrix to obtain the N*N-order transformation matrix.

As an optional embodiment, the determining module 430 is specifically configured to: use the number of non-zero elements of the i-th column vector in the N column vectors of the N*N-th order transformation matrix as the N weights. The i-th weight, i is greater than or equal to 1 and less than or equal to N.

As an optional embodiment, the processing module 420 is further configured to: determine a minimum NM weight among the N weights; and correspond to the smallest NM weights in the polarization code of the length N symbols The symbol of the position index is subjected to a puncturing process to obtain a transmission symbol of length M.

FIG. 8 illustrates an apparatus 500 for puncturing in accordance with an embodiment of the present invention. The apparatus 500 includes a receiver 510, a processor 520, a transmitter 530, a memory 540, and a bus system 550. The receiver 510, the processor 520, the transmitter 530 and the memory 540 are connected by a bus system 550 for storing instructions for executing instructions stored in the memory 540 to control the receiver 510. A signal is received and the transmitter 530 is controlled to send an instruction.

The receiver 510 is configured to acquire a frozen index set and a N*N order generation matrix of a polarization code of length N symbols, and the processor 520 is configured to generate a matrix of the N*N order according to the frozen index set. The N rows of vectors are transformed to obtain a transform matrix of N*N order, and the processor 520 is further configured to determine N weights corresponding to the N column vectors according to the N column vectors of the transform matrix of the N*N order The processor 520 is further configured to perform puncturing on the polarization code of the N symbols according to the N weights to obtain a transmission symbol of length M that can be transmitted, where N and M are greater than or equal to 1. Integer, N is greater than M.

As an optional embodiment, the processor 520 is specifically configured to: zero the row vector corresponding to the element in the frozen index set in the N*N-order generation matrix to obtain the N*N-order transformation matrix.

As an optional embodiment, the processor 520 is further configured to: use, as the N weights, the number of non-zero elements of the i-th column vector in the N column vectors of the N*N-th order transformation matrix. The i-th weight, i is greater than or equal to 1 and less than or equal to N.

As an optional embodiment, the processor 520 is further configured to: determine a minimum N-M weights among the N weights; and correspond to the smallest N-M weights in the polarization codes of the N symbols The symbol of the position index is subjected to a puncturing process to obtain a transmission symbol of length M.

It should be understood that apparatus 500 may be specifically a polarization code rate matcher in the above embodiments and may be used to perform various steps and/or flows corresponding to a polarization code rate matcher. Optionally, the memory 540 can include read only memory and random access memory and provides instructions and data to the processor. A portion of the memory may also include a non-volatile random access memory. For example, the memory can also store information of the device type. The processor 520 can be configured to execute instructions stored in the memory, and when the processor executes the instructions, the processor can perform the various steps corresponding to the polarization code rate matcher in the above method embodiments.

It should be understood that the size of the sequence numbers of the above processes does not imply a sequence of executions, and the order of execution of the processes should be determined by its function and internal logic, and should not be construed as limiting the implementation process of the embodiments of the present invention.

In the implementation process, each step of the above method may be completed by an integrated logic circuit of hardware in a processor or an instruction in a form of software. The steps of the method disclosed in the embodiments of the present invention may be directly implemented as a hardware processor, or may be performed by a combination of hardware and software modules in the processor. The software module can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like. The storage medium is located in a memory, and the processor executes instructions in the memory, in combination with hardware to perform the steps of the above method. To avoid repetition, it will not be described in detail here.

Those skilled in the art will appreciate that the various method steps and elements described in connection with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both, in order to clearly illustrate hardware and software. Interchangeability, the steps and composition of the various embodiments have been generally described in terms of function in the foregoing description. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the solution. Different methods may be used to implement the described functionality for each particular application, but such implementation should not be considered to be beyond the scope of the present invention.

A person skilled in the art can clearly understand that, for the convenience and brevity of the description, the specific working process of the system, the device and the unit described above can refer to the corresponding process in the foregoing method embodiment, and details are not described herein again.

In the several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the device embodiments described above are merely illustrative. For example, the division of the unit is only a logical function division, and may be implemented in actual implementation. In a different manner, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, or an electrical, mechanical or other form of connection.

The units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the embodiments of the present invention.

In addition, each functional unit in each embodiment of the present invention 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 integrated unit can be implemented in the form of hardware or in the form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention contributes in essence or to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium. A number of instructions are included to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present invention. The foregoing storage medium includes: a USB flash drive, a mobile hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a disk or a CD. A variety of media that can store program code.

The above is only the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any equivalent person can be easily conceived within the technical scope of the present invention by any person skilled in the art. Modifications or substitutions are intended to be included within the scope of the invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

A method for punching, characterized in that the method comprises:

Obtaining a frozen index set of the polarization code of length N symbols and a generation matrix of N*N order;

Performing transform processing on the N row vectors of the N*N-th order generation matrix according to the frozen index set to obtain a transform matrix of N*N order;

Determining N weights corresponding to the N column vectors according to the N column vectors of the N*N-th order transformation matrix;

Performing a puncturing process on the polarization code of length N symbols according to the N weights to obtain a transmission symbol of length M that can be transmitted, N and M being integers greater than or equal to 1, and N being greater than M.
The method according to claim 1, wherein the transforming the N row vectors of the N*N-order generation matrix according to the frozen index set to obtain an N*N-order transformation matrix, including :

Zeroing the row vector corresponding to the element in the frozen index set in the N*N-th order generation matrix to obtain the N*N-order transform matrix.
The method according to claim 2, wherein the determining the N weights corresponding to the N column vectors according to the N column vectors of the transformation matrix of the N*N order includes:

Taking the number of non-zero elements of the i-th column vector among the N column vectors of the N*N-th order transformation matrix as the i-th weight in the N weights, i is greater than or equal to 1 and less than Equal to N.
The method according to any one of claims 1 to 3, wherein the polarization code of the length of N symbols is punctured according to the N weights to obtain a length that can be transmitted Transfer symbols for M, including:

Determining a minimum of N-M weights among the N weights;

The symbol of the position index corresponding to the smallest N-M weights in the polarization code of the length of N symbols is punctured to obtain the transmission symbol of length M.
A device for punching, characterized in that the device comprises:

An acquiring module, configured to acquire a frozen index set of a polarization code of length N symbols and a generation matrix of an N*N order;

a processing module, configured to perform transform processing on the N row vectors of the N*N-th order generation matrix according to the frozen index set, to obtain a transform matrix of N*N order;

a determining module, configured to determine, according to the N column vectors of the transformation matrix of the N*N order N weights corresponding to N column vectors;

The processing module is further configured to perform puncturing on the polarization code of the N symbols according to the N weights to obtain a transmission symbol of length M that can be transmitted, where N and M are greater than or equal to An integer of 1, N is greater than M.
The device according to claim 5, wherein the processing module is specifically configured to:

Zeroing the row vector corresponding to the element in the frozen index set in the N*N-th order generation matrix to obtain the N*N-order transform matrix.
The apparatus according to claim 6, wherein the determining module is specifically configured to:

Taking the number of non-zero elements of the i-th column vector among the N column vectors of the N*N-th order transformation matrix as the i-th weight in the N weights, i is greater than or equal to 1 and less than Equal to N.
The device according to any one of claims 5 to 7, wherein the processing module is further configured to:

Determining a minimum of N-M weights among the N weights;

The symbol of the position index corresponding to the smallest N-M weights in the polarization code of the length of N symbols is punctured to obtain the transmission symbol of length M.