Bit flipping algorithm for providing soft information during hard decision hard decoding
Summary by NHIP
LDPC Bit Flipping Decoding
The method decodes codewords using a first hard decoder that generates log-likelihood ratios from failed check node counts via a look-up table. The system transfers the codeword to a second soft decoder only if the first decoder fails to satisfy parity checks within a predetermined number of iterations, utilizing a bit flipping algorithm for both stages.
Claim Score by NHIP
Abstract
A method for using a first decoder operating in a hard decision hard decoding mode to generate soft information for a second decoder operating in a hard decision soft decoding mode includes: generating a look-up table (LUT) linking a number of failed check nodes to a log-likelihood ratio (LLR) value; in a first iteration of the first decoder, inputting the number of failed check nodes to the LUT table to generate an LLR value; and outputting the LLR value to the second decoder.

Term
9.6 yearsleft in the term
Expires 18 April 2036, including 19 days of term adjustment.
- Priority and filed
- Granted
- Today
- Expires
3 claims: 1 independent, 2 dependent
- 1Broadest claimClaim Score 28, narrow(NHIP)A method for performing low-density parity check (LDPC) decoding, the method comprising:generating a look-up table (LUT) containing predetermined values linking a number of failed check nodes to a log-likelihood ratio (LLR) value;inputting a codeword to a first decoder which operates in a hard decoding mode;in a first iteration of the first decoder, decoding the codeword using a hard decoding algorithm to generate hard information by determining a number of failed check nodes and generating soft information by inputting the number of failed check nodes to the LUT to generate an LLR value;performing a successive number of decoding iterations of the codeword in the first decoder using the hard decoding algorithm wherein in each iteration a number of failed check nodes is determined, and the number of failed check nodes is input to the LUT to generate an LLR value;when a predetermined number of decoding iterations of the hard decoding algorithm is reached without parity check equations for the codeword being satisfied at check nodes, stopping decoding of the codeword using the first decoder, inputting the codeword to the second decoder and starting decoding of the codeword in the second decoder using a soft decoding algorithm and the LLR values generated by the LUT;or when parity check equations for the codeword are satisfied at the check nodes before the predetermined number of decoding iterations of the hard decoding algorithm is reached, the decoded codeword is directly output without the second decoder being used.
25 paragraphs in 4 sections, as filed
BACKGROUND OF THE INVENTION
1. Field of the Invention
0001The present invention relates to a bit flipping algorithm for a low-density parity check (LDPC) decoder, and more particularly to a method for reducing the number of iterations performed by the bit flipping algorithm by providing soft information to a second decoder during hard decision hard decoding performed by a first decoder.
2. Description of the Prior Art
0002Low-density parity check (LDPC) decoders use a linear error correcting code with parity bits. Parity bits provide a decoder with parity equations which can validate a received codeword. For example, a low-density parity check is a fixed length binary code wherein all the symbols added together will equal zero.
0003During encoding, all data bits are repeated and transmitted to encoders, wherein each encoder generates a parity symbol. Codewords are formed of k information digits and r check digits. If the length of the codeword is n then the information digits, k, will equal n−r. The codewords can be represented by a parity check matrix, which consists of r rows (representing equations) and n columns (representing digits), and is represented in <figref idref="DRAWINGS">FIG. 1</figref>. The codes are called low-density because the parity matrix will have very few ‘1’s in comparison to the number of ‘0’s. During decoding, each parity check is viewed as a single parity check code, and is then cross-checked with others. Decoding occurs at check nodes, and cross-checking occurs at variable nodes.
0004LDPC engines support three modes: hard decision hard decoding, soft decision hard decoding, and soft decision soft decoding. <figref idref="DRAWINGS">FIG. 1</figref> illustrates the parity check matrix H and a Tanner graph, which is another way of representing the codewords, and is used to explain the operation of the LDPC decoder for hard decision soft decoding when using a bit flipping algorithm.
0005The check nodes, which are represented by the square boxes, are the number of parity bits; and the variable nodes, which are represented by the circular boxes, are the number of bits in a codeword. If a code symbol is involved in a particular equation, a line is drawn between the corresponding check node and variable node. ‘Messages’, which are estimates, are passed along the connecting lines, and combined in different ways at the nodes. Initially, the variable nodes will send an estimate to the check nodes on all connecting lines containing a bit believed to be correct. Each check node then takes all the other connected estimates, makes new estimates for each variable node based on this information, and passes the new estimate back to the variable nodes. The new estimate is based on the fact that the parity check equations force all variable nodes connected to a particular check node to sum to zero.
0006The variable nodes receive the new information and use a majority rule (a hard decision) to determine if the value of the original bit they sent was correct. If not, the original bit will be ‘flipped’. The bit is then sent back to the check nodes, and these steps are repeated for a predetermined number of iterations or until the parity check equations at the check nodes are satisfied. If these equations are satisfied (i.e. the value calculated by the check nodes matches the value received from the variable nodes) then Early Termination can be activated, which allows the system to exit the decoding process before the maximum number of iterations is reached.
0007If the first decoding mode cannot resolve the codeword before a maximum number of iterations is reached, the decoding mode should change. As hard decision hard decoding is the most power efficient mode, the general order is hard decision hard decoding→hard decision soft decoding→soft decision soft decoding. The latter two modes require some soft information which is based on the concept of belief propagation. Each message received at the nodes is a conditional probability that the bit received is a 0 or a 1. Probabilities which are known in advance before running the LDPC decoder are called a priori probabilities, but the soft decoding scheme also requires a posteriori probabilities, which can only be known after running the decoder through a certain number of iterations. Therefore, when switching from a hard decision hard decoding scheme to a hard decision soft decoding scheme, the LDPC decoder must perform a certain number of iterations before the a posteriori probabilities can be calculated.
SUMMARY OF THE INVENTION
0008It is an objective of the present invention to decrease the number of iterations using a bit flipping algorithm when switching from a first decoding scheme to a second decoding scheme.
0009A method for using a first decoder operating in a hard decision hard decoding mode to generate soft information for a second decoder operating in a hard decision soft decoding mode according to an exemplary embodiment of the present invention comprises: generating a look-up table (LUT) linking a number of failed check nodes to a log-likelihood ratio (LLR) value; in a first iteration of the first decoder, inputting the number of failed check nodes to the LUT table to generate an LLR value; and outputting the LLR value to the second decoder.
0010These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
0011<figref idref="DRAWINGS">FIG. 1</figref> illustrates a parity check matrix H and a Tanner graph.
0012<figref idref="DRAWINGS">FIG. 2</figref> illustrates a decoding system according to an exemplary embodiment of the present invention.
DETAILED DESCRIPTION
0013As detailed in the background, soft information is information relating to how reliable a codeword at the variable node is. One example of soft information is a log-likelihood ratio (LLR) value, which is used by the variable nodes in hard decision soft decoding and soft decision soft decoding. The LLR values are determined by a posteriori probabilities and are related to how many check nodes fail (i.e. how reliable the codeword at the variable node is) as well as a number of error bits in the system. An illustration of the relationship between failed check nodes, error bits and LLR values is provided in Table 1 and Table 2 below.
0014<tables id="TABLE-US-00001" num="00001"><table frame="none" colsep="0" rowsep="0" pgwide="1"><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="259pt" align="center" /><thead><row><entry namest="1" nameend="1" rowsep="1">TABLE 1</entry></row></thead><tbody valign="top"><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row><row><entry>posterior probabilities</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="offset" colwidth="63pt" align="left" /><colspec colname="1" colwidth="196pt" align="center" /><tbody valign="top"><row><entry /><entry>Error #</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="8"><colspec colname="1" colwidth="63pt" align="center" /><colspec colname="2" colwidth="28pt" align="center" /><colspec colname="3" colwidth="28pt" align="center" /><colspec colname="4" colwidth="28pt" align="center" /><colspec colname="5" colwidth="28pt" align="center" /><colspec colname="6" colwidth="28pt" align="center" /><colspec colname="7" colwidth="28pt" align="center" /><colspec colname="8" colwidth="28pt" align="center" /><tbody valign="top"><row><entry>Failed Check Node</entry><entry>5</entry><entry>15</entry><entry>25</entry><entry>35</entry><entry>45</entry><entry>55</entry><entry>65</entry></row><row><entry namest="1" nameend="8" align="center" rowsep="1" /></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="8"><colspec colname="1" colwidth="63pt" align="center" /><colspec colname="2" colwidth="28pt" align="char" char="." /><colspec colname="3" colwidth="28pt" align="char" char="." /><colspec colname="4" colwidth="28pt" align="char" char="." /><colspec colname="5" colwidth="28pt" align="char" char="." /><colspec colname="6" colwidth="28pt" align="char" char="." /><colspec colname="7" colwidth="28pt" align="char" char="." /><colspec colname="8" colwidth="28pt" align="char" char="." /><tbody valign="top"><row><entry>0</entry><entry>0</entry><entry>0</entry><entry>0</entry><entry>0</entry><entry>0</entry><entry>0.00001</entry><entry>0.00002</entry></row><row><entry>1</entry><entry>0</entry><entry>0</entry><entry>0</entry><entry>0.00001</entry><entry>0.00005</entry><entry>0.00011</entry><entry>0.00022</entry></row><row><entry>2</entry><entry>0</entry><entry>0.00009</entry><entry>0.0003</entry><entry>0.00044</entry><entry>0.00106</entry><entry>0.00157</entry><entry>0.0022</entry></row><row><entry>3</entry><entry>0.02391</entry><entry>0.02092</entry><entry>0.0211</entry><entry>0.02108</entry><entry>0.02114</entry><entry>0.02132</entry><entry>0.02151</entry></row><row><entry>4</entry><entry>0.992</entry><entry>0.93359</entry><entry>0.60861</entry><entry>0.51252</entry><entry>0.31132</entry><entry>0.23141</entry><entry>0.18</entry></row><row><entry>5</entry><entry>1</entry><entry>0.9999</entry><entry>0.99157</entry><entry>0.9803</entry><entry>0.90399</entry><entry>0.80908</entry><entry>0.68508</entry></row><row><entry namest="1" nameend="8" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
0015<tables id="TABLE-US-00002" num="00002"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="1"><colspec colname="1" colwidth="217pt" align="center" /><thead><row><entry namest="1" nameend="1" rowsep="1">TABLE 2</entry></row></thead><tbody valign="top"><row><entry namest="1" nameend="1" align="center" rowsep="1" /></row><row><entry>LLR values</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="2"><colspec colname="1" colwidth="42pt" align="center" /><colspec colname="2" colwidth="175pt" align="center" /><tbody valign="top"><row><entry>Failed Check</entry><entry>Error #</entry></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="10"><colspec colname="1" colwidth="42pt" align="center" /><colspec colname="2" colwidth="21pt" align="center" /><colspec colname="3" colwidth="21pt" align="center" /><colspec colname="4" colwidth="21pt" align="center" /><colspec colname="5" colwidth="21pt" align="center" /><colspec colname="6" colwidth="21pt" align="center" /><colspec colname="7" colwidth="21pt" align="center" /><colspec colname="8" colwidth="14pt" align="center" /><colspec colname="9" colwidth="21pt" align="center" /><colspec colname="10" colwidth="14pt" align="center" /><tbody valign="top"><row><entry>Node</entry><entry>5</entry><entry>15</entry><entry>25</entry><entry>35</entry><entry>45</entry><entry>55</entry><entry>65</entry><entry>Fix 1</entry><entry>Fix</entry></row><row><entry namest="1" nameend="10" align="center" rowsep="1" /></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="10"><colspec colname="1" colwidth="42pt" align="center" /><colspec colname="2" colwidth="21pt" align="char" char="." /><colspec colname="3" colwidth="21pt" align="char" char="." /><colspec colname="4" colwidth="21pt" align="char" char="." /><colspec colname="5" colwidth="21pt" align="char" char="." /><colspec colname="6" colwidth="21pt" align="char" char="." /><colspec colname="7" colwidth="21pt" align="char" char="." /><colspec colname="8" colwidth="14pt" align="char" char="." /><colspec colname="9" colwidth="21pt" align="char" char="." /><colspec colname="10" colwidth="14pt" align="char" char="." /><tbody valign="top"><row><entry>0</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>63</entry></row><row><entry>1</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>53</entry></row><row><entry>2</entry><entry>63</entry><entry>63</entry><entry>63</entry><entry>59</entry><entry>55</entry><entry>52</entry><entry>49</entry><entry>50</entry><entry>42</entry></row><row><entry>3</entry><entry>30</entry><entry>31</entry><entry>31</entry><entry>31</entry><entry>31</entry><entry>31</entry><entry>31</entry><entry>31</entry><entry>31</entry></row><row><entry>4</entry><entry>−39</entry><entry>−13</entry><entry>−4</entry><entry>2</entry><entry>6</entry><entry>10</entry><entry>12</entry><entry>20</entry><entry>21</entry></row><row><entry>5</entry><entry>−63</entry><entry>−57</entry><entry>−38</entry><entry>−26</entry><entry>−18</entry><entry>−12</entry><entry>−6</entry><entry>10</entry><entry>10</entry></row><row><entry namest="1" nameend="10" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
0016wherein the LLR values are calculated as shown below. <br />LLR_<i>i</i>=Max LLR*((column_weight+1<i>−i</i>)/column_weight+1)
0017In the above, the value i is the number of failed check nodes. Using Table 1 and Table 2, a look-up table (LUT) can be generated which directly links the number of failed check nodes to the LLR values. The look-up table is illustrated below as Table 3.
0018<tables id="TABLE-US-00003" num="00003"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="3"><colspec colname="offset" colwidth="21pt" align="left" /><colspec colname="1" colwidth="63pt" align="center" /><colspec colname="2" colwidth="133pt" align="center" /><thead><row><entry /><entry namest="offset" nameend="2" rowsep="1">TABLE 3</entry></row><row><entry /><entry namest="offset" nameend="2" align="center" rowsep="1" /></row><row><entry /><entry>Fail Check Node</entry><entry>Log-likelihood Ratio (LLR)</entry></row><row><entry /><entry namest="offset" nameend="2" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry /><entry>0</entry><entry>63</entry></row><row><entry /><entry>1</entry><entry>53</entry></row><row><entry /><entry>2</entry><entry>42</entry></row><row><entry /><entry>3</entry><entry>31</entry></row><row><entry /><entry>4</entry><entry>21</entry></row><row><entry /><entry>5</entry><entry>10</entry></row><row><entry /><entry namest="offset" nameend="2" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
0019Therefore, even when the LDPC decoder is operating in hard decision hard decoding mode, soft information can be generated by using the LUT.
0020In an exemplary embodiment of the present invention, a first decoder using a bit flipping algorithm in hard decision hard decoding mode generates LLR values in a first iteration by determining the number of failed check nodes and inputting this information to the LUT to output an LLR value. The first decoder then passes the LLR values to an N<b>2</b> decoder, which operates in a hard decision soft decoding mode.
0021Please refer to <figref idref="DRAWINGS">FIG. 2</figref>, which illustrates the first decoder, the LUT and the N<b>2</b> decoder. As shown in <figref idref="DRAWINGS">FIG. 2</figref>, a decoding system <b>200</b> comprises a first decoder <b>210</b>, which is coupled to both an LUT <b>250</b> and a second (N<b>2</b>) decoder <b>230</b>. Codewords are input to the first decoder <b>210</b>. The first decoder <b>210</b> calculates the number of failed check nodes and these are passed to the LUT <b>250</b>, which generates LLR values and passes the LLR values to the second decoder <b>230</b>. If the codeword is not resolved by the first decoder <b>210</b>, the codeword will be passed directly to the second decoder <b>230</b>.
0022Therefore, in the first iteration of the bit flipping decoder, information will also be provided for a soft decode as well as for the hard decode.
0023Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims.
Contents4
3 sheets
Sheet 1 Sheet 2 Sheet 3
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US10511326B2 | Cited by | United States of America | Search report |
| US2019149169A1 | Cited by | United States of America | Search report |
| US10491244B2 | Cited by | United States of America | Search report |
| US11115051B2 | Cited by | United States of America | Search report |
| US12052033B2 | Cited by | United States of America | Applicant |
| US10884858B2 | Cited by | United States of America | Applicant |
| US11005503B2 | Cited by | United States of America | Applicant |
| US11750219B2 | Cited by | United States of America | Search report |
| US2022329260A1 | Cited by | United States of America | Search report |
| US2019149168A1 | Cited by | United States of America | Search report |
| US11070234B2 | Cited by | United States of America | Search report |
| US2011307765A1 | Cites | United States of America | Applicant |
| US2013332790A1 | Cites | United States of America | Search report |
| US2015200688A1 | Cites | United States of America | Search report |
| US2015236726A1 | Cites | United States of America | Search report |
| US7783952B2 | Cites | United States of America | Search report |
| US7978793B2 | Cites | United States of America | Search report |
| US8051363B1 | Cites | United States of America | Search report |
| US8700970B2 | Cites | United States of America | Search report |
| US8707123B2 | Cites | United States of America | Search report |
| US8719682B2 | Cites | United States of America | Search report |
| US8782496B2 | Cites | United States of America | Search report |
| US8867601B2 | Cites | United States of America | Search report |
| US9021332B2 | Cites | United States of America | Search report |
| US9235467B2 | Cites | United States of America | Search report |
| US9317365B2 | Cites | United States of America | Search report |
| US20110307765A1 | Cites | United States of America | Applicant |
| US20130332790A1 | Cites | United States of America | Search report |
| US20150200688A1 | Cites | United States of America | Search report |
| US20150236726A1 | Cites | United States of America | Search report |
12 members in 3 offices; this record represents the family
Members12
| Document | Office | Kind | |
|---|---|---|---|
| TW201735553A | Taiwan Province of China | A | |
| US2017288699A1 | United States of America | A1 | |
| CN107276594A | China | A | |
| US10164656B2This record | United States of America | B2 | |
| US2019089374A1 | United States of America | A1 | |
| TWI663839B | Taiwan Province of China | B | |
| TW201933796A | Taiwan Province of China | A | |
| US10630316B2 | United States of America | B2 | |
| CN107276594B | China | B | |
| CN111628785A | China | A | |
| TWI710220B | Taiwan Province of China | B | |
| CN111628785B | China | B |
65 transactions on the USPTO file
Allowed after 2 non-final rejections, 1 final rejection and 1 RCE.
- Non-final rejections
- 2
- Final rejections
- 1
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Payment of Maintenance Fee, 4th Year, Large EntityM1551 | M1551 | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Email NotificationEML_NTR | EML_NTR | |
| Printer Rush- No mailingTCPB | TCPB | |
| Mail Miscellaneous Communication to ApplicantMM327 | MM327 | |
| Miscellaneous Communication to Applicant - No Action CountM327 | M327 | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Pubs Case Remand to TCPUBTC | PUBTC | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Reasons for AllowanceEX.R | EX.R | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Incoming Letter Pertaining to the DrawingsLTDR | LTDR | |
| Response after Non-Final ActionA... | A... | |
| Email NotificationEML_NTR | EML_NTR | |
| Application ready for PDX access by participating foreign officesCCRDY | CCRDY | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Email NotificationEML_NTR | EML_NTR | |
| Change in Power of Attorney (May Include Associate POA)PA.. | PA.. | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Email NotificationEML_NTR | EML_NTR | |
| Application Is Now CompleteCOMP | COMP | |
| Application Is Now CompleteCOMP | COMP | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| Sent to Classification ContractorPGPC | PGPC | |
| FITF set to YES - revise initial settingFTFS | FTFS | |
| Cleared by OIPE CSRL194 | L194 | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Patent Term Adjustment - Ready for ExaminationPTA.RFE | PTA.RFE | |
| PTO/SB/69-Authorize EPO Access to Search ResultsSREXR141 | SREXR141 | |
| Applicants have given acceptable permission for participating foreignAPPERMS | APPERMS | |
| Entity Status Set To Undiscounted (Initial Default Setting or Status Change)BIG. | BIG. | |
| Initial Exam Team nnIEXX | IEXX |
4 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Maintenance fee paymentMAFP | MAFP | |
| Maintenance fee paymentMAFP | MAFP | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| AssignmentAS | AS |
Numbers
- Publication
- 10164656
- Application
- 15086006
Titles
- English
- Bit flipping algorithm for providing soft information during hard decision hard decoding
Patent term adjustment
- A delay
- +48 daysthe office missed an examination deadline
- Applicant delay
- −29 days
- Net adjustment
- 19 days
Classification
- CPC, 7
- H03M13/1108
- H03M13/1111
- H03M13/1125
- H03M13/3707
- H03M13/1128
- H03M13/3715
- H03M13/45
- IPC, 3
- H03M13 11
- H03M13 37
- H03M13 45
- USPC, 1
- 714755000