CN108574562A - Data transmission method and device - Google Patents
Data transmission method and device Download PDFInfo
- Publication number
- CN108574562A CN108574562A CN201710151022.1A CN201710151022A CN108574562A CN 108574562 A CN108574562 A CN 108574562A CN 201710151022 A CN201710151022 A CN 201710151022A CN 108574562 A CN108574562 A CN 108574562A
- Authority
- CN
- China
- Prior art keywords
- sequence
- integer
- pending
- encoded
- obtains
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0067—Rate matching
- H04L1/0068—Rate matching by puncturing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0071—Use of interleaving
Abstract
A kind of data transmission method of the application offer and device, this method include:Transmitting terminal treats coded sequence and carries out Polarization Coding and rate-matched, First ray after being encoded, and replicate M First ray, so that M sequential is corresponded with M First ray, from small to large according to M sequential, the first sequential corresponding to each sequential carries out progressive intertexture successively, obtain corresponding second sequence of M sequential, after the second sequence modulation and mapping, M are broadcasted according to M sequential treated the second sequence, receiving terminal treats decoding sequence deinterleaving, and the sequence solution rate-matched after deinterleaving is decoded with polarization, obtains decoding result.Wherein, by the way of Polarization Coding, performance is more preferable, complexity is relatively low, rate-matched mode is flexible, and more simpler than Scrambling Operation according to the progressive intertexture of sequential relationship progress, receiving terminal be also easier to according to the sequential of reception complete deinterleave, greatly improve coding, decoding efficiency.
Description
Technical field
This application involves wireless communication technique more particularly to a kind of data transmission methods and device.
Background technology
In long term evolution (Long Term Evolution, LTE) system, transmitting terminal is in physical layer broadcast channel
Broadcast message part 24 bits (bits) in total that (Physical Broadcasting Chanel, PBCH) is sent, is added to
The cyclic redundancy check (Cyclical Redundancy Check, CRC) of 16bits verifies, coding and rate-matched presequence
Length is 40.Receiving terminal is detected PBCH, can obtain Cell System Frame Number (System Frame Number, SFN)
Most-significant byte, in addition, minimum 2 of SFN need terminal blind examination on PBCH to obtain.
Specifically, in LTE, broadcast message is repeated 4 times within the 40ms periods, and transmitting terminal is sent once per 10ms in 40ms
Broadcast message all carries the sequence after identical coding, then minimum 2 letters of SFN are implicitly carried by scrambling different sequences
Breath.The broadcast message that receiving terminal sends transmitting terminal each time can independent interpretation, you can to attempt all possible disturb
Code sequence is descrambled, then into row decoding.If successfully decoded, receiving terminal is it is known that transmitting terminal is sent out in first systematic frame
Host system message block (master information block, MIB) is sent, also it is known that minimum 2 of SFN.If translated
Code all fails, the broadcast message progress soft merging just sent in next 10ms with transmitting terminal, then into row decoding, and so on,
Until successfully decoded.
But attempt all possible scrambler sequence and descrambled, then into row decoding, will produce larger time delay.
Invention content
A kind of data transmission method of the application offer and device are passed for improving the efficiency of encoding and decoding and then improving data
Defeated efficiency.
The application first aspect provides a kind of data transmission method, including:
Transmitting terminal treats coded sequence and carries out Polarization Coding and rate-matched, the First ray after being encoded;
The transmitting terminal obtains the M First rays, and M sequential is corresponded with the M First rays;
From small to large according to the M sequential, the First ray corresponding to each sequential carries out the transmitting terminal successively
Progressive intertexture obtains corresponding second sequence of M sequential, wherein M is the integer more than 0;
The transmitting terminal is modulated to second sequence and mapping processing, is broadcasted according to the M sequential M described
Second sequence that treated.
Optionally, the transmitting terminal according to the M sequential from small to large, first sequence corresponding to each sequential successively
Row carry out progressive intertexture, obtain corresponding second sequence of M sequential, including:
I-th of sequential corresponding First ray cyclic shift Ti*k it is corresponding to be obtained i-th of sequential by the transmitting terminal
Second sequence, wherein 0<I≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is
Integer more than 0.
Optionally, the transmitting terminal according to the M sequential from small to large, first sequence corresponding to each sequential successively
Row carry out progressive intertexture, obtain corresponding second sequence of M sequential, including:
I-th of sequential corresponding First ray cyclic shift Ti*k it is corresponding to be obtained i-th of sequential by the transmitting terminal
Second sequence, wherein 0<I≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is
Integer more than 0.
Optionally, the transmitting terminal obtains cyclic shift Ti*k in the corresponding First ray of i-th of sequential i-th
Before corresponding second sequence of sequential, further include:
The First ray is divided into M cross-talk sequences by the transmitting terminal, and every section of subsequence includes k;
I-th of sequential corresponding First ray cyclic shift Ti*k it is corresponding to be obtained i-th of sequential by the transmitting terminal
Second sequence, including:
The transmitting terminal is by the corresponding First ray cyclic shift Ti cross-talk sequences of i-th of sequential, ordered pair when obtaining i-th
The second sequence answered.
Optionally, the transmitting terminal treats coded sequence and carries out Polarization Coding and rate-matched, and first after being encoded
Before sequence, further include:
Master Information Block to be sent is added CRC bits by the transmitting terminal by cyclic redundancy check check (CRC), obtains information
Bit sequence;
The transmitting terminal obtains initial sequence to be encoded, and freezing for the initial sequence to be encoded is configured using predetermined sequence
Bit, punching bit position and shorten bit, and by described information bit sequence configuration to the initial sequence to be encoded
Information bit position, obtain the sequence to be encoded.
Optionally, the transmitting terminal treats coded sequence and carries out Polarization Coding and rate-matched, and first after being encoded
Before sequence, further include:
Master Information Block to be sent is added CRC bits by the transmitting terminal by cyclic redundancy check check (CRC), obtains information
Bit sequence;
The transmitting terminal treats coded sequence and carries out Polarization Coding and rate-matched, the First ray after being encoded, packet
It includes:
The transmitting terminal obtains M sequences to be encoded according to described information bit sequence, and to the M sequences to be encoded
Carry out Polarization Coding and rate-matched, the First ray after being encoded.
Optionally, the transmitting terminal obtains M sequences to be encoded according to described information bit sequence, including:
The transmitting terminal obtains the i-th initial sequence to be encoded, initial to be encoded using the i-th predetermined sequence configuration described i-th
Sequence freezes bit, punching bit position and shortening bit, obtains the i-th sequence to be encoded;
The transmitting terminal, which determines in the described i-th sequence to be encoded, whether there is position to be copied;
The transmitting terminal is to be encoded by the 1st at position to be copied there are at least one in determining the described i-th sequence to be encoded
It copies in the position to be copied in the described i-th sequence to be encoded, obtains more with the information of the corresponding position to be copied in sequence
The i-th new sequence to be encoded, wherein the 1st sequence to be encoded include described information bit sequence, 1<I≤M and i are integer;
Transmitting terminal sequences progress Polarization Codings to be encoded a to the M and rate-matched, first after being encoded
Sequence, including:
The transmitting terminal is using the 1st sequence to be encoded of R1 pairs of code check to the newer m-th Sequence composition to be encoded
Sequence to be encoded carries out Polarization Coding and rate-matched, the First ray after being encoded;Alternatively,
The transmitting terminal respectively to the 1st sequence to be encoded to newer M sequences to be encoded carry out Polarization Coding and
Rate-matched obtains the 1st coded sequence to m-th coded sequence, and using the 1st coded sequence to the m-th
Coded sequence constitutes the First ray after the coding;Alternatively,
The transmitting terminal carries out polarization volume using Ri pairs of the 1st coded sequence of code check to newer i-th sequence to be encoded
Code and rate-matched obtain i-th of coded sequence, and constitute the coding using the 1st coded sequence to m-th coded sequence
First ray afterwards, wherein code check Ri is the 1/N that the 1st sequence to be encoded of the transmitting terminal pair carries out code check when Polarization Coding,
Middle N is the integer more than 1, N 2ceil(log2(i))。
The application second, which facilitates, provides a kind of data transmission method, including:
Receiving terminal continuously receives P symbol sebolic addressing of transmitting terminal transmission, and demodulation and demapping is carried out to P symbol sebolic addressing
Afterwards, P sequences to be decoded are obtained, wherein 0<P≤M and P are integer, and M indicates that transmitting terminal broadcasts the M symbol sebolic addressings;
The receiving terminal deinterleaves the P sequences to be decoded, obtains the sequence after deinterleaving;
The receiving terminal decodes the sequence solution rate-matched after the deinterleaving with polarization, obtains decoding result.
Optionally, the receiving terminal deinterleaves the P sequences to be decoded, obtains the sequence after deinterleaving, including:
The sequence recycled back to be decoded received is shifted Ti*k by the receiving terminal, and it is pending to obtain M a first
Sequence, wherein 1≤i≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is big
In 0 integer;
The receiving terminal obtains M metric using M first pending sequences of preset configuration pre-decode;
The receiving terminal determines cyclic shift digit Tt*k according to the metric, and the sequence to be decoded is reversed
Cyclic shift Tt*k, obtains the sequence after the deinterleaving.
Optionally, the sequence recycled back to be decoded received is shifted Ti*k by the receiving terminal, is obtained first and is waited for
Processing sequence, including:
The sequence to be decoded received is divided into M cross-talk sequences by the receiving terminal, wherein every cross-talk sequence includes k
Position;
The sequence recycled back to be decoded received is shifted Ti cross-talk sequences by the receiving terminal, is obtained M first and is waited for
Processing sequence.
Optionally, when P=1, the receiving terminal deinterleaves the P sequences to be decoded, obtains the sequence after deinterleaving,
Including:
The sequence recycled back to be decoded received is shifted Ti*k by the receiving terminal, and it is pending to obtain M a first
Sequence, wherein 1≤i≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is big
In 0 integer;
Each first pending sequence is divided into M cross-talk sequences by the receiving terminal, wherein includes per cross-talk sequence
K;
The receiving terminal using preset configuration the default subsequence set each first pending sequence of pre-decode successively
The subsequence set for arranging front end, obtains W*M metric, wherein the default subsequence set includes W group, q+1 groups
Including 2qDuan Lianxu subsequences, it includes 2 that the subsequence set of the first pending sequence front end, which includes W group, q+1 groups,q
Duan Lianxu subsequences, 1≤2W-1≤ M and W are integer, q<W and q are the integer more than or equal to 0;
The receiving terminal determines cyclic shift digit Tt*k according to the metric, and the sequence to be decoded is reversed
Cyclic shift Tt*k, obtains the sequence after the deinterleaving.
Optionally, when P is more than 1, the receiving terminal deinterleaves the P sequences to be decoded, obtains the sequence after deinterleaving
Row, including:
The receiving terminal is by the sequence recycled back to be decoded that pth+1 receives in the P received sequences to be decoded
Tp*k is shifted, P the first pending sequences are obtained, wherein 1≤p≤P-1 and p is integer, k is the integer more than 0, and Tp is poor
Value is the arithmetic sequence of Δ, and Δ is greater than 0 integer;
The receiving terminal obtains all P first pending sequence soft mergings second pending after soft merging
Sequence;
Described second pending sequence recycled back is shifted Ti*k by the receiving terminal, is obtained M-P+1 third and is waited locating
Manage sequence, wherein 1≤i≤M-P+1, and p is integer;
The receiving terminal obtains M-P+1 metric using the pending sequence of third described in preset configuration pre-decode;
The receiving terminal determines cyclic shift digit Tt*k according to the metric, and the sequence to be decoded is reversely followed
Ring shifts Tt*k, obtains the sequence after the deinterleaving.
Optionally, the receiving terminal is anti-by the sequence to be decoded that pth+1 receives in the P received sequences to be decoded
To cyclic shift Tp*k, P the first pending sequences are obtained, including:
+ 1 sequence to be decoded received of pth is divided into M cross-talk sequences by the receiving terminal, wherein per cross-talk sequence
Row include k;
The sequence recycled back to be decoded is shifted Tp cross-talk sequences by the receiving terminal, obtains P the first pending sequences
Row.
Optionally, when P is more than 1, the receiving terminal deinterleaves the P sequences to be decoded, obtains the sequence after deinterleaving
Row, including:
The receiving terminal is by the sequence recycled back to be decoded that pth+1 receives in the P received sequences to be decoded
Tp*k is shifted, P the first pending sequences are obtained, wherein 1≤p≤P-1 and p is integer, k is the integer more than 0, and Tp is poor
Value is the arithmetic sequence of Δ, and Δ is the integer more than 0;
The receiving terminal obtains all P first pending sequence soft mergings second pending after soft merging
Sequence;
Described second pending sequence recycled back is shifted Ti*k by the receiving terminal, is obtained M-P+1 third and is waited locating
Manage sequence, wherein 1≤i≤M-P+1, and i is integer;
Each pending sequence of third is divided into M cross-talk sequences by the receiving terminal, wherein includes per cross-talk sequence
K;
The pending sequence of third described in pre-decode is most successively using the default subsequence set of preset configuration for the receiving terminal
The subsequence set of front end obtains W* (M-P+1) a metric, wherein the default subsequence set includes W group, q+1
Group includes 2qThe subsequence set of Duan Lianxu subsequences, the pending sequence front end of third includes W group, q+1 groups packet
Include 2qDuan Lianxu subsequences, 1≤2W-1≤ M and W are integer, q<W and q are the integer more than or equal to 0;
The receiving terminal determines cyclic shift digit Tt*k according to the metric, and the sequence to be decoded is reversed
Cyclic shift Tt*k, obtains the sequence after the deinterleaving.
Optionally, when P=1, the receiving terminal deinterleaves the P sequences to be decoded, obtains the sequence after deinterleaving,
Including:
The sequence recycled back to be decoded received is shifted Ti*k by the receiving terminal, and it is pending to obtain M a first
Sequence, wherein 1≤i≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is big
In 0 integer;
Using the described first pending sequence as the sequence after the deinterleaving;
The receiving terminal decodes the sequence solution rate-matched after the deinterleaving with polarization, obtains decoding result, including:
The receiving terminal obtains M metric and M using M first pending sequences of preset configuration pre-decode
The corresponding pre-decode result of a metric;
The receiving terminal carries out cyclic redundancy check (CRC) verification to the pre-decode result, will be described if verifying successfully
Pre-decode added as the decoding result.
Optionally, when P is more than 1, the receiving terminal deinterleaves the P sequences to be decoded, obtains the sequence after deinterleaving
Row, including:
The receiving terminal is by the sequence recycled back to be decoded that pth+1 receives in the P received sequences to be decoded
Tp*k is shifted, P the first pending sequences are obtained, wherein 1≤p≤P-1 and p is integer, k is the integer more than 0, and Tp is poor
Value is the arithmetic sequence of Δ;
The receiving terminal obtains all P first pending sequence soft mergings second pending after soft merging
Sequence;
Described second pending sequence recycled back is shifted Ti*k by the receiving terminal, is obtained M-P+1 third and is waited locating
Manage sequence, wherein 1≤i≤M-P+1, and p is integer;
Using the pending sequence of the third as the sequence after the deinterleaving;
The receiving terminal decodes the sequence solution rate-matched after the deinterleaving with polarization, obtains decoding result, including:
The receiving terminal using the pending sequence of third described in preset configuration pre-decode, obtain M-P+1 metric and
The corresponding pre-decode result of M-P+1 metric;
Cyclic redundancy check (CRC) verification is carried out to the pre-decode result to add the pre-decode if verifying successfully
As the decoding result.
The application third aspect provides a kind of data transmission device, described device include for execute above-mentioned first aspect with
And the module or means (means) of method that the various realization methods of first aspect are provided.
The application fourth aspect provides a kind of data transmission device, described device include for execute above-mentioned second aspect with
And the module or means (means) of method that the various realization methods of first aspect are provided.
The 5th aspect of the application provides a kind of data transmission device, and described device includes processor and memory, memory
For storing program, processor calls the program of memory storage, the method to execute the offer of the application first aspect.
The 6th aspect of the application provides a kind of data transmission device, and described device includes processor and memory, memory
For storing program, processor calls the program of memory storage, the method to execute the offer of the application second aspect.
The 7th aspect of the application provides a kind of data transmission device, includes for executing the method for the above first aspect extremely
A few processing element (or chip).
The application eighth aspect provides a kind of data transmission device, includes for executing the method for the above second aspect extremely
A few processing element (or chip).
The 9th aspect of the application provides a kind of program, and the program is when being executed by processor for executing the above first aspect
Method.
The tenth aspect of the application provides a kind of program, and the program is when being executed by processor for executing the above second aspect
Method.
The tenth one side of the application provides a kind of program product, such as computer readable storage medium, including the 9th aspect
Program.
The 12nd aspect of the application provides a kind of program product, such as computer readable storage medium, including the tenth aspect
Program.
In data transmission method and device provided by the present application, transmitting terminal treats coded sequence and carries out Polarization Coding and rate
Matching, the First ray after being encoded, and replicate M First ray so that M sequential is corresponded with M First ray,
From small to large according to M sequential, the first sequential corresponding to each sequential carries out progressive intertexture successively, obtains M sequential difference
Corresponding second sequence broadcasts M treated the second sequence, reception after the second sequence modulation and mapping according to M sequential
After the second sequence that end receives that treated, deinterleaved as sequence to be decoded, and by after deinterleaving sequence solution rate-matched and
Polarization decoding, obtains decoding result.Wherein, by the way of Polarization Coding, performance is more preferable, complexity is relatively low, rate-matched side
Formula is flexible, and more simpler than Scrambling Operation according to the progressive intertexture of sequential relationship progress, and receiving terminal is also easier to basis and connects
The sequential of receipts is completed to deinterleave, greatly improve coding, decoding efficiency.
Description of the drawings
Fig. 1 is a kind of basic procedure of wireless communication;
Fig. 2 is a kind of wireless communication system architecture schematic diagram;
Fig. 3 is the data transmission method flow diagram that one embodiment of the application provides;
Fig. 4 is the data transmission method flow diagram that another embodiment of the application provides;
Fig. 5 is the data transmission method flow diagram that another embodiment of the application provides;
Fig. 6 is the data transmission method flow diagram that another embodiment of the application provides;
Fig. 7 is the data transmission method flow diagram that another embodiment of the application provides;
Fig. 8 is the data transmission device structural schematic diagram that one embodiment of the application provides;
Fig. 9 is the data transmission device structural schematic diagram that another embodiment of the application provides;
Figure 10 is the data transmission device structural schematic diagram that another embodiment of the application provides;
Figure 11 is the data transmission device structural schematic diagram that another embodiment of the application provides.
Specific implementation mode
Hereinafter, the part term in the application is explained, in order to those skilled in the art understand that:
Base station is a kind of device for being deployed in and providing wireless communication function in wireless access network for MS.The base station can wrap
Include various forms of macro base stations, micro-base station (also referred to as small station), relay station, access point etc..Using different wireless access skills
In the system of art, the title for having the equipment of base station functions may be different, for example, in LTE system, referred to as evolution
Node B (evolved NodeB, eNB or eNodeB), in the third generation (3rd Generation, 3G) system, referred to as node
B (Node B) etc..For convenience of description, in the application, the above-mentioned device that wireless communication function is provided for MS is referred to as base station or BS.
MS may include various handheld devices with wireless communication function, mobile unit, wearable device, computing device
Or it is connected to other processing equipments of radio modem.The MS is referred to as terminal (terminal), can also wrap
Include subscriber unit (subscriber unit), cellular phone (cellular phone), smart mobile phone (smart phone), nothing
Line data card, personal digital assistant (Personal Digital Assistant, PDA) computer, plate computer, wireless-modulated
Demodulator (modem), handheld device (handset), laptop computer (laptop computer), machine type communication
(Machine Type Communication, MTC) terminal etc..It is mentioned above in all embodiments of the application for convenience of description
Equipment be referred to as MS.
In the application, " multiple " refer to two or more."and/or" describes the incidence relation of affiliated partner, indicates
There may be three kinds of relationships, for example, A and/or B, can indicate:Individualism A, exists simultaneously A and B, individualism B these three
Situation.It is a kind of relationship of "or" that character "/", which typicallys represent forward-backward correlation object,.
Fig. 1 is a kind of basic procedure of wireless communication, and in transmitting terminal, information source passes through message sink coding, channel coding, speed successively
Rate is matched and is sent out after modulating mapping.In receiving terminal, demodulation demapping, solution rate-matched, channel decoding and information source are passed sequentially through
The decoding output stay of two nights.Polar codes may be used in channel decoding, since the integer that the code length of original Polar codes (female code) is 2 is secondary
Power needs through-rate matching to realize the Polar codes of arbitrary code length in practical applications.Transmitting terminal is in the laggard scanning frequency of channel coding
Arbitrary target code length is realized in rate matching, and solution rate-matched is first carried out before receiving terminal, channel decoding.It should be noted that
The basic procedure of wireless communication further include additional flow (such as:Precoding and intertexture), in view of these additional flows for ability
It is common knowledge for field technique personnel, will not enumerate.
Fig. 2 is a kind of wireless communication system architecture schematic diagram.The embodiment of the present application can be applied to wireless communication system, such as
Shown in Fig. 2, wireless communication system is usually made of cell, and each cell includes a base station (English:Base Station, letter
Claim:BS), base station is (English to multiple mobile stations:Mobile Station, referred to as:MS communication service) is provided, wherein base station connects
To equipment of the core network.
Wherein base station includes Base Band Unit (Baseband Unit, BBU) and remote radio unit (RRU) (Remote Radio
Unit, RRU).BBU and RRU can be placed on different places, such as:RRU is zoomed out, and is positioned over the region of high traffic, BBU
It is positioned over central machine room.BBU and RRU can also be placed on same computer room.BBU and RRU may be the difference under a rack
Component.
It should be noted that the wireless communication system that the embodiment of the present application refers to includes but not limited to:Narrowband Internet of Things system
Unite (Narrow Band-Internet of Things, NB-IoT), global system for mobile communications (Global System for
Mobile Communications, GSM), enhanced data rates for gsm evolution system (Enhanced Data rate for
GSM Evolution, EDGE), broadband CDMA system (Wideband Code Division Multiple Access,
WCDMA), CDMA 2000 system (Code Division Multiple Access, CDMA2000), time division synchronous code division
Multi-address system (Time Division-Synchronization Code Division Multiple Access, TD-
SCDMA), the three of long evolving system (Long Term Evolution, LTE) and next generation's 5G mobile communication system answer greatly
With scene eMBB, URLLC and eMTC.
Fig. 3 is the data transmission method flow diagram that one embodiment of the application provides.As shown in figure 3, this method includes:
S301, transmitting terminal treat coded sequence polarized (polar) coding and rate-matched, first after being encoded
Sequence.
A kind of linear fast code when Polar codes, performance is more preferable, complexity is relatively low, rate-matched mode is flexible.Specific coding mistake
Cheng Zhong, generator matrix GN, wherein GNIt is the matrix of a N × N, andHereBNIt is
The transposed matrix of one N × N.Cataloged procedure isWhereinIt is a binary row arrow
Amount, length are N (i.e. code length).
In a part of bit be used for carry information, referred to as information bit.The set of the index of these information bits is remembered
Make A.In other a part of bit be fixed value that transmitting terminal and receiving terminal are made an appointment, referred to as fixed bit, rope
The collection drawn shares the supplementary set A of AcIt indicates.There are many selections of information bit set A, one of which be using Density evolution or
The methods of Gaussian approximation obtains to obtain the corresponding polarisation channel error probability of bit of serial number iSelectionValue is minimum
K serial number, constitute set A, information bit set that this mode obtains needs according to code length code check and channel condition into
Row calculates.Another be determine that information bit set A is unrelated with actual channel by fixed formula or rule, such as
Channel is regarded as binary erasure channel (Binary Erasure Channel, BEC) channel to determine A or is weighed by polarizing
Weight, code determine A again.
In First ray the data (data) sent are needed comprising transmitting terminal.
S302, transmitting terminal obtain M First ray, and M sequential is corresponded with M First ray.
In the present embodiment, First ray can be M times with repeat replication, corresponding respectively with M sequential, the number at this to repeating
It is not limited, M is the integer more than 0.
From small to large according to M sequential, the first sequential corresponding to each sequential carries out progressive friendship successively for S303, transmitting terminal
It knits, obtains corresponding second sequence of M sequential.
And then progressive intertexture is carried out to M First ray successively.Here interweaving can refer to the bit of preset length
Cyclic shift is carried out, such as:It is moved to tail portion from sequence header, either from tail of sequence is moved to head or from sequence
First designated position is moved to the second designated position, and this is not restricted.
Progressive intertexture refers to the increase with M, and the number of intertexture increases in equal difference, that is, to loopy moving when interweaving
Interweave in bit cumulative rises, such as the corresponding First ray of the first sequential primary, in the corresponding First ray of the second sequential
Interweave twice, interweaves three times in the corresponding First ray of third sequential, and so on.
After intertexture, M obtained the second sequences are all different.
Wherein, the corresponding First ray of each sequential obtains the second sequence in the way of progressive intertexture, can
With predetermined bit position in the corresponding System Frame Number of implicit indication sequential, predetermined bit position can be multiple bits, such as indicate
Latter 2 of System Frame Number.
S304, the second sequence of transmitting terminal pair are modulated and mapping processing, and broadcasting M according to M sequential, a treated the
Two sequences.
I.e. transmitting terminal first to M interweave after the second sequence be modulated respectively and map operation after broadcast again.
Optionally, transmitting terminal broadcasts the second sequence after M intertexture by PBCH.
The second sequence that receiving terminal will receive that treated, using treated the second sequence as the sequence to be decoded of receiving terminal
Row, are handled by receiving terminal.
S305, receiving terminal receive the P symbol sebolic addressing that transmitting terminal is sent, and demodulation and demapping is carried out to P symbol sebolic addressing
Afterwards, P sequences to be decoded are obtained.
0<P≤M and P are integer, i.e. receiving terminal some or all of is likely to be received M treated in the second sequence.
S306, receiving terminal deinterleave P sequences to be decoded, obtain the sequence after deinterleaving.
When P=1, expression only receives a sequence to be decoded.Sequence to be decoded independently can be deinterleaved and be decoded, if translated
Code success, there is no need to soft mergings.If do not have for the sequence to be decoded that first receives it is successfully decoded, just by the 2nd
The data to be decoded that a sequence to be decoded received is received with the 1st carry out soft merging, then to the data to be decoded after soft merging
It is deinterleaved and decodes.Again without successfully decoded, sequence to be decoded and the first two that the 3rd is received carry out soft merging,
And so on, the P sequences to be decoded received carry out soft merging together.
Specifically, it is exactly that the bit moved in interleaving process is recovered to original position again to deinterleave, and is interweaved
Preceding sequence.
S307, receiving terminal by after deinterleaving sequence solution rate-matched and polarization decode, obtain decoding result.
Include the data to be transmitted of transmitting terminal in decoding result.
In the application, transmitting terminal treats coded sequence and carries out Polarization Coding and rate-matched, the first sequence after being encoded
Row, and replicate M First ray so that M sequential is corresponded with M First ray, from small to large according to M sequential, according to
Secondary the first sequential corresponding to each sequential carries out progressive intertexture, corresponding second sequence of M sequential is obtained, to the second sequence
After row modulation and mapping, a treated the second sequences of M are broadcasted according to M sequential, the second sequence that receiving terminal receives that treated
Afterwards, it is deinterleaved as sequence to be decoded, and the sequence solution rate-matched after deinterleaving is decoded with polarization, obtain decoding result.
Wherein, by the way of Polarization Coding, performance is more preferable, complexity is relatively low, rate-matched mode is flexible, and according to sequential relationship
It is more simpler than Scrambling Operation to carry out progressive intertexture, receiving terminal is also easier to complete to deinterleave according to the sequential of reception, significantly
Improve coding, decoding efficiency.
Optionally, transmitting terminal according to M sequential from small to large, corresponding to each sequential the first sequential carries out progressive successively
Interweave, obtains corresponding second sequence of M sequential, Ke Yishi:Transmitting terminal recycles the corresponding First ray of i-th of sequential
Displacement Ti*k, obtains corresponding second sequence of i-th of sequential.
Wherein, 0<I≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, and Δ is more than 0
Integer.
For example, when i=1, by first sequential corresponding First ray cyclic shift T1*k, ordered pair at first is obtained
The second sequence answered.When i=2, by corresponding First ray cyclic shift T2*k of the 2nd sequential, it is corresponding to obtain the 2nd sequential
Second sequence, wherein T2 and T1 differs Δ.
Optionally, on the basis of the above embodiments, First ray can be divided into M cross-talk sequences by transmitting terminal, every section
Subsequence includes k.First ray can be denoted as [C in this way1, C2... Ci... CM-1, CM], wherein CiFor a subsequence.
Correspondingly, transmitting terminal is by i-th of sequential corresponding First ray cyclic shift Ti*k, ordered pair when obtaining i-th
The second sequence answered, Ke Yishi:The corresponding First ray cyclic shift Ti cross-talk sequences of i-th of sequential are obtained i-th by transmitting terminal
Corresponding second sequence of a sequential.
Assuming that by the corresponding First ray of i-th of sequential, 1 to i is substituted into successively, and head Ti cross-talk sequence loops are moved
To the tail portion of First ray, corresponding second sequence of i-th of sequential is obtained.So, for example, when Δ is 1, ordered pair when the 1st
The second sequence answered can be denoted as [C2, C3... Ci... CM-1, CM, C1], corresponding second sequence of the 2nd sequential can be denoted as [C3,
C4... Ci... CM, C1, C2], corresponding second sequence of the 3rd sequential can be denoted as [C4, C5... Ci... CM, C1, C2,C3], no longer
It repeats one by one.
Fig. 4 is the data transmission method flow diagram that another embodiment of the application provides.As shown in figure 4, being equal to 1 in P
When, i.e., receiving terminal just receives 1 sequence to be decoded, and receiving terminal deinterleaves the P sequences to be decoded continuously received, obtains solution
Sequence after intertexture, can specifically include:
The sequence recycled back to be decoded received is shifted Ti*k by S401, receiving terminal, obtains M the first pending sequences
Row.
1≤i≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is more than 0
Integer.
I is substituted into displacement respectively since 1, until M, M the first pending sequences can be obtained.
Optionally, sequence to be decoded can be divided into M cross-talk sequences by receiving terminal, wherein every cross-talk sequence includes k.
The sequence recycled back to be decoded received is shifted Ti cross-talk sequences by receiving terminal, obtains M the first pending sequences.
S402, receiving terminal obtain M metric using M the first pending sequences of preset configuration pre-decode.
Optionally, serial elimination (Successive Cancellation, SC) decoding algorithm may be used in pre-decode, or
Person serially eliminates list (Successive Cancellation List, SCL) decoding algorithm and is deformed into row decoding or SCL
Deng other algorithms into row decoding, this is not restricted.
S403, receiving terminal determine cyclic shift digit Tt*k according to above-mentioned metric, and the sequence to be decoded is reversely followed
Ring shifts Tt*k, obtains the sequence after deinterleaving.
Specification, preset configuration is needed to refer to the configuration of transmitting terminal intertexture presequence, such as some of fixed ratios
Special position uses predetermined sequence as freezing bit, punching bit position and shortening bit.
It is not aware that the corresponding sequential of sequence to be decoded in S401, M kinds can only may be attempted.Before not interweaving
The preset configuration of sequence, successively to M the first pending sequences into row decoding, to obtain M metric, usually, if weighed
Value shows that conjecture is more accurate less than predetermined threshold value.M metric is compared, determines that most probable correct first is pending
Sequence, so that it may to determine cyclic shift digit Tt*k.
The sequence recycled back to be decoded is so shifted Tt*k, just restores the sequence before interweaving.It is specifically reversed
Cyclic shift rule is determined according to the rule of transmitting terminal cyclic shift, such as transmitting terminal moves tail by Tt*k from sequence header
Portion, then recycled back displacement is exactly to be moved to head from tail portion by Tt*k.
If sequence to be decoded is divided into M cross-talk sequences by receiving terminal in S401, S403 can be to determine receiving terminal here
Determine that rotation bit shifts hop count Tt according to above-mentioned metric, by Tt sections of sequence recycled back to be decoded.
Optionally, embodiment shown in Fig. 4 can also further simplify, using preset configuration pre-decode M first
Pending sequence while obtaining M metric, also exports the corresponding pre-decode result of M metric.By the first pending sequence
It arranges as the sequence after deinterleaving.
It is similar with previous embodiment it is possible to further basis, M metric is compared, determines that most probable corresponds to
Sequential, then the corresponding pre-decode result of this metric i.e. it is most probable decoding as a result, the most probable that will be determined
Pre-decode result carries out CRC check and, by the pre-decode result directly as decoding result, is no longer carried out if verified successfully
The step of below.
Fig. 5 is the data transmission method flow diagram that another embodiment of the application provides.As shown in figure 5, being more than 1 in P
When, receiving terminal deinterleaves the P sequences to be decoded continuously received, obtains the sequence after deinterleaving, can specifically include:
S501, receiving terminal shift the sequence recycled back to be decoded that pth+1 receives in the P received sequences to be decoded
Tp*k obtains P the first pending sequences.
Wherein, 1≤p≤P-1 and p are integer, and k is the integer more than 0, and Tp is the arithmetic sequence that difference is Δ, and Δ is big
In 0 integer.
Optionally ,+1 sequence to be decoded received of pth can be divided into M cross-talk sequences by receiving terminal, wherein per cross-talk
Sequence includes k.The sequence recycled back to be decoded received is shifted Tp cross-talk sequences by receiving terminal, and it is pending to obtain P a first
Sequence.
All P the first pending sequence soft mergings are obtained the second pending sequence after soft merging by S502, receiving terminal
Row.
In the case that P is more than 1, the sequence to be decoded received is all first carried out recycled back displacement by receiving terminal, is then carried out
Soft merging.Sequence performance after soft merging is more preferable.
Receiving terminal does not know that sequential is the sequence after soft merging be, is further continued for carrying out reacting cycle displacement, blind examination M-P+1 kinds
It may.
Second pending sequence recycled back is shifted Ti*k by S503, receiving terminal, obtains the pending sequence of M-P+1 third
Row, wherein 1≤i≤M-P+1, and p is integer.
I is substituted into displacement respectively since 1, until M-P+1, the pending sequence of M-P+1 third can be obtained.
S504, receiving terminal use the pending sequence of preset configuration pre-decode third, obtain M-P+1 metric.
It is similar with previous embodiment, the pending sequence of third is decoded using the preset configuration of intertexture presequence respectively, is obtained
M-P+1 metric.It is specific that the either progress such as SCL decoding algorithms or SCL deformation decoding algorithms of SC decoding algorithms may be used
Pre-decode, this is not restricted.
Metric in the application can be path metric.
S505, receiving terminal determine cyclic shift digit Tt*k according to metric, and sequence recycled back to be decoded is shifted
Tt*k, obtain the sequence after deinterleaving.
If sequence to be decoded is divided into M cross-talk sequences by receiving terminal in S501, S505 can be to determine receiving terminal here
Determine that rotation bit shifts hop count Tt according to above-mentioned metric, by Tt sections of sequence recycled back to be decoded.
The specific method for determining cyclic shift digit can refer to Fig. 4 embodiments, and details are not described herein.
Similarly, the corresponding pre-decode result of metric can also be exported after pre-decode.The pending sequence of third is made
For the sequence after deinterleaving.It is similar with previous embodiment it is possible to further basis, multiple metrics are compared, are determined
The corresponding sequential of most probable, then the corresponding pre-decode result of this metric i.e. most probable decoding will be as a result, will determine
The most probable pre-decode result gone out carries out CRC check, if verified successfully, which is tied directly as decoding
Fruit, the step of no longer progress below.
Optionally, in another embodiment, polar extended codings can be introduced, realize that the Polar codes of low bit- rate can pass through
The polar codes of high code check expand.
Specifically, MIB is added CRC bits by transmitting terminal by CRC, first obtains information bit sequence.
Correspondingly, transmitting terminal treats coded sequence and carries out Polarization Coding and rate-matched, the First ray after being encoded,
Can be specially:Transmitting terminal obtains M sequences to be encoded according to information bit sequence, carries out pole to M sequences to be encoded respectively
Change coding and rate-matched, the First ray after being encoded.
Optionally, the principle of polar extended codings may be used in transmitting terminal, and obtaining the 2nd from the 1st sequence to be encoded waits for
Coded sequence obtains the 3rd sequence to be encoded from the 1st sequence to be encoded and the 2nd sequence to be encoded, and so on obtain M
A sequence to be encoded.And then First ray can be obtained to M sequences to be encoded together Polarization Coding and rate-matched.Also may be used
To M sequences to be encoded respectively Polarization Coding and rate-matched, to obtain M sequence, recombinant obtains First ray.The application
In be not especially limited.
Optionally, transmitting terminal obtains M sequences to be encoded, Ke Yishi according to information bit sequence:Transmitting terminal obtains at the beginning of i-th
Begin sequence to be encoded, using the i-th predetermined sequence configure the i-th initial sequence to be encoded freeze bit, punching bit position and
Shorten bit, obtains the i-th sequence to be encoded.
Similar with previous embodiment, the i-th initial sequence to be encoded can meet the sequence of specified sequence format, and i-th is pre-
If sequence is known array.And then bit, punching ratio are freezed using the i-th predetermined sequence the i-th initial sequence to be encoded of filling
Special position and shortening bit.
And then transmitting terminal determines in the i-th sequence to be encoded and whether there is position to be copied.Position to be copied can be that code length expands
Transmitting terminal thinks information bit position performance better information ratio in the sequence to be encoded before the i-th sequence to be encoded of performance ratio after exhibition
Special position, then the information carried in sequence to be encoded before is copied to can again on the duplication position of the i-th sequence to be encoded.
1st sequence to be encoded includes above- mentioned information bit sequence, and the information bit position in sequence to be encoded can be all before
From the 1st sequence to be encoded, then it is to be encoded that the information with corresponding position to be copied in the 1st sequence to be encoded is copied to i-th
In position to be copied in sequence.In i.e. i-th sequence to be encoded when position to be copied there are at least one, by the 1st sequence to be encoded with
The information of corresponding position to be copied copies in the position to be copied in the i-th sequence to be encoded, obtains the newer i-th sequence to be encoded
Row.1<I≤M and i are integer.For the 1st sequence to be encoded, then directly the 1st predetermined sequence is used to configure the 1st initial code sequence
Freeze bit, punching bit position and shorten bit.
Optionally, to M sequences to be encoded together Polarization Coding and rate-matched, First ray is obtained, can send
End carries out Polarization Coding and rate-matched using R1 pairs of the 1st sequence to be encoded of code check to newer M sequences to be encoded, is compiled
First ray after code.This method carries out Polarization Coding and rate-matched together to M sequences to be encoded.
Alternatively, transmitting terminal respectively to the 1st sequence to be encoded to newer M sequences to be encoded carry out Polarization Coding and
Rate-matched obtains the 1st coded sequence to m-th coded sequence, using the 1st coded sequence to the m-th code sequence
Row constitute the First ray after the coding.Optionally, in this mode, each sequence to be encoded may be used when being encoded
Different code checks, this is not restricted.
Alternatively, to M sequences to be encoded respectively Polarization Coding and rate-matched, M sequence is obtained, recombinant obtains first
Sequence can be that transmitting terminal carries out Polarization Coding and speed using Ri pairs of the 1st coded sequence of code check to the newer i-th sequence to be encoded
Rate matches, and obtains i-th of coded sequence, and constituted using the 1st coded sequence to m-th coded sequence after the coding the
One sequence.
Code check Ri is the 1/N that the 1st sequence to be encoded of the transmitting terminal pair carries out code check when Polarization Coding, and wherein N is more than 1
Integer, N 2ceil(log2(i)).In i.e. this mode, the code check encoded every time can change.Transmitting terminal is to be encoded by the 1st
Sequential coding can obtain corresponding 1st coded sequence, and then according to the 1st sequence to be encoded, newer 2nd sequence to be encoded,
Corresponding 2nd coded sequence of the newer 2nd sequence to be encoded is obtained according to Polarization Coding and rate-matched, waits compiling further according to the 1st
Code sequence, newer 2nd sequence to be encoded, newer 3rd sequence to be encoded, are updated according to Polarization Coding and rate-matched
Corresponding 3rd coded sequence of the 3rd sequence to be encoded, and so on, the 1st coded sequence to newer m-th can be obtained and waited for
Coded sequence, the First ray after finally composition encodes.
It illustrates, it is assumed that the first sequence to be encoded is denoted as u1, GNIt is Polar coding vectors, C1It is the 1st volume after coding
Code sequence, wherein u1GN=C1, encoder bit rate can be R.The second sequence u to be encoded is determined again2, according to u2In each bit
Performance, it may be determined that have position to be copied, if so, by u1Information bit position in for bit content copy to u2Wait for it is multiple
Position processed, similarly, u2Freeze bit, punching bit position and shorten bit also fill known array, updated
U2.And then it can be by newer u2、u1It encoding together, encoder bit rate is R/2,Wherein C2Just
It is newer u2The 2nd coded sequence after coding, and so on, the sequence after multiple codings, the first sequence of recomposition can be obtained
Row.
Fig. 6 is the data transmission method flow diagram that another embodiment of the application provides.Optionally, shown in Fig. 6, Fig. 7
After sequence to be decoded in embodiment can be aforementioned introducing polar extended codings, coding, interweave obtained sequence.
As shown in fig. 6, when P is equal to 1, i.e., receiving terminal just receives 1 sequence to be decoded, and receiving terminal is a to the P received
Sequence to be decoded deinterleaves, and obtains the sequence after deinterleaving, can specifically include:
The sequence recycled back to be decoded received is shifted Ti*k by S601, receiving terminal, obtains M the first pending sequences
Row.
1≤i≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is more than 0
Integer.
Each first pending sequence is divided into M cross-talk sequences by S602, receiving terminal, wherein every cross-talk sequence includes k
Position.
Alternatively it is also possible to be sequence to be decoded to be just divided into M cross-talk sequences in S601, and recycled back shifts Ti
Section, then the first pending sequence is naturally also to be divided into M cross-talk sequences.
The each first pending sequence of pre-decode is most successively using the default subsequence set of preset configuration for S603, receiving terminal
The subsequence set of front end, obtains W*M metric, wherein default subsequence set includes W group.
Optionally, SC decoding algorithms either SCL decoding algorithms or SCL deformation decoding algorithms etc. may be used in pre-decode
Pre-decode is carried out, this is not restricted.
In W group, q+1 groups include 2qCross-talk sequence.
Correspondingly, the subsequence set of sequence front end to be decoded includes W group, and q+1 groups include 2qCross-talk sequence.
1≤2W-1≤ M and W are integer, q<W and q are the integer more than or equal to 0.
Receiving terminal can partly be decoded according in the first pending sequence of value pair of SNR.
Such as receiving terminal receive symbol sebolic addressing SNR be more than the first pre-determined threshold when, only need to be in the first pending sequence
One cross-talk sequence of front end is into row decoding.Correspondingly, when such as SNR is less than the second pre-determined threshold, just using earlier figures 4, Fig. 5
Decoded mode is into row decoding.Second pre-determined threshold is less than the first pre-determined threshold.
Former a subsequences in preset configuration using intertexture presequence decode the preceding several of the first pending sequence respectively
Subsequence.
Such as:Intertexture presequence can be denoted as { c1, c2, c3..., ci..., cM, the default subsequence set of preset configuration
Including { [c1],[c1、c2], then the sequential of each first pending sequence is unknown, it is denoted as { cx1, cx2, cx3..., cxi...,
cxM, using [c1] to the c of each first pending sequencex1Pre-decode is carried out, to determine which is first pending according to metric
The c of sequencex1It is c1, also determined that the sequential of this first pending sequence.Similarly, using [c1、c2] wait for each first
The c of processing sequencex1, cx2Pre-decode is carried out, metric is respectively obtained, which the first pending sequence determined according to metric
Cx1, cx2It is c1、c2。
SNR is bigger, and the group that the default subsequence set of preset configuration is included is fewer, that is, the subsequence needed is fewer.
Alternatively it is also possible to be not treat decoding sequence to carry out recycled back displacement, directly using default subsequence set
The subsequence in decoding sequence is treated successively to combine into row decoding.Such as the default subsequence set of preset configuration includes { [c1],
[c1、c2], sequence to be decoded is denoted as { cx1, cx2, cx3..., cxi..., cxM, then using [c1] treat the c of decoding sequencex1,
cx2, cx3..., cxi..., cxMEach subsequence pre-decode successively, obtains M metric, wherein which a sub- sequence on earth determined
Row are c1, and then determine the sequential of sequence to be decoded.Similarly, using [c1、c2] treat " c of decoding sequencex1, cx2”、“cx2,
cx3”…、“cxM-1,cxM" pre-decode successively, to determine that wherein on earth which two continuous subsequences are c1、c2, and then determination waits solving
The sequential of code sequence.
S604, receiving terminal determine cyclic shift digit Tt*k according to metric, and sequence recycled back to be decoded is moved
Position Tt*k, obtains the sequence after the deinterleaving.
The step is similar with previous embodiment, and details are not described herein.
It is similar with previous embodiment, in S603, the corresponding pre-decode result of W*M metric can also be exported.By
One pending sequence is as the sequence after deinterleaving.
It is similar with previous embodiment it is possible to further basis, W*M metric is compared, determines most probable pair
The sequential answered, then the corresponding pre-decode result of this metric i.e. most probable decoding by what is determined as a result, most may be used
Can pre-decode result carry out CRC check, if verified successfully, by the pre-decode result directly as decoding result, no longer into
The step of going below.
Fig. 7 is the data transmission method flow diagram that another embodiment of the application provides.As shown in fig. 7, being more than 1 in P
When, receiving terminal deinterleaves the P sequences to be decoded continuously received, obtains the sequence after deinterleaving, can specifically include:
S701, receiving terminal shift the sequence recycled back to be decoded that pth+1 receives in the P received sequences to be decoded
Tp*k obtains P the first pending sequences.
1≤p≤P-1 and p are integer, and k is the integer more than 0, and Tp is the arithmetic sequence that difference is Δ, and Δ is more than 0
Integer.
All P the first pending sequence soft mergings are obtained the second pending sequence after soft merging by S702, receiving terminal
Row.
Second pending sequence recycled back is shifted Ti*k by S703, receiving terminal, obtains the pending sequence of M-P+1 third
Row.
1≤i≤M-P+1, and i is integer.
The pending sequence of each third is divided into M cross-talk sequences by S704, receiving terminal.It include k per cross-talk sequence.
If sequence to be decoded is divided into M cross-talk sequences in S701, and recycled back shifts Tp sections, then third waits locating
It is naturally also to be divided into M cross-talk sequences to manage sequence.
S705, receiving terminal using preset configuration the default subsequence set pending sequence front end of pre-decode third successively
Subsequence set, obtain W* (M-P+1) a metric.
Default subsequence set includes W group, and q+1 groups include 2qCross-talk sequence, correspondingly, the pending sequence of third is most
The subsequence set of front end includes 2 comprising W group, q+1 groupsqCross-talk sequence.Wherein, 1≤2W-1≤ M and W are integer, q<W
And q is the integer more than or equal to 0.
It is similar with pre-decode process shown in fig. 6, can be the sub- sequence of the pending sequence front end of pre-decode third successively
Row set.
S704 can not also be executed, that is, does not need reacting cycle and shifts to obtain the pending sequence of third.Directly use pre- establishing
The default subsequence set set successively the second pending sequence of pre-decode continuous subsequence combination.
Such as the default subsequence set of preset configuration includes { [c1],[c1、c2], the second pending sequence is denoted as { cx1,
cx2, cx3..., cxi..., cxM, then using [c1] treat the c of decoding sequencex1, cx2, cx3..., cxi..., cxMEvery sub- sequence
Leie time pre-decode, obtains M metric, to determine that wherein which subsequence is c on earth1, and then determine that second is pending
The sequential of sequence.Similarly, using [c1、c2] treat " c of decoding sequencex1, cx2”、“cx2, cx3”…、“cxM-1,cxM" pre- successively
Decoding, to determine that wherein on earth which two continuous subsequences are c1、c2, and then determine the sequential of the second pending sequence.
S706, receiving terminal determine cyclic shift digit Tt*k according to metric, and sequence recycled back to be decoded is moved
Position Tt*k obtains the sequence after deinterleaving.
It is similar with previous embodiment, the corresponding pre-decode result of metric can also be exported after pre-decode.Third is waited for
Processing sequence is as the sequence after deinterleaving.If it is directly to the second pending sequence pre-decode, then pending by second
Sequence is as the sequence after deinterleaving.
It is similar with previous embodiment it is possible to further basis, multiple metrics are compared, determine that most probable corresponds to
Sequential, then the corresponding pre-decode result of this metric i.e. it is most probable decoding as a result, the most probable that will be determined
Pre-decode result carries out CRC check and, by the pre-decode result directly as decoding result, is no longer carried out if verified successfully
The step of below.
Further, the sequence to be encoded of transmitting terminal can also be obtained by different modes.
Usually, Master Information Block (master information block, MIB) is passed through cyclic redundancy check by transmitting terminal
It verifies (Cyclical Redundancy Check, CRC) and adds CRC bits, obtain sequence to be encoded.Wherein, MIB includes
Data to be transmitted.
Optionally, in another embodiment, MIB is added CRC bits by transmitting terminal by CRC, first obtains information bit sequence.
Then transmitting terminal obtains initial sequence to be encoded, freezes bit using the initial sequence to be encoded of predetermined sequence configuration
Position, punching bit position and shortening bit, and information bit sequence is configured to the information bit position of initial sequence to be encoded,
Obtain sequence to be encoded.
Wherein, initial sequence to be encoded can meet the sequence of specified sequence format, and predetermined sequence is known array, hair
Sending end freezes bit, punching bit position and the upper known array of shortening bit filling initial sequence to be encoded, is believing
The upper information bit sequence of bit filling is ceased, sequence to be encoded is formed.
Fig. 8 is the data transmission device structural schematic diagram that one embodiment of the application provides, which can be integrated in aforementioned
Sending ending equipment, as shown in figure 8, the device includes:Coding module 801, acquisition module 802, interleaving block 803, modulation module
804 and sending module 805, wherein
Coding module 801 treats coded sequence and carries out Polarization Coding and rate-matched, the First ray after being encoded.
Acquisition module 802, obtains the M First rays, and M sequential is corresponded with the M First rays.
Interleaving block 803, from small to large according to the M sequential, successively the First ray corresponding to each sequential into
The progressive intertexture of row, obtains corresponding second sequence of M sequential, wherein M is the integer more than 0.
Modulation module 804, is modulated second sequence and mapping is handled.
Sending module 805 broadcasts the M treated second sequence according to the M sequential.
The device is for executing preceding method embodiment, and implementing principle and technical effect are similar, and details are not described herein.
Optionally, interleaving block 803 are specifically used for, by i-th of sequential corresponding First ray cyclic shift Ti*k, obtaining
To corresponding second sequence of i-th of sequential, wherein 0<I≤M and i are integer, and k is the integer more than 0, and Ti is that difference is Δ
Arithmetic sequence, wherein Δ is the integer more than 0.
Optionally, interleaving block 803 are additionally operable to the First ray being divided into M cross-talk sequences, every section of sub- sequence
Row include k.Correspondingly, interleaving block 803 obtain the corresponding First ray cyclic shift Ti cross-talk sequences of i-th of sequential
Corresponding second sequence of i-th of sequential.
Optionally, coding module 801 are additionally operable to treating coded sequence progress Polarization Coding and rate-matched, be compiled
Before First ray after code, Master Information Block to be sent is added into CRC bits by CRC, obtains information bit sequence;It obtains just
Begin sequence to be encoded, freezes bit, punching bit position and contracting using what predetermined sequence configured the initial sequence to be encoded
Short bit, and described information bit sequence configuration is obtained into described wait for the information bit position of the initial sequence to be encoded
Coded sequence.
In another embodiment, coding module 801 is additionally operable to treating coded sequence progress Polarization Coding and rate
Match, before the First ray after being encoded, Master Information Block to be sent is added into CRC ratios by cyclic redundancy check check (CRC)
Spy obtains information bit sequence;M sequences to be encoded are obtained according to described information bit sequence, and to the M sequences to be encoded
Row carry out Polarization Coding and rate-matched, the First ray after being encoded.
Further, coding module 801 obtain the i-th initial sequence to be encoded, and described i-th is configured using the i-th predetermined sequence
Initial sequence to be encoded freezes bit, punching bit position and shortening bit, obtains the i-th sequence to be encoded;Determine institute
It states in the i-th sequence to be encoded and whether there is position to be copied.There are at least one to wait for again in determining the described i-th sequence to be encoded
When position processed, it will be copied in the described i-th sequence to be encoded with the information of the corresponding position to be copied in the 1st sequence to be encoded
In position to be copied, obtain the newer i-th sequence to be encoded, wherein the 1st sequence to be encoded include described information bit sequence, 1<i
≤ M and i are integer.
Correspondingly, it waits compiling using R1 pairs of the 1st sequence to be encoded of code check to the newer m-th Sequence composition to be encoded
Code sequence carries out Polarization Coding and rate-matched, the First ray after being encoded;Alternatively, respectively extremely to the 1st sequence to be encoded
The newer M sequences to be encoded carry out Polarization Coding and rate-matched, obtain the 1st coded sequence to m-th code sequence
Row, and using the 1st coded sequence constitute the coding to the m-th coded sequence after First ray;Alternatively, adopting
Polarization Coding and rate-matched are carried out with Ri pairs of the 1st coded sequence of code check to newer i-th sequence to be encoded, obtains i-th
A coded sequence, and the First ray after the coding is constituted using the 1st coded sequence to m-th coded sequence, wherein code
Rate Ri is the 1/N that the 1st sequence to be encoded of the transmitting terminal pair carries out code check when Polarization Coding, and wherein N is the integer more than 1, and N is
2ceil(log2(i))。
Fig. 9 is the data transmission device structural schematic diagram that another embodiment of the application provides, before which can be integrated in
Receiving device is stated, as shown in figure 9, the device includes:Receiving module 901, demodulation module 902, de-interleaving block 903 and decoding
Module 904, wherein:
Receiving module 901, the continuous P symbol sebolic addressing for receiving transmitting terminal and sending.
Demodulation module 902 after carrying out demodulation and demapping to P symbol sebolic addressing, obtains P sequences to be decoded, wherein 0<
P≤M and P are integer, and M indicates that transmitting terminal broadcasts the M symbol sebolic addressings.
De-interleaving block 903 deinterleaves the P sequences to be decoded, obtains the sequence after deinterleaving.
Sequence solution rate-matched after the deinterleaving is decoded with polarization, obtains decoding result by decoding module 904.
The device is for executing preceding method embodiment, and implementing principle and technical effect are similar, and details are not described herein.
Optionally, when P=1, the sequence recycled back to be decoded received is shifted Ti*k by de-interleaving block 903,
Obtain M the first pending sequences, wherein 1≤i≤M and i is integer, k is the integer more than 0, and Ti is the equal difference that difference is Δ
Sequence, wherein Δ is the integer more than 0;Using M first pending sequences of preset configuration pre-decode, M measurement is obtained
Value;Cyclic shift digit Tt*k is determined according to the metric, and the sequence recycled back to be decoded is shifted Tt*k,
Obtain the sequence after the deinterleaving.
Further, de-interleaving block 903 can be specifically that the sequence to be decoded that will be received is divided into M cross-talk sequences
Row, wherein every cross-talk sequence includes k;The sequence recycled back to be decoded received is shifted into Ti cross-talk sequences, obtains M
A first pending sequence.
Optionally, when P=1, the sequence recycled back to be decoded received is shifted Ti*k by de-interleaving block 903,
Obtain M the first pending sequences, wherein 1≤i≤M and i is integer, k is the integer more than 0, and Ti is the equal difference that difference is Δ
Sequence, wherein Δ is the integer more than 0;Each first pending sequence is divided into M cross-talk sequences, wherein per cross-talk
Sequence includes k;Using preset configuration default subsequence set successively each first pending sequence of pre-decode most before
The subsequence set at end, obtains W*M metric, wherein the default subsequence set include W group, q+1 groups include 2q
Duan Lianxu subsequences, it includes 2 that the subsequence set of the first pending sequence front end, which includes W group, q+1 groups,qDuan Lian
Continuous subsequence, 1≤2W-1≤ M and W are integer, q<W and q are the integer more than or equal to 0;It is determined and is recycled according to the metric
Displacement digit Tt*k, and the sequence recycled back to be decoded is shifted Tt*k, obtain the sequence after the deinterleaving.
Optionally, when P is more than 1, de-interleaving block 903, by the institute that pth+1 receives in the P received sequences to be decoded
Sequence recycled back to be decoded displacement Tp*k is stated, P the first pending sequences are obtained, wherein 1≤p≤P-1 and p is integer, k
For the integer more than 0, Tp is the arithmetic sequence that difference is Δ, and Δ is greater than 0 integer;All P a described first are pending
Sequence soft merging obtains the second pending sequence after soft merging;Described second pending sequence recycled back is shifted into Ti*k
Position obtains the pending sequence of M-P+1 third, wherein 1≤i≤M-P+1, and p is integer;Using preset configuration pre-decode institute
The pending sequence of third is stated, M-P+1 metric is obtained;Cyclic shift digit Tt*k is determined according to the metric, and by institute
It states sequence recycled back to be decoded and shifts Tt*k, obtain the sequence after the deinterleaving.
Optionally, when P is more than 1 ,+1 sequence to be decoded received of pth is divided into M sections by de-interleaving block 903
Subsequence, wherein every cross-talk sequence includes k;The sequence recycled back to be decoded is shifted into Tp cross-talk sequences, obtains P
First pending sequence.
Optionally, when P is more than 1, de-interleaving block 903, by the institute that pth+1 receives in the P received sequences to be decoded
Sequence recycled back to be decoded displacement Tp*k is stated, P the first pending sequences are obtained, wherein 1≤p≤P-1 and p is integer, k
For the integer more than 0, Tp is the arithmetic sequence that difference is Δ, and Δ is the integer more than 0;All P a described first are pending
Sequence soft merging obtains the second pending sequence after soft merging;Described second pending sequence recycled back is shifted into Ti*k
Position obtains the pending sequence of M-P+1 third, wherein 1≤i≤M-P+1, and i is integer;Each third is pending
Sequence is divided into M cross-talk sequences, wherein every cross-talk sequence includes k;It is pre- successively using the default subsequence set of preset configuration
The subsequence set for decoding the pending sequence front end of the third obtains W* (M-P+1) a metric, wherein described default
Subsequence set include W group, q+1 groups include 2qDuan Lianxu subsequences, the sub- sequence of the pending sequence front end of third
Row set include W group, q+1 groups include 2qDuan Lianxu subsequences, 1≤2W-1≤ M and W are integer, q<W and q are to be more than or wait
In 0 integer;Cyclic shift digit Tt*k is determined according to the metric, and the sequence recycled back to be decoded is shifted
Tt*k, obtain the sequence after the deinterleaving.
In another embodiment, when P=1, de-interleaving block 903, the sequence recycled back to be decoded that will be received is moved
Position Ti*k obtains M the first pending sequences, wherein 1≤i≤M and i is integer, k is the integer more than 0, and Ti is difference
For the arithmetic sequence of Δ, wherein Δ is the integer more than 0;Using the described first pending sequence as the sequence after the deinterleaving
Row.Decoding module 904 obtains M metric and M weighing apparatus using M first pending sequences of preset configuration pre-decode
The corresponding pre-decode result of magnitude;Cyclic redundancy check (CRC) verification is carried out to the pre-decode result, it, will if verifying successfully
The pre-decode added as the decoding result.
In another embodiment, when P is more than 1, de-interleaving block 903, by pth+1 in the P received sequences to be decoded
The sequence recycled back displacement Tp*k to be decoded received, obtains P the first pending sequences, wherein 1≤p≤P-1 and p
For integer, k is the integer more than 0, and Tp is the arithmetic sequence that difference is Δ;By all P first pending soft conjunctions of sequence
And obtain the second pending sequence after soft merging;Described second pending sequence recycled back is shifted Ti*k, obtains M-
The pending sequence of P+1 third, wherein 1≤i≤M-P+1, and p is integer;Using the pending sequence of the third as the solution
Sequence after intertexture.Decoding module 904 obtains M-P+1 measurement using the pending sequence of third described in preset configuration pre-decode
Value and the corresponding pre-decode result of M-P+1 metric;Cyclic redundancy check (CRC) verification is carried out to the pre-decode result,
If verifying successfully, the pre-decode was added as the decoding result.
It should be noted that it should be understood that the modules of apparatus above division be only a kind of division of logic function,
It can completely or partially be integrated on a physical entity in actual implementation, it can also be physically separate.And these modules can be with
All realized in the form of software is called by processing element;It can also all realize in the form of hardware;It can also part mould
Block calls the form of software to realize by processing element, and part of module is realized by the form of hardware.For example, de-interleaving block can
Think the processing element individually set up, can also be integrated in some chip of above-mentioned apparatus and realize, in addition it is also possible to journey
The form of sequence code is stored in the memory of above-mentioned apparatus, called and executed by some processing element of above-mentioned apparatus more than
The function of determining module.The realization of other modules is similar therewith.In addition these modules can completely or partially integrate,
It can independently realize.Processing element described here can be a kind of integrated circuit, the processing capacity with signal.It was realizing
Cheng Zhong, each step of the above method or more modules can by the integrated logic circuit of the hardware in processor elements or
The instruction of person's software form is completed.
For example, the above module can be arranged to implement one or more integrated circuits of above method, such as:
One or more specific integrated circuits (Application Specific Integrated Circuit, ASIC), or, one
Or multi-microprocessor (digital singnal processor, DSP), or, one or more field programmable gate array
(Field Programmable Gate Array, FPGA) etc..For another example, when some above module dispatches journey by processing element
When the form of sequence code is realized, which can be general processor, such as central processing unit (Central
Processing Unit, CPU) or it is other can be with the processor of caller code.For another example, these modules can be integrated in one
It rises, is realized in the form of system on chip (system-on-a-chip, SOC).
Figure 10 is the data transmission device structural schematic diagram that another embodiment of the application provides, before which can be integrated in
Sending ending equipment is stated, as shown in Figure 10, which includes:Memory 10, processor 11 and transceiver 12, memory 10, place
Reason device 11 and transceiver 12 can be connected by bus 14, wherein
Wherein, transceiver 12 can be connect with antenna.Transceiver 12 can receive the letter that other equipment is sent by antenna
Breath, and send information to processor 11 and handled;On the contrary on direction, processor 11 carries out coded treatment to data, and
It is sent to receiving device by transceiver 12.
Memory 10 is used to store the program for realizing above method embodiment or embodiment illustrated in fig. 8 modules, place
It manages device 11 and calls the program, execute the operation of above method embodiment.
For example, processor 11, which treats coded sequence, carries out Polarization Coding and rate-matched, the First ray after being encoded;
The M First rays are obtained, M sequential is corresponded with the M First rays;From small to large according to the M sequential,
The First ray corresponding to each sequential carries out progressive intertexture successively, obtains corresponding second sequence of M sequential,
In, M is the integer more than 0;Second sequence is modulated and mapping is handled.
Transceiver 12 broadcasts the M treated second sequence according to the M sequential.
The further refinement of processor executes, and may refer to preceding method embodiment or embodiment illustrated in fig. 8, herein
It repeats no more.
Figure 11 is the data transmission device structural schematic diagram that another embodiment of the application provides, before which can be integrated in
Receiving device is stated, as shown in figure 11, which includes:Memory 20, processor 21 and transceiver 22, wherein memory
20, processor 21 and transceiver 22 can be connected by bus 24.
Wherein, transceiver 22 can be connect with antenna.Transceiver 22 can receive other equipment by antenna and (such as send
End equipment) information that sends, and it sends information to processor 21 and is handled;On the contrary on direction, processor 21 is to data
It is handled, and other equipment is sent to by transceiver 22.
Memory 20 is used to store the program for realizing above method embodiment or embodiment illustrated in fig. 9 modules, place
It manages device 21 and calls the program, execute the operation of above method embodiment.
For example, transceiver 22 continuously receives the P symbol sebolic addressing that transmitting terminal is sent.
After processor 21 carries out demodulation and demapping to P symbol sebolic addressing, P sequences to be decoded are obtained, wherein 0<P≤M
And P is integer, M indicates that transmitting terminal broadcasts the M symbol sebolic addressings;The P sequences to be decoded are deinterleaved, solution is obtained and hands over
Sequence after knitting;Sequence solution rate-matched after the deinterleaving is decoded with polarization, obtains decoding result.
The further refinement of processor executes, and may refer to preceding method embodiment or embodiment illustrated in fig. 9, herein
It repeats no more.
Based on device shown in Figure 10 and Figure 11, some or all of above each unit can also pass through field-programmable
The form of gate array (Field Programmable Gate Array, FPGA) is embedded on some chip of the terminal
It realizes.And they can be implemented separately, and can also integrate.
Here the same above description of processing element, can be general processor, such as CPU, can also be and be configured to reality
One or more integrated circuits of above method are applied, such as:One or more specific integrated circuit (Application
Specific Integrated Circuit, ASIC), or, one or more microprocessors (digital singnal
Processor, DSP), or, one or more field programmable gate array (Field Programmable Gate Array,
FPGA) etc..Memory element can be a storage device, can also be the general designation of multiple memory elements.
In addition, multiple interfaces can be arranged on the processor, be respectively used to connection peripheral equipment or connect with peripheral equipment
Interface circuit.For example, the interface for connecting display screen, the interface for connecting camera, for connecting audio frequency process member
The interface etc. of part.
Claims (30)
1. a kind of data transmission method, which is characterized in that including:
Transmitting terminal treats coded sequence and carries out Polarization Coding and rate-matched, the First ray after being encoded;
The transmitting terminal obtains the M First rays, and M sequential is corresponded with the M First rays;
From small to large according to the M sequential, the First ray corresponding to each sequential carries out progression to the transmitting terminal successively
Formula interweaves, and obtains corresponding second sequence of M sequential, wherein M is the integer more than 0;
The transmitting terminal is modulated to second sequence and mapping processing, according to the M sequential broadcast M processing
Second sequence afterwards.
2. according to the method described in claim 1, it is characterized in that, the transmitting terminal according to the M sequential from small to large, according to
The secondary First ray corresponding to each sequential carries out progressive intertexture, obtains corresponding second sequence of M sequential, wraps
It includes:
I-th of sequential corresponding First ray cyclic shift Ti*k is obtained i-th of sequential corresponding second by the transmitting terminal
Sequence, wherein 0<I≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ be more than
0 integer.
3. according to the method described in claim 2, it is characterized in that, the transmitting terminal is by the corresponding First ray of i-th of sequential
Middle cyclic shift Ti*k, before obtaining corresponding second sequence of i-th of sequential, further include:
The First ray is divided into M cross-talk sequences by the transmitting terminal, and every section of subsequence includes k;
I-th of sequential corresponding First ray cyclic shift Ti*k is obtained i-th of sequential corresponding second by the transmitting terminal
Sequence, including:
The corresponding First ray cyclic shift Ti cross-talk sequences of i-th of sequential it is corresponding to be obtained i-th of sequential by the transmitting terminal
Second sequence.
4. according to claim 1-3 any one of them methods, which is characterized in that the transmitting terminal treats coded sequence and carries out pole
Change encodes and rate-matched, before the First ray after being encoded, further includes:
Master Information Block to be sent is added CRC bits by the transmitting terminal by cyclic redundancy check check (CRC), obtains information bit
Sequence;
The transmitting terminal obtains initial sequence to be encoded, freezes bit using what predetermined sequence configured the initial sequence to be encoded
Position, punching bit position and shorten bit, and by described information bit sequence configuration to the letter of the initial sequence to be encoded
Bit is ceased, the sequence to be encoded is obtained.
5. according to claim 1-3 any one of them methods, which is characterized in that the transmitting terminal treats coded sequence and carries out pole
Change encodes and rate-matched, before the First ray after being encoded, further includes:
Master Information Block to be sent is added CRC bits by the transmitting terminal by cyclic redundancy check check (CRC), obtains information bit
Sequence;
The transmitting terminal treats coded sequence and carries out Polarization Coding and rate-matched, the First ray after being encoded, including:
The transmitting terminal obtains M sequences to be encoded according to described information bit sequence, and is carried out to the M sequences to be encoded
Polarization Coding and rate-matched, the First ray after being encoded.
6. according to the method described in claim 5, it is characterized in that, the transmitting terminal obtains M according to described information bit sequence
A sequence to be encoded, including:
The transmitting terminal obtains the i-th initial sequence to be encoded, and the i-th initial sequence to be encoded is configured using the i-th predetermined sequence
Freeze bit, punching bit position and shorten bit, obtain the i-th sequence to be encoded;
The transmitting terminal, which determines in the described i-th sequence to be encoded, whether there is position to be copied;
The transmitting terminal is at position to be copied there are at least one in determining the described i-th sequence to be encoded, by the 1st sequence to be encoded
In copied in the position to be copied in the described i-th sequence to be encoded with the information of the corresponding position to be copied, obtain newer
I-th sequence to be encoded, wherein the 1st sequence to be encoded include described information bit sequence, 1<I≤M and i are integer;
The transmitting terminal is to the M sequences progress Polarization Codings and rate-matched to be encoded, the First ray after being encoded,
Including:
The transmitting terminal waits compiling using the 1st sequence to be encoded of R1 pairs of code check to the newer m-th Sequence composition to be encoded
Code sequence carries out Polarization Coding and rate-matched, the First ray after being encoded;Alternatively,
The transmitting terminal carries out Polarization Coding and rate to the 1st sequence to be encoded to the newer M sequences to be encoded respectively
Matching obtains the 1st coded sequence to m-th coded sequence, and encode using the 1st coded sequence to the m-th
First ray after being encoded described in Sequence composition;Alternatively,
The transmitting terminal using Ri pairs of the 1st coded sequence of code check to newer i-th sequence to be encoded carry out Polarization Coding and
After rate-matched obtains i-th of coded sequence, and the 1st coded sequence of use constitutes the coding to m-th coded sequence
First ray, wherein code check Ri is the 1/N, wherein N that the 1st sequence to be encoded of the transmitting terminal pair carries out code check when Polarization Coding
For the integer more than 1, N 2ceil(log2(i))。
7. a kind of data transmission method, which is characterized in that including:
Receiving terminal continuously receives P symbol sebolic addressing of transmitting terminal transmission, after carrying out demodulation and demapping to P symbol sebolic addressing, obtains
Take P sequences to be decoded, wherein 0<P≤M and P are integer, and M indicates that transmitting terminal broadcasts the M symbol sebolic addressings;
The receiving terminal deinterleaves the P sequences to be decoded, obtains the sequence after deinterleaving;
The receiving terminal decodes the sequence solution rate-matched after the deinterleaving with polarization, obtains decoding result.
8. the method according to the description of claim 7 is characterized in that when P=1, the receiving terminal is to the P sequences to be decoded
It deinterleaves, obtains the sequence after deinterleaving, including:
The sequence recycled back to be decoded received is shifted Ti*k by the receiving terminal, obtains M the first pending sequences,
Wherein, 1≤i≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is more than 0
Integer;
The receiving terminal obtains M metric using M first pending sequences of preset configuration pre-decode;
The receiving terminal determines cyclic shift digit Tt*k according to the metric, and by the sequence recycled back to be decoded
Displacement Tt*k, obtains the sequence after the deinterleaving.
9. according to the method described in claim 8, it is characterized in that, the receiving terminal is reversed by the sequence to be decoded received
Cyclic shift Ti*k obtains the first pending sequence, including:
The sequence to be decoded received is divided into M cross-talk sequences by the receiving terminal, wherein every cross-talk sequence includes k;
The sequence recycled back to be decoded received is shifted Ti cross-talk sequences by the receiving terminal, and it is pending to obtain M a first
Sequence.
10. the method according to the description of claim 7 is characterized in that when P=1, the receiving terminal is to the P sequences to be decoded
Row deinterleave, and obtain the sequence after deinterleaving, including:
The sequence recycled back to be decoded received is shifted Ti*k by the receiving terminal, obtains M the first pending sequences,
Wherein, 1≤i≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is more than 0
Integer;
Each first pending sequence is divided into M cross-talk sequences by the receiving terminal, wherein every cross-talk sequence includes k;
The each first pending sequence of pre-decode is most successively using the default subsequence set of preset configuration for the receiving terminal
The subsequence set of front end, obtains W*M metric, wherein the default subsequence set includes that W group, q+1 groups include
2qDuan Lianxu subsequences, it includes 2 that the subsequence set of the first pending sequence front end, which includes W group, q+1 groups,qDuan Lian
Continuous subsequence, 1≤2W-1≤ M and W are integer, q<W and q are the integer more than or equal to 0;
The receiving terminal determines cyclic shift digit Tt*k according to the metric, and by the sequence recycled back to be decoded
Displacement Tt*k, obtains the sequence after the deinterleaving.
11. the method according to the description of claim 7 is characterized in that when P is more than 1, the receiving terminal is to be decoded to the P
Sequence deinterleaves, and obtains the sequence after deinterleaving, including:
The receiving terminal shifts the sequence recycled back to be decoded that pth+1 in the P received sequences to be decoded receives
Tp*k obtains P the first pending sequences, wherein 1≤p≤P-1 and p is integer, k is the integer more than 0, and Tp is that difference is
The arithmetic sequence of Δ, Δ are greater than 0 integer;
All P first pending sequence soft mergings are obtained the second pending sequence after soft merging by the receiving terminal;
Described second pending sequence recycled back is shifted Ti*k by the receiving terminal, obtains the pending sequence of M-P+1 third
Row, wherein 1≤i≤M-P+1, and p is integer;
The receiving terminal obtains M-P+1 metric using the pending sequence of third described in preset configuration pre-decode;
The receiving terminal determines cyclic shift digit Tt*k according to the metric, and the sequence recycled back to be decoded is moved
Position Tt*k, obtains the sequence after the deinterleaving.
12. according to the method for claim 11, which is characterized in that the receiving terminal will be in the P that received sequences to be decoded
The sequence recycled back displacement Tp*k to be decoded that pth+1 receives, obtains P the first pending sequences, including:
+ 1 sequence to be decoded received of pth is divided into M cross-talk sequences by the receiving terminal, wherein every section of sub-series of packets
Include k;
The sequence recycled back to be decoded is shifted Tp cross-talk sequences by the receiving terminal, obtains P the first pending sequences.
13. the method according to the description of claim 7 is characterized in that when P is more than 1, the receiving terminal is to be decoded to the P
Sequence deinterleaves, and obtains the sequence after deinterleaving, including:
The receiving terminal shifts the sequence recycled back to be decoded that pth+1 in the P received sequences to be decoded receives
Tp*k obtains P the first pending sequences, wherein 1≤p≤P-1 and p is integer, k is the integer more than 0, and Tp is that difference is
The arithmetic sequence of Δ, Δ are the integer more than 0;
All P first pending sequence soft mergings are obtained the second pending sequence after soft merging by the receiving terminal;
Described second pending sequence recycled back is shifted Ti*k by the receiving terminal, obtains the pending sequence of M-P+1 third
Row, wherein 1≤i≤M-P+1, and i is integer;
Each pending sequence of third is divided into M cross-talk sequences by the receiving terminal, wherein every cross-talk sequence includes k;
The receiving terminal using preset configuration the default subsequence set pending sequence front end of third described in pre-decode successively
Subsequence set, obtain W* (M-P+1) a metric, wherein the default subsequence set include W group, q+1 groups packet
Include 2qDuan Lianxu subsequences, it includes 2 that the subsequence set of the pending sequence front end of third, which includes W group, q+1 groups,qSection
Continuous subsequence, 1≤2W-1≤ M and W are integer, q<W and q are the integer more than or equal to 0;
The receiving terminal determines cyclic shift digit Tt*k according to the metric, and by the sequence recycled back to be decoded
Displacement Tt*k, obtains the sequence after the deinterleaving.
14. the method according to the description of claim 7 is characterized in that when P=1, the receiving terminal is to the P sequences to be decoded
Row deinterleave, and obtain the sequence after deinterleaving, including:
The sequence recycled back to be decoded received is shifted Ti*k by the receiving terminal, obtains M the first pending sequences,
Wherein, 1≤i≤M and i are integer, and k is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is more than 0
Integer;
Using the described first pending sequence as the sequence after the deinterleaving;
The receiving terminal decodes the sequence solution rate-matched after the deinterleaving with polarization, obtains decoding result, including:
The receiving terminal obtains M metric and M weighing apparatus using M first pending sequences of preset configuration pre-decode
The corresponding pre-decode result of magnitude;
The receiving terminal carries out cyclic redundancy check (CRC) verification to the pre-decode result, if verifying successfully, pre- is translated described
Code added as the decoding result.
15. the method according to the description of claim 7 is characterized in that when P is more than 1, the receiving terminal is to be decoded to the P
Sequence deinterleaves, and obtains the sequence after deinterleaving, including:
The receiving terminal shifts the sequence recycled back to be decoded that pth+1 in the P received sequences to be decoded receives
Tp*k obtains P the first pending sequences, wherein 1≤p≤P-1 and p is integer, k is the integer more than 0, and Tp is that difference is
The arithmetic sequence of Δ;
All P first pending sequence soft mergings are obtained the second pending sequence after soft merging by the receiving terminal;
Described second pending sequence recycled back is shifted Ti*k by the receiving terminal, obtains the pending sequence of M-P+1 third
Row, wherein 1≤i≤M-P+1, and p is integer;
Using the pending sequence of the third as the sequence after the deinterleaving;
The receiving terminal decodes the sequence solution rate-matched after the deinterleaving with polarization, obtains decoding result, including:
The receiving terminal obtains M-P+1 metric and M-P+1 using the pending sequence of third described in preset configuration pre-decode
The corresponding pre-decode result of a metric;
Cyclic redundancy check (CRC) verification is carried out to the pre-decode result, the pre-decode was added into conduct if verifying successfully
The decoding result.
16. a kind of data transmission device, which is characterized in that including:
Memory, for storing program;
Processor, the described program for executing the memory storage, when described program is performed, the processor is treated
Coded sequence carries out Polarization Coding and rate-matched, the First ray after being encoded;M First rays are obtained, at M
Sequence is corresponded with the M First rays;From small to large according to the M sequential, successively corresponding to each sequential described
One sequence carries out progressive intertexture, obtains corresponding second sequence of M sequential, wherein M is the integer more than 0;To described
Second sequence is modulated and mapping processing;
Transceiver, for broadcasting a treated second sequence of the M according to the M sequential.
17. device according to claim 16, which is characterized in that the processor is specifically used for corresponding to i-th of sequential
First ray cyclic shift Ti*k, obtain corresponding second sequence of i-th of sequential, wherein 0<I≤M and i are integer, and k is
Integer more than 0, Ti are the arithmetic sequences that difference is Δ, wherein Δ is the integer more than 0.
18. device according to claim 17, which is characterized in that the processor is additionally operable to correspond to by i-th of sequential
First ray in cyclic shift Ti*k the First ray is drawn before obtaining corresponding second sequence of i-th of sequential
It is divided into M cross-talk sequences, every section of subsequence includes k;
The processor is specifically used for, by the corresponding First ray cyclic shift Ti cross-talk sequences of i-th of sequential, obtaining i-th
Corresponding second sequence of sequential.
19. according to claim 16-18 any one of them devices, which is characterized in that the processor is additionally operable to treating volume
Code sequence carries out Polarization Coding and rate-matched, before the First ray after being encoded, by Master Information Block to be sent by following
Ring redundancy check check (CRC) adds CRC bits, obtains information bit sequence;Initial sequence to be encoded is obtained, using predetermined sequence
Configure freezing bit, punching bit position and shortening bit for the initial sequence to be encoded, and by described information bit
Sequence is configured to the information bit position of the initial sequence to be encoded, obtains the sequence to be encoded.
20. according to claim 16-18 any one of them devices, which is characterized in that the processor is additionally operable to treating volume
Code sequence carries out Polarization Coding and rate-matched, before the First ray after being encoded, by Master Information Block to be sent by following
Ring redundancy check check (CRC) adds CRC bits, obtains information bit sequence;
The processor is specifically used for obtaining M sequences to be encoded according to described information bit sequence, and waits compiling to the M
Code sequence carries out Polarization Coding and rate-matched, the First ray after being encoded.
21. device according to claim 20, which is characterized in that the processor initially waits compiling specifically for obtaining i-th
Code sequence freezes bit, punching bit position and contracting using what the i-th predetermined sequence configured the described i-th initial sequence to be encoded
Short bit obtains the i-th sequence to be encoded;It determines in the described i-th sequence to be encoded and whether there is position to be copied;Determining
When stating position to be copied there are at least one in the i-th sequence to be encoded, by the 1st sequence to be encoded with the corresponding position to be copied
Information copy in the position to be copied in the described i-th sequence to be encoded, obtain the newer i-th sequence to be encoded, wherein the 1st
Sequence to be encoded include described information bit sequence, 1<I≤M and i are integer;
Correspondingly, the processor, specifically for being waited for using the 1st sequence to be encoded of R1 pairs of code check to the newer m-th
Coded sequence constitutes sequence to be encoded and carries out Polarization Coding and rate-matched, the First ray after being encoded;Alternatively, right respectively
1st sequence to be encoded to the newer M sequences to be encoded carry out Polarization Coding and rate-matched, obtain the 1st code sequence
Row are to m-th coded sequence, and after constituting the coding to the m-th coded sequence using the 1st coded sequence
First ray;Alternatively, using Ri pairs of the 1st coded sequence of code check to newer i-th sequence to be encoded carry out Polarization Coding and
After rate-matched obtains i-th of coded sequence, and the 1st coded sequence of use constitutes the coding to m-th coded sequence
First ray, wherein code check Ri is the 1/N, wherein N that the 1st sequence to be encoded of the transmitting terminal pair carries out code check when Polarization Coding
For the integer more than 1, N 2ceil(log2(i))。
22. a kind of data transmission device, which is characterized in that including:
Memory, for storing program;
Transceiver, the P symbol sebolic addressing sent for continuously receiving transmitting terminal;
Processor, the described program for executing the memory storage, when described program is performed, the processor is to P
After a symbol sebolic addressing carries out demodulation and demapping, P sequences to be decoded are obtained, wherein 0<P≤M and P are integer, and M indicates to send
End broadcasts the M symbol sebolic addressings;The P sequences to be decoded are deinterleaved, the sequence after deinterleaving is obtained;By the solution
Sequence solution rate-matched and polarization after intertexture decode, and obtain decoding result.
23. device according to claim 22, which is characterized in that when P=1, the processor, specifically for what will be received
The sequence recycled back to be decoded shifts Ti*k, obtains M the first pending sequences, wherein 1≤i≤M and i is integer,
K is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is the integer more than 0;Using preset configuration pre-decode
The M first pending sequences, obtain M metric;Cyclic shift digit Tt*k is determined according to the metric, and will
The sequence recycled back to be decoded shifts Tt*k, obtains the sequence after the deinterleaving.
24. device according to claim 23, which is characterized in that the processor, specifically for waiting for described in receiving
Decoding sequence is divided into M cross-talk sequences, wherein every cross-talk sequence includes k;The sequence recycled back to be decoded that will be received
Ti cross-talk sequences are shifted, M the first pending sequences are obtained.
25. device according to claim 22, which is characterized in that when P=1, the processor, specifically for what will be received
The sequence recycled back to be decoded shifts Ti*k, obtains M the first pending sequences, wherein 1≤i≤M and i is integer,
K is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is the integer more than 0;Each described first is waited locating
Reason sequence is divided into M cross-talk sequences, wherein every cross-talk sequence includes k;Using preset configuration default subsequence set successively
The subsequence set of each first pending sequence front end of pre-decode, obtains W*M metric, wherein described default
Subsequence set include W group, q+1 groups include 2qDuan Lianxu subsequences, the sub- sequence of the first pending sequence front end
Row set include W group, q+1 groups include 2qDuan Lianxu subsequences, 1≤2W-1≤ M and W are integer, q<W and q are to be more than or wait
In 0 integer;Cyclic shift digit Tt*k is determined according to the metric, and the sequence recycled back to be decoded is shifted
Tt*k, obtain the sequence after the deinterleaving.
26. device according to claim 22, which is characterized in that when P is more than 1, the processor, specifically for that will receive
P sequences to be decoded in the sequence recycled back displacement Tp*k to be decoded that receives of pth+1, obtain P first and wait locating
Manage sequence, wherein 1≤p≤P-1 and p are integer, and k is the integer more than 0, and Tp is the arithmetic sequence that difference is Δ, and Δ is greater than
0 integer;By all P first pending sequence soft mergings, the second pending sequence after soft merging is obtained;It will be described
Second pending sequence recycled back shifts Ti*k, obtains the pending sequence of M-P+1 third, wherein 1≤i≤M-P+1,
And p is integer;Using the pending sequence of third described in preset configuration pre-decode, M-P+1 metric is obtained;According to the measurement
Value determines cyclic shift digit Tt*k, and the sequence recycled back to be decoded is shifted Tt*k, after obtaining the deinterleaving
Sequence.
27. device according to claim 26, which is characterized in that the processor, specifically for what pth+1 was received
The sequence to be decoded is divided into M cross-talk sequences, wherein every cross-talk sequence includes k;By the sequence recycled back to be decoded
Tp cross-talk sequences are shifted, P the first pending sequences are obtained.
28. device according to claim 22, which is characterized in that when P is more than 1, the processor, specifically for that will receive
P sequences to be decoded in the sequence recycled back displacement Tp*k to be decoded that receives of pth+1, obtain P first and wait locating
Manage sequence, wherein 1≤p≤P-1 and p are integer, and k is the integer more than 0, and Tp is the arithmetic sequence that difference is Δ, Δ be more than
0 integer;By all P first pending sequence soft mergings, the second pending sequence after soft merging is obtained;It will be described
Second pending sequence recycled back shifts Ti*k, obtains the pending sequence of M-P+1 third, wherein 1≤i≤M-P+1,
And i is integer;Each pending sequence of third is divided into M cross-talk sequences, wherein every cross-talk sequence includes k;Using
The subsequence set of the default subsequence set of the preset configuration pending sequence front end of third described in pre-decode successively, obtains W*
(M-P+1) a metric, wherein the default subsequence set include W group, q+1 groups include 2qDuan Lianxu subsequences, institute
The subsequence set for stating the pending sequence front end of third include W group, q+1 groups include 2qDuan Lianxu subsequences, 1≤2W-1
≤ M and W are integer, q<W and q are the integer more than or equal to 0;Cyclic shift digit Tt*k is determined according to the metric,
And the sequence recycled back to be decoded is shifted Tt*k, obtain the sequence after the deinterleaving.
29. device according to claim 22, which is characterized in that when P=1, the processor, specifically for what will be received
The sequence recycled back to be decoded shifts Ti*k, obtains M the first pending sequences, wherein 1≤i≤M and i is integer,
K is the integer more than 0, and Ti is the arithmetic sequence that difference is Δ, wherein Δ is the integer more than 0;By the described first pending sequence
Row are as the sequence after the deinterleaving;
Correspondingly, using M first pending sequences of preset configuration pre-decode, M metric and M metric are obtained
Corresponding pre-decode result;Cyclic redundancy check (CRC) verification is carried out to the pre-decode result, it, will be described if verifying successfully
Pre-decode added as the decoding result.
30. device according to claim 22, which is characterized in that when P is more than 1, the processor, specifically for that will receive
P sequences to be decoded in the sequence recycled back displacement Tp*k to be decoded that receives of pth+1, obtain P first and wait locating
Manage sequence, wherein 1≤p≤P-1 and p are integer, and k is the integer more than 0, and Tp is the arithmetic sequence that difference is Δ;By all P
A first pending sequence soft merging, obtains the second pending sequence after soft merging;By the described second pending sequence
Recycled back shifts Ti*k, obtains the pending sequence of M-P+1 third, wherein 1≤i≤M-P+1, and p is integer;By institute
The pending sequence of third is stated as the sequence after the deinterleaving;
Correspondingly, using the pending sequence of third described in preset configuration pre-decode, M-P+1 metric and M-P+1 are obtained
The corresponding pre-decode result of metric;Cyclic redundancy check (CRC) verification is carried out to the pre-decode result, if verifying successfully,
The pre-decode was added as the decoding result.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710151022.1A CN108574562B (en) | 2017-03-14 | 2017-03-14 | Data transmission method and device |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201710151022.1A CN108574562B (en) | 2017-03-14 | 2017-03-14 | Data transmission method and device |
Publications (2)
Publication Number | Publication Date |
---|---|
CN108574562A true CN108574562A (en) | 2018-09-25 |
CN108574562B CN108574562B (en) | 2020-09-29 |
Family
ID=63578616
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201710151022.1A Active CN108574562B (en) | 2017-03-14 | 2017-03-14 | Data transmission method and device |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN108574562B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111600679A (en) * | 2020-02-24 | 2020-08-28 | 北京交通大学 | Optical communication system based on polarization interleaving |
WO2021129877A1 (en) * | 2019-12-26 | 2021-07-01 | 深圳市中兴微电子技术有限公司 | Decoding method and apparatus, network device, and storage medium |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102122966A (en) * | 2011-04-15 | 2011-07-13 | 北京邮电大学 | Channel-polarization-based encoder for staggered structure duplication code, and encoding and decoding methods thereof |
CN102694625A (en) * | 2012-06-15 | 2012-09-26 | 北京邮电大学 | Polarization code decoding method for cyclic redundancy check assistance |
CN104219019A (en) * | 2013-05-31 | 2014-12-17 | 华为技术有限公司 | Coding method and coding device |
WO2016082142A1 (en) * | 2014-11-27 | 2016-06-02 | 华为技术有限公司 | Rate matching method and apparatus for polar code, and wireless communication device |
-
2017
- 2017-03-14 CN CN201710151022.1A patent/CN108574562B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102122966A (en) * | 2011-04-15 | 2011-07-13 | 北京邮电大学 | Channel-polarization-based encoder for staggered structure duplication code, and encoding and decoding methods thereof |
CN102694625A (en) * | 2012-06-15 | 2012-09-26 | 北京邮电大学 | Polarization code decoding method for cyclic redundancy check assistance |
CN104219019A (en) * | 2013-05-31 | 2014-12-17 | 华为技术有限公司 | Coding method and coding device |
WO2016082142A1 (en) * | 2014-11-27 | 2016-06-02 | 华为技术有限公司 | Rate matching method and apparatus for polar code, and wireless communication device |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2021129877A1 (en) * | 2019-12-26 | 2021-07-01 | 深圳市中兴微电子技术有限公司 | Decoding method and apparatus, network device, and storage medium |
US11843396B2 (en) | 2019-12-26 | 2023-12-12 | Sanechips Technology Co., Ltd. | Decoding method and apparatus, network device, and storage method |
CN111600679A (en) * | 2020-02-24 | 2020-08-28 | 北京交通大学 | Optical communication system based on polarization interleaving |
CN111600679B (en) * | 2020-02-24 | 2021-11-02 | 北京交通大学 | Optical communication system based on polarization interleaving |
Also Published As
Publication number | Publication date |
---|---|
CN108574562B (en) | 2020-09-29 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108768586B (en) | A kind of method and apparatus of rate-matched | |
WO2017101631A1 (en) | Method and communication device for processing polar code | |
CN108347301B (en) | Data transmission method and device | |
CN108289010B (en) | Data processing method and device | |
CN108880566B (en) | Polar code transmission method and device | |
WO2018149332A1 (en) | Polar code transmission method and apparatus | |
CN109327226B (en) | Encoding and decoding method, device and equipment for polarization code | |
CN108809500B (en) | Coding method, device and equipment | |
CN107078853B (en) | Data processing method, device and equipment | |
CN108809332B (en) | Polar code transmission method and device | |
CN107409295B (en) | Method and device for transmitting downlink control information | |
WO2016141544A1 (en) | Information transmission method and communications device | |
CN108696333A (en) | The method, apparatus and equipment of Polar code encoding and decoding | |
CN110476357B (en) | Polarization code transmission method and device | |
CN110391874B (en) | Rate matching and rate de-matching method and device for polar code | |
CN108574562A (en) | Data transmission method and device | |
CN109391353B (en) | Method and device for rate matching | |
CN108631977A (en) | A kind of sending method and sending device of broadcast message instruction | |
CN108809504B (en) | Information transmission method and device | |
CN109088698B (en) | Coding method and communication equipment | |
CN108631915B (en) | Polar code encoding and decoding method and equipment | |
JP7471357B2 (en) | Encoding method, decoding method, and device | |
CN114513212A (en) | Polarization coding method and device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |