CN108540262A - The method and apparatus of data processing - Google Patents
The method and apparatus of data processing Download PDFInfo
- Publication number
- CN108540262A CN108540262A CN201710125204.1A CN201710125204A CN108540262A CN 108540262 A CN108540262 A CN 108540262A CN 201710125204 A CN201710125204 A CN 201710125204A CN 108540262 A CN108540262 A CN 108540262A
- Authority
- CN
- China
- Prior art keywords
- length
- sub
- bit sequence
- code block
- full
- 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.)
- Withdrawn
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/0057—Block codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
- H04L1/0007—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format by modifying the frame length
- H04L1/0008—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format by modifying the frame length by supplementing frame payload, e.g. with padding bits
-
- 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
-
- 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/0061—Error detection codes
- H04L1/0063—Single parity check
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
- Error Detection And Correction (AREA)
Abstract
One embodiment of the application provides a kind of data processing method.This method includes：Communication device is split bit sequence, obtains multiple first sub- bit sequences；Wherein, the length of some or all of first sub- bit sequence in the multiple first sub- bit sequence is not full-length；When the length of the first sub- bit sequence is not the full-length, which is filled the first sub- bit sequence, obtains the second sub- bit sequence；Wherein, the length of the second sub- bit sequence is full-length.In this way, the code check of each code block can be made close, decoding performance is improved, so as to improve system performance.
Description
Technical field
This application involves the communication technology, especially a kind of method and apparatus of data processing.
Background technology
In long term evolution (long term evolution, LTE) system, information is encoded using Trubo codes.
Due to code block (code block, CB) limited length that Trubo code coder maximums are supported, therefore propose code block segmentation skill
Art.For example, the code block length that Trubo code coder maximums are supported is 6144,6144 transmission block is more than for length
(transport block, TB), needs to be divided into multiple code blocks.It can be interpreted as length being more than 6144 bit sequence
Multiple sub- bit sequences are divided into, so as to meet requirement of the Trubo encoders for code block length.Specific dividing method
It may refer to the communication standard TS of third generation affiliate (third generation partnership project, 3GPP)
The related content of the chapters and sections 5.1.2 of 36.212v14.1.1 (2007-1).
With the development of technology, low density parity check code (low density parity are introduced in a communications system
Check code, LDPC) information is encoded.The communication system that existing code block segmentation technology is used to be encoded using LDPC
In, it is likely to result in performance decline.
Invention content
The method and apparatus for the data processing that embodiments herein provides, the performance for improving communication system.
In a first aspect, the embodiment of the present application provides a kind of method of data processing, this method includes：
Bit sequence is split, multiple first sub- bit sequences are obtained；Wherein, in the multiple first sub- bit sequence
The length of some or all of first sub- bit sequence be not full-length；
It is not that the first sub- bit sequence of full-length is filled to this, obtains the second sub- bit sequence with full-length
Row.
Optionally, the length of the second sub- bit sequence is long more than the minimum sandards of the length of the first sub- bit sequence
Degree.
Optionally, the length of the multiple first sub- bit sequence belongs to lengths sets, which includes full-length
Set and random length set.
Optionally, the length of the second sub- bit sequence belongs to the full-length set.
Optionally, this to bit sequence be split including：The bit sequence is split according to the lengths sets.
Optionally, in the lengths sets, in the partial value and the random length set in the full-length set
Partial value is adjacent.
Optionally, the length of a part of first sub- bit sequence is K in the multiple first sub- bit sequence+, another part
The length of first sub- bit sequence is K-, K+≠K-。
Optionally, K-To be less than K in the lengths sets+Maximum value.
Optionally, the value in the full-length set and matrix-expand are factor-related.
Optionally, this is transmission block to bit sequence, and the first sub- bit sequence is the first code block, which is
Second code block.
Second aspect, the embodiment of the present application also provide a kind of data processing method, including：
Bit sequence is divided into multiple sub- bit sequences by communication device according to lengths sets；
Wherein, the length of the sub- bit sequence is the length that need not be filled to the sub- bit sequence, the lengths sets packet
It includes and needs the first sub- lengths sets to the sub- bit sequence filling and the second son that need not be filled to the sub- bit sequence long
Degree set.
Optionally, the partial value of the first sub- lengths sets is distributed between the partial value of the second sub- lengths sets.
Optionally, the value in the lengths sets is relevant with low density parity check code LDPC.
Optionally, this method further includes：The communication device carries out channel coding to multiple sub- bit sequence.
Optionally, the value of the second sub- lengths sets and matrix-expand are factor-related.
Optionally, the sub- bit sequence in part in multiple sub- bit sequence includes filling bit.
The third aspect, the embodiment of the present application also provide a kind of data processing method, including：
Communication device carries out the first processing to bit sequence, obtains one or more first sub- bit sequences and one or more
A second sub- bit sequence；First processing is segmentation and the first filling or first processing is segmentation；
When the length of the first sub- bit sequence belongs to random length set, the communication device is to the first sub- bit
Sequence carries out the second filling, so that the length of the first sub- bit sequence, which is equal in full-length set, is more than the first sub- bit
The minimum value of the length of sequence；Alternatively,
When the length of the second sub- bit sequence belongs to random length set, the communication device is to the second sub- bit
Sequence carries out the second filling, so that the length of the second sub- bit sequence, which is equal in full-length set, is more than the second sub- bit
The minimum value of the length of sequence.
Optionally, the length of the first sub- bit sequence and the second sub- bit sequence belongs to lengths sets, the length collection
Conjunction includes the random length set and the full-length set.
Optionally, the value in the full-length set and matrix-expand are factor-related.
Optionally, the length of the second sub- bit sequence is to be less than the length of the first sub- bit sequence in the lengths sets
Maximum value.
Optionally, which includes to first sub- bit sequence progress second processing：The communication device this
The forefront or rearmost part of one sub- bit sequence fill N bits；Wherein, N is equal to be more than in the full-length set and be somebody's turn to do
The difference of the minimum value of the length of first sub- bit sequence and the length of the first sub- bit sequence.
Optionally, which includes to second sub- bit sequence progress second processing：
The communication device fills M bit in the forefront or rearmost part of the second sub- bit sequence；Wherein, M etc.
More than the length of the minimum value and the second sub- bit sequence of the length of the second sub- bit sequence in the full-length set
Difference.
Optionally, which includes to the first processing of bit sequence progress：The communication device to the bit sequence into
Row segmentation and filling；Alternatively, the communication device is split the bit sequence.
Fourth aspect, the embodiment of the present application also provide a kind of data processing method, including：
Transmission block is divided into multiple code blocks by communication device according to lengths sets,
The lengths sets include the first sub- lengths sets and the second sub- lengths sets, the element in the first sub- lengths sets
For full-length, the code block with full-length need not be filled, the element in the second sub- lengths sets is nonstandard
Standard length is filled the code block needs with random length；
Wherein, the length of the multiple code blocks being divided into belongs to the first sub- lengths sets.
Optionally, the value of the Partial Elements in second lengths sets is between at least one of first subset set
Between the value of two adjacent elements.
Optionally, this method further includes：The communication device carries out channel coding to multiple sub- bit sequence.
Optionally, the value of the lengths sets that need not be filled and matrix-expand are factor-related.
Optionally, the sub- bit sequence in part in multiple sub- bit sequence includes filling bit.
Optionally, this method is used for the communication system using low-density base even parity check code LDPC.
5th aspect, the embodiment of the present application provide a kind of communication device.The communication device can be used for realizing above first to
Any method of fourth aspect.The communication device can be terminal, and either baseband chip or data-signal handle core for base station
Piece or general-purpose chip.
As a kind of optional design, which includes processor.The processor is for executing first to fourth side
The function of various pieces in the either side of face.
As another optional design, which includes processor and memory.Memory is realized for storing
The program of the method for either side in first to fourth aspect, processor is for running above procedure to realize first to fourth side
The method in face.
Optionally, above-mentioned communication device may include transceiver.
6th aspect, the embodiment of the present application also provides a kind of computer program product, the program product include for realizing
First aspect to the method for fourth aspect program.
7th aspect, the embodiment of the present application also provide a kind of computer readable storage medium, which has the 6th side
The program in face.
In the technical solution of the application, by the way that code block uniform amount to be distributed in adjacent full-length, it can make not
Code check with code block is close, while filling bit number is also relatively more reasonable, helpful to the raising of decoding performance.
Description of the drawings
It, below will be to attached drawing needed in embodiment description in order to illustrate more clearly of the technical solution of the application
It is briefly described.
Fig. 1 is the rough schematic view of wireless communication system；
Fig. 2 is a kind of structure rough schematic view schematic diagram of terminal；
Fig. 3 is a kind of structure rough schematic view of base station；
Fig. 4 is a kind of schematic diagram of transmission block processing；
Fig. 5 is the schematic diagram of a kind of code block segmentation and code block cyclic redundancy verification addition part；
Fig. 6 is a kind of schematic diagram of the method for data processing；
Fig. 7 is the schematic diagram of the method for another data processing；
Fig. 8 is the schematic diagram of the method for another data processing；
Fig. 9 is the schematic diagram of the method for another data processing；
Figure 10 is the schematic diagram of the method for another data processing.
Specific implementation mode
Below in conjunction with the attached drawing in the application, embodiments herein is described.
It explains surely to some term peace treaties in the application below.
In this application, bit sequence is a kind of sequence being made of bit " 0 " and/or " 1 ".The length of bit sequence is
Refer to the quantity for the bit that bit sequence includes.Such as：Bit sequence " 0100 " include 4 bits, the length of 4.
In this application, transmission block (transport block, TB) and code block (code block, CB) can regard
For a kind of bit sequence.Code block after dividing to transmission block by obtaining, therefore the corresponding bit sequences of CB can be considered as TB
The sub- bit sequence of corresponding bit sequence.It is appreciated that with the development of technology, transmission block or code block may have different
Address.
In this application, length can be understood as the quantity of bit number or bit sometimes, be referred to as sometimes big
It is small.
In this application, bit number is properly termed as the quantity or bit sequence of the quantity of bit either bit sometimes
Length etc..
In this application, the element in set is properly termed as the item in set or the length etc. in set sometimes.It is different
Element, item or length etc. there is different values.The element, item or length etc. can also be indicated by indexing.
In the application, table is referred to as table sometimes, and set, group can be indicated by the identifiable diversified forms of communication device.
In this application, (code block) length supported when full-length refers to communication system coding, is properly termed as compiling sometimes
Primary (code block) length of code device, legal (code block) length do not need the length etc. of (second) filling.
In this application, non-standard code block length is the length for full-length, is often referred to communication system and exists
(code block) length that do not supported when coding.Sometimes it is referred to as non-protogenous (code block) length, illegal (code block) length needs
(the second) length etc. filled.
In this application, full-length set includes one or more full-lengths, and random length set includes one
Or multiple random lengths.
In this application, the difference of adjacent lengths is properly termed as spacing sometimes.For example, being combined into the collection comprising 3 elements
Example,
It can be expressed as { length 1:10, length 2:15, length 3:25 } or lower Table A or be other forms.
| Index | Value |
| 1 | 10 |
| 2 | 15 |
| 3 | 25 |
| 4 | 45 |
Table A
Wherein, the spacing between length 1 and length 2 is 5, and the spacing between long amount 2 and length 3 is 10, length 2 and 4
Spacing be 30.Length 1 and length 2 are adjacent lengths (or adjacent elements, adjacency), and length 2 and length 3 are adjacent lengths
(or adjacent element, adjacency), i.e. length 1 and length 2 are adjacent, and length 2 and length 3 are adjacent.
In this application, channel coding sometimes can be encoded referred to as.
In this application, communication device is a kind of device with communication function.Such as：Communication device can be base station,
Either terminal either baseband chip either communication chip or sensing chip etc..
In this application, the length of code block is also referred to as code block length sometimes.
In this application, term " comprising " and its deformation, which can refer to, unrestricted includes；Term "or" and its deformation can
To refer to "and/or"；Term " associated ", " relevant ", " corresponding " and their deformation can refer to " binding ",
" with ... binding ", " having mapping relations ", " configuration ", " distribution ", " being based on ... ", or " according to ... it obtains
" etc.；Term " passing through " and its deformation can refer to " utilization ", " use ", or " ... on " etc.；Term " acquisition ", " really
Calmly " and their deformation can refer to " selection ", " inquiry ", " calculating " etc.；Term " when ... " can refer to " if ",
" ... under the conditions of " etc..
Content for example in bracket " () " in this application, it may be possible to a kind of citing, or may be another expression side
Formula, it may be possible to omissible description, or may be further explanation and explanation.
The technical solution of the application can be adapted for different communication devices.The embodiment of the present application is mainly with base station and terminal
For illustrate.
The technical solution of the application can be used in wireless communication system as shown in Figure 1.As shown in Figure 1, in channel radio
Letter system includes base station B200 and terminal T100.Base station B200 can be led to using the different communication resources and terminal T100
Letter.Such as：Base station B200 can be communicated using broad beam and/or narrow beam with terminal T100.The wireless communication system can
To be 4G communication systems, such as：LTE (long term evolution, long term evolution) system, 5G communication systems, such as NR
(new radio, newly eat dishes without rice or wine) system, (such as LTE technologies and NR technological incorporation is logical for the communication system of a variety of communication technologys fusion
Letter system).
Terminal T100 is a kind of equipment with wireless communication function, can be that there is the hand-held of wireless communication function to set
Standby, mobile unit, wearable device, computing device or the other processing equipments etc. for being connected to radio modem.In difference
Network in terminal can be called different titles, such as：User equipment, mobile station, subscriber unit, platform, cellular phone are a
Personal digital assistant, radio modem, wireless telecom equipment, handheld device, laptop computer, wireless phone are wireless local
Loop board etc..
The structural schematic diagram of terminal T100 can be as shown in Figure 2.For convenience of description, Fig. 2 illustrates only the main of terminal
Component.As shown in Fig. 2, terminal T100 includes processor, memory, radio circuit, antenna and input/output unit.Processor
It is mainly used for handling communication protocol and communication data, and terminal is controlled, execute software program, processing is soft
The data etc. of part program.Memory is mainly used for storing software program and data.Radio circuit is mainly used for baseband signal and penetrates
The conversion of frequency signal and processing to radiofrequency signal.Antenna is mainly used for the radiofrequency signal of transceiving electromagnetic waveshape.It inputs defeated
Go out device, such as touch screen, display screen, keyboard etc. is mainly used for receiving data input by user and to user's output data.
The terminal of some types does not have input/output unit.
After starting up of terminal, processor can read the software program (instruction) in storage unit, explain and execute software
The instruction of program, the data of processing software program.When needing transmission data, processor is carried out to sent data at base band
After reason, radiofrequency signal will be passed through day by output baseband signal to radio circuit, radio circuit after baseband signal progress radio frequency processing
Line is sent out in the form of an electromagnetic wave.When there is data to be sent to terminal, radio circuit receives radiofrequency signal by antenna,
Radiofrequency signal is converted into baseband signal, and baseband signal is exported to processor, baseband signal is converted to data by processor
And the data are handled.
For convenience of description, Fig. 2 illustrates only a memory and processor.In actual user equipment, Ke Yicun
In multiple processors and memory.Memory is referred to as storage medium or storage device etc., and the embodiment of the present application is to this
It is not limited.
As a kind of optional realization method, processor may include baseband processor and/or central processing unit, at base band
Reason device is mainly used for handling communication protocol and communication data, and central processing unit is mainly used for controlling entire terminal
System executes software program, the data of processing software program.Processor in Fig. 2 is integrated with baseband processor and central processing unit
Function, it will be understood by those skilled in the art that baseband processor and central processing unit can also be separate processor,
It is interconnected by technologies such as buses.Optionally, terminal may include multiple baseband processor to adapt to different network formats.It is optional
, terminal may include multiple central processing units to enhance its processing capacity.It optionally, can be by baseband processor and centre
The function of reason device is integrated to be realized on one processor.Optionally, all parts of terminal can be connected by various buses.Base
Provided with processor can also be expressed as baseband processing circuitry or baseband processing chip.Central processing unit can also be expressed as centre
Manage circuit or central processing element.Optionally, the function of being handled communication protocol and communication data can be built in
It in processor, can also store in form of software programs in the memory unit, software program is executed to realize base by processor
Tape handling function.
In the embodiment of the present application, can by with transmission-receiving function antenna and radio circuit be considered as the transmitting-receiving list of terminal
Processor with processing function is considered as the processing unit of terminal by member.As shown in Fig. 2, terminal T100 includes Transmit-Receive Unit 101
With processing unit 102.Transmit-Receive Unit is referred to as transceiver, transceiver, R-T unit etc..Processing unit is referred to as locating
Device is managed, veneer, processing module, processing unit etc. are handled.Optionally, can by Transmit-Receive Unit 101 for realizing receive capabilities
Device be considered as receiving unit, the device for realizing sending function in Transmit-Receive Unit 101 is considered as transmission unit, i.e. transmitting-receiving is single
Member 101 includes receiving unit and transmission unit.Receiving unit is referred to as receiver, receiver, receiving circuit etc., sends single
Member is properly termed as transmitter, transmitter or radiating circuit etc..
Base station B200, alternatively referred to as base station equipment are that one kind being deployed in wireless access network to provide wireless communication function
Equipment.Such as：Base station in the lte networks is known as the node B (evolved NodeB, eNB or eNodeB) of evolution,
Base station in NR networks is known as TRP (transmitting-receiving point, transmission reception point) or gNB (generation
NodeB, next-generation node B).The structure of base station B200 can be as shown in Figure 3.Base station B200 shown in Fig. 3 can be split type
Base station, such as Fig. 3 keep left and show including antenna (antennas), radio frequency units (remote radio unit, RRU)
With the distributed base station of Base Band Unit (baseband unit, BBU), base station shown in Fig. 3 can also be integral type base station, example
Small station (small cell) as shown in keeping right Fig. 3.In general, base station includes 201 parts and 202 parts.201 part masters
It is used for the transmitting-receiving of radiofrequency signal and the conversion of radiofrequency signal and baseband signal；202 parts are mainly used for carrying out Base-Band Processing,
Base station is controlled etc..201 parts may be generally referred to as Transmit-Receive Unit, transceiver, transmission circuit, transceiver etc..202 parts
It may be generally referred to as processing unit.Usual 202 part is the control centre of base station.
As an alternative embodiment, 201 parts may include antenna and radio frequency unit, wherein radio frequency unit is main
For carrying out radio frequency processing.Optionally, the device for realizing receive capabilities in 201 parts can be considered as receiving unit, it will
It is considered as transmission unit for realizing the device of sending function, i.e. 201 parts include receiving unit and transmission unit.Illustratively,
Receiving unit is referred to as receiver, receiver, receiving circuit etc., transmission unit be properly termed as transmitter, transmitter or
Radiating circuit etc..
As an alternative embodiment, 202 parts may include one or more veneers, each veneer may include
Processor and memory, processor realize Base-Band Processing function for reading and executing the program in memory and to base stations
Control.If there are multiple veneers, can be interconnected between each veneer to increase processing capacity.
As another optional embodiment, with system on chip (English：System-on-chip, referred to as：SoC) skill
The development of art can be realized with the function of 202 parts and 201 parts by SoC technologies, i.e., realized by a base station functions chip, should
Devices, the programs of base station correlation function such as base station functions integrated chip processor, memory, antennal interface are stored in memory
In, program is executed to realize the correlation function of base station by processor.
In this application, communication equipment can be terminal or base station.
In communication process, the processing of transmission block is usually carried out by the processing unit of communication device.Show as one kind
Example, as shown in figure 4, may include following components for the processing of transmission block：Transport block cyclic redundancy check adds (TB
Cyclic redundancy check (CRC) attachment) part, code block segmentation and code block cyclic redundancy verification addition
The part (code block segmentation and code block CRC attachment), channel coding (channel
Coding) part and the part rate-matched (rate matching).
Wherein, transport block cyclic redundancy check addition part is mainly used for adding CRC bits for transmission block, and exports and include
The transmission block of CRC bits；Code block segmentation and code block cyclic redundancy check code addition part are mainly used for transmission block cyclic redundancy
The transmission block of verification addition part output is divided into multiple code blocks, and CRC bits are added for each code block, and exports addition CRC ratios
Special code block；Channel coding portions are mainly used for the code block of code-aiming block segmentation and code block cyclic redundancy check code addition part output
It is encoded, output includes the code block of redundant bit；Rate-matched part is mainly used for the code block exported to channel coding portions
It carries out repeating (repeat) or punches (puncture) to match the bearing capacity of physical channel.
As a kind of optional design, the processing of code block segmentation and code block cyclic redundancy verification addition part can be by code block
Dispenser is realized, dispenser can be referred to as.
As a kind of optional design, code block segmentation can be realized by code block segmentation device, code block cyclic redundancy verification addition
It can be realized by check code adder.Optionally, transport block cyclic redundancy check addition part can also be by check code adder
It realizes.
As a kind of optional design, channel coding portions can be realized by encoder.
Code block segmentation device, check code adder, encoder can be the circuits inside processing unit, or can be processing
The logical block of unit.Turbo code encoder is properly termed as using the encoder of Turbo code, uses the encoder of LDPC can be with
Referred to as LDPC encoder.Wherein, the characteristics of length of the code block of channel coding is according to different coding is carried out, certain item need to be met
Part.That is, the length for carrying out the code block of channel coding is not arbitrary length.The code block length that can be handled when channel coding can
The code block length supported when being encoded with referred to as communication system, is referred to as standard (code block) length or legal (code block) is long
Degree or primary (code block) length.In order to distinguish the code block length that different coding is related to, supported using the communication system of LDPC
Code block length is properly termed as the code block length of LDPC supports, standard (code block) length of LDPC, legal (code block) length of LDPC.
Likewise, being properly termed as the code block length of Turbo code support, Turbo using the code block length that the communication system of Turbo code is supported
Standard (code block) length of code, legal (code block) length of Turbo code.It should be noted that the same communication system can prop up
Hold a variety of codings.In such systems, when carrying out channel coding using Turbo code, code block length need to meet the mark of Turbo code
Standard length, when carrying out channel coding using LDPC, code block length need to meet the full-length of LDPC.
According to the design of different communication systems, for same coding, communication system can support multiple standards length.Example
Such as：For Turbo code, LTE system can support 188 kinds of code block lengths as shown in Table 1.Wherein, the maximum that LTE system is supported
Code block length is 6144.For another example for LDPC, communication system can be supported such as table 2, and code block is long shown in table 3 or table 4
Degree.For LDPC, communication system support maximum code block length can be 8192 either according to system design setting.It needs
Bright, communication system may have a variety of LDPC encoders to cope with different scenes, therefore be directed to different scenes communication system
Uniting the maximum code block length supported may be different.In table 1- tables 4, i indicates that the serial number of code block length, K indicate code block length.
Listed code block length may be considered the full-length of LDPC in table 2- tables 4.It should be noted that the table in the application is only
Only it is a kind of example, is not the limitation to full-length.In a communications system, the standard of actual Turbo code or LDPC
The set of length can be the above table either subset of table or including other numerical value.
As a kind of optional design, the full-length of LDPC is relevant with matrix-expand factor Z.Such as：Define LDPC
Basic matrix includes that mb rows and nb are arranged, and defines information bit columns kb=mb-nb, the value for the spreading factor Z which supports
Ranging fromThen the full-length of the LDPC code is expressed as K=kb × Zi, 0≤i ＜
imax.Optionally, the same LDPC encoder can support multiple LDPC basic matrixs and spreading factor value range, pass through these
The length that LDPC basic matrixs and spreading factor value range are calculated, can be seen as the full-length of the LDPC encoder.
| i | K | i | K | i | K | i | K |
| 1 | 40 | 48 | 416 | 95 | 1120 | 142 | 3200 |
| 2 | 48 | 49 | 424 | 96 | 1152 | 143 | 3264 |
| 3 | 56 | 50 | 432 | 97 | 1184 | 144 | 3328 |
| 4 | 64 | 51 | 440 | 98 | 1216 | 145 | 3392 |
| 5 | 72 | 52 | 448 | 99 | 1248 | 146 | 3456 |
| 6 | 80 | 53 | 456 | 100 | 1280 | 147 | 3520 |
| 7 | 88 | 54 | 464 | 101 | 1312 | 148 | 3584 |
| 8 | 96 | 55 | 472 | 102 | 1344 | 149 | 3648 |
| 9 | 104 | 56 | 480 | 103 | 1376 | 150 | 3712 |
| 10 | 112 | 57 | 488 | 104 | 1408 | 151 | 3776 |
| 11 | 120 | 58 | 496 | 105 | 1440 | 152 | 3840 |
| 12 | 128 | 59 | 504 | 106 | 1472 | 153 | 3904 |
| 13 | 136 | 60 | 512 | 107 | 1504 | 154 | 3968 |
| 14 | 144 | 61 | 528 | 108 | 1536 | 155 | 4032 |
| 15 | 152 | 62 | 544 | 109 | 1568 | 156 | 4096 |
| 16 | 160 | 63 | 560 | 110 | 1600 | 157 | 4160 |
| 17 | 168 | 64 | 576 | 111 | 1632 | 158 | 4224 |
| 18 | 176 | 65 | 592 | 112 | 1664 | 159 | 4288 |
| 19 | 184 | 66 | 608 | 113 | 1696 | 160 | 4352 |
| 20 | 192 | 67 | 624 | 114 | 1728 | 161 | 4416 |
| 21 | 200 | 68 | 640 | 115 | 1760 | 162 | 4480 |
| 22 | 208 | 69 | 656 | 116 | 1792 | 163 | 4544 |
| 23 | 216 | 70 | 672 | 117 | 1824 | 164 | 4608 |
| 24 | 224 | 71 | 688 | 118 | 1856 | 165 | 4672 |
| 25 | 232 | 72 | 704 | 119 | 1888 | 166 | 4736 |
| 26 | 240 | 73 | 720 | 120 | 1920 | 167 | 4800 |
| 27 | 248 | 74 | 736 | 121 | 1952 | 168 | 4864 |
| 28 | 256 | 75 | 752 | 122 | 1984 | 169 | 4928 |
| 29 | 264 | 76 | 768 | 123 | 2016 | 170 | 4992 |
| 30 | 272 | 77 | 784 | 124 | 2048 | 171 | 5056 |
| 31 | 280 | 78 | 800 | 125 | 2112 | 172 | 5120 |
| 32 | 288 | 79 | 816 | 126 | 2176 | 173 | 5184 |
| 33 | 296 | 80 | 832 | 127 | 2240 | 174 | 5248 |
| 34 | 304 | 81 | 848 | 128 | 2304 | 175 | 5312 |
| 35 | 312 | 82 | 864 | 129 | 2368 | 176 | 5376 |
| 36 | 320 | 83 | 880 | 130 | 2432 | 177 | 5440 |
| 37 | 328 | 84 | 896 | 131 | 2496 | 178 | 5504 |
| 38 | 336 | 85 | 912 | 132 | 2560 | 179 | 5568 |
| 39 | 344 | 86 | 928 | 133 | 2624 | 180 | 5632 |
| 40 | 352 | 87 | 944 | 134 | 2688 | 181 | 5696 |
| 41 | 360 | 88 | 960 | 135 | 2752 | 182 | 5760 |
| 42 | 368 | 89 | 976 | 136 | 2816 | 183 | 5824 |
| 43 | 376 | 90 | 992 | 137 | 2880 | 184 | 5888 |
| 44 | 384 | 91 | 1008 | 138 | 2944 | 185 | 5952 |
| 45 | 392 | 92 | 1024 | 139 | 3008 | 186 | 6016 |
| 46 | 400 | 93 | 1056 | 140 | 3072 | 187 | 6080 |
| 47 | 408 | 94 | 1088 | 141 | 3136 | 188 | 6144 |
Table 1
| i | K | i | K |
| 1 | 64 | 16 | 896 |
| 2 | 80 | 17 | 1024 |
| 3 | 96 | 18 | 1280 |
| 4 | 112 | 19 | 1536 |
| 5 | 128 | 20 | 1792 |
| 6 | 160 | 21 | 2048 |
| 7 | 192 | 22 | 2560 |
| 8 | 224 | 23 | 3072 |
| 9 | 256 | 24 | 3584 |
| 10 | 320 | 25 | 4096 |
| 11 | 384 | 26 | 5120 |
| 12 | 448 | 27 | 6144 |
| 13 | 512 | 28 | 7168 |
| 14 | 640 | 29 | 8192 |
| 15 | 768 |
Table 2
| i | K | i | K |
| 1 | 128 | 14 | 1280 |
| 2 | 160 | 15 | 1536 |
| 3 | 192 | 16 | 1792 |
| 4 | 224 | 17 | 2048 |
| 5 | 256 | 18 | 2560 |
| 6 | 320 | 19 | 3072 |
| 7 | 384 | 20 | 3584 |
| 8 | 448 | 21 | 4096 |
| 9 | 512 | 22 | 5120 |
| 10 | 640 | 23 | 6144 |
| 11 | 768 | 16 | 7168 |
| 12 | 896 | 17 | 8192 |
| 13 | 1024 |
Table 3
| i | K | i | K | i | K | i | K |
| 1 | 48 | 15 | 288 | 29 | 960 | 43 | 3328 |
| 2 | 64 | 16 | 320 | 30 | 1024 | 44 | 3584 |
| 3 | 80 | 17 | 352 | 31 | 1152 | 45 | 3840 |
| 4 | 96 | 18 | 384 | 32 | 1280 | 46 | 4096 |
| 5 | 112 | 19 | 416 | 33 | 1408 | 47 | 4608 |
| 6 | 128 | 20 | 448 | 34 | 1536 | 48 | 5120 |
| 7 | 144 | 21 | 480 | 35 | 1664 | 49 | 5632 |
| 8 | 160 | 22 | 512 | 36 | 1792 | 50 | 6144 |
| 9 | 176 | 23 | 576 | 37 | 1920 | 51 | 6656 |
| 10 | 192 | 24 | 640 | 38 | 2048 | 52 | 7168 |
| 11 | 208 | 25 | 704 | 39 | 2304 | 53 | 7680 |
| 12 | 224 | 26 | 768 | 40 | 2560 | 54 | 8192 |
| 13 | 240 | 27 | 832 | 41 | 2816 | 55 | |
| 14 | 256 | 28 | 896 | 42 | 3072 | 56 |
Table 4
Work as input for code block segmentation and code block cyclic redundancy verification addition part as a kind of optional design
The code length of code block segmentation and the transmission block of code block cyclic redundancy verification addition part is more than the maximum code block length that communication system is supported
When spending, transmission block can be divided into the code block of 2 kinds of code block lengths.Such as：There are 4 code blocks after segmentation, wherein the length of 3 code blocks
Degree is 5504, and the length of another 1 code block is 5568.The longer code block of code block length can be referred to as longer code block, code block length
Shorter code block can be referred to as compared with short code block.
For convenience of description, the length of longer code block can be expressed as K+, the length of shorter code block can be expressed as
K-；The quantity of longer code block can be expressed as C+, the quantity of shorter code block can be expressed as C-；The sum of code block can be with table
It is shown as C, C=C++C-；B indicates the length of input code block segmentation and the transmission block of code block cyclic redundancy verification addition part；Z is indicated
The maximum code block length that communication system is supported；L is expressed as the quantity of the CRC bits of each code block addition；Expression takes upwards
It is whole；Indicate downward rounding；B ' is expressed as the sum of the length after each code block addition CRC bits, B '=B+CL.
As shown in figure 5, the processing of code block segmentation and code block cyclic redundancy verification addition part includes mainly with lower part.It is right
In the scheme of code block segmentation, the embodiment of the present application provides three kinds of optional designs.For convenience of description, above-mentioned three kinds it is optional
Design will be illustrated in conjunction with various pieces shown in fig. 5.It should be noted that the various pieces of above-mentioned three kinds of designs, also may be used
To be combined or replace according to system needs.It is further to note that the number of following sections is not meant to
Sequencing in time can be adjusted according to actual conditions.
S101：Determine the quantity of the code block after transmission block segmentation.
Such as：It can basisTo determine the quantity of code block.Optionally, which is to be added to biography
The transmission block of defeated piece of CRC code, for example, B=Bo+LTB, wherein BoIndicate the length of the transmission block before carrying out CRC additions, LTBTable
Show the quantity of transmission block CRC bits.Optionally, which is the transmission for being added to transmission block CRC code and code block group CRC code
Block, for example, B=Bo+LTB+NCBG·LCB, wherein BoIndicate the length of the transmission block before carrying out CRC additions, LTBIndicate transmission block
The quantity of CRC bits, LCBIndicate the quantity of code block group CRC bits, NCBGIndicate the quantity of code block group.One transmission block can divide
It can be needed to be designed according to system at multiple a code block groups.
Optionally, first in the third optional design, may be used above-mentionedTo determine code block
Quantity.
Optionally, first in the third optional design, can be rightIt is deformed to determine code
The quantity of block.For example, not determining the quantity of code block using the maximum code block size of system support.Optionally, Z can be replaced
For Zv, ZvIndicate equivalent code block length, equivalent code block length can be determined according to the equivalent code check of transmission block, i.e., by code block
Quantity is associated with the foundation of the equivalent code check of transmission block.
S102：Determine the length of longer code block.
It, can be in the code block length that communication system is supported, i.e., in standard code block length in the first optional design
In, obtain length of the minimum code block length for meeting CK >=B ' as longer code block.Such as：It, can be in table for Turbo code
Selector closes the K values of above-mentioned condition as K in 1+；For LDPC, the K values of selector conjunction above-mentioned condition can make in table 2-4
For K+。
In second of optional design, K is obtained1, K1Equal to meeting CK1The smallest positive integral value of >=B ', in standard code block
It is obtained in length and meets K >=K1Minimum K values as K+.For example, for LDPC, selector closes the K of above-mentioned condition in table 2-4
Value.It optionally, can also be directly by K in second of optional design1As K+.K at this time+May be full-length or non-
Standard code block length (abbreviation random length).
The third it is optional design, random length can be selected as the length of longer code block, i.e., longer code block
Length can be full-length, or can be with criteria of right and wrong length.Such as：For LDPC, satisfaction can be obtained in following table 5
The most K values of CK >=B ' are as K+。
It should be noted that in first and the third optional design, if CK+=B ', then it represents that the transmission block
It can be partitioned into isometric code block, at this point, C+The length of=C, each code block are K+；In second of optional design, if
C·K+=B ', then it represents that the transmission block can be partitioned into isometric code block, at this point, C+The length of=C, each code block are K+。
S103：Determine the length compared with short code block.
It, can be in the code block length that communication system is supported, i.e., in standard code block length in the first optional design
In, acquisition meets K ＜ K+Maximum code block length as the length compared with short code block.Such as：It, can be in table 1 for Turbo code
Selector closes the K values of above-mentioned condition as K-, for LDPC, the K values of above-mentioned condition can be closed as K by selector in table 2-4+。
In second of optional design, K is obtained2, K2=K1- 1, it is obtained in standard code block length and meets K >=K2Most
Small K values are as K-.It optionally, can be by K2As K-, K at this time-It may be full-length either random length.
In the third optional design, random length can be selected as the length compared with short code block, i.e., compared with short code block
Length can be full-length, or can be with criteria of right and wrong length.Such as：For LDPC, can be obtained in following table 5 full
Sufficient K ＜ K+Maximum K values as K-。
Below to the parts S102 and S103, selected in the third optional design random length or full-length as
The length of longer code block does some illustrations compared with the scheme of the length of short code block.
As shown in table 5, include the full-length of random length and table 4 in table 5.Multiple random lengths can be with
Referred to as random length set, multiple full-lengths are properly termed as full-length set.Table 5 is properly termed as lengths sets, the length
Degree set includes full-length set and random length set.Full-length set and random length set can also volume claim
For the sub- lengths sets of lengths sets.Lengths sets are provided according to system design definition, or by communication standard, that is, are being received
Lengths sets are all known in advance in side and sending side, or generate the rule of lengths sets.Lengths sets can be one or more,
At different conditions, different lengths sets, full-length set or random length set can be used.
Optionally, the value in random length set can be generated according to the value in full-length set.For example, non-
When full-length is in a threshold range, the spacing between multiple random lengths is smaller, when random length is at another
When in threshold range, the spacing between multiple random lengths is larger.Above-mentioned threshold value can be formulated according to full-length.
It should be noted that table 5 is only a kind of example, it is not the limit of the full-length and random length to LDPC
System.In a communications system, the full-length of LDPC and the set of random length can be table 5 either the subset of table 5 or
Including other numerical value.
Table 5
In the third optional design, it can be obtained in random length and full-length and meet CK >=B ' most
Length of the small code block length as longer code block.Such as：For LDPC, selector it can close the K values of above-mentioned condition in table 5 and make
For K+。
In optionally being designed in third, it can be obtained in random length and full-length and meet K ＜ K+Maximum
Code block length is as the length compared with short code block.Such as：For LDPC, the K value conducts of above-mentioned condition can be closed by selector in table 5
K-。
Since the interval of the full-length of LDPC is larger, when using the first optional design, K+And K-Difference compared with
Greatly, the code check that may result in different code blocks has larger difference.When using second or the third optional design, K+
And K-Difference it is more suitable, may subtract for the code check difference that the code check difference of different code blocks is optionally designed compared with the first
It is small, the performance of better system can be obtained.
S104：Determine the quantity compared with short code block.
The first in the third optional design, compared with the quantity C of short code block-It can pass throughCome
It obtains, wherein ΔK=K+-K-。
In second of optional design, compared with the quantity C of short code block-C can be passed through-=CK1- B ' is obtained.
S105：Determine the quantity of longer code block.
At the first, in second and the third optional design, the quantity C of longer code block+C can be passed through+=C-C-Come
It obtains.
S106：It is filled, the bit of transmission block is divided into each code block by code block cyclic redundancy verification addition.
Each code block can be usedIt indicates, whereinrIndicate code block number, Kr- 1 indicates in code block
Bit number, KrIndicate that code block number isrCode block length, i.e. Kr=K+Or K-。
The first in the third optional design, if C+·K++C-·K-＞ B ' need to be filled, filling
Bit number F is equal to C+·K++C-·K--B′.Here filling can be understood as the filling of code-aiming block, it is understood that for passing
Defeated piece of filling.The bit of filling can design as needed in transmission block or code position in the block, the application to this not
It is restricted.For example, can be filled in the forefront or rearmost part of transmission block, i.e. first code block and the last one code block
It is filled, it can be in forefront or the rearmost part filling of first code block.Such as：c0k=＜ NULL ＞, k=0...F-1,
Wherein c0kIndicate that k-th of bit of first code block, ＜ NULL ＞ expressions are filled.Optionally, if C+·K++C-·K_
=B ', without being filled to corresponding code block.
In second of optional design, if K_＞ K1, need to being filled compared with short code block, the bit number F of filling1
Equal to K--K1；Work as K+＞ K2When, it needs to be filled longer code block, the bit number F of filling2Equal to K+-K2.It is filled out in code block
The position the application filled is not restricted this.Such as：It can be filled in the rearmost part of code block, for compared with short code block：crk=
＜ NULL ＞, k=K2...K_- 1, r=0...C_- 1, and for longer code block：crk=＜ NULL ＞, k=K1...K+-1,r
=C_...C+-1.Optionally, if K-=K1Or K+=K2, without being filled to corresponding code block.
In this application, the filling in the parts S106 is properly termed as the first filling.
Optionally, above-mentioned first in the third optional design, is expressed as the bit of ＜ NULL ＞ in coding, can be with
It is considered as value 0, row corresponding with the bit for being expressed as ＜ NULL ＞ in matrix can also be deleted in coding, be deleted using by row
Matrix after removing encodes input bit section.
Optionally, in above-mentioned first to the third optional design, being expressed as the bit of ＜ NULL ＞ can encode
Device is skipped when generating output bit section, can be also skipped when rate-matched generates output bit section.
Optionally, the operation filled in above-mentioned S106 can realize (as shown in Figure 5) by independent tucker.The tucker
It can be the circuit inside processing unit, or can be the logical block of processing unit.
Above-mentioned first to the third in optional design, the bit of transmission block can be divided into each according to algorithms of different
In code block.For example, may refer to the related content of the chapters and sections 5.1.2 of the standard 36.212v14.1.1 (2017-1) of 3GPP.
In above-mentioned first to the third optional design, the algorithm of CRC bits is added for code block to be made as needed
It is fixed.For example, may refer to the related content of the chapters and sections 5.1.2 of the standard 36.212v14.1.1 (2017-1) of 3GPP.
For the first it is optional design, be full-length in the length of the code block of the parts S106 output, can directly into
Row coded treatment.
Second of optional design is not necessarily to when the code block length of the parts S106 output is full-length into traveling
The filling of one step, when the code block length criteria of right and wrong length of the parts S106 output, can be filled further with regard to carrying out coded treatment,
So that code block length is full-length.
For the third it is optional design, may be random length in the code block length of the parts S106 output, need into
The further filling of row, so that code block length is full-length.Such as S201.
S201：Code-aiming block length is that the code block of random length is filled, so that the length of code block is full-length.
In the third optional design, if KrFor random length, such as can be in the full-length set of table 5
Obtain K ＞ KrMinimum K values as filling after code block length, use Korg,rIt indicates.The bit number F of fillingrEqual to Korg,r-Kr。
Such as：When the length of longer code block is not full-length, the bit number of filling is K+org,r-K+；When the length of shorter code block
When degree is not full-length, the bit number of filling is K-org,r-K-.Wherein, K+org,rIndicate K ＞ K in full-length set+Most
Small K values；K-org,rIndicate K ＞ K in full-length set_Minimum K values.
It optionally, can either rearmost part or other positions be filled in the forefront of code block.For example, in code block
Rearmost part be filled, crk=＜ NULL ＞, k=Kr...Korg,r-1。
In this application, the filling in S201 is properly termed as the second filling.
Optionally, the second filling can be realized in code block segmentation device, can either realize in the encoder or can be with
(as shown in Figure 4) is realized by independent tucker.The tucker can be the circuit inside processing unit, or can be processing
The logical block of unit.
The bit number filled in the third optional design is likely less than the bit number filled in second of optional design,
Help to improve decoding performance.
Optionally, it is partially shown as the bit of ＜ NULL ＞ in S201 in coding, value 0 can be considered as.When the parts S201
When carrying out in the encoder, encoder skips the bit for being expressed as ＜ NULL ＞ when being exported in coding result.Such as：By compiling
Code code block beNrNumber is the length of r code blocks after presentation code, then the code of output coder
Block isThe code block that ＜ NULL ＞ are partially shown as in S201 is skipped when wherein exporting.
Optionally, for second of optional design, the filling of the parts S106 can also be carried out by encoder.At this point, compiling
Code device skips the bit for being expressed as ＜ NULL ＞ when being exported in coding result.
Optionally, K is worked as second of optional design in the parts S201+Or K_For random length when, Ke Yican
The third design is examined, the second filling is carried out.
Optionally, it can be skipped when S201 is partially shown as the bit of ＜ NULL ＞ in rate-matched, or can be
It is skipped when encoder output.
Above-mentioned second optional design can make different code blocks by reducing the difference between different code block lengths
Code check is close or identical, to improve system performance.
The third above-mentioned optional design, by the way that code block uniform amount to be distributed in adjacent full-length, can make
The code check of different code blocks is close, while filling bit number is also relatively more reasonable, helpful to the raising of decoding performance.
It should be noted that above-mentioned check code is by taking CRC as an example, with the development of technology, can by other check codes Lai
Substitute above-mentioned CRC bits.It should be noted that with the development of technology, code block may be grouped, school is added for code block group
Test code, i.e. code block group check code.It should be noted that in the above technical solution, it is also possible to not add check code.
It should be noted that the above process illustratively illustrates the code block segmentation and coding of sending side, and it is corresponding, it receives
Side needs to be cascaded into row decoding and code block according to above-mentioned technical proposal.In the first optional design, when solving rate-matched,
The bit of filling can be backfilling into corresponding position to carry out the CRC of code block, and the bit that removal is filled before code block cascades.
It,, can be by the ratio of filling when solving rate-matched when the first filling does not carry out in the encoder in second of optional design
Spy is backfilling into corresponding position to carry out the CRC of code block, and the bit that removal is filled before code block cascades；When first filling be
It is carried out in encoder, then filling bit can be backfilling into corresponding position by decoder, and after the completion of decoding, output decoding knot
Filling bit is removed before fruit.In the third optional design, when solving rate-matched, the bit of the first filling can be backfilling into pair
To carry out the CRC of code block, and the bit that removal first is filled before code block cascades, decoder can be by the second filling for the position answered
Bit is backfilling into corresponding position, after the completion of decoding, the bit of the second filling of removal before output decoding result.
For the clearer technical solution for illustrating the application, below from different perspectives to technical solution shown in fig. 5 into
Row description.
The embodiment of the present application provides a kind of method of data processing, as shown in Figure 6.Principle, the effect of method shown in fig. 6
Etc. the explanation that can optionally be designed with the third in technical solution shown in reference chart 5 of contents.
This method includes：
S301：Communication device carries out the first processing to bit sequence, obtains one or more first sub- bit sequences and one
A or multiple the second sub- bit sequence；
Wherein, S301 may refer to the explanation that the third in the parts S106 optionally designs in technical solution shown in Fig. 5.
S302：If the length of the first sub- bit sequence belongs to random length set, the communication device to this first
Sub- bit sequence carries out second processing so that the length of the first sub- bit sequence be equal in full-length set be more than this first
The minimum value of the length of sub- bit sequence；Alternatively,
If the length of the second sub- bit sequence belongs to random length set, the communication device is to the second sub- bit
Sequence carries out second processing, so that the length of the second sub- bit sequence, which is equal in full-length set, is more than the second sub- bit
The minimum value of the length of sequence.
Wherein, S301 may refer to the explanation of the parts S201 in technical solution shown in Fig. 5.
Optionally, the first sub- bit sequence can be the longer code block in scheme shown in Fig. 5, and the second sub- bit sequence can
To be the shorter code block in scheme shown in Fig. 5.
Optionally, the quantity of one or more first sub- bit sequences can be the C in scheme shown in Fig. 5+, one or more
The quantity of a second sub- bit sequence can be the C in scheme shown in Fig. 5_.Such as：Communication device can be according to long including standard
The lengths sets of degree set and random length set obtain the length and the second sub- bit sequence of the first sub- bit sequence
The length of length, i.e., the length of the first sub- bit sequence and the second sub- bit sequence belongs to lengths sets.
Optionally, the length of the first sub- bit sequence can be the K in scheme shown in Fig. 5+, the length of the second sub- bit sequence
Degree can be the K in scheme shown in Fig. 5_.Such as：The length of second sub- bit sequence is to be less than the first son in full-length set
The length of the maximum value of bit sequence length, i.e., the length of the second sub- bit sequence and the first sub- bit sequence is in full-length collection
It is adjacent in conjunction.
C+, C_, K+, K_Acquisition can refer to that the third in technical solution shown in fig. 5 is optional to be designed.
Optionally, the first processing can be the S106 in scheme shown in Fig. 5, i.e., the first processing includes being drawn to bit sequence
Point, optional first processing can also include the first filling.Those skilled in the art are, it should be understood that the length when bit sequence is exactly
When the sum of the length of the sub- bit sequence of full-length, the first filling need not be carried out.
Optionally, full-length set can be the full-length set in table 5 or the full-length set in table 5
Subset or 3GPP standards as defined in LDPC full-length set.
Optionally, random length set can be random length collection in random length set or table 5 in table 5
The random length set of LDPC as defined in the subset or 3GPP standards of conjunction.
Optionally, the codomain matrix-expand of full-length set is factor-related.
Optionally, the length of the first sub- bit sequence, which belongs to random length set, can be expressed as the first sub- bit sequence
Length be random length, the length that can be either expressed as the first sub- bit sequence is not full-length or can be with table
The length stated as the first sub- bit sequence is not belonging to full-length set.
Optionally, the length of the second sub- bit sequence, which belongs to random length set, can be expressed as the second sub- bit sequence
Length be random length, the length that can be either expressed as the second sub- bit sequence is not full-length or can be with table
The length stated as the second sub- bit sequence is not belonging to full-length set.
Optionally, second processing is the second filling.
Optionally, the length of the first sub- bit sequence after the second filling can be the K in scheme shown in Fig. 5+org,r, the
The bit number of two fillings can be the K in scheme shown in Fig. 5+org,r-K+.The bit number of i.e. second filling is full-length set
In be more than the first sub- bit sequence length minimum value and the first sub- bit sequence length difference.
Optionally, the length of the second sub- bit sequence after the second filling can be the K in scheme shown in Fig. 5-org,r, the
The bit number of two fillings can be the K in scheme shown in Fig. 5-org,r-K_.The bit number of i.e. second filling is full-length set
In be more than the second sub- bit sequence length minimum value and the second sub- bit sequence length difference.
Optionally, which can be base station, terminal or chip.
The embodiment of the present application provides a kind of method of data processing, as shown in Figure 7.Principle, the effect of method shown in Fig. 7
Etc. the explanation that can optionally be designed with the third in technical solution shown in reference chart 5 of contents.
This method includes：
S401：Determine the length and quantity of the first sub- bit sequence；
S402：Determine the length and quantity of the second sub- bit sequence；
Wherein, it is optional to may refer to the third in the part of S102-S105 in technical solution shown in Fig. 5 by S401-S402
The explanation of design.
S403：Generate one or more first sub- bit sequences and one or more second sub- bit sequences.
Wherein, S403 may refer to the explanation that the third in the parts S106 optionally designs in technical solution shown in Fig. 5.
Optionally, the first sub- bit sequence can be longer code block in technical solution shown in Fig. 5, the second sub- bit sequence
It can be code block shorter in technical solution shown in Fig. 5.
Optionally, the length of the first sub- bit sequence can be the K in technical solution shown in Fig. 5+, the second sub- bit sequence
Length can be K in technical solution shown in Fig. 5_。
Optionally, the quantity of the first sub- bit sequence can be the C in technical solution shown in Fig. 5+, the second sub- bit sequence
Quantity can be C in technical solution shown in Fig. 5_。
Optionally, the length of the first sub- bit sequence is random length or full-length；Second sub- bit sequence
Length is random length or full-length.That is the length of the sub- bit sequence of the parts S401 and the parts S402 can be based on packet
The lengths sets of full-length set and random length set are included to determine.Optionally, S401 can be expressed as in length collection
Determine that the length of the first sub- bit sequence, S402 can be expressed as determining the length of the second sub- bit sequence in lengths sets in conjunction
Degree；Wherein, lengths sets include full-length set and random length set.
Optionally, about lengths sets, full-length set, random length set can be with skill shown in reference chart 5 or Fig. 6
The explanation of art scheme.
Optionally, it generates the first sub- bit sequence and the second sub- bit sequence may include：
1) bit sequence divide and first fills；Alternatively,
2) bit sequence is divided.
It divides and the related content of the first filling can be with the content of technical solution shown in reference chart 5 and Fig. 6.
" generate the first sub- bit sequence and the second sub- bit sequence " can also be expressed as to bit sequence into
Row segmentation, obtains the first sub- bit sequence and the second sub- bit sequence
Optionally, this method can also include S404.
S404：If the length of the first sub- bit sequence belongs to random length set, the communication device to this first
Sub- bit sequence carries out second processing so that the length of the first sub- bit sequence be equal in full-length set be more than this first
The minimum value of the length of sub- bit sequence；Alternatively,
If the length of the second sub- bit sequence belongs to random length set, the communication device is to the second sub- bit
Sequence carries out second processing, so that the length of the second sub- bit sequence, which is equal in full-length set, is more than the second sub- bit
The minimum value of the length of sequence.
Wherein, second processing can be expressed as the second filling.
The explanation of S404 relevant portions can be with the related content in S302 in reference chart 6.
The embodiment of the present application also provides a kind of method of data processing, as shown in Figure 8.Principle, the effect of method shown in Fig. 8
The explanation that the contents such as fruit can optionally be designed with the third in technical solution shown in reference chart 5.
This method includes：
S501：Transmission block is divided into multiple code blocks by communication device according to lengths sets.
The lengths sets include the first sub- lengths sets and the second sub- lengths sets, the element in the first sub- lengths sets
For full-length, the code block with full-length need not be filled, the element in the second sub- lengths sets is nonstandard
Standard length is filled the code block needs with random length；
Wherein, the length of the multiple code blocks being divided into belongs to the first sub- lengths sets.
Wherein, the code block of S501 being divided into refers to the code block (sub- bit sequence) of the parts S201 output in Fig. 5.S501's
Segmentation can be understood as including the division to bit sequence, further include the first filling or the second filling.The realization of S501 can be with
Referring to the parts S106 and S201.Optionally, the segmentation of S501 can also include some or all of in S101~S105.About
The quantity of code block length, quantity, longer code block, the content compared with the quantity of short code block can refer to the parts S101-S105.
Optionally, the value in the first sub- lengths sets and matrix-expand are therefore relevant.
Optionally, the multiple codes being divided into it is in the block it is some or all of may include filling bit.Such as it can be with
It is the filling bit of the first filling and/or the filling bit of the second filling.
Optionally, the value of the Partial Elements in second lengths sets in first subset set at least
Between the value of one adjacent two element.For example, being distributed in table 5, between full-length one or more non-standard
Length.
Optionally, this method further includes：
S502：Communication device carries out channel coding to the multiple sub- bit sequence.
It can be with reference to the explanation about channel coding behind the parts S201 for the related description of channel coding.
Optionally, S501 can be realized by dispenser, or can be realized by dispenser and encoder.
Optionally, S502 can be realized by encoder.
The embodiment of the present application also provides a kind of method of data processing, as shown in Figure 9.Principle, the effect of method shown in Fig. 9
The explanation that the contents such as fruit can optionally be designed with the third in technical solution shown in reference chart 5.
S601：Bit sequence is split, multiple first sub- bit sequences are obtained；Wherein, the multiple first sub- bit
The length of some or all of first sub- bit sequence in sequence is not full-length；
Wherein, the multiple first sub- bit sequences that the parts S601 obtain can be the code block obtained after S106.S601's says
It is bright to refer to the parts S106.Optionally, the parts S601 can also include the part of S101-S105, that is, include code block quantity
It determines, the contents such as determination of code block length.
S602：It is not that the first sub- bit sequence of full-length is filled to this, obtains the second son with full-length
Bit sequence.
Wherein, the parts S602 can refer to the content of the parts S201.
It should be noted that the second sub- bit sequence with full-length can be expressed as：Second sub- bit sequence
Length is full-length.
Optionally, the length of the second sub- bit sequence is long more than the minimum sandards of the length of the first sub- bit sequence
Degree.
Optionally, the length of the multiple first sub- bit sequence belongs to lengths sets, which includes full-length
Set and random length set.
Optionally, the length of the second sub- bit sequence belongs to the full-length set.
Optionally, this to bit sequence be split including：The bit sequence is split according to the lengths sets.
That is, the length of the bit sequence after segmentation will belong to the lengths sets.
Optionally, in the lengths sets, in the partial value and the random length set in the full-length set
Partial value is adjacent.
Optionally, the length of a part of first sub- bit sequence is K in the multiple first sub- bit sequence+, another part
The length of first sub- bit sequence is K-, K+≠K_。
Optionally, K_To be less than K in the lengths sets+Maximum value.
Optionally, the value in the full-length set and matrix-expand are factor-related.
Optionally, this is transmission block to bit sequence, and the first sub- bit sequence is the first code block, which is
Second code block.
Optionally, above-mentioned lengths sets can be the set of such as table 5, and full-length set can be each mark in table 5
The set that standard length is constituted, random length can be the set that each random length is constituted in table 5.
Optionally, the executive agent for executing this method can be communication equipment, and communication equipment can be base station or terminal.
The embodiment of the present application also provides a kind of method of data processing, as shown in Figure 10.The principle of method shown in Fig. 10,
The contents such as effect can be with second of explanation optionally designed in technical solution shown in reference chart 5.
This method includes：
S701：Determine the length and quantity of the length and quantity and the second sub- bit sequence of the first sub- bit sequence.
S702：Bit sequence is split.
S703：The first sub- bit sequence of communication device pair is filled.
S704：The second sub- bit sequence of communication device pair is filled.
Optionally, the first sub- bit sequence can be longer code block, and the second sub- bit sequence can be shorter code block.
Optionally, the length of the first sub- bit sequence can be the K in technical solution shown in Fig. 5+, the first sub- bit sequence
Quantity can be C in technical solution shown in Fig. 5+, the length of the second sub- bit sequence can be in technical solution shown in Fig. 5
K-, the quantity of the first sub- bit sequence can be the C in technical solution shown in Fig. 5-,
C+, C-, K+, K-Acquisition can refer to second of optional design in technical solution shown in fig. 5.
What the parts S702~S704 may refer in technical solution shown in fig. 5 in the parts S106 optionally to design for second
Explanation.
The parts S703 and S704 can be realized by dispenser, can also be realized by encoder.
The embodiment of the present application also provides a kind of communication device, can be used as the third in Fig. 5 is optional to design, Fig. 6, Fig. 7,
Communication device in Fig. 8 and Fig. 9, for realizing the method for data processing provided by the embodiments of the present application.The knot of the communication device
Structure can be as shown in Fig. 2 or Fig. 3.Optionally, which can be base station or terminal.
As a kind of optional embodiment, processing unit 102 can be used for realizing that the third in Fig. 5 is optional and design, Fig. 6,
The above method in Fig. 7, Fig. 8 and Fig. 9.
As another optional embodiment, the memory of communication device, which can be used for storing, realizes that the third in Fig. 5 can
The design of choosing, Fig. 6, Fig. 7, the program of the above method in Fig. 8 and Fig. 9.Processing unit 102 is used to execute the program in memory
To realize the correlation function of data processing.
The embodiment of the present application also provides a kind of chip, can be used as the third in Fig. 5 is optional to design, Fig. 6, Fig. 7, Fig. 8
With the communication device in Fig. 9, for realizing the method for data processing provided by the embodiments of the present application.The chip may include segmentation
Device and encoder.The optional chip can also include check code adapter.How are dispenser, encoder and check code dispenser
The method for realizing data processing provided by the embodiments of the present application may refer to the third in Fig. 5 and optionally design, Fig. 6, Fig. 7, Fig. 8
With the explanation of technical solution in Fig. 9.
The embodiment of the present application also provides a kind of computer program product, which includes realizing that the third in Fig. 5 can
The program of method in the design of choosing, Fig. 6, Fig. 7, Fig. 8 and Fig. 9.
The embodiment of the present application also provides a kind of computer readable storage medium, which, which is stored with, realizes the in Fig. 5
The program of method in three kinds of optional designs, Fig. 6, Fig. 7, Fig. 8 and Fig. 9.
The embodiment of the present application also provides another communication device, can be used as second of optional design and Figure 10 in Fig. 5
In communication device, for realizing Poewr control method provided by the embodiments of the present application.Optionally, which can be base station.
The structure of the communication device can be as shown in Fig. 2 or Fig. 3.Optionally, which can be base station or terminal.
As a kind of optional embodiment, processing unit 102 can be used for realizing second of optional design in Fig. 5, and figure
The above method in 10.
As another optional embodiment, the memory of communication device can be used for store realize Fig. 5 in second can
The design of choosing and the program of the above method in Figure 10.Processing unit 102 is for executing the program in memory to realize number
According to the correlation function of processing.
The embodiment of the present application also provides a kind of chip, can be as in second in Fig. 5 optional design and Figure 10
Communication device, for realizing the method for data processing provided by the embodiments of the present application.The chip may include dispenser and coding
Device.The optional chip can also include check code adapter.How dispenser, encoder and check code dispenser realize this Shen
Please the method for data processing that provides of embodiment may refer in Fig. 5 technical solution in second of optional design and Figure 10
Explanation.
The embodiment of the present application also provides a kind of computer program product, which can including second in realization Fig. 5
The program of method in the design or Figure 10 of choosing.
The embodiment of the present application also provides a kind of computer readable storage medium, which, which is stored with, realizes the in Fig. 5
The program of method in two kinds of optional designs or Figure 10.
Those skilled in the art are, it should be understood that above-mentioned different optional part/realization method etc. can be according to different network need
It is combined and replaces.
The method of data processing provided by the embodiments of the present application, communication device, computer program product are computer-readable to deposit
Storage media, by segmentation when introduce random length, can make different code blocks length and quantity more closely, code can be kept
The code check of block code rate summation stablized and make different code blocks is close.In addition, by keeping the length of different code blocks most in segmentation
May be identical, the code check of different code blocks can be made close or identical.
In several embodiments provided herein, it should be understood that disclosed device and method can pass through it
Its mode is realized.For example, the apparatus embodiments described above are merely exemplary, for example, the division of the unit, only
Only a kind of division of logic function, formula that in actual implementation, there may be another division manner, such as multiple units or component can be tied
Another system is closed or is desirably integrated into, or some features can be ignored or not executed.Another point, it is shown or discussed
Mutual coupling, direct-coupling or communication connection can be the INDIRECT COUPLING or logical by some interfaces, device or unit
Letter connection can be electrical, machinery or other forms.
The unit illustrated as separating component may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, you can be located at a place, or may be distributed over multiple
In network element.Some or all of unit therein can be selected according to the actual needs to realize the mesh of this embodiment scheme
's.
In addition, each functional unit in each embodiment of the application can be integrated in a processing unit, it can also
It is that each unit physically exists alone, it can also be during two or more units be integrated in one unit.Above-mentioned integrated list
The form that hardware had both may be used in member is realized, can also be realized in the form of hardware adds SFU software functional unit.
Above-mentioned software function part can store in the memory unit.The storage unit include some instructions use so that
One computer equipment (can be personal computer, server or the network equipment etc.) or processor (processor) execute
The part steps of each embodiment the method for the application.The storage unit includes：One or more memories are deposited Ru read-only
Reservoir (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), electrically-erasable
Programmable read only memory (EEPROM), etc..The storage unit can be individually present, and can also be integrated in one with processor
It rises.
Those skilled in the art can be understood that, for convenience and simplicity of description, only with above-mentioned each function module
Division progress for example, in practical application, can be complete by different function modules by above-mentioned function distribution as needed
At the internal structure of device being divided into different function modules, to complete all or part of the functions described above.On
The specific work process for stating the device of description, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
One of ordinary skill in the art will appreciate that：The various digital numbers such as first, second be referred to herein are only to retouch
The differentiation for facilitating progress is stated, the range of the embodiment of the present application is not intended to limit.
One with ordinary skill in the art would appreciate that in the various embodiments of the application, the serial number of above-mentioned each process
Size is not meant that the order of the execution order, and the execution sequence of each process should be determined by its function and internal logic, without answering
Any restriction is constituted to the implementation process of the embodiment of the present application.
In the above-described embodiments, can come wholly or partly by software, hardware, firmware or its arbitrary combination real
It is existing.When implemented in software, it can entirely or partly realize in the form of a computer program product.The computer program
Product includes one or more computer instructions.When loading on computers and executing the computer program instructions, all or
It partly generates according to the flow or function described in the embodiment of the present invention.The computer can be all-purpose computer, special meter
Calculation machine, computer network or other programmable devices.The computer instruction can be stored in computer readable storage medium
In, or from a computer readable storage medium to the transmission of another computer readable storage medium, for example, the computer
Instruction can pass through wired (such as coaxial cable, optical fiber, number from a web-site, computer, server or data center
User's line (DSL)) or wireless (such as infrared, wireless, microwave etc.) mode to another web-site, computer, server or
Data center is transmitted.The computer readable storage medium can be any usable medium that computer can access or
It is comprising data storage devices such as one or more usable mediums integrated server, data centers.The usable medium can be with
It is magnetic medium, (for example, floppy disk, hard disk, tape), optical medium (for example, DVD) or semiconductor medium (such as solid state disk
Solid State Disk (SSD)) etc..
Finally it should be noted that：The above various embodiments is only to illustrate the technical solution of the application, rather than its limitations；To the greatest extent
Pipe is described in detail the application with reference to foregoing embodiments, it will be understood by those of ordinary skill in the art that：Its according to
So can with technical scheme described in the above embodiments is modified, either to which part or all technical features into
Row equivalent replacement；And these modifications or replacements, each embodiment technology of the application that it does not separate the essence of the corresponding technical solution
The range of scheme.
Claims (12)
1. a kind of method of data processing, which is characterized in that including：
Bit sequence is split, multiple first sub- bit sequences are obtained；Wherein, in the multiple first sub- bit sequence
The length of some or all of first sub- bit sequence is not full-length；
To it is described be not that the first sub- bit sequence of full-length is filled, obtain with full-length the second sub- bit sequence
Row.
2. the method as described in claim 1, which is characterized in that the length of the second sub- bit sequence is more than described first
The minimum sandards length of the length of sub- bit sequence.
3. method as claimed in claim 1 or 2, which is characterized in that the length of the multiple first sub- bit sequence belongs to long
Degree set, the lengths sets include full-length set and random length set.
4. method as claimed in claim 3, which is characterized in that it is long that the length of the second sub- bit sequence belongs to the standard
Degree set.
5. method as described in claim 3 or 4, which is characterized in that it is described to bit sequence be split including：
The bit sequence is split according to the lengths sets.
6. the method as described in claim 3-5 is any, which is characterized in that in the lengths sets, the full-length collection
Partial value in conjunction is adjacent with the partial value in the random length set.
7. the method as described in claim 3-6 is any, which is characterized in that a part the in the multiple first sub- bit sequence
The length of one sub- bit sequence is K+, the length of the first sub- bit sequence of another part is K-, K+≠K-。
8. the method for claim 7, which is characterized in that K-To be less than K in the lengths sets+Maximum value.
9. the method as described in claim 3-8 is any, which is characterized in that the value in the full-length set and matrix-expand
It is factor-related.
10. the method as described in claim 1-9 is any, which is characterized in that described is transmission block, the first sub- bit to bit sequence
Sequence is the first code block, and the second sub- bit sequence is the second code block.
11. a kind of communication device, which is characterized in that for executing the method as described in power 1-10 is any.
12. a kind of communication equipment, which is characterized in that include the communication device and transceiver as described in power 11.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710125204.1A CN108540262A (en) | 2017-03-03 | 2017-03-03 | The method and apparatus of data processing |
| PCT/CN2018/077434 WO2018157795A1 (en) | 2017-03-03 | 2018-02-27 | Data processing method and apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710125204.1A CN108540262A (en) | 2017-03-03 | 2017-03-03 | The method and apparatus of data processing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108540262A true CN108540262A (en) | 2018-09-14 |
Family
ID=63369766
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710125204.1A Withdrawn CN108540262A (en) | 2017-03-03 | 2017-03-03 | The method and apparatus of data processing |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN108540262A (en) |
| WO (1) | WO2018157795A1 (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101431396A (en) * | 2007-11-09 | 2009-05-13 | 松下电器产业株式会社 | Method for distributing filling bit in split code word |
| CN101867440A (en) * | 2009-04-15 | 2010-10-20 | 中兴通讯股份有限公司 | Preprocessing method for segmenting code blocks |
| CN102594492A (en) * | 2011-01-18 | 2012-07-18 | 中兴通讯股份有限公司 | Code block dividing method and device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101388743B (en) * | 2007-09-13 | 2012-05-23 | 中兴通讯股份有限公司 | Physical channel mapping device and mapping method for OFDM system |
| CN101572685A (en) * | 2008-05-04 | 2009-11-04 | 中兴通讯股份有限公司 | Transmission device used for orthogonal frequency-division multiplexing system |
-
2017
- 2017-03-03 CN CN201710125204.1A patent/CN108540262A/en not_active Withdrawn
-
2018
- 2018-02-27 WO PCT/CN2018/077434 patent/WO2018157795A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101431396A (en) * | 2007-11-09 | 2009-05-13 | 松下电器产业株式会社 | Method for distributing filling bit in split code word |
| WO2009060628A1 (en) * | 2007-11-09 | 2009-05-14 | Panasonic Corporation | Padding bit assignment method and transmitter |
| CN101867440A (en) * | 2009-04-15 | 2010-10-20 | 中兴通讯股份有限公司 | Preprocessing method for segmenting code blocks |
| CN102594492A (en) * | 2011-01-18 | 2012-07-18 | 中兴通讯股份有限公司 | Code block dividing method and device |
Non-Patent Citations (2)
| Title |
|---|
| ARE HJARUNGNES，JOHN M.LERVIK，TOR A. RAMSTAD: ""Entropy Coding of Composite Sources Modeled by Infinite Gaussian Mixture Distributions"", 《1996 IEEE DIGITAL SIGNAL PROCESSING WORKSHOP PROCEEDINGS》 * |
| 薛晓辉，高文: ""改进的算术编码"", 《计算机学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2018157795A1 (en) | 2018-09-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114144982B (en) | Method and apparatus for generating channel state information report | |
| CN108809487A (en) | Method, base station and the terminal device of transmission data | |
| US10419161B2 (en) | Method and communications device for transmitting information | |
| CN109314524A (en) | System and method using rate-matched is carried out by isomery kernel when generic polarization code | |
| CN108631815B (en) | Data transmission method, network equipment and terminal equipment | |
| WO2018040822A1 (en) | Polar code encoding method and apparatus | |
| CN108631937B (en) | Information processing method, device and equipment | |
| CN108365850B (en) | Encoding method, encoding device, and communication device | |
| CN109391367B (en) | Communication method and device | |
| WO2018196786A1 (en) | Rate matching method and apparatus for polar codes | |
| EP4156579A1 (en) | Polar code encoding method and apparatus, and polar code decoding method and apparatus | |
| CN110247730A (en) | Blind checking method and equipment based on polarization code | |
| US11228321B2 (en) | System and method for processing polar code | |
| CN105940740B (en) | Handle method, network node and the terminal of data | |
| US20200021396A1 (en) | Communication method and apparatus using segmented bit sequences | |
| CN110391874B (en) | Rate matching and rate de-matching method and device for polar code | |
| CN109327280B (en) | Segmented coding method and device | |
| CN108574491A (en) | Data processing method, data processing equipment and communication equipment | |
| CN108574493B (en) | Data processing method and device | |
| CN108540262A (en) | The method and apparatus of data processing | |
| CN108880565B (en) | Coding and decoding method of polarization code and communication equipment | |
| WO2022042259A1 (en) | Wireless communication method and apparatus | |
| CN108400832A (en) | Data processing method and communication equipment | |
| CN106688299B (en) | Communication means, terminal device and base station | |
| CN106797567A (en) | Data transmission method and relevant 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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20180914 |
|
| WW01 | Invention patent application withdrawn after publication |