WO2018184493A1

WO2018184493A1 - Data encoding and decoding method and device

Info

Publication number: WO2018184493A1
Application number: PCT/CN2018/080835
Authority: WO
Inventors: 张公正; 罗禾佳; 王坚; 皇甫幼睿; 乔云飞; 李榕
Original assignee: 华为技术有限公司
Priority date: 2017-04-05
Filing date: 2018-03-28
Publication date: 2018-10-11
Also published as: CN108696283B; CN108696283A

Abstract

Disclosed in an embodiment of the present invention is a data encoding method characterized by comprising: performing polar code encoding on multiple data blocks to be encoded to obtained encoded data blocks, wherein each of the multiple data blocks carries feature information, and after the feature information has undergone polar code encoding, a relationship between the feature information carried by two adjacent preceding and subsequent data blocks is satisfied; using a corresponding scrambling sequence to perform descrambling on the feature information carried by the subsequent data block to obtain the feature information carried by the preceding data block; and outputting the multiple encoded data blocks in an order from preceding data blocks to subsequent adjacent data blocks.

Description

Method and apparatus for data encoding and decoding

Technical field

Embodiments of the present invention relate to the field of electronics and communications technologies and, more particularly, to methods and apparatus for data encoding and decoding.

Background technique

In communication systems, coding techniques are usually used to improve the reliability of data transmission and ensure the quality of communication. The Polar codes algorithm is the first procoding algorithm that theoretically proves that it can achieve Shannon capacity and has low coding and decoding (compilation code complexity is O(NlogN)) complexity.

The main broadcast block (English: Master Information Block, abbreviation: MIB) is carried on the physical broadcast channel (English: Physical Broadcast Channel, abbreviation: PBCH). In the case that the MIB adopts the LTE coding scheme, the complexity of the feature information (such as timing information) carried in the MI B is high.

Summary of the invention

The embodiment of the invention provides a data processing method and device, which can reduce the complexity of recovering feature information (such as timing information) carried in the MIB by the receiving end.

In a first aspect, an embodiment of the present invention provides a data encoding method, where the method includes:

Transmitting a plurality of data blocks to be encoded into a coded data block, wherein each of the plurality of data blocks to be encoded carries feature information in each of the to-be-coded data blocks, and the feature information is encoded by Polar code. The relationship between the feature information carried by the two adjacent data blocks to be encoded is satisfied: the feature information carried by the data block to be coded is descrambled by the corresponding relative scrambling code sequence, and is carried by the previous data block to be coded. Characteristic information;

The multi-segment encoded data blocks are output in the order in which they are adjacent to each other.

In the foregoing embodiment of the encoding method, by using a relative scrambling code sequence, the relationship between the feature information carried by the adjacent two segments of the data block to be encoded is constrained, thereby reducing the complexity of cracking the correct feature information at the receiving end. .

In a first possible implementation manner of the first aspect, the feature information is feature information after being scrambled.

With reference to the first aspect or the foregoing various possible implementation manners of the foregoing aspect, in a second possible implementation manner, in an embodiment of the foregoing encoding method, the feature information carried in the multiple pieces of data blocks to be encoded It is different.

With reference to the first aspect or the foregoing various possible implementation manners of the foregoing aspect, in a third possible implementation manner, the feature information may be timing information, where the timing information indicates that the multi-segment encoded data block is sent. order of.

With reference to the first aspect or the foregoing various possible implementation manners of the foregoing aspect, in a fourth possible implementation, the feature information refers to information related to a sending end of the multiple pieces of data to be encoded, or Refers to information related to the receiving end of the multi-segment data block to be encoded, or refers to information related to the data block to be encoded carrying the feature information, or refers to the sending manner of the data block after the multi-segment encoding relevant information.

With reference to the first aspect or the foregoing various possible implementation manners of the first aspect, in a fifth possible implementation, in a case that the feature information is time series information, the data block that is multi-segment encoded is configured according to The sequential output of the preceding and following adjacent, including:

The multi-segment encoded data blocks are output in the order in which the timing information is displayed.

With reference to the first aspect or the foregoing various possible implementation manners of the foregoing aspect, in the sixth possible implementation, the multi-segment to-be-coded data block refers to the multi-segment to-be-coded data block that is sent in one transmission period, Moreover, the timing information carried in different data blocks to be encoded is different in one transmission period.

With reference to the first aspect or the foregoing various possible implementation manners of the foregoing aspect, in a seventh possible implementation, the feature information carried in the data block to be encoded adjacent to each other in a transmission period When constructing the relative scrambling code sequence, the constructed relative scrambling code sequence has log ₂ N, wherein the N-segment encoded data block is transmitted in one transmission period.

With reference to the first aspect or the foregoing various possible implementation manners of the foregoing aspect, in the eighth possible implementation, the multiple data blocks to be encoded belong to a data block to be encoded in one transmission period, where Before or after the step of multi-segment data block to be encoded by Polar code to obtain the encoded data block, the method further includes:

The feature information carried in the multi-segment data block to be encoded is scrambled by using different scrambling code sequences, wherein the feature information carried in the multi-segment data block to be encoded in one transmission period is the same.

In a second aspect, an embodiment of the present invention further provides a decoding method, where the method includes:

Receiving two pieces of data blocks to be decoded adjacent to each other before and after, the data block to be decoded carries the feature information to be decoded;

A relative scrambling code sequence is used to participate in descrambling processing, and the obtained descrambling result is decoded and judged. The relative scrambling code sequence is used to participate in descrambling processing, and the obtained descrambling result is decoded and judged. The processing specifically includes: using a relative scrambling code sequence to descramble the feature information to be decoded carried in the data block to be decoded in the subsequent segment, and obtaining the descrambled feature information, and using the descrambled feature information and The feature information to be decoded carried in the data block to be decoded in the previous segment is combined and subjected to decoding processing; and the feature information after the decoding process is determined;

When the feature information participating in the judgment is an error, another relative scrambling code sequence is used to participate in the descrambling, and the obtained descrambling result is decoded and judged.

In the embodiment of the foregoing decoding method, by using the relative scrambling code sequence, the relationship between the feature information carried by the adjacent two blocks of the data block to be decoded is constrained, thereby reducing the complexity of cracking the correct feature information.

In a first possible implementation manner of the second aspect, the feature information may be feature information after being scrambled.

With reference to the second aspect or the foregoing various possible implementation manners of the second aspect, in the second possible implementation manner, the feature information carried in the two data blocks to be decoded is different.

With reference to the second aspect or the foregoing various possible implementation manners of the second aspect, in a third possible implementation manner, if the result of the determination is an error, try other relative scrambling code sequences to participate in the descrambling, The obtained descrambling result is decoded and judged until the judgment result is correct or all relative scrambling code sequences are tried. Among them, the relative scrambling code sequence of each attempt is different.

With reference to the second aspect or the foregoing various possible implementation manners of the second aspect, in a fourth possible implementation, the determining process includes:

Performing a verification process on the decoded feature information and determining whether the feature information after the decoding process belongs to candidate feature information;

After determining that the decoded feature information is correctly verified and belongs to the candidate feature information, it is determined that the decoded feature information is correct feature information.

With reference to the second aspect or the foregoing various possible implementation manners of the foregoing aspect, in a fifth possible implementation, the candidate feature information is: associated with the relative scrambling code sequence participating in the descrambling process Characteristic information.

With reference to the second aspect or the foregoing various possible implementation manners of the second aspect, in a sixth possible implementation, the interference processing is performed by using a relative scrambling code sequence, and the obtained descrambling result is decoded and Before the step of judging the processing, the method further includes:

Calculating a relative scrambling code sequence that matches the correlation by calculating a correlation between two pieces of feature information to be decoded carried in the two blocks of data blocks to be decoded, and the obtained relative scrambling code sequence To participate in the relevant scrambling code sequence of the descrambling process.

In a third aspect, an embodiment of the present invention further provides a decoding method, where the method includes:

Calculating a correlation of the two pieces of information to be decoded carried in the data blocks to be decoded, and obtaining a relative scrambling code sequence that matches the correlation, and using the relative scrambling code sequence to The feature information to be decoded carried in the data block to be decoded is descrambled to obtain the descrambled feature information, and the descrambled feature information is used in the data block to be decoded in the previous segment. Carrying the feature information to be decoded and combining the decoding process; and determining the feature information after the decoding process;

When the feature information participating in the judgment is correct, the feature information judged to be correct is output.

In a fourth aspect, the embodiment of the present invention further provides a data processing apparatus, where the data processing apparatus includes:

a first encoding module, configured to perform a Polar code encoding on a plurality of data blocks to be encoded to obtain a coded data block, where each piece of the data block to be encoded in the plurality of pieces of data to be encoded carries feature information, and the feature information After the Polar code is encoded, the relationship between the feature information carried by the two adjacent data blocks to be encoded is satisfied: the feature information carried by the latter data block to be coded is descrambled by using the corresponding relative scrambling code sequence. Characteristic information carried by a data block to be encoded;

The interface module is configured to output the multi-segment encoded data blocks in the order of the adjacent ones.

