PATENT CLAIM ANALYSIS

Application Number: 16092001
Application Type: Utility
Filing Date: 2018-10
Publication Date: 2019-04
Patent Classification: ["365", "148000"]

Abstract:
The invention relates to an electronic memristive device that has a complementary analogue reconfigurable memristive bidirectional resistive switch. The device has a memristive layer sequence having a BFTO/BFO/BFTO three-ply layer and two electrodes. Titanium traps are arranged in the BFTO interfaces. As a result of mobile acid vacancies, the potential barriers at the interfaces of the electrodes with respect to the memristive layer sequence are in flexible form. By applying voltage pulses, the acid vacancies can be shifted from the interface with respect to the first electrode to the interface with respect to the second electrode, with raising of the potential barrier at one electrode bringing about complementary lowering of the potential barrier of the other electrode. The method according to the invention for operating the device proposes adapted writing processes that use the overlaying of writing pulse sequences to achieve stipulation of a state pair of complementary resistor states. In conjunction with reading pulses of adapted polarity, the device can implement fuzzy logic and be operated as an artificial synapse with the realisation of all four learning curves for complementary learning. A plurality of options for the use of the device operated according to the invention are proposed

Claim (Index 6):
Method according to  claim 5  for implementing the 16 Boolean functions in fuzzy logic having two logical input variables p and q, comprising at least the following pulses:\n a first initialisation pulse which is independent of the input variables p and q and which is applied to the first or second electrode, which pulse has a positive voltage for specifying truth table 1 or a negative voltage for specifying truth table 2 as the valid truth table, and \n subsequently a second initialisation pulse according to the valid truth table 1 or 2, which pulse is independent of the input variables p and/or q and which is applied to the same electrode as the first initialisation pulse, \n a) a writing process, as defined in claim  1 a), is subsequently carried out according to the valid truth table 1 or 2, \n b) a reading process comprising exactly one reading pulse which is applied to the same electrode as the first initialisation pulse is subsequently carried out according to the valid truth table 1 or 2,\n a state value between the complementary end states PHRS and PLRS being read out, by a positive reading pulse, for a preceding positive writing pulse sequence pair, or \n a state value between the complementary end states NLRS and NHRS being read out, by a negative reading pulse, for a preceding positive writing pulse sequence pair, or \n a state value between the complementary end states PLRS and PHRS being read out, by a positive reading pulse, for a preceding negative writing pulse sequence pair, or \n a state value between the complementary end states NHRS and NLRS being read out, by a negative reading pulse, for a preceding negative writing pulse sequence pair. \n \n Truth table 1 (XNOR) Initialisation Initialisation Writing I II process Reading process p\u2009\u2295\u2009q T1 T2 T1 T2 \u0394t r ( p ) p q s 1 0 q 1 q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 0 0 (PLRS, NHRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 0 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 1 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 Truth table 2 (XNOR) Initialisation Initialisation Writing I II process Reading process p\u2009\u2295\u2009q T1 T2 T1 T2 \u0394t r (p) p q s 0 1 1 q q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t|\u2192 \u221e 0 0 1 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 0 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 0 1 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 1 1 (PHRS, NLRS) (PHRS, NLRS) <0 PLRS = 1 LTP PHRS = 0 Truth table 1 (tautology) Initialisation Initialisation Writing I II process Reading process 1 T1 T2 T1 T2 \u0394t r ( p ) p q s 1 0 p 1 p |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 0 0 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 0 1 0 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 1 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 Truth table 2 (tautology) Initialisation Initialisation Writing I II process Reading process 1 T1 T2 T1 T2 \u0394t r (p) p q s 0 1 1 p p |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 0 0 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 0 1 0 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 1 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 Truth table 1 (contradiction) Initialisation Initialisation Writing I II process Reading process 0 T1 T2 T1 T2 \u0394t r (p) p q s 0 1 1 p p |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PLRS, NHRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 0 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 0 1 0 (PLRS, NHRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 Truth table 2 (contradiction) Initialisation Initialisation Writing I II process Reading process 0 T1 T2 T1 T2 \u0394t r ( p ) p q s 0 1 1 p p |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 0 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 0 1 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 1 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 Truth table 1 (replication) Initialisation Initialisation Writing I II process Reading process p +  q T1 T2 T1 T2 \u0394t r (0) p q s 1 0 q P p +  q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 0 0 (PLRS, NHRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 0 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 1 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 Truth table 2 (replication) Initialisation Initialisation Writing I II process Reading process p +  q T1 T2 T1 T2 \u0394t r (1) p q s 0 1 p q p  \u00b7 q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 0 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 0 1 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 1 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 Truth table 1 (inhibition of q) Initialisation Initialisation Writing I II process Reading process p  \u00b7 q T1 T2 T1 T2 \u0394t r (1) p q s 1 0 q p p +  q   |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 0 1 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 0 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 Truth table 2 (inhibition of q) Initialisation Initialisation Writing I II process Reading process p  \u00b7 q T1 T2 T1 T2 \u0394t r (0) p q s 0 1 p q p  \u00b7 q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 0 1 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 0 1 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 1 0 (PHRS, NLRS) (PHRS, NLRS) <0 NHRS = 0 anti-LTD NLRS = 1 Truth table 1 (AND) Initialisation Initialisation Writing I II process Reading process p \u00b7 q T1 T2 T1 T2 \u0394t r ( p ) p q s 1 0 q p p +  q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 0 0 (PLRS, NHRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 0 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 1 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 Truth table 2 (AND) Initialisation Initialisation Writing I II process Reading process p \u00b7 q T1 T2 T1 T2 \u0394t r (p) p q s 0 1 p q p  \u00b7 q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 0 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 0 1 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 1 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 Truth table 1 (NAND) Initialisation Initialisation Writing I II process Reading process p\u2009\u00b7\u2009q T1 T2 T1 T2 \u0394t r (p) p q s 1 0 q p p +  q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 0 1 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 0 1 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 Truth table 2 (NAND) Initialisation Initialisation Writing I II process Reading process p\u2009\u00b7\u2009q T1 T2 T1 T2 \u0394t r( p ) p q s 0 1 p q p  \u00b7 q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 0 1 1 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 0 1 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 1 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 Truth table 1 (OR) Initialisation Initialisation Writing I II process Reading process p + q T1 T2 T1 T2 \u0394t r ( p ) p q s 1 0 p q p  + q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 0 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 0 1 1 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 1 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 Truth table 2 (OR) Initialisation Initialisation Writing I II process Reading process p + q T1 T2 T1 T2 \u0394t r (p) p q s 0 1 q p p \u00b7  q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 0 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 0 1 1 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 1 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 Truth table 1 (NOR) Initialisation Initialisation Writing I II process Reading process p\u2009+\u2009q T1 T2 T1 T2 \u0394t r (p) p q s 1 0 p q p  + q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 0 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 0 1 0 (PLRS, NHRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 Truth table 2 (NOR) Initialisation Initialisation Writing I II process Reading process p + q T1 T2 T1 T2 \u0394t r ( p ) p q s 0 1 q p p \u00b7  q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 0 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 0 1 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 1 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 Truth table 1 (identity of p) Initialisation Initialisation Writing I II process Reading process p T1 T2 T1 T2 \u0394t r (0) p q s 1 0 p 1 p |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PLRS, NHRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 0 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 0 1 0 (PLRS, NHRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 1 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 Truth table 2 (identity of p) Initialisation Initialisation Writing I II process Reading process p T1 T2 T1 T2 \u0394t r (1) p q s 0 1 1 p p |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 0 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 0 1 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 1 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 Truth table 1 (identity of  p ) Initialisation Initialisation Writing I II process Reading process p T1 T2 T1 T2 \u0394t r (1) p q s 1 0 p 1 p |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 0 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 0 1 1 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 Truth table 2 (identity of  p ) Initialisation Initialisation Writing I II process Reading process p T1 T2 T1 T2 \u0394t r (0) p q s 0 1 1 p p |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 0 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS= 1 0 1 1 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 1 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 Truth table 1 (identity of q) Initialisation Initialisation Writing I II process Reading process q T1 T2 T1 T2 \u0394t r (0) p q s 1 0 p 1 q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PLRS, NHRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 0 0 (PLRS, NHRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 0 1 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 1 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 Truth table 2 (identity of q) Initialisation Initialisation Writing I II process Reading process q T1 T2 T1 T2 \u0394t r (1) p q s 0 1 1 p q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 0 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 0 1 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 1 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 Truth table 1 (identity  q  of) Initialisation Initialisation Writing I II process Reading process q T1 T2 T1 T2 \u0394t r (1) p q s 1 0 q 1 q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 0 1 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 0 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 Truth table 2 (identity  q  of) Initialisation Initialisation Writing I II process Reading process q T1 T2 T1 T2 \u0394t r (0) p q s 0 1 1 q q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 0 1 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 0 1 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 1 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 Truth table 1 (implication) Initialisation Initialisation Writing I II process Reading process p  + q T1 T2 T1 T2 \u0394t r (0) p q s 1 0 p q p  + q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 0 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 0 1 0 (PLRS, NHRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 1 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 Truth table 2 (implication) Initialisation Initialisation Writing I II process Reading process p  + q T1 T2 T1 T2 \u0394t r (1) p q s 0 1 q p p \u00b7  q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 0 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 0 1 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 1 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 Truth table 1 (inhibition of p) Initialisation Initialisation Writing I II process Reading process p \u00b7  q   T1 T2 T1 T2 \u0394t r (1) p q s 1 0 p q p  + q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 0 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 0 1 1 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 Truth table 2 (inhibition of p) Initialisation Initialisation Writing I II process Reading process p \u00b7  q T1 T2 T1 T2 \u0394t r (0) p q s 0 1 q p p \u00b7  q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 0 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 0 1 1 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 1 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS = 1 Truth table 1 (XOR) Initialisation Initialisation Writing I II process Reading process p \u2295 q T1 T2 T1 T2 \u0394t r (p) p q s 1 0 q 1 q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PLRS, NHRS) (PLRS, NHRS) >0 NHRS = 0 anti-LTD NLRS = 1 1 0 1 (PLRS, NHRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 0 1 1 (PLRS, NHRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 1 1 0 (PLRS, NHRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 Truth table 2 (XOR) Initialisation Initialisation Writing I II process Reading process p \u2295 q T1 T2 T1 T2 \u0394t r ( p ) p q s 0 1 1 q q |\u0394t| \u2265 t p t p  \u2264 |\u0394t| < \u221e |\u0394t| \u2192 \u221e 0 0 0 (PHRS, NLRS) (PLRS, NHRS) <0 PHRS = 0 LTD PLRS = 1 1 0 1 (PHRS, NLRS) (PLRS, NHRS) <0 NLRS = 1 anti-LTP NHRS = 0 0 1 1 (PHRS, NLRS) (PHRS, NLRS) >0 PLRS = 1 LTP PHRS = 0 1 1 0 (PHRS, NLRS) (PHRS, NLRS) >0 NHRS = 0 anti-LTD NLRS =1

Metadata:
- Claim Count in Document: 26.0
- Percentile: 97.0
- Lexical Diversity: 2.0
- Patent Class: 365.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['14038197', '14126397', '14126410', '14862187', '13408134']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.7378132889077801
- 35 USC 102 Novelty (BERT): 0.4841254092099337
- Combined Prediction Score: 0.7124445009379954
- Mean Citation Score: 162.47133200000005
- Max Citation Score: 177.66513
- Similarity Product: 121.28762805171132

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test