Concatenated encoding method and device
A cascading coding and coding technology, applied in the field of coding, can solve problems such as system performance degradation, and achieve the effects of reducing the correlation of bit errors, easy implementation, and low coding complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0125] The first-level coding includes ladder coding, the second-level coding includes Hamming (128,119) coding; the information data includes 512 rows×478 columns, and the check data includes 512 rows×32 columns. The basic block diagram is as follows Figure 8 shown. Assuming that the current time is time t, the information data of 512 rows × 478 columns at time t is stored in the first cache, and the information data of 512 rows × 510 columns stored in the first cache at time t-1 is stored in the second cache. Data, because the row number 512 of the data in the first cache is greater than the column number 510 of the data in the second cache by 2, therefore, the data in the second cache includes additional two columns of all 0 data, such as Figure 9 shown. According to the preset corresponding relationship, any row of data in the first cache and the only column of data in the second cache are jointly encoded with BCH (1022,990) to obtain a BCH code word with a code length ...
Embodiment 2
[0131] The first level of encoding includes ladder encoding, and the second level of encoding includes Hamming (128,119) encoding; the information data in the first cache includes 512 rows×478 columns, and the check data in the first cache includes 512 rows×32 columns, which The basic block diagram is as Figure 10 shown. Before receiving the information data at the current moment, the method also includes:
[0132] Carry out 32-bit (Cyclic redundancy check, CRC) cyclic redundancy check coding to the first sequence of 244664 bits, obtain the second sequence that length is 244696 bits; Insert 6-bit stuffing sequence at the end of the second sequence, obtain 244702 bits The third sequence of , wherein, the 6-bit filling sequence can be in any form, such as all 0 sequence, all 1 sequence, etc., which is not limited in this embodiment; a 34-bit all 0 sequence is inserted at the end of the third sequence to obtain 244736 The information data of one bit; the first-level encoding o...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap