Bit-Flip Coding for Crossbar Memory Write Error Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Resistive crossbar memory arrays experience bit errors during write operations due to unselected row and column lines floating, forming a parallel resistor network that can interfere with programming and lead to state change errors.
Innovation Solution
Bit-flip coding is applied to map information bits into a binary array, ensuring the row-column Hamming weight condition is met by performing bit-flip operations, which reduces bit errors by limiting voltage across unselected resistive memory elements during write operations, thereby reducing or eliminating state change errors.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If unselected row and column lines are allowed to float during write operations, then device complexity is reduced, but bit errors increase due to parallel resistor network interference
Solution Approach 1:
The patent applies bit-flip coding to pre-process data before writing to the resistive crossbar memory array. By encoding data such that approximately half of the unselected memory elements are set to 'ON' state beforehand, the system prepares the array to minimize voltage interference during write operations, thereby reducing bit errors without adding complex control circuits
Solution Approach 2:
The patent changes the parameter distribution of memory element states by applying bit-flip coding. Instead of writing arbitrary data patterns, the system transforms data so that the Hamming weight (number of 'ON' states) in each row and column is approximately half of the total elements, which balances the voltage interference from unselected lines and prevents state change errors
2Reliability
If bit-flip coding is applied to meet row-column Hamming weight condition, then bit errors are reduced, but processing time increases
Solution Approach 1:
The patent replaces complex real-time voltage balancing control with a simpler bit-flip coding algorithm. Instead of dynamically adjusting voltages during write operations to balance interference, the system uses a deterministic encoding process that pre-calculates the required bit flips based on row and column Hamming weights, significantly reducing processing overhead
Data Source
AI summary
Bit-flip coding uses a bit-flip encoder to flip bits in a redundancy-intersecting vector of a binary array having n rows and n columns until Hamming weights of the binary array are within a predetermined range Δ of n divided by two. Information bits of an input data word to the bit-flip coding apparatus are stored in locations within the binary array that are not occupied by n redundancy bits of a redundancy vector.