In a fifth aspect, an embodiment of the present invention further provides a data processing apparatus, where the data processing apparatus includes:

a receiving module, configured to receive two pieces of data blocks to be decoded that are adjacent to each other before and after, and the data block to be decoded carries feature information to be decoded;

a first decoding module, configured to participate in descrambling processing by using a relative scrambling code sequence, and perform decoding and judging processing on the obtained descrambling result, wherein the relative scrambling code sequence is used to participate in descrambling processing, and the obtained Decoding the decoding result and determining the processing specifically includes: using a relative scrambling code sequence to descramble the feature information to be decoded carried in the data block to be decoded in the subsequent segment, and obtaining the descrambled feature information, Decoding the feature information and combining the feature information to be decoded carried in the data block to be decoded in the previous segment to perform decoding processing; and determining the decoded feature information; When the feature information participating in the judgment is an error, another relative scrambling code sequence is used to participate in the descrambling, and the obtained descrambling result is decoded and judged.

In a sixth aspect, the embodiment of the present invention further provides a data processing apparatus, where the data processing apparatus includes:

a second decoding module, configured to calculate a correlation between the two pieces of information to be decoded carried in the data block to be decoded, and obtain a relative scrambling code sequence that matches the correlation, The relative scrambling code sequence descrambles the feature information to be decoded carried in the data block to be decoded in the subsequent segment to obtain the descrambled feature information, and the descrambled feature information and the previous segment Decoding the feature information to be decoded carried in the data block to be decoded and performing decoding processing; and determining the feature information after the decoding process;

The receiving module is further configured to output the feature information determined to be correct if the feature information participating in the determination is correct.

In a seventh aspect, an embodiment of the present invention provides a communication device, where the communication device includes: a processor, and a memory interconnected with the processor, when the communication device is running, the processor reads and executes The instructions in the memory or run their own hardware logic to cause the communication device to perform various embodiments of any of the methods described in the first to third aspects.

In a first possible implementation of the seventh aspect, the memory is configured to store the instructions, and the memory may be independent of the processor or integrated in the processor.

In conjunction with the foregoing various possible implementations of the seventh aspect or the seventh aspect, in a second possible implementation, the communications apparatus may further include a transceiver for receiving and/or transmitting data.

Yet another aspect of an embodiment of the present application also provides a computer readable storage medium having stored therein instructions that, when run on a computer, cause the computer to perform the methods described in the above aspects .

Yet another aspect of an embodiment of the present application also provides a computer program product comprising instructions that, when executed on a computer, cause the computer to perform the methods described in the various aspects above.

DRAWINGS

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

2 is a schematic diagram of a coding process of a Polar code in an embodiment of the invention;

3 is a schematic flowchart of a data encoding method according to an embodiment of the present invention;

4 is a schematic flow chart of a specific implementation manner of the data encoding method shown in FIG. 3;

FIG. 5 is a schematic flowchart diagram of a specific implementation manner of the data encoding method shown in FIG. 3;

FIG. 6 is a schematic flowchart of a decoding method according to an embodiment of the present invention;

FIG. 7 is a schematic flowchart diagram of another decoding method according to an embodiment of the present invention;

8 is a schematic flowchart of a specific implementation manner of the data encoding method shown in FIG. 3;

FIG. 9 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present invention;

FIG. 10 is a schematic structural diagram of another data processing apparatus according to an embodiment of the present invention;

FIG. 11 is a schematic structural diagram of still another data processing apparatus according to an embodiment of the present invention;

FIG. 12 is a schematic structural diagram of a communication apparatus according to an embodiment of the present invention.

detailed description

The embodiments of the present invention are applicable to various communication systems, such as wireless communication systems and the like. Therefore, the following description is not limited to a particular 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 system using the conventional turbo code and LDPC code encoding can be encoded by 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, BTS) in the GSM system or CDMA, or a base station (NodeB, NB) in the WCDMA system, or It is an evolved base station (Evolutional Node B, eNB or eNodeB) in the LTE system, or the base station can be a relay station, an access point, an in-vehicle device, a wearable device, and a network side device in a future 5G network.

The terminal may communicate with one or more core networks via a Radio Access Network (RAN), and the terminal may refer to a User Equipment (UE), a terminal, a subscriber unit, a subscriber station, a mobile station, and a mobile station. , remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent or user device. The terminal can be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), and a wireless communication function. Handheld devices, computing devices or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, terminal devices in future 5G networks, and the like.

The communication system in various embodiments herein may be a wireless communication system, and FIG. 1 illustrates a wireless communication system 100. System 100 includes a base station 102 that can include multiple antenna groups. For example, one antenna group may include

antennas

104 and 106, another antenna group may include

antennas

108 and 110, and additional groups may include

antennas

112 and 114. Two antennas are shown for each antenna group, however more or fewer antennas may be used for each group. Base station 102 can include a transmitter chain and a receiver chain, as will be understood by those of ordinary skill in the art, which can include various components associated with signal transmission and reception, such as processors, modulators, multiplexers, demodulators, Demultiplexer or antenna.

Base station 102 can communicate with one or more terminals, such as terminal 116 and terminal 122. However, it will be appreciated that base station 102 can communicate with any number of terminals similar to

terminals

116 and 122.

Terminals

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

antennas

112 and 114, with

antennas

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

antennas

104 and 106, wherein

antennas

104 and 106 transmit information to terminal 122 over forward link 124 and receive information from terminal 122 over reverse link 126. In a Frequency Division Duplex ("FDD") system, for example, the forward link 118 may utilize a different frequency band than that used by the reverse link 120, and the forward link 124 may utilize The frequency bands used by the reverse link 126 are different in frequency bands. Moreover, in a Time Division Duplex ("TDD") 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 be used together. frequency band.

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

forward links

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

forward links

118 and 124 of

terminals

116 and 122. In addition, mobile devices in adjacent cells are less subject to interference when the base station 102 transmits to the randomly dispersed

terminals

116 and 122 in the relevant coverage area as compared to the base station transmitting to all of its terminals through a single antenna. .

At a given time, base station 102, terminal 116, and/or terminal 122 may be transmitting wireless communication devices and/or receiving wireless communication devices. When transmitting data, the transmitting wireless communication device can encode the data for transmission. Specifically, the transmitting wireless communication device is to be transmitted over a channel to a certain number of information bits of the receiving wireless communication device. Such information bits may be included in a transport block or a plurality of transport blocks of data, which may be segmented to produce a plurality of code blocks. In addition, the transmitting wireless communication device can encode each code block using a polar code encoder to improve the reliability of data transmission, thereby ensuring communication quality.

In the fifth-generation (5th generation, 5G) communication system and subsequent more possible communication systems, three types of scenarios are defined, namely enhanced mobile broadband (English: enhanced mobile broadband) (eMBB), ultra-reliable low-latency Communication (English: Ultra Reliable Low Latency Communications, URLLC) and large-scale Internet of Things (English: massive Machine Type Communications, abbreviation: mMTC). Among them, the eMBB service mainly includes ultra high definition video, augmented reality AR, virtual reality VR, etc. The main feature is that the transmission data volume is large and the transmission rate is high. The URLLC service is mainly used for industrial control and unmanned driving in the Internet of Things. The main features are ultra-high reliability, low latency, low transmission data and burstiness. The mMTC service is mainly used for smart grids and smart cities in the Internet of Things. The main features are the connection of mass devices, the small amount of data transmitted, and the delay of tolerating for a long time.

At the 87th meeting of 3GPP (English: 3rd Generation Partnership Project) RAN1 (English: Radio Access Network, Chinese: Radio Access Network), the polar Polar code was officially received as 5G eMBB. :enhanced Mobile Broadband) The channel coding scheme of the uplink and downlink control channels of the scenario.

Communication systems usually use channel coding to improve the reliability of data transmission and ensure the quality of communication. 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. The Polar code is a linear block code. Its generator matrix is G _N and its encoding process is

among them,

Is a binary line vector,

The code length N = 2 ⁿ , where n is a positive integer.

Is the Kroneck product of F ₂ , defined as

During the encoding of the Polar code,

A part of the bits are used to carry information, called information bits, and the set of sequence numbers of these information bits is denoted as A. The other part of the bits is set to a fixed value pre-agreed by the transceiver, which is called a fixed bit, and the set of the sequence numbers is represented by the complement A ^{c of} A. These fixed bits are usually set to 0. In fact, only the transceiver end is required to be pre-agreed, and the fixed bit sequence can be arbitrarily set. Thus, the encoded bit sequence of the Polar code can be obtained by the following method:

Here

for

a collection of information bits,

a row vector of length K, ie

|·| 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. Under the CRC (Cyclic Redundancy Check)-assisted Enhanced SC (Successive Cancellation Decoding) decoding algorithm, the Polar code can be better than the low-density parity-check code (LDPC). Density parity check code) and FER (frame error rate) performance of Turbo code.

As shown in Figure 2, the encoding process of an 8x8 Polar code is as follows:

In mathematical expressions, the Polar coding process can be expressed in the GF(2) domain as: uG=x

Where u is the bit sequence to be encoded and x is the encoded bit sequence obtained after encoding. According to the nature of matrix multiplication, we can get: (u+p)G=x+q

