LDPC Decoder Memory Switching to Avoid Data Collision
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional low density parity-check code decoders face issues such as data collision, high circuit area, and calculating complexity due to the parallel-structure design, which affects computing parallelism and increases costs.
Innovation Solution
A low density parity-check code decoder with a calculation module and memory structure that divides data into n first-bit-strings, processed by k calculation units and n shift units, reducing data collision by using one switching network instead of many, thereby reducing the number of bit node units and computing time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If the decoder uses a parallel-structure design with multiple switching networks for writing and reading memory blocks, then computing parallelism is increased, but data collision occurs and circuit area increases
Solution Approach 1:
The patent merges multiple switching networks into a single switching network that handles both writing and reading operations. The switching network is configured to dynamically route data between calculation units and memory blocks, eliminating the need for separate switching networks for write and read operations. This consolidation reduces circuit area while maintaining the parallel processing capability through time-multiplexed access to memory blocks.
Solution Approach 2:
The patent introduces dynamic control of the single switching network to adaptively allocate memory block access between writing and reading operations. The switching network dynamically changes its configuration based on the current operation phase, allowing the system to maintain high computing parallelism without requiring static dedicated paths for each operation type. This dynamic approach prevents data collision by ensuring only one operation type accesses a given memory block at any moment.
2Productivity
If the decoder uses a parallel-structure design with multiple switching networks, then computing parallelism is increased, but data collision occurs during writing and reading
Solution Approach 1:
The patent employs dynamic control of the single switching network to prevent data collision by ensuring that at any given time, a memory block is dedicated to either writing or reading operations, but not both simultaneously. The switching network dynamically reconfigures itself based on the current operation phase, creating temporal separation between write and read accesses to the same memory block. This dynamic time-multiplexing approach maintains high computing parallelism while eliminating data collision risks.
Solution Approach 2:
The single switching network acts as an intermediary between calculation units and memory blocks, mediating all data access requests. It intelligently routes write operations and read operations through appropriate paths, preventing direct conflict between simultaneous write and read accesses to the same memory block. The switching network serves as a centralized controller that coordinates access timing to eliminate data collision while preserving parallel processing efficiency.
3Speed
If the decoder uses multiple switching networks for writing and reading, then memory access capability is improved, but the number of bit node units increases
Solution Approach 1:
The patent combines multiple switching networks into a single unified switching network that serves both writing and reading operations. This single network uses dynamic routing and time-multiplexing to provide the memory access capability previously requiring separate networks. By consolidating the switching functionality, the patent reduces the number of bit node units and other circuit elements while maintaining the speed and capability of memory access through efficient resource sharing.
Data Source
AI summary
The present disclosure illustrates a low density parity-check code decoder adapted for decoding coding data having bit nodes and check nodes. The decoder includes a calculation module and a memory. The calculation module includes k calculation units and n shift units, and the memory includes n memory units. The memory is coupled to the calculation module. Each shift unit is one-to-many coupled to the k calculation units. The n memory units are coupled to the n shift units. The calculation module operatively divides the coding data into n first-bit-strings. The ith calculation unit operatively generates a second-bit-string by calculating ith bits of the n first-bit-strings. The jth shift unit operatively generates a third-bit-string upon receiving jth bits of the k second-bit-strings, and shifts the third-bit-string. The memory units are configured for storing the n shifted third-bit-strings respectively.


