US4822984A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Process for electronic payment using a memory
Assignee: Individual
•
Filing: 1986-12-02
•
Granted: 1989-04-18
•
Expires: 2006-12-02
Abstract
Abstract Electronic payment method wherein a memory is used with two zones of equal capacity, a payment zone and a reloading zone. A stop-bit equal to "0" is written in the payment zone. A first payment of a certain amount is obtained by counting an amount equal to the payment of "1's" in the payment zone starting from the first bit in the memory. A "0" is written accordingly. A second payment of any other amount is obtained by counting another amount of "1's" equal to the new payment starting from the preceeding "0" and a "0" is written and so on until the rank of the bit to be written as "0" in the payment zone overshoots the rank of the stop-bit in the reloading zone. For a reloading operation a "0" is written in the reloading zone for all bits having the same rank as the "0" bits in the payment zone and a new stop-bit is determined and this is set equal to "0" by writing in the reloading zone.
Inventors
- 👤 Patrick Remery
- 👤 Jean-Pierre Boule
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 10:11
CPC Classifications
G; G07; G07F; G07F7/00; G07F7/08; G07F7/0866; G06; G06Q; G06Q20/00; G06Q20/30; G06Q20/34; G06Q20/343; G06Q20/3433; G07F7/02
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
295 words
An electronic payment method representative of credits in a memory comprising the steps of: writing in the memory a first set of 1 bits into a first zone denominated as a payment zone and an identical set of 1 bits in a second zone denominated as a reloading zone, said first and second zones having each a first bit and a last bit, with bits having a rank denominated from a first rank for the first bit to a last rank for the last bit, writing in said reloading zone a 0 in place of a 1, for obtaining an end point indicated as a first stop-bit, said first stop-bit having a given rank, a first counting step for a first payment operation, of a first amount in said payment zone from said first bit an amount of bits equal to 1, to a second bit having a second rank, equal to the rank of said first bit plus a number of bits indicative of said first amount, checking whether said second rank of said second bit is not larger than said rank of said first stop-bit, and if so changing said second bit from 1 to 0, a second counting step for a second payment operation, of a second amount, in said payment zone, from said second bit, which has been set equal to 0 after said first payment operation, a second amount of bits equal to 1, which gives a third bit having a third rank, checking whether said third rank of said third bit is not larger than said rank of said stop-bit, and if so changing said third bit from a 1 to 0, and repeating said second counting step until said rank of said stop-bit is exceeded by the count.
Claim 2
Dependent Claim
295 words
An electronic payment method representative of credits in a memory comprising the steps of: writing in the memory a first set of 1 bits into a first zone denominated as a payment zone and an identical set of 1 bits in a second zone denominated as a reloading zone, said first and second zones having each a first bit and a last bit, with bits having a rank denominated from a first rank for the first bit to a last rank for the last bit, writing in said reloading zone a 0 in place of a 1, for obtaining an end point indicated as a first stop-bit, said first stop-bit having a given rank, a first counting step for a first payment operation, of a first amount in said payment zone from said first bit an amount of bits equal to 1, to a second bit having a second rank, equal to the rank of said first bit plus a number of bits indicative of said first amount, checking whether said second rank of said second bit is not larger than said rank of said first stop-bit, and if so changing said second bit from 1 to 0, a second counting step for a second payment operation, of a second amount, in said payment zone, from said second bit, which has been set equal to 0 after said first payment operation, a second amount of bits equal to 1, which gives a third bit having a third rank, checking whether said third rank of said third bit is not larger than said rank of said stop-bit, and if so changing said third bit from a 1 to 0, and repeating said second counting step until said rank of said stop-bit is exceeded by the count.
Claim 3
Dependent Claim
107 words
An electronic payment method according to claim 1, further comprising: a first crediting operation wherein said first crediting operation comprises the steps of: writing into said reloading zone a 0 in place of a 1, for each bit having a same rank as a 0 bit, in said payment zone, writing into said payment zone a 0 instead of a 1, for a bit having the same rank as the rank of the stop-bit which is last in said reloading zone, writing in said reloading zone a 0 instead of a 1 at a point equal to the amount to be credited thereby obtaining a new stop-bit.
Claim 4
Dependent Claim
193 words
An electronic payment method according to claim 2, comprising further the steps of: counting for a payment operation, an amount after said first crediting operation, in said payment zone from said first bit an amount of bits equal to 1 while ignoring any bits equal to 0, which gives a check bit having a rank, and checking whether said rank of said check bit is not larger than said rank of said new stop-bit written by said first crediting operation, and if so changing said bit from 1 to 0, second payment counting step for any subsequent payment operation, of a subsequent amount, after said first crediting operation, in said payment zone, from said check bit, a second amount of bits equal to 1 ignoring the bits equal to 0, which gives a new check bit having a given rank, checking whether said rank of said check bit is not larger than said rank of said new stop-bit written by said first crediting operation, and if so changing said bit from 1 to 0, and repeating said second payment counting operation until said rank of said new stop-bit is exceeded by said count.
Claim 5
Dependent Claim
106 words
An electronic payment method according to claim 3 further comprising: a second crediting operation wherein said second crediting operation comprises the steps of: writing into said reloading zone a 0 instead of a 1, for each bit having a same rank as 0 bits written in said payment zone, writing into said payment zone a 0 instead of a 1, for the bit which has the same rank as the rank of the new stop-bit in said reloading zone, writing in said reloading zone a 0 instead of a 1 at a point equal to the amount to be credited thereby for obtaining a new stop-bit.
Claim 6
Dependent Claim
201 words
An electronic payment method according to claim 4, comprising further the steps of: counting for a first payment operation after a nth crediting operation, wherein n is an integer greater than 2, a first payment consisting of a first amount, in said payment zone from said first bit said first amount of bits equal to 1 ignoring bits equal to 0, which gives a nth bit having a nth rank, checking whether said nth rank of said nth bit is not larger than the rank of the new stop-bit written by said nth crediting operation, and if so changing said nth bit from 1 to 0, second counting step for any subsequent payment operation of a given amount, counting in said payment zone, from said nth bit said given amount of bits equal to 1, ignoring the bits equal to 0, which gives a (n+1)th bit having a (n+1)th rank, checking whether said (n+1)th rank of said (n+1)th bit is not larger than the rank of said new stop-bit written through said nth crediting operation, and if so changing said (n+1)th bit from 1 to 0, and repeating said second counting step until said rank of said new stop-bit is exceeded.
Claim 7
Dependent Claim
101 words
An electronic payment method according to claim 5, further comprising a (n+1)th crediting operation wherein said (n+1)th crediting operation comprises the steps of: writing into said reloading zone a 0 in place of a 1 for each bit equal to 1 having a same rank as a 0 bit written in said payment zone, writing into said payment zone a 0 in place of a 1 for a bit having the same rank as the rank of the new stop-bit in said reloading zone, writing into said reloading zone a 0 in place of a 1 for obtaining a new stop-bit.
Claim 8
Dependent Claim
56 words
An electronic payment method according to any one of claims 1 to 6, wherein any writing operation in said payment zone of said memory comprises the steps of: presenting a first code, comparing this code with a first confidential code, and allowing the writing only if the code presented is identical to said first confidential code.
Claim 9
Dependent Claim
54 words
An electronic payment method according to any of claims 1 to 6, wherein any writing operation in said reloading zone of said memory comprises the steps of: presenting a second code, comparing this code with a second confidential code, and allowing the writing if the code presented is identical to said second confidential code.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-04-17 | 1992-10-17 | 1993-04-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-04-17 | 1996-10-17 | 1997-04-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-04-17 | 2000-10-17 | 2001-04-18 | $7700.00 | Window Closed / Lapsed |