Where pG=q. p and q can be regarded as scrambling sequences for u and x, respectively. Therefore, the linear operation of the bit (u) of the information side before encoding can cause a change in the encoded bit sequence (x) to be regarded as a scrambling operation on the encoded bit.

The embodiment of the present invention utilizes the characteristics of the Polar coding matrix to construct a scrambling code sequence p for the bit sequence u in the data block to be encoded, so that between one coding bit sequence x of each data block to be coded in one transmission period The types of relative scrambling sequences are as small as possible. If the two scrambling code sequences used on the information side are respectively p1, p2, the scrambling code sequence used in the bit sequence in the encoded data block is Δq=(p1+p2)G, where the operation is performed. Both are operations of GF(2).

On the one hand, the scrambling of the information end before encoding is equivalent to the scrambling of the encoded coded end, and the type of the scrambling code sequence of the coded bit end is designed to be as small as possible, which is equivalent to designing the scrambling sequence on the information side. The number of scrambling sequences of the information side relative to the scrambling sequence is as small as possible. Based on the scrambling code sequence of the design information end, for the N different scrambling code sequences, the types of the relative scrambling code sequences are only log ₂ N.

At the transmitting end, different p vectors are constructed for different timing information. Each timing information is represented by a vector u, and different p vectors to be encoded are scrambled with different p vectors, and then polar coded and transmitted. Equivalently, the Polarated vector x is scrambled with the corresponding q vector. Send it. It can be seen that each p vector has a corresponding timing.

At the receiving end, two pieces of PBCH signals adjacent to each other are received, the latter PBCH signal is descrambled by using the relative scrambling code sequence, and the descrambled result is combined with the previous PBCH signal, and then translated by a polar decoder. Code, and use CRC check, if passed, the decoding is successful.

In the case that the timing information needs to be carried in the data block to be encoded, the embodiment of the present invention provides two modes, one is display transmission of timing information, and the other is implicit transmission of timing information. The display transmission of the time series information means that the feature information carried in each piece of the data block to be encoded in one transmission period is different. The feature information carried in the data blocks to be encoded in each segment is used to indicate the sending order of the data blocks to be encoded in each segment. After the feature information carried in the two blocks of the data block to be coded is encoded by the Polar code, the feature information carried by the data block to be coded is descrambled by the corresponding relative scrambling code sequence to be carried by the previous block to be coded. Characteristic information. In this way, the complexity of cracking the feature information can be reduced at the receiving end by the relative scrambling code sequence.

Implicit transmission of timing information means that the feature information carried in each piece of data to be encoded in one transmission period is the same. Different scrambling results are obtained by scrambling different scrambling code sequences in the same plurality of pieces of data to be encoded in a transmission period, and the different scrambling results are used to indicate the one The order in which the plurality of pieces of data blocks to be encoded are transmitted in the transmission period. After the scrambled feature information carried in the two blocks of the data block to be coded is encoded by the Polar code, the scrambled feature information carried by the latter block to be coded is descrambled by using the corresponding relative scrambling code sequence. The scrambled feature information carried by the previous block to be encoded. In this way, the complexity of cracking the scrambled feature information can be reduced at the receiving end by the relative scrambling code sequence.

All of the above concepts and examples can be used to explain the following embodiments.

As shown in FIG. 3, an embodiment of the present invention provides a data encoding method, where the method includes:

S101. Perform a Polar code encoding on a plurality of data blocks to be encoded to obtain a coded data block, where each piece of the to-be-coded data block in the multi-segment to-be-coded data block carries feature information, and the feature information is encoded by a Polar code. The relationship between the feature information carried by the two adjacent data blocks to be encoded is satisfied: the feature information carried by the data block to be coded is descrambled by the corresponding scrambling code sequence to obtain the previous one. Encoding the feature information carried by the data block;

S102. Output the data blocks that are multi-segment encoded in the order in which they are adjacent to each other.

In an embodiment of the foregoing encoding method, the feature information may be feature information after scrambling.

In the foregoing embodiment of the encoding method, the feature information carried in the plurality of data blocks to be encoded may be different or the same.

In an embodiment of the foregoing encoding method, the feature information may be time series information, and the implementation manner belongs to displaying and transmitting the time series information.

The timing information displays an order in which the plurality of encoded data blocks are transmitted. The information about the information about the transmitting end of the data block to be encoded, or the information related to the receiving end of the data block to be encoded, or the information to be carried The information related to the encoded data block or the information related to the manner in which the multi-segment encoded data block is transmitted.

In the case that the feature information is time series information, the data blocks that are multi-segment encoded are output in the order of the adjacent ones before and after, including:

In an embodiment of the foregoing encoding method, the multi-segment encoded data blocks may be transmitted in a broadcast channel in the order in which the timing information is displayed.

In the above embodiment of the encoding method, the multi-segment data block to be encoded refers to a plurality of pieces of data blocks to be encoded transmitted in one transmission period (or transmission period). Moreover, further, the timing information carried in different data blocks to be encoded is different in one transmission period.

In an embodiment of the foregoing encoding method, the plurality of pieces of timing information carried by the plurality of pieces of data blocks to be encoded are used to display a sending order of the plurality of pieces of data blocks to be encoded when being transmitted. However, the values of the plurality of timing information are not necessarily sequentially arranged, as long as the timing information carried by the data blocks to be encoded in each segment is different in one transmission period.

In the plurality of data blocks to be encoded, a relative scrambling code sequence can be constructed between the feature information of each of the two adjacent data blocks to be encoded. The relative scrambling code sequences constructed between the feature information of two adjacent to-be-coded data blocks may be the same or different. The value of the feature information may be constructed according to how to construct a relatively identical scrambling code sequence between feature information of each of the two adjacent data blocks to be encoded in one transmission period. The relative scrambling sequence is the target.

Regarding the construction process of the relative scrambling code sequence, reference may be made to the following specific examples, and any of the detailed features in the following examples can be independently incorporated into the above embodiments:

As shown in FIG. 4, the data encoding method of the embodiment of the present invention may further include: before the step of performing the Polar code encoding of the plurality of pieces of data to be encoded to obtain the encoded data block, the method further includes:

S100: Perform a CRC (Cyclic Redundancy Check) encoding on the to-be-coded data block to be sent, and map the CRC-encoded bit to the information bit, and place a fixed value agreed by the transmitting end and the receiving end in the static frozen bit.

In the case where the feature information is time series information, the to-be-encoded data block i to be transmitted refers to the data transmitted ith in a transmission period, and the to-be-coded data block i to be transmitted includes the timing information. In a transmission period, the timing information in different data blocks to be encoded is different, that is, the timings of the data blocks to be encoded are different, and the data blocks to be transmitted are also different. Assuming that the system frame number has a total of 10 bits, the data format of the data block to be transmitted to be transmitted is [b _k ... b ₀ , a ₉ , a ₈ , a ₇ , a ₆ , a ₅ , a ₄ , a ₃ , a ₂ , a ₁ , a ₀ ], where b _k ... b ₀ are other system information, a ₉ , a ₈ , a ₇ , a ₆ , a ₅ , a ₄ , a ₃ , a ₂ , a ₁ , a ₀ System frame number, a ₀ is low. The data after 16-bit CRC encoding is [b _k ... b ₀ , a ₉ , a ₈ , a ₇ , a ₆ , a ₅ , a ₄ , a ₃ , a ₂ , a ₁ , a ₀ , c ₁₅ , c ₁₄ , ... c ₁ , c ₀ ], where c ₁₅ , c ₁₄ , ... c ₁ , c ₀ are CRC bits.

The above embodiments of the present invention can be applied to a physical broadcast channel. The physical broadcast channel (English: Physical Broadcast Channel, abbreviation: PBCH) generally carries a master information block (English: Master Information Block, abbreviation: MIB). For example, in the PBCH design of LTE, the length of the MIB is 24 bits, the MIB includes the downlink system bandwidth, the PHICH (English: Physical Hybrid ARQ Indicator Channel, Chinese: physical hybrid automatic repeat request indication channel) size, and the system frame number ( English: System Frequency Number, referred to as: SFN), the high eight and so on. This is the configuration of the PBCH in LTE. If it is a display transmission, it is necessary to put all 10 bits of SFN information into the MIB. The base station first performs a Cyclic Redundancy Check (CRC) encoding on the MIB to be transmitted to obtain a 16-bit CRC sequence, and then the base station will have a 40-bit long sequence (including a 24-bit MIB and a 16-bit CRC). The channel coding and the rate matching are performed to obtain a coding sequence, and the coding sequence is segmented to obtain four equal-sized PBCH independent units, and the base station performs subsequent modulation, mapping, and transmission processes.

The channel coding of the PBCH is coded using a polarization code. After performing modulation and mapping processes on four PBCH independent units, the transmission is performed within a time window of 40 ms (transmission time of 4 radio frames, 10 ms per radio frame). In the implicit transmission, the bits participating in the coding in the four PBCH independent units are the same, and the encoded bits are also the same. However, when the transmission is displayed, the bits participating in the coding in the four PBCH independent units are different, and the encoded bits are also different.

