Prosecution Insights
Last updated: October 02, 2026
Application No. 19/069,236

Bit-Flipping Algorithm for Binary Asymmetric Channels

Non-Final OA §103
Filed
Mar 04, 2025
Examiner
CHASE, SHELLY A
Art Unit
2112
Tech Center
2100 — Computer Architecture & Software
Assignee
SK hynix Inc.
OA Round
1 (Non-Final)
95%
Grant Probability
Favorable
1-2
OA Rounds
6m
Est. Remaining
97%
With Interview

Examiner Intelligence

Grants 95% — above average
95%
Career Allowance Rate
728 granted / 768 resolved
+39.8% vs TC avg
Minimal +3% lift
Without
With
+2.6%
Interview Lift
resolved cases with interview
Fast prosecutor
2y 1m
Avg Prosecution
9 currently pending
Career history
787
Total Applications
across all art units

Statute-Specific Performance

§101
13.1%
-26.9% vs TC avg
§103
45.0%
+5.0% vs TC avg
§102
13.3%
-26.7% vs TC avg
§112
14.9%
-25.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 768 resolved cases

Office Action

§103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Claims 1 to 20 are presented for examination. Information Disclosure Statement The references listed in the information disclosure statement submitted on 3-4-2025 have been considered by the examiner (see attached PTO-1449). Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claims 1, 3 and 11 are rejected under 35 U.S.C. 103 as being unpatentable over Zhang et al. (USPAP 2020/0403634) in view of DU (USPAP 2017/0288698). Claims 1 and 11: Zhang substantially teaches the claimed invention. Zhang teaches a method and an apparatus for techniques to improve performance related to at least data reads from a memory, the method comprising: retrieving stored data from a storage system and detecting noise or errors that may be included in the retrieved data (see par. 0036). Zhang teaches that a detector (130) performs either soft detection or hard detection on the retrieved stored data thereby outputting a decision and/or reliability information (see par. 0036). Zhang teaches that a hard decision output a decision bit that is either a (“1” or “0”) and a soft decision outputs a log-likelihood ratio (LLR) wherein the sign indicates the decision i.e., a positive sign value corresponds to a “1” decision and a negative sign value correspond to a “0” decision (see par. 0036). Zhang teaches that the decision output from the detector is then passed to a low density parity check decoder (140) which performs decoding on the received decision and reliability information (see par. 0037). Zhang teaches that a message passing algorithm (“symmetric bit-flip (BF) decoding”) is generally used to decode LDPC codes (see par. 0040). Zhang teaches that the decoder performs both hard decision decoding and soft decision decoding wherein a number of decoding iterations are performed depending on the syndrome of the codeword (see par. 0043). Zhang teaches storing an information bit and/or a parity bit in a cell wherein to check whether the cell contains a “0” or a “1”, a voltage is read and compared to a voltage threshold to identify the relevant voltage level and the bit value (see par. 0051). Zhang teaches that a 0-to-1 error can occur when the voltage measurement indicates that the bit should be read as a 1 (see par. 0051). Zhang teaches that asymmetric error ratios in NAND flash memories are measured wherein error ratio curves are generated (see par. 0054). Zhang teaches that a computer system having a specific hardware performs specific operations such as estimating the first number of errors and performing decoding on the estimates (see par. 0060). Zhang teaches that after the first number of errors E01 and the second number of errors E10 are estimated, the computer system performs the decoding of the codewords based on the decoding procedure of either soft or hard decision (see par. 0061). Zhang teaches that the computer system determines a flip bit count E as a function of the checksum and estimates the first number of errors based on the first flip bit count (see par. 0068). Zhang teaches that the computer system can determine a ratio of the errors (see par. 0070). Zhang further teaches that prior to decoding, estimating the asymmetric ratio for probabilities of 0-to-1 and 1-to 0 and using the estimated ratio as an input into the decoder (see par. 0027 et seq.). Zhang fails to specifically teach the limitation of “comparing the asymmetric ratio to an asymmetric ratio threshold in order to determine whether to continue to iterating of the symmetric BF decoding or to switch to the asymmetric BF decoding; however, Du in an analogous art teaches a method and an apparatus for saving power during a bit flipping algorithm for a certain number of iterations. I.e., Du teaches the steps for deciding when to switch to a different decoding mode based on the number of iterations that are outside the selected threshold and determining when to end a bit flipping algorithm during hard decision soft decoding for a low-density parity check (LDPC) decoding operation. Du teaches that if the value for each iteration is less than or equal to the corresponding column weight divided by 2, then it’s an indication that the decoding mode should be switched (see par. 0018). Therefore, it would have been obvious to one having ordinary skill in the art before the effective filing date of the claimed invention to modify the steps of hard decision decoding of Zhang to include the power saving decoding steps of DU of switching the decoding operation based on the assessment of the decoding iteration for a bit flipping algorithm. This modification would have been obvious because a person of ordinary skill in the art would have been motivated to employ a method for modifying the hard decision decoding to include switching decoding operations for a bit flipping algorithm to save power as taught by DU (see par. 0009). As per claim 3, Zhang teaches using the asymmetric ratio in the decoding procedure to improve the decoding performance (see par. 0029). Allowable Subject Matter Claims 2, 4 to 10, and 12 to 20 are objected to as being dependent upon a rejected base claim but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Sharifi et al. Implementing the Han-Kobayashi scheme using low density parity check codes over Gaussian interference, channels, IEEE. Kaynak et al. (USPAP 2024/0168847) discloses a method and an apparatus for efficient use of memory to support soft information in bit flipping decoders. Anholt et al. (USP 8,429,498 B1) teaches a decoding apparatus including dual ECC decoder. Any inquiry concerning this communication or earlier communications from the examiner should be directed to SHELLY A CHASE whose telephone number is (571)272-3816. The examiner can normally be reached Mon-Thu 8:00-5:30, 2nd Friday 8:00-4:30. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Albert Decady can be reached at 571-272 3819. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /Shelly A Chase/Primary Examiner, Art Unit 2112
Read full office action

Prosecution Timeline

Mar 04, 2025
Application Filed
Sep 16, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12659076
Methods for Rapid Fault Recovery of Corrupted 5G/6G Messages
1y 9m to grant Granted Jun 16, 2026
Patent 12647218
METHOD AND DEVICE FOR TRANSMITTING AND RECEIVING SIGNAL IN WIRELESS COMMUNICATION SYSTEM
2y 0m to grant Granted Jun 02, 2026
Patent 12647208
SYSTEMS AND METHODS OF LOW LATENCY DATA COMMUNICATION FOR PHYSICAL LINK LAYER RELIABILITY
1y 9m to grant Granted Jun 02, 2026
Patent 12647309
PROBABILISTIC CONSTELLATION SHAPING FOR SLOT AGGREGATION
1y 7m to grant Granted Jun 02, 2026
Patent 12640842
COMMUNICATION TECHNIQUES APPLYING LOW-DENSITY PARITY-CHECK CODE BASE GRAPH SELECTION
2y 5m to grant Granted May 26, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
95%
Grant Probability
97%
With Interview (+2.6%)
2y 1m (~6m remaining)
Median Time to Grant
Low
PTA Risk
Based on 768 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month