A decoder and a method for implementing the same
A decoder and iterative decoding technology, applied in the direction of encoding, code conversion, encoding components, etc., can solve problems such as display, achieve the effect of storage optimization, reduce memory requirements, and save implementation costs
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
no. 1 example
[0165] The first embodiment takes a simple random check matrix H as an example to describe the decoding process of the present invention. The check matrix H is:
[0166] Assuming that in the ith iteration, the decoding of the first column has been completed, and the decoding of the second column is about to be performed. According to the form of the check matrix H, two related check messages need to be solved: and These two formulas are based on Figure 4 Step 400 in the solution can be solved. below to solve As an example, the specific calculation process of step 400 is described in detail:
[0167] calculate The absolute value of :
[0168] calculate symbol: Positive numbers and zeros are represented by 0, and negative numbers are represented by 1;
[0169] in the above formula All are the values recorded in the maintained verification message table. Here, only the verification message table can be queried according to the verification formula No. 3. ...
no. 2 example
[0186] The second embodiment, this embodiment shows the embodiment of the present invention after the decoding calculation is completed and compressed back to the compression table, FIG. 5(a) is a schematic diagram of storage after decoding and calculation in the related art, and FIG. 5(b) is this The storage schematic diagram after decoding and calculation in the embodiment of the invention, as shown in Figure 5(b), the calculation of the check message CR in each iteration of the present invention is only to extract the corresponding value from the compressed check information table, and The comparison operation does not need to be performed, but the comparison operation is not omitted. In the calculation of the compressed storage after the final variable message VR is calculated, the comparison operation still needs to be performed, but the storage and addressing involved have been determined by the relevant technology. A single point that is separated in , becomes a whole bl...
no. 3 example
[0188] The third embodiment, this embodiment provides an example of using the shuffled BP property to perform parallel operations. Since the calculation of a column of variable messages requires multiple verification messages, in this embodiment, it is assumed that the verification messages corresponding to different verification equations are stored in different single-port RAMs before the parallel calculation of these verification messages is performed to make To the purpose of reading data from different addresses at the same time. like Image 6 As shown, the box on the right shows the relationship between a variable (column) indicated by the exponential matrix of a QC-LDPC and two check equations (rows). To solve the two corresponding variable messages of the variable, it is necessary to obtain 2 corresponding check messages, these 2 check messages passed Image 6The parity message compression tables shown on the left stored in different RAMs are given simultaneously. I...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