Because the four PBCH independent units carry the same coded bits, if the channel quality is good enough, the receiver can only successfully complete the decoding and CRC check operations by receiving only one PBCH independent unit within 40 ms. After the decoding of the receiving end is successful, the transmitting terminal sends the MIB in the first few radio frames within 40 ms, that is, the SFN information is known.

For the case of poor channel quality, if the receiving end only receives one PBCH independent unit and cannot successfully decode, it will perform soft combining with the next PBCH independent unit transmitted in the next 10ms and then decode it until successful decoding.

If four PBCH independent units (which may also be referred to as data blocks) are transmitted in one PBCH cycle, b _k ... b ₀ in four PBCH independent units and a ₉ , a ₈ , a in the system frame number in one cycle ₇ , a ₆ , a ₅ , a ₄ , a ₃ , a ₂ are the same, a ₁ , a ₀ change according to time series, that is, the timing information has the following four types: 0->1->2->3, if according to binary The representation is: 00->01->10->11. The different parts of the system frame numbers in all PBCH independent units in one cycle are used as timing information, and are put into data blocks for encoding and transmission. This method belongs to display transmission.

Since the CRC is also a linear code, that is, the CRC bit CRC(a) obtained by a coding, the CRC bits obtained by a+b coding are CRC(a+b), and the CRCs of the four data blocks transmitted in one cycle are respectively recorded as CRC (00), CRC (01), CRC (10), CRC (11). By using the timing information in the previously transmitted data block as a reference, the timing information in the data block transmitted in the next transmission can be regarded as scrambling the timing information in the data block transmitted in the previous time, and the scrambled sequence is called relative Scrambling code sequence. For the four data blocks transmitted in the above one cycle, the relative scrambling sequence of the data blocks transmitted before and after the two adjacent data blocks before encoding is:

00(0)->01(1): [00...01CRC(0...01)]

01(1)->10(2): [00...11CRC(0...11)]

10(2)->11(3): [00...01CRC(0...01)]

The relative scrambling sequences of the coded bits of the two transmitted data blocks adjacent to each other are:

Table 1

The relative scrambling code sequence between 00000000 and 11111111 is 11111111, the relative scrambling code sequence between 11111111 and 10101010 is 01010101, and the relative scrambling code sequence between 10101010 and 01010101 is 11111111.

It is not difficult to find that the relative scrambling sequence of the information end before encoding has a total of log ₂ 4=2 possibilities, and there are only two possibilities for the relative scrambling sequence of the encoded bits after Polar encoding, which are respectively Polar ([00...01 CRC( 0...01)]) and Polar([00...11CRC(0...11)]), Polar(a) indicates Polar encoding for a.

If 8 PBCH independent units (which may also be referred to as data blocks) are transmitted in one PBCH cycle, b _k ... b ₀ and a ₉ , a ₈ , a ₇ , a ₆ , a in the system frame number in one cycle ₅ , a ₄ , a ₃ do not change, a ₂ , a ₁ , a _{0 is} used to represent timing information. In one cycle, the timing information of each data block is different, there are 8 kinds as follows, namely 0 ->1->2->3->4->5->6->7, if expressed in binary: 000->001->010->011->100->101->110-> 111. For the eight data blocks transmitted in the above one cycle, the relative scrambling sequence of the data blocks transmitted before and after the two adjacent data blocks before encoding is:

000(0)->001(1):[00...001CRC(0...001)]

001(1)->010(2): [00...011CRC(0...011)]

010(2)->011(3): [00...001CRC(0...001)]

011(3)->100(4): [00...111CRC(0...111)]

100(4)->101(5): [00...001CRC(0...001)]

101(5)->110(6): [00...011CRC(0...011)]

110(6)->111(7): [00...001CRC(0...001)]

That is, the relative scrambling sequence of the information end has a total of log ₂ 8=3 possibilities, and the relative scrambling sequence of the encoded bits after the Polar encoding has only three possibilities, namely Polar ([00...001CRC(0...001)]), Polar([00...011CRC(0...011)]) and Polar([00...111CRC(0...111)]). The parts affecting the relative scrambling sequence are listed as a table, as shown in Table 2.

Table 2

Shown in Table 2 is the relationship between the encoded timing information and the relative scrambling sequence. It can be seen that, in the embodiment of the present invention, the scrambling code sequence of the feature information in the encoded data block may have a total of log ₂ N relative scrambling code sequences, where N refers to a to be encoded sent in one transmission period. The number of data blocks, or the number of data blocks to be decoded received within one receiving period. Thus, the scrambling code sequence has relatively few types of scrambling code sequences. In the case where the type of the scrambling code sequence is relatively small, in the case of blind detection, only a small number of attempts are required to try out which is the correct relative scrambling code sequence, and then it is also possible to obtain Out which is the correct timing information associated with the relative scrambling sequence.

In an embodiment of the above encoding method, the timing information may be implicitly transmitted.

In the implicit transmission mode, the multi-segment data block to be encoded belongs to a data block to be encoded in one transmission period, and before the step of encoding the data block to be encoded by the multi-segment data block to obtain the encoded data block Or later include:

S009: The feature information carried in the data block to be encoded is scrambled by using different scrambling code sequences, where the feature information carried in the multi-segment data block to be encoded in one transmission period is the same.

In the foregoing embodiment of the present invention, the feature information carried in the multi-segment data block to be encoded in one transmission period is scrambled by using different scrambling code sequences, so that after the scrambling, the multi-segment waiting in one transmission period can be distinguished. Encoded data blocks. In the case that the feature information carried in the multi-segment data block to be coded in one transmission period is the same, the data block to be coded in each transmission period can be distinguished in this manner, and the feature can be obtained after scrambling The information indicates the order in which the data blocks to be encoded are transmitted in a transmission period. The way in which the information of the transmission order (that is, the time series information) is represented by the scrambled feature information is implicit transmission.

It should be noted that the scrambling process in the step S009 may be that the feature information in the encoded data block is scrambled by performing the Polar code encoding on the data block to be encoded in the multiple segments, or may be The plurality of pieces of data to be encoded are scrambled by the feature information carried before the Polar code is encoded.

As shown in FIG. 5, the data encoding method in the embodiment of the present invention further includes: before scrambling the feature information carried in the multi-segment data block to be encoded by using different scrambling code sequences:

S008: Perform a CRC (Cyclic Redundancy Check) encoding on the to-be-coded data block to be sent.

As shown in FIG. 5, in the data encoding method of the embodiment of the present invention, after the feature information carried in the multi-segment data block to be encoded is scrambled by using different scrambling code sequences, and the multi-segment data block to be encoded is subjected to Polar. The step of encoding the coded data block may further include:

S007: mapping the scrambled bits to the information bits, and placing the fixed values agreed by the transmitting end and the receiving end in the static frozen bits.

Or equivalently, as shown in FIG. 8, the data encoding method of the embodiment of the present invention may further include: after the step of performing the Polar code encoding of the data block to be encoded by the multi-segment to obtain the encoded data block:

S006. The feature information carried in the multi-segment data block to be encoded is scrambled by using a corresponding scrambling code sequence.

As a specific example below, any of the details of the following examples can be independently incorporated into the above embodiments:

Specifically, the data to be transmitted within one PBCH cycle is the same, including partial high-order information of the timing. Assuming that the system frame number has a total of 10 bits, the data format to be transmitted is [b _k ... b ₀ , a ₉ , a ₈ , ..., a _i ], where b _k ... b ₀ is other system information, a ₉ ,..., a _i is the upper bit of the system frame number, and the lower bit does not participate in the encoding. After 16-bit CRC encoding, the data is [b _k ... b ₀ , a ₉ ,..., a _i , c ₁₅ , c ₁₄ ,...c ₁ ,c ₀ ], where c ₁₅ , c ₁₄ , ... c ₁ , c ₀ are CRC bits.

If four PBCH independent units are transmitted within one PBCH period, the contents of the data block to be encoded are b _k ... b ₀ , a ₉ , a ₈ , a ₇ , a ₆ , a ₅ , a ₄ , a ₃ , a ₂ is the same part of all PBCH independent units transmitted in one cycle. In order to distinguish the timing of transmitting the PBCH independent unit in one cycle, the information bits before the Polar encoding are scrambled with different scrambling code sequences, that is, the CRC encoded bit sequence [b _k ... b ₀ , a ₉ , ..., a _i , c ₁₅ , c ₁₄ , ... c ₁ , c ₀ ]. If 0, 00, 0...01, 0...10, 0...11 are used to scramble the

timings

0, 1, 2, and 3 respectively, that is, only the last two information bits are operated, the relative scrambling sequence of the information end is [0 ...01], [0...11], [0...01], the scrambling results are [b _k ... b ₀ , a ₉ , ..., a _i , c ₁₅ , c ₁₄ , ... c ₁ , c ₀ ], respectively. [b _k ... b ₀ , a ₉ , ..., a _i , c ₁₅ , c ₁₄ , ... c ₁ , c ₀ +1], [b _k ... b ₀ , a ₉ , ..., a _i , c ₁₅ , c ₁₄ , ... c ₁ +1, c ₀ ], [b _k ... b ₀ , a ₉ , ..., a _i , c ₁₅ , c ₁₄ , ... c ₁ +1, c ₀ +1]. If the output of the Polar code directly to the data content is x before scrambling, the output of the Polar code after scrambling is x+Polar([0...00]), x+Polar([0...01]), x+Polar([0...10]), x+Polar([0...11]), the relative scrambling sequence of coded bits has two modes: Polar([0...01]), Polar([0...11] ). Both the information side before encoding and the relative scrambling code sequence of the encoded coded bit end have log ₂ 4=2 possibilities.

If 8 PBCH independent units are transmitted within one PBCH period, the data contents to be encoded b _k ... b ₀ , a ₉ , a ₈ , a ₇ , a ₆ , a ₅ , a ₄ , a ₃ , that is, in one cycle The same part of all PBCH independent units sent. In order to distinguish the timing of transmitting the PBCH independent unit in one cycle, the information bits before Polar encoding are scrambled with different scrambling code sequences, or the encoded codes of Polar encoding are scrambled with corresponding sequences. For example, scramble the

timings

0, 1, 2, 3, 4 with 0...000, 0...001, 0...010, 0...011, 0...100, 0...101, 0...110, 0...111 before Polar coding. , 5, 6, and 7, that is, only the last three information bits are operated, and the relative scrambling sequence pattern of the information end before encoding has three kinds of codes [0...001], [0...011], [0...111], and encoding There are also three types of relative scrambling codes for the coded bits, namely Polar([0...001]), Polar([0...011]), Polar([0...111]).

Since in the implicit transmission, it is not necessary to additionally encode the information showing the timing in the system frame number, but only the bits in the system frame number that are to be encoded are selected to be scrambled, and then used. The timing of transmitting each PBCH independent unit in one PBCH period is displayed. Therefore, the encoded data amount is less than the explicit transmission, that is, the encoding code rate is lower, and the decoding performance is slightly better than the explicit transmission.

In a PBCH period, when 16 PBCH independent units are transmitted, they can be scrambled with a similar scrambling code sequence. Thus, there are four relative scrambling code sequences.

In the above embodiment of the present invention, the partial information in the data block to be encoded is scrambled as the feature information, and the scrambling code is constructed for the feature information carried in the data block to be encoded adjacent to each other in one transmission period. When the sequence is relatively scrambled, the scrambling sequence has fewer types of scrambling sequences, and even the scrambling sequence can be only log ₂ N relative to the scrambling sequence.

As shown in FIG. 6, an embodiment of the present invention further provides a decoding method, where the method includes:

S201: Receive two pieces of data blocks to be decoded adjacent to each other before and after receiving, and the data block to be decoded carries feature information to be decoded;

S202: Participate in descrambling processing by using a relative scrambling code sequence, and perform decoding and judging processing on the obtained descrambling result, wherein the relative scrambling code sequence is used to participate in descrambling processing, and the obtained descrambling result is decoded. And the determining process specifically includes: using a relative scrambling code sequence to descramble the feature information to be decoded carried in the data block to be decoded in the subsequent segment to obtain the descrambled feature information, and the descrambled feature The information is combined with the feature information to be decoded carried in the data block to be decoded in the previous segment to perform decoding processing; and the feature information after the decoding process is determined;

S203. If the feature information participating in the judgment is an error, another descrambling code sequence is used to participate in the descrambling, and the obtained descrambling result is decoded and judged.

In an embodiment of the above decoding method, the feature information may be feature information after scrambling.

In the foregoing embodiment of the decoding method, the feature information carried in the two pieces of data blocks to be decoded may be different or the same.

In the above embodiment of the decoding method, the feature information may be time series information, and the implementation manner belongs to displaying and transmitting the time series information.

The timing information displays an order in which the plurality of encoded data blocks are transmitted. The timing information may also display an order of receiving the plurality of pieces of data blocks to be decoded.

The feature information refers to information related to the sending end of the multi-segment data block to be encoded, or refers to information related to the receiving end of the multi-segment data block to be encoded, or to be encoded with the feature information to be encoded. The data block related information refers to information related to the manner in which the multi-segment encoded data block is transmitted. Because the encoded data block is transmitted through the channel, it is the data block to be decoded in the embodiment of the decoding mode. Therefore, the feature information may also refer to information related to the transmitting end of the data block to be decoded, or information related to the receiving end of the data block to be decoded, or refers to carrying the feature. The information related to the data block to be decoded of the information or the information related to the transmission mode of the data block to be decoded.

In the embodiment of the decoding method, if the result of the determination is an error, other relative scrambling code sequences may be tried to participate in the descrambling, and the obtained descrambling result is decoded and judged until The result of the judgment is correct or all of the relative scrambling code sequences are tried. Among them, the relative scrambling code sequence of each attempt is different.

The embodiment of the decoding method further includes: outputting the feature information when the result of the determination is correct.

In an embodiment of the decoding method, the determining process includes:

In the embodiment of the decoding method, the determining process may further include:

Performing verification processing on the decoded feature information;

In the case where it is verified that the correct feature information belongs to the candidate feature information, it is determined that the correct feature information is the correct time series information.

The candidate feature information refers to feature information associated with the relative scrambling code sequence participating in the descrambling process.

For the feature information carried in any two blocks of data blocks to be decoded adjacent to each other, the relative scrambling code of the feature information scrambling sequence in the data block to be decoded after the relative scrambling code sequence can be used When the sequence information is descrambled to obtain the feature information in the data block to be decoded in the previous segment, the feature information in the data block to be decoded in the previous segment is the candidate feature associated with the scrambling code sequence of the scrambling code sequence. information. The feature information in the data block to be decoded in the subsequent segment may be referred to as feature information associated with the scrambling code sequence relative to the scrambling code sequence.

The candidate feature information may specifically be candidate timing information.

The two pieces of data blocks to be decoded that are adjacent to each other before and after the receiving include:

Receiving a data block to be decoded in a previous segment, and decoding the data block to be decoded in the previous segment;

Performing a verification process on the decoding result of the data block to be decoded in the previous segment, and the verification result displays a verification error;

Receiving a data block to be decoded that is adjacent to the data block to be decoded in the previous segment.

In the embodiment of the foregoing decoding method, the verification process may be a CRC (Cyclic Redundancy Check) check process.

In an embodiment of the decoding method, the descrambling process specifically includes: corresponding to each bit in the feature information to be decoded carried in the data block to be decoded in the subsequent segment, in a corresponding relative In the case where the value in the bit in the scrambling code sequence is 0, the value of the bit after descrambling is the same as before the descrambling; in the case where the value in the bit in the corresponding relative scrambling code sequence is 1, Invert the value before descrambling.

In an embodiment of the decoding method, the data block to be decoded may be the information after the encoded data block is transmitted through the channel in the foregoing encoding method. The feature information to be decoded may be information in the above coding method after the encoded feature information is transmitted through the channel. The coding method embodiment is implemented at the transmitting end, and the decoding method embodiment is implemented at the receiving end. Therefore, various embodiments and various concepts between them can be used for reference. The encoding method may be referred to as a data processing method. The decoding method may also be referred to as a data processing method.

For the above decoding method, an example is specifically given below, and any of the detailed features in the following examples can be independently incorporated into the embodiment of the above decoding method:

After receiving the data block to be decoded, in the case that the data block to be decoded is LLR information, decoding the received LLR signal, and performing CRC check on the decoded information bit, if After the CRC check is passed, the feature information carried in the LLR information is output, and the feature information may be time series information, for example: a ₉ , a ₈ , a ₇ , a ₆ , a ₅ , a ₄ , a ₃ , a ₂ , a ₁ , a ₀ . If there is no verification pass, it waits for the LLR information of the next transmission.

If the decoding fails for the LLR information of one transmission, it is necessary to combine the LLR information of multiple transmissions to improve the success rate of decoding. Here, the LLR information received twice is taken as an example for description.

Step 1. Using the information transmitted for a certain time (such as LLR1), the information for another transmission (LLR2),

Desmuting according to the relative scrambling code, the descrambling process specifically includes: if the bit in the relative scrambling code sequence is 0,

The corresponding bit in the LLR2 has no change before and after descrambling; if the bit in the relative scrambling code sequence is 1, the LLR2 is

The corresponding bit in the middle is inverted.

Step 2. Combine the descrambled LLR2 to get LLR=LLR1+LLR2

Step 3. Perform Polar decoding on the combined LLR;

Step 4. CRC check, if the CRC check fails, replace the above-mentioned descrambling and decoding steps by changing a relative scrambling code sequence. If the CRC check passes, it is determined whether the decoded feature information belongs to the candidate feature information of the used relative scrambling code sequence, and if it belongs to the candidate timing information of the used relative scrambling code sequence, the feature information and decoding carried in the LLR1 are output. result.

If the candidate feature information of the relative scrambling code sequence is not used, the step of descrambling, decoding, and verifying is repeated by replacing a relative scrambling code sequence.

If there are four data blocks to be decoded, there are four timing information, assuming that the four timing information is divided into: 0, 1, 2, 3, then the two adjacent blocks to be decoded are The timing information carried has the following three possibilities: {0, 1}, {1, 2}, {2, 3}. The relative scrambling sequence of {0,1} and {2,3} is 1111111, and the relative scrambling sequence of {1,2} is 01010101.

It is assumed that the time series information carried by the two adjacent data blocks to be decoded is {0, 1}, and the blind detection is first attempted by using the relative scrambling code sequence 01010101, and the LLR information is combined and decoded. When the signal-to-noise ratio is high, the decoding result will pass the CRC check with a certain probability, and the decoded timing information may be 2, that is, the wrong timing information. Therefore, it is only determined by the CRC check whether the blind check is successful or not, and there is a systematic error at a high signal to noise ratio. When attempting to descramble with the relative scrambling code sequence 0101010101, the correct timing information may only be one. If the time information obtained by the decoding is 2, and the candidate timing of the relative scrambling code sequence does not match, it can be determined that the decoding result is erroneous. At this point, it is decided that the blind detection fails, and a relative scrambling code sequence is used to perform blind detection again. The matching step of candidate timing information avoids systematic errors.

Regarding the candidate timing information, the following Table 3 can be derived from Table 1. When descrambling with the relative scrambling code sequence 11111111, the corresponding timing information that may be obtained is: 0 or 2. When descrambling with the relative scrambling code sequence 11111111, it is possible The corresponding timing information obtained can only be: 3.

table 3

The candidate timing information in Table 4 can be derived from Table 2, where the candidate timing information refers to the timing information carried in the data block to be decoded in the previous segment associated with the used relative scrambling code sequence, if the relative interference is used. If the code sequence is "001" and the timing information is one of the candidate timing information sets [0, 2, 4, 6], the decoding may be initially determined to be successful; if the obtained timing information does not belong to 001 The candidate timing information indicates that the relative scrambling sequence used during descrambling is incorrect, and the decoding failure can be determined.

The algorithm needs to try all the log ₂ N relative scrambling code sequences at most, that is, the maximum number of decoding times is log ₂ N times, which is lower than N times in the LTE PBCH, where N refers to the encoded data sent in one transmission period. The number of blocks, or the number of data blocks to be decoded received during a receive cycle. The timing matching after each decoding is relatively simple and the complexity is low.

Table 4

In the above embodiment of the decoding method, the two pieces of timing information carried by the two blocks of data to be decoded are used to display an arrangement order of the two pieces of data blocks to be decoded at the time of receiving. However, the values of the two pieces of timing information are not necessarily sequentially arranged, as long as the timing information carried by the data blocks to be decoded in each segment is different in one receiving period.

In the multi-segment data block to be decoded, a relative scrambling code sequence can be constructed between the feature information of each of the two adjacent data blocks to be decoded. The relative scrambling code sequences constructed between the feature information of two adjacent to-be-decoded data blocks may be the same or different. The value of the feature information may be constructed according to how to construct a relative scrambling code sequence between feature information of each of the two adjacent data blocks to be decoded in one receiving period. The same relative scrambling sequence is for the purpose.

As shown in Table 5, Table 5 shows another relative scrambling sequence obtained when the timing information carried in the two blocks of data to be decoded adjacent to each other is not arranged in order. . In one transmission period (for example, one PBCH period), there may be 8 data blocks to be decoded, and the timing information carried in the 8 data blocks to be decoded may not be in the order of transmission (or the order of reception). ) arranged.

The relative scrambling code sequence of the configuration shown in the table can make the candidate timing information corresponding to each relative scrambling code sequence more uniform.

table 5

Table 6

Listed in Table 6 are candidate timing information derived from Table 5.

In the embodiment of the foregoing decoding method, the determining process specifically includes:

For the feature information after the decoding process, an attempt is made to descramble each scrambling code sequence in a set of scrambling code sequences, and the CRC check is performed on the descrambled result, and in the case of passing the CRC check, the pass is determined. The feature information of the CRC check is the correct feature information; after each scrambling code sequence in the set of scrambling code sequences is tried, if the CRC check is still not passed, another relative scrambling code sequence is used. The descrambling is performed, and the obtained descrambling result is decoded and judged.

The set of scrambling code sequences refers to a scrambling code sequence corresponding to the candidate feature information associated with the used relative scrambling code sequence.

At the transmitting end, the scrambled feature information is used to indicate the sending order of the data block to be encoded carrying the feature information by scrambling the feature information. In one transmission period, the feature information in each data block to be encoded is different in the scrambling code sequence. In this way, in a transmission period, even if the feature information carried in each data block to be encoded is the same, different scrambling results can be obtained by using different scrambling code sequences for each feature information, so that different scrambling results can be obtained. Each feature information corresponds to a scrambling code sequence. These different scrambling results can be used to indicate the order in which the encoded data blocks are sent. Correspondingly, at the receiving end, the descrambling using the relative scrambling code sequence can determine the candidate feature information associated with the relative scrambling code sequence, but it is not determined whether the relative scrambling code sequence used is correct. All candidate feature information associated with the relative scrambling code sequence is taken as a range, and the scrambling code sequences corresponding to the candidate feature information are tried one by one to confirm whether the CRC check can be passed. If the CRC check is not passed, the relative scrambling code sequence used may be wrong, or the scrambling code sequence used is wrong. The CRC check may not be performed after all the scrambling code sequences corresponding to the candidate feature information are tried. Then, the relative scrambling code sequence is wrong, and it is necessary to replace the previous scrambling code sequence to try.

In the embodiment of the decoding method, before the step of using a relative scrambling code sequence to participate in the descrambling process and decoding and judging the obtained descrambling result, the method further includes:

S205. Calculate a correlation between two pieces of feature information to be decoded carried in the data block to be decoded, and obtain a relative scrambling code sequence that matches the correlation, and obtain the relative interference. The code sequence is an associated scrambling code sequence that participates in the descrambling process.

And the step of obtaining a relative scrambling code sequence that matches the correlation by calculating a correlation between two pieces of feature information to be decoded that are carried in the data block to be decoded in the two segments, specifically including: adopting the following formula:

q=min{(SUM(LLR1*LLR2)-qi)2},i=1,...,log ₂ N

Where qi is the ith relative scrambling code sequence, q is the relative scrambling code sequence that best matches LLR1 and LLR2, SUM() is the sum function, and min{} is the smallest one.

Calculating the correlation between LLR1 and LLR2 and matching the result of the correlation with the relative scrambling code sequence, and taking the best matching relative scrambling code sequence as an output, wherein the LLR1 is to be translated in the data block to be decoded in the previous segment The feature information of the code, LLR2 is the feature information to be decoded carried in the data block to be decoded in the latter segment.

As shown in FIG. 7, an embodiment of the present invention further provides a decoding method, where the method includes:

S301: Receive two pieces of data blocks to be decoded that are adjacent to each other before and after receiving, and the data block to be decoded carries feature information to be decoded.

S302. Calculate a correlation of two pieces of feature information to be decoded carried in the data block to be decoded, and obtain a relative scrambling code sequence that matches the correlation, where the relative scrambling code sequence is used. Des scrambling the feature information to be decoded carried in the data block to be decoded in the latter stage to obtain the descrambled feature information, and the descrambled feature information and the data block to be decoded in the previous segment The feature information to be decoded carried in the combination is subjected to decoding processing; and the feature information after the decoding process is judged;

S303. When the feature information of the participation determination is correct, the feature information determined to be correct is output.

The embodiment of the decoding method shown in FIG. 7 is different from the embodiment of the decoding method shown in FIG. 6 in that two parameters to be decoded are carried in the data block to be decoded by the two segments to be decoded. The correlation of the information is obtained, and the relative scrambling code sequence matching the correlation is obtained. Other specific implementations and basic concepts can refer to various concepts and embodiments of the decoding method shown in FIG. 6 above.

In an embodiment of the foregoing decoding method, the calculating, by calculating a correlation between two feature information to be decoded carried in the two data blocks to be decoded, obtaining a relative interference matching the correlation The steps of the code sequence include: adopting the following formula:

q=min{(SUM(LLR1*LLR2)-qi)2},i=1,...,log ₂ N

By calculating the correlation between the two pieces of data to be decoded in the data block to be decoded, the relative scrambling code sequence matching the correlation is obtained, if the selected relative scrambling code sequence is selected If it is correct, only need to descramble and decode once, you can get the correct feature information.

However, the relative scrambling sequence derived from the correlation has a certain probability that it is erroneous.

If 16 segments of data blocks to be decoded are received in one reception cycle (for example, one PBCH cycle), bk...b0, a9, a8 in the system frame numbers in all PBCH independent units received in one reception cycle, A7, a6, a5, and a4 are all the same. According to the relative scrambling code sequence of a3, a2, a1, and a0 indicating time series information, as shown in Table 7, there are a total of log 216 = 4 possibilities.

Table 7 (Relationship between timing information and relative scrambling sequence)

Specific descriptions of the technical effects of the various embodiments provided by the present application:

In LTE, a physical broadcast channel (English: Physical Broadcast Channel, abbreviation: PBCH) carries a master information block (English: Master Information Block, abbreviation: MIB). The length of the MIB is 24 bits, the MIB includes the downlink system bandwidth, the PHICH (English: Physical Hybrid ARQ Indicator Channel, Chinese: Physical Hybrid Automatic Repeat Request Direction Channel), and the system frame number (English: System Frequency Number) , referred to as: SFN), the high eight and so on. The base station first performs a Cyclic Redundancy Check (CRC) encoding on the MIB to be transmitted to obtain a 16-bit CRC sequence, and then the base station will have a 40-bit long sequence (including a 24-bit MIB and a 16-bit CRC). After channel coding and rate matching, a coding sequence is obtained, and the coding sequence is segmented to obtain four equal-sized PBCH independent units, and four PBCH independent units are separately scrambled by using four scrambling code sequences, and the base station completes scrambling subsequent steps. Modulation, mapping, and transmission processes.

The channel coding of the PBCH is encoded by a TBCC (Tailbiting Convolutional Code), and the four scrambling code sequences adopt different phases. The four PBCH independent units carry the same coded bits, and the four PBCH independent units perform the processes of scrambling, modulation, and mapping, and then transmit them in a time window of 40 ms (transmission time of 4 radio frames, 10 ms per radio frame).

According to the description of the sender, the four PBCH independent units carry the same coded bits. Therefore, if the channel quality is good enough, the receiver only receives a PBCH independent unit within 40 ms and successfully completes the descrambling, decoding, and CRC check. operating. Since the receiving end succeeds in scrambling the scrambling code sequence, it is obtained that the transmitting end transmits the MI B in the first few radio frames within 40 ms, that is, the lower 2 bits of the SFN are known.

For the case of poor channel quality, if the receiving end only receives one PBCH independent unit and cannot successfully descramble the decoding, it will perform soft combining with the next PBCH independent unit sent by the next 10ms and decode it until it is successfully decoded.

By detecting the PBCH, the UE can obtain the upper 8 bits of the system frame number (SFN) of the cell system, and the lowest 2 bits need to be obtained during the PBCH blind check.

The PBCH is repeated 4 times in a 40 ms period, and each transmitted PBCH carries the same coded bits, that is, each time it can be decoded by itself. During the same period, each transmitted PBCH will be scrambled with a different scrambling code sequence (ie, there are 4 different scrambling code sequences, and a long random sequence is divided into 4 segments). In the case that the channel quality is good enough, the UE may only perform decoding within one of the 40 ms, and each of the four possible scrambling sequences is used to try to descramble and decode the PBCH if decoding. Upon success, it is known that the cell transmits the MI B in the first few system frames within 40 ms, that is, the lowest 2 bits of the SFN are known.

If only one PBCH signal cannot support smooth decoding, the content of the PBCH transmitted in the next 10 ms is descrambled and soft-combined, and then decoded until the PBCH is successfully decoded. Before the soft combining process, it is also necessary to descramble the received LLRs using 4 possible scrambling code sequences, and then perform soft combining.

In summary, the periodic transmission of PBCH in LTE has the following characteristics:

1) Each transmission in one cycle can be independently decoded, or different transmissions can be combined and decoded.

2) The lower 2 bits of the SFN information are implicitly transmitted by bit scrambling different scrambling code sequences after each encoding, and the receiving side obtains the blind detection scrambling code sequence, and the number of attempts to decode and CRC check with the scrambling code sequence The number of digits increases linearly.

In the existing LTE scheme, the timing information of the PBCH is blindly checked, and descrambling and decoding and CRC check are required each time. Considering that soft combining can be done, the blind detection under multiple PBCH merges also needs to descramble the possible scrambling codes first, and then perform decoding and CRC check. The number of decodings required for blind detection is linear with the number of scrambling sequences (the number of information to be carried). When the 5G NR scene needs to carry more information, the complexity increases rapidly.

For a scenario in which one PBCH independent unit is transmitted in one PBCH period, when one data block to be decoded is received, the LTE scheme requires at most N decodings, and each decoding performs one CRC check; It only needs to be decoded once, and the CRC is checked once during transmission. When it is implicitly transmitted, the CRC is checked N times. When two data blocks to be decoded are received, the LTE scheme requires at most N decodings, and each decoding performs one CRC check; the solution of the present invention requires log ₂ N decodings, and each translation is displayed during transmission. The code requires 1 CRC check and possibly multiple timing match. In implicit transmission, multiple CRC check is required for each decoding, and the total CRC check times are the same as LTE. It can be seen that the decoding times in the embodiment of the present invention is lower than the LTE scheme, and the corresponding blind detection complexity is lower than the LTE scheme.

The above-described embodiments of the invention only take the blind detection PBCH timing as an example, and the inventive scheme can also be used for transmission and blind detection of other information. In addition, in the above embodiment, the representation of the timing information in the display transmission and the scrambling code design in the implicit transmission are exemplified by a relatively simple mode, and other modes can also achieve the effect of the solution of the present invention, and in one During the transmission period or the reception period, the types of relative scrambling sequences of the feature information carried in all the data blocks to be encoded may be only log ₂ N, and the relative scrambling sequence of the feature information carried in all the data blocks to be decoded The type can only be log ₂ N.

FIG. 9 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present disclosure, where the data processing apparatus includes:

a first encoding module, configured to perform a Polar code encoding on a plurality of data blocks to be encoded to obtain a coded data block, where each piece of the data block to be encoded in the plurality of pieces of data to be encoded carries feature information, and the feature information After the Polar code is encoded, the relationship between the feature information carried by the two adjacent data blocks to be encoded is satisfied: the feature information carried by the latter data block to be coded is descrambled by using the corresponding scrambling code sequence relative to the scrambling code sequence. And obtaining the feature information carried by the previous data block to be encoded;

The data processing apparatus shown in FIG. 9 provided by the embodiment of the present invention can be used to perform various embodiments of the data encoding method shown in FIG. 3, FIG. 4, FIG. 5 and FIG. The technical effects are similar and will not be described here. Specifically, various specific implementation manners of S006, S007, S008, S009, S100, and S101 in the data encoding method shown in FIG. 3, FIG. 4, FIG. 5, and FIG. 8 can also be used as FIG. 9 correspondingly. Various embodied implementations of the functionality of the first encoding module of the data processing apparatus are shown. Various specific implementations of S102 in the data encoding method shown in FIG. 3, FIG. 4, FIG. 5 and FIG. 8 can also be used as the function of the interface module of the data processing apparatus shown in FIG. A variety of concrete implementations.

FIG. 10 is a schematic structural diagram of another data processing apparatus according to an embodiment of the present invention. The data processing apparatus shown in FIG. 10 includes:

The data processing apparatus shown in FIG. 10 provided by the embodiment of the present invention can be used to perform various implementations of the decoding method shown in FIG. 6. The implementation principle and technical effects are similar, and details are not described herein again. Specifically, various specific implementation manners of the S201 in the decoding method shown in FIG. 6 can also be used as various embodiments of the functions of the receiving module of the data processing apparatus shown in FIG. 10 . Method to realize. Various specific implementations of S205, S202, and S203 in the decoding method shown in FIG. 6 can also be used as various functions of the first decoding module of the data processing apparatus shown in FIG. Concrete implementation.

FIG. 11 is a schematic structural diagram of still another data processing apparatus according to an embodiment of the present invention. The data processing apparatus shown in FIG. 11 includes:

a second decoding module, configured to calculate, by calculating a correlation between two pieces of feature information to be decoded carried in the two blocks of data to be decoded, to obtain a relative scrambling code of the scrambling code sequence matching the correlation a sequence, wherein the scrambling code sequence is used to descramble the feature information to be decoded carried in the data block to be decoded, and the descrambled feature information is obtained, and the descrambled feature is obtained. The information is combined with the feature information to be decoded carried in the data block to be decoded in the previous segment to perform decoding processing; and the feature information after the decoding process is determined;

The data processing apparatus shown in FIG. 11 provided by the embodiment of the present invention may be used to perform various implementations of the decoding method shown in FIG. 7. The implementation principle and technical effects are similar, and details are not described herein again. Specifically, various specific implementation manners of S301 and S303 in the decoding method shown in FIG. 7 can also be used as various specific functions of the receiving module of the data processing apparatus shown in FIG. The way to achieve. Various specific implementations of S302 in the decoding method shown in FIG. 7 can also be used as various embodied implementations of the functions of the second decoding module of the data processing apparatus shown in FIG.

12 is a schematic structural diagram of a communication apparatus according to an embodiment of the present invention. The communication apparatus includes: a processor, and a memory interconnected with the processor. When the communication apparatus is in operation, the processor reads and Execution of the instructions in the memory or execution of its own hardware logic circuitry to cause the communication device to perform various embodiments of any one of the data processing methods illustrated in Figures 3-8.

In an embodiment of the communication device, the memory is for storing the instructions, and the memory may be independent of the processor or integrated into the processor.

The communication device may further include a transceiver (not shown) for receiving and/or transmitting data. The communication device of the embodiment of the present application may be any device having a wireless communication function, such as an access point, a site, a user equipment, a base station, and the like.

In addition, the communication device may also have a dual function of encoding and decoding, performing an encoding operation when acting as an encoding end, and performing a decoding operation when acting as a decoding terminal. The communication device includes a baseband chip, the baseband chip includes an encoder and a decoder, and the encoder can be used to implement the same function as the aforementioned encoding end, and the decoder can implement the same function as the aforementioned decoding end.

In various embodiments described above, the processor may be an integrated circuit that operates in accordance with a non-curing instruction or an integrated circuit that operates in accordance with a curing instruction. The processor operating in accordance with the non-curing instructions implements various ones of the methods of any of the methods illustrated in Figures 3 through 8 by reading and executing instructions in the memory, or Various embodiments of any of the data processing devices shown in Figures 9 through 11 are shown. The processor operating in accordance with the curing instructions implements various ones of the methods of any of the methods illustrated in Figures 3-8 by running its own hardware logic circuitry, or alternatively, as shown in Figures 9-11 Various embodiments of any of the data processing devices shown in the data processing device. Processors that operate according to the firmware instructions often also need to read some data from the memory or output the results to the memory during the operation of their own hardware logic. The memory is a random access memory (ROM), a flash memory, a read only memory (RAM), a programmable read only memory, an electrically erasable programmable memory, a cache (CACHE) or a register. A storage medium that is convenient for the processor to read.

In various embodiments described above, the processor may be a central processing unit (CPU), a graphics processing unit (GPU), or a digital signal processor (DSP). ), Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), Network Processor (NP), other programmable logic devices, discrete gate transistors Logic devices, or discrete hardware components, and so on.

The various embodiments described above may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, it may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions described in accordance with embodiments of the present invention are generated in whole or in part. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be from a website site, computer, server or data center Transfer to another website site, computer, server, or data center by wire (eg, coaxial cable, fiber optic, digital subscriber line (DSL), or wireless (eg, infrared, wireless, microwave, etc.). The computer readable storage medium can be any available media that can be accessed by a computer or a data storage device such as a server, data center, or the like that includes one or more available media. The usable medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (such as a solid state disk (SSD)).

In addition, the term "and/or" herein is merely an association relationship describing an associated object, indicating that there may be three relationships, for example, A and/or B, which may indicate that A exists separately, and A and B exist at the same time. There are three cases of B alone. In addition, the character "/" in this article generally indicates that the contextual object is an "or" relationship.

The term "plurality" as used herein refers to two or more.

Claims

A data encoding method, the method comprising:

Transmitting a plurality of data blocks to be encoded into a coded data block, wherein each of the plurality of data blocks to be encoded carries feature information in each of the to-be-coded data blocks, and the feature information is encoded by Polar code. The relationship between the feature information carried by the two adjacent data blocks to be encoded is satisfied: the feature information carried by the data block to be coded is descrambled by the corresponding relative scrambling code sequence, and is carried by the previous data block to be coded. Characteristic information;

The multi-segment encoded data blocks are output in the order in which they are adjacent to each other.
The method of claim 1 wherein said feature information is feature information after scrambling.
The method according to claim 1, wherein the feature information carried in the plurality of pieces of data blocks to be encoded is different.
The method of claim 1 wherein said characteristic information is time series information, said time series information showing an order in which said plurality of encoded data blocks are transmitted.
The method according to claim 4, wherein, in the case that the feature information is time series information, the outputting the multi-segment encoded data blocks in the order of the adjacent ones before and after, includes:

The multi-segment encoded data blocks are output in the order in which the timing information is displayed.
The method as claimed in claim 1, wherein the plurality of data blocks to be encoded belong to a data block to be encoded within one transmission period, and the data blocks to be encoded are encoded by Polar code encoding and encoding. The steps of the data block before or after the steps include:

The feature information carried in the multi-segment data block to be encoded is scrambled by using different scrambling code sequences, wherein the feature information carried in the multi-segment data block to be encoded in one transmission period is the same.
A decoding method, characterized in that the method comprises:

Receiving two adjacent data blocks to be decoded before and after, the data block to be decoded carries the feature information to be decoded; using a relative scrambling code sequence to participate in descrambling processing, and performing the descrambling result Decoding and judging processing, the step of using a relative scrambling code sequence to participate in descrambling processing, and decoding and judging the obtained descrambling result comprises: using a relative scrambling code sequence to block a data block to be decoded The feature information to be decoded carried in the descrambling is descrambled to obtain the descrambled feature information, and the descrambled feature information and the to-be-decoded feature carried in the data block to be decoded in the previous segment After the information is combined, the decoding process is performed; and the decoded feature information is judged;

When the feature information participating in the judgment is an error, another relative scrambling code sequence is used to participate in the descrambling, and the obtained descrambling result is decoded and judged.
The method of claim 7, wherein the feature information is feature information after scrambling.
The method as claimed in claim 7, wherein the feature information carried in the two blocks of data to be decoded is different.
The method according to claim 7, wherein in the case that the result of the determination is an error, other relative scrambling code sequences are attempted to participate in the descrambling, and the obtained descrambling result is decoded and judged. Until the judgment result is correct or all relative scrambling code sequences are tried, wherein the relative scrambling code sequence of each attempt is different.
The method of claim 7 wherein said determining comprises:

Performing a verification process on the decoded feature information and determining whether the feature information after the decoding process belongs to candidate feature information;

After determining that the decoded feature information is correctly verified and belongs to the candidate feature information, it is determined that the decoded feature information is correct feature information.
The method according to claim 7, wherein said candidate feature information refers to feature information associated with said relative scrambling code sequence participating in said descrambling process.
A decoding method, characterized in that the method comprises:

Receiving two data blocks to be decoded adjacent to each other before and after, the data block to be decoded carries the feature information to be decoded; and calculating two to-be-translated carried in the two data blocks to be decoded Correlating the feature information of the code, and obtaining a relative scrambling code sequence that matches the correlation, and using the relative scrambling code sequence to descramble the feature information to be decoded carried in the data block to be decoded in the subsequent segment Obtaining the descrambled feature information, combining the descrambled feature information with the feature information to be decoded carried in the data block to be decoded in the previous segment, and performing decoding processing; Determining the characteristic information after decoding;

When the feature information participating in the judgment is correct, the feature information judged to be correct is output.
A data processing apparatus, characterized in that the data processing apparatus comprises:

a first encoding module, configured to perform a Polar code encoding on a plurality of data blocks to be encoded to obtain a coded data block, where each piece of the data block to be encoded in the plurality of pieces of data to be encoded carries feature information, and the feature information After the Polar code is encoded, the relationship between the feature information carried by the two adjacent data blocks to be encoded is satisfied: the feature information carried by the latter data block to be coded is descrambled by using the corresponding relative scrambling code sequence. Characteristic information carried by a data block to be encoded;

The interface module is configured to output the multi-segment encoded data blocks in the order of the adjacent ones.
A data processing apparatus, characterized in that the data processing apparatus comprises:

a receiving module, configured to receive two pieces of data blocks to be decoded that are adjacent to each other before and after, and the data block to be decoded carries feature information to be decoded;

a first decoding module, configured to participate in descrambling processing by using a relative scrambling code sequence, and perform decoding and judging processing on the obtained descrambling result, wherein the relative scrambling code sequence is used to participate in descrambling processing, and the obtained Decoding the decoding result and determining the processing specifically includes: using a relative scrambling code sequence to descramble the feature information to be decoded carried in the data block to be decoded in the subsequent segment, and obtaining the descrambled feature information, Decoding the feature information and combining the feature information to be decoded carried in the data block to be decoded in the previous segment to perform decoding processing; and determining the decoded feature information; When the feature information participating in the judgment is an error, another relative scrambling code sequence is used to participate in the descrambling, and the obtained descrambling result is decoded and judged.
A data processing apparatus, characterized in that the data processing apparatus comprises:

a receiving module, configured to receive two pieces of data blocks to be decoded that are adjacent to each other before and after, and the data block to be decoded carries feature information to be decoded;

a second decoding module, configured to calculate a correlation between the two pieces of information to be decoded carried in the data block to be decoded, and obtain a relative scrambling code sequence that matches the correlation, The relative scrambling code sequence descrambles the feature information to be decoded carried in the data block to be decoded in the subsequent segment to obtain the descrambled feature information, and the descrambled feature information and the previous segment Decoding the feature information to be decoded carried in the data block to be decoded and performing decoding processing; and determining the feature information after the decoding process;

The receiving module is further configured to output the feature information determined to be correct if the feature information participating in the determination is correct.
A data processing apparatus, comprising: a processor, the processor for performing the data encoding method according to any one of claims 1 to 6 or the method of any one of claims 7-13 The decoding method described.
The apparatus according to claim 17, wherein said apparatus further comprises a memory for storing said data encoding method according to any one of claims 1-6 by said processor or claim 7 The program used in the decoding method according to any one of the preceding claims.
A computer readable storage medium having computer executed instructions stored therein, the transmitting device performing the encoding of any one of claims 1-6 when at least one processor of the transmitting device executes the computer to execute an instruction method.
A computer readable storage medium having computer executed instructions stored therein, when the at least one processor of the receiving device executes the computer to execute an instruction, the receiving device performs the decoding method according to any one of 7-13